Listed in: Computer Science, as COSC-112
Formerly listed as: COSC-12
James R. Glenn (Sections 01 and 02)
A continuation of COSC 111. This course will emphasize more complicated problems and their algorithmic solutions. The object-oriented programming paradigm will be discussed in detail, including data abstraction, inheritance and polymorphism. Other topics will include linked lists and trees and the use of finite-state machines in algorithm design. A laboratory section will meet once a week to give students practice with programming constructs. Two class hours and one one-hour laboratory per week.
Requisite: COSC 111 or consent of the instructor. This course is the appropriate starting point for most students with some prior programming experience. Fall and spring semester. Professor Rager.
Section 01
M 12:00 PM - 12:50 PM SMUD 014
Section 02
M 09:00 AM - 09:50 AM SMUD 014
Section 01
W 09:00 AM - 09:50 AM FAYE 115
F 09:00 AM - 09:50 AM FAYE 115
Section 02
W 09:00 AM - 09:50 AM FAYE 115
F 09:00 AM - 09:50 AM FAYE 115