Top 80+ Solved Fundamentals of Computer Programming 1 MCQ Questions Answer

From 76 to 90 of 95

Q. Declaring a variable involves selecting a name and a __

a. Size

b. Length

c. Style

d. Type

  • d. Type

Q. A group of variables is often called a __ .

a. Linked group

b. Data structure

c. Data object

d. Module

  • b. Data structure

Q. When a variable is __ it is both declared and initialized.

a. Set

b. Instantiated

c. Defined

d. Documented

  • c. Defined

Q. The time factor when determining the efficiency of algorithm is measured by

a. counting microseconds

b. Counting the number of key operations

c. Counting the number of statements

d. Counting the kilobytes of algorithm

  • b. Counting the number of key operations

Q. 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 (A)lgorithm

d. Counting the maximum disk space needed by the algorithm

  • a. Counting The Maximum Memory Needed By The Algorithm

Q. Which of the following case does not exist in complexity theory

a. Best case

b. Worst case

c. Average case

d. Null case

  • d. Null case

Q. The Worst case occur in linear search algorithm when

a. Item is somewhere 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

  • d. Item is the last element in the array or is not there at all

Q. The Average case occur 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 in the array

d. When Item is the last element in the array or is not there at all

  • a. When Item is somewhere in the middle of the array

Q. Finiteness property of an Algorithm is

a. The number of steps in the algorithm should be finite.

b. The algorithm should terminate after a finite no. of times.

c. For all possible combinations of input data, the algorithm terminates after a finite no. of steps.

d. None of above

  • c. For all possible combinations of input data, the algorithm terminates after a finite no. of steps.

Q. Instructions in algorithms should be_____

a. Precise

b. Unambiguous

c. Precise & Unambiguous

d. None of above

  • c. Precise & Unambiguous

Q. As compared to a flowchart, it is easier to modify the_________of a program logic when programmodifications are necessary.

a. Macro flowchart

b. Micro flowchart

c. Terminal

d. Pseudo code.

  • d. Pseudo code.

Q. Algorithm halts in __________

a. Finite time

b. Infinite time

c. Logarithmic time

d. Exponential time

  • a. Finite time

Q. The __ flow chart symbol(s) represents one way flow of control.

a. Processing

b. Decision

c. Terminal

d. All above

  • a. Processing

Q. What is an infinite loop?

a. It is an endless loop

b. It means multiple loops

c. It is a nested loop

d. It is an unclosed loop

  • a. It is an endless loop

Q. The normal flow of flowchart is from

a. Left to Right

b. Right to Left

c. A & D

d. Top to Bottom

  • d. Top to Bottom
Subscribe Now

Get All Updates & News