Office: 506 Computer Science Building

Office Hours: TBA

Email: junr@cs.columbia.edu

TAs: TBA

Prerequisite: CS W1003 Introduction to computer programming in C, or knowledge of C.

Course Description: Data types and structures: arrays, linked lists, stacks, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing. Rudiments of the analysis of algorithms. Recurring concepts such as recursion, abstraction, representation, efficiency, and tradeoffs. Not intended for computer science majors.

Textbook: Thomas A. Standish: Data Structures, Algorithms & Software Principles in C, Addison-Wesley (Textbooks have been ordered with Papyrus bookstore located at 114th and Broadway)

Schedule: TT 11:00-12:15, 386 ENG

Background Texts (subject to change):
Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, MIT Press/Addison-Wesley, 1990.

Alfred V. Aho and Jeffrey D. Ullman, Foundations of Computer Science, C Edition, W. H. Freeman, New York, 1995.

Kernighan, Brian W., and Ritchie, Dennis M., The C Programming Language, ANSI Edition, Prentice-Hall, 1988.

Open Door Policy: We would like the course to run smoothly and enjoyably. Feel free to let us know what you find good and interesting about the course. Let us know sooner about the reverse. See us, leave us a note, or send us e-mail.



Jun Rao
Fri May 23 15:54:42 EDT 1997