ECE 608

Computational Models and Methods


Professor:
Office:
Phone:
Office hours:
Login:
Bob Givan
EE 313C
7248-235-567 (mobile, backwards)
follow this link
givan@purdue.edu
Teaching Assistant:
Office:
Office hours:


Login:

Anmol Bhattad
EE 234
Mon 12:30-1:30 pm
Wed 10:30-11:30 am
Thur 4:30-5:30 pm
bhattad@purdue.edu

Exams

  • Midterm Exam: March 9th, in class
  • Final Exam: May 2nd, 8am-10am, FRNY G140

  • Note: Accessing Course Contents

    Accessing the following handouts and homeworks will result in being prompted for your Purdue user ID and password. Access is limited to the Purdue community.

    Handouts and Homeworks

    Course Information txt
    Model Mid-term Exam (with solutions) Sample Mid-term
    Model Final Exam Sample Final
    Midterm Solution Midterm Solution
    Problem mappings across editions
    --provided as is, no guarantees
    2nd Ed. to 3rd Ed.
    Homework 1
    Due: 01/26/2017
    Hw1
    Solutions
    Homework 2
    Due: 02/02/2017
    Hw2
    Solutions
    Homework 3
    Due: 02/14/2017
    Hw3
    Solutions
    Homework 4
    Due: 02/21/2017
    Hw4
    Solutions
    Homework 5
    Due: 02/28/2017
    Hw5
    Solutions
    Homework 6
    Due: 03/23/2017
    Hw6
    Solutions
    Homework 7
    Due: 04/04/2017
    Hw7
    Solutions
    Homework 8
    Due: 04/11/2017
    Hw8
    Solutions
    Homework 9
    Due: 04/18/2017
    Hw9
    Solutions
    Homework 10
    Due: 04/18/2017
    Hw10
    Solutions
    Homework 11
    Due: 04/25/2017
    Hw11
    Solutions
    Homework 12
    Hw12
    Solutions

    Lecture Slides

    * Tuesday, 1/10/17   Introduction to Algorithm Analysis
    * Thursday, 1/12/17   Loop invariants, Design and analysis of recursive functions
    * Tuesday, 1/17/17   Quicksort and Mergesort design
    * Thursday, 1/19/17   Recurrence trees, Insertion sort runtime, Intro to Mathematical Induction
    * Tuesday, 1/24/17   Mathematical Induction, Equivalence relations
    * Thursday, 1/26/17   Growth of Functions
    * Tuesday, 1/31/17   Asymptotic growth relationships and Mathematical Induction
    * Thursday, 2/02/17   Solving recurrences
    * Tuesday, 2/07/17   Proof of Master theorm, Intro to randomized algorithms
    * Thursday, 2/09/17   Indicator variables, Shuffle
    * Tuesday, 2/14/17   Probabilistic analysis
    * Thursday, 2/16/17   Heaps, ExtractMax
    * Tuesday, 2/21/17   Build_heap, Quick sort
    * Thursday, 2/23/17   Quicksort Analysis
    * Tuesday, 2/28/17   Lower bound in comparison sorting
    * Thursday, 3/02/17   Counting sort, Radix sort
    * Tuesday, 3/07/17   Bucket sort, Order statistics, Intro to hashtables
    * Tuesday, 3/21/17   Midterm 1 review, Hash Tables
    * Thursday, 3/23/17   Analysis of Chaining, Hash function design
    * Tuesday, 3/28/17   Open addressing hash tables
    * Thursday, 3/30/17   Intro to dynamic programming
    * Tuesday, 4/04/17   Matrix Chain Parenthesization
    * Thursday, 4/06/17   Dynamic Programming Examples
    * Tuesday, 4/11/17   Greedy algorithms
    * Thursday, 4/13/17   Minimum Cost Spanning Trees
    * Tuesday, 4/18/17   Single source shortest paths
    * Thursday, 4/20/17   Depth First Search, Topological Sort and Strongly Connected Components
    * Tuesday, 4/25/17   Decision problems, Undecidability, Reductions, The class P
    * Thursday, 4/27/17   NP and NP-hardness

    Maintained by Bob Givan and course staff
    givan@purdue.edu