Jan 16, 2019
CS 143 Computer Science II Java
This class teaches Object Oriented Programming (OOP) concepts and introduces elementary data structures as well as algorithms associated with them. The topics include classes, interfaces, inheritance, OOP design, exceptions, data structures (arrays, lists, queues, stacks, and trees), and algorithm performance analysis.
Note: CS 143 was originially listed in error in the 2017-2018 catalog as CSD 143.
Prerequisites: CS& 141
Quarters Offered: Fall, Winter, Spring
This course teaches to the global outcome of Teamwork.
Upon successful completion of this course students will be able to:
- Design and implement Object Oriented principles in Java
- Use inheritance concept and interface mechanism in class design and implementation
- Write code that utilizes exceptions and the exception handling mechanism available in Java
- Demonstrate mastery in using array, linked list, stack, and queue data structures
- Demonstrate knowledge of tree data structures and algorithms associated with them
- Design and implement recursive algorithms
- Use recursion to manipulate linked lists and tree data structures
- Implement searching and sorting algorithms for arrays
- Estimate algorithm complexity using Big O notation
- Design and implement a medium-sized Java program using OOP principles
Total Hours: 60 Lecture Hours: 40 Lab or Clinical Hours: 20