data-structures

Question 1

LIFO?

Answer 1

Last In First Out

Question 2

what methods are available on a Stack data structure?

Answer 2

peek push pop

Question 3

what must you do to access the value at an arbitrary point in a stack?

Answer 3

pop repeatedly until the end?

Question 4

time complexity of stack?

Answer 4

O(n)

Question 5

What does the acronym FIFO mean?

Answer 5

first in first out

Question 6

What methods are available on a Queue data structure?

Answer 6

peek, enqueue, dequeue

Question 7

What must you do to access the value at an arbitrary point in a queue (not just the “front”)?

Answer 7

dequeue from the front until you get the element that we’re looking for

Question 8

how are linked lists different from an array?

Answer 8

An array is a collection of elements of a similar data type. Linked List is an ordered collection of elements of the same type in which each element is connected to the next using pointers. (sequential)

Question 9

how would you access an arbitrary node in a linked list (not just the “head”)?

Answer 9

start from the beginning and jump to node to node O(n) linear time