Lecture 6

Question 1

What is a pointer?

Answer 1

Question 2

What are the two operations of dynamic sets?

Answer 2

Question 3

What is an array?

Answer 3

Question 4

What are the costs of operations of sorted/unsorted arrays?

Answer 4

Question 5

What is a stack?

Answer 5

Question 6

What is a queue?

Answer 6

Question 7

What is a (singly/doubly) linked list?

Answer 7

Question 8

What are the costs of operations for linked lists?

Answer 8

Question 9

What is a hash table? What is the main idea?

Answer 9

Question 10

When can we used direct addressing for hash table? How does direct addressing work?

Answer 10

Question 11

What is the runtime of a hash table with direct addressing for the different operations?

Answer 11

Question 12

What is the disadvantage of direct addressing hash table?

Answer 12

Question 13

What is a hash function?

Answer 13

Question 14

What is a collision in a hash table? How can this be solved?

Answer 14

Question 15

What is chaining?

Answer 15

Question 16

What are the runtimes for operations of a hash table when using chaining?

Answer 16

Question 17

What is the worst case runtime for search in a hash table using chaining?

Answer 17

Question 18

What is universal hashing?

Answer 18

Question 19

What is the definition of the universal hash function?

Answer 19

Question 20

What is the expected runtime for universal hashing with chaining? How is it calculated?

Answer 20

Question 21

What is a well-known universal hash function?

Answer 21