Chapter 2 Problem Solving and Algorithms
1. _____ guess an answer and helps us in formulating the solutions.
a. Execution
b. Plan
c. Heuristics
d. Interactions
Ans: c. Heuristics
2. Which are not the elements of Computational Skill?
a. Decomposition
b. Pattern matching
c. Algorithm Design
d. Object Oriented Programming
Ans: d. Object Oriented Programming
3. _____ is distinguishing between what is important and what is not important.
a. Abstraction
b. Data Structure
c. Programs
d. Algorithm
Ans: a. Abstraction
4. What is wrong with respect to the software development cycle?
a. Small Scale Development only
b. Involves complicated management principles
c. Involves a group of people
d. Requires understanding of the problem
Ans: a. Small Scale Development only
5. Which among the following come under the software testing?
a. Acceptance Test
b. Content Test
c. Object Test
d. SWOT analysis
Ans: a. Acceptance Test
6. What is the other name for Compositional Approach?
a. Top-Down Approach
b. Bottom-Up Approach
c. Step-wise Approach
d. Step-Down Approach
Ans: b. Bottom-Up-Approach
7. Which of the following is used to analyze the algorithm?
a. Complexity Theory
b. Operational Research
c. Calculus
d. Statistical Learning
Ans: a. Complexity theory
8. The 𝑂(𝑐𝑛2 + 5𝑛 + 3) is approximately equal to
a. 𝑶(𝒏𝟐 )
b. θ(𝑛)
c. 𝑂(𝑐𝑛2 + 5𝑛)
d. 𝑂(𝑐𝑛2 )
e. Ans: a. 𝑂(𝑛2 )
9. Which of the following statement is not correct?
a. O(1) is called as Constant time
b. 𝑂(𝑛!) is called as exponential time
c. 𝑂(2𝑛 ) is called as exponential time
d. 𝑶(𝒏𝟑 ) is called as Non-Polynomial Time
Ans: d. 𝑂(𝑛3 ) is called as Non-Polynomial Time
10. What kind of problems are difficult to get solved by computers?
a. Polynomial time problems
b. Interactable Problems
c. Worst-case problems
d. Flowchart based problems
Ans: b. Interactable Problems
11. _____ is the finding the similarities among the items to extract the necessary
information to solve problem.
a. Data Abstraction
b. Data classification
c. Pattern Matching
d. Recursion
Ans: c. Pattern Matching
12. ______ is called as the execution time of an algorithm.
a. Data Accessing time
b. Data Preprocessing
c. Runtime
d. Compile Time
Ans: c. Runtime
13. _______ is a skill that makes the problem solvable and manageable.
a. Decomposition
b. Data Abstraction
c. Recursion
d. Problem Solving
Ans: a. Decomposition
14. ______ is represents a random input for which an algorithm time is on average
a. O
b. 𝛉
c. ω
d. o
Ans: b. 𝛉
15. _______ is process of removal of errors from the software
a. Testing
b. One-One mapping
c. Debugging
d. Thinking
Ans: c. Debugging
16. A control structure that allows the users to choose the a task in presence of alternative
tasks is _______
a. Selection
b. Sequence
c. Analysis
d. Abstraction
Ans: a. Selection
17. ______ is a complete sequence of actions that accomplish a task.
a. Algorithm
b. Heuristics
c. Object
d. Database
Ans: a. Algorithm
18. What is the cost for the following piece of algorithm?
for i = 0 to n:
for j = 0 to m:
k=k+1
a. 𝑂(𝑛2 )
b. θ(𝑛)
c. 𝑶(𝒏𝒎)
d. ω(𝑛)
e. Ans: c. 𝑶(𝒏𝒎)
19. Small repetitive tasks are used in ______
a. Iterations
b. Decision Structures
c. Flow Chart
d. OOP
Ans: a. Iterations
20. _____ strategy will not work in name search of telephone directory.
a. Brute Force
b. Step wise refinement
c. Divide and Conquer
d. Bottom-Up Approach
Ans: a. Brute Force
