CS241L Spring 2008:
Data Organization

Description

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

Prerequisite: CS 152L or EECE 152L.

Lecture

T R 12:30-1:45 @ ME300. Lecturer: Dave Ackley.

Lab

F 10:00-10:50 @ DSH141. TA: Jong Chun Park.

Dave's office hours

T 2:30-5, Th 2-5 @ FEC349D

Jong Chun's office hours

M W 9:30-12 @ FEC301A

• Final program, part 2 - 'Plantagents'
• Final program, part 1 - 'Sarq library'
• Program 2 - 'Xstr library'
• Program 1 - 'ncrpt'
• A stripped-down emacs initialization file to use if desired. (New version as of Tue Feb 12 23:39:59 2008: Tells emacs not to use hard TABs when indenting -- creates code whose indentation uses only spaces, so it doesn't depend on the tab width of whatever program is being used for viewing. Or, see just the differences between this version and the original.)
• TA's CS241 page with tips and lab info.
• The class email list. If your name isn't obvious from your email address, INCLUDE YOUR NAME WHEN YOU SIGN UP!
• The first day handout.
• The C keyword typing game.
• Selected lecture slides. (Or via the old slide viewer applet.) If the ones you want aren't there, send me and email and ask for them!