StudentAidUnit 3: Unit 3: Algorithms and Problem Solving — Mcqs
11th Class Computer Science · Unit 3: Algorithms and Problem Solving
0 of 0 answered
0 correct
Understanding Computational Problems
1.What is a computational problem?
2.What does "input" mean in a computational problem?
3.Which problem gives a yes/no answer?
4.Which is an ill-defined problem?
5.What is output when checking if 8 is even?
Algorithms for Problem Solving
6.What is role of algorithm in problem solving?
7.What does PageRank algorithm analyze?
8.Why use real-life tasks in algorithm learning?
9.What is Generate and Test algorithm?
10.When is Generate and Test best?
Problem Solvability and Complexity
11.Which of the following correctly describes a solvable problem?
12.The Halting Problem is an example of:
13.Solvable problems differ because they:
14.Knowing if a problem is solvable helps to:
15.Tractable problems can be solved:
16.Which is an intractable problem?
17.Tractability depends on:
18.Problems in class P are solved in:
19.NP problems can be:
20.NP-hard problems are:
21.Problems in NP and NP-hard are called:
22.Which is an NP-complete problem?
23.If P = NP, this means:
25.Why is tractability important?
26.Easy to verify but hard to solve problems are in:
27.The Halting Problem is:
28.Which diagram shows P, NP, NP-hard, NP-complete?
29.NP-complete matters because:
30.P vs NP asks if:
Algorithm Analysis
31.What is the main purpose of algorithm analysis?
32.What does time complexity measure?
33.Which notation shows the upper bound of time complexity?
34.What does O(1) mean in Big O notation?
35.What does O(n²) indicate?
36.Which is an example of O(log n) complexity?
37.What does space complexity measure?
Algorithm Design Techniques
38.What is the primary goal of algorithm design techniques?
39.How does Divide and Conquer work?
40.Which technique is used in Merge Sort?
41.What defines a Greedy Algorithm?
42.Which is a Greedy Algorithm example?
43.What is a key limitation of Greedy Algorithms?
44.What is the main advantage of Dynamic Programming?
45.Which is solved by Dynamic Programming?
46.How does Backtracking work?
47.For which problems is Backtracking suitable?
Commonly Used Algorithms
48.Why are commonly used algorithms important?
49.What do sorting algorithms mainly do?
50.Which is a sorting algorithm?
51.How does Bubble Sort work?
52.What is the time complexity of Bubble Sort?
53.Why is Bubble Sort not for large datasets?
54.How does Selection Sort work?
55.What is the time complexity of Selection sort?
56.What is the purpose of search algorithms?
57.How does Linear Search work?
58.What must Binary Search have?
59.What is the time complexity of Binary Search?
60.Which algorithm finds node relationships in a graph?
61.What is the time complexity of BFS and DFS?
62.How do BFS and DFS differ?