Unit 5: Data Structures - Practice Quiz

1 Which of the following data structures is considered a non-linear data structure?

2 In the context of algorithm analysis, which notation represents the asymptotic upper bound of the time requirement?

3 What is the primary advantage of a Linked List over an Array?

4 In a Singly Linked List, what is the time complexity to access the element?

5 Which type of Linked List allows traversal in both forward and backward directions?

6 A pointer in a linked list that does not point to any valid memory location is generally referred to as:

7 If a circular linked list has a pointer to the last node, what is the time complexity to insert a node at the beginning of the list?

8 Which data structure follows the LIFO (Last In, First Out) principle?

9 What is the result of evaluating the postfix expression: ?

10 Which data structure is implicitly used by the system to handle function calls and recursion?

11 In a Queue implemented using a circular array of size , the condition for the queue being full is:

12 Which operation removes an element from the front of a Queue?

13 A double-ended queue (Deque) allows insertion and deletion at:

14 Implementing a Queue using two Stacks requires how many stacks?

15 What is the maximum number of nodes in a binary tree of height (where the root is at height 0)?

16 Which tree traversal visits the root node, then the left subtree, and finally the right subtree?

17 In a Binary Search Tree (BST), the Inorder traversal produces:

18 What is the worst-case time complexity for searching in an unbalanced Binary Search Tree?

19 An AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees cannot be more than:

20 The number of edges in a tree with nodes is always:

21 Which data structure is commonly used to implement Breadth-First Search (BFS) in a graph?

22 Which data structure is commonly used to implement Depth-First Search (DFS) in a graph?

23 In a graph represented by an Adjacency Matrix , if there is an edge between vertex and vertex , then:

24 What is the space complexity of an Adjacency List representation for a graph with vertices and edges?

25 Dijkstra's algorithm is used for:

26 Which algorithm is used to find the Minimum Spanning Tree (MST) of a graph?

27 Topological Sort is applicable to which type of graph?

28 In an undirected graph, the sum of the degrees of all vertices is equal to:

29 A complete binary tree has a property that it is filled:

30 How many different binary trees can be constructed with distinct nodes?

31 Which data structure is best suited for implementing a Priority Queue?

32 In a Max-Heap, the value of a parent node is always:

33 If a binary heap is stored in an array (0-indexed), the left child of the node at index is located at:

34 What is the time complexity to insert a new element into a binary heap with elements?

35 Heap Sort has a worst-case time complexity of:

36 A situation where two different keys map to the same index in a Hash Table is called:

37 Which of the following is a technique to resolve hash collisions?

38 In Open Addressing, which probing method calculates the interval between probes using a second hash function?

39 The Load Factor () of a hash table is defined as:

40 What is the average time complexity for Search, Insert, and Delete operations in a well-implemented Hash Table?

41 Which traversal of a Binary Search Tree (BST) sorts the elements?

42 What is the height of a balanced binary search tree with nodes?

43 Converting a general tree to a binary tree typically involves the representation:

44 Which of the following data structures is most appropriate for a dictionary implementation (looking up definitions by words)?

45 A graph is considered connected if:

46 In a binary heap, the 'Heapify' operation usually takes time proportional to:

47 The post-fix form of the expression is:

48 Which data structure is used to check for balanced parentheses in an expression?

49 Deletion of a node from a Doubly Linked List involves changing how many pointers (assuming the node is not head/tail)?

50 In the context of Hashing, what is a 'Perfect Hash Function'?