Page Preview: 77

Course Title[Course Code]:Assembly Language[CSW 353]

Faculty: Computers and Artificial Intelligence
Department: Scientific Computing
Program: Scientific Computing
Compulsory / Elective:Compulsory
Undergraduate(Third Year-First Semester)
Hours:
Lecture:( 3 ) Practical / Clinical:( 2 ) Tutorial:( - )

Course Description:
The course aims at introducing the Algorithm concept. Analysis and complexity. Design methods: Divide and conquer: The general method, binary search, merge sort, quick sort, selection, and matrix multiplication. Greedy method: The general method, minimum spanning Trees. Dynamic programming: The general method, shortest paths, optimal search trees, and the traveling salesman problem. Backtracking: The general method, The 8-queens Problem. NP-hard and NP-complete problems: Cook’s theorem, NP-hard graph problems.