Course Schedule
[Note: this webpage last modified Wednesday, 20-Jul-2011 08:09:35 EDT]
Each day in the first part of the semester, we will cover material from the required text. Whoever is presenting a given day is responsible for the lecture and sending to me the following: required reading for the day, a quiz problem, and a homework problem.
If you would like to reserve a chapter or chapters and a date within the first few weeks to present, send me email.
This web-page will be kept up to date with the required reading to perform before each lecture. I will also list the key concepts that we cover each week.
Week 0 (Jan 11, 13)
- Presenters: Jeff on both Jan 11 and 13.
- Key Concepts:
Jan 11: syllabus and course overview, what is an algorithm, running time and space usage of algorithms, big-O, big-Omega, big-Theta, asymptotic growth of functions, determining if a list has duplicates
Jan 13: error-correcting code, Hadamard code, Reed-Solomon code
- Required Reading:
Jan 11: Chapters 1 (Algorithms), 15 (Time and Space Complexity). Wikipedia pages: analysis of algorithms. For enjoyment only, wikipedia pages on computational complexity theory and time complexity.
Jan 13: Chapter 12 (Error-Correcting Codes). notes on Reed-Solomon codes.
- Just for fun: video (click on "Part 2") and powerpoint slides for rousing talk by Scott Aaronson about "the future of CS".
Week 1 (Jan 18, 20)
- Presenters: Luke on Tuesday. Kunal on Thursday.
- Key Concepts:
Jan 18: interpreting 2-dimensional drawings as 3-dimensional objects, classifying the junctions and lines of line drawings
- Required Reading:
Jan 18: Chapter 19 (Computer Vision).
Jan 20: Chapter 36 (Neural Networks).
Week 2 (Jan 25, 27)
- Presenters: Kartheek on Tuesday. Abhinav on Thursday.
- Key Concepts:
- Required Reading:
Jan 25: Chapter 53 (Disk Operating Systems).
Jan 27: Chapter 65 (Relational Databases).
Week 3 (Feb 1, 3)
- Presenters: Anusha on Thursday.
- Key Concepts:
- Required Reading:
Feb 1: ISU closed for ice storm.
Feb 3: Chapter 20 (Karnaugh maps)
Week 4 (Feb 8, 10)
- Presenters: Bharat on Tuesday. Phani on Thursday.
- Key Concepts:
- Required Reading:
Feb 8: Chapter 60 (Computer viruses)
Feb 10: Chapter 6 (Game Trees)
Week 5 (Feb 15, 17)
- Presenters: Sunanda on Tuesday. Vijay on Thursday.
- Key Concepts:
- Required Reading:
Feb 15: Introduction to Python. See the Python tutorial.
Feb 17: Software testing (wikipedia).
Week 6 (Feb 22, 24)
- Presenters: Meet in A-009 for guest speaker on Tuesday. Masood on Thursday.
- Key Concepts:
- Required Reading:
Feb 24: Chapters 35, 40 (sorting).
Week 7 (Mar 1, 3)
- Presenters: Venkat on Tuesday. Tuo Wang on Thursday
- Key Concepts:
- Required Reading:
Mar 1: Chapter 38 (circuits).
Mar 3: Chapter 62 (parallel computing).
Week 8 (Mar 15, 17)
- Presenters: Shalini on Thursday.
- Key Concepts:
- Required Reading:
Mar 15: no class - work on your projects.
Mar 17: Shalini's slides on networking.
Week 9 (Mar 22, 24)
- Presenters: Sai on Thursday.
- Required Reading:
- Mar 22: no class - work on your projects.
- Mar 24: Chapter 64 (logic programming), and Logic Programming, Prolog.
Week 10 (Mar 29, 31)
- Presenters: Shikara on Thursday.
- Required Reading:
- Mar 29: no class - work on your projects.
- Mar 31: Chapter 22 (minimum spanning trees). See also wikipedia articles on minimum spanning trees, Prim's algorithm, Kruskal's algorithm.
Week 11 (Apr 5, 7)
- Presenters: Anand on Thursday.
- Required Reading:
- Apr 5: no class - work on your projects.
- Apr 7: Public Key Cryptography.
Week 12 (Apr 12, 14)
- Project Demos in class on both days, see email for the schedule.
Week 13 (Apr 19, 21)
- Project checkins...
Week 14 (Apr 26, 28)
- Project checkins...
Final Exam slot
Thursday, May 5 10:00am-12:00. We will have some of the final project presentations.