COLLEGE OF DUPAGE CIS 2542 Advanced C++ with Data Structure Applications Course Syllabus

Transcription

1 Carolyn England COD Main #: Voic Ext Office: BIC1544B (Division Office TEC1034) Mailbox: BIC1E01 Office Hours: M 12:05 pm 1:45 pm Tu 12:05 pm 1:45 pm W 12:05 pm 1:45 pm Th 9:00 am 10:40 am F 8:30 am 10:10 am (virtual england@cod.edu) england@cod.edu CIS 2542 Sec #002 FALL SEMESTER 2018 Mon and Wed 2:00 pm - 3:50 pm Location: SCC 115 Course Name: Credit and Contact Hours: Prerequisites: CIS 2542 Advanced C++ with Data Structure Applications 4 semester credit hours (4 lecture hours) CIS 2541 C++ Language Programming OR consent of instructor Textbook (Required): Data Structures and Other Objects Using C++, 4/E by Michael Main and Walter Savitch, Publisher: Prentice Hall, ISBN-10: , ISBN-13: Other Course Materials: Note and test taking material (pencil, pen, eraser, etc.), storage device (USB drive or cloud storage), assignment submission material (hardcopies, file upload, etc.) Course Description: Covers advanced C++ Programming Language features with data structure applications. Includes object-oriented applications using classes, inheritance, encapsulation, polymorphism, and other advanced C++ language features. Emphasis on the use of vectors, pointers, dynamic memory, lists, iterators, stacks, queues, linked lists, binary trees, associative containers, hashing, sequential file access, direct file access, recursive algorithms, sorting and searching techniques. Repeatable for credit: No Fall CREngland

2 Course Objectives: Upon successful completion of this course, the student should be able to: 1. Explain object oriented design techniques 2. Evaluate the efficiency of algorithms 3. Demonstrate the use of pointers and dynamic memory 4. Explain the concept of vectors, lists, stacks, queues, binary trees, associative containers, and hashes 5. Explain the concept of inheritance, polymorphism and virtual functions 6. Demonstrate the use of binary files 7. Describe recursive algorithms 8. Compare sorting and searching techniques Topical Outline: 1. Introduction to data structures 2. Object oriented design techniques 3. Operator overloading 4. Analysis or sorting and searching algorithms 5. Recursion 6. Vectors 7. Pointers and dynamic memory 8. List container and iterators 9. Stacks 10. Queues 11. Linked lists 12. Binary trees 13. Associative containers 14. Hashing 15. Inheritance and abstract classes 16. Binary files 17. Recursive algorithms 18. Sorting and searching 19. Comparison of divide and conquer sorting algorithms Course Requirements: Academic Integrity: Course related academic integrity is an important component of College policies and the Computer Information Systems curriculum. The College policy on academic integrity can be found in the College catalog under Student Services and General Student Information, Student Rights and Responsibilities, Code of Academic Conduct: Fall CREngland

3 Attendance: Class attendance and active participation are essential if a student wishes to receive maximum benefit from this class. Material discussed during class and lab times provide the foundation for assignments and evaluations. Not all material discussed during class is necessarily available electronically. If a student is absent, they should obtain any notes from a fellow student present during that time. Any additional course policies (not covered in this syllabus) will be discussed during class time and it is the student s responsibility to abide by these policies in order to achieve full credit for coursework completed. Although attendance does help one s final grade, perfect attendance alone does not guarantee a passing grade. Every attempt will be made to answer on a 24 hour turnaround basis (except for Saturday and Sunday). When sending an please indicate your name, in which course you are currently enrolled, the problem you are having, and how best to contact you with a resolution. Evaluations: Two course evaluations (MidTerm and Final) are scheduled during the semester. There will be no make-up evaluations allowed unless there is an emergency and you contact me prior to the scheduled evaluation date. NO MAKE-UP EVALUATIONS ARE ALLOWED FOR THE FINAL EVALUATION! If a student misses the final evaluation, he/she will receive a grade that reflects the loss of all points for the final evaluation. Lab/Program Assignments: Lab/Program assignments will be discussed in class. Keep track of your scheduled class time; make sure you have plenty of time to save your work, submit any material, and take your personal property with you when you leave. Since other classes are probably scheduled for class after you, be considerate in cleaning up your area and logging off before their class time begins. Late assignments receive a 50% point penalty if submitted after the due date/time! NO LATE ASSIGNMENTS ACCEPTED 7 CALENDAR DAYS AFTER THE DUE DATE/TIME. NO LATE ASSIGNMENTS ACCEPTED FOR THE LAST ASSIGNMENT. Assignments will be available on Blackboard the Friday after distribution during the class meeting time. Students may be required to demonstrate functionality of their assignments to achieve full credit. In the event a student cannot attend class on the day an assignment is due, the assignment should be submitted early unless other arrangements have been made in advance with the instructor. Satisfactory/Fail/Incomplete: A Satisfactory/Fail Grading Option must be requested by Wednesday, October 17, 2018 and requires an overall class grade of 75% or better for a grade of satisfactory. No Incompletes will be given in this course. The College policy on Satisfactory/Fail (S/F) Grade Option can be found in the College catalog under Academic Policies and Procedures, Earning College Credit: Fall CREngland

