Welcome to CEG242 - Computer Programming III

Instructor:	Dr. Thomas Wischgoll  thomas.wischgoll@wright.edu 485 Joshi Research Center 937-775-5057
Office Hours:	Mon/Wed 06:30pm - 07:30pm (or by appointment)
Textbook:	Data Structures & Other Objects Using C++, by Michael Main and Walter Savitch, Addison-Wesley, 2005
LanguageTextbook:	Microsoft Visual C++ (Microsoft Visual Studio 2008 is available as a free download for WSU students at www.dreamspark.com or you can use the express version available at www.microsoft.com/Express/VC/)
Webpage:	http://avida.cs.wright.edu/courses/CEG242/
Lecture:	Mon 02:45 pm - 03:35 pm Wed 02:45 pm - 03:35 pm Fri 02:45 pm - 03:35 pm (MS 141)
Exams:	Midterm: Wed, May 12th, 2:45 pm (in class) Final: Wed, June 9th, 03:15 pm - 05:15 pm
Grading Policy:	4	Programming Assignments (each 7.5%)	30%
	1	Midterm Examination	25%
	8	Laboratory Projects (each 2.5%)	20%
	1	Final Examination	25%
	Each class is different. Therefore, no absolute grading scheme can be defined in advance. However, the following guarantees will always be made: 90% 80% 70% 60% 50% A B C D F

Course Layout

Week	Topics	Reading
1	Basic C++ Syntax (C++ vs Java) I/O Streams Exception Handling	Chapter 1-3 Appendix F Appendix L
2	Dynamic Memory Allocation and Pointers	Chapter 4
3-4	Linked Lists (singly linked, doubly linked and circular)	Chapter 5
5	Templates, Iterators and Standard Template Library (STL), Inheritance, Polymorphism and Virtual Functions	Chapter 6 Chapters 14.1-14.3
6	Stacks and Queues Applications	Chapter 7-8
7-8	Recursion (Review) Binary Trees and Binary Search Trees	Chapter 9 Chapter 10
9-10	Sorting by insertion, selection and exchange Advanced Sorting Algorithms: Quicksort, Heapsort and Mergesort Searching (linear, binary and interpolation)	Chapter 12.1 Chapters 11.1 Chapter 13

Prerequisites

• CS 241

Course Format

The course consists of three lectures a week. Attendance of the lectures is not strictly mandatory. However, you are responsible for all materials, announcements, assignments, etc. covered in either the lecture or assignments. If you miss a class, consult a classmate for any missed materials.

The purpose of the class is for everyone to understand the issues involved with C++ and implementing algorithms and data structures. To this end, if you don't understand something during class, please ask. If you are confused, it is likely that a few of your classmates are as well. Also, listen to others' questions. Many times you'll think you understand a concept until you hear someone else's question about it. Dialogue is the best way to learn things, so don't be afraid to speak up.

There will be laboratory projects and programming assignments to be returned on the specified date, one in class midterm, and one final exam. The grade will be determined as stated earlier.

Laboratory Projects

Laboratory projects are designed to help you learn the course concepts and are the primary course "homework". I strongly suggest that you save your work to multiple locations/media to aid in the recovery of corrupt files.

Office Hours

Other Resources

The class web page is maintained at http://avida.cs.wright.edu/courses/CEG242/. It will keep information, assignments, announcements, etc. There is also a class mailing list. Make sure your email address is registered with the registration system. Please check the web page and read your email. I will try to make any announcements in both places as well as in class, but you don't want to miss anything.
 

Class Policy

Fine Print

Exams Exams will emphasize insight and problem solving ability rather than memorization. Exams will be open book.

Missed Exams Makeup exams will only be given for the gravest of reasons. If you must miss an exam due to extreme illness, etc., contact the instructor (email is fine) or leave a message with the Department of Computer Science and Engineering office (937-775-5131) before the exam. Be sure to leave both the reasons for missing the exam and how to reach you.

Add/drop Policy A copy of the add/drop policy is available at the main office or online.

Cheating Please do not. I am not obsessed with looking for cheating, but if I see something suspicious, I will refer it to the Office of Judicial Affairs. This is more work for me, and is embarrassing for everyone.  Again, please don't; this has been a problem in the past. If the rules are unclear or you are unsure of how they apply, ask the instructor beforehand. The acacemic integrity policiy as available online.

Feedback If you like, dislike, or don't understand something I'm doing with the course, please stop by my office hours, send me email, or paste together a note from newspaper clippings and drop it in my mailbox. I won't always change things, but I will always explain why I'm doing them the way I am.

Copyright All federal and state copyrights reserved for all original material presented in this course through any medium, including lecture or print. Individuals are prohibited from being paid for taking, selling, or otherwise transferring for value, personal class notes made during this course to any entity without the express written permission of the lecturer.