BE-III/New/PCC-IT 301/R/2020-21/UIT/BU

B.E Odd Semester (3rd) Examinations 2020-21

Subject: Data Structure

Code: PCC-IT 301(New)
Time: 3 Hours Full Marks: 70
Instructions: Answer any four from Group A and any five from Group B
Answer all part of a question in same place.
Send this answer script to the mail id: uit.pccit301.new.it.reg@gmail.com

Group A (answer any four from Q. no 1 to 6) 4×5=20

Q.NO. QUESTIONS MARKS

1. What are the advantages and dis advantages of a linked list over an array? 5

2. Construct a binary tree from the following traversal sequences 5

Pre-order: 50,40,30,45,60,55,58,56,65
In-order: 30,40,45,50,55,56,58,60,65

3. Compare and contrast between Dequeue and Priority Queue. 5

4. Draw all-possible BST with the values 1,2,3,4 5

5. Write a recursive algorithm for Binary Search 5

6. Illustrate the operation of the algorithm INSERTION SORT on the set of numbers 5
S = {30, 12 13, 13, 44 12, 25, 13}. How many comparisons are performed by the
algorithm?

Group B (answer any five from Q. no 7 to 13) 5×10=50

Q.NO. QUESTIONS MARKS

7. Why we need to a binary tree which is height balanced? Construct a BST with 10
following values. Make it height balanced.
63,9,19,27,18,108,99,81

8. a) Convert the given infix notation to a prefix notation using stack 5+5=10
Expression: (A+B^C) *D+E^5
(^ is the highest precedence operator) State the rules.
b) Write a C program to evaluate the following input? 5 2 * 3 3 2 + * +

9. a) Apply Quick Sort technique to sort the following array 5+5=10

55, 11, 33, 88, 44, 99, 22, 66, 77
b) How many comparisons are needed to sort an array of length 5 if a straight

Semester: 3rd Year: 2020-21 Subject Code: PCC-IT 301(New)

 BE-III/New/PCC-IT 301/R/2020-21/UIT/BU

B.E Odd Semester (3rd) Examinations 2020-21

Subject: Data Structure

Code: PCC-IT 301(New)
Time: 3 Hours Full Marks: 70
Instructions: Answer any four from Group A and any five from Group B
Answer all part of a question in same place.
Send this answer script to the mail id: uit.pccit301.new.it.reg@gmail.com

selection sort is used and array is already in the opposite order? Justify your answer.
10. a) Insert the keys 78, 52, 81, 40, 33, 90, 85,20 and 38 in a B-Tree with order 3 7+3=10
b) Compare B-Tree and B+ tree.
11. a) Consider a simple Hash function ‘Key mod 11’ and sequence of keys as 56, 700, 7+3=10
66, 12, 34, 47, 94, 78, 55 and 101. Assume that 10 free memory places are
available to store the records.
Explain the Open Addressing method with the given values to overcome the
collision.
b) State the disadvantage of this method.
12. Consider the following circular priority queue. 5+5=10
1 2 3 4 5
1| A
2|BC D
3| E F
4|I G H
Do the following operations and show the Front and Rear pointer values after each
operation.
i) insert J K L with priority 1 ii) delete 2 elements with priority 4
iii) insert M N O with priority 2 iv) insert P Q with priority 3

13. a) Write an algorithm to remove duplicate nodes (nodes with duplicate value) from 5+5=10
a sorted linked list.
b) Find out the DFS sequence for the following graph.

Semester: 3rd Year: 2020-21 Subject Code: PCC-IT 301(New)