Data Structure Quiz (Set 17) Data Structures (Set 7) 1 / 10 What is 'hash table'? A table that stores elements in a sorted manner A table used to implement stacks and queues A data structure that stores key-value pairs and uses a hash function to map keys to values and ensure fast retrieval A table used to implement binary search trees 2 / 10 What is 'bipartite graph'? A graph that has two connected components A graph where each node is connected to every other node A graph where nodes can have multiple parents A graph whose nodes can be divided into two sets such that no two nodes in the same set are connected by an edge 3 / 10 What is 'spanning tree' in graph theory? A tree where all nodes have the same height A tree where each node has multiple parents A tree that includes all nodes of the original graph and a subset of its edges, forming a connected subgraph A tree that includes the longest path in the graph 4 / 10 What is 'circular queue'? A queue where elements are stored in a circular manner, and the front and rear pointers wrap around A queue that follows the First In First Out (FIFO) principle A queue that follows the Last In First Out (LIFO) principle A queue that stores elements in a linear manner 5 / 10 What is 'radix sort'? A sorting algorithm that uses the idea of divide and conquer A sorting algorithm that repeatedly compares and sorts pairs of adjacent elements A non-comparative sorting algorithm that sorts integers by processing individual digits A sorting algorithm that works by distributing the elements into a set of buckets and then sorting each bucket 6 / 10 What is 'trie' used for? To implement stacks To implement queues To store a dynamic set of strings efficiently, allowing for fast insertion, deletion, and search operations To implement hash tables 7 / 10 What is a 'tree node'? A node with multiple parents in a tree A node with multiple children in a tree A node with no parent in a tree A single element in a tree data structure, which can have children nodes 8 / 10 What is the purpose of 'adjacency list' in graph representation? To store the values of nodes in a graph To store the edges between nodes in a graph To store the neighbors of each node in a graph To store the weights of edges in a graph 9 / 10 What is 'sparse matrix'? A matrix with many non-zero elements A matrix with few non-zero elements A matrix with only diagonal elements A matrix with elements that are all zero 10 / 10 What is 'priority queue'? A queue that follows the First In First Out (FIFO) principle A queue that follows the Last In First Out (LIFO) principle A queue that stores elements in a circular manner A queue where each element has a priority associated with it and the element with the highest priority is dequeued first Your score isThe average score is 0% 0% Restart quiz