كلية الهندسة - جامعة عين شمس, الرئيسية

الرئيسية  >  كلية الهندسة - جامعة عين شمس, الرئيسية

Advanced Algorithms and Complexity

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

CSE243

Description

  • English Description

    Fundamental techniques for designing and analyzing algorithms. Asymptotic analysis: Big-Oh, Big-Sigma, Big-Omega. Brute force algorithms. Exhaustive search algorithms. Divide-and-conquer algorithms. Greedy techniques. Iterative improvement. Graph theory: Graph representation, Graph operations, Shortest path algorithms, Minimum spanning tree algorithms. Dynamic programming. Hashing. Limitations of algorithmic power. Lower bound and tight lower bound. Tractable problems. P, NP, NP-Complete problems.
  • Arabic Description

    Fundamental techniques for designing and analyzing algorithms. Asymptotic analysis: Big-Oh, Big-Sigma, Big-Omega. Brute force algorithms. Exhaustive search algorithms. Divide-and-conquer algorithms. Greedy techniques. Iterative improvement. Graph theory: Graph representation, Graph operations, Shortest path algorithms, Minimum spanning tree algorithms. Dynamic programming. Hashing. Limitations of algorithmic power. Lower bound and tight lower bound. Tractable problems. P, NP, NP-Complete problems.
  • قسم
    هندسة الحاسبات والنظم
  • الساعات المعتمدة
    3
  • الدرجات
    الإجمالي ( 100 ) = نصف العام (20) + tr.Major Assessment (25 = tr.Industry 0% , tr.Project 20% , tr.Self_learning 0% , tr.Seminar 10% ) + tr.Minor Assessment (5) + tr.Oral/Practical (10) + درجة الامتحان (40)
  • الساعات
    ساعات المحاضرة: 2, ساعات التعليم: 2, ساعات المعمل: 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.