CS 2110

Object-Oriented Programming and Data Structures

Course Description

Course information provided by the 2016-2017 Catalog.

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

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

Outcomes

• 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.

Distribution Category (MQR-AS)

When Offered Fall, spring, summer.

View Enrollment Information