Previous Year Very Short Questions of DS (DIPLOMA information technology 4th)

  1. Home
  2. psbte
  3. diploma
  4. it
  5. 4th
  6. ds
Watch More

Data structure using c

Previous year question paper with solutions for Data structure using c

Our website provides solved previous year question paper for Data structure using c . 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. FIFO stands for____________.
  2. BST stands for _______
  3. Nodes that do have any children are called _______ nodes.
  4. Deletion operation in stack is known as _________.
  5. The tree is ________data structure.
  6. An array is collection of _________data items
  7. Linked list contains two pieces of information: data and _______________.
  8. A stack is represented in computer by using _________________.
  9. Prefix notation of A – B / C is __________________.
  10. Define algorithm. .
  11. LIFO stands for __________________and FIFO stands for____________________.
  12. Write the formula to find the address of a location in an array.
  13. Define BST.
  14. What do you mean by overflow?
  15. Draw an Extended Binary Tree.
  16. What is recursion?
  17. Node of a linked list contains _____________ and ____________.
  18. Define dequeue.
  19. What do you mean by height of a tree?
  20. __________ Search divides the list into two parts and can search from a __________ list.
  21. Variable that stores address of another variable is called ____________.
  22. Stack is also known as ________.
  23. FIFO stands for _________.
  24. C language is called __________.
  25. Node with no children is called _________.
  26. Mainly used looping constructs are ________, _______ and _______.
  27. Array is a non-linear data structure. (T/F).
  28. Array Length = __________.
  29. The linked list is a linear collection of ___________.
  30. Types of searching are _________and _________.