ROLL NO:
(To fill the roll no is compulsory)
ODD SEMESTER EXAMINATIONS: 2023-24
B. Tech CSE/ B. Tech + M. Tech CSE/ B. Tech + MBA CSE
Semester: III
SUBJECT CODE: BCS301
DATA STRUCTURES
Time: 3 Hours Maximum Marks: 50
____________________________________________________________________
NOTE: THE QUESTION PAPER CONTAINS THREE SECTIONS.
ATTEMPT ALL THE SECTIONS.
SECTION- A
NOTE: Attempt all parts of the following question. (10 Marks)
Q. 1. Answer the following questions: (1×5 = 5 Marks)
i. Explain data structure in detail.
ii. Define stack with its operations.
iii. What did you mean by time and space complexity?
iv. What is Graph?
v. Define Parallel Edge, Self Loop.
Q. 2. Answer the following questions: (1×5 = 5 Marks)
i. What is an Algorithm?
ii. What is complete graph, weighted graph?
iii. What is Prim’s algorithm?
iv. What did you mean by abstract data type?
v. Define the term Binary tree.
(01) P.T.O.
SECTION-B SECTION-C
NOTE: Attempt all the questions. (5×2×2 = 20 Marks) NOTE: Attempt all the questions. (10×2 = 20 Marks)
Q.3. (i) (a) Consider an array A=7,5,2,8,16 delete the last element. Also write Q.5. (a) Convert infix form to Post fix form using stack-
down its Program in C. (a+(b*c-(d/e^f)*g)*h)
OR OR
(b) Define tree, AVL tree, complete binary tree and how balance (b) Use prim’s algorithm to determine minimum spanning tree
factor works in AVL tree.
(ii) (a) Sort these elements with the help of Selection sort-
A=5,2,1,4,3,6.
Also write down the algorithm of selection sort.
OR
(b) Write down the algorithm to compute the number of element and
sum of element in a linear link list.
Q.4. (i) (a) Write the merits and demerits of static and dynamic memory Q.6. (a) The preorder and inorder traversal of binary tree is given below,
allocation techniques. Compare array and inked list construct the tree-
Preorder: FAEKCDHGB Inorder: EACKFHDBG
OR OR
(b) What is stack? Discuss the implementation of stack using array. (b) Define TOWER of HANOI problem with its algorithm, and with an
example.
And also define FULL and EMPTY condition of stack.
(ii) (a) Write a program in ‘C’ to implement circular queue using doubly
linked list.
OR
(b) Write an algorithm to implement binary search tree.
(02) (03)
