The course covers data structures and associated algorithms. Relationships among data structures, their utility in various situations, and factors affecting their performance in algorithms will be considered. You will learn to analyze the demands of algorithms, how to choose appropriate data structures, and how to integrate data structures into algorithms.
Your final letter grade is based on the standard formula:
0 <= F < 60, 60 <= D < 70, 70 <= C < 80, 80 <= B < 90, 90 <= A <= 100These levels may be adjusted slightly in your favor, but grades will not be ``curved'' in the conventional sense.
You are expected to attend all lectures. You are responsible for all material covered in the lecture, even if it is not in the textbook. You should keep up with the assigned readings during the semester. Some reading material will distributed through the course web page. You are responsible for the material in the readings, even if it is not covered during lecture.
You must study to do well in this course. It will not be enough to attend lectures and do the homework. As advanced undergraduates, you will be responsible for learning material that is not necessarily covered in lectures. A prime learning requirement is that you contribute to class discussions and raise questions about the course material.
Cheating in any form will not be tolerated. Instances of
cheating will be reported to the UMBC Academic Conduct Committee.
These reports are filed by the Committee and can be used for
disciplinary action such as a permanent record on your transcript.
Academic honesty is absolutely required of you.
You are expected to be honest yourself and to report any cases of
dishonesty you see among other students in this class. Reports of
dishonest behavior will be kept anonymous.
Further details on honesty in doing projects for this course are
on-line at the
Project Policy link.
Students are welcome and encouraged to study together for exams, but examinations are to be your own work -- not your neighbor's and not your notes. All exams are closed-book, closed-notes. Only pencils (or pens) and erasers are permitted in the exam room unless otherwise indicated. Scratch paper is provided to you, as needed. Having any other materials in your possession during an exam will be taken as evidence of cheating and dealt with accordingly.
|
|
|
|||
1 | Wed 6 Sep | C++ and OOP | MAW 1
PSW 7,8,10,12 |
||
Wed 6 Sep | Project 1 Assigned | ||||
Wed 6 Sep Thur 7 Sep |
Extra session: C++ Review 8:30-9:30 P.M. SS 114 |
||||
2 | Mon 11 Sep | C++ and OOP | MAW 1
PSW 7,8,10,12 |
||
3 | Wed 13 Sep | Asymptotic Analysis | MAW 2 | ||
Wed 13 Sep Thur 14 Sep |
Extra session: Project 1 Preview 8:30-9:30 P.M. SS 114 |
||||
4 | Mon 18 Sep | List ADT and Implementations | MAW 3 | ||
5 | Wed 20 Sep | List Implementations | MAW 3 | ||
6 | Mon 25 Sep | List Implementations | MAW 3 | ||
Mon 25 Sep | Project 1 Due | Project 2 Assigned | |||
7 | Wed 27 Sep | Stacks, Queues, and Applications | MAW 3 | ||
Wed 27 Sep Thur 28 Sep |
Extra session: Project 2 Preview 8:30-9:30 P.M. SS 114 |
||||
8 | Mon 2 Oct | Binary Search Trees | MAW 4 | ||
9 | Wed 4 Oct | Binary Search Trees | MAW 4 | ||
10 | Mon 9 Oct | Hashing | MAW 5 | ||
Mon 9 Oct | Project 2 Due | ||||
11 | Wed 11 Oct | Hashing | MAW 5 | ||
Wed 11 Oct Thur 12 Oct |
Extra session: Exam 1 Review 8:30-9:30 P.M. SS 114 |
||||
12 | Mon 16 Oct | Exam 1
Project 3 Assign |
|||
13 | Wed 18 Oct | Priority Queues | MAW 6 | ||
Wed 18 Oct Thur 19 Oct |
Extra session: Project 3 Preview 8:30-9:30 P.M. SS 114 |
||||
14 | Mon 23 Oct | Priority Queues | MAW 6 | ||
15 | Wed 25 Oct | Balanced Search Trees | MAW 4 | ||
16 | Mon 30 Oct | Balanced Search Trees | MAW 4 | ||
Mon 30 Oct | Project 3 Due
Project 4 Assigned |
||||
17 | Wed 1 Nov | Balanced Search Trees | MAW 4, 11 | ||
Wed 1 Nov Thur 2 Nov |
Extra session: Project 4 Preview 8:30-9:30 P.M. SS 114 |
||||
18 | Mon 6 Nov | Balanced Search Trees | MAW 11, 12 | ||
19 | Wed 8 Nov | B-Trees | MAW 4 + Notes | ||
Wed 8 Nov Thur 9 Nov |
Extra session: Exam 2 Review 8:30-9:30 P.M. SS 114 |
||||
20 | Mon 13 Nov | Exam 2 | |||
21 | Mon 15 Nov | B-Trees | MAW 4 + notes | ||
22 | Mon 20 Nov | Graphs | MAW 9 | ||
Mon 20 Nov | Project 4 Due
Project 5 Assigned |
||||
23 | Wed 22 Nov | Graphs | MAW 9 | ||
Thu 23 Nov |
Thanksgiving Break | ||||
24 | Wed 27 Nov | Graphs | MAW 9 | ||
25 | Wed 29 Nov | Skip Lists | MAW 10 + notes | ||
Wed 29 Nov Thur 30 Nov |
Extra session: Project 5 Preview 8:30-9:30 P.M. SS 114 |
||||
26 | Mon 4 Dec | Skip Lists | MAW 10 + notes | ||
27 | Wed 6 Dec | Disjoint Set | MAW 8 | ||
28 | Mon 11 Dec | Disjoint Set | MAW 8 | ||
Mon 11 Dec | Project 5 Due | ||||
29 | Wed 13 Dec | Advanced Topics | Notes | ||
Wed 13 Dec Thur 14 Dec |
Extra session: Final Exam Preview 8:30-9:30 P.M. SS 114 |
||||
Mon 18 Dec | Final Exam
10:30 a.m. - 12:30 p.m NOTE: 1/2 hour earlier than usual class meeting time |
A few handouts will be provided in paper form at the first class. After that, all handouts will be provided only on the web. The course web page URL is
www.csee.umbc.edu/courses/undergraduate/341/fall00/341-Fall00-homepage.shtml
Please check the web page frequently. Any changes to the page will be mentioned in the "What's New" link.
to Fall 2000 CMSC-341 Homepage