This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:rnAnalyze the asymptotic performance of algorithms.rnDemonstrate a familiarity with major algorithms and data structures.rnSynthesize efficient algorithms in common engineering design situations.rn
Bachelor Degree in Computer Engineering
Data will be available soon!
| content serial | Description |
|---|
| 1 | Week Number 1: Introduction to the design and analysis of algorithms. |
| 2 | Week Number 2 : Measuring the asymptotic growth of s. Lower and upper bounds. |
| 3 | Week Number 3 : The basic structures of computing: sets, relations, s, graphs and trees. |
| 4 | Week Number 4 : The Greedy method. |
| 5 | Week Number 5 : Divide and conquer I. |
| 6 | Week Number 6 : Divide and conquer II. |
| 7 | Week Number 7 : 7th Week Exam + Dynamic Programming. |
| 8 | Week Number 8 : Dynamic programming. |
| 9 | Week Number 9 : Graph algorithms. |
| 10 | Week Number 10 : Minimum spanning trees. Single-source shortest paths. |
| 11 | Week Number 11 : Computational geometry problems. |
| 12 | Week Number 12 : 12th Week Exam + Backtracking algorithms. |
| 13 | Week Number 13 : Backtracking algorithms. |
| 14 | Week Number 14 : Parallel programming I. |
| 15 | Week Number 15 : Parallel programming II. |
| 16 | Week Number 16 : Presentation of projects and Final Exam. |
| 1 | Week Number 1: Introduction to the design and analysis of algorithms. |
| 2 | Week Number 2 : Measuring the asymptotic growth of s. Lower and upper bounds. |
| 3 | Week Number 3 : The basic structures of computing: sets, relations, s, graphs and trees. |
| 4 | Week Number 4 : The Greedy method. |
| 5 | Week Number 5 : Divide and conquer I. |
| 6 | Week Number 6 : Divide and conquer II. |
| 7 | Week Number 7 : 7th Week Exam + Dynamic Programming. |
| 8 | Week Number 8 : Dynamic programming. |
| 9 | Week Number 9 : Graph algorithms. |
| 10 | Week Number 10 : Minimum spanning trees. Single-source shortest paths. |
| 11 | Week Number 11 : Computational geometry problems. |
| 12 | Week Number 12 : 12th Week Exam + Backtracking algorithms. |
| 13 | Week Number 13 : Backtracking algorithms. |
| 14 | Week Number 14 : Parallel programming I. |
| 15 | Week Number 15 : Parallel programming II. |
| 16 | Week Number 16 : Presentation of projects and Final Exam. |
| 1 | Week Number 1: Introduction to the design and analysis of algorithms. |
| 2 | Week Number 2 : Measuring the asymptotic growth of s. Lower and upper bounds. |
| 3 | Week Number 3 : The basic structures of computing: sets, relations, s, graphs and trees. |
| 4 | Week Number 4 : The Greedy method. |
| 5 | Week Number 5 : Divide and conquer I. |
| 6 | Week Number 6 : Divide and conquer II. |
| 7 | Week Number 7 : 7th Week Exam + Dynamic Programming. |
| 8 | Week Number 8 : Dynamic programming. |
| 9 | Week Number 9 : Graph algorithms. |
| 10 | Week Number 10 : Minimum spanning trees. Single-source shortest paths. |
| 11 | Week Number 11 : Computational geometry problems. |
| 12 | Week Number 12 : 12th Week Exam + Backtracking algorithms. |
| 13 | Week Number 13 : Backtracking algorithms. |
| 14 | Week Number 14 : Parallel programming I. |
| 15 | Week Number 15 : Parallel programming II. |
| 16 | Week Number 16 : Presentation of projects and Final Exam. |
| 1 | Week Number 1: Introduction to the design and analysis of algorithms. |
| 2 | Week Number 2 : Measuring the asymptotic growth of s. Lower and upper bounds. |
| 3 | Week Number 3 : The basic structures of computing: sets, relations, s, graphs and trees. |
| 4 | Week Number 4 : The Greedy method. |
| 5 | Week Number 5 : Divide and conquer I. |
| 6 | Week Number 6 : Divide and conquer II. |
| 7 | Week Number 7 : 7th Week Exam + Dynamic Programming. |
| 8 | Week Number 8 : Dynamic programming. |
| 9 | Week Number 9 : Graph algorithms. |
| 10 | Week Number 10 : Minimum spanning trees. Single-source shortest paths. |
| 11 | Week Number 11 : Computational geometry problems. |
| 12 | Week Number 12 : 12th Week Exam + Backtracking algorithms. |
| 13 | Week Number 13 : Backtracking algorithms. |
| 14 | Week Number 14 : Parallel programming I. |
| 15 | Week Number 15 : Parallel programming II. |
| 16 | Week Number 16 : Presentation of projects and Final Exam. |
Start your application
