Skip to page content

Courses

  • Design & Analysis of Algorithms (10120)
    • תקציר הקורס:

    Abstract:

    Introduction to Linear Programming, Simplex Method, Primal Problem and Dual Problem. Transportation Problem, Transportation Simplex Method, Assignment Problem – Hungarian Algorithm. Dynamic Programming.

     Graph Algorithms: different methods of representing graphs, finding transitive closure: Matrix Multiplication and Warshall's Algorithm, Euler and Hamiltonian Path. BFS and DFS Algorithms ,Topological Sort, Strongly Connected Components, Hyper Graph, Bridges and Biconnected components, Pert. Trees and Greedy Algorithms: Huffman codes. Shortest Paths: from single source and between all pairs of vertices – Dijkstra / Bellman Ford / Floyd Warshall algorithms. Single-source Shortest Paths in DAG (Directed Acyclic Graph).

    Minimal Spanning Trees, Kruskal and Prim algorithms. Euler and Hamiltonian Path.
  • Advanced Algorithm (10121)
    • תקציר הקורס:

    Abstract:

    The course consists of two parts: one is devoted to some methods of

    algorithm design, while another part is an introduction to the complexity theory.

    The topics covered are: flow in networks and matching,

    string-matching, approximation algorithms; Church-Turing thesis, decidability, reducibility, complexity.