Introduction to Problem Solving Class 11 MCQ

Teachers and Examiners (CBSESkillEduction) collaborated to create the Introduction to Problem Solving Class 11 MCQ. All the important Information are taken from the NCERT Textbook Computer Science (083) class 11.

Introduction to Problem Solving Class 11 MCQ

1. Computers cannot solve problems on their own. We must provide clear, step-by-step directions on how to solve the issue, this solving technique is known as ____________.
a. Problem Solving 
b. Problem Addressing
c. Problem Analysis
d. None of the above

Show Answer ⟶
a. Problem Solving

2. ___________ is the process of identifying a problem, developing an algorithm for the identified problem and finally implementing the algorithm to develop a computer program.
a. Problem Solving 
b. Problem Addressing
c. Problem Analysis
d. None of the above

Show Answer ⟶
a. Problem Solving

3. It is essential to device a solution before writing a program code for a given problem. The solution is represented in natural language and is called an ___________.
a. Problem
b. Algorithm 
c. Problem Analysis
d. None of the above

Show Answer ⟶
b. Algorithm

4. After finalizing the algorithm, we need to convert the algorithm into the_________.
a. Format which can be understood by the computer
b. High level programming language
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Introduction to Problem Solving Class 11 MCQ

5. What are the different type of testing.
a. Component testing
b. Integration testing
c. System testing & Acceptance testing
d. All of the above 

Show Answer ⟶
d. All of the above

6. The developed programme needs to pass different parameter __________. The programme needs to fulfil the user’s requirements. It must respond in the anticipated amount of time.
a. Method
b. Testing 
c. Error
d. None of the above

Show Answer ⟶
b. Testing

7. To complete each activity in a computer, we follow a sequence of steps. This sequence of steps is known as ________.
a. Problem
b. Algorithm 
c. Problem Analysis
d. None of the above

Show Answer ⟶
b. Algorithm

8. ____________ is the act of locating and fixing problems in software code that could lead to unexpected behavior or crashes. These errors are sometimes referred to as “bugs.”
a. Algorithm
b. Problem Solving
c. Debugging 
d. All of the above

Show Answer ⟶
c. Debugging

9. Why do we need an Algorithm?
a. Accuracy
b. Minimized mistakes
c. Best possible solution
d. All of the above 

Show Answer ⟶
d. All of the above

Introduction to Problem Solving Class 11 MCQ

10. Writing an algorithm is mostly considered as a ________.
a. First step of programming 
b. Second step of programming
c. Third step of programming
d. None of the above

Show Answer ⟶
a. First step of programming

11. Purpose of using algorithm?
a. Increase the reliability
b. Accuracy of the program
c. Efficiency of obtaining solutions
d. All of the above 

Show Answer ⟶
d. All of the above

12. Characteristics of a good algorithm.
a. Precision & Uniqueness
b. Finiteness
c. Input & Output
d. All of the above 

Show Answer ⟶
d. All of the above

13. Before implementing algorithm, the programmer should __________ first.
a. Analyze the problem
b. Identify the problem
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

14. A __________ is a visual representation of an algorithm.
a. Flowchart 
b. Pseudocode
c. Algorithm
d. None of the above

Show Answer ⟶
a. Flowchart

Introduction to Problem Solving Class 11 MCQ

15. A flowchart is a diagram made up of __________.
a. Boxes
b. Diamonds
c. Shapes
d. All of the above 

Show Answer ⟶
d. All of the above

16. Start/End also called _________ symbol, it indicates where the flow starts and ends.
a. Terminator 
b. Decision
c. Input / Output
d. Arrow

Show Answer ⟶
a. Terminator

17. Process is also called ________, it represents a process, action, or a single step.
a. Terminator
b. Action Symbol 
c. Decision
d. Input/ Output

Show Answer ⟶
b. Action Symbol

18. A __________ or branching point, usually a yes/no or true/ false question is asked, and based on the answer, the path gets split into two branches.
a. Terminator
b. Action Symbol
c. Decision 
d. Input/ Output

Show Answer ⟶
c. Decision

19. _________ is also called data symbol, this parallelogram shape is used to input or output data.
a. Terminator
b. Action Symbol
c. Decision
d. Input/ Output 

Show Answer ⟶
d. Input/ Output

Introduction to Problem Solving Class 11 MCQ

