The instructor described the course: This is an advanced course in algorithms. It covers diverse topics such as dynamic programming, greedy algorithms, amortized analysis, B-tree trees, Fibonacci heaps, basic graph algorithms, hashing, minimum spanning trees, shortest paths from a single source, flow networks, and Ford-Fulkerson algorithm.
Credit hours: 3
Prerequisites: CS 211
Objectives of the course :
• Describe the different methods of designing an algorithm such as greedy technique, hill-climbing, and dynamic programming to solve a specific problem.
• Understanding hashing algorithm (Hashing), collisions, and solutions.
• Solving problems using graphical algorithms, including shortest paths from a single source and all pairs, and at least one single extended tree algorithm.
• Mentioned some key algorithms (using charts, trees, advanced data structures, or text processing).
• Measuring the complexity of the algorithm in the worst case with accuracy.
• Analyze and compare different algorithms to solve a specific problem.
• Creating the maximum flow of networks.
• Clarifying the best algorithm for solving a particular problem.
Course outputs :
1.1: Describe the different methods for designing an algorithm such as greedy technique, difference tables, and dynamic programming to solve a specific problem.
1.2: Identify some key algorithms (using charts, trees, advanced data structures, or text processing).
2.1: Presenting and explaining the algorithmic solutions through the demonstration of the project.
2.2: Analyzing the temporal and spatial complexity of algorithms and determining the most efficient solution for a given problem.
2.3: Evaluation of algorithms for choosing among a set of possible options and providing the justification for that choice.
2.4: Design and implementation of algorithms for real-world problems and evaluation of their performance.
This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy