[ Home | Assignments | Links | News ]

CIS 323 - Data Structures Lab

Winter 2008

• Time and Place: Thursday 8:30-9:50am in 112 Esslinger (ESL)

• Detailed Course Information: CIS 323 @ DuckWeb

• Instructor: Paea LePendu, 227 Deschutes, 541-346-1380, paea@cs.uoregon.edu.

• Teaching Assistant: Yibo Wang, 360 Deschutes, 541-346-0199, wangyibo@cs.uoregon.edu.

• Office hours: Students can drop in anytime, make an appointment, or find us in our offices.
  • Paea: Tue 10:00-11:30am (Please knock if the door is closed.), or by appointment.
  • Yibo: Tue 14:00-15:30

• Jam-sessions: In addition to office hours, we will proctor weekly "jam-sessions" for extra, hands-on, programming help in the Deschutes computer lab.
  • Thu (Paea): 5:00-6:30pm
  • Thu (Yibo): 3:00-4:30pm Deschutes 100 Lab (time changing to 12:00-1:30pm starting 01/24/2008)

• Course Objectives: There are three primary goals for this course.
  • To implement various data structures learned in the companion course, CIS 313.
  • To become familiar with integrated development environments, debugging tools, version control, good coding style, and basic UNIX commands.
  • To become comfortable programming in both C++ and Java.

• Evaluation: Course grades (Pass/No Pass) will be based on the following criteria.

  Assignments	80%
  Participation	20%

• Tentative Schedule:

  Week 1	Welcome. Syllabus and introductions. Assignment 0: dos and don'ts. Assignment 1: Linked Lists
  Week 2	Basics: UNIX, C++, compiling, library usage policy. Setting up Eclipse.
  Week 3	The Pulse. Timing: linear vs. squared (time vs. space). Eclipse & debugging (breakpoints, watch expressions). Questions? Assignment 2: Binary Search Trees.
  Week 4	Timing: sorted input, balance, height and depth, applications.
  Week 5	Assignment 3: Balanced Trees (Red-Black) Tree traversals. Logarithms and tree height, how and why.
  Week 6	The Pulse. Review Assignment 2. Review RB-Tree rotations & insert.
  Week 7	Assignment 4: Max-Binary-Heaps Array-based implementation. Heap-Insert. ExtractMax Heap-Grow (hedging your bets).
  Week 8	Assignment 5 (extra credit): Sorting Algorithms (Quicksort) Heaps continued.
  Week 9	Miscellaneous topics. Homework questions. Quicksort.
  Week 10	Evaluations. Wrap up.

• Text: Cormen, Leiserson, Rivest, & Stein, Introduction to Algorithms, 2nd Edition, MIT Press/McGraw-Hill, 2001 (as part of CIS 313).

• Supplemental Reading:Winston, On To C++, Addison-Wesley, 1994 (available on Amazon.com).

• Assignments: You will be expected to program in C/C++, but fear not: we understand that you may have never programmed in C/C++ before this course and will have to learn as you go. There will be 4 (maybe 5) homework assignments due roughly every other week. They will not be handed out in class. You will find them on the web under assignments. Grading will be based roughly on the following guidelines: 30% correct I/O, 30% correct timing, 20% style and 20% documentation. If your program does not compile, it cannot be graded and will probably receive a zero.

• Late policy: All assignments are due by 11:59pm of the stated due date. Late assignments are subject to a 10% per day penalty. Late assignments will not be accepted once the graded assignments are returned or once sample solutions are posted or handed out. Any exceptions must be communicated to and resolved with the instructor well in advance of the due date (such as family emergencies). It is your responsibility to turn in the assignments on time and verify they have been actually received by the instructor or grader (which means you should request a receipt confirmation if you have not received one within a reasonable amount of time).

• Academic Honesty (cheating): There is a fine line between collaboration, background reading and cheating. I believe everyone intrinsically knows the difference most of the time. Sometimes, however, it is not always clear and you are strongly encouraged to talk to the instructor before doing something that is borderline. Cheating will not be tolerated and the consequences are severe: you may receive a zero for the assignment, fail the course, and/or be subject to University sanctions (see UO Academic Dishonesty Policy). Using Google to find similar solutions is cheating. Talking to your friend for hints is borderline. Reading someone else's solution is cheating. Using Google to learn how to read from STDIN in C++ is background reading. Err on the side of full disclosure - if you talked with someone about how to solve the problem, or found an irresistable hint online, a little comment noting that fact and giving credit where it is due is the right thing to do.