TWiki> CS202 Web>WebHome (revision 16)EditAttach

CS202 - Data Structures and Discrete Mathematics II

CS 202: Fall 2010

MonWedFri 11:00-11:50am
238 SES

Instructor:

Prof. Tanya Berger-Wolf

Office Hours: MonFri 12:00--1:00 SEO 1136

TA:

Chi Su

Office Hours: Tue 1:00--3:00 SEO 1310

Announcements

Sept 12:

  1. Tokens are NOT case sensitive (output everything in lower case)
  2. In lexicographic order (the one in which you need to sort the tokens) numbers come before letters
  3. Tokens are made up of letters and numbers. Anything which is not a letter or a number is a separator between tokens
  4. You CANNOT use StringTokenizer class, you have to write your own method for reading in the file and breaking it up into tokens.
  5. You CANNOT use any off-the-shelf sorting classes or methods. You MUST write a sorting method (part of SortedCollection) which uses only FindMin or FindMax. (Don't worry about efficiency)
  6. You CAN use very basic Java classes (Array, String, IO) but only with the very basic functionality like opening a file, reading characters, checking what a character is, creating an array, storing values in an array.
  7. Your SortedCollection class should be generic and be able to store strings or numbers or anything which can be compared.
  8. FindMin (FindMax) finds the smallest (largest) in terms of value element in the collection. If the elements are in the sorted ascending order, that element will be the first (last) element.
  9. You can use any code from the textbook (Weiss).

Sept 9: Program assignment 1 is posted on Blackboard under Assignments. Due September 23.

Sept 8: Solutions to HW1 are posted under Assignments on Blackboard

Sept 3: Correction for the last class example problem. Number of distinct solutions to the equation x1 + x2 + x3 = 11 where x1, x2, and x3 are NON-NEGATIVE (not POSITIVE as it was stated in class) integers. The posted lecture notes contain solutions for both versios of the problem.

Aug 29: Clarifications and changes for Homework 1. Question 4(a) clarification: assume that the players are indistinguishable. Question 6(b)ii has changed: the person now has only 2 pairs of friends who hate each other. The hating is constrained WITHIN a pair, that is, of the two pairs, each person just hates the other person in the pair. The new version of the homework has been posted.

Aug 25: Homework 1 is out. Due September 8 BEFORE class.

Aug 23: Required texbooks for the course have been changed. The textbooks are:
(SAME AS BEFORE) Discrete Mathematics With Applications (3rd ed.) by S. Epp
(CHANGE) Data Structures and Problem Solving Using Java (3rd ed.) by M. Weiss

Edit | Attach | Print version | History: r98 | r18 < r17 < r16 < r15 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r16 - 2010-09-13 - 01:55:37 - Main.tanyabw
 
Copyright 2016 The Board of Trustees
of the University of Illinois.webmaster@cs.uic.edu
WISEST
Helping Women Faculty Advance
Funded by NSF