A
Dijkstra's Algorithm
Merge Sort
Quick Sort
Prim's Algorithm
Which algorithm is used for finding the shortest path in a graph?
A
Quick Sort
DFS
BFS
Linear Search
Which of these is a divide-and-conquer algorithm?
C
O(1)
O(n)
O(log n)
O(n^2)
What is the time complexity of binary search in a sorted array?
<|start_header_id|>system<|end_header_id|>Generate 3 MCQs on algorithms<|eot_id|><|start_header_id|>user<|end_header_id|> This is the question: MCQ Algorithms <|eot_id|><|start_header_id|>assistant<|end_header_id|>[{'correct_answer': 'A', 'options': {'A': "Dijkstra's Algorithm", 'B': 'Merge Sort', 'C': 'Quick Sort', 'D': "Prim's Algorithm"}, 'question_text': 'Which algorithm is used for finding the shortest path in a graph?'}
 {'correct_answer': 'A', 'options': {'A': 'Quick Sort', 'B': 'DFS', 'C': 'BFS', 'D': 'Linear Search'}, 'question_text': 'Which of these is a divide-and-conquer algorithm?'}
 {'correct_answer': 'C', 'options': {'A': 'O(1)', 'B': 'O(n)', 'C': 'O(log n)', 'D': 'O(n^2)'}, 'question_text': 'What is the time complexity of binary search in a sorted array?'}]<|eot_id|>