Course Catalog Information (24-25)
CIS 22CH
Data Abstraction and Structures - HONORS
Course Description
Application of software engineering techniques to the design and development of large programs, including a team project, with an emphasis on data abstraction and structures and associated algorithms: stacks, queues, linked lists, trees, graphs, and hash tables. This course also covers recursion and advanced sorting algorithms. As an honors course, the students will be expected to complete extra assignments to gain deeper insight into the design and implementation of data structures.
Student Learning Outcomes
- Read, analyze and explain data structures programs.
- Create and analyze efficiency of data structures algorithms, code, document, debug, and test large data structures programs using appropriate design methodology incorporating advanced programming concepts.
Course Details
- Units
- 4.5 Units
- Hours
- Weekly Lecture Hours: 4
- Weekly Lab Hours: 1.5
- Gen Ed
- Non-GE Class
- Program Status
- Program Applicable
- Credit
- Credit - Degree Applicable
- Transferability
- Transferable to both UC and CSU
- Grading Method
- Letter Grading
Requisite and Advisory
- Prerequisite(s)
- CIS 22B, CIS 22BH, CIS 35A or CIS 36B
- Advisory(ies)
- Elementary algebra or equivalent or higher, or appropriate placement beyond elementary algebra
- Corequisite(s)
Limitations on Enrollment and Entrance Skills
- Limitation(s) on Enrollment
- Not open to students with credit in the non-Honors related course.
- Admission into this course requires consent of the Honors Program Coordinator.