CS 315: Algorithms & Data Structures

Fall 2011: TTh 2:00 - 3:30 in WEL 2.246, Unique No. 52320 - 45

TAs:

• Hrishikesh B. Acharya, acharya@cs.utexas.edu       Office Hours: M T W 4-5 at TA Station 1, PAI 5.33 .
• Xie, Chao chao@cs.utexas.edu       Office Hours: W 2-4 and F 2-3, PAI 5.33 .
• Ali Muqeet muqeet@cs.utexas.edu       Grading.

Lab Proctor will be in the lab to help with programming projects:

• Tomas McCandless: tomniscientia@gmail.com
  Hours: PAI 5.38, Mon: 9:00-10:00, 12:00-3:30, 5:30-8:30;   Tues: 9:00-11:00, 12:30-2:00;   Wed: 9:00-10:00, 1:00-4:00, 5:30-8:30;   Thurs: 9:00-11:00.

Text: Mark Allen Weiss, Data Structures and Algorithm Analysis in Java, 2nd Ed.; Amazon; Barnes & Noble.

Course Notes: Strongly recommended; obtain at WEL 2.228. Online by Contents   (http://www.cs.utexas.edu/users/novak/cs315contents.html) or Index or PDF      DO NOT print out the slides on CS department printers.

Web Page: http://www.cs.utexas.edu/users/novak/cs315.html

Programming assignments will mainly be done in Java, with options to do some in Lisp. Program files may be provided for use with the assignments, in the directory /projects/cs315/ or in the FTP directory for Program Files, ftp://ftp.cs.utexas.edu/pub/novak/cs315/ It is legal to use any of these files as part of your programs.

Prerequisite:

Topics:

• Introduction: why we need clever algorithms and data structures.
• Performance: Big O: how much time and storage are needed as data sizes become large
• Some Lisp: (+ x 3)
• Lists and Recursion; Stacks and Queues
• Trees and Tree Recursion
• Using Library Packages
• Balanced Trees and Maps
• Hashing and randomization; XOR
• Heaps and Priority Queues
• Sorting, Merge
• Graphs
• Map, Reduce, and MapReduce

Grading:

Grades are kept on Blackboard. It is your responsibility to check your grades often to make sure that your assignments have been received and graded.

Course grades are assigned on the scale A = 93-100, A- = 90-93, B+ = 87-90, B = 83-87, B- = 80-83, etc. provided that the Final Exam grade is at least 65; if the Final Exam grade is below 65, a lower course grade may be assigned at the instructor's discretion. Grades are averaged using the following weights:

Attendance	10%
Midterm Exam	20%		Thursday, October 20, in class
Final Exam	30%		Monday, December 12, 9:00-12:00 AM
Programming Assignments	40%

Each student will get 2 free absences; longer absences for things such as serious illness will be granted when documented. There will be a 10% per day late penalty for late programming assignments up to 4 days; no late assignments will be accepted after 4 days. It is the student's responsibility to make certain that assignments are submitted correctly using the turnin system.

Programming projects must be your own individual work. Students may discuss concepts or help with specific problems in another student's code. However, sharing code constitutes plagiarism. Students may not work together on program design. The Moss program will sometimes be used to detect duplicated programs. It is not possible to pass the course without doing the programming assignments. It is not legal to sign the attendance sheet for anyone other than yourself.