Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 100
Q1481:
How does the FindFactorial() function determine when to stop executing?
A. It stops when i exceeds n
B. It stops when f exceeds n
C. It stops when i equals n
D. It stops when f equals n
Correct Answer:
A
Chapter: 101
Q1482:
What is another name for a while loop structure in a more generic context?
A. Pretest loop
B. Posttest loop
C. For loop
D. Nested loop
Correct Answer:
A
Chapter: 101
Q1483:
What type of loop tests for termination before executing the body?
A. Pretest loop
B. Posttest loop
C. Infinite loop
D. Recursive loop
Correct Answer:
A
Chapter: 101
Q1484:
In which type of loop is the test for termination performed after the body of the loop has executed?
A. Posttest loop
B. Pretest loop
C. For loop
D. Do-while loop
Correct Answer:
A
Chapter: 101
Q1485:
What does a pretest loop do before executing the loop body?
A. Tests for termination
B. Executes the body
C. Initializes variables
D. Modifies variables
Correct Answer:
A
Chapter: 101
Q1486:
What is the main difference between a pretest loop and a posttest loop?
A. The timing of the termination test
B. The number of iterations
C. The type of variables used
D. The complexity of the body
Correct Answer:
A
Chapter: 101
Q1487:
Which of the following is an example of a pretest loop?
A. While loop
B. Repeat loop
C. For loop
D. Do-while loop
Correct Answer:
A
Chapter: 101
Q1488:
Which loop structure would you use if you want to ensure that the loop body is executed at least once?
A. Posttest loop
B. Pretest loop
C. For loop
D. Infinite loop
Correct Answer:
A
Chapter: 101
Q1489:
What type of loop structure is represented by the pseudocode do { ... } while (condition);?
A. Posttest loop
B. Pretest loop
C. For loop
D. While loop
Correct Answer:
A
Chapter: 101
Q1490:
In a posttest loop, when is the condition checked?
A. After the body of the loop
B. Before the body of the loop
C. During each iteration
D. Only once before execution
Correct Answer:
A
Chapter: 101
Q1491:
Which loop structure is best suited for cases where the number of iterations is known beforehand?
A. For loop
B. While loop
C. Repeat loop
D. Do-while loop
Correct Answer:
A
Chapter: 101
Q1492:
How does a pretest loop handle situations where the condition is false initially?
A. It does not execute the loop body
B. It executes the loop body once
C. It may cause an infinite loop
D. It skips the termination test
Correct Answer:
A
Chapter: 101
Q1493:
What kind of loop structure would you use to repeatedly execute a block of code while a condition remains true?
A. Pretest loop
B. Posttest loop
C. Nested loop
D. Iterative loop
Correct Answer:
A
Chapter: 101
Q1494:
What is a key characteristic of a posttest loop?
A. The body is always executed at least once
B. The loop condition is evaluated before execution
C. It is less flexible than a pretest loop
D. It cannot be used for finite iterations
Correct Answer:
A
Chapter: 101
Q1495:
In which loop structure is the condition checked at the end of the loop body?
A. Posttest loop
B. Pretest loop
C. For loop
D. Infinite loop
Correct Answer:
A
Chapter: 101
Q1496:
If you need to ensure that a loop runs at least once regardless of the condition, which type of loop should you use?
A. Posttest loop
B. Pretest loop
C. For loop
D. While loop
Correct Answer:
A
Chapter: 102
Q1497:
What is the primary goal of the Insertion Sort Algorithm?
A. To sort a list within itself
B. To merge two lists
C. To reverse the order of a list
D. To find the maximum value in a list
Correct Answer:
A
Chapter: 102
Q1498:
In the Insertion Sort Algorithm, what is the initial state of the list?
A. The list is partially sorted
B. The list is fully sorted
C. The list is unsorted
D. The list is sorted in reverse order
Correct Answer:
C
Chapter: 102
Q1499:
Which name is used as an example of the Insertion Sort Algorithm in Module 102?
A. Fred
B. Byron
C. Alex
D. Diana
Correct Answer:
A
Chapter: 102
Q1500:
What is the first step in sorting the list Fred, Alex, Diana, Byron, Carol using Insertion Sort?
A. Move Alex before Fred
B. Move Diana before Fred
C. Move Carol to the end of the list
D. Move Fred to the end of the list
Correct Answer:
A