cs202_fall2013001005.jpg
cs202_fall2013001003.gif tabr_n.gif tabr_n.gif tabr_n.gif tabr_n.gif

Goals

The primary goal in CS202 is to prepare students for programming in the upper division 3xx and 4xx level classes. To achieve this goal, CS202 focuses on three areas: object oriented programming, advanced C++, and Java. The majority of the term is spent introducing students to object-oriented programming while learning advanced C++ syntax as well as Java syntax. Students will understand the difference between procedural abstraction and object oriented solutions. Students spend the term designing and programming with inheritance hierarchies, with the goal of solving problems efficiently: producing high quality, robust, maintainable as well as efficient object oriented solutions. This provides students with the chance to experience object oriented design and programming at the same time as becoming better acquainted with advanced data structures.
 
Java skills developed include writing two programs using advanced data structures in Java with strict requirements to follow OOP guidelines – all data members private, no friendly access, and complete implementation of functions required to handle issues of deep versus shallow copies and compares. Students learn the relationship between the two languages and the similarity of Java’s references to pointers.

Getting Help:

CS202 Announcements:
Important Links:
cs202_fall2013001002.gif
CS202 has an online option:

There are two sections of CS202. One is an “online” section and the other is an “in-class” section. There is a big difference between these sections. The online students will be in a self-paced class. All students will have a required lab session to solidify the constructs learned in lectures. Labs assigned a time and location are in-class labs. Labs that are listed as TBA are self-paced labs. Check out the course syllabus for more details!
Welcome to Fall term!

Make sure to practice your data structures, recursion, and C++ as you prepare for CS202. In particular you should be proficient with binary search trees, arrays of linked lists, and linked lists of arrays.