Data Structures

Question 1

What is an ADT?

Answer 1

An ADT is a data type that has its own unique operations which define how data should interact with a
variable of that data type.

It is a type or class for objects whose behaviour is defined by a set of values and a set of operations.

Question 2

What is a Stack?

Answer 2

• A set of objects on top of one another.
• A stack is a last in first in (LIFO) ADT which can be created using an array and a variable called top.

Question 3

Stack Operations

Answer 3

• Push( ) - add values to a stack
• Pop ( ) - removes a value fro the stacks, from the top.
• isFull ( ) - returns true if the ADT is full (no data can be added to it)
• isEmpty ( ) - returns true if the ADT is empty (no data can be removed from it)

Question 4

What is a Queue?

Answer 4

• A set of objects forming a line where the first one who is in the line is the first one addressed.
• New objects are formed to the end of the line.
• Objects removed from the front are added to the end (FIFO).

Question 5

Queue Operations

Answer 5

• Enqueue ( ) - adds a value to the end of the queue.
• Dequeue ( ) - deletes a value from the front of the queue.
• isFull ( ) - returns true if the ADT is full (no data can be added to it)
• isEmpty ( ) - returns true if the ADT is empty (no data can be removed from it)

Question 6

What is a Linked List?

Answer 6

• A Linked List is a linear data structure.
• The elements are linked using pointers.
• They include a series of connected nodes and each node stores the data and the address of the next node.