Strengthen your preparation for the Computer Instructor B-17 exams with a thorough collection of Algorithm solved MCQs. Practice for AJKPSC and PPSC exams with expert solutions to key algorithm concepts.
Algorithm MCQS
Computer Instructor B-17 MCQs – AJKPSC, FPSC, PPSC
1 / 17
1. Which of the following is a stable sorting algorithm?
2 / 17
2. What is the time complexity of insertion sort in best case?
3 / 17
3. Which algorithm is effective for efficiently identifying the closest pair of points within a set?
4 / 17
4. How many computations does the Boyer-Moore Majority Vote algorithm require to identify the majority element in an array?
5 / 17
5. Which algorithm can be used to determine the minimum weighted spanning tree in a graph with a negative cycle?
Bellman-Ford Algorithm is used for shortest path calculations in graphs with negative weights but not for spanning trees.
6 / 17
6. Which algorithm is the most efficient for finding the shortest path in a directed graph with non-negative edge weights?
7 / 17
7. In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is ___
8 / 17
8. Which of the following is technique for direct search?
9 / 17
9. Which of the following algorithm design technique is used in the quick sort algorithm?
10 / 17
10. Which of the following is not a non-comparison sort?
11 / 17
11. Binary Search Method has Worst Case Time Complexity of
12 / 17
12. Which algorithm is used to identify strongly connected components in a directed graph?
13 / 17
13. Which algorithm efficiently finds the maximum subarray sum while minimizing time and resource usage?
14 / 17
14. Which algorithm is utilized to find a minimum spanning tree in a graph?
15 / 17
15. Which of the following is not an in-place sorting algorithm?
16 / 17
16. Which of the following is not a stable sorting algorithm?
17 / 17
17. Time complexity to sort elements of binary search tree is
Your score is
The average score is 71%
Restart quiz
