Legacy Course Catalog
C S 251 - Data Structures
| Effectivity: | 08/20/2001 - 05/04/2002 @ Purdue West Lafayette Traditional |
|---|---|
| Credits: | 3 |
| Instructional Types: | Lec Pso |
| Usually Offered: | fal spr |
| Short Title: | Data Structures |
| Description: | Specification, representation, and manipulation of basic data structures: linked lists, arrays, stacks, queues, trees, strings, symbol tables, Huffman codes, optimal search trees, pattern matching, priority queues, heaps, hash tables. Storage allocation, garbage collection, compaction, reference counts. List and string processing languages. Analysis of algorithms. Students are required to write programs in several languages. |
| School: | School Of Science |
| Department: | Computer Science |
| Credit By Exam: | NO |
| Repeatable Flag: | NO |
| Temporary Flag: | NO |
| Full Time Privilege Flag: | NO |
| Honors Flag: | NO |
| Registration Approval Type: | Department |
| Variable Title Flag: | NO |
Fall 2007 *** indicates the course was still an active course and was transferred to the Banner Catalog effective Spring 2008. This course was not expired Fall 2007.
