8 Pages

Week10-Sockets-4

Course: CSC 209, Fall 2009
School: University of Toronto
Rating:
 
 
 
 
 

Word Count: 1225

Document Preview

Web Simple Request 5LFKDUGV+RPH3DJH Communication Sockets (Haviland Ch. 10) &RXUVHV 5HVHDUFK 1 2 How do we find the server? Every computer on the Internet has an Internet address. Called an IP address (Internet Protocol) An IP address is four 8-bit numbers separated by dots. www.eecg.toronto.edu = 128.100.10.235 3 ZZZHHFJ XWRURQWRFD" Domain Name Servers EURZVHU ZZZHHFJ...

Register Now

Unformatted Document Excerpt

Coursehero >> Canada >> University of Toronto >> CSC 209

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Web Simple Request 5LFKDUGV+RPH3DJH Communication Sockets (Haviland Ch. 10) &RXUVHV 5HVHDUFK 1 2 How do we find the server? Every computer on the Internet has an Internet address. Called an IP address (Internet Protocol) An IP address is four 8-bit numbers separated by dots. www.eecg.toronto.edu = 128.100.10.235 3 ZZZHHFJ XWRURQWRFD" Domain Name Servers EURZVHU ZZZHHFJ XWRURQWRFD" ORFDO QDPHVHUYHU ZZZHHFJ XWRURQWRFD" HHFJ QDPHVHUYHU URRW QDPHVHUYHU FD VHUYHU XWRURQWR FD QDPHVHUYHU VHUYHU XWRURQWR QDPHVHUYHU ZZZHHFJ XWRURQWRFD" HHFJ ZZZHHFJ VHUYHU XWRURQWRFD" 4 This is getting complicated! ,QYRLFH &XVWRPHU-RKQ'RH 2UGHU1R 4W\8QLW3ULFH7RWDO Protocols -RKQ'RH)HE 3D\DEOHWR&386DUHXV )LYHKXQGUHGQLQHW\VL[ BBBBBBBBBBBB $WKDORQ 0% 6XEWRWDO 7D[ 727$/ -RKQ'RH EURZVHU VHUYHU HHFJ ORFDO QDPHVHUYHU QDPHVHUYHU 1XPEHURI PHVVDJHV" 5 &386DUHXV &386DUHXV &ROOHJH6WUHHW -RKQ'RH 'HSWRI&RPSXWHU6FLHQFH 8QLYHUVLW\RI7RURQWR 7RURQWR2QWDULR06* XWRURQWR QDPHVHUYHU URRW QDPHVHUYHU FD QDPHVHUYHU We deliver! Courier 6 TCP/IP Transmission Control Protocol. Tells us how to package up the data. VRXUFHDGGUHVV E\WHV DFN GHVWDGGUHVV SRUW TCP Connection +L &RQQHFWLRQSRUW" +L /HWVWDON RND\ ZD\ KDQGVKDNH 6<1 6HQGPHDILOH +HUHVVRPHGDWD *RWLW DFN +HUHVVRPHPRUH *RWLW DFN ,PGRQH ,PGRQHWRR ILQ ILQ GDWD 7 8 Routing GLVWRURQWR IHEHOOQH[[LDQHW RQHWJZGLVWRURQWR EHOOQH[[LDQHW +6(7RURQWR SSSV\PSDWLFRFD GLVWRURQWR SRVEHOOQH[[LDQHW XWRUJZERUGHULI RQHWRQFD Putting it together GLVWRURQWR IHEHOOQH[[LDQHW RQHWJZGLVWRURQWR EHOOQH[[LDQHW EURZVHU +6(7RURQWR SSSV\PSDWLFRFD GLVWRURQWR SRVEHOOQH[[LDQHW XWRUJZERUGHULI RQHWRQFD VIEEXSJZ HHFJ ORFDO QDPHVHUYHU XWRURQWRFD EURZVHU VIEEXSJZ XWRURQWRFD QDPHVHUYHU XWRURQWR URRW QDPHVHUYHU VHUYHU VHUYHU QDPHVHUYHU FD QDPHVHUYHU 9 10 How many messages? It depends on the size of the web page we retrieve. If the web page is 75 Kbytes (small!) it will be broken up into 103 IP packets. Remember DNS took 10 messages [KRSV PHVVDJHV 11 The Big Picture network Client Process Server Process Client-Server model: a client process wants to talk to a server process Client must find server - DNS lookup Client must find process on server - ports Finally establish a connection so two processes can talk 12 Sockets One form of communication between processes. Similar to pipes, except sockets can be used between processes on different machines. Use file descriptors to refer to sockets. Built on top of TCP layer 13 TCP: Three-way handshake sequence number = J client server sequence number = K socket connect (blocks) connect returns SYN J socket,bind,listen accept(blocks) SYN K, ack J+1 ack K+1 accept returns 14 TCP Server socket() TCP Client socket() Connection-Oriented Server Create a socket: socket() Assign a name to a socket: bind() Establish a queue for connections: listen() Get a connection from the queue: accept() bind() listen() accept() block until connection from client data transfer Connection establishment (3-way handshake) connect() write() read() write() read() close() end-of-file notification Client close() 15 Create a socket: socket() Initiate a connection: connect() 16 try nslookup Socket Types Two main categories of sockets UNIX domain: both processes on the same machine INET domain: processes on different machines Addresses and Ports A socket pair is the two endpoints of the connection. An endpoint is identified by an IP address and a port. IPv4 addresses are 4 8-bit numbers: 128.100.31.200 = werewolf 128.100.31.201 = seawolf 128.100.31.202 = skywolf Three main types of sockets: SOCK_STREAM: the one we will use SOCK_DGRAM: for connectionless sockets SOCK_RAW Ports 17 because multiple processes can communicate with a single machine we need another identifier. 18 More on Ports Well-known ports: 0-1023 80 = web 22 = ssh 23 = telnet 2709 = supermon 26000 = quake www.iana.org TCP Server socket() TCP Client socket() bind() listen() accept() block until connection from client data transfer 21 = ftp 25 = smtp (mail) 194 = irc Connection establishment (3-way handshake) connect() Registered ports: 1024-49151 read() write() write() Dynamic (private) ports: 49152-65535 You should pick ports this in range to avoid overlap 19 read() close() end-of-file notification close() 20 Server side int socket(int family, int type, int protocol); family specifies protocol family: PF_INET IPv4 PF_LOCAL Unix domain bind to a name int bind(int sockfd, const struct sockaddr *servaddr, socklen_t addrlen); sockfd returned by socket struct sockaddr_in { short sin_family; /*AF_INET */ u_short sin_port; struct in_addr sin_addr; char sin_zero[8]; /*filling*/ }; sin_addr can be set to INADDR_ANY to communicate with any host 21 22 type SOCK_STREAM, SOCK_DGRAM, SOCK_RAW protocol set to 0 except for RAW sockets returns a socket descriptor Set up queue in kernel int listen(int sockfd, int backlog) after calling listen, a socket is ready to accept connections prepares a queue in the kernel where partially completed connections wait to be accepted. backlog is the maximum number of partially completed connections that the kernel should queue. Complete the connection int accept(int sockfd, struct sockaddr *cliaddr, socklen_t *addrlen); blocks waiting for a connection (from the queue) returns a new descriptor which refers to the TCP connection with the client sockfd is the listening socket cliaddr is the address of the client reads and writes on the connection will use the socket returned by accept 23 24 Client side socket() same as server, to say how we are going to talk int connect(int sockfd, const struct sockaddr *servaddr, socklen_t addrlen); the kernel will choose a dynamic port and source IP address. returns 0 on success and -1 on failure setting errno. initiates the three-way handshake. 25 inetclient.c int soc; struct hostent *hp; struct sockaddr_in peer; most error checking is omitted in this example peer.sin_family = AF_INET; peer.sin_port = htons(PORT); /* fill in peer address */ hp = gethostbyname(argv[1]); peer.sin_addr = *((struct in_addr *)hp->h_addr); /* create socket */ soc = socket(PF_INET, SOCK_STREAM, 0); /* request connection to server */ if (connect(soc, (struct sockaddr *)&peer, sizeof(peer)) == -1) { perror("client:connect"); close(soc); exit(1); } write(soc, "Hello Internet\n", 16); read(soc, buf, sizeof(buf)); printf("SERVER SAID: %s\n", buf); close(soc); 26 inetserver.c struct sockaddr_in peer; struct sockaddr_in self; int soc, ns, k; int peer_len = sizeof(peer); self.sin_family = AF_INET; self.sin_port = htons(PORT); self.sin_addr.s_addr = INADDR_ANY; bzero(&(self.sin_zero), 8); peer.sin_family = AF_INET; /* set up listening socket soc */ soc = socket(PF_INET, SOCK_...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

