Lecture 5: Data Structure

Question 1

What is the unique thing about the data structure: Linked List?

Answer 1

The most powerful thing about a linked list is that it can sort a list of values in different parts of memory. contrary arrays which sort data back-to-back in memory

Question 2

What will happend when we insert a new value in a linked list?

Answer 2

It will allocate memory for both:

• the value we want to store
• the address of the next future value. in other words, these addresses are actually pointers

Question 3

What is ‘node’?

Answer 3

It is the basic unit of a data structure. which has both:

• value
• pointer to another node

Question 4

What is the unique thing about the data structure: Tree?

Answer 4

Using this data structure, each node can only point to 2 children which we call them left child and right child

Question 5

What is the unique thing about the data structure: Hash table?

Answer 5

it can associate keys with values.

Question 6

What is the unique thing about the data structure: Trie?

Answer 6

it is actually a tree with arrays as nodes so each array points to another array whenever it found the desired value

Question 7

What is the order of the data structure: Queue?

Answer 7

First In First Out (FIFO) it is like a line of people waiting 👫
To add a value we enqueue it, and to remove a value we dequeue it. We could use a growing array or a linked list.

Question 8

What is the order of the data structure: Stack?

Answer 8

Last In First Out (LIFO) it is like stacked plates over one another in the canteen. The last plate which is at the top is the first one to be removed

Question 9

The graph is a different data structure that basically

Answer 9

connects a mutable set of nodes (also called vertices) together using edges (also called links or lines)

The Graph is composed of a set of vertices( V ) and a set of edges (E)

G(E, V)