Полный цикл лекций по курсу Abtract Data Types and Algorithms, Carleton Univerity, 2008. ВНИМАНИЕ! Эти лекции медленно переносятся в вики, вы тоже можете помочь.

Java Review

Basic Java
Inheritance
Interfaces

Arrays, linked lists and recursion

Programming with Recursion
Using Recursion

Analysis tools

(Read Chapter 4 of the textbook)
Analysis of Algorithms

Stacks and queues

(Read Chapter 5 of the textbook)
Stacks
Queues

example code

Lists and iterators

(Read Chapter 6 of the textbook)
Linked Lists
Vectors
Lists
Sequences and Iterators

Trees

(Read Chapter 7 of the textbook)
Trees

Priority queues

(Read Chapter 8 of the textbook)
Priority Queues
Heaps
Adaptable Priority Queues

Maps and dictionaries

(Read Chapter 9 of the textbook)
Maps
Hash Tables
Dictionaries
Skip Lists

Search trees

(Read Chapter 10 of the textbook)
Binary Search Trees
AVL Trees
(2,4) Trees
Red-Black Trees
Splay Trees

Sorting trees and selection

(Read Chapter 11 of the textbook)
Merge Sort
Quick Sort
Divide-and-Conquer
Sorting Lower Bound
Sets
Union-Find Partition Structures
Radix Sort
Selection

Dynamic Progr.

Text processing

(Read Chapter 12 of the textbook)
Strings and Pattern Matching
Tries
Dynamic Programming and LCS
Greedy Method and Text Compression

Graphs

(Read Chapter 13 of the textbook)
Graphs
Depth-First Search
Breadth-First Search
Directed Graphs
Shortest Paths
Minimum Spanning Trees
A Campus Tour Project

    30 Май 2009 by freetonik

This website uses IntenseDebate comments, but they are not currently loaded because either your browser doesn't support JavaScript, or they didn't load fast enough.

Comment Form


Warning: Parameter 1 to id_generic_callback() expected to be a reference, value given in /home/users/f/freetonik/domains/css.freetonik.com/wp-content/plugins/intensedebate/intensedebate.php on line 911

Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 8643130 bytes) in /home/users/f/freetonik/domains/css.freetonik.com/wp-includes/functions.php on line 959