CS 2110

Object-Oriented Programming and Data Structures

Course Description

Course information provided by the Courses of Study 2020-2021.

Intermediate programming in a high-level language and introduction to computer science. Topics include object-oriented programming (classes, objects, subclasses, types), graphical user interfaces, algorithm analysis (asymptotic complexity, big "O" notation), recursion, testing, program correctness (loop invariants), searching/sorting, data structures (lists, trees, stacks, queues, heaps, search trees, hash tables, graphs), graph algorithms. Java is the principal programming language.

When Offered Fall, Spring, Summer.

Prerequisites/Corequisites Prerequisite: CS 1110 or CS 1112 or equivalent course on programming in a procedural language.

Distribution Category (MQR-AS, SMR-AS)

• Be fluent in the use of recursion and object-oriented programming concepts (e.g. classes, objects, inheritance, and interfaces).
• Be able to design and implement nontrivial Java programs (roughly 1000 lines of code), starting from an English language specification.
• Understand graphical user interfaces (GUIs), as expressed in Java.
• Understand asymptotic complexity of algorithms and be able to analyze programs to determine their running times.
• Understand basic data structures taught in the course and be able to implement them and use them in programs.

View Enrollment Information