Previous Year Very Short Questions of DATAS (B-TECH computer science engineering 3rd)

  1. Home
  2. ptu
  3. b-tech
  4. cse
  5. 3rd
  6. datas
Watch More

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 DATAS 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. Memory leaks
  2. Data structure versus data type
  3. Sparse matrix
  4. Stacks and recursive functions
  5. Linked representation of queue
  6. AVL Tree
  7. Representation of graph in memory
  8. Rehashing
  9. Algorithm complexity
  10. Dynamic memory allocation
  11. How many words of three different letters can be formed from the letters of the word ‘COMPUTER’?
  12. Give an example of semi group but not monoid
  13. Prove that A – B = A  B c .
  14. Is every relation which is symmetric and transitive on a set A, always reflexive? Why or why not?
  15. Define ring.
  16. What is the minimum number of NOR gates required to construct an AND gate? Construct it.
  17. Define graph isomorphism. Give an example of isomorphic and non-isomorphic graphs.
  18. A graph consists of four vertices of degree three and an isolated vertex. Find the number of edges in the graph.
  19. Define Euler graph.
  20. Define Chromatic number
  21. What is usage of pointers?
  22. Relate data structures with data types?
  23. Discuss double Linked List?
  24. What are postfix expressions?
  25. Define debugging?
  26. Discuss B-trees?
  27. What is adjacency Matrix?
  28. Write a short note on Hash Tables?
  29. What are advantages of insertion sort?
  30. What are non recursive procedures?