3rd Sessional
Semester 4th : Computer Engineering
Subject: Data Structure Using C
Section-A
Note: Attempt any five questions
Q 1
i. Define binary tree and how to represent binary tree.
ii. Name Different type of tree.
iii. Explain Selection sort with suitable example.
iv. Differentiate between linear search and binary search.
v. How to delete node in binary tree?
vi. Arrange following number in ascending order using bubble sort.
14, 33, 27, 35, 10.
Section- B
Note: Attempt any One Question.
Q 2. What is a Heap Sort? Explain.
Q 3. Given binary tree. Write Pre-order , In-order, Post-order.
Section- B
Note: Attempt any One Question.
Q 2. What is a Heap Sort? Explain.
Q 3. Given binary tree. Write Pre-order , In-order, Post-order.
0 Comments