CSE 232 is the second programming course, intended for CS majors or those interested in a more in-depth look at programming. It begins by introducing the C++ language and the Standard Template Library (STL), using the latest elements added by the c++11 standards, and moves on to working with more advanced data structures and algorithms.
In general, the idea is to learn to use the available power as provided by C++ and the STL, and then dive into the details of how we can implement those data structures and algorithms ourselves.
Roughly speaking, the class will be divided into two halves:
The schedule, readings and Exam schedule are listed at the bottom of this document. A Syllabus is also available.
We have created a directory for each week that contains all the work for the week:
If you need to know what is going on for the week, you simply look for the current week (which is announced each week in the Current News section), to see what the schedule for this week is.
In this way we think we can keep students better on track this way.
Each section (check the schedule for your section number) has an lab meeting once a week. You are required to attend the lab session. You can miss only two lab sessions without penalty!!
Lab section times and information about the TA in charge can be found on the lab section .
In this course we will follow a set of conventions regarding how we name variables, functions and constants in our programs, how we indent, etc. While coding rules tend to be arbitrary, choosing one allows for consistency in an organization. We will choose to use the Google Coding standards (hey, why not) as applicable. We won't use all of it, but you can always look there and find the answer for proper standards.
Sample Exams are also available.
The college of Engineering Department of Engineering Computing Services (DECS) runs the lab and maintains the sofware you will be working with. They maintain a support page that can answer many of your questions.
The FAQ has answers to the questions lots of students ask.
|0||07-Jan||Getting Started||Lab 00||1.1-1.3|
|1||14-Jan||Types/Expressions||Lab 01||Proj 01||2.1-2.2, 4.1-4.5, 4.11.1|
|2||21-Jan||Control||Lab 02||Proj 02||5.1-5.5, skip 5.4.3|
|3||21-Jan||Functions||Lab 03||Proj 03||6.1-6.3|
|4||04-Feb||char, STL,||Lab 04||Proj 04||3.1 to 3.2, 9.5|
|5||12-Feb||More Functions, templates||Lab 05||Proj 05||6.4-6.5, 16.1.1|
|Exam I||Thur, Feb 14||7pm, WH B115|
|6||18-Feb||Header Files||Lab 06||2.6, 6.1|
|7||25-Feb||String Stream, Exceptions||Lab 07||Proj 06||8.3, 5.6, 18.1|
|9||11-Mar||Generic Algorithms, Lambdas||Lab 08||Proj 07||Chap 10|
|10||18-Mar||Object Oriented Programming||Lab 09||Proj 08||15.1|
|Structs, constructors||7.1, 7.5|
|11||25-Mar||Classes II||Lab 10||Proj 09||Chap 7|
|Exam II||Thur, Mar 28||7pm, WH B115|
|13||08-Apr||Classes & dynamic memory||Lab 12||Proj 10|
|14||15-Apr||Linked Lists||Lab 13|
|Big Oh||Proj 11|