TIME & LOCATION

Tue./Thurs. 12:00-1:15pm

ME 1061

All PSOs held in HAAS G040

DESCRIPTION

This course provides an introduction to the theoretical and practical aspects of data structures and algorithms. Topics will include: fundamental data structures (e.g., arrays, stacks, queues, trees, hash tables, graphs), fundamental algorithms (e.g., sorting, pattern matching, topological sorting, shortest path, minimum spanning tree), and their implementations (e.g., asymptotic and average running time analysis, pointer-based implementation of trees, and adjacency matrix implementations of graphs).

PREREQUISITES

CS24000: Programming in C.

TEXT

Algorithms (4th edition)

Addison-Wesley, 4th edition.

ISBN-13: 978-0321573513

The web site for the book that includes code snippets

can be found here.

ASSIGNMENTS AND EXAMS

There will be four written homework assignments consisting of questions and problem-solving tasks in the format used for the exams.

There will be five programming assignments. Programming assignments should be written in Java, unless otherwise noted. Assignments should be submitted on lore using "turnin." Details will be provided in the assignments.

In general, questions about the details of assignments should be directed to the Blackboard Learn discussion group for general questions, or to the TAs/instructors (via the joint email list cs251-ta@cs.purdue.edu) for questions specific to your assignment, though you should feel free to email the instructor directly.

There will be regular unannounced in-class quizzes as well as a midterm exam and a comprehensive final exam. Exams and quizzes will be closed book and closed notes.

GRADING

1. •Programming and written assignments: 45%
   

2. •Quizzes: 5%
   

3. •Midterm exam (Thursday, October 11, 2012, ME 1061, 12pm): 20%
   

4. •Final exam (Monday, December 10, 2012, LILY 1105, 7pm): 30%
   
   

Grades will be posted on Blackboard. If you think a grading error was made on an assignment or test, or if you do not receive a homework assignment or exam back, you must talk to the TA or the instructor within a week of when it was returned.

LATE POLICY

Assignments are to be electronically submitted by the due date listed. Each person will be allowed four days of extensions which can be applied to any combination of assignments during the semester without penalty. After that a late penalty of 20% per day will be assigned. Use of a partial day will be counted as a full day. Use of extension days (including number) must be stated explicitly in the subject line of an email to the TAs, otherwise late penalties will apply. Extensions cannot be used after the final day of classes (i.e., April 28th). Extension days cannot be rearranged after they are applied to a submission. Use them wisely! Assignments will NOT BE accepted if they are more than five days late (regardless of whether extension days will be applied to that particular assignment or not). Additional extensions will be granted only due to serious and documented medical or family emergencies.

ACADEMIC HONESTY

Please read the departmental academic integrity policy. This will be followed unless we provide written documentation of exceptions. However, we encourage you to interact amongst yourselves: you may discuss and obtain help with basic concepts covered in lectures or the textbook, homework specification (but not solution), and program syntax issues (but not program design). However, unless otherwise noted, work turned in should reflect your own efforts and knowledge. Sharing or copying solutions is unacceptable and could result in failure. Do not copy code and then make changes (either from the Web or from other students). You are also expected to take reasonable precautions to prevent others from using your work. Be aware that we will use a software tool called MOSS (http://theory.stanford.edu/~aiken/moss/) to check for copying among submitted assignments. Additionally, the instructors and TAs will be inspecting all submitted material to ensure honesty. Any case of academic dishonesty will be dealt with by a severe grade penalty in the overall class grade and referral to the office of the Dean of Students.

DISCUSSION GROUP

Questions/comments should be posted on the discussion forum on Blackboard.

Make sure to check the discussion group and your Purdue e-mail (we will use a course email list for important announcements) *frequently* (at least once or twice per day). Please do NOT post answers to the assignments on the discussion group, though posting general clarifications is fine. Complaints about the assignments or the class should NOT be posted to the group-- instead, they should be e-mailed to the joint TA/instructor email list cs251-ta@cs.purdue.edu

ADDITIONAL COURSE POLICIES

Please read the general course policies here.

COUNSELING

If you are experiencing personal problems or stress, Purdue provides counseling services through the Purdue CAPS Center. See https://www.purdue.edu/CAPS/ for more details.