Official government website of the Government of the Kingdom of Saudi ArabiaHow is it achieved?

The Saudi official educational websites' links end with edu.sa

Check the domain's scope in the browser's address bar before sharing your data.

Trusted government websites use a protocol HTTPS

Check that the site uses HTTPS protocol to encrypt the connection.

Digital Government Authority Registered with the Digital Government Authority with no: 20260416249

What are you looking for?

Colleges

Solving Problems with Algorithms

The course describes to students the detailed knowledge about the basic steps of solving problems and measuring their complexity. Students learn about data structures such as matrices, linked lists, and trees such as AVL trees, 2-4 trees, along with Red-Black trees, and most related handling algorithms such as Hash functions and Traversal functions. The basic techniques are also discussed in detail with relevant examples, including greedy algorithms, Divide and Conquer technique, and Dynamic Programming. Students are also provided with information about network flow and how to find the maximum flow in any network. Additionally, heuristic exploration algorithms such as Genetic Algorithm are presented.
Credit hours: 3
Objectives of the course :

At the end of this course, the student should be able to know how to formulate an algorithm for a given problem and measure its complexity:
• Use dynamic programming techniques and greedy algorithms to solve appropriate problems – the ultimate ideal.
• Understanding the Heap property and using it to implement priority queues.
• Solve problems using basic chart (graph) algorithms, including depth search and display search.
• Solve problems using graph algorithms, including shortest paths from a single source and for all pairs, and at least one Dijkstra's (MST) tree algorithm.
• Demonstrate the ability to evaluate algorithms, choose among a range of available options, and justify that choice, and implement the algorithm in a specific context.

Course outputs :

1.0 Knowledge and Understanding:
• 1.1: Describe the data structures and common algorithms commonly used in problem-solving scenarios.
• 1.2: Explanation of various algorithmic models, such as buffer splitting, greedy algorithms, dynamic programming, and graph algorithms.
• 1.3: Summary of techniques for reducing and transforming problems.

2.0 Skills:
• 2.1: Breaking down complex problems into solvable and effectively analyzable sub-problems.
• 2.2: Design efficient algorithms and data structures for specific computing problems.

3.0 Values, Independence, and Responsibility
•: The outputs under this section were not mentioned in the original decision document.

Additional information:

Last update date of the page content:

survey_v2

Cookies

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