Computer Science Quiz

What does the term "Algorithm" refer to in computer science?

• A) A problem with a yes/no answer.

• B) A finite set of instructions that accomplish a task.

• C) A model in which programs are broken into small pieces.

• D) A process of encoding messages.

Which of the following best describes "Linear Search"?

• A) A search algorithm that checks each element of a list until the desired value is found.

• B) A search algorithm that finds the middle value first.

• C) A search algorithm that requires elements to be sorted.

• D) A search algorithm that is used only in parallel computing.

What is meant by "Efficiency" in the context of algorithms?

• A) The speed at which a computer program runs.

• B) The ability to solve problems with a yes/no answer.

• C) The measure of how many steps are needed to complete an algorithm.

• D) The process of breaking down a program into smaller parts.

What is the purpose of "Symmetric Key Encryption"?

• A) To record every keystroke made by a computer user.

• B) To reverse encryption and reproduce the original plain text.

• C) To encode messages so only "authorized" parties can read it.

• D) Involves one key for both encryption and decryption.

Which term describes a technique that tricks a user into providing personal information?

• A) Rogue Access Point

• B) Phishing

• C) Keylogging

• D) Encryption

What is the primary goal of studying algorithms in computer science?

• To create complex problems

• To understand how they work and why some are more efficient than others

• To study only their time complexity

• To focus solely on space complexity

What distinguishes an efficient algorithm from an inefficient one?

• Efficient algorithms are harder to understand

• Efficient algorithms can solve a problem quickly with minimal use of resources

• Inefficient algorithms are used more frequently in practice

• Inefficient algorithms focus on solving complex problems only

What does the time complexity of an algorithm usually measure?

• The amount of memory an algorithm uses

• The number of basic operations an algorithm performs as the size of the input increases

• The speed of the computer running the algorithm

• The number of problems an algorithm can solve

Which of the following best describes an algorithm with a time complexity of O(n^2)?

• It grows faster as the input size increases

• It remains constant regardless of the input size

• It decreases as the input size increases

• It does not change with changes in input size

What is the definition of undecidable problems in computer science?

• Problems that can be solved in polynomial time

• Problems that have an algorithm but it is not efficient

• Problems for which there is no known algorithm or method for solving them

• Problems that can be solved using a large amount of memory