|Data Structures Lecture Notes|
|CS345 Data Mining and Clustering|
Jeffrey D. Ullman, Stanford University
These lecture notes cover topics such as Data Mining, Association-Rules, A-Priori Algorithm, Other Frequent-Pair Algorithms, Correlated Items, Query Flocks, PageRank, Hubs-and-Authorities, Web Mining, Stream Mining, Clustering, and Matching Sequences. It also covers Theory of Dependencies, Logic as a Database Language, and Conjunctive Queries.
|CPS 140 Computer Science|
Susan H. Rodger, Duke University
An introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular languages to recursively enumerable languages, noncomputability and complexity theory.
|COMP 413 Computer Science|
John Hine, University of Wellington, NZ
Distributed system concepts and techniques underlie much of modern computer technology. Client-server systems based on high-bandwidth networks support applications ranging from business data processing to multimedia information systems. COMP 413 teaches concepts and principles used in the design and construction of distributed systems, providing a suitable knowledge base for those aiming for careers in advanced system and application development, or in research.
Varsity Notes is the world's largest directory of free lecture notes, containing free data structures lecture notes and free lecture notes for numerous other academic disciplines. Our free computer science course notes will help you succeed in any undergraduate or gradute data structures course at your college or university. Free cheat notes in data structures are also valuable as a self study tool for high school and college students or anyone searching for free resources on computer science.