EASTDELTAUNIVERSITY (EDU)

Final Examination–Fall-2022
School of Science, Engineering and Technology
Department of Computer Science and Engineering
Course Title: Data Structure
Course Code: CSE 211

Time: 1.5 Hours Full Marks: 30

Answer any five (6) questions from the following: [5X6=30]

1. Write a brief note on the following: (i) Representation of records in memory,
(ii) Representation of one-dimensional array in memory.
2. What is stack? What are the basic operations associated with stack?
3. Convert following arithmetic infix expression into postfix by using stack:
A*(b + c) + (b/d) * a + z * u
4. What is Queue? Explain linked representation of Queue.
5. Define binary search tree. Write an algorithm to search an element in Binary search tree.
6. (b) Write a brief note on Traversing a binary tree. Find the preorder and post order traversal of
Following tree.

7. Suppose the following list of letters is inserted in order into an empty binary search tree :
J, R, D, G, T, E, M, H, P, A, F, Q
(i) Find the final Tree T.
(ii) Find the preorder, inorder and post order traversal of T.
8. Write a C program to implement multiple stacks using single array.
9. What is a circular queue? Implement insert and delete operations.

Page 1 of 1