‫المملكة العربية السعودية‬
Kingdom of Saudi Arabia
‫وزارة التعليم العالي‬
Ministry of Higher Education
‫كلية االحاسب‬
College of computer
Course Information Sheet
Date: 05-11-1435
Course Code: CSC 313
Course Title: Algorithms Analysis and Design
Prerequisites: CSC 214
Credit Hours: 3
Lecture Hrs: 3 Lab Hrs: 0 Tut. Hrs: 0
Instructor
: Dr. Mohamed Ben Othman
Office Ext.
: 3298
Textbook:
Michael T.Goodrich,Roberto Tamassia , Algorithm Design: Foundations,Analysis,and Internet
Examples, John Wiley & Sons Inc 0-471-38365-1, 2002.
Description:
Introduction to Algorithms Analysis and Design, General Algorithms: (1- Greater
Common Divisor Algorithm, 2- Smaller Common Multiple Algorithm, 3- PascalTriangle Algorithm, 4- Inverse Number Algorithm, 5- Recursive Algorithm),
Algorithms And Procedures, Algorithm Analysis: (Algorithm Efficiency, Algorithm
Run-time, Algorithm Complexity, Computation Horner Algorithm Complexity
Degree, Multiplication Two Polynomials Complexity Degree, Computation Using
While Loop Algorithm Complexity Degree), Sorting Algorithms: (Insert Sort
Algorithm, Selection Sort Algorithm, Bubble Sort Algorithm, Heap Sort Algorithm,
Merge Sort Algorithm, Qsort Algorithm, Files Sorting Algorithms), Searching
Algorithms, Backtracking Algorithms: (8-th Queen Problem, Optimal Option
Poblem).
Evaluation and Grades Distribution
Evaluation Criterion
Homework and Quizzes and Participation
Midterm Exam(s)
Assignments & Project
Final Examination
%
10
30
20
40
‫المملكة العربية السعودية‬
Kingdom of Saudi Arabia
‫وزارة التعليم العالي‬
Ministry of Higher Education
‫كلية االحاسب‬
College of Computer
Course Information Sheet
Date: 05-11-1435
Course Code: CSC 313
Course Title: Algorithms Analysis and Design
Prerequisites: CSC 214
Credit Hours: 3
Lecture Hrs: 3 Lab Hrs: 0 Tut. Hrs: 0
Instructor
: Dr. Mohamed Ben Othman
Office Ext.
: 3298
Tentative Course Schedule and Syllabus
Week
Content
1
Algorithm Analysis
2
Basic Data Structures
Elementary Data Structures, Vectors, Stacks, Queues, Sequences, Trees,
Heaps, Priority Queues, Hash Tables, Dictionaries
3
Search Trees and Skip Lists
Binary Search Trees. AVL Trees, (2,4) Trees, Red-Black Trees, Skip Lists, Splay
Trees, Locators
4
Sorting, Sets, and Selection
Merge Sort, Quick Sort, Sorting Lower Bound, Sets, Radix Sort, Selection
5
Sorting, Sets, and Selection
Merge Sort, Quick Sort, Sorting Lower Bound, Sets, Radix Sort, Selection
6
Fundamental Techniques
Greedy Method, Divide-and-Conquer, Dynamic Programming
7
Fundamental Techniques
Greedy Method, Divide-and-Conquer, Dynamic Programming
Midterm exam 1 + correction
8
9
10
Graphs
Graphs, A Graphs Project, Depth-First Search, Breadth-First Search,
Biconnectivity, Directed Graphs.
Weighted Graphs
Shortest Paths, Minimum Spanning Tree
11
12
13
Network Flow and Matching
Network Flow
Midterm exam 2 + correction
Text Processing
Pattern Matching, Tries
14
Number Theory and Cryptography
Numerical Algorithms, FFT, Cryptography, RSA Encryption, Information
Security
15
NP-Completeness
NP-Completeness Definitions, NP-Completeness Reductions, Approximation
Algorithms
Final exam
16