Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
40 views

Flowchart (Algorithm) Questions

Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views

Flowchart (Algorithm) Questions

Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Flowchart (Algorithm)

Note:
 The normal Flow in a Flow chart is From top to bottom and From left to right.
 Flow chart is a type of diagram that represents a workflow or Process.
 Process and Decision is most important symbols in a Flow chart
 A Program is divided into modules because it gives the programmer greater flexibility.
 Debugger helps a programmer to locate bugs an corrects them

Flow Chart Symbols

Terminal
Start and stop

INPUT/OUTPUT Processing

Annotation / Comment

Flow Lines
Diamond
for
Decision
Circle connector: The Circle Connects
Sections on the same page/ on page
connector

Home Base Plate: connects Flow


Home Base

chart from page to page / off


page connector
Plate

What is top down design?


Ans. Top down design breaks down the original set of Program specifications into smaller sections which is
much easier to solve.

What is Structured Programming?


Ans. A program design method that results in an easy to understand program with clear design and straight
forward program flow. Before programmers can start to write code they must design the program and a
structured program is one that is designed as a set of hierarchical modules or functions, each of which has
only one entry point and only one exit point.
There are three types of control structured / statement.

1. Sequence control structure:-This structure is known as Progress from one activity to another
activity sequentially statements executed in the same way.

2. Selection control structure/Conditional:-This control structure tells the program as to which


action it should take which is based on certain condition. When a condition is tested and if it is true
then an action is performed and if it is false another different action is performed.

3. The Repetition/Iteration or loop control structure :-A repetition situation means to “do such
and such until so and so condition is reached”

 Data Flow diagrams shows relationship between input, processing and output.
 Syntax error are found out by compilers.
 Run time error is found during execution.
 Incorrect Translation of Algorithm is logical errors
 A Flow chart uses Predefined symbols is called system Flowchart
 Object code is must be loaded before execution.
 The Program is much easier to change the advantage of modular programming.

Questions

1. This characteristic often draws the line between what is feasible and what is impossible.
a) Performance
b) System Evaluation
c) Modularity
d) Reliability
Ans. a
Explanation: Algorithm help us to understand scalability. Performance often draws the line
between what is feasible and what is impossible.

2. Any algorithm is a program.


a) True b) False
Ans. b

3. Another name for 1-D arrays.


a) Linear arrays b) Lists c) Horizontal array d) Vertical array
Ans. a
4. A data structure that follows the FIFO principle.
a) Queue
b) LL
c) Stack
d) Union
Ans. a

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


a) True
b) False
Ans. b

6. This symbol denotes ______.

a) I/O
b) Flow
c) Terminal
d) Decision
Ans. c

7. There should be certain set standards on the amount of details that should be provided in a flow
chart.
a) True b) False
Ans. b

8. A detailed flowchart is called ______


a) Stack
b) Macro
c) Micro
d) Union
Ans. c

9. Which of the following is not an advantage of a flowchart?


a) Better communication b) Efficient coding
c) Systematic testing d) Improper documentation
Ans. d

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


a) Queue b) Macro c) Micro d) Union
Ans. b
11. Terminals are represented by diagonals in a flowchart.
a) True
b) False
Ans. b

12. The operation represented by a parallelograms.


a) Input/Output b) Assignment
c) Comparison d) Conditions
Ans. a
13. Which of the following is not a flowchart structure?
a) Process
b) Sequence
c) Repetition
d) Case
Ans. a

14. The action performed by a ______ structure must eventually cause the loop to terminate.
a) sequence
b) case
c) repetition
d) process
Ans. c

15. The following symbol denotes:

a) Module
b) Terminal
c) Process
d) I/O operation
Ans. a

16. A _____ is a connector showing the relationship between the representative shapes.
a) Line
b) arrow
c) Process
d) box
Ans. b
Explanation: Arrows are the connectors that shows the relationship between different shapes.
They also show the flow of the program.

17. keep the statement language ____ while writing a pseudo code.
a) Dependent b) Independent
c) Case sensitive d) Capitalized
Ans. b
18. Programming based on stepwise refinement process.
a) Structural
b) C programming
c) Procedural
d) Fine
Ans. a

19. Top-down approach is followed in structural programming.


a) True b) False
Ans. a

20. A _____ is a directed graph that describes the flow of execution control of the program.
a) Flowchart b) Flow graph c) Complexity curve d) Algorithm
Ans. a
21. A program should be ______
a) Secure b) Sequential c) Ordered d) Simple
Ans. b

22. Which of the following is a loop statement?


a) IF b) Else c) While d) Do
Ans. c

23. The _______ symbol is used at the beginning of a flow chart.


a) Circle b) Rectangle c) Diamond d) None of these
Ans. a

24. The _____ symbol is used to represent process in flowchart.


a) Circle b) Rectangle c) Diamond d) None of these
Ans. b

25. ______ symbol is used to represent input and output operation in flowchart.
a) circle b) Rectangle c) Diamond d) Parallelogram
Ans. d

26. Symbol used in flowchart such as rectangle with the horizontal lines on two sides is used for
a) A defined statement b) predefined process
c) error fix d) variables defined
Ans. b

27. Part of algorithm which is repeated for the fixed number of times is classified as
a) iteration
b) selection
c) sequence
d) reverse action
Ans. a

1. _____ is a procedure or step by step process for solving a program.


a) Algorithm
b) Flowchart
c) Pseudocode
d) All of these

2. When an algorithm is presented in the form of a Programming language it becomes a ______


a) Program
b) flowchart
c) Pseudo code
d) Syntax

3. Flow chart symbols have been standardized by _______


a) American National Standard Institute
b) ASCII
c) IEEE
d) International standardization organization

4. In computer science, algorithm refers to a special method usable by a computer for the solution
to a problem.
a) True b) False
5. Which of the following is incorrect?
Algorithm can be represented:
a) as pseudo codes b) as syntax
c) as programs d) as flowcharts

6. The process of drawing a flowchart for an algorithm is called ________


a) Performance b) Evaluation
c) Algorithm Representation d) Flowcharting

7. Actual instructions in flowcharting are represented in ______


a) Circle b) Boxes
c) Arrows d) Lines

8. The following box denotes?

a) Decision
b) Initiation
c) Initialization
d) I/O

9. A box that can represent two different conditions.


a) Rectangle b) Diamond
c) Circle d) Parallelogram

10. A ______ is a diagram that depict the flow of a program.


a) Algorithm b) Hash Table
c) Graph d) Flowchart

11. The ____ provides pictorial representation of given problem.


a) Algorithm b) Flowchart
c) Pseudocode d) All of these

12. _____ is a symbol used to connects two symbols of flowchart.


a) Circle b) Rectangle
c) Diamond d) Arrow

Click here for Answers

GK EDITORIAL
Telegram https://t.me/gkeditorialOfficial

Computer Best MCQ Book in Just Rs.39/- [7000+ Question in English]


https://imojo.in/27ql6f4

Computer GK for Competitive Exams [10000 MCQ in English]

You might also like