Data representation, storage, and manipulation. This course covers the memory organization of data storage and its relation to computation and efficiency. Topics include: linked vs. contiguous implementations, memory management, the use of indices and pointers, and an introduction to issues raised by the memory hierarchy. Programming assignments in C provide practice with programming styles that yield efficient code and computational experiments investigate the effect of storage design choices on the running time of programs.
Prerequisite: CS 151L or 152L or 259L.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
