CPCS 223 - Analysis and Design of Algorithms
Home
Research
Online Systems
Publications
Invited Talks
Organized Events
Teaching
Resume

 

 

 
 

Slides    

Course Description

This course is the first of a two-course sequence on algorithmic solution design and advanced data structures. The course is intended to introduce selected fundamental algorithms from different application areas to illustrate the techniques used to construct those algorithms, and to study their performance. Topics include: formal definition and characterization of algorithms, fundamentals of algorithm efficiency including recurrence relations, asymptotic notation, efficiency classes and empirical analysis of performance, brute force techniques, divide-conquer, decrease-conquer and graphs.

  • Course Code: CPCS 223
  • Course Title: Analysis and Design of Algorithms
  • Course Instructor: M. G. Abbas Malik
  • Lab Tutor: To be anounced
  • Office Hours: 1300 - 1500 on Monday & Wednessday (Office # 20)
  • Classes: 1100 - 1220 on Monday & Wednessday (NJ6 Room 110A)

Lectures Slides            Back on Top

WHAT'S NEW

Welcome to Class of CPCS 223

Sunday January 26, 2014