[go: up one dir, main page]

0% found this document useful (0 votes)
30 views2 pages

UnitTest1 DSA Paper

Uploaded by

bsjadhav.foe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views2 pages

UnitTest1 DSA Paper

Uploaded by

bsjadhav.foe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Dattakala Shikshan Sanstha’s

DATTAKALA GROUP OF INSTITUTIONS


| NAAC Accredited & ISO Certified |
Approved by AICTE - New Delhi, DTE - Mumbai, Recognized by Govt. of Maharashtra
Affiliated to Savitribai Phule Pune University, Pune and M.S.B.T.E., Mumbai
| DTE Code: 6628 | MSBTE Code: 1712 | AICTE ID: 1-5986711 | AISHE Code: C-44576

DEPARTMENT OF COMPUTER ENGINEERING


UNIT TEST 1
Data Structures and Algorithms
(2019 Pattern) (210252) (Semester - II)
Date : 14/02/2024
Time : 1 Hour Max. Marks : 30
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4.
2) Figures to the right indicate full marks.
3) Neat figures must be drawn wherever necessary.
4) Assume suitable data if required.
5) Use of non-programmable scientific calculator is allowed.

Q1 a) Write a program to implement inorder traversal in C++. [7]


b What is Binary Tree? [8]
)
From the given traversals construct the binary tree :
Inorder : EICFJBGDKHL postorder : IEJFCGKLHDB
Draw the binary tree and write preorder, inorder and postorder traversal.
OR
Q2 a) Write a short notes on Huffman Coding. Construct Huffman's Tree and the [8]
prefix free code for all characters :
Symbol A C E H I
Frequency 3 5 8 2 7

b Define Basic Terminologies of Trees with example. [7]


)
Q3 a) What is Binary Search Tree? Explain with example. Enlist operation on Binary [5]
search tree.
b Explain the concept of Postorder Tree Traversal with example. [5]
)
c) Write Difference between General tree and Binary tree. [5]
OR
Q4a) Explain Insertion operation on Binary Search Tree with example. [7]

541/2, 527, Off Pune- Solapur Highway, Swami-Chincholi (Bhigwan), Tal - Daund, Dist. – Pune 413130, Maharashtra
| Email: dkgoi@dattakala.edu.in | Web: www.dattakala.edu.in | Contact No. 9673002923, 9673400500 | For More Information:
9673002929 |
b) Explain the concept of Breadth first searchDattakala
of binary tree with
Shikshan example.
Sanstha’s [8]
DATTAKALA GROUP OF INSTITUTIONS
| NAAC
All TheAccredited
Best & ISO Certified |
Approved by AICTE - New Delhi, DTE - Mumbai, Recognized by Govt. of Maharashtra
Affiliated to Savitribai Phule Pune University, Pune and M.S.B.T.E., Mumbai
| DTE Code: 6628 | MSBTE Code: 1712 | AICTE ID: 1-5986711 | AISHE Code: C-44576 |

You might also like