Previous Year Very Short Questions of DS (B-TECH electronics and communication engineering 5th)

  1. Home
  2. ptu
  3. b-tech
  4. ece
  5. 5th
  6. 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. Differentiate between linear and non-linear data structures.
  2. Find the infix and prefix equivalents of the following expressions and evaluate the same showing contents of Stack at various stages. a) 5 12 3 2 2  * / – b) 16 4 2 – * 12 5 2 – / +
  3. Define the term Heap and its use.
  4. What is dangling pointer and the solution for handling them?
  5. What do you mean by the complexity of an algorithm?
  6. Discuss priority queue and its use.
  7. What is Graph? How it is different from a tree?
  8. What do you mean by recursion and its demerits?
  9. What is dynamic memory management?
  10. Differentiate between stacks and queues.
  11. What is the principle of recursion. Explain
  12. b) What do you understand by polish notation. Explain
  13. What do the terms LIFO and FIFO means. Explain
  14. Give an example that shows how a stack is used by a computer system.
  15. How Graph is represented in memory
  16. What is a hashing technique
  17. What is a dequeue
  18. How array elements are accessed in two dimensional array
  19. How two strings can be concatenated
  20. What id double hashing
  21. What is big O notation? Explain its significance.
  22. How does an array differ from an ordinary variable?
  23. Define Linked List.
  24. What is the prefix form of the following expression? A–B/ (C * D ^ E)
  25. Which data structure is used for implementing recursion and why?
  26. What do you mean by B-tree?
  27. Suppose H is a complete binary tree with n elements then in what conditions, H is called a maxheap?
  28. What is the time complexity of Heap sort algorithms?
  29. For an undirected graph with n vertices and e edges, what will be the sum of the degree of each vertex?
  30. What is the significance of pointer in linked list?