Guess the algorithm - based on its behaviour

This sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order.

• Merge Sort

• Bubble Sort

• Insertion Sort

• Quick Sort

Which algorithm uses a divide-and-conquer strategy to sort elements by picking a “pivot”?

• Selection Sort

• Quick Sort

• Heap Sort

• Bubble Sort

Which search algorithm only works on sorted arrays and divides the search space in half each time?

• Linear Search

• Hash Search

• Binary Search

• Depth-First Search

This pathfinding algorithm guarantees the shortest path in a weighted graph with non-negative weights.

• BFS

• Dijkstra's Algorithm

• A* Algorithm

• • Bellman-Ford

In machine learning, which algorithm is used to group data points into k clusters based on proximity?

• Decision Tree

• K-Means Clustering

• Naive Bayes

• PCA

What algorithm maintains a heap structure to always access the minimum (or maximum) element efficiently?

• Merge Sort

• Kruskal’s Algorithm

• Heap Sort

• Selection Sort

Which algorithm starts at the root and explores as far as possible along each branch before backtracking?

• Breadth-First Search

• Binary Search

• Depth-First Search

• Linear Search

Which algorithm is used in operating systems to schedule processes using a round-robin fashion?

• FIFO Scheduling

• Round-Robin Algorithm

• Shortest Job First

• Priority Scheduling

This algorithm constructs an optimal binary tree based on character frequency.

• Huffman Coding

• AVL Tree

• Kruskal’s Algorithm

• Prim’s Algorithm

Which algorithm finds a minimum spanning tree by adding the next smallest edge that doesn’t create a cycle?

• Dijkstra's Algorithm

• Bellman-Ford

• Prim’s Algorithm

• Kruskal’s Algorithm