Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Book
"This book is primarily intended to be a text for the programming component in an introductory two semester computer science course (some materials are a little advanced and m...
Lecture Notes
"This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know C...
Book
"This book is not going to praise object-oriented programming or condemn the
Old Way. We are simply going to use ANSI-C to discover how object-oriented programming is done, w...
Lecture Notes
"The study of data structures and the algorithms that manipulate them is among the most fundamental topics in computer science. Most of what computer systems spend their time ...
Lecture Notes
Set of lecture notes for the algorithms classes required for all computer science undergraduate and graduate students at the University of Illinois, Urbana-Champaign.
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Lecture Notes
"This course has two objectives. First (and obvious) is to teach programming.
Second is to present some fundamental principles of computer science,
especially algorithm desi...
101
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."