Objectives and Outcomes


  • Instructor: Amarda Shehu amarda\AT\gmu.edu
    Place and Time: Art and Design Building 2003, W 4:30-7:10 pm
    Instructor Office Hours: ENGR #4452, W 2:30-4:30 pm
    TA Office Hours: Mani Ratnam Injeti (minjeti@), ENGR #5321, M 5:00-6:00 pm


  • Upon completion of this course, students should be able to analyze and compare algorithms in terms of both time and space complexity, understand fundamental sorting, optimization, and graph algorithms, understand when and how to use advanced data structures, analyze the computability of a problem, reason algorithmically, and design efficient algorithms.