Computer Science 162 - Fall 1991 - Smith - Final Exam

Computer Science 162 - Fall 1991 - Smith - Final Exam - CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 162, Final, Fall 1991, Online Exam CS 162, Fall 1991 Final Professor A. Smith The exam is closed book. Any question for which you give no answer at all will receive 20% partial credit. Problem #1 One thing that adds security to the Unix password system is "salt." Salt consists of two randomly generated characters, different for each user, which are stored in the /etc/passwd file for each file. The Salt is used to determine which of 4096 variations of the password encryption algorithm are used to encrypt a given password. What is the advantage of using "salt?". Explain. (15) Problem #2 Explain what an "intentions list" is, and how and why it is used. (15) Problem #3 When you log into Unix, it tells you when youlast logged on. Why? (10) Problem #4 Define and explain what a stack algorithm is. Why is it good? If two algorithms are compared and one is not a stack algorithm and the other is, will one always give better (fewer page faults) results? Why and why not? (17) Problem #5 Explain the purpose of a token in a ring network Why is there only one token? (13)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 3

Computer Science 162 - Fall 1991 - Smith - Final Exam - CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online