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

  1. Home
  2. ptu
  3. b-tech
  4. it
  5. 3rd
  6. datas
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 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. State the need of data structures.
  2. What are the advantages of Linked List over arrays?
  3. What is big ‘O’ notation?
  4. What is the difference between Linear and non-linear data structure?
  5. List the applications of Stack and Queue.
  6. Explain why binary search cannot be performed on a linked list.
  7. What is threaded binary tree?
  8. What is hashing?
  9. What is breadth-first traversal?
  10. Write any two applications of graph.
  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. Memory leaks
  22. Data structure versus data type
  23. Sparse matrix
  24. Stacks and recursive functions
  25. Linked representation of queue
  26. AVL Tree
  27. Representation of graph in memory
  28. Rehashing
  29. Algorithm complexity
  30. Dynamic memory allocation