4 Student Responsibilities: This course involves reading, discussion, online, and written assignments. It is to the student s benefit to use their time wisely whether it is in preparation for class, during scheduled class, or in the lab. Expect to spend time outside of class completing your assignments (anywhere from 4 to 12 hours per week is reasonable). The College of DuPage Academic Computing Labs are available for students to complete their course assignments. Withdrawal Policy: The last day to withdraw from this class is 11/10/2018. After that date, students may file a Petition for Late Withdrawal through the Registration Office. Petitions for Late Withdrawal will be granted for extenuating circumstances only, including student illness, death in the immediate family, family emergencies, call to active duty, or other appropriate extenuating circumstances. The student will be required to provide appropriate documentation for all requests for Late Withdrawal. Prior to withdrawing from this class, students are encouraged to speak with the instructor. The College policy on Withdrawals can be found in the College catalog under Academic Policies and Procedures, Course Withdrawals and Specialized Registration: Finally: During class time, considerate conduct by all persons is important to a favorable learning environment. Electronic devices should be silenced or turned off during class/lab times. Failure to abide by this policy may adversely affect the student s grade. Most students sign up for courses with the best intentions; however, circumstances can arise that challenge even the best students. If you are having difficulty with the course, the above requirements, or the College, please come and see me (before a crisis develops) so that we can resolve them in a manner beneficial to all persons involved. Method of Student Evaluation: Point Distribution: Labs (mostly in class) pts. Programs pts. Evaluations pts. Total pts. Final Grades: Accumulated Points Grade Percentage A >= B C D or lower... F < 65 Fall CREngland

5 Tentative Course Schedule: In addition to online resources, material for class lectures/discussion will be taken from the course textbook. Course topics and their corresponding textbook chapters are listed below. To maximize one s mastery of the course material, textbook readings should be done PRIOR to class. This class progresses at a quick pace in order to cover all the objectives; falling behind in one s reading assignments may affect one s comprehension of subsequent topics. For the purpose of maintaining this timely schedule, students experiencing difficulty with any topics should see the instructor for supplemental assistance during the instructor s office hours. Any revisions to the following schedule will be discussed during class time. Week Beginning Topics/Chapters Assignments/Evaluations 08/20/2018 Course Administration and Policies Lab #1 **Monday Semester Begins** Software Development Ch 1 The Phases of Software Development Appendix L Exception Handling 08/27/2018 ADTs and C++ Classes Lab #2 Ch 2 Abstract Data Types and C++ Classes 09/03/2018 ADTs and C++ Classes (cont d) **Monday Holiday No Classes** 09/10/2018 Container Classes Lab #3 Ch 3 Container Classes Appendix H Brief Reference for the Standard Template Classes 09/17/2018 Pointers and Dynamic Memory Lab #4 Ch 4 Pointers and Dynamic Arrays 09/24/2018 Linked Lists Lab #5 Ch 5 Linked Lists 10/01/2018 Templates, Iterators, and STL Lab #6 Ch 6 Software Development with Templates, Iterators, and the STL 10/08/2018 Templates, Iterators, and STL (cont d) Program #1 **MidTerm Evaluation** 10/15/2018 Stacks Lab #7 Ch 7 -- Stacks 10/22/2018 Queues Lab #8 Ch 8 -- Queues 10/29/2018 Recursion Ch 9 Recursive Thinking Lab #9 Fall CREngland

6 Week Beginning Topics/Chapters Assignments/Evaluations 11/05/2018 Trees Lab #10 Ch Trees 11/12/2018 Searching, Hashing, and Sorting Lab #11 Ch 12 Searching Ch Sorting 11/19/2018 Searching, Hashing, and Sorting (cont d) **Wednesday College Open (No Classes)** **Thursday, Friday -- Thanksgiving Recess** 11/26/2018 Inheritance Lab #12 Ch 14 Derived Classes and Inheritance 12/03/2018 Inheritance (cont d) Program #2 **Saturday Final Exams and Culminating Activities Start** 12/10/2018 **Friday Semester Ends** Scheduled Final Activity: Monday, December 10, 2 pm 3:50 pm **Final Evaluation** Fall CREngland