• Course Code :
  CS313
• Level :
  Undergraduate
• Course Hours :
  3.00 Hours
• Department :
  Department of Computer Science

Instructor information :

• Title:Teaching Assistant
• Name: Fatmaelzahra Hamdi Abdallah Mohamed
• Office hours:-Hours


• Title:Teaching Assistant
• Name: Farah Ashraf Wafaa Mahmoud
• Office hours:-Hours


• Title:Teaching Assistant
• Name: Yasmina Mohamed Nasr Abdel Latif Eldafrawy
• Office hours:-Hours


• Title:Associate Professor
• Name: Wael Zakaria Abdallah Mohammed
• Office hours:-Hours

Apply the basic concepts and theories of algorithms. Analyze the requirements of a computing system and design algorithms that are appropriate for problems that they might encounter. Recognize knowledge that enhances skills in fundamental area of computer science. Use and adopt fundamental and advanced mathematics, basic sciences and algorithms theories in all development phases of computer-based systems. Solve problems using algorithms through computational analysis and complexities.

The course is concerned with design and analysis of algorithms. It covers design techniques, Such as dynamic programming and greedy methods, As well as fundamentals of analyzing algorithms for correctness and time and space bounds. Topics include advanced sorting and searching methods, Graph algorithms and geometric algorithms, Notion of an algorithm: Big-o, Small-o, Theta and omega notations. Space and time complexities of an algorithm. Fundamental design paradigms: Divide and conquer, Branch and bound, Backtracking dynamic programming greedy methods, Simulation. Theory of up-completeness, Notion of an intractable problem. Measures of approximation: Ratio bound and relative error. Polynomial time approximation scheme. Illustrative examples: Graph theory, Areas vary from year to year, and may include matrix manipulations, String and pattern matching, set algorithms, Polynomial computations, and the fast Fourier transform. Recent correlated software packages should be used through labs.

NAQAA

ABET

Course outcomes:

a. Knowledge and Understanding:
	1- Discuss the fundamental concepts and theories related to algorithms. 2- Describe the basic concepts of high level programming languages for algorithms implementation. 3- Discuss specifications and strategic planning to solve computational problems, including Divide-and-Conquer, dynamic programming, greedy algorithms. 4- Identify the fundamental algorithms required to solve problems in computer science.
b. Intellectual Skills:
	1- Analyze and design algorithms for computing problems considering limitations and constrains. 2- Apply and Implement algorithms for CS Problems with in commercial and industrial constrains. 3- Propose a set of alternative algorithms for a given problem associated with their results 4- Compare and differentiate between algorithms, methods and techniques used in Computer Science Problems solutions.
c. Professional and Practical Skills:
	1- Deploy and develop different algorithms in projects. 2- Apply, design methodologies, programming languages, algorithms and different supporting tools. 3- Evaluate the quality of computing systems using different factors and different constrains.
d. General and Transferable Skills:
	1- Exploit a range of learning algorithms. 2- Utilize effectively general computing facilities. 3- Appreciate continuous professional development and lifelong learning.

For further information :

• Telephone: 16383 (16FUE)
• E-mail: [email protected]