1 / 11

Welcome to CPCS 223

Welcome to CPCS 223. Fall 2019 Faculty of Computing and Information Technology King Abdulaziz University. Analysis & Design of Algorithms. Your Instructor. Dr . Haneen Banjar hrbanjar@kau.edu.sa My office: S116 Office Hours: By appointment via email. Course.

reisinger
Download Presentation

Welcome to CPCS 223

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. Welcome to CPCS 223 Fall 2019 Faculty of Computing and Information Technology King Abdulaziz University Analysis & Design of Algorithms

  2. Your Instructor Dr. HaneenBanjar hrbanjar@kau.edu.sa My office: S116 Office Hours: By appointment via email

  3. Course • Textbook:AnanyLevitin, "Introduction to the Design & Analysis of Algorithms", Addison-Wesley Longman; 3rd edition (2012). • Marks Distribution:

  4. Key Outcomes • Study solutions to fundamental programming problems • Examine how computer solutions are designed + how they perform • Compare different solutions to the same problem

  5. Course Learning Outcome • Discuss the formal definition of algorithm. • Discus how the efficiency of algorithms is characterized and measured. • Solve simple recurrence relations using select (covered) techniques. • Determine the time efficiency of simple iterative or recursive algorithm given its pseudocode using select (covered) techniques and theorems. • Use given algorithm to solve small instances of select (covered) problems by hand. • Write proper (well-formed) pseudocode based on knowledge of algorithm operation. (Intent: not a design outcome). • Analyze select (covered) decrease-conquer algorithms given a pesudocode. • Compare select (covered) algorithms and related data structures in terms of design, operation, performance, and applications.

  6. Course Learning Outcome • Compare select (covered) algorithms and related data structures in terms of design, operation, performance, and applications. • Analyze select (covered) divide-conquer algorithms given a pesudocode. • [x] MERGED WITH 8 - Compare select (covered) algorithms and related data structures in terms of operation, performance, and applications. • Analyze select (covered) transform-conquer algorithms given a pesudocode. • Compare select (covered) data structures with respect to dictionary operations. • Apply empirical techniques to assess and report the performance of one or more algorithms. • Implement algorithm given its pseudocode in programming language and environment of choice. • Design an algorithm to solve a problem based on requirements or solution descriptions, or an outline of steps.

  7. Weekly Schedule

  8. Weekly Schedule

  9. Weekly Schedule

  10. Weekly Schedule

  11. Success • Review Learning Outcomes • Study early, study regularly • Pay attention in class • Do exercises yourself • B+ and above, read the textbook carefully

More Related