Data Structure Question Bank (University Papers)

302 Data Structure
Question Bank
(4 University Question Paper)
(January 2023, June 2023, March 2019, November 2019)
Q1. Attempt the following (2 marks each)

1.How to measure the performance of an algorithm? (June 2023, Jan 2023,2019)
2.What is a polynomial? How is it differ from structure? (june2023, Jan 2023,2019)
3.What is balance factor? how it is calculated?
4.What are abstract data type? (nov2023, Jan 2023,2019)
5.differensite array and structure?
6.What is space and time complexity?
7.What is pointer to pointer? (June 2023, Jan 2023)
8.What is self-referential structure?
9.What are application of stack?
10.List out different type of data structure.
11.What are the advantages of linked list over and array?
12.state the difference between stack and linked list?
13.what is the need for the header?
14.what is the use of calloc() function?
15.Difference between structure and polynomial?
16.what is time complexity? How to measure it?
17. what is searching? Give its type?
18.what is pointer? What are the arithmetic operations we can perform on the pointer?
19. State the types of graph?(2023,2019)
20. What is Ancestor of node?
21. What is spanning tree?
22. What is priority queue?
23. List out different types of tree.
24. What is complete binary tree?
25. What is adjacency of matrix?
26. How to calculate indegree and outdegree of a node in a graph.
27. What are the applications of graph
Q2. Attempt of the following (4m each)
1. Explain insertion sort technique with example? (june23, jan22)
2. What is stack? What are the various applications of stack? list operations perform on stack?
3. Explain various types of dynamic memory allocation functions? (march 2019)
4. What is an algorithm? explain its characteristics?
5. Write a function to delete first node from singly linked list?
6. What is linked list? explain its type in detail?
7. Explain different types of asymptotic notion in detail? (for Q3 also, Q4 19)
8. Differentiate array and structure?
9. Sort the following data by using insertion sort technique:
55, 19,1,200,99,5,10,45
10. Explain the structure of node in circular doubly linked list?
11. Write and algorithm for evaluation of postfix expression?
12. What is circular queue? How it is differ from static queue?(UNIVERSITY PAPER 2023,2019)
13. Construct Binary search tree of following data:
DEC, MAR, APRIL, JAN, JUN, AUG, SEPT, NOV
14. Explain BFS with an Example.(university paper 2023,2019)
15. Write a C Program for dynamic implementation of queue.
1. Write a function to create and display doubly linked list? (Q4 19)
2. Write a function to delete first node from singly linked list? (jan23, june23, Q4 19)
3. Write a function to reverse a string using stack? (Q4 also 19)
4. Write a c program for evaluation of polynomial. (jan23, nov19)
5. Explain selection sort technique with an example?
6. Write a function to add node at given position in singly linked list?
7. Write a c program for dynamic implementation of stack?
8. Write a function to create and display circular singly linked list?
9. Write a function to reverse singly linked list.
10. Write a c program for addition of two polynomials.
11. Write a function to remove last node from doubly linked list.
12. Write a function to add node at beginning of circular singly linked list?
13. Explain Binary search method with an example.(University QP 2023, Q.5 IN 2019)
1. Use merge sort technique on following data
45,85,96,78,34,12,49,38,18
2. Write a c program to create linked list with given number in which data part of each node contain
individual digits of the number?
3. Sort the following data by using quick sort:
10,5,75,62,49,58
4. Write a c program to traverse the linked list? (create and display)
5. Difference between queue and stack.
6. Explain Circular Queue? Explain it with example.
7. Construct Binary Search tree of following data.
RAM, SITA, AMIT, JOEL, IVAN, ASHA
8. For given data, construct a binary search tree:
15, 30, 20, 5, 10, 2, 7
9. What is Dequeue? Explain its operation with example.
10. Construct binary search tree for the following data:
Pune, Pimpri, Uruli, Walti, Akurdi, Solapur, Hadapsar, Tarde

1. Convert the following expression into postfix:
i] A/B$CD*E-A*C
ii] (A+B*C-D)/E$F
2. Convert the following expression into Postfix:
i] (A+B) *C-D
ii] A+B*C-D/E*F
3. Convert the following expression into Postfix:
i] (A+B) *C/D^E
ii](A+D)-C+B^E/F
4. Define the following terms:
i) Directed graph
ii) Strict binary tree
iii) Cyclic graph
5) What is degree of vertex? Find the inderee and outdegree of following graph of each
vertex(University QP Jan 2023, june 2023)
(Any graph can be given in question paper)
6) Define the following terms:
i) Degree of node
ii) Child node
iii) Path
------- ALL THE BEST---------

Data Structure Question Bank (University Papers)

Uploaded by

Data Structure Question Bank (University Papers)

Uploaded by

302 Data Structure

Q1. Attempt the following (2 marks each)

Q5. Attempt of the following (3m each)

------- ALL THE BEST---------

You might also like