Introduction to Algorithms and Data Structures

mid asf

What is a Data Structure?

A way of organizing and storing data efficiently.

What are primitive data types?

Basic data types such as int and char.

What is an Algorithm?

A step-by-step process to manipulate data and solve problems.

What must an algorithm be in order to be considered valid?

Finite, provide an output, and follow a structured approach.

What is an Abstract Data Type (ADT)?

A logical description of data storage and operations without implementation details.

What does the push() operation do in a Stack?

It adds an item to the stack.

In a Queue, what does the enqueue() operation do?

It adds an item to the queue.

What is the difference between Linear and Non-Linear Data Structures?

Linear structures have sequential order, while non-linear structures do not.

What is an example of a Non-Linear Data Structure?

Tree or Graph.

What is the main advantage of Dynamic Data Structures?

They can grow or shrink as needed.

What does memory fragmentation occur from?

Continuous allocation/deallocation of memory in dynamic structures.