# Problem Solving and Python Programming Solved MCQs

Chapters

Chapter: Algorithms
1.

## The word                         comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi.

A. flowchart
B. flow
C. algorithm
D. syntax
Explanation: the word algorithm comes from the name of a persian mathematician abu ja’far mohammed ibn-i musa al khowarizmi.
2.

## In computer science, algorithm refers to a special method usable by a computer for the solution to a problem.

A. true
B. false
Explanation: the statement is true. this word algorithm refers to a special method usable by a computer for the solution to a problem. the statement of the problem specifies in general terms the desired input/output relationship.
3.

## This characteristic often draws the line between what is feasible and what is impossible.

A. performance
B. system evaluation
C. modularity
D. reliability
Explanation: algorithms help us to understand scalability. performance often draws the line between what is feasible and what is impossible.
4.

## The time that depends on the input: an already sorted sequence that is easier to sort.

A. process
B. evaluation
C. running
D. input
Explanation: the running time depends on the input: an already sorted sequence is easier to sort. the running time is given by the size of the input, since short sequences are easier to sort than the longer ones. generally, we seek upper bounds on the running time, because it is reliable.
5.

## When an algorithm is written in the form of a programming language, it becomes a

A. flowchart
B. program
C. pseudo code
D. syntax
Explanation: an algorithm becomes a program when it is written in the form of a programming language. thus, any program is an algorithm.
6.

## Any algorithm is a program.

A. true
B. false
Explanation: the statement is false. an algorithm is represented in the form of a programming language is called a program. any program is an algorithm but the reverse is not true.
7.

## A system wherein items are added from one and removed from the other end.

A. stack
B. queue
D. array
Explanation: in a queue, the items are inserted from the rear end and deleted from the front end.
8.

## Another name for 1-D arrays.

A. linear arrays
B. lists
C. horizontal array
D. vertical array
Explanation: linear arrays are the 1- dimensional arrays wherein only one row is present and the items are inserted.
9.

## A data structure that follows the FIFO principle.

A. queue
B. ll
C. stack
D. union
Explanation: the answer is queue. a queue follows the fifo principle. fifo stands for first in first out.
Chapter: Flow Charts
10.

## The symbol denotes

A. i/o
B. flow
C. terminal
D. decision
Explanation: the symbol denotes a terminal. it is used for indication of start and stop nodes of a program.
11.

## In computer science, algorithm refers to a pictorial representation of a flowchart.

A. true
B. false
Explanation: the statement is false. the correct statement would be: in computer science, flowchart refers to a pictorial representation of an algorithm.
12.

## The process of drawing a flowchart for an algorithm is called

A. performance
B. evaluation
C. algorithmic representation
D. flowcharting
Explanation: it is called as flowcharting. a flowchart is nothing but a pictorial representation of an algorithm.
13.

## Actual instructions in flowcharting are represented in

A. circles
B. boxes
C. arrows
D. lines
Explanation: the actual instructions are written in boxes. boxes are connected by using arrows to indicate the exact flow of a flowchart and the order in which they are to be executed.
14.

## The following box denotes? A. decision
B. initiation
C. initialization
D. i/o
Explanation: a diamond shape box denotes the decision making statements. it jumps to a truth value or a false value.
15.

## A box that can represent two different conditions.

A. rectangle
B. diamond
C. circle
D. parallelogram
Explanation: a diamond shape box denotes either a truth value or a false value. it jumps onto two different statements following it via flow lines.
16.

## There should be certain set standards on the amount of details that should be provided in a flowchart.

A. true
B. false
Explanation: the statement is false. there should be no set standards on the amount of details that should be provided in a flowchart.
17.

## A detailed flowchart is called

A. stack
B. macro
C. micro
D. union
Explanation: a detailed flowchart or a flowchart with more details is called as micro flowchart. it represents all the components of the algorithm that is followed.
18.

## Which of the following is not an advantage of a flowchart?

A. better communication
B. efficient coding
C. systematic testing
D. improper documentation
Explanation: flowcharts provide a proper documentation. it also provides systematic debugging.
19.

## A flowchart that outlines the main segments of a program.

A. queue
B. macro
C. micro
D. union
Explanation: the answer is macro flowchart. a macro flowchart outlines the important components of a program. it therefore shows fewer details.
Chapter: Designing Flowcharts
20.

## A                              is diagram that depicts the flow of a program.

A. algorithm
B. hash table
C. graph
D. flowchart
Explanation: a flowchart is a diagram that helps us determine the flow of the program. other options are irrelevant.
21.

## Terminals are represented by diagonals in a flowchart.

A. true
B. false
Explanation: the statement is false. terminals are represented by rounded rectangles. they indicate the starting or ending point in a flowchart.
22.

## The operation represented by parallelograms.

A. input/output
B. assignment
C. comparison
D. conditions
Explanation: the input/output operations are represented by parallelograms. they generally are used to display messages during input and output part of a program.
23.

## Which of the following is not a flowchart structure?

A. process
B. sequence
C. repetition
D. case
Explanation: there are basically four flowcharting structures:
24.

A. sequence
B. case
C. repetition
D. process