Subject: Subject Sylbus: Introduction to Algorithms - 094226 (Current)

Introduction to Algorithms - 094226
Credit
Points
2.5
 
Given In
Semester
a
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1     2

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: ( Discrete Mathematics 094347
and Introduction to Computer Science N 234221 )
 
Incorporated Courses: Data Structures and Algorithms 094223
Data Structures and Algorithms 094224
 
Incorporating Courses: Int. to Data Structur and Algorithms 044268
Combinatorial Algorithms 104291
Algorithms 1 234247


The Course Deals with Fundamental Concepts in Designing and Analyzing Combinatorial Algorithms. Topics: Sorting Algorithms, Basic Graph Algorithms: Searching, Shortest Paths, Minimum Spanning Tree, Network Flow.




Times and places of examinations 02/2020 2020/2021 Spring Semester
examination timedaydateSeason
 Monday12.07.2021א
 Sunday10.10.2021ב

Timetable to semester 02/2020 2020/2021 Spring Semester
RoomBuildingHourdayLecturerExercise
Lecture
no.Registering
Group
214נהול12:30-14:30ThursdayAssociate Professor Levin AsafLecture1011
153בלומפילד14:30-15:30Thursday Exercise11


Textbooks
PublishedPublisherAuthorsBook
2009mit pressthomas h. cormen, charles e. leiserson thomas h. cormen, charles e. leisersonintroduction to algorithms 3rd ed.

Created in 21/04/2021 Time 23:24:55