1.4.2 Data Structures

Question 1

What is a stack?

Answer 1

-A stack is a linear data structure that follows LIFO.
-It allows insertion and deletion of elements at only one end call the top.

Question 2

What is a queue?

Answer 2

-A queue is a linear data structure that follows FIFO.
-It allows insertion of elements at one end called the rear and deletion of elements at the front.

Question 3

What is a linked list?

Answer 3

-A linked list a is a data structure that consists of a series of nodes.
-Each node contains a value and reference to the next node in the list.
-It allows for efficient insertion and deletion.

Question 4

What is a tree?

Answer 4

• non linear data structure
  -it has a root node and each node can have one or more child nodes.
  -they can be used for searching and sorting

Question 5

What is a node?

Answer 5

-A node is a point in a system where data is stored, processed or passed between other points.

Question 6

What is a hash table?

Answer 6

-A hash table uses a hash function to map keys to indices in an array
-Commonly used in to implement dictionaries and sets

Question 7

What us a heap?

Answer 7

• It is specialized tree based structure that states that either the parent node is less than or equal to or greater than each of its children
  -Used for sorting finding min and max element in a set

Question 8

What is an array?

Answer 8

-An array is a linear data structure that stores a fixed size collection of elements of the same type.

Question 9

What is priority queue?

Answer 9

-its a data structure that stores elements with priority values and allows for efficient extraction of the element with the highest or lowest priority

Question 10

What is a tuple?

Answer 10

-similar to a list but it is immutable (the elements within it can not be modified or changed)