Part I: Vocabulary from Chapter 1 of ADTs, Data Structures, and Problem Solving with C++

Question 1

Abstract Data Type (ADT)

Answer 1

A data type whose implementation is hidden from the user and is accessed only through a defined interface.

Question 2

Data Structure

Answer 2

A way to organize and store data in a computer so that it can be used efficiently.

Question 3

Encapsulation

Answer 3

The principle of restricting access to the details of an object’s implementation while only exposing necessary functionality.

Question 4

Dynamic Memory Allocation

Answer 4

The process of allocating memory at runtime using pointers and functions like new and delete in C++.

Question 5

Pointer

Answer 5

A variable that stores the memory address of another variable.

Question 6

Reference Variable

Answer 6

An alias for another variable, created using & in C++.

Question 7

Stack vs. Heap

Answer 7

The stack is used for static memory allocation (e.g., local variables), while the heap is used for dynamic memory allocation.

Question 8

Function Prototype

Answer 8

A declaration of a function that specifies its return type and parameters but not its implementation.