CS 367: Introduction to Data Structures
HOME - Lecs 1 & 2, Spring 2012

Lectures:

Lecture 1: 1221 Computer Sciences, TR: 1:00 pm - 2:15 pm
Lecture 2: 1221 Computer Sciences, TR: 2:30 pm - 3:45 pm

Instructor:

Beck Hasti
5375 Computer Sciences, 263-2622, hasti@cs.wisc.edu
End-of-semester Office Hours:
- Saturday (5/12): 12:30 - 2:30 pm (in 1325 CS) and 3 - 5 pm (in 1350 CS)
- Monday (5/14): 1 - 5 pm
- Tuesday (5/15): 1 - 3 pm
- Wednesday (5/16): 2 - 5 pm
- Thursday (5/17): 10 am - noon
- and by appointment

TAs:

Name Email End-of-semester Lab Hours (in 1350 CS)

Mao Ito yamamoto Saturday (5/12): 10 am - noon

Youngdae Kim youngdae Sunday (5/13): 10 am - noon

Jun Huang junhuang Monday (5/14): 10 am - noon

Nisha Kiran nkiran Tuesday (5/15): 10 am - noon

Xiaoming Shi xiaoming Wednesday (5/16): 10 am - noon

Madhu Ramanathan madhurm Thursday (5/17): 1 - 3 pm

Soyoun Kim soyoun

Note: email addresses are at the cs.wisc.edu server

Grid format containing the lab and office hours for all CS 367 staff.

Course Announcements:

Programming assignment 5 has been graded. See your grade in Learn@UW for information about accessing the feedback on your assignments.
Programming assignment 4 has been graded. See your grade in Learn@UW for information about accessing the feedback on your assignments.
The scores for the final exam have been posted in Learn@UW. A histogram of the exam scores can be found on the Content page. Per longstanding CS367 policy, final exams are not returned (and no solution is posted). However, you are welcome to visit me in my office any time the door is open (between now and, say, October 1) to look through your exam and ask any questions you may have about how our answers differed from yours.
Homework assignment 10 has been graded. See your grade in Learn@UW for information about accessing the feedback on your assignments.

Course Description:

Prereqs: CS 302 or consent of instructor. Students are strongly encouraged to take CS 367 within two semesters of having taken CS 302.

Study of data structures (including stacks, queues, trees, graphs, and hash tables) and their applications. Development, implementation, and analysis of efficient data structures and algorithms (including sorting and searching). Experience in use of an object-oriented programming language.

Course Grading:

Final letter grades are determined from your final cumulative score that is computed using the following breakdown:

55% Exams :
3 exams, 2 during the semester each worth 17% of your final grade and a final worth 21% of your final grade.
25% Programs :
5 programming assignments each worth 5% of your final grade.
20% Homework :
10 homework assignments each worth 2% of your final grade.

Letter grades are assigned at the end of the semester using a single curve for students in both lectures 1 and 2. The curve is determined after the final exam is completed. The median student's course grade is usually a low B or high BC.