CSci 2101: Data Structures - Syllabus.

[Home] [Syllabus] [Assignments] [Resources]

Syllabus

The syllabus will be updated throughout the semester. Dates, topics, assigned reading, and problem set due dates will be added or might change. All changes in assigned reading and due dates will be announced in class (and occasionally by e-mail). While I will do my best to update the web site accordingly, it is a student's responsibility to keep track of the problem set due dates and reading assignments. If you are not sure about due dates, please don't hesitate to ask.

Reading assignments are listed for the day when the material is first explained in class. You may read the material ahead of the lecture or after, either way is fine.

The midterms, the final, and quizzes are open book, open notes.
However, you are not allowed to use any materials from previous offerings of the course at any point in this class (in class or on your own).

The dates for the midterm exams and the final are set and will not change. If you have a conflict with these dates, please let me know right away. No makeup exams will be given unless there are circumstances beyond your control AND the makeup time is arranged in advance.

In addition to exams there will be 7-10 short in-class quizzes throughout the semester. Quizzes will not be announced in advance. The lowest quiz grade will be dropped (i.e. not counted towards the quiz total). A missed quiz will receive a grade of zero and thus will be counted as the lowest grade, unless it was missed due to an illness or other circumstances beyond your control. If you missed a quiz or a lab because of an illness or similar circumstances, it is your responsibility to communicate these reasons to me as soon as possible and arrange for a make-up work.

Policies on Collaboration and Use of Resources

Problem sets and labs are individual work, unless stated otherwise. While it's perfectly OK (and is encouraged) to discuss problem sets in general terms with others in the class, your solution must be your own work (i.e. written or coded by you without using anybody else's materials). Copying any part of another person's solution (even if you modify the code) is considered academic dishonesty and will be dealt with according to the university's policy.

You may use electronic resources for problem sets to get general ideas for your solutions as well as to help in fixing errors. However, you may not copy a code fragment found online into your solution. Use of sources other than the textbook and the handouts given in class must be acknowledged in the beginning of the problem solution. For take home tests please follow the instructions on the test to determine appropriate resources. Use of any materials from previous runs of this class is not allowed.

If in doubt whether a resource is appropriate for a given problem set, please ask.

Late problem sets policy: Problem sets are due in the beginning of the class on the due date, unless a different time is specified for an electronic submission. If a problem set is submitted at (or before) the next class meeting after the due date, it is graded out of 3/4 credit. If it is submitted any time after the next meeting (until the last class meeting), then it is graded out of 1/2 credit.
Problem sets submitted more than 5 minutes after beginning of the class may be considered late.

Groups for labs and problem sets

Hand in one assignment from the entire group with names of both students on the first page. If submitting by e-mail, you must CC it to all your partner(s). In a programming assignments make sure to keep track (in comments or in some other electronic form) of each partner's contribution to the work.

Generally all group members get the same grade for the submitted group work. If you feel that your group members are not contributing the way they should or if there are any circumstances that prevent you or you partner from contributing a fair share, please talk to your partners to work out an arrangement (if possible) and in either case let me know right away. If after the assignment is finished you feel that the group members have contributed unevenly, please talk to me and I'll try to come up with a fair grading strategy.

Discussion with students other than those in your group (or anyone not in this class) should be limited to general approaches to the problem. All such discussions as well as use of sources other than the textbook and the handouts given in class must be acknowledged in the beginning of the problem solution.

Studying in groups

Studying in groups is strongly encouraged. You may study for tests, go over textbook materials or lecture notes, and discuss problem sets in general terms (i.e. without actually writing the program code or giving out the answers).

Use of electronic devices

Use of laptops for class-related activities is usually allowed, except for test time and other specific assignments. Laptops and other devices cannot be used for activities unrelated to the class work (checking e-mail, instant , etc.). The instructor reserves a right to ask a student to leave the class if the student uses electronic devices inappropriate in a class. No communication devices can be used during a test, including quizzes. If you are taking notes on your laptop, you are not allowed to access anything other than your notes during a test.

Course topics and timeline

