UT CS 361 - CS 361 Midterm Sample Questions (8 pages)

Previewing pages 1, 2, 3 of 8 page document View the full content.
View Full Document

CS 361 Midterm Sample Questions



Previewing pages 1, 2, 3 of actual document.

View the full content.
View Full Document
View Full Document

CS 361 Midterm Sample Questions

214 views

Exam


Pages:
8
School:
University of Texas at Austin
Course:
Cs 361 - Introduction to Computer Security
Introduction to Computer Security Documents

Unformatted text preview:

CS 361 Midterm Sample Questions Instructor Dr Bill Young Name Read all questions carefully Answer all questions in the space provided You may use scratch paper to do your work but only answers recorded on the test paper will be graded Be as concise as possible Note the questions on this sample are all questions asked on past midterms but this sample is longer than an hour test CS361 Midterm Sample 1 1 10 points Suppose you have a secure system with three subjects and three objects with levels as listed below Type Object Object Object Subject Subject Subject Name Obj1 Obj2 Obj3 Subj1 Subj2 Subj3 Level H A B L B L A B L A B H L A B C Here H dominates L You wish to implement a Bell and LaPadula model of security for this system Fill in the access rights R and or W permitted by the model for each subject object pair in the access matrix below Obj1 Obj2 Obj3 Subj1 Subj2 Subj3 2 10 points Assume you have a six sided die that is lopsided in such a way that it rolls each of 1 2 or 3 twice as often as each of 4 5 or 6 You wish to send the results of a series of rolls over a transmission channel Compute the entropy of this language Please write down the appropriate sum you don t have to compute a numeric answer You might also be asked to show an encoding that is better than the naive encoding and prove that it is better CS361 Midterm Sample 2 3 10 points Imagine a Bell and LaPadula like secure system with the following five operations READ s o if the subject and object exist and L s L o the subject obtains the current value of the object otherwise do nothing WRITE s o v if the subject and object exist and L s L o the object gets value v otherwise do nothing CREATE s o add a new object with the given name a level equal to the subject s level and an initial value of 0 If an object of that name exists do nothing DESTROY s o eliminate the designated object from the state assuming that the object exists and the subject has WRITE access to it Otherwise do nothing RUN s the named



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view CS 361 Midterm Sample Questions and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view CS 361 Midterm Sample Questions and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?