CS 0445 DATA STRUCTURES

Description

Minimum Credits: 3
Maximum Credits: 3
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 which 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 (MIN GRADE 'C' or Transfer)

Current Sections

Summer 2019

Class No.
Days
Times
Room
Instructor(s)
TA(s)
Type
Session
Writing
Class No.: 19695 (1010)
Days: TuTh
Times: 9:30 am - 11:15 am
Room: IS 404
Instructor(s): W. Garrison III
TA(s):
Type: LEC
Session: 12W
Writing:
Class No.: 19696 (1010)
Days: Tu
Times: 11:30 am - 12:20 pm
Room: SENSQ 5505
Instructor(s):
TA(s): R. Singh
Type: REC
Session: 12W
Writing:
Class No.: 19697 (1010)
Days: Th
Times: 11:30 am - 12:20 pm
Room: SENSQ 5505
Instructor(s):
TA(s): R. Singh
Type: REC
Session: 12W
Writing:
Class No.: 19962 (1050)
Days: TuTh
Times: 2:30 pm - 4:15 pm
Room: IS 404
Instructor(s): W. Garrison III
TA(s):
Type: LEC
Session: 12W
Writing:
Class No.: 19998 (1050)
Days: M
Times: 4:30 pm - 5:20 pm
Room: SENSQ 5505
Instructor(s):
TA(s): E. Karageorgos
Type: REC
Session: 12W
Writing:
Class No.: 20064 (1050)
Days: Tu
Times: 8:30 am - 9:20 am
Room: SENSQ 5505
Instructor(s):
TA(s): E. Karageorgos
Type: REC
Session: 12W
Writing:

Future Sections

Please click the headings below to view the hidden sections.

Past Sections

Please click the headings below to view the hidden sections.