Lecture 1: Fundamentals of Computer Science and Programming

Data in computer science refers to facts, concepts, and instructions presented in a format suitable for exchange or processing.

An algorithm is considered discrete as it is characterized by a specific sequence of instructions and actions, meaning it breaks down the problem into smaller steps.

Determinism in algorithms refers to the consistent production of the same output for the same input set.

The property of an algorithm guaranteeing completion within a finite timeframe is called termination.

An algorithm is considered massive if it can be applied to a range of similar problems, or a class of tasks.

Imperative programming focuses on changing the value of a variable by assigning new values, permanently altering the old ones.

Declarative programming is characterized by describing the desired outcome or goal, rather than the sequence of steps to achieve it.

Metaprogramming involves a program manipulating other programs or itself as an object, providing control over the program's own structure and behavior.

In structured programming, a program's structure is defined by blocks with a single entry and a single exit point.

Object-oriented programming (OOP) describes a program as a collection of interacting objects, each with its own data and behavior, communicating through messages.