CS3310 Data and File Structures (Fall 2017)
- James Yang (B242), firstname.lastname@example.org
- Class Schedule: T/TH 10:00-11:15@D0201
- Office Hours: T 11:15-12:15, TH 14:30-15:30 or by appointment
- Useful Links
- Homeworks and how to submit your homework.
- Required Reading Source
- EReserve material (through WMU Waldo Library )–including:
- chapters from “File Structures . . .” [Folk, Zoellick & Riccardi]
- Trees & Graphs chapters from “Data Structures . . .” [Pothering
& Naps; Rowe]
- BTrees chapter from “File Structures . . .” [Miller]
- Canvas - interactive DSA learning material and
- enroll in our course (instructor
will either give you a code or you will get an email to enroll)
09/05/2017 & 09/07/2017
- During the first week, Prof. Yang is attending a conference
in Germany. Prof. Gupta, the instructor of the other 3310 section, will
give combined lecture s at the same time (10-11:15, TR) at our
- The NIST link http://www.nist.gov/dads/ has the definition of most of the common problems. Please browse.
- Coding conventions, see useful links as well. Not covered in class but you are supposed to read and ask any questions you may have.
- review your discrete math and basic algebra and math material (wiki pages are linked to the topics) -- functions, series sums (arithmatic series, geometric series, harmonic series, square numbers, cubic numbers, integer sequences [general familiarity], factorial, etc.), induction, growth / decay of functions, limits
- OpenDSA: Open Source Interactive Data Structures and Algorithms is a good reference material for many of the concepts and examples discussed in class.