Theory Exam 2 contains only multiple choice or short answer problems. You will have 50 minutes to complete this exam.
A list of topics will be announced closer to the exam.
Topics from lecture (topics go through the first 10 minutes on Monday’s lecture; all BST concepts, no AVL trees):
new
/delete
)insertAtFront
, including running time, resize strategies, and proofsinsertAtIndex
, including running time, on both a sorted and unsorted listremoveAtIndex
, including running time, on both a sorted and unsorted listinsertAfterElement
, including running time, on both a sorted and unsorted listremoveAfterElement
, including running time, on both a sorted and unsorted listfindIndex
, including running time, on both a sorted and unsorted listfindData
, including running time, on both a sorted and unsorted listinsertAtFront
, including running time and insertion strategiesinsertAtIndex
, including running time, on both a sorted and unsorted listremoveAtIndex
, including running time, on both a sorted and unsorted listinsertAfterElement
, including running time, on both a sorted and unsorted listremoveAfterElement
, including running time, on both a sorted and unsorted listfindIndex
, including running time, on both a sorted and unsorted listfindData
, including running time, on both a sorted and unsorted listpop
, push
, enqueue
, and dequeue
, including running times*
, !=
, and ++
.NULL
pointers in a BST, including prooffind
, including running times in terms of h
and n
insert
, including running times in terms of h
and n
delete
, including running times in terms of h
and n
h
, and propertiesb
Assignments referenced:
Points:70
Registration: Thursday, February 14
Start: Thursday, February 28
End: Sunday, March 03