graphs/heaps
9 views
Skip to first unread message
tennis_pro
May 1, 2007, 1:22:36 AM5/1/07
to Kesden-111
Will we have to know postfix/infix algorithms. Also, will the
questions on graphs/heaps specific implementation questions ?
questions on graphs/heaps specific implementation questions ?
Greg
May 1, 2007, 6:22:14 PM5/1/07
to Kesden-111
The postfix/infix questions are good examples. But, they are just
examples. If they were used on the exam, they would come with some
minimum explanation of the representation.
examples. If they were used on the exam, they would come with some
minimum explanation of the representation.
Anything heap related is fair game. You should be the master of
heaps.
The details of particular graph algorithms will not be covered.
Reply all
Reply to author
Forward
0 new messages