1 / 8

Algorithms Design and Analysis

Algorithms Design and Analysis. CS 411. Course description / Algorithms Design and Analysis. Course name and Number: Algorithms designs and analysis – CS 411 Number of credits: 3 (contact hours: lecture - 3, exercise – 1) Level or year in which the course is offered: Level 7

melyssa-patterson
Download Presentation

Algorithms Design and Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algorithms Design and Analysis CS 411

  2. Course description / Algorithms Design and Analysis • Course name and Number: Algorithms designs and analysis – CS 411 • Number of credits: 3 (contact hours: lecture - 3, exercise – 1) • Level or year in which the course is offered: Level 7 • Pre-requisite course(s) : Data structures - CS 322+ Discrete structures – CS 310 • ahmedzmiot@yahoo.com

  3. Brief description • Apply the basic techniques for algorithm analysis. • Use, compare and analyze the primary sorting and searching algorithms. • Use, compare and analyze the primary graph processing algorithms. • Describe some of the algorithms used for mathematical applications. • Describe and apply the divide-and-conquer, greedy, dynamic programming backtracking, and branch-and-bound methods. • Describe lower bound theory.

  4. The principal book(s) requested: “INTRODUCTION TO ALGORITHMS”, by Cormen, Leiserson, Rivest and Stein, latest Edition, MIT Press.

More Related