Faculty of Engineering - Ain Shams University, Home

Home  >  Faculty of Engineering - Ain Shams University, Home

Design and Analysis of Algorithms

What Will Learn?

  • Course Aims
    ● Design advanced algorithms. ● Define and analyze of the algorithms in different styles, including recursive algorithms. ● Demonstrate a familiarity with major fundamental algorithms in sorting. ● Apply important algorithmic design paradigms and methods of analysis. ● Understand, analyze and apply standard algorithms involving tree and graph. ● Define and analyze the complexity of algorithms in various styles.
  • Course Goals
  • Decent Work and Economic Growth
  • Industry, Innovation and Infrastructure
  • Sustainable Cities and Communities

Requirements

CSE333s

Description

  • English Description

    Fundamental techniques for designing and analyzing algorithms. Asymptotic analysis. Brute force and exhaustive search. Decrease-and-conquer. Divide-and-conquer. Transform-and-conquer. Space and time trade-offs. Dynamic programming. Greedy technique. Iterative Improvement. Limitations of algorithm power. Hashing.
  • Arabic Description

    Fundamental techniques for designing and analyzing algorithms. Asymptotic analysis. Brute force and exhaustive search. Decrease-and-conquer. Divide-and-conquer. Transform-and-conquer. Space and time trade-offs. Dynamic programming. Greedy technique. Iterative Improvement. Limitations of algorithm power. Hashing.
  • Department
    Computer and Systems Engineering
  • Credit Hours
    3
  • Grades
    Total ( 100 ) = Midterm (20) + tr.Student Activities (20 = tr.Industry 0% , tr.Project 10% , tr.Self_learning 0% , tr.Seminar 10% ) + tr.Oral/Practical (10) + Exam Grade (50)
  • Hours
    Lecture Hours: 2, Tutorial Hours: 2, Lab Hours: 1
  • Required SWL
    125
  • Equivalent ECTS
    5
  • ● J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley, 2019.
  • ● V. Levitin, Introduction to the Design and Analysis of Algorithms, 3rd Edition, Addison-Wesley, 2012.