TR 11:00 AM
In this course you will continue a study of data structures and object oriented programming and design. The class will include analysis of algorithms (ie complexity) and an in-depth look at a variety of tree structures, graphs, sorting and searching. Quizes (If you miss the quiz you cannot make it up) will be given regularly over requested readings from the text. Projects will involve the simulation/implementation/empirical analysis of selected data structures.
Prerequisite: College Algebra
Exams: Three exams and a final
Projects: 4-6 projects written in C++.
This course is project intensive and expect up to 4 or 5 programs to be given during the course. Each project is to be turned in within an envelope with your name and project number printed on the outside. Include a printout of your source and associated output, if appropriate, together with a CD or Jump drive containing the programs .exe, .cpp and other necessary files such as data or necessary libraries. Make sure that your program runs off the media before turning it in.
This course will cover a lot of material that you will have never seen. It is very important to attend every class. Attendance every day is therefore required! If you miss a day you must come by my office when you get back and ask for your makeup work. I will count off for any class not made up as well as for excessive absences.