AlgorithmsQuiz#1-Prelim

You are evaluating four proposed procedures for solving different computational problems. Each claims to be an algorithm, but one of them lacks a fundamental property that all algorithms must have. Which characteristic is NOT an essential requirement for an algorithm?

• Finite – The procedure must complete after a limited number of steps

• Reliable – The procedure should always produce accurate results in real-world conditions

• Executable – The steps must be clear and implementable

• Solves a Problem – The procedure must address a defined problem

A cryptography application needs to convert passwords into secure fixed-size values before storing them in a database. Which algorithm type is most appropriate?

• Iterative – to process each password in a loop

• Recursive – to break the password into smaller strings

• Hashing – to generate fixed-size encrypted values

• Greedy – to pick the best security setting

What is the first step in algorithmic problem solving?

• Understanding the Problem

• Designing an Algorithm

• Implementing the Algorithm

• Testing and Debugging

An online food delivery app needs to suggest the quickest route for its riders. The traffic data changes every few minutes. Which algorithm type would best handle this and why?

• Brute Force – checks every possible path each time

• Greedy – takes the best local choice without considering the whole route

• Dynamic Programming – stores results of overlapping subproblems for reuse

• Iterative – loops through possible roads until it finds a solution

A teacher is grading a list of students alphabetically by surname. Which algorithm type would most efficiently accomplish this task with minimal manual steps?

• Hashing

• Sorting Algorithm

• Backtracking

• Recursive Search

A new trainee claims that an algorithm is “a set of infinite rules or instructions” because computers can run programs indefinitely. As a mentor, you need to clarify their misunderstanding. Which of the following best defines what an algorithm truly is?

• A set of infinite rules or instructions to be followed in calculations or other problem-solving operations.

• A procedure for solving a mathematical problem in a finite number of steps, often involving recursive operations.

• A random sequence of steps to solve a particular problem.

• A method of data storage and retrieval.

A security researcher is trying to guess a 4-digit PIN code by testing every possible combination. Which algorithm is being applied, and in what scenario is it acceptable?

• Divide and Conquer – for small datasets

• Greedy – to find the most common PINs first

• Brute Force – acceptable only for small input sizes

• Recursive – for breaking the problem into smaller codes

While building a Sudoku solver, the developer chooses backtracking instead of brute force. Which advantage does backtracking provide?

• It guarantees the fastest possible solution in all cases

• It skips invalid paths early, reducing unnecessary computation

• It avoids recursion

• It works only with numerical puzzles

You’re implementing a Divide and Conquer algorithm for image compression. Which characteristic makes this approach suitable?

• It works only on sorted data

• It handles overlapping subproblems

• It breaks a large problem into independent smaller parts

• It uses hashing for quick access

A developer is writing a program to solve the Tower of Hanoi problem. Which algorithm type is most suitable, and why?

• Iterative – because it uses loops for repeated moves

• Recursive – because the solution involves breaking the problem into smaller similar problems

• Hashing – because it retrieves stored disk positions

• Brute Force – because it tries all possible moves