Do problem 5.2.3 in the textbook (note that the graph is undirected).
Do problem 5.2.6 in the textbook (note that the graph is directed).
Do problem 5.6.10 in the textbook (sorting a stack of pancakes by flipping substacks).
Do problem 6.1.6 in the textbook (you'll need the formula on p. 126 for the number of comparisons in a merge sort).
Do problem 6.4.2 in the textbook (checking whether a given array, when viewed as a binary tree, is a heap).
Do problem 6.5.10 in the textbook. By "discuss which is more convenient," I mean
Do problems 7.2.1, 7.2.2, and 7.2.3 in the textbook (Horspool string matching).
Read problem 8.1.9 in the textbook, then do the following:
p
of Team A winning any given game,
and the number of games in the
series (you may assume this number is odd); the output is the
probability of Team A winning the series (i.e. winning a majority of
the games). Test and time
your program on a variety of series sizes and probabilities.You're a network administrator concerned about terrorist attacks, either on computers in the network or on cables between computers. You want to know whether