Mid-Term Exam for Computer Networks
Fall 2010
> SOLUTIONS <
Welcome to the Mid-Term Exam for Computer Networks. Read each problem carefully. There are eight required problems (each worth 12 points you get 4 points for correctly following these instruction
EPFL-logo
Midterm - Computer Networks
Prof. J.-P. Hubaux and Dr. M. H. Manshaei November 3, 2009 Duration: 1:45 hours, closed book.
Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on the
CS421, HW#1, due Mar. 25, 2010 1. I wrote down a UDP based ping program, which can send ping request packets of variable size, in order to measure the propagation delay and transmission rate to the nearest router. I made some measurements using this tool
Computer Networks - Final exam
Prof. J.-P. Hubaux and Dr. M. H. Manshaei December 21, 2010 Duration: 3:00 hours, closed book.
Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra sheets if ne
Computer Networks - Midterm
Prof. J.-P. Hubaux and Dr. M. H. Manshaei November 9, 2010 Duration: 1:45 hours, closed book.
Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra sheets if necess
EPFL-logo
Midterm - Computer Networks
Prof. J.-P. Hubaux and Dr. M. H. Manshaei November 4, 2008 Duration: 2 hours, closed book.
Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on them).
EPFL-logo
Computer Networks - Final Exam
Prof. J.-P. Hubaux and Dr. M. H. Manshaei January 27, 2009 Duration: 3:15 hours, closed book.
Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on
CS 421 HW#1, due Apr. 1, 2011 1) Assume that there are 3 links on a path connecting nodes A and B, where each link has a distance of 200 km and a transmission rate of 10 Mbps. We are transmitting a file composed of three packets from node A to node B usin
CS421 HW#1, due Nov. 25, 2011
1. Assume that there are 3 links on a path connecting hosts A and B passing through routers R1 and R2 as shown in the following figure. Each link has a distance of 400 km and the transmission rate of each link is shown in the
CS 421 HW#1, due Nov. 8, 2010 1) Given the following parameters for a datagram packet switching network: N: number of hops between two given stations; L: total number of bits to be Xmitted; B: common data rate, in bits/second, on all links; H: number of o
Outline CS 464: Introduction to Machine Learning
Artificial eural etworks
Slides adapted from Chapter 4 Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html
The Brain Perceptrons Gradient descent Multi-
Statistical modeling
CS 464: Introduction to Machine Learning
Statistical Modeling (Nave Bayes Classifier)
Slides for Section 4.2 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.html
1
Nave Bayes Classifier Use all the attributes Two assumptions: A
Textbooks
Machine Learning by Tom M. Mitchell
CS 464: Introduction to Machine Learning
Aynur Dayanik
Slides for Chapter 1 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.html
http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html
Data Mi
Decision Tree Learning CS 464: Introduction to Machine Learning
Decision Tree Learning
Slides adapted from Chapter 3 Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html 1
2
Decision tree learning is a m
Concept Learning CS 464: Introduction to Machine Learning
Concept Learning
Slides adapted from Chapter 2, Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html
1 2
Acquiring the definition of a general cat
29-06-2007 BILKENT UNIVERSITY Electrical and Electronics Engineering Dept. EEE212 Microprocessors SECTIONS 1-2 Midterm Closed Book No Calculators All programs need to be in assembly language! Duration: 2.5 hours
Surname:_SOLUTION_ Name:_ ID-Number:_ SECTI
13-4-2008 BILKENT UNIVERSITY EEE212 Microprocessors Sections 1-5 Midterm Open TextBook Closed Noted, No Calculators Use the boxes provided for your answers! Use comments for readability, otherwise the programs will be partially graded! Duration: 2 hours
S
Q1) [25 pts] a) [3 pts] Represent -2668 decimal in 32 bit signed arithmetic as a hex value -2668 = FFFFF594 hex
b) [3 pts] What is 8DCE h in decimal if we are using 16 bit signed arithmetic 8DCE h = -29234 decimal
c) [7 pts] Consider the following program
16-11-2007 BILKENT UNIVERSITY Electrical and Electronics Engineering Dept. EEE212 Microprocessors Midterm Open TextBook No Calculators Use the boxes provided for your answers! Use comments for readability, otherwise the programs will be partially graded!
BILKENT UNIVERSITY Department of Electrical and Electronics Engineering EEE212 Microprocessors
QUIZ 4
12-23-2010 Fall Semester
Open book, closed notes. Use the boxes provided for your answers. Show all your calculations! Duration: 40 minutes
Surname Name
BILKENT UNIVERSITY Department of Electrical and Electronics Engineering EEE212 Microprocessors
QUIZ 3
12-09-2010 Fall Semester
Open book, closed notes. Use the boxes provided for your answers. Show all your calculations! Duration: 35 minutes
Surname Name