CS 3345.004: Data structures and algorithm analysis (Fall 2018)

Course Syllabus   Class log   eLearning

Announcements

12/13:	Test inputs for Project 5: msttest.zip

12/2:	Error fixed in output of last data file for Project 5: mst-data.zip
	Correct output is 84950, not 89450.

11/28:	p4-details.zip (detailed outputs for sample inputs to Project 4).

11/21:	Sample inputs for Project 5: mst-data.zip

11/20:	P4Driver.java (driver program for Project 4),
	p4-data.zip (sample inputs for P4Driver).

11/14:	Assignment 11 (due 11/28).

11/14:	Test inputs for Project 3: p3-t1-5.zip,  p3-t6.zip.

11/14:	Project 5 (due 12/12).

11/07:	Project 4 (due 12/2).

11/07:	Errors corrected in Merge sort code, page 3 of lecture notes for Class 20.

11/05:	Topics for Quiz 2 on Wed, Nov 14 is given below.  Format is closed book/notes.
	Skip lists (implementation),
	Applications of BST (TreeSet/TreeMap),
	Applications of hashing (HashSet/HashMap),
	Priority queues (implementation and applications).

10/31:	Assignment 10 (due 11/07).

10/30:	p3-big.zip (two big inputs for Project 3).

10/28:	Sample inputs to P3Driver (Project 3).

10/24:	Assignment 9 (due 10/31).

10/22:	Project 3 (due 11/11).

10/17:	Assignment 8 (due 10/24).

10/15:	Mid-term exam scores will be entered on elearning by noon on Mon, Oct 15.
	Special office hours for viewing exams: 12:30-2:00 PM, on Mon 10/15, and Tue 10/16.
	Exams can also be viewed after Tuesday, during office hours.

10/12:	Test inputs for Project 1

10/11:	Sample inputs for SkipListDriver (Project 2)

10/03:	Programming project 2 (due 10/21).

10/03:	Topics for mid-term exam on 10/10: all topics discussed in class
	up to and including AVL trees (lectures 1-13).
	RT analysis, Order notation, Recurrences, Application of the Master method, Proof by induction,
	Lists, stacks, queues: implementation and applications,
	Binary trees, Binary search trees: implementation and applications,
	AVL trees: definition, tree rotations.
	Format is similar to Quiz 1.

	You may bring 1 page of 8.5"x11" of hand-written notes (one side only)
	written in 8-point size of bigger.  If I can't read it, you can't use it!
	No printed or photocopied cheat sheets allowed.
	I will be at the class room by 8:10 AM on 10/10.  Come early if you
	want an early start.  Exam ends at 9:48 AM.

10/03:	Assignment 7 (due 10/10).

09/26:	Assignment 6 (due 10/3).

09/24:	Problems on trees

09/24:	Minimum level of documentation in your code (programming projects):
	1. Full name and netid of author, purpose of class
	2. Purpose of each field that stores something important (not local variables, but fields of the class)
	3. Purpose of each method, its parameters, preconditions, return values, post-conditions
	4. Loop invariants of loops whose purpose is not self-evident
	5. Usage: I/O specifications, if class has a main() method
	Try to follow Javadoc: https://en.wikipedia.org/wiki/Javadoc format

09/19:	Assignment 5 (due 9/26).

09/12:	Assignment 4 (due 9/19).

	Programming project 1 (due 9/30).

09/05:	Assignment 3 (due 9/12).

08/31:	Teaching assistant: Xiaodi Li, xxl170011@utdallas.edu
	TA Office: ECSS 2.103B1.  Office hours: Mon/Wed 4:30-5:30 PM.

08/29:	Problems on lists

08/29:	Assignment 2 (due 9/5).

08/22:	Assignment 1 (due 8/29).

08/20:	Syllabus (pdf)

08/14:	If you are using github to host your projects, set it up as private.
	Students can get free licenses from github for hosting private repositories:
	https://education.github.com/pack