20. ___________ connector to show order of flow between shapes.
a. Terminator
b. Action Symbol
c. Decision
d. Arrow 

Show Answer ⟶
d. Arrow

21. A ___________ is another way of representing an algorithm. It is considered as a non-formal language that helps programmers to write algorithm.
a. Flowchart
b. Pseudocode 
c. Algorithm
d. None of the above

Show Answer ⟶
b. Pseudocode

22. The word “pseudocode” means ___________.
a. Not real code 
b. Real code
c. Temporary code
d. None of the above

Show Answer ⟶
a. Not real code

23. It is necessary to run different input values through the algorithm’s phases in order to verify. This process of taking an input and running it through all of the algorithm’s steps is commonly referred to as a _______.
a. Code
b. Dry run 
c. Method
d. None of the above

Show Answer ⟶
b. Dry run

24. Dry run will help us to __________.
a. Identify any incorrect steps in the algorithm
b. Figure out missing details or specifics in the algorithm
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Introduction to Problem Solving Class 11 MCQ

25. algorithms can be ___________ on the basis of the amount of processing time they need to run and the amount of memory that is needed to execute the algorithm.
a. Compared
b. Analyzed
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

26. ___________ is the set of rules or grammar that governs the formulation of the statements in the language, such as spellings, order of words, punctuation, etc.
a. Analyzed
b. Syntax 
c. Code
d. None of the above

Show Answer ⟶
b. Syntax

27. Programs written using ________ are directly understood by the computer hardware, but they are difficult to deal with and comprehend by humans.
a. High Level Language
b. Binary Digit 
c. 4GL Language
d. None of the above

Show Answer ⟶
b. Binary Digit

28. A program written in a high-level language is called ___________.
a. Source code 
b. Object
c. Machine language
d. None of the above

Show Answer ⟶
a. Source code

29. What type of problems are solved by computer.
a. Easy problem
b. Complex problem
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Introduction to Problem Solving Class 11 MCQ

30. The basic idea of solving a complex problem by decomposition is to __________.
a. Decompose
b. Break down
c. Complex problem into smaller sub problems
d. All of the above 

Show Answer ⟶
d. All of the above

31. An algorithm is defined as a _________ procedure designed to perform an operation which will lead to the desired result, if followed correctly.
a. Reverse procedure
b. Step-by-step procedure 
c. Random procedure
d. None of the above

Show Answer ⟶
b. Step-by-step procedure

32. Algorithms have a definite ________ and a definite ________, and a finite number of steps.
a. Middle & End
b. Beginning & End 
c. Beginning & Middle
d. None of the above

Show Answer ⟶
b. Beginning & End

33. A good algorithm, which is __________, receives input and produces an output.
a. Precise
b. Unique
c. Finite
d. All of the above 

Show Answer ⟶
d. All of the above

34. In order to write effective algorithms we need to identify the__________ to be followed and the desired output.
a. Input
b. Process
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Introduction to Problem Solving Class 11 MCQ

35. A flowchart is a type of diagram that represents the algorithm graphically using boxes of various kinds, in an order connected by arrows.
a. Flowchart 
b. Algorithm
c. Pseudocode
d. None of the above

Show Answer ⟶
a. Flowchart

36. An _________ where all the steps are executed one after the other is said to execute in sequence.
a. Flowchart
b. Algorithm 
c. Pseudocode
d. None of the above

Show Answer ⟶
b. Algorithm

37. _________ making involves selection of one of the alternatives based on outcome of a condition.
a. Terminator
b. Action Symbol
c. Decision 
d. Arrow

Show Answer ⟶
c. Decision

38. An _________ may have a certain set of steps, which are repeating for a finite number of times, such an algorithm is said to be iterative.
a. Flowchart
b. Algorithm 
c. Pseudocode
d. None of the above

Show Answer ⟶
b. Algorithm

39. There can be __________ approach to solve a problem and hence we can have more than one algorithm for a particular problem.
a. Only one
b. More than one 
c. No approach
d. None of the above

Show Answer ⟶
b. More than one

Introduction to Problem Solving Class 11 MCQ

40. The choice of __________ should be made on the basis of time and space complexity.
a. Flowchart
b. Algorithm 
c. Pseudocode
d. None of the above

Show Answer ⟶
b. Algorithm
Computer Science Class 11 Notes
Computer Science Class 11 MCQ
Computer Science Class 11 NCERT Solutions

Computer

error: Content is protected !!