Fall Term 2015
Meetings: Monday and Wednesday 06:00PM - 07:20PM
Room: 0121 MAIN (Old Main)
Professor: Prof. Marwan Abi-Antoun
E-mail: (Please include CSC 2200 in the subject line for faster replies.)
Phone: (313) 577-2831 (Please call office phone only during regular office hours. You may send email anytime.)
Office: Suite 14.110.2, 14th floor of 5057 Woodward Avenue (Maccabees Building)
Office Hours: Monday and Wednesday 4:30PM – 5:30PM or by appointment.
Labs: There are 2 lab sections:
|Section 002||T||07:30PM - 09:15PM||0073 SCLB|
|Section 003||M||07:30PM - 09:15PM||050B SCLB|
Blackboard: Important information will be posted on Blackboard (http://blackboard.wayne.edu). The slides for the lectures will be in Blackboard.
This schedule is tentative and subject to change. Please check back regularly. A date with an asterisk * indicates an exception to the office hours. Please make an appointment to see the instructor at a different time if needed. The important deadlines are highlighted. Generally, all assignments will be due before class, i.e., 6:00PM on the due date.
|Sep 07||University Holiday -- no class, no lab|
||C++ review 1||Lab 0: Intro
Tue: Sep. 08
|Note: Sep. 4 is the Last Day for Late Registration, Late Adds|
Quiz1: C++ review
C++ review 2
||Algorithm Analysis 1
Lab 1a: Text ADT
Tue: Sep. 15
Mon: Sep. 21
|Chap. 2||Note: Sep. 16 is the Last Day to Drop w/ Tuition Cancellation|
||Algorithm Analysis 2:||A1 out. Due Sep. 28.|
|06||Sep 23||Algorithm Analysis 3:
Lab 1b: Text ADT
Tue: Sep. 22
Mon: Sep. 28
||Algorithm Analysis 4:
Quiz2: Algorithm Analysis
Two sum: more ideas
Tue: Oct. 06
Mon: Oct. 11
Vector (array backing)
|10||Oct 07||List (linked list)||Lab 3: ListArray ADT|
Quiz 3: ADTs (Vector, List)
|Lab 4: Ordered List ADT||Oct. 20: Early Academic Assessment|
|Lab 5: LinkedList ADT|
|15||Oct 26||Midterm Review|
|16||Oct 28*||Midterm Exam||Lab 6: Stack ADT||* Instructor away at conference. No office hours.|
|17||Nov 02||Binary Tree
|18||Nov 04||Binary Search
Tree: contains, insert
|Lab 7: Queue ADT|
Review of Tree
Binary Search Tree: check validity
|A2 out. Due Nov. 18.
Note: Nov. 15 is the Last Day to Withdraw.
Binary Search Tree: recap
Running time of traversal
Keeping tree balanced
|Lab 8: Expression Tree ADT|
|22||Nov 18|| Probing
|Lab 9: Binary Search Tree ADT
Quiz 4: Hashing
Priority Queues (Heaps)
|Nov 25||University Holiday -- no class||Lab 10: Hashtable ADT|
|24||Nov 30||Insertion Sort
Official Course Evaluations (online)‡
|Lab 11: Heap ADT
‡ Will be conducted online. Students will receive email.
Due by by 12/4/2015 @ 12 Noon
Quiz 5: Sorting
|27||Dec 09||Quicksort 2
Last session for the lab (Tue)
||Last session for the lab (Mon)||Note: Classes end on Dec. 14|
[may run longer than 80 minutes]
Note: based on the
official schedule for finals
Proof techniques; proof by induction
Euclid's algorithm; exponentiation
C++ review: templates, exceptions
C++: a bit more on exceptions
C++: separate header and implementation files
C++: command-line arguments
C++: using the Visual Studio debugger: callstack, watch, etc.
B - Tree
Quiz x: Tree (tentative) -- no quiz; replaced by assignment A2
Academic integrity: Violations of academic integrity will be handled in accordance with the WSU policy.
Special accommodations: If you have a documented disability that requires accommodations, you will need to register with Student Disability Services for coordination of your academic accommodations. The Student Disability Services (SDS) office is located at 1600 David Adamany Undergraduate Library in the Student Academic Success Services department. SDS telephone number is 313-577-1851 or 313-577-3365 (TDD only). Once you have your accommodations in place, I will be glad to meet with you privately during my office hours to discuss your special needs. Student Disability Services’ mission is to assist the university in creating an accessible community where students with disabilities have an equal opportunity to fully participate in their educational experience at Wayne State University.
This course reuses, by written permission, material by Professors Dan Grosu and Thaer Jayyousi.
Last Updated: Wednesday, December 09, 2015 11:33:58 AM