Q1. Which data structure uses FIFO (First In First Out) principle?
📘 View Explanation
Q2. Which of the following is a LIFO (Last In First Out) data structure?
📘 View Explanation
Q3. Which data structure is best for implementing recursion?
📘 View Explanation
Q4. Which traversal is used in Binary Search Tree to get data in sorted order?
📘 View Explanation
Q5. Which of the following is not a linear data structure?
📘 View Explanation
Q6. Which data structure is used for implementing BFS (Breadth First Search)?
📘 View Explanation
Q7. Which data structure is used for implementing DFS (Depth First Search)?
📘 View Explanation
Q8. What is the worst-case time complexity of QuickSort?
📘 View Explanation
Q9. Which of the following is an application of stack?
📘 View Explanation
Q10. Which data structure is used for implementing priority queue?
📘 View Explanation
Q11. Which hashing technique resolves collision by storing multiple elements in the same bucket?
📘 View Explanation
Q12. Which of the following is not a self-balancing binary search tree?
📘 View Explanation
Q13. In a circular queue of size n, how many elements can be inserted?
📘 View Explanation
Q14. Which of the following is the fastest data structure for searching?
📘 View Explanation
Q15. Which of the following sorting algorithms is stable?
📘 View Explanation
Q16. Which tree is used in database indexing?
📘 View Explanation
Q17. Which data structure is used for backtracking algorithms?
📘 View Explanation
Q18. Which traversal technique visits root node first, then left subtree, then right subtree?
📘 View Explanation
Q19. What is the height of a complete binary tree with n nodes?
📘 View Explanation
Q20. Which operation is not allowed in a Queue?
📘 View Explanation