Which type of algorithm is used to rearrange elements in a list or an array in a certain order?

• Graph algorithms

• Searching algorithms

• Hashing algorithms

• Sorting algorithms

What is the purpose of sorting algorithms?

• To organize data in a way that makes it easier to use, search, analyze, and display information efficiently

• To optimize software performance

• To solve problems related to graph Theory

• To find or retrieve an element from a data structure

Which sorting algorithm repeatedly steps through the array element by element comparing the current element with the one after it and swapping their values if the former is larger than the latter?

• Selection sort

• Merge sort

• Insertion sort

• Bubble sort

What is the time complexity of insertion sort in the best case scenario?

• Big O(n^2)

• Big O(1)

• Big O(n log n)

• Big O(n)

Which type of algorithm is used to find or retrieve an element from a data structure?

• Searching algorithms

• Hashing algorithms

• Sorting algorithms

• Graph algorithms

What is the time complexity of binary search in the worst and average cases?

• Big O(n log n)

• Big O(n)

• Big O(1)

• Big O(log n)

Which searching algorithm expands wide simultaneously instead of singular depth?

• Linear search

• Jump search

• Exponential search

• Breadth first search

Which graph algorithm is used to find the shortest path between a given node and all other nodes in a graph?

• Depth first search

• Breadth first search

• Dijkstra's algorithm

• A* algorithm

Which graph algorithm uses a heuristic function to prioritize nodes that are believed to be closer to the goal?

• Breadth first search

• A* algorithm

• Depth first search

• Dijkstra's algorithm

Which grade level is this quiz suitable for?

• Grade 10

• Grade 8

• Grade 14

• Grade 12