COT 3530: Data Structures -- Spring 02
Course Homepage
Office: ECS 389; Phone: (305) 348-3748;
Office Hours: Monday 3-4 PM, Thursday 3-4 PM, or by appointment
e-mail: giri@cs.fiu.edu
Final Exam: Tuesday April 23, 6:25-9:0 PM
ANNOUNCEMENTS
- Apr 15: Homework #5 after some minor corrections
is now available (see below). Some exception files have been
added; your program will need these. The data file
CityPairs.dat is also now available for
download. Note that you should use a LENGTH_THRESHOLD of
200 instead of 150.
- Apr 10: Homework #5 is now available (see below).
- Apr 9 On popular demand, the deadline for assignment #4
is extended by 1 day. It is now due in my office by 6PM,
April 10.
- Apr 7: People have had lots of good questions on this
assignment. I have answered most of them on the FAQ webpage.
- Apr 2: The code for HashSet and HashMap can be
downloaded from here (see below).
- Mar 30: Homework #4 is now available (see below).
- Feb 22: You can find Dr. Weiss' multiple choice
questions by clicking
here.
- Feb 20: Homework #3 is now available (see below).
- Feb 10: Evaluation Scheme for the course: 50% for
programing assignments and 50% for the two exams.
- Feb 10: The 1st Midterm exam is scheduled for
Tuesday, Feb 26.
- Feb 6: Here you will find answers to select "Frequently Asked
Questions" (FAQs) about your assignments: FAQs.
- Jan 17: Your text is advertised for $56.70 plus S&H (Wow!) from
Click here. The regular price is $81.00. Why would you want to buy
from your favorite book store?
PROGRAMMING ASIGNMENTS
USEFUL LINKS
SELECT LECTURE TRANSPARENCIES
TEXTS
STANDARD TEXT: "Data Structures & Problem Solving using JAVA", by Weiss
[ISBN 0-201-74835-5]
Other decent texts
- Java, by Eckel
- Data Abstraction and Problem Solving with Java, by Carrano &
Prichard
- Data Structures, Algorithms, and Applications in Java, by Sahni.
- Big Java, by Cay Horstmann
PREREQUISITE KNOWLEDGE EXPECTED
- Chapter 1, 2, 3, 4, 7.1-7.3
- Appendices A, B, C.
SYLLABUS
- Arrays, Stacks, Lists, Queues
- Sorting and Searching
- Trees, Binary Search Trees
- Hashing
- Graphs & Graph Algorithms
OLD ANNOUNCEMENTS
- Feb 17: See details of solution for TenPts.dat at:
FAQ.
- Feb 14: Tour Lengths for the 2 data files of Program
#2: 3.242394736577974 and 9.03540929807123
- Feb 10: A corrected version of Homework #2 is now
available, with updated instructions on what to do with the data
files and the set of files for visualizing the tour. The data files
are also available (two of them). Also available are a set of four
files that you can use to visualize the tour. Also, there are answers
to more "Frequently Asked Questions" (FAQs) about assignment #2. See:
FAQs.
- Jan 29: See some wonderful animations of your standard
data structures by
clicking here.
- Jan 18: Homework #1 needed another minor fix involving
the word static in findMax. The "Corrected (Jan 18)" version can be found below.
- Jan 17: Homework #1 needed a minor fix involving getCard and
getDeck. The "Corrected" version can be found below.
- Jan 17: See below under "Useful Links" for a link to the
page that can help you with Javadoc. This page comes to us courtesy of
Prof. Kip Irvine.
- Jan 17: Your text is advertised for $56.70 plus S&H (Wow!) from
Click here. The regular price is $81.00. Why would you want to buy
from your favorite book store?
- Jan 16: Homework #1 is now ready. See below.
