Previous Year Very Short Questions of DSPM (B-TECH information technology 3rd)

  1. Home
  2. ptu
  3. b-tech
  4. it
  5. 3rd
  6. dspm
Watch More

Data structures and programming methodology

Previous year question paper with solutions for Data structures and programming methodology

Our website provides solved previous year question paper for Data structures and programming methodology . Doing preparation from the previous year question paper helps you to get good marks in exams. From our DSPM 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 are the advantages and disadvantages of linked list over Arrays?
  2. Which data structure will be used in recursion?
  3. Define height balanced tree with example.
  4. A full binary tree with 2n+l node contains how many leaf nodes?
  5. Graphically show the Deletion of an element from the circular queue implemented as linked list.
  6. A linear Array A is given with lower bound as 1. If address of A[20] is 360 and A[30] is 390, then find address and word size of A[16].
  7. Define sets. How sets are represented in memory?
  8. Define Big Omega and Theta notation.
  9. What are the initial conditions required to implement binary search?
  10. What is a file? What are the basic operations performed on file system?
  11. State the Criteria used for evaluating the suitability of a particular data structure for a given application.
  12. Which data structure is used to implement DFS algorithm and why?
  13. When do we use Priory queues?
  14. Define the term File-structure and File-organization.
  15. What are the advantages and disadvantages of representing a group of items as an array verses a linear linked list?
  16. What is Graph and name its applications?
  17. Describe the term Algorithmic complexity and time-space tradeoff.
  18. Derive an expression for addressing an arbitrary element in 2-D array.
  19. Can you traverse a single linked list in backward direction? Justify your answer.
  20. What are the various operations that can be performed on sets?