CIT 244 - Object-Oriented Design, Data Structures and Algorithms Using Java
Credits: 4
4 Lecture Hours
Prerequisites: CIT 130
Description
This course builds upon the concepts of software design and development introduced in CIT 130. Java applications are developed utilizing data structures (e.g. arrays, linked lists, stacks, queues and trees) and Object-Oriented Programming (OOP) techniques. Additional course topics include algorithm analysis and efficiencies, sorting, searching, recursion and the use of predefined Application Programming Interfaces (APIs).
Learning Outcomes
Upon successful completion of the course, the student will:
- Design applications using inheritance, polymorphism, encapsulation and abstract data types.
- Create applications that implement various data structures such as arrays, linked lists, stacks, queues and trees.
- Assess various algorithm analysis efficiencies and their complexities.
- Apply recursion techniques in a Java application.
- Implement advanced sorting and searching algorithms.
Listed Topics
- OOP design using UML (Unified Modeling Language)
- Inheritance, polymorphism, class hierarchies and abstract classes
- Arrays
- Linked lists
- Stacks
- Queues
- Trees
- Algorithm analysis efficiencies
- Recursion
- Sorting and searching algorithms
- Java API and collection classes
- File input and output streams
- Advanced Java Graphical User Interface (GUI) applications
Reference Materials
Textbooks/materials, current and appropriate software, multimedia for lecture and demonstration as required by instructor; access to the internet.
Students who successfully complete this course acquire general knowledge, skills and abilities that align with CCAC’s definition of an educated person. Specifically, this course fulfills these General Education Goals: - Critical Thinking & Problem Solving
- Quantitative & Scientific Reasoning
Approved By: Dr. Quintin B. Bullock Date Approved: 2/18/2022
Course and Section Search
Add to Portfolio (opens a new window)
|
Print this Page