University of Toronto - CSC - 209
SignalsSignalsHaviland Ch. 6 Unexpected/unpredictable asynchronous events floating point error death of a child interval timer expired (alarm clock) control-C (termination request) control-Z (suspend request)1 Events are called interrupts When the k
University of Toronto - CSC - 209
Exchanging data between processesInter-process CommunicationPipes (Haviland Ch. 7) After fork() is called we end up with two independent processes. We cannot use variables to communicate between processes since they each have separate address spaces, a
University of Toronto - CSC - 209
Compilers, Interpreters, LibrariesComparing compilers and interpreters Shared vs. non-shared libraries.1Layers of System Softwarecat less vi date gcc nedit grep ddd csh (or bash or ksh) libc C Interface to Unix system servicesUnix system services Uni
University of Toronto - CSC - 209
Layers of System SoftwareCompilers, Interpreters, LibrariesComparing compilers and interpreters Shared vs. non-shared libraries.catlessvidategccneditgrepdddcsh (or bash or ksh) libc C Interface to Unix system servicesUnix system services Unix
University of Toronto - CSC - 209
Pointers to FunctionsFunction PointersKing Chapter 17.7 Since a pointer is just an address, we can have pointers to functions!int cube(int x) cfw_ return x*x*x; int (*f)(int); /*Define a function pointer*/ f = cube; /* Call the function that f points
University of Toronto - CSC - 209
Function PointersKing Chapter 17.71Pointers to Functions Since a pointer is just an address, we can have pointers to functions!int cube(int x) cfw_ return x*x*x; int (*f)(int); /*Define a function pointer*/ f = cube; /* Call the function that f poin
University of Toronto - CSC - 209
External and static variables External variable: declared outside the body of a function File scope: visible from the point of the declaration to the end of the file. Static storage duration: through the duration of the program. External/global variables
University of Toronto - CSC - 209
External and static variables External variable: declared outside the body of a function File scope: visible from the point of the declaration to the end of the file. Static storage duration: through the duration of the program. External/global variables
University of Toronto - CSC - 209
209 - Tutorial Week 6Files and directories in COpening filesFILE *fopen(const char *filename, const char *mode); Filename: identifies file to open Mode: &quot;r&quot; for reading &quot;w&quot; for writing &quot;a&quot; for appendingClosing filesint fclose(FILE *stream);File Out
University of Toronto - CSC - 209
Note: Questions 1-3 are taken from the King book, pg. 2181. If i is a variable and p points to i, which of the following expressions are aliases for i? (a and g) What is the meaning of each expression? int i = 10; a) *p - 10 b) &amp;p - address of p c
University of Toronto - CSC - 209
Static Allocation Recall: static allocation happens at compile time based on variable definitions.int x = 2; int a[4]; int *b; int main() cfw_SYMBOL TABLE: main 0x804837c x 0x8049588 b 0x8049688 a 0x804968c .text .data .bss .bss0x804837cmainDynamic
University of Toronto - CSC - 209
Pointers and Arrays Recall the pointer syntax: char *cptr; declares a pointer to a char allocates space to store a pointer (to a char) char c = 'a'; cptr = &amp;c; cptr gets the value of the address of c the value stored at the memory location referred t
University of Toronto - CSC - 209
Strings Strings are not a built-in data type. C provides almost no special means of defining or working with strings. A string is an array of characters terminated with a null character ('\0')String literalschar *name = &quot;csc209h&quot;; printf(&quot;This is a str
University of Toronto - CSC - 209
Pointers and Arrays Recall the pointer syntax: char *cptr; declares a pointer to a char allocates space to store a pointer (to a char)Pointers and Arrayschar *cptr; char c = 'a'; cptr = &amp;c; *cptr = 'b';Symbol Table cptr 0x80493e0 c 0x80494dc 0x80493
University of Toronto - CSC - 209
209 - Tutorial Week 4Assignment 1 More shell script examples C programmingCut#! /bin/sh # List all the users in /etc/passwd. FILENAME=/etc/passwd for user in $(cut -d: -f1 $FILENAME) do echo $user doneMore return valuesadduser() cfw_ USER=$1; PASSWD=
University of Toronto - CSC - 209
Cut 209 - Tutorial Week 4Assignment 1 More shell script examples C programming #! /bin/sh # List all the users in /etc/passwd. FILENAME=/etc/passwd for user in $(cut -d: -f1 $FILENAME) do echo $user doneMore return valuesadduser() cfw_ USER=$1; PASSWD=
University of Toronto - CSC - 209
The C Programming Language#include &lt;stdio.h&gt;Intro to Cint main() cfw_ int i; extern int gcd(int x, int y); for (i = 0; i &lt; 20; i+) printf(&quot;gcd of 12 and 0 is 0\n&quot;, i, gcd(12,i); return (0); int gcd(int x, int y) cfw_ int t; while (y) cfw_ t = x; x = y
University of Toronto - CSC - 209
Shell ReviewShell is a simple process: prompt input and parse command cause specified command to be executed repeatSome user-friendly features: aliases, filename expansion, job numbers1PathsPath: a list of directories to look up commands to be exec
University of Toronto - CSC - 209
Shell ReviewShell is a simple process: prompt input and parse command cause specified command to be executed repeatPathsPath: a list of directories to look up commands to be executed csh: sh: set path = ( a b c ) PATH=a:b:cSome user-friendly feature
University of Toronto - CSC - 209
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: onlycheatsheet.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips -t letter onlycheatsheet
University of Toronto - CSC - 209
209 - Tutorial week 3Some shell scripts1st program#!/bin/sh track=1 for file in *.mp3 do mv &quot;$file&quot; &quot;$cfw_track.mp3&quot; track=`expr $track + 1` doneA little more elaborate#!/bin/sh track=1 for file in *.mp3 do if test $track -lt 10 then mv &quot;$file&quot; &quot;0$cf
University of Toronto - CSC - 209
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: final.dvi %Pages: 14 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips -t letter final.dvi -o final.ps
UNC - BWV - 938
Praeludium Nr. 6&quot;Sechs kleine Prludien&quot;Johann Sebastian Bach (165-1750) Bwv 938 BWV 9383 8Clavier3 8611161.212.Creative Commons Attribution-ShareAlike 3.0226313641461.2.Sheet music from www. MutopiaProject .org Free to download, Types
BU - CS - 552
IA-32 Intel Architecture Software Developers ManualVolume 3: System Programming GuideNOTE: The IA-32 Intel Architecture Developers Manual consists of three books: Basic Architecture, Order Number 245470-007; Instruction Set Reference Manual, Order Numbe
BU - CS - 552
IA-32 Intel Architecture Software Developers ManualVolume 2: Instruction Set ReferenceNOTE: The IA-32 Intel Architecture Software Developers Manual consists of three volumes: Basic Architecture, Order Number 245470-007; Instruction Set Reference, Order
BU - CS - 552
%!PSAdobe2.0 %Title: Threads paper (Times) %Creator: PrintMonitor %CreationDate: Thursday, February 11, 1993 %Pages: (atend) %BoundingBox: ? ? ? ? %PageBoundingBox: 30 31 582 761 %For: Andrew %DocumentProcSets: &quot;(AppleDict md)&quot; 71 0 % Copyright Apple Comp
Mobile - ANR - 0048
A L A B A M AA &amp; MA N DA U B U R NU N I V E R S I T I E SWeed Management inANR-48Lakes and PondsFor a small farm pond, a drawdown every 3 or 4 years exposing at least one-half of the bottom may be helpful in controlling submerged vegetation. Condu
UC Davis - ECS - 150
I NSTALLING B OCHS AND M INIX ON W INDOWS XPP re pa re d F o r: La st R ev i s io n: EC S1 5 0 ( O p era t i ng Sy s t e ms ) P ro f e s so r Wu F a ll 2 0 0 3 0 2 O ct o b er 2 0 0 3P REPARATIONRequired Files: File NameBochs-2.0.2.exe minix.tar.gz fl
UC Davis - ECS - 150
Instructions on using Bochs 2.0 for your ECS 150 programming assignments- What is Bochs?Bochs is an IA-32 (x86) PC emulator. It includes emulation of the Intel x86 CPU, common I/O devices, and custom BIOS. Currently, Bochs can be compiled to emulate a 3
Oregon State - CS - 352
Requirements Engineering in the Year 00: A Research PerspectiveAxel van LamsweerdeDpartement dIngnierie Informatique Universit catholique de Louvain B-1348 Louvain-la-Neuve (Belgium) avl@info.ucl.ac.beABSTRACT Requirements engineering (RE) is concerned
Oregon State - CS - 352
Personas: Practice and TheoryJohn Pruitt Microsoft Corporation One Microsoft Way Redmond, WA 98052 USA +1 425 703 4938 jpruitt@microsoft.com Jonathan Grudin Microsoft Research One Microsoft Way Redmond, WA 98052 USA +1 425 706 0784 jgrudin@microsoft.com
Lake County - ECE - 313
SOLUTIONS TO Midterm I ECE 313 FALL 2007 1. True, True, False, False, True, True, True, False, False, True. Brief reasons: (i) P (E c F c ) = P (EF )c ) = 1 P (EF ). (ii) 1 P (E c |F c )P (F c ) = 1 P (E c F c ) = 1 P (E F )c ) = 1 1 + P (E F ). (iii) If
North Texas - FILES - 433
TEKS 6 D &amp; FMendelian Genetics Pedigrees &amp; KaryotypesTAKS Objective 2 The student will demonstrate an understandingof living systems and the environment.TEKS Science Concepts 6 D &amp; FThe student knows the structures and functions of nucleic acids in t
CUNY Baruch - MAT - 231
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: rev3.dvi %Pages: 2 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: CMBX12 CMR12 CMSY10 CMR10 CMMI10 CMBX10 CMSY8 CMR8 %+ MSBM10 CMMI8 EUSM10 CMMI12 CMEX10 %End
CUNY Baruch - MAT - 231
Math 231 Practice Test 2, 11/12/20051. Consider the vectors u = (1, 1, 0, 2) and v = (0, 0, 1, 5) in R4 . Find (i) u (2u 3v) (ii) u + v (iii) The unit vector in the direction of u v. (iv) The distance between u and v. (v) The scalar a such that u is orth
CUNY Baruch - MAT - 231
Math 231 Practice Test, 11/7/20041. Solve the system 2x + 3y - z = 1 3x + 5y + 2z = 8 x - 2y - 3z = -1by Cramer's rule.2. Consider the vectors u = (1, -1, 0, 2) and v = (0, 0, 1, 5) in R4 . Find (i) u (2u - 3v) (ii) u + v (iii) The unit vector in the d
CUNY Baruch - MAT - 231
Math 231 Practice Test 1, 9/29/20051. Consider the linear system 2x + 4y + 6z = 18 4x + 5y + 6z = 24 3x + y 2z = 4(i) Write this system as Ax = b by introducing the matrices A, x and b. (ii) Solve the system using Gauss-Jordan elimination (i.e., by redu
CUNY Baruch - MAT - 231
Math 231 Practice Test 1 SolutionsProblem 1. (i) Set 24 6 A = 4 5 6 3 1 2 x y x= z 18 24 . b= 4 . .9 . . . 12 . . . 23 .. . (ii) We form the augmented matrix [A . b] . 2 4 6 . 18 1 . 12 3 2 R1 . . . b] = 4 5 6 . [A . 4 5 6 . 24 . 3 1 2 . 4 . 3 1 2and r
CUNY Baruch - MAT - 231
Math 231 Practice Test, 9/28/20041. Consider the linear system 2x + 4y + 6z = 18 4x + 5y + 6z = 24 3x + y 2z = 4(i) Write this system as Ax = b by introducing the matrices A, x and b. (ii) Solve the system using Gauss-Jordan elimination (i.e., by reduci
CUNY Baruch - MAT - 231
Math 231 Second Midterm SolutionsProblem 1. Mark each of the following statements as true (T) or false (F). Briey say why you have made your choice. If the vectors v1 , v2 , v3 span a vector space V , then dim V = 3. False, because v1 , v2 , v3 may be li
CUNY Baruch - MAT - 231
Math 231 First Midterm SolutionsProblem 1. Mark each of the following statements as true (T) or false (F). Briey say why you have made your choice. Every system of 3 linear equations in 4 variables has a solution. False. For example, the system x + y + z
Lake County - CI - 399
1152 1588 1650 1335 1830 2064 2200 1580 2625 2600 1584 2034 2132 2400 4820 1000 1780 1517102 108 110.5 115 162 174 189 198 230 255 150 135 160 225 329 75 88 96350 300 250 200 150 100 50 0 0f(x) = 0.07x + 20.94 R = 0.77Column B Linear Regression for Co
Lake County - CI - 399
C&amp;I 399 Section TSMSummer 2003 Tim Hendrix, Instructor Week Three Assignments: June 30 July 4 Monday: Post: Metalesson Post: Continue to work on Geometer's Sketchpad analysis of conic sections.Continue to get caught up on all of the reading and other a
University of Toronto - DGP - 384
CSC384: Lecture 8Last time Action Representation; planning as search Today STRIPS Planning, Regression planning Readings: Today: 8.3 (STRIPS planning in depth, regressionplanning, briefly resolution-based planning)STRIPS PlannerLast time, discussed in
Grinnell College - CSC - 151
Fundamentals of CS I (CS151 2001S)Format for Lab Write-UpsAt times during this semester, I will ask you to write up your laboratory exercises. This document provides some basic guidelines for laboratory writeups. File Types and Names Starting the File S
National Taiwan University - COB - 804
SEC Staff Accounting Bulletin: No. 99 MaterialitySECURITIES AND EXCHANGE COMMISSION 17 CFR Part 211 [Release No. SAB 99] Staff Accounting Bulletin No. 99 AGENCY: Securities and Exchange Commission ACTION: Publication of Staff Accounting Bulletin SUMMARY:
Grinnell College - CSC - 151
Fundamentals of CS I (CS151 2001S)Homework 1: A CS151 Web SiteAssigned: Thursday, 25 January 2001 Due: 9:00 a.m., Friday, 2 February 2001 No extensions! Summary: In this assignment, you will build a small Web site dedicated to some aspect of introductor
Grinnell College - CSC - 151
Fundamentals of CS I (CS151 2001S)Homework 5: Higher-Order ProceduresPreliminariesPreliminariesAssigned: Monday, 2 April 2001 Due: Friday, 6 April 2001 No extensions without prior permission! Summary: In this assignment, you will continue your investi
Grinnell College - CSC - 151
Fundamentals of CS I (CS151 2001S)Homework 6: ProjectsPreliminaries Assignment DetailsPreliminariesAssigned: Thursday, April 19, 2001 Due: Friday, May 4, 2001 No extensions without prior permission! Summary: In this assignment, you will apply your kno
Eckerd - PS - 302
PSB 302: SOCIAL PSYCHOLOGY Fall, 2008 INSTRUCTOR: OFFICE: PHONE: OFFICE HOURS: TEXT: Dr. Mark H. Davis (davismh@eckerd.edu) PSY 236 864-8263 Monday, 10:00 Noon; Thursday, 3:00 5:00 p.m. Social Psychology (4th Edition) by FranzoiPURPOSE OF THE COURSE This
Maryland - M - 111
Math 111: Introduction to Probability Quiz 8 - November 9, 2007Name:This quiz covers material from sections 8.18.3.1.(2 points) Circle the histogram that represents a probability distribution with the greater variance.2. (4 points) Acme Stanley Inves
UMass (Amherst) - ECE - 655
UNIVERSITY OF MASSACHUSETTS Department of Electrical and Computer Engineering Fault Tolerant Computing Homework 4 1. Show that the three cases enumerated in connection with the derivation of the hypercube network reliability lower bound, are mutually excl
UMass (Amherst) - ECE - 655
UNIVERSITY OF MASSACHUSETTS Department of Electrical and Computer Engineering Fault Tolerant Computing Homework 5 1. You have a task with execution time, T . You take N checkpoints, equally spaced through the lifetime of that task. The overhead for each c
UMass (Amherst) - ECE - 655
UNIVERSITY OF MASSACHUSETTS Department of Electrical and Computer Engineering Fault Tolerant Computing Homework 3 1. Given a number X and its residue modulo-3, C(X) = |X|3 ; how will the residue change when X is shifted by one bit position to the left if
UMass (Amherst) - ECE - 655
UNIVERSITY OF MASSACHUSETTS Department of Electrical and Computer Engineering Fault Tolerant Computing Homework 2 1. A duplex system consists of two active units and a comparator. Assume that each unit has a failure rate of and a repair rate of . The outp
UMass (Amherst) - ECE - 655
UNIVERSITY OF MASSACHUSETTS Department of Electrical and Computer Engineering Fault Tolerant Computing Homework 1 1. The lifetime (measured in years) of a processor is exponentially distributed, with a mean lifetime of 2 years. You are told that a process
University of Rochester - PHYS - 231
RW28 About this assignmentSections 10.4-10.5.2 (p. 354-358). 1. In Chapter 3, you calculated the stiffness of the interatomic &quot;spring&quot; (chemical bond) between atoms in a block of aluminum to be 16 N/m. Since in our model each atom is connected to two spr
Bethel VA - MIS - 420
Homepage System Test ScriptPrepared by: Your TeamRequirementPass X XTest Case Req 1 Test Case 1 Test Case 2 Test Case 3 Test Case 4 Test Case 5 Req 2 Test Case 1 Test Case 2 Test Case 3 Test Case 4 Test Case 5 Req 3 Test Case 1 Test Case 2 Test Case 3
Allan Hancock College - CT - 5706
The OpenGL Utility Toolkit (GLUT) Programming InterfaceAPI Version 3Mark J. Kilgard Silicon Graphics, Inc. November 13, 1996OpenGL is a trademark of Silicon Graphics, Inc. X Window System is a trademark of X Consortium, Inc. Spaceball is a registered t
University of North Dakota - CS - 451
Essential CBy Nick ParlanteCopyright 1996-98, Nick ParlanteAbstract This article explains the features of the C language. The coverage is pretty quick, so it is most appropriate for someone with some programming background who needs to see how C works.
Allan Hancock College - CT - 5706
GLUIA GLUT-Based User Interface Libraryby Paul RademacherVersion 2.0 June 10, 1999ContentsContents.2 1 Introduction.4 1.1 Overview.4 1.2 Background.4 1.3 What New in Version 2.0? .5 s 2 Overview .