Advertisement
Computer Programming Algorithms Directory
This note covers the following topics: Encryption Algorithms, Genetic Algorithms, Geographic Information Systems Algorithms, Sorting Algorithms, Search Algorithms, Tree Algorithms, Computational Geometry Algorithms, Phonetic Algorithms and Project Management Algorithms.
Author(s): algosort.com
NA Pages 
The field of approximation algorithms has developed in response to the difficulty in solving a good many optimization problems exactly. This note will present general techniques that underly these algorithms.
Author(s): Shuchi Chawla
NA Pages
Advanced Algorithms Lectures and Resources
This note will cover classic and modern algorithmic ideas that are central to many areas of Computer Science. The focus is on most powerful paradigms and techniques of how to design algorithms, and measure their efficiency. The topics will include hashing, sketching, dimension reduction, linear programming, spectral graph theory, gradient descent, multiplicative weights, compressed sensing, and others.
Author(s): Alex Andon
NA Pages
Data Structures and Algorithms
This note covers the following topics: Fundamentals of data structure, simple data structures, ideas for algorithm design, the TABLE Data Type, free storage management, sorting, storage on external media, variants on the SET Data Type, pseudo-random numbers, data compression, algorithms on graphs, algorithms on strings and Geometric Algorithms.
Author(s): Martin Richards
80 Pages
This lecture note explains data structures and algorithms, focusing on advanced topics such as graph theory, randomized algorithms, and combinatorial search.
Author(s): Ray Toal
NA Pages
Lecture Notes on Data Structures
This note covers the following topics: Algorithms and Data Structures, Introduction to Java, Software Development, Writing Classes, Writing Classes in Java, Unit Testing, Building Large Java Applications, Inheritance and Polymorphism, Interfaces, A Math Review, Algorithm Analysis, Data Types versus Data Structures, Collections, Stacks ,Queues, Lists, Recursion, Sorting, Trees, Oriented Trees, Ordered Trees, Binary Trees, Sets and Dictionaries, Search Trees, Binary Search Trees, Red-Black Trees.
Author(s): Ray Toal
NA Pages
Design and Analysis of Computer Algorithms (PDF 135P)
This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry.
Author(s): David M. Mount
135 Pages
Lecture Notes Introduction to Computer Algorithms
This course note provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
Author(s): Prof. Erik Demaine, Prof. Ronald Rivest and Prof. Srinivas Devadas
NA Pages
This note covers the following topics: Mathematics for Algorithmic, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Amortized Analysis, Hash Table, Binary Search Tree, Graph Algorithms, String Matching, Sorting and Approximate Algorithms
Author(s): Rashid Bin Muhammad
NA Pages
Information Theory, Inference, and Learning Algorithms (David J.C. MacKay)
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Sorting and Searching Algorithms (Thomas Niemann)
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
