All Quizes for ADS: Test Your Understanding

What is the time complexity of inserting a new element at the beginning of a linked list?

• a) O(1)

• b) O(log n)

• c) O(n)

• d) O(n log n)

What is the degree of a vertex in a graph?

• a) The number of edges connected to it.

• b) The number of vertices adjacent to it.

• c) The number of paths that pass through it.

• d) The distance from the root node to the vertex.

What is an adjacency list?

• a) A list of all edges in a graph.

• b) A list of all vertices in a graph.

• c) A list of vertices adjacent to a given vertex.

• d) A list of paths in a graph.

What is an adjacency list used for in graph representation?

• a) Representing the connections between vertices using a list of lists.

• b) Storing the weights of edges in a graph.

• c) Creating a list of all vertices in a graph.

• d) Storing the degree of each vertex in a graph.

What is the time complexity of searching for a specific element in a sorted array using binary search?

• a) O(1)

• b) O(log n)

• c) O(n)

• d) O(n log n)

What is an adjacency matrix used for in graph representation?

• a) Storing the weights of edges in a graph.

• b) Representing the connections between vertices using a 2D array.

• c) Creating a list of all vertices in a graph.

• d) Storing the degree of each vertex in a graph.

What is the time complexity of the peek operation in a Queue when the queue is empty?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What is the main advantage of using an adjacency list over an adjacency matrix for graph representation?

• a) It is more efficient for finding the degree of a vertex.

• b) It requires less memory for sparse graphs.

• c) It is more efficient for performing graph traversal algorithms.

• d) It allows for easy checking of the existence of an edge between two vertices.

What is the time complexity of finding the longest common subsequence of two strings?

• a) O(n)

• b) O(n^2)

• c) O(n log n)

• d) O(2^n)

What is the time complexity of deleting an element at the end of an array list?

• a) O(1)

• b) O(log n)

• c) O(n)

• d) O(n log n)