COMP 122 - Data Struc Algori for Enge Sci
Show Details for Open Courses Only
Description
Hours: Two hours lecture and three hours lab per week Prerequisite: COMP 121 Description: Introduction to data structures and the algorithms for manipulating them. Review of composite data types such as arrays, records, strings, and sets. The following data structures will be introduced: stacks, queues, linked lists, hash tables, trees and graphs. Object-oriented concepts such as data encapsulation, classes, and inheritance will be covered. Topics include: the role of the abstract data type in program design, definition, implementation and application of data structures; recursion; use of time-complexity expressions in evaluating algorithms; comparative study of sorting and searching algorithms.
Units: 3.00
Grading: Letter Grade
| Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|---|
| 1 | 01 | 1637 | LEC | T | 2:00 PM - 3:50 PM | Sierra Hall 1222 | Nicholas Dolan-Stern |
|
| 1 | 1L | 1638 | LAB | TH | 3:00 PM - 5:50 PM | Sierra Hall 1222 | Nicholas Dolan-Stern |
|
Key for Course Detail Icons
- = Course Open
= Course Closed 
= Course Details - = Textbook Info
= General Education
= Extended University
= Service-Learning- = In Person Course
= Asynchronous Online Course
= Synchronous Online Course
= Synchronous/Asynchronous Course
= No Cost Course Materials
= Low Cost Course Materials