Unit 2 of 5
Study guide for CLEP CLEP Information Systems — Unit 2: Hardware & Software. Practice questions, key concepts, and exam tips.
52
Practice Questions
11
Flashcards
4
Key Topics
Try these 5 questions from this unit. Sign up for full access to all 52.
A programmer is developing an algorithm to search for a specific value in a large list of numbers. The list is already sorted in ascending order. Which approach would be most efficient for this task?
Answer: B — Binary search is most efficient for a sorted list, as it reduces the search space by half with each iteration.
What type of software controls the hardware and manages system resources?
Answer: C — Operating System is correct because the OS manages hardware and system resources. Application software performs specific tasks.
A company is developing a new mobile app to track personal fitness goals. The development team needs to create an algorithm to calculate the user's daily calorie intake based on their age, weight, and activity level. Which of the following is an appropriate step in designing this algorithm?
Answer: A — To design an effective algorithm, the development team needs to identify the key variables and parameters involved in the calculation, such as age, weight, and activity level.
A programmer is creating a simulation of a coin toss using a random number generator. The programmer wants to generate a random integer that is either 0 or 1, representing heads or tails. Which of the following expressions would achieve this?
Answer: A — The RANDOM function generates a random integer between two specified values, inclusive. To simulate a coin toss, the programmer needs to generate either 0 or 1, which is achieved by using RANDOM(0, 1).
A company has a sorted list of 1024 employee IDs and wants to find a specific ID using the binary search algorithm. How many iterations of the binary search algorithm are required to guarantee finding the ID or determining it is not in the list?
Answer: A — Since binary search divides the search space in half with each iteration, it takes log2(n) iterations to search a list of n items. For 1024 items, log2(1024) = 10 iterations.
CLEP® is a trademark registered by the College Board, which is not affiliated with, and does not endorse, this product.