|
|
| Review | Error| Rate | Avg Rating: 0 |
|
 Data Structures and Algorithms : Complete data structures and algorithms course. This course is taught at the University Of Western Australia. The course teaches the following topics : Objects and ADTs, Constructors and destructors, Data Structure , Methods, Pre- and post-conditions C conventions, Error Handling, Arrays, Lists, Stacks, Stack Frames, Recursion, Sequential Searches, Binary Search , Trees, Complexity, Queues, Priority Queues , Heaps, Bubble , Heap Sort, Quick Sort , Bin Sort, Radix Sort, Searching Revisited, Red-Black trees, AVL trees, General n-ary trees, Hash Tables, Dynamic Algorithms, Fibonacci Numbers , Binomial Coefficients, Optimal Binary Search Trees, Matrix Chain Multiplication, Longest Common Subsequence, Optimal Triangulation , Graphs , Minimum Spanning Tree , Dijkstra's Algorithm , Huffman Encoding , FFT , Hard or Intractable Problems, Eulerian or Hamiltonian Paths , Travelling Salesman's Problem
Date Added: 8/6/2008 | Visits: 87 |
|
| Review | Error| Rate | Avg Rating: 0 |
|
Data Structures and Algorithms: Complete data structures and algorithms course. This course is taught at the University Of Western Australia. The course teaches the following topics : Objects and ADTs, Constructors and destructors, Data Structure , Methods, Pre- and post-conditions C conventions, Error Handling, Arrays, Lists, Stacks, Stack Frames, Recursion, Sequential Searches, Binary Search , Trees, Complexity, Queues, Priority Queues , Heaps, Bubble , Heap Sort, Quick Sort , Bin Sort, Radix Sort, Searching Revisited, Red-Black trees, AVL trees, General n-ary trees, Hash Tables, Dynamic Algorithms, Fibonacci Numbers , Binomial Coefficients, Optimal Binary Search Trees, Matrix Chain Multiplication, Longest Common Subsequence, Optimal Triangulation , Graphs , Minimum Spanning Tree , Dijkstra's Algorithm , Huffman Encoding , FFT , Hard or Intractable Problems, Eulerian or Hamiltonian Paths , Travelling Salesman's Problem
Date Added: 8/6/2008 | Visits: 39 |
|
| Review | Error| Rate | Avg Rating: 0 |
|
Sorting and Searching Algorithms: A small guide on the following topics : Arrays, Linked Lists, Timing Estimates, Insertion sort, Shell sort, Quicksort, Hash Tables, Binary Search Trees, Red-Black Trees, Skip Lists, External Sorts, B-Trees.
Date Added: 8/6/2008 | Visits: 34 |
|
| Review | Error| Rate | Avg Rating: 0 |
|
Algorithms: This book evolved over the past ten years from a set of lecture notes developed while teaching
the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of teaching
this course evolved tremendously over these years in a number of directions, partly to address
our students' background (undeveloped formal skills outside of programming), and partly to
reect the maturing of the eld in general, as we have come to see it. The notes increasingly
crystallized into a narrative, and we progressively structured the course to emphasize the
ìstory lineî implicit in the progression of the material. As a result, the topics were carefully
selected and clustered. No attempt was made to be encyclopedic, and this freed us to include
topics traditionally de-emphasized or omitted from most Algorithms books.
Date Added: 8/6/2008 | Visits: 16 |
|
| Review | Error| Rate | Avg Rating: 0 |
|
Data Structures and Algorithms: Complete data structures and algorithms course. This course is taught at the University Of Western Australia. The course teaches the following topics : Objects and ADTs, Constructors and destructors, Data Structure , Methods, Pre- and post-conditions C conventions, Error Handling, Arrays, Lists, Stacks, Stack Frames, Recursion, Sequential Searches, Binary Search , Trees, Complexity, Queues, Priority Queues , Heaps, Bubble , Heap Sort, Quick Sort , Bin Sort, Radix Sort, Searching Revisited, Red-Black trees, AVL trees, General n-ary trees, Hash Tables, Dynamic Algorithms, Fibonacci Numbers , Binomial Coefficients, Optimal Binary Search Trees, Matrix Chain Multiplication, Longest Common Subsequence, Optimal Triangulation , Graphs , Minimum Spanning Tree , Dijkstra's Algorithm , Huffman Encoding , FFT , Hard or Intractable Problems, Eulerian or Hamiltonian Paths , Travelling Salesman's Problem
Date Added: 7/10/2008 | Visits: 213 |
|
1| 2 | 3 | 4 | 5 | Next >>
Free Data Structures and Algorithms eBooks - Download Data Structures and Algorithms eBooks - List of Data Structures and Algorithms eBooks
|
|
