Previous Year Very Short Questions of Ds (MSC-IT 2nd)

Data structure

Previous year question paper with solutions for Data structure

Our website provides solved previous year question paper for Data structure . Doing preparation from the previous year question paper helps you to get good marks in exams. From our Ds question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

These Questions are downloaded from You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.

Print this page
  1. Doubly link List
  2. Hashing
  3. AVL Tree
  4. Tree Traversal
  5. Dynamic Memory Management
  6. Circular Queue
  7. Arrays of pointers
  8. Priority Queue
  9. Efficiency of Searching Algorithms
  10. Height of a Tree
  11. List various notations that are used to represent algorithmic complexity
  12. What is the difference between PUSH and POP operation of stacks?
  13. What is static memory management?
  14. What is the difference between array and linked list?
  15. Name any two operations of queues
  16. Define B+ tree
  17. What are priority queues?
  18. Write the difference between binary tree andbinary search tree.
  19. What is the role of adjacency lists in calculating the shortest path in graphs?
  20. What is the worst case time complexity of heap sort?