QCM : Fundamentals of Algorithms and Data Structures — 12 questions

Explication

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.

Explication

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'.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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.

Explication

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