Quiz: Fundamentals of Algorithms and Data Structures — 12 perguntas

1. What is an algorithm primarily characterized as?

A. A finite, well-ordered sequence of elementary operations that specifies a calculation scheme

B. A data structure used to organize and store data efficiently

C. A set of instructions written in a specific programming language for execution

D. A process that transforms input data into output data through a series of steps

Answer: (A)

Explicação

The correct answer is the first option because an algorithm is defined as a finite, well-ordered sequence of elementary operations that provides a calculation scheme, as per the Encyclopaedia Universalis. The other options describe related concepts but do not capture the core definition of an algorithm.

2. Who is the historical figure from whom the term 'algorithm' is derived?

A. Euclid

B. Wirth

C. Al-Khwarizmi

D. Babylonians

Answer: (C)

Explicação

The term 'algorithm' is derived from the name of the Persian mathematician Al-Khwarizmi, whose work in the 9th century laid the foundations for systematic calculation methods, and the name was later Latinized to 'algorithm'.

3. What is the primary role of a program in computing?

A. A program is a hardware component responsible for processing data.

B. A program provides a sequence of instructions that the computer follows to perform a specific task.

C. A program is a user interface that allows interaction with the computer.

D. A program is a data storage system used to save information.

Answer: (B)

Explicação

The primary role of a program is to provide a sequence of instructions that the computer follows to perform specific tasks, guiding hardware operations to achieve desired results.

4. When was the notion of algorithm complexity formally established or developed?

A. In the 9th century AD, with Al-Khwarizmi's work on systematic calculation

B. In the 1800s, during the development of early mechanical calculators

C. In the 3rd century BC, with Euclid's work on algorithms

D. In the 1960s, with the formal development of Big O notation and complexity analysis

Answer: (D)

Explicação

The concept of algorithm complexity, especially the formal analysis using Big O notation, was developed in the 1960s, making it the earliest period when the notion was systematically established in computer science.

5. How do sequential search and binary search algorithms differ in their approach to finding an element?

A. Sequential search has a logarithmic time complexity, while binary search has linear complexity.

B. Sequential search works only on sorted data, while binary search works on unsorted data.

C. Both algorithms require the data to be sorted before searching.

D. Sequential search compares elements one by one, whereas binary search repeatedly divides the search interval in half.

Answer: (D)

Explicação

Sequential search compares each element one by one and can be used on any data, while binary search requires sorted data and works by dividing the search interval in half, making it more efficient on sorted data. The correct option correctly describes this fundamental difference.

6. Who is credited with the concept underlying sorting algorithms?

A. Wirth

B. Euclid

C. Al-Khwarizmi

D. The author of the sorting problem

Answer: (C)

Explicação

Al-Khwarizmi, a Persian mathematician from the 9th century, is credited with the development of systematic calculation methods and the origin of the term 'algorithm,' which forms the basis for sorting algorithms.

7. What is the effect of choosing a hash table with chaining collision resolution on the performance of search operations in data structures?

A. It improves search efficiency by allowing constant-time access in the average case.

B. It causes search operations to become more memory-efficient but slower.

C. It has no effect on search performance compared to other data structures.

D. It significantly decreases search efficiency due to complex collision handling.

Answer: (A)

Explicação

Choosing a hash table with chaining collision resolution generally improves search efficiency because, on average, it allows for constant-time access, assuming a good hash function and low load factor. This is a cause-effect relationship where the data structure's properties directly influence algorithm performance.

8. In which practical scenario would you most likely use a stack data structure?

A. Tracking function calls and execution order in a program

B. Scheduling processes in an operating system

C. Managing a print queue in a printer spooler

D. Storing a list of students sorted alphabetically

Answer: (A)

Explicação

Using a stack is most appropriate for managing function calls and execution order because of its Last-In-First-Out (LIFO) nature, which models how function calls are pushed onto the call stack and removed when functions return.

9. What is the fundamental component of a linked list?

A. Array

B. Data field

C. Node

D. Pointer

Answer: (C)

Explicação

A linked list is composed of nodes, each containing data and a pointer to the next node. The node is the fundamental component that links the list together and allows dynamic data management.

10. What is a tree in data structures?

A. A linear collection of elements where each element points to the next, like a linked list.

B. A collection of elements stored in contiguous memory locations, allowing direct access via indices.

C. A set of elements with no particular order, where elements are added or removed arbitrarily.

D. A hierarchical data structure composed of nodes connected by edges, with parent-child relationships and a single root.

Answer: (D)

Explicação

A tree is defined as a hierarchical data structure where each node has a parent (except the root) and zero or more children, forming a hierarchy with a single root node. This matches option 2, which correctly describes a tree.

11. What is the size of an adjacency matrix used to represent a graph with n vertices?

A. n x 2n

B. n x n

C. n x (n+1)

D. n x (n-1)

Answer: (B)

Explicação

The adjacency matrix for a graph with n vertices is an n x n two-dimensional array, where each cell indicates the presence or absence of an edge between vertices. This is explicitly stated in the content.

12. What is the primary role of hashing techniques in data management?

A. To encrypt data for security

B. To validate data integrity

C. To compress data for storage efficiency

D. To facilitate quick data retrieval

Answer: (D)

Explicação

Hashing techniques are primarily used to facilitate quick data retrieval by mapping keys to specific locations in a hash table, enabling efficient access.