Advanced Algorithms

Question 1

What is an algorithm?

Answer 1

(Informally) Any well-defined computational procedure that takes a set of values as input and produces a set of values as output.

An algorithm is a sequence of computational steps that transforms the input into the output.

Question 2

What are the 4 basic data structures?

Answer 2

Arrays - Fixed size and contiguous (in a sequence) in memory

Multi-dimensional arrays -

Lists - A dynamic array

Strings - One dimensional arrays of characters ended by a null character

Question 3

What is Big O?

Question 4

What are the examples of Big O?

Question 5

What is the difference between arrays, strings and lists?

Question 6

How to choose a sort algorithm?

Answer 6

These are the different factors that determines what sorting algorithm you use:

-Size of the data set
-Degree of order
-The distribution of the data set
-The amount of information associated with each data item

Question 7

What are the advantages and disadvantages of bubble, selection, merge and quick sorts?

Question 8

What is the difference between divide and conquer and dynamic programming?

Question 9

What is the difference AVL and Red-black trees?

Question 10

Why do we need heaps and treaps?

Question 11

Where do we use B-trees?

Question 12

What are tuples?

Question 13

What are sets?

Question 14

What are dictionaries?

Question 15

What are the features of stacks and queues?

Question 16

When and why do we use linked lists?

Question 17

What is the difference between singly, doubly, and circular linked lists?

Question 18

Why do we use hash tables?

Question 19

What happens if a collision happens in a hash table and how do you avoid them?

Question 20

What is the load factor in a hash table?

Question 21

What are the differences for four types of linked lists? not sure what that means

Question 22

Which data structures are dynamic and what does dynamic mean?

Question 23

Why and when do we use AVL?

Question 24

Why and when do we use Red-black?

Question 25

Why and when do we use Splay?

Question 26

Why and when do we use Heap?

Question 27

Why and when do we use B-tree?