AVANTHI INSTITUTE OF ENGINEERING & TECHNOLOGY

TAMARAM,MAKAVARAPALEM MANDAL,VISAKHAPATNAM DIST.

I MCA- I SEM MID -1I SUBJECTIVE TEST-1I

SUBJECT: DATA STRUCTURES (R20)
Date:-29-1-2024 Time: 2 hours MAX.Marks:40
Answer all the following questions
1. a) Explain about different tree traversal techniques.
b) Explain the Prims algorithm for generating minimum cost spanning tree.
2. Construct a Binary Search Tree by inserting the following sequence of elements
10,12,5,4,20,8,7,15,13 starting from an empty tree.
3. Explain the step-by-step procedure for sorting the following unordered list of elements 52, 37, 63,
14, 17, 8, 6, 25using Quick sort
4. What is Hash function? Explain about open Hash & closed Hash collision?
b) Discuss the procedure to convert infix expression to postfix expression with the following
expression: ((A –(B+C) * D) / (E+F))

AVANTHI INSTITUTE OF ENGINEERING & TECHNOLOGY

TAMARAM,MAKAVARAPALEM MANDAL,VISAKHAPATNAM DIST.

I MCA- I SEM MID -1I SUBJECTIVE TEST-1I

SUBJECT: DATA STRUCTURES (R20)
Date:-29-1-2024 Time: 2 hours MAX.Marks:40
Answer all the following questions
1. a) Explain about different tree traversal techniques.
b) Explain the Prims algorithm for generating minimum cost spanning tree.
2. Construct a Binary Search Tree by inserting the following sequence of elements
10,12,5,4,20,8,7,15,13 starting from an empty tree.
3. Explain the step-by-step procedure for sorting the following unordered list of elements 52, 37, 63,
14, 17, 8, 6, 25using Quick sort
4. What is Hash function? Explain about open Hash & closed Hash collision?
b) Discuss the procedure to convert infix expression to postfix expression with the following
expression: ((A –(B+C) * D) / (E+F))