Академический Документы
Профессиональный Документы
Культура Документы
1.A finite set of steps, each of which may require one or more outputs and may have zero or more operations.
This is called as ________
a. Procedure b. Algorithm c. Program d. Instruction
2.Describing the process step by step is called
a. flow chart b. algorithm c. program d. pseudo code
3.Describing the process using diagrams is called
a. flow chart b. algorithm c. program d. pseudo code
4.Checking to see if our algorithm gives the desired result is called as _______
a. execution b. validation c. dry run d. compilation
5.Making a choice from multiple available options is called as
a. sequence. b. selection c. iteration d. validation
6.Performing repetitive tasks is called as _________________
a. sequence. b. selection c. iteration d. validation
7.The process of removing an error from an algorithm is called as
a. compiling b. debugging c. interpretation d. iteration
8.The characteristic of an algorithm that describes that each instruction is clear and unambiguous is
a. effectiveness b. finiteness c. definiteness d. Input / output
9.The below algorithm
Step 1: Start
Step 2: Read N
Step 3: S = 0
Step 4: REPEAT while N > 0
R = N mod 10
IF R mod 2 THEN
S=S+1
N = N / 10
Step 5: Write (s)
Step 6: Exit
34. main()
{
int i=5,j=6,z;
printf("%d",i+ + +j);
}
a. 11 b. 10 c. 12 d. 30
35.main()
{
int i =0;j=0;
if(i && j++)
printf("%d..%d",i++,j);
printf("%d..%d,i,j);
}
a. 0..0 b. 1 1 c. -1 -1 d. 1 0
38.The while is
a. test condition controlled statement b. entry controlled loop statement
c. entry controlled condition statement d. test controlled statement
44.unsigned char c;
for (c = 0; c ! = 256; c + 2)
printf(“%d”, c);
How many times the loop is executed?
a. 127 b. 128 c. 256 d. infinitely
a. 10 b. 5 c. 4 d. 15
46.For the following code how many times the printf( ) function is executed?
int x, y;
for (x = 0; x < = 10; x ++)
for (y = 0; y < = 10; y ++)
printf(“x = %d, y = %d\n”, x, y);
a. 121 b. 11 c. 10 d. 132
47.The process of breaking a bigger task into smaller steps, is called _______
a. algorithm b. process c. segmentation d. Divide and conquer
48.The activity that does not form the building block of an algorithm.
a. sequence b. selection c. iteration d. parallel computing