Тест: Fundamentals of Algorithm and Programming — 8 въпроса

1. What is an algorithm primarily defined as?

A. A finite set of well-defined instructions or steps to solve a problem

B. A random set of actions performed without a specific goal

C. A sequence of unconnected instructions for a task

D. A collection of code snippets written in a programming language

Answer: (A)

Обяснение

An algorithm is defined as a finite set of well-defined instructions or steps designed to solve a specific problem, ensuring clarity, correctness, and finiteness, as explicitly stated in the course content.

2. Which keyword is used in C/C++ to declare a constant?

A. final

B. const

C. static

D. immutable

Answer: (B)

Обяснение

In C and C++, the keyword 'const' is used to declare constants, ensuring their values do not change during program execution. The other options are either from different languages or do not serve the purpose of declaring constants in C/C++.

3. What is the primary function of data types and assignments in programming?

A. To specify the kind of data a variable can hold and assign values to it

B. To define the structure and organization of the program code

C. To control the flow of the program based on conditions

D. To manage memory allocation and deallocation during execution

Answer: (A)

Обяснение

Data types specify the kind of data that variables can hold, such as integers or strings, while assignments give specific values to these variables. Together, they enable variables to store and represent data correctly, which is fundamental to programming.

4. When were control structures such as if statements and loops formally established or popularized in programming?

A. 1980s

B. 1950s

C. 1968

D. 1975

Answer: (C)

Обяснение

Control structures like if statements and loops were formally established and gained prominence in programming with the publication of Edsger Dijkstra's paper on structured programming in 1968, which introduced and popularized these concepts for writing clearer and more reliable code.

5. How do input and output differ in programming?

A. Input receives data from the user, while output displays data to the user.

B. Input displays data to the user, while output receives data from the user.

C. Both input and output are used to receive data from external sources.

D. Input and output are interchangeable and serve the same purpose.

Answer: (A)

Обяснение

Input and output serve opposite functions in programming: input receives data from external sources like users, while output displays or sends data to users. They are complementary but distinct processes, with input focusing on data intake and output on data presentation.

6. Who is credited with formalizing the analysis of algorithm efficiency?

A. Donald Knuth

B. Grace Hopper

C. Edsger Dijkstra

D. Alan Turing

Answer: (A)

Обяснение

Donald Knuth is widely recognized for his pioneering work in analyzing and formalizing the properties of algorithms, including their efficiency and complexity, notably through his multi-volume work 'The Art of Computer Programming'.

7. What is the effect of using control structures like 'if' statements and loops in programming?

A. They increase the program's memory usage significantly

B. They cause decision-making and repetition within the program

C. They improve code readability and maintainability

D. They automatically optimize the program's efficiency

Answer: (B)

Обяснение

Control structures such as 'if' statements and loops directly cause decision-making and repetition in a program's execution flow, enabling dynamic and iterative behavior essential for solving complex problems.

8. When applying problem solving strategies in programming, what is a practical first step to ensure an effective solution?

A. Choose a random algorithm without understanding the problem

B. Start coding immediately without analyzing the problem

C. Decompose the problem into smaller parts to understand it better

D. Ignore pattern recognition and focus only on trial-and-error

Answer: (C)

Обяснение

The first practical step in applying problem solving strategies is to decompose the problem into smaller, manageable parts, which helps in understanding and tackling it systematically.