CS 0445 ALGORITHMS AND DATA STRUCTURES 1

This course emphasizes the study of the basic data structures of computer science (stacks, queues, trees, lists) and their implementations using the java language. Included in this study are programming techniques that use recursion, reference variables, and dynamic memory allocation. Students in this course are also introduced to various searching and sorting methods and also expected to develop an intuitive understanding of the complexity of these algorithms.

Academic Career: Undergraduate
Course Component: Lecture
Grade Component: LG/SNC Elective Basis
Course Requirements: PREQ: CMPINF 0401 or CS 0401 or COE 0401 or 0422 or CIST 0150 or CS 0207 (MIN GRADE 'C' or Transfer); Enrollment blocked if enrolled or previously enrolled in CS 0245
Minimum Credits: 3
Maximum Credits: 3

Current Sections

Fall 2026

Class No.DaysTimesRoomInstructor(s)TA(s)Type
18159 (1100)TuTh11:00am-12:15pmBENDM G30Sherif Khattab
LEC
18437 (1100)F9:00am-9:50amIS 405REC
18160 (1100)F12:00pm-12:50pmIS 406REC
23779 (1100)F3:00pm-3:50pmIS 404REC
10113 (1200)TuTh4:00pm-5:15pmIS 405Sherif Khattab
LEC
10624 (1200)F1:00pm-1:50pmIS 501REC
20940 (1240)W6:00pm-8:30pmCL 324Timothy James
LEC
11100 (1240)Th3:00pm-3:50pmSENSQ 5505REC
23719 (1240)Th4:00pm-4:50pmSENSQ 5505REC
23717 (1240)Th6:00pm-6:50pmSENSQ 6110REC
20942 (1240)F11:00am-11:50amSENSQ 5502REC
20941 (1240)F12:00pm-12:50pmSENSQ 5313REC