Previous Year Very Short Questions of DS (BCA 3rd)

  1. Home
  2. ptu
  3. bca
  4. 3rd
  5. ds
Watch More

Data structures

Previous year question paper with solutions for Data structures

Our website provides solved previous year question paper for Data structures . 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 www.brpaper.com 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.

Question papers (year-wise)
Very short questions
Print this page
  1. What is Big O Notation?
  2. How does Binary Search differ from Linear Search?
  3. Define Sorting
  4. Differentiate between Stacks and Queues
  5. What is the role of Polish Notation in arithmetic expression evaluation?
  6. What is the function of Dynamic Storage Management?
  7. What is the significance of Circular Linked List?
  8. Name and explain different types of Queues in Data Structures
  9. List any three applications of trees.
  10. What do you mean by Depth of a tree?
  11. Describe linear and non-linear data structures.
  12. Describe in brief about the traversing, sorting and searching.
  13. What do you mean by time-space trade-off?
  14. What is the difference between FIFO lists and LIFO lists?
  15. What is overflow and underflow?
  16. Differentiate between linear and binary search
  17. Define recursion
  18. Define Polish Notation
  19. What is degree of a node in a tree?
  20. What are circular queues?
  21. Explain the enqueue operation on a queue?
  22. Explain the time space tradeoff between array and linked list?
  23. Write down the 2 basic operations to sort a list of numbers?
  24. Write down limitations of the array data structure?
  25. How is a stack different from a queue?
  26. What is tree traversal?
  27. Which data structure is most suited for bubble sort and why?
  28. Draw the structure of node of a doubly linked list?
  29. Define Insertion sort?
  30. What are the front and rear pointers of a queue?