Choose a Quiz Batch. Each batch has 10 questions from this topic, in order. Take them one by one to work through all 27 MCQs. Login to save your scores and see your best per batch.
Read each question, think about the answer, then click Show Answer to reveal the correct option and explanation. Load 10 at a time so it stays manageable — perfect for one-topic study sessions on the bus or during a break.
Page 1 of 1Questions 1–10 of 27
Q1Past Paper · PPSC/FPSC/NTSeasy
merge sort is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
merge sort is a recognized software engineering topic assessed in competitive exams.
Q2medium
quick sort is best defined as
Aan algorithm concept, technique or complexity measure✓
Ban unrelated hardware manufacturing step✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
quick sort is a recognized software engineering topic assessed in competitive exams.
Q3hard
heap sort is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
heap sort is a recognized software engineering topic assessed in competitive exams.
Q4Past Paper · PPSC/FPSC/NTSeasy
insertion sort is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
insertion sort is a recognized software engineering topic assessed in competitive exams.
Q5medium
selection sort is best defined as
Aan algorithm concept, technique or complexity measure✓
Ban unrelated hardware manufacturing step✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
selection sort is a recognized software engineering topic assessed in competitive exams.
Q6hard
Dijkstra algorithm is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
Dijkstra algorithm is a recognized software engineering topic assessed in competitive exams.
Q7Past Paper · PPSC/FPSC/NTSeasy
divide and conquer is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
divide and conquer is a recognized software engineering topic assessed in competitive exams.
Q8medium
knapsack problem is best defined as
Aan algorithm concept, technique or complexity measure✓
Ban unrelated hardware manufacturing step✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
knapsack problem is a recognized software engineering topic assessed in competitive exams.
Q9hard
longest common subsequence is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
longest common subsequence is a recognized software engineering topic assessed in competitive exams.
Q10Past Paper · PPSC/FPSC/NTSeasy
matrix chain multiplication is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
matrix chain multiplication is a recognized software engineering topic assessed in competitive exams.
Q11medium
Floyd-Warshall is best defined as
Aan algorithm concept, technique or complexity measure✓
Ban unrelated hardware manufacturing step✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
Floyd-Warshall is a recognized software engineering topic assessed in competitive exams.
Q12hard
Kruskal MST is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
Kruskal MST is a recognized software engineering topic assessed in competitive exams.
Q13hard
greedy algorithm is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
greedy algorithm is a recognized software engineering topic assessed in competitive exams.
Q14Past Paper · PPSC/FPSC/NTSeasy
Prim MST is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
Prim MST is a recognized software engineering topic assessed in competitive exams.
Q15medium
backtracking is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
backtracking is a recognized software engineering topic assessed in competitive exams.
Q16hard
branch and bound is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
branch and bound is a recognized software engineering topic assessed in competitive exams.
Q17Past Paper · PPSC/FPSC/NTSmedium
time complexity is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
time complexity is a recognized software engineering topic assessed in competitive exams.
Q18Past Paper · PPSC/FPSC/NTShard
space complexity is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
space complexity is a recognized software engineering topic assessed in competitive exams.
Q19Past Paper · PPSC/FPSC/NTSeasy
binary search is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
binary search is a recognized software engineering topic assessed in competitive exams.
Q20Past Paper · PPSC/FPSC/NTSmedium
linear search is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
linear search is a recognized software engineering topic assessed in competitive exams.
Q21hard
bubble sort is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
bubble sort is a recognized software engineering topic assessed in competitive exams.
Q22Past Paper · PPSC/FPSC/NTSeasy
Bellman-Ford algorithm is best defined as
Aan unrelated hardware manufacturing step✓
Ban algorithm concept, technique or complexity measure✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
Bellman-Ford algorithm is a recognized software engineering topic assessed in competitive exams.
Q23Past Paper · PPSC/FPSC/NTSeasy
Big O notation is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
Big O notation is a recognized software engineering topic assessed in competitive exams.
Q24medium
BFS graph traversal is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
BFS graph traversal is a recognized software engineering topic assessed in competitive exams.
Q25hard
DFS graph traversal is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Ca marketing slogan without technical meaning✓
Dan algorithm concept, technique or complexity measure✓
💡 Explanation:
DFS graph traversal is a recognized software engineering topic assessed in competitive exams.
Q26Past Paper · PPSC/FPSC/NTSeasy
topological sort is best defined as
Aan algorithm concept, technique or complexity measure✓
Ban unrelated hardware manufacturing step✓
Ca purely financial accounting entry only✓
Da marketing slogan without technical meaning✓
💡 Explanation:
topological sort is a recognized software engineering topic assessed in competitive exams.
Q27medium
dynamic programming is best defined as
Aan unrelated hardware manufacturing step✓
Ba purely financial accounting entry only✓
Can algorithm concept, technique or complexity measure✓
Da marketing slogan without technical meaning✓
💡 Explanation:
dynamic programming is a recognized software engineering topic assessed in competitive exams.