CS 6363.002: Algorithms (Spring 2012)
Announcements
* 05/15: Grades are available on elearning. They will appear on Orion
within the next 2 days.
* 05/14: If you want to see your final exam paper, I will be available
1:00-4:00 PM tomorrow (Tuesday, May 15), and 12:30-1:15 PM on
Friday, May 18. All scores will be available in elearning at
10:00 AM on Tuesday, May 15. Send me email if you see any errors.
Grades will be entered in Orion Tuesday afternoon.
* 05/04: Extra office hours for next week:
May 7 - May 10 (Mon-Thu): 1:00 PM - 4:30 PM.
* 05/03: Important topics for final exam
* 04/26: Final Exam: 2:00-4:00 PM, May 11 (Fri)
Closed book, notes, calculator, etc.
Two cheat sheets 8 1/2" x 11" hand-written pages (both sides) allowed.
Cheat sheets must be submitted with your answers.
Paper will be provided. Bring your own pen/pencil/eraser.
As per EECS policy, must bring photo ID (UTD picture ID / driver's lic).
Topics: All topics covered in class, including NP-completeness.
Divide-and-conquer; Dynamic Programming[15]; Greedy algorithms[16];
Graphs[21-26]: DFS, BFS, Shortest paths, MST, Flows;
NP-completeness[34]. Analysis of Union/Find is not in exam.
* 04/19: Assignment 4 (due Wed, 5/2).
* 04/04: Assignment 3 (due Wed, 4/18).
Practice problems:
Graph representation: Ex. 22.1-1, 22.1-3
DFS: 22.3-2, 22.3-5, 22.3-8, 22.3-10, 22.4-2, 22.5-2
MST: 23.1-5, 23.2-4, 23.2-5, 23.2-6, Prob 23-1, 23-3
* 03/27: Project: what to submit.
Deadline for online submission on elearning extended to 11:59 PM.
Written part of project is still due in class at 4:00 PM.
If you have additional results to report by 11:59 PM,
upload a file named addendum.txt with the new results.
* 03/22: Errors in detailed output of sample inputs corrected.
Include output generated by your programs for these test data sets.
* 03/21: Extra office hours from 10:30 AM - 2:30 PM on Thu/Fri (3/22, 3/23),
for help with project (with a brief lunch break of 10 mins).
Sample inputs for project (end of each file has its output):
ASP: in.asp.1, in.asp.2, in.asp.3, in.asp.4, in.asp.5, in.asp.6.
Knapsack: in.ks.1, in.ks.2, in.ks.3, in.ks.4.
* 03/20: Final exam is on Fri, May 11 at 2 PM, as in syllabus.
The class log had a wrong date and time (corrected now).
* 03/19: Project (due Wed, 3/28).
Your program need not handle exceptions created by input data
that does not conform to specification (e.g., negative numbers
in the array that is input to knapsack).
* 03/01: No online notes for Lecture #12 (Feb 29), #13 (Mar 5).
* 02/29: Mid-term exam (Wed, Mar 7: 3:55 - 5:20 PM)
Closed book, notes, calculator, etc.
One cheat sheet 8 1/2" x 11" hand-written page (one side only) allowed
Cheat sheet must be submitted with your answers.
Paper will be provided. Bring your own pen/pencil/eraser
As per EECS policy, must bring photo ID (UTD picture ID / driver's lic)
Topics: Mathematical concepts (Ch 1-4, Appendix),
Divide and conquer (Notes, various chapters in book),
[FFT is not in exam], Search (Binary, median),
Sorting (Quick, Merge, Heap, Counting, Radix, Bucket),
Decision tree lower bound for comparison based sorting,
Dynamic programming (Chapter 15 + ASP, Knapsack, LMS).
* 02/27: When submitting an algorithm (assignment/project/exam),
include explanation along with its (pseudo)code.
Mention loop invariants where appropriate.
* 02/24: Assignment 2 can be submitted late, without penalty,
until 5 PM on Friday, March 2 (in ECSS 4.225).
* 02/15: Assignment 2 (due Wed, 2/29).
* 02/14: Practice problems: Ex. 9.3-7, 15.1-2 (not in 2nd ed), 15.4-1,
Prob 15-4, 15-6 (15-2, 15-4 in 2nd ed),
Dynamic program for 0-1 knapsack (see Section 16.2)
* 02/02: Teaching assistants:
Dane Kuiper (kuiper@utdallas.edu)
Wed 5:20-6:20 PM, ECSS 4.205
Thu 3:00-5:00 PM, CS open lab
Rui Xia (rxx090020@utdallas.edu)
Mon 2:00-4:00 PM, ECSS 4.209 (was 4.409)
* 02/01: Assignment 1 (due Wed, 2/15).
* 01/26: More practice problems: Prob 4-1, 4-5 (4-6 in 2nd ed).
* 01/25: Practice problems (do not submit): Prob 3-1, 3-2, 3-3, Ex. A.2-4, Prob A-1.
Return to Balaji Raghavachari's
home page.