Practice Data Structure Questions and Answers

• Which of the following allows dynamic memory allocation?
• RISC stands for:
• Which memory is the fastest?
• Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?
• Which traversal method is best for copying a binary tree?
• The amortized cost of appending an element at the end of a dynamic array is:
• Which data structure uses FIFO (First In, First Out)?
• The time complexity of binary search is:
• Which traversal of binary tree gives nodes in sorted order?
• Which algorithm is used for shortest path in graphs?
• Which sorting algorithm has O(n log n) average case?
• Which data structure is used in recursion?
• Hashing is used for:
• Which data structure is used in BFS traversal of graphs?
• Best case complexity of insertion sort is:
• Which heap property is correct?
• Which algorithm is used for minimum spanning tree?
• Which search algorithm is complete but not always optimal?
• Which data structure is used for undo operations in text editors?
• Time complexity of heap sort is:
• Which algorithm constructs a suffix tree in linear time?
• Union-Find with path compression achieves nearly constant time because its complexity is:
• Fibonacci heaps support which operation in O(1) amortized time?
• Tarjan’s algorithm is used to find:
• KMP improves naive string matching by:
• Which algorithm is used for computing Max-Flow in a network?
• Deletion in Red-Black Trees maintains balance using:
• Suffix Trees are useful for:
• Union-Find with Path Compression achieves nearly:
• Fibonacci Heaps support Decrease-Key in:
• Tarjan’s Algorithm finds:
• KMP pattern matching avoids:
• Max-Flow Min-Cut theorem states:
• Deletion in Red-Black Tree may require:
• For Dijkstra’s algorithm on a graph with non-negative weights, which data structure yields the best time complexity for dense graphs?
• What is a fundamental characteristic of a singly linked list?
• To insert a new node at the beginning of a singly linked list, which of the following operations is typically performed?
• What is the time complexity for inserting a node at the end of a singly linked list if you only have a pointer to the head?
• In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?
• Which graph traversal algorithm uses a queue to explore nodes layer by layer?