Week 1 (1st half): May 24 - 26.
Monday Monday Lab Tuesday Wednesday
Overview of data structures. Intro to Java: history and relation to other languages, compilation/excution model, memory model. Data types, variables.
Reading: see the resources page.
Problem set 1: Java variables, conditionals and loops. Due Thurs. May 27.
Compiling and running Java programs. Experimenting with Java variables. Java conditionals. Introduction to Java objects. Java strings. Random numbers.
Reading: 1.2, 1.3, 1.5 (in this order).
Java loops. Java Scanner class. Writing methods in Java.
Reading: Ch. 1.4, 1.7.
Problem set 2: Java objects, recursion. Due Friday, May 28th.
Week 1 (2nd half): May 26 - 28.
Wednesday Lab Thursday Thursday Lab Friday
Java conditionals and loops. Stack as a data structure. Java stack class. Reading: Ch. 1.1.
Problem set 1 due.
Stack. Java arrays. Recursion in Java. ArrayList class.
Reading: Ch. 3.1.
Problem set 2 due.
Problem set 3: Java arrays, objects. Due Tue, June 1st.
Week 2 (1st half): May 31 - June 2.
Monday Monday Lab Tuesday Wednesday
Memorial day - no classes. Memorial day - no classes. Writing your own Java classes.
Reading: Ch. 2 (questions will be posted), Ch. 4.
Problem set 3 due.
Review for the midterm.
Week 2 (2nd half): June 2 - 4.
Wednesday Lab Thursday Thursday Lab Friday
Writing your own Java classes (cont.).
Midterm I.
Take home portion of the midterm due Fri, June 4th.
Writing your own Java classes (cont.). Problem set 4: writing your own classes. Due Mon., June 7th. Discussion of Ch. 2.
Linked lists.
Reading: Ch. 5.1, 5.2.
Take home exam due.
Week 3 (1st half): June 7 - 9.
Monday Monday Lab Tuesday Wednesday
Java exceptions. Java interfaces.
Reading: Ch. 1.6, 4.3.
Problem set 4 due.
Problem set 5: Linked lists. Due Wedn., June 9th.
Linked list implementation. Introduction to Eclipse. More on Java generic types, iterators, type hierarchy.
Reading: Ch. 5.4, 5.5.
Queue, priority queue, binary heap.
Reading: Ch. 7 (review of stacks), Ch. 8 (queues), 12.2 (priority queues and heaps).
Problem set 5 due.
Problem set 6: queues, heaps. Due Fri., June 11th.
Week 3 (2nd half): June 9 - 11.
Wednesday Lab Thursday Thursday Lab Friday
Queue, priority queue, binary heap implementation. More on Java type system, queues, heaps.
Reading: Ch. 9.
More on Java type system, queues, heaps. Introduction to sorting.
Reading: Ch. 10.
Problem set 6 due.
Week 4 (1st half): June 14 - 16.
Monday Monday Lab Tuesday Wednesday
Review for Midterm II. Sorting. Introduction to JUnit. Problem set 7: sorting. Due Mon., June 21st. Midterm II.
Sorting (cont).
Take home portion is due Thurs., June 17th.
Sorting (cont). Possible: introduction to ruby.
Week 4 (2nd half): June 16 - 18.
Wednesday Lab Thursday Thursday Lab Friday
Sorting (cont). Trees, Binary Search Trees.
Reading: Ch. 11.
Take home II due.
Trees, Binary Search Trees. Balanced Trees.
Reading: Ch. 13.1. Problem set 8: trees. Due Wedn., June 23rd.
Week 5 (1st half): June 21 - 23.
Monday Monday Lab Tuesday Wednesday
Hash tables, hashing.
Reading: Ch. 12, 13.2.
Problem set 7 due.
Hash tables, hashing. Graphs, graph traversals, minimum spanning trees.
Reading: Ch. 14.
Problem set 9: hash tables, graphs. Due Thurs., June 24th.
Java GUI. Java Swing library.
Reading: see resources page.
Problem set 8 due.
Week 5 (2nd half): June 23- 25.
Wednesday Lab Thursday Thursday Lab Friday
Java GUI. Wrap up and review for the Final.
Problem set 9 due.
Wrap-up lab, code review, and discussion. Final exam.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.