Martin F rer
Data Structures and Algorithms
Problems 1, 2, and 3 are for practice and not to be handed in.
1. [0 points] Solve Exercise 4.1-1 on page 74 of the Textbook.
What does Find-Maximum-Subarray re
The prevention of unauthorized use of a
resource, including the prevention of use
of a resource in an unauthorized manner
central element of computer security
assume have users and groups
authenticate to system
8.1 Lower bounds for sorting
Information-theoretic lower bound
Information theoretic lower bounds for
comparison based tasks (like sorting,
Restricted model of computation:
Comparison based algorithms
Find the n
An ADT with the 3 essen-al dynamic set
is called a dic-onary.
11. Hash Tables
Implementa-ons of dic-onaries:
Midterm I. (22C:231, Spring 2011)
Open Book and Notes, total points = 100
1. Greedy Algorithms (25)
(a) (10) What is an optimal human code for the following set of letters whose frequencies
are based on the rst 8 Fibonacci numbers?
a : 1 b : 1 c : 2 d : 3