1.
The format for the formal presentation of the algorithm Consists
of how many parts?
a.
2
b.
3
c.
4
d.
5
2.
The comments begin with _____and explain the purpose of the
instruction.
a.
Single slashes
.jpg)
b.
Double slash
c.
* Sign
d.
None of these
3.
The assignments statement will use the notation as_________
a.
Set A ¹2
b.
Max¹ai
c.
Set A=3
d.
Int ¹c’
4.
Data may be input & assigned to variable by means of a _______
statement.
a.
Write
b.
Open
c.
Save
d.
Read
5.
The algorithm is completed with the execution of the___________
a.
Last instruction
b.
First instruction
c.
Middle instruction
d.
Statement block
6.
Structured Programming constructs how many following type of
programming constructs?
a.
4
b.
3
c.
2
d.
1
7.
The steps are executed one after other is called_______
a.
Selection programming
b.
Iterative programming
c.
Sequential programming
d.
None of these
8.
The structure which
implement conditions and depending on the out Come of the conditions may select
one of the alternatives is called?
a.
Double attentive
b.
Single alternative
c.
Multiple alternative
d.
If structure
9.
Selection programming constructs how many following types of
Programming constructs?
a.
3
b.
2
c.
1
d.
None of these
10. Which of these following
selections programming construct are used in programming construct?
a.
Single alternatives
b.
Double alternative
c.
Multiple alternative
d.
All the above
11. The instructions that
are executed repetitively constitute the body of the loop is called__________.
a.
Selection programming construct
b.
Iterative programming construct
c.
Multiple programming construct
d.
None of these
12. Iterative programming
constructs & falls in to how many following categories?
a.
5
b.
4
c.
3
d.
2
13. Which of the following
iterative programming construct used in Programming construct?
a.
For construct
b.
While construct
c.
Do- while construct
d.
All the above
14. The choice of particular algorithm depends on which of the
following considerations?
a.
Programming requirements
b.
Memory requirements
c.
Performance requirements
d.
All of these
15. The space needed to
store the executable version of the program and is fixed is called____________
a.
Instruction space
b.
Date space
c.
Record space
d.
None of these
16. An algorithm is the amount of time it needs to run to completion
is called:
a.
Time space trade-off
b.
Time complexity
c.
Expressing space trade-off
d.
None of these
17. A characterization
scheme that allows to measure prosperities of algorithms such as performance
and for memory in a general fashion is called:
a.
Recursion
b.
Depth recursion
c.
Big Of Notation
d.
Minmax problem
18. The bank use…………….
device to minimize conversion process.
a.
Keyboard
b.
MICR
c.
OCR
d.
Scanner
19. ………………can’t be used for
source of data automation.
a.
POS terminal
b.
OCR
c.
Keyboard
d.
UPS
20. Under which case will
intranet be an effective networking tool/s?
a.
In a distributed decision-making environment
b.
Where heterogeneous applications are involved
c.
In a centralized organization
d. In a decentralized
organization
No comments:
Post a Comment