Computer Science A Level

What is a graph algorithm?

• A graph algorithm is a set of instructions or procedures used to solve problems on a graph data structure.

• A graph algorithm is a data structure used to store graphs.

• A graph algorithm is a programming language.

• A graph algorithm is a type of mathematical equation.

Name one data structure commonly used in graph algorithms.

• binary tree

• stack

• adjacency list

• adjacency matrix

What is the purpose of sorting algorithms?

• The purpose of sorting algorithms is to arrange data in a specific order.

• To search for specific data in a list

• To randomly shuffle data

• To delete data from a list

What is the time complexity of the bubble sort algorithm?

• O(n)

• O(n^2)

• O(log n)

• O(n log n)

What is the difference between breadth-first search and depth-first search?

• The main difference is the order in which they explore nodes.

• The main difference is the number of nodes they explore.

• The main difference is the data structure they use.

• The main difference is the time complexity.

What is the main advantage of using an adjacency list to represent a graph?

• Easier implementation of graph algorithms.

• Memory efficiency

• Faster traversal of the graph.

• Ability to represent weighted edges.

What is the worst-case time complexity of quicksort algorithm?

• O(n^2)

• O(1)

• O(n)

• O(nlogn)

What is the difference between stable and unstable sorting algorithms?

• Stable sorting algorithms have a higher time complexity than unstable sorting algorithms.

• Stable sorting algorithms sort elements in ascending order, while unstable sorting algorithms sort elements in descending order.

• Stable sorting algorithms maintain the relative order of elements with equal keys, while unstable sorting algorithms do not guarantee the relative order of elements with equal keys.

• Stable sorting algorithms use more memory than unstable sorting algorithms.

What is the time complexity of Dijkstra's algorithm?

• O(V^2)

• O(V^3)

• O(E^2)

• O((V + E) log V)

What is the purpose of a priority queue in graph algorithms?

• To store the vertices of the graph in a sorted order.

• To randomly select vertices during graph traversal.

• To assign priorities to the edges of the graph.

• To efficiently retrieve the vertex with the highest priority or the minimum weight during graph traversal or path finding.