M W F 11-11:50am
This course, although continuing to introduce features of the C++ programming language, develops the student’s ability to design and implement well-structured and correct programs using the object-oriented paradigm. The course introduces elementary data structures (lists, linked lists, stacks, queues and trees) with emphasis on their implementation using arrays and pointers and recursive algorithms. The concepts of encapsulation and information hiding in object oriented programming will be studied.
1) Further develop the student's ability to analyze problems and translate that analysis into a computer program using proper software engineering techniques;
2) introduce a mathematically based analysis of algorithms;
3) develop an understanding and appreciation of recursion as a basic style of programming;
Course Prerequisite: Minimum grades of C in CMPS 1043 and MATH 1233 or MATH 1203 or MATH 1533.
Programming projects = 450 pts.
Homework assignments / quizzes = 100 pts.
3 tests = 300 pts.
1 FINAL EXAM = 150 pts.
Grades may be determined according to this scale (approximate):
A 90% ‑ 100% B 80% ‑ 89%
C 65% ‑ 79% D 55% ‑ 64%
Policy for late programs and grading will be handed out and available at this link: Programming Assignment Policy
See my web page for my policy on late assignments. Makeup exams will be given only if the instructor is notified IN ADVANCE of the exam with a legitimate reason for missing the exam.
Class attendance is the responsibility of the student, and it is the student's responsibility to independently cover any material s/he may miss. Class attendance and participation may also be used in determining grades.