Subject: Subject Sylbus: Introduction to Algorithms - 094226

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 )
or ( Discrete Mathematics (for I.E) 094345
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.




System of hours to the semesters
Semester Previous Semester information 02/2021 2021/2022 Spring Semester


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

Created in 29/11/2022 Time 02:10:48