Description: Hours: Three hours lecture and three hours lab per week
Prerequisite: COMP 150
Introduction to data structures and the algorithms that use them. Review of composite data types such as arrays, records, strings, and sets. Topics include: the role of the abstract data type in program design, definition, implementation and application of data structures such as stacks, queues, linked lists, trees and graphs; recursion; use of time-complexity expressions in evaluating algorithms.; comparative study of sorting and searching algorithms.
Units: 4.00
Grading: Letter Grade
| Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|---|
| 1 | 01 | 1999 | LEC | TTH | 01:30 PM - 02:45 PM | Sierra Hall 1411 | Eric Gentry |
|
| 1 | 1L | 2000 | LAB | T | 03:00 PM - 05:50 PM | Sierra Hall 1232 | Eric Gentry |
|
| 1 | 2L | 2002 | LAB | TH | 03:00 PM - 05:50 PM | Sierra Hall 1232 | Eric Gentry |
|
Key for Course Detail Icons
| = Course Open |
 = Course Closed |
= Course Details |
 = Textbook Info |
 = General Education |
 = Extended University |
 = Service Learning |
= In Person |
 = Asynchronous Online |
 = Synchronous Online |
 = Synchronous/Asynchronous |
 = Blended |
 = No Cost Course Materials |
 = Low Cost Course Materials |