This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: a , ( a , a ) ) (2 points) 3. Translate the following bit pattern into a numeric (dotted quad) IP address. Use your Web browser to ±nd out where this address leads. What Web site does this address correspond to? (2 points) 11011000 00110100 10111010 01111000 4. Assume that a computer ʼ s memory is broken up into the following partitions (in the order given), and that we have the following list of programs to be loaded: 100K Process Name Memory Needed P1 150K P2 400K 500K P3 75K P4 350K 200K 600K BrieFy describe how the ±irst-±it, Best-±it, and Worst-±it algorithms would load these programs into memory. (2 pts each)...
View Full Document
This note was uploaded on 12/06/2011 for the course CSE 110 taught by Professor Shaunakpawagi during the Fall '08 term at SUNY Stony Brook.
- Fall '08