Computer Programming and Data Structures

These flashcards cover key terms and definitions related to computer programming concepts discussed in the lecture.

Compiler

A program that checks code for syntax errors and prepares it for linking.

Linker

Connects various pieces of code together into a running program.

Variable

A named space in memory that holds a value that may change during execution.

Algorithm

A step-by-step procedure for solving a problem or performing a task.

Pseudocode

A high-level description of a computer program that uses the structural outline of coding without the syntax.

Data Type

A classification that specifies which type of value a variable can hold.

Boolean

A data type that can hold one of two values: true or false.

Function

A block of code that performs a specific task, often returning a value.

Object

An instance of a class that encapsulates both data and behavior.

Encapsulation

A principle of OOP that restricts access to certain components of an object.

Inheritance

A mechanism in OOP that allows one class to inherit characteristics and behaviors from another.

Polymorphism

The ability of different classes to be treated as instances of the same class through a common interface.

Array

A collection of elements, each identified by an array index or key.

Loop

A programming construct that repeats a block of code as long as a specified condition is true.

Pointer

A variable that stores the memory address of another variable.

Struct

A user-defined data type that groups together variables of different data types.

Dynamic Memory

Memory that can be allocated and freed in real time during program execution.

Preprocessing

The process where directives are processed before actual compilation of the program.

Return Code

A code that indicates the success or failure of a program after it terminates.