The instructor describes: This course provides a comprehensive introduction to the modern study of computer algorithms. It presents and covers many algorithms in great depth, making their design and analysis accessible to the student level. It maintains straightforward explanations without sacrificing the depth of coverage or the objectivity of computer science.
Credit hours: 3
Prerequisites: CS 181
Objectives of the course :
• Providing students with adequate knowledge and learning in some aspects of computer algorithms.
• Improving the algorithms and problem-solving skills of students to enable them to work effectively in their professional careers.
• Preparing students to pursue excellence in algorithms, data structures, and other fields related to computer science.
• Make students more responsible towards the quality of their professional programming practices.
Course outputs :
1.1: Understanding the basic principles and techniques of algorithms, including the analysis of temporal and spatial complexity.
1.2: Understanding tradeoffs and balances between different algorithms and data structures, and the ability to choose the best one for a particular problem.
2.1: Analysis of algorithms for a variety of problems, including sorting and searching.
2.2: Applying the concept of randomness to the design and analysis of algorithms, such as sorting and random search algorithms.
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