ENGRD 2110 Object-Oriented Programming and Data Structures
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), simple graph algorithms. Java is the principal programming language. Outcome 1: Be fluent in the use of recursion and object-oriented programming concepts (e.g. classes, objects, inheritance, and interfaces). Outcome 2: Be able to design and implement nontrivial Java programs (roughly 1000 lines of code), starting from an English language specification. Outcome 3: Be able to design graphical user interfaces (GUIs). Outcome 4: Understand asymptotic complexity of algorithms and be able to analyze programs to determine their running times. Outcome 5: Understand basic data structures taught in the course and be able to implement them and use them in programs.
CS 1110 or CS 1130 or equivalent course in Java or C++.
ENGRD 2110 001-LEC On-campus 6-week session
|Class dates:||June 25-August 7, 2018|
|Exam dates:||Will be provided by instructor (see Final exams)|
|Days/times:||M-F 10 AM - 11:15 AM Hollister Hall 110|
|Instructor:||Crooks, N. (nsc36)|
|To enroll:||Enrollment for this class is closed.|
|Related:||Cross-listed with CS 2110 001-LEC|