A continuation of C.S. 2106. Explores the finer and more subtle elements of a programming language.  Programming techniques and structures include recursion, arrays, records, sets, and linked lists. Prerequisite: C.S. 2106. (1st, 2nd)

Expectations:

E1. Students should have basic problem solving skills and be able to apply those skills to create an algorithmic solution for a given programming problem.

E2. Students should be able to create programs using assignments, control constructs, and routines and be able to find and correct any syntax errors to produce a running executable.

E3. Students should be able to test their programs, find any logic errors, and correct these flaws to produce a working program.

Course Outcomes:

R1. Students will be able to use advanced programming techniques, including recursion, file I/O, abstraction, multi-file programs, and using programming language libraries. (CS6, SE6, CS/SE15)

R2. Students will be able to use/implement simple data structures, including records, arrays, and linked lists. (CS6, SE6, CS/SE15)

R3. Students will be able to use basic object-oriented programming methodologies; such as object-oriented problem decomposition, class design/implementation, and object creation/usage. (CS6, SE6, CS/SE15)

R4. Students will be able to write defensive programs using (1) an intergrated design language and coding standard and (2) basic error detection and reporting techniques with an emphasis on the responsibilities that computer professionals have for ensuring software quality. (CS/SE1, CS6, CS/SE11, SE6, CS/SE/15)

R5. Students will be able to design, execute, and analyze robust black-box and white-box test scenarios with an emphasis on the responsibilities that computer professionals have for ensuring software quality. (CS1, CS6, SE6, CS/SE/15)

R6. Students are proficient in a programming language had have learned basic error-handling, testing and debugging techniques. (CS6, SE6, CS/SE15)