Name:________________________________________
These questions are over the prerequisite material for the course (undergraduate analysis of algorithms). You should either be able to answer these questions quite easily, or be prepared to do a significant amount of work on your own to learn or review the material. Pretest will be Thu, Sep 4, and count as a homework.
~~~~~~~~~ BINARY HEAPS ~~~~~~~~~
2 / \ 8 5 / \ / 10 9 6
~~~~~~~~~ SORTING ~~~~~~~~~
~~~~~~~~~ BINARY SEARCH TREES ~~~~~~~~~
9 / \ 5 12 / \ \ 3 7 15
~~~~~~~~~ HASHING ~~~~~~~~~
~~~~~~~~~ GRAPHS ~~~~~~~~~
Consider the following graph G.
Nodes are labeled a through g.
(Undirected) edges are:
{a,b} with weight 1,
{a,c} with weight 2,
{c,e} with weight 3,
{b,e} with weight 4,
{b,d} with weight 5,
{d,g} with weight 6,
{e,g} with weight 7,
{f,g} with weight 8,
{a,f} with weight 9, and
{a,g} with weight 10.