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: CS 0401 or COE 0401 or 0422 or CIST 0150 (MIN GRADE 'C' or Transfer)
Minimum Credits: 3
Maximum Credits: 3

Current Sections

Fall 2022

Class No.DaysTimesRoomInstructor(s)TA(s)Type
19943 (1100)TuTh1:00 pm - 2:15 pmSENSQ 5502T. Hoffman
LEC
20263 (1100)F9:00 am - 9:50 amCL 204T. Hoffman
REC
19944 (1100)F12:00 pm - 12:50 pmLAWRN 233T. Hoffman
REC
27820 (1100)F3:00 pm - 3:50 pmIS 404T. Hoffman
REC
10128 (1200)TuTh9:30 am - 10:45 amSENSQ 5502S. Khattab
LEC
27657 (1200)F10:00 am - 10:50 amIS 403TBD
REC
10681 (1200)F1:00 pm - 1:50 pmIS 403TBD
REC
22563 (1200)F4:00 pm - 4:50 pmIS 405TBD
REC
23766 (1240)MW4:30 pm - 5:45 pmCL G24T. Hoffman
LEC
11268 (1240)Th3:00 pm - 3:50 pmIS 501T. Hoffman
REC
27658 (1240)Th4:00 pm - 4:50 pmIS 501T. Hoffman
REC
22562 (1240)Th5:00 pm - 5:50 pmIS 406T. Hoffman
REC
27656 (1240)Th6:00 pm - 6:50 pmIS 406T. Hoffman
REC
23768 (1240)F11:00 am - 11:50 amCL 204T. Hoffman
REC
23767 (1240)F2:00 pm - 2:50 pmWWPH 5405T. Hoffman
REC