DATA STRUCTURES 	CMSC 341
		Mark E Woodcock		Spring 2019
		ITE 201  455-2587       IT 229  (1730-1845)
		woodcock@cs.umbc.edu


JAN    28 Intro	                 30 ADTs (2) 
FEB	4 Stacks (5.1)            6 Queues (5.2)
       11 snow day               13 Deqs (5.3) 
       18 Lists (3.2,3.3)        20 snow day 
       25 Efficiency (4.1)       27 Sort (Sel, Ins) & Eff
MAR     4 Recursion (3.5)         6 Rec II
       11 Bin Search             13 Indexing 
       18 Spring Break 
       25 Search & Traversal     27 AVL Trees (10.2)
APR     1 Exam Prep               3 MIDTERM
        8 Exam Review            10 Heaps, PQ (8)
       15 Hashing (9)            17 2-4 Trees (10.3) 
       22 Splay Trees (10.5)     24 Red-Black Tree  (10)
       29 Merge & Q (11.1-2)               
MAY                               1 Set/ Union-Find (11.4)
        6 Graph Theory (13)        8 More Graphs (13) 
       13 Slack/Tries?
       20 FINAL


CLASS SESSION 
The anticipated topics for each lecture is identified above, although
they are subject to change.  Recommended readings from the text are
(will be) also noted above (where applicable).

TESTS
A Midterm Examination will be given during standard class time on April 3.
The Final Examination will be given on May 20 (common final time; see blackboard announcment).
Both tests will be comprehensive and closed book (& closed notes).

ASSIGNMENTS
See the common course site; the link is on the previous page.

GRADES
        Midterm         20
        Programs	24
        Homework        16
	Final		40
I expect to see a Bell Curve Distribution of grades using a 90=A, 80=B etc
grading system; but where necessary/appropriate I will give all A's, flunk
everybody, curve the grades or consider relative improvement (or something 
else).