Flow Chart MCQ is a graphical representation of a process, system, or algorithm. It uses standardized symbols to depict the sequence of steps and decisions involved in completing a particular task or solving a problem. Flowcharts are used to visualize processes in various fields, such as business, computer programming, engineering, and operations, to help users understand how a process works or to communicate the logic of a system.
Question 1
What is an algorithm
a) A flowchart
b) Step by step instruction used to solve a problem
c) A flowchart or pseudocode
d) A decision
Question 2
The information that a program requires in order to accomplish its objective is called the
a) Data
b) Contribution
c) Effort
d) Input
Question 3
In a flowchart a calculation (process) is represented by
a) A rectangle
b) A rhombus
c) A parallelogram
d) A click
Question 4
In a flowchart an input or output instruction is represented by
A) A rectangle
B) A rhombus
C) A parallelogram
D) A click
Question 5
In Flowcharts of algorithms, messages aer classified as
a) Steps of algorithm
b) Selection of steps
c) Cancellation of procedures
d) Addition of steps
Question 6
Which of the following sorting algorithms is of divide- and- conquer type?
a) Bubble sort
b) Insertion
c) Quick sort
d) All of above
Question 7
Distinct parts of documentation are
a) Technical documentation
b) Documentation for user
c) Program planning
d) Both a and b
Question 8
A process box is _ in shape.
a) Connector
b) Rectangular
c) Oval
d) Circle
Question 9
A___________ symbol is used to connect parts of a flowchart that are on different pages.
a) Rectangular
b) Oval
c) Terminal
d) Connector
Question 10
Diagram that represents steps or operations involved in any kind of process is called
a) System
b) Management hierarchy
c) Flowcharts
d) Convenience diagrams
Question 11
Which one is not the property of algorithm?
a) Generality
b) Infiniteness
c) Finiteness
d) Correctness
Question 12
The time factor when determining the efficiency of algorithm is measured by
a) Countiong microseconds
b) Counting the number of key operations
c) Couting the number of statements
d) Counting the kilobytes of algorithm
Question 13
The space factor when determining the efficiency of algorithm is measured by
a) Counting the maximum memory needed by the algorithm
b) Counting the minimum memory needed by the algorithm
c) Counting the average memory needed by the algorithm
d) Counting the maximum disk space needed by the by the algorithm
Question 14
Two main measures for the efficiency of an algorithm are
a) Processor and memory
b) Complexity and capacity
c) Time and space
d) Data and space
Question 15
Outlined program flowchart shows the
a) Detailed operations
b) General flowcharts
c) Classified flowchart
d) Detailed program
Question 16
In flowchart symbol of rectangle with one curvy side is used to slow
a) Document printed
b) Document written
c) Data stored
d) Display output]
Question 17
In flowcharts a circale with a vertical line drawn is a symbol used to show
a) Systematic operstion
b) Manual operation
c) Magnetic tape
d) Display screen
Question 18
Repetition of statement in Jackson method is shown by
a) Drawing sign of equal
b) Drawing sign of subtraction
c) Drawing an asterisk
d) Drawing an arrow
Question 19
Diamond shaped symbol is used in flowcharts to show the
a) Decision box
b) Statement box
c) Error box
d) If statement box
Question 20
When flowchart direction lines are unclear the programmer can use
A) Arrows
B) Horizontal lines
C) Vertical lions
D) Inverted triangle
Question 21
the most case occur in linear search algorithm when
a) Item is some where in the middle of the array
b) Item is not in the array at all
c) Item is the last element in the array
d) Item is the last element in the array or is not there at all
Question 22
What are the three algorithm constructs?
a) Sequence selection repetition
b) Input pout put process
c) Input\output, decision, terminator
d) Loop, input\output, process
Question 23
Which of the following is not the required condition for binary search algorithm?
a) The list must be sorted
b) There should be the direst accese to the middle rlement in any sublist
c) There must be mechanism to delete and\or insert elements in list
d) None of above
Question 24
What is a list of instructions in a proper order to solve a problem called?
a) Flowchart
b) Sequence
c) Algorithm
d) None of these
Question 25
__ symbols are used to connect one box of flowchart to another
a) Flow lines
b) Connector
c) Flowchart
d) None of these
Question 26
A __ is a pictorial representation of steps that should be followed to solve a problem.
a) Flow lines
b) Algorithm
c) Flowchart
d) None of those
Question 27
The complexity of the average case of an algorithm is
a) Uch more complicated to analyze then that of worst case
b) Much more simpler to analyze then that of worst case
c) Sometimes more complicated and some other times simpler then that of worst case
d) None or above
Question 28
Which of the following cases dose not exist in complexity theory
a) Best case
b) Worst case
c) Average case
d) Null case
Question 29
The complexity of binary search algorithm is
a) O(n)
b) O(log)
c) O(n2)
d) O(n log n)
Question 30
The complexity of bubble sort algorithm is
a) O(n)
b) O(log)
c) O(n2)
d) O(n log n)
Question 31
The complexity of merge sort algorithm is
a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
Question 32
The complexity of linear search algorithm is
a) O(n)
b) O (log n)
c) O (n2)
d) O (n log n)
Question 33
All components work together as a unit is calld
a) System
b) Component classification
c) Storing system
d) Operationg syatem
Question 34
Stock maintain control system in store which consists hardwere and software to contact and mange
suppliers is called
a) System
b) Component classification
c) Information Processing System
d) Operating system
Question 35
In flowchart parallelogram is used to show
a) General input symbol
b) Operation on data
c) Online use of keyboard
d) Output data screen
Question36
Binary search algorithm can not be pplied to
a) Sorted linked list
b) Sorted binsry trees
c) Sorted linear array
d) Pointer array
Question 37
To write program functions such as input four numbers and print there sum, program refinement
first level includes
a) Input four number
b) Calculate sum
c) Print values
d) Print variables
Question 38
The information software produces the input is called
a) Flowchart
b) Output
c) Objective
d) Prototype
Question 39
Part of an algorithm which is repeated for fied number of times is classified a
a) Iteration
b) Selection
c) Sequence
d) Reverse action
Question 40
In flowchart invert trapezoid is used to show the
a) On –line storage symbol
b) Manual operations
c) Communication link
d) Show annotations
Question 41
Connectors used to connect flowchart symbols to each other are
a) Arrow lines
b) Symbols
c) Annotation
d) Special symbols
Question 42
Algorithm and flow chart help us to
a) Know the memory capacity
b) Identify the base of a number system
c) Direct the output to a printer
d) Specify the problem completely and clearly
Question 43
A_____ box is used at the beginning and end of a flowchart.
a) Connector
b) Terminal
c) Floe lines
d) Square
Question 44
Program flowcharts are the parts of
a) Operation chart
b) Process chart
c) Algorithms flowchart
d) System flowchart
Question 45
Flowchart and pseudo code are examples of tools used in the program __ phase
a) Specification
b) Design
c) Code
d) Test
Question 46
Link with another part program or connectors in flowchart are shown in
a) Rhombus
b) Parallelogram
c) Circle
d) Trapezoid
Question 47
Symbol used in flowchart such as rectangle with horizontal lines on two sides is used for
a) Rhombus
b) Parallelogram
c) Circle
d) Trapezoid
Question 48
An algorithm that calls itself directly or indirectly is known as
a) Sub algorithm
b) Recursion
c) Polish notation
d) Traversal algorithm
Question 49
A person who produces or creates new programs for industrial and business users is called
a) System analysts
b) Program coordinator
c) Computer coordinator
d) User inter face
Question 50
The average case occure in linear search algorithm
a) When Item is somewhere in the middle of the array
b) When Item is not in the array at all
c) When Item is the last element nin the array
d) When Item is the last element in the array or is not there at all
