EOU Assessment: 1.3 Search Algorithms

1. Fill in the Blanks

Instructions: Complete the sentences below using the correct term from the word bank. Each word is used once.

a. A is a series of methodical steps or instructions followed by a computer to locate a specific data value within a dataset.

b. The word means moving in a single, direct line or progressing from one point to the next in order.

c. The specific data value, number, or text string that an algorithm is tasked to locate is called the .

d. A linear search checks data in a strict order, inspecting elements one by one.

e. Searching algorithms are essential because computer data is frequently stored in an fashion.

2. Multiple Choice Questions

Instructions: Select the best option for each question.

1. Which of the following best describes how a linear search operates?

A. It picks items randomly until it locates the target.

B. It divides the list in half and checks the middle item.

C. It starts at the beginning and checks each item one by one in sequence.

D. It sorts the list alphabetically before searching.

2. Why can't a computer search a list of items the exact same way a human does?

A. Computers cannot process numbers as quickly as humans.

B. Humans can view an entire list simultaneously, whereas a computer evaluates only one memory location at a time.

C. Computers can only search data if it is sorted in numerical order.

D. Humans use search engines to locate stored memory locations.

3. What happens when a linear search reaches the end of a list without finding the target item?

A. It starts searching again from the middle of the list.

B. It rearranges the list in alphabetical order and retries.

C. It picks a random item from the data set.

D. It concludes that the item is not present and terminates the search.

4. Which of the following is a real-world application of a searching algorithm?

A. Verifying a matching username and password when logging into a website.

B. Turning off a computer monitor during inactivity.

C. Formatting text inside a word processing document.

D. Drawing shapes on a digital canvas.

5. A search engine uses searching algorithms to rank web pages. Why is algorithm efficiency important to search engines?

A. Efficient search algorithms allow computers to view all internet files simultaneously.

B. Finding accurate results quickly attracts more users to the search engine.

C. Algorithms convert unordered text into graphical images automatically.

D. Fast algorithms eliminate the need for computer memory locations.

6. What is a "random search" algorithm?

A. An algorithm that inspects items sequentially from end to start.

B. An algorithm that selects items arbitrarily until the target is found.

C. An algorithm that sorts items into alphabetical order before checking.

D. An algorithm that evaluates all items simultaneously.

3. One-Word Answers

Instructions: Write the single correct word for each statement.

a. Name the systematic, step-by-step approach followed to complete a computational task.

b. What term describes data that is arranged in a chaotic, non-sorted order?

c. What step-by-step process stops immediately as soon as its target item is matched?

d. What isolated storage area inside a computer's memory does a processor check when evaluating a single data item?

4. Match the Following

Instructions: Drag the definitions/examples from Column B into the correct slot matching Column A terms.

Target

Drop matching description here

Linear Search

Drop matching description here

Methodical

Drop matching description here

Search Application

Drop matching description here

Column B (Definitions / Examples)

A. A system searching an extensive database file to match a user's input credentials during login.

B. Completing a task by strictly adhering to a systematic, ordered, step-by-step plan.

C. The specific value or text character that an algorithm is instructed to locate.

D. Inspecting elements one after another from the absolute beginning to the end of a list.

5. Arrange in Proper Sequence

Instructions: Place the following procedural steps into their correct chronological order (numbered 1 to 5).
Scenario: Executing a linear search on a list of items for a specific target value.

Compare the value of the active item against the target value.

If the current item does not match, move to the next consecutive item in the list.

Look at the absolute first item at the beginning of the list.

If a match is found, terminate the search and display success.

Repeat comparisons until the target is located or no items remain to check.

6. True or False

Instructions: State whether each statement is True or False. If False, write a one-sentence correction.

a. Data must always be sorted in alphabetical or numerical order before performing a simple linear search.

True False

b. A computer processor can view and compare all items in a list simultaneously.

True False

c. A searching algorithm will continue running indefinitely even after locating its target value.

True False

d. Searching for a lost file on a computer drive using a filename keyword is an example of a searching algorithm in use.

True False

e. A random search is always faster than a linear search when dealing with unsorted lists.

True False

f. If an algorithm reaches the end of an array without finding the target item, it concludes the item does not exist in the dataset.

True False

7. Short Recall

Instructions: Answer the short recall prompts below.

a. List any three real-world computer programs or system actions that rely on searching algorithms to function.

b. List any two reasons why searching algorithms are fundamentally necessary in computer software.

Student Details

1. Fill in the Blanks

2. Multiple Choice Questions

3. One-Word Answers

4. Match the Following

Column B (Definitions / Examples)

5. Arrange in Proper Sequence

6. True or False

7. Short Recall