Computer Systems

Computer Systems - are not possible. 4. Use the Beej's...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSCE 313 Introduction to Computer Systems Spring 2011 Homework 4 (25 points) Chapters 15, 18, 20 (up thru 20.4 in addition to section 20.8) and the Transport Layer and Security reading assignments are the focus of this homework assignment. It requires the course textbook, lecture slides Internet access. 1. On p. 535 of the textbook, the prototype is given for the msgget() function. Explain how a call to msgget() could cause errno to be set to EEXIST (i.e. write an English sentence describing the condition under which EEXIST will occur). What is different about the conditions to cause errno to be set to ENOENT. 2. On slide 40 of Lecture 14 – Sockets, explain why PTHREAD_CREATE_DETACHED is set in the thread attributes? 3. Read Exercise 20.11 on p. 707 of the textbook. Create three realizable sequences NOT given in the textbook and give short explanations of why they are possible. Create two unrealizable sequences NOT given in the textbook and give short explanations why they
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: are not possible. 4. Use the Beej's Guide to Network Programming (mentioned in class) to explain how the shutdown command works for clients to terminate a connection. How does it differ from close? Illustrate the difference based on a scenario. 5. Suppose N people want to communicate with each of N -1 other people using symmetric key encryption. All communication between any two people, i and j, is visible to all other people in this group of N, and no other person in this group should be able to decode their communication. How many keys are required in the system as a whole? Now suppose that public key encryption is used. How many keys are required in this case? 6. Using the RSA public key encryption algorithm discussed in class, choose p = 3 and q = 11 to encrypt the word hello. Apply the decryption algorithm to recover the original plaintext message....
View Full Document

This note was uploaded on 02/14/2012 for the course CSCE 313 taught by Professor Gu during the Spring '11 term at Texas A&M.

Ask a homework question - tutors are online