Scribd
Upload
31 views7 pages

00 CS 312 Comp Algo Course Description

This document provides information about the CS 312 Computing Algorithms course taught by Professor Essam Fakharany at the Arab Academy for Science and Technology. The course introduces algorithm complexity, design techniques like divide-and-conquer and dynamic programming. It covers algorithms for sorting, searching, graphs, and computational geometry. Students will analyze algorithm time complexity, construct recurrence equations, and implement algorithms using appropriate data structures. The course is assessed through exams, homework, programming assignments, and a final exam.

Uploaded by

Abdallah Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
31 views7 pages

00 CS 312 Comp Algo Course Description

This document provides information about the CS 312 Computing Algorithms course taught by Professor Essam Fakharany at the Arab Academy for Science and Technology. The course introduces algorithm complexity, design techniques like divide-and-conquer and dynamic programming. It covers algorithms for sorting, searching, graphs, and computational geometry. Students will analyze algorithm time complexity, construct recurrence equations, and implement algorithms using appropriate data structures. The course is assessed through exams, homework, programming assignments, and a final exam.

Uploaded by

Abdallah Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Arab Academy for Science and Technology and Maritime

Transport.
College of Computing and Information technology.

CS 312 Computing Algorithms

Course Description
ASOC. PROF. ESSAM FAKHARANY
VICE DEAN FOR POSTGRADUATE STUDIES AND RESEARCH AFFAIRS
COLLEGE OF COMPUTING AND INFORMATION TECHNOLOGY-SMART VILLAGE
EMAIL: ESSAM.FAKHARANY@GMAIL.COM
Course Description:

This course introduces


 The mathematical design and analysis of computer algorithms.
 Algorithm complexity, growth of functions, recurrences will be covered.
 Algorithm design techniques such as divide-and-conquer, dynamic programming
and greediness will be introduced.
 Moreover, well known algorithms for e.g. sorting, searching, graph problems and
computational geometry will be developed.
Course Objectives:

 1. Apply asymptotic time complexity analysis to choose among competing


algorithms
 2. Construct and solve recurrence equations describing the asymptotic time
complexity of a given algorithm.
 3. Identify the best algorithm design technique for a given problem.
 4. Implement efficient algorithms using the appropriate data structures.
Course Outline:

1. Week 1. Introduction 9. Week 9. Dynamic


2. Week 2. Algorithms analysis and programming (cont.)
sorting techniques 10. Week 10. Divide and Conquer
3. Week 3. Recurrences 11. Week 11. Graph Algorithms
4. Week 4. Brute Force Algorithm 12. Week 12. 12th Week
Assessment
5. Week 5. Greedy Algorithms
13. Week 13. Parallel Algorithms
6. Week 6. Greedy Algorithms
(cont.) 14. Week 14. Parallel Algorithms
(cont.)
7. Week 7. 7th Week Assessment
15. Week 15. Revision
8. Week 8. Dynamic programming
16. Week 16. Final Exam
Course Material

 Textbook:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
Introduction to Algorithms, The MIT Press.
 References:
Levitin A., Introduction to the Design and Analysis of Algorithms, Pearson.
Steven S. Skiena, The Algorithm Design Manual, Springer-Verlag
Grade Distribution:

 7th Week Assessment (30%):


Exam (20%) + Homework Assignments 10%
 12th Week Assessment (20%):
Exam / Project (20%)
 Year Work (10%):
Programming Assignments 10%
 Final Exam (40%)
Policies:

 Attendance:
AASTMT Education and Study Regulations (available at aast.edu)
 Academic Honesty:
AASTMT Education and Study Regulations (available at aast.edu)
 Late Submission:
Late submissions are graded out of:
75% (2 days late),
50% (3 Days late),
25% (4 Days late),
0%(more than 4 Days late)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy