This web page may change frequently as the semester proceeds
New Information is placed here first, in reverse chronological order. See also Generally Useful Information and Resources for more information.
- Final Exam - Friday Dec 13th, 1:00 - 3:00 P.M., LC E1
- Covers entire semester, with emphasis on new material.. Rules & format same as midterm I.
- HW4 Adjustments:
- -exec and -ok are optional enhancements, as is providing units for numeric arguments ( k, b, etc. ), and the tree option for -largest and -smallest.
- As discussed in class, the -largest and -smallest expressions should remember the largest and smallest file/dir that they examine, but return true. Then after the search is completed, the largest or smallest found should be reported.
- It is okay for results to be undetermined if any of the expressions -largest, -smallest, or -summarize appear more than once in a single search.
- -depth should be interpreted on a directory scale, not a tree scale.
- ( If -depth is present, then process all of the subdirectories of a directory before the files in the directory itself. Otherwise do the opposite. )
- All of the expressions that take a single numeric argument ( e.g. -size, -atime, -uid, -links, etc. ) are effectively equivalent, so once you have shown that you can implement one of these, then you are better off spending your time implementing different types of expressions. ( Numeric arguments should support the + or - prefix for greater than or less than. )
- For -access, the type can be given as either ( r, w, x, or a ) or ( read, write, execute, or any ), with the first option preferred.
- For -largest and -smallest, the type can be given as either ( f, d, or t ) or ( file, dir, or tree ), with the first preferred.
- If you don't have time to finish all expressions, the order of priority should be -print, -size, -not, -or, and the custom expressions not found in normal find ( e.g. summarize ).
- Some optional enhancements that would be particularly useful inlcude -newer ( -older? ) and -name, particularly if the latter supported wild cards in the file naming. ( Which must be escaped to avoid shell interpretation. )
- The ability to traverse ( recursively ) the directory structure and make use of the results of stat or lstat is NOT optional, as it is the key part of this assignment.
- Because good user input is hard enough to parse, you do not need to exhaustively check for all possible bad user input. You should still do some when it is easy though.
- MIDTERM EXAM Thursday October 17, 6:00 to 8:00 P.M., Lecture Center F6
- The late penalty for HW2 has been reduced to 10%. However the deadline has not been changed - The on-time deadline is still 3:00 P.M. Tuesday Oct 15th, and the late deadline 3:00 P.M. Wednesday Oct 16th.
- Advanced Programming Seminars - Wednesdays at 12:00 in 1000 SEO, inlcudes Pizza
- 2 Oct - Xu Zhang, "Everything you always wanted to know about operating system kernels but were too smart/afraid to ask"
- Abstract: Ever wondered how an OS kernel works yet somehow got more confused after reading an OS book because of lack of implementation details? Don't worry, you are not alone. I will share my 2 cents by answering compiled questions I had when working in the Ethos kernel. Ethos is a research operating system targets at security. It is implemented on top of the Xen hypervisor, so the hardware is abstracted away, which makes a good subject for the purpose of this talk.
- HW2 has now been posted.
- The LATE deadline for HW1 is extended to 3:00 P.M. Sunday, with a 10% late penalty instead of 20%.
- A Piazza Account has been set up for CS 385
- CS 491 has been scheduled for Fridays from 3:00 to 3:50 in BH 209, the same room as CS 385
- Friday sessions will focus on systems programming, ofen related to class programming assignments, and will be open to all CS 385 students.