Technology Questions

Question 1

binary tree

Answer 1

structure where each node has 2 subnodes

Question 2

Linked list

Answer 2

Each link has a value and a pointer to the next thing in the list. Generally bad to have cycles. O(n) time to find stuff.

Question 3

Stack

Answer 3

Data is pushed to the top of the stack and popped off the stack.

LIFO - last in first out

Inserting and removing is (1)

Question 4

Queue

Answer 4

Opposite of stack

LIFO - Last in first out

Inserting and removing is O(1)

Question 5

Merge Sort

Answer 5

Splits array into 2 smaller arrays, then when it gets to the leaf of a binary tree, sorts leaves. Then recursively floats the solution to the top

It’s O(n log(n)) in average and worst case

Question 6

Quick sort

Answer 6

With array, pick random pivot number. Move things lower than pivot to the left and things more than pivot to the right. Recursively do the same to each subset group.

Question 7

Binary search

Answer 7

For sorted arrays, finding a particular value. Looks at midpoint, then midpoint of left or right, etc

Takes O(log n) time

Question 8

Graph search

Answer 8

depth first - Searches branches 100% before backing out and taking another path

Bredth first search - Go wide before going deep

Need to be careful of cycles and unconnected graphs