|
Interesting Information: |
Class Syllabus Handouts: Various papers and course materials. Notes: Burkhard, W. A. Storage Systems(notes) Soft Reserves, campus References: Weiss, M. A. Data Structures and Algorithms Analysis in C Course Structure: This is both a lecture and a laboratory course. There will be section meetings held at regularly scheduled times. Additional material will be presented at the section meetings as well as discussion of lecture material and assignments. The formal prerequisite for CSE102 is CS100 or equivalent. Please discuss your situation with me if you do not meet these requirements. Course grade and information: The course grade will be based upon programming projects and writen exercises (40%), a midterm examination (25%), and the final examination (35%). Students must take the final examination at the scheduled time to complete the course. Student who elect "P/NP" grading will be given a letter grade for their own information, but the letter grade will not be reported to the registrar. Marks and other course information will be placed in the course bulletin board placed in cse102w/public on ieng9. Marks will be posted by student number only. If you do not wish to have your marks so posted, please let us know in writing immediately. Incomplete grades will be given only for extraordinary medical or personal emergencies that cause you to miss the final examination and only if your work, up to that point, is satisfactory. Computer use: You may use any Academic Computer Services facility to complete the storage systems exercises using the C++ programming language. Questions regarding course accounts should be directed to the TA. Homework assignments will be graded on the Academic Computing Services ieng9 system. You will be held responsible for the consequences of your activities on these computing facilities.
|
Last updated on January 22, 1997 by Kamlesh Talreja