CS 225
Summer 2011 All Classes
Credit: 4 hours.
Data abstractions: elementary data structures (lists, stacks, queues, and trees) and their implementation using an object-oriented programming language. Solutions to a variety of computational problems such as search on graphs and trees. Elementary analysis of algorithms.
Prerequisite: CS 125 or ECE 190; CS 173 or MATH 213.
Students must register for one lecture-discussion and one lecture section.
This course satisfies the General Education Criteria in
Fall 2022 for:
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
30770
|
Lecture
|
AL1
|
3:00PM
-4:50PM
|
MTW
|
112 Transportation Building
|
Earls, J
|
|
|
|
30772
|
Laboratory-Discussion
|
AY1
|
9:00AM
-10:50AM
|
TR
|
0224 Siebel Center for Comp Sci
|
Earls, J
|
|
|
|
30774
|
Laboratory-Discussion
|
AY2
|
11:00AM
-12:50PM
|
TR
|
0224 Siebel Center for Comp Sci
|
Earls, J
|
|