The College of New Jersey
Computer Science Department
CMSC410: Advanced Algorithms
FALL 2001


MIDTERM EXAM HINTS

When
                   :     Thursday, October 18, same classroom.
 

What is Allowed
                   :     One sheet of notes (both sides, point 10 size minimum).
                         No extra devices.

Format      :
                         (i)    Three problems

                         (ii)   Problem (1) : Prove that the following function ?????
                                                       = O(?), or Q(?), or W(?).
                                                       (~ 30 points)
                                 Problem (2) : Given the following excerpt from a
                                                       program, derive its time complexity
                                                       formula.
                                                       (~ 30 points)
                                 Problem (3) :  The following implementation for the
                                                        ??? abstract data type given in class
                                                        could be improved by doing the
                                                        following : ????.
                                                        Now, for this new implementation,
                                                        provide the code for its member
                                                        method ??? that will do ????. Then,
                                                        derive its time complexity formula.
                                                        (~ 40 points).
 

How to best prepare for the Midterm Exam :
                        (i)    Go over the examples given in class.
                        (ii)   Go over the homework assignments.
                        (iii)  Do not assume that the teacher is exceptionally
                                mean.