Q#1: What problem is the paragraph primarily focused on solving?
(A) Sorting names alphabetically
(B) Finding a specific target value in a list
(C) Iterative loop control
(D) Repetitive algorithm design
Answer: (B) Finding a specific target value in a list
Q#2: In what order does the paragraph suggest the list is sorted?
(A) Random order
(B) Order of appearance
(C) Alphabetical order
(D) Order of decreasing magnitude
Answer: (C) Alphabetical order
Q#3: What happens when the search reaches a name greater than the target name in an alphabetical list?
(A) The search terminates as a success
(B) The search continues
(C) The search terminates as a failure
(D) The search resets to the beginning of the list
Answer: (C) The search terminates as a failure
Q#4: In the pseudocode, what determines the termination of the search?
(A) The number of entries in the list
(B) The value of the target
(C) The comparison of the test entry and target value
(D) The alphabetical order of the list
Answer: (C) The comparison of the test entry and target value
Q#5: What is the purpose of the “if (List is empty)” statement in the pseudocode?
(A) To check if the list is sorted
(B) To declare a search success
(C) To check if the list is not empty
(D) To handle the case where the list contains no entries
Answer: (D) To handle the case where the list contains no entries
Q#6: Which module discusses the concept of loop control activities such as initialize, test, and modify?
(A) Module 97
(B) Module 98
(C) Module 99
(D) Module 100
Answer: (B) Module 98
Q#7: What is the termination condition for the while loop in the statement “while (the pH level is greater than 4): add a drop of sulfuric acid”?
(A) pH level is less than or equal to 4
(B) pH level is greater than 4
(C) pH level is equal to 4
(D) pH level is not mentioned
Answer: (A) pH level is less than or equal to 4
Q#8: In the “FindMax” function, what is the initial value of “max”?
(A) The last number in the list
(B) The average value of the numbers in the list
(C) The first number in the list
(D) The maximum possible value
Answer: (C) The first number in the list
Q#9: How is the loop in the “FindFactorial” function controlled?
(A) Using a for loop
(B) Using a repeat-until loop
(C) Using a while loop
(D) Using an if statement
Answer: (C) Using a while loop
Q#10: What does the statement “i=i+1;” do in the “FindFactorial” function?
(A) Adds 1 to the value of “i”
(B) Multiplies “i” by 1
(C) Sets “i” to 1
(D) Subtracts 1 from the value of “i”
Answer: (A) Adds 1 to the value of “i”
Q#11: What is a pretest loop in the context of iterative structures?
(A) A loop that tests a condition after executing the loop body
(B) A loop that does not involve any testing
(C) A loop that tests a condition before executing the loop body
(D) A loop that tests multiple conditions simultaneously
Answer: (C) A loop that tests a condition before executing the loop body
Q#12: What is a posttest loop in the context of iterative structures?
(A) A loop that tests a condition before executing the loop body
(B) A loop that tests a condition after executing the loop body
Answer: (B) A loop that tests a condition after executing the loop body
Q#13: What is the primary constraint when sorting a list of names into alphabetical order?
(A) The list must be sorted in reverse order
(B) The list must be shuffled into another location
(C) The list must be sorted in descending magnitude
(D) The list must be sorted within itself
Answer: (D) The list must be sorted within itself
Q#14: In the example provided, what is the first step in sorting the list of names?
(A) Shuffling the list
(B) Picking up the card with the name Alex
(C) Checking if the list is empty
(D) Sliding the name Fred down
Answer: (B) Picking up the card with the name Alex
Q#15: What is the ultimate goal of the sorting process described in the paragraph?
(A) To move the list to another location
(B) To create a shuffled list
(C) To sort the list within itself
(D) To reverse the order of the list
Answer: (C) To sort the list within itself
Q#16: Which module provides additional information on sorting a list of names?
(A) Module 99
(B) Module 100
(C) Module 101
(D) Module 102
Answer: (D) Module 102
Q#17: How is the sorting process in the example represented in Figure 85 achieved?
(A) By shuffling the list
(B) By moving the list to another location
(C) By inserting names into the list
(D) By sorting the list in reverse order
Answer: (C) By inserting names into the list
Q#18: What is the value of “f” at the end of the “FindFactorial” function when executed for n=5?
(A) 1
(B) 2
(C) 6
(D) 120
Answer: (D) 120
Q#19: What does the termination condition “i<=n” represent in the “FindFactorial” function?
(A) The loop will run indefinitely
(B) The loop will terminate when “i” becomes equal to “n”
(C) The loop will run only once
(D) The loop will terminate when “i” is greater than “n”
Answer: (B) The loop will terminate when “i” becomes equal to “n”
Q#20: What is the primary focus of Module 101 in the given text?
(A) Sorting algorithms
(B) Pretest loops
(C) Posttest loops
(D) Loop control activities
Answer: (B) Pretest loops