‫א ק ד מ י‬
Hol on Ac a de m i c
Institute of Technology
‫מ כ ו ן‬
)‫ט כ נ ו ל ו ג י ח ו לו ן (ע " ר‬
DEPARTMENT of COMPUTER SCIENCE
‫מחלקה למדעי המחשב‬
)01216 ‫תכנון וניתוח אלגוריתמים (קורס מספר‬
Design and Analysis of Algorithms
‫ תשס"ה‬,'‫סמסטר א‬
‫ פרופ' ואדים לויט‬:‫מרצה‬
 Algorithms and their Complexity
► The O Notation
► Design of Algorithms by Recursion
► Fibonacci Numbers
► Recurrence Relations
► Design of Algorithms by Induction
 Algorithms of Searching and Sorting
► Maximum and Minimum Elements
► Finding the k-th-Smallest Element
► Finding the Two Largest Elements
► Finding the Median of the Merge of Two Sequence
► Finding the Median of a Sequence
► A Building Inspection Problem: k Crystal Balls
 Local-Optimal Algorithms
► The Manager Problem
► The Library Problem
► Perfect Matchings in Very Dense Graphs
► Bipartite Matchings
► The Traveling-Salesman Problem
 Algorithms Involving Sequences
► Finding the Maximum Consecutive Subsequence
► Finding all Maximum Consecutive Subsequences
► Finding the Longest Increasing Subsequence
► Finding all Longest Increasing Subsequences
► Sequence Comparisons *
► Finding all Longest Common Subsequences of Two Sequences *
 Probabilistic Algorithms
► Random Numbers
► A Number Greater than the Median of a Sequence
► A Coloring Problem
 Greedy Algorithms
► An Activity-Selection Problem
► A Task-Scheduling Problem
► Kruskal's Algorithm
► Prim's Algorithm
► Single-Source Shortest Paths
► Dijkstra's Algorithm
► Bellman-Ford's Algorithm *
 Data Compression
► Huffman's Algorithm
 Dynamic Programming
► Sequence Comparisons *
► Finding all Longest Common Subsequences of Two Sequences *
► Combinatorial Games
► Shortest Paths on Grids
► Finding a Maximum Square Submatrix of a One-Zero Matrix
► Bellman-Ford's Algorithm *
► All Shortest Paths: Floyd-Warshall Algorithm
► Transitive Closure
► Matrix-Chain Multiplication
► The Knapsack Problem
 Miscellaneous Problems
► The Burglars Problem
► Efficient Computations of XN
► Efficient Computations of Fibonacci Numbers
► The Sub-Set Sum Problem
► Finding a Majority
 Bibliography
1. T. H. Cormen, C. E. Leiserson, Ronald L. Rivest, "Introduction to Algorithms", Second Edition, the
MIT Press, 2001.
2. U. Manber, “Introduction to Algorithms: A Creative Approach”, Addison-Wesley, 1989.
3. I. Parberry, “Problems on Algorithms”, Prentice-Hall, 1995.
4. D. E. Knuth, “The Art of Computer Programming”, Addison-Wesley, 1973.
5. A. V. Aho, J. E. Hopcroft, J. D. Ullman, "The Design and Analysis of Computer Algorithms",
Addison-Wesley, 1974.
6. D. C. Kozen, "The Design and Analysis of Algorithms", Springer-Verlag, 1992.
7. S. E. Goodman, S.T. Hedentiemi, "Introduction to the Design and Analysis of Algorithms",
McGraw-Hill, 1977.
8. E. M. Reingold, J. Nievergelt, Narsingh Deo "Combinatorial Algorithms: Theory and Practice",
Prentice-Hall, 1977.
‫ אלגוריתמים ומבני נתונים‬:‫דרישות קדם‬
57% * ‫ ציון תרגילים‬+ 57% * ‫ ציון סופי = ציון המבחן‬:‫דרישות הקורס‬
.7 ‫ בנין‬,051 ‫חדר‬,15:::-10::: :‫ ימי ה‬,14:::-17::: :‫ ימי א‬:‫שעות קבלה‬