Download DATA STRUCTURES AND ALGORITHMS

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
DATA STRUCTURES AND ALGORITHMS
BGU Communication & Systems Engeneering
Syllabus



















Inroduction and motivation with few examples (mainly from interviews for jobs in industry)
Big-O, Omega, Theta and analyzing running time of programs.
Recurrences and solutions.
Lists (stack and queue implementations).
Median and order statistics.
Binary search and binary (search) trees: definition, traversal, recursion.
Heap : heapsort, priority queue, Huffman code, Fibonacci heaps.
Balanced search trees, case study : AVL trees. High-dimensional trees and fractional cascading.
Data structure for disjoint sets.
Hashing : linear probing, quadratic probing, double hashing, chaining.
Sorting in linear time.
Greedy algorithms.
Dynamic programming.
String matching.
FFT and fast polynom multiplication.
Randomized algorithms.
Remainder about graphs: basic terminology, DFS, BFS, topological sort.
Introduction to Turing machines.
NP-completness
Textbooks
 Introduction to Algorithms, T.H.Cormen, C.E.Leiserson, R.L.Rivest , MIT Press, 1991.
 Data structures and algorithms, Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Addison-Wesley,
1983.
 The design and analysis of computer algorithms, Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman,
Addison-Wesley, 1974.
 Data Structures & Their Algorithms, Lewis and Denenberg, 1997. Harper Collins Publishers
 Data Structures in Java, M. Goodrich, R. Tamassia, 1998.
 Fundamentals of Data Structures, E.Horowitz, S.Sahni, Computer Science Press, Inc., Computer
Software Engineering Series, 1976.
 Data Structures & Program Design, R. L. Kruse, Prentice-Hall, Inc., 1987.
 Algorithms, Data Structures, and Problem solving with C++, M. A. Weiss, Addison-Wesley, 1999.
Administration



Lecturer:
o Dr. Michael Segal
 Office: 307
 Office hours: Wednesday, 13:00-15:00.
Teaching Assistant:
o Itzik Kitroser
 Office: TBA
 Office hours: TBA
The grade:
o 60% final exam, 40% homework assignments. Must pass exam with grade higher than
55. Some frontal checking for the selected exercises.