CS 344/444 Computer Network Fundamentals Midterm Exam Spring ...
Recommend Documents
exam page unless we are clearly told on the front of the page to look there. You
have 80 .... The following figure shows a diagram of three networks and the
Internet. .... FALSE. DoS attacks fundamentally concern exhausting some sort of
resource r
Microsoft Excel. 3. Microsoft Paint. Apart from above, no other software is allowed
. Not Allowed: Use of CALCULATOR is NOT ALLOWED. 7 ) CS201. Instructions ...
Answers must be supported by your calculations. 1. (30) Find the increase of
pressure at points A and B due to loading q=l200 kN/rn on the given strip footing.
Nov 9, 2006 ... Midterm Examination ... Midterm Exam .... (b) [8] The SIFT descriptor is a popular
method for describing selected feature points based on local.
Computer Security ... We will not grade anything on the back of an exam page ....
of breaches of personal information if the data the attacker accessed was en-.
Dec 8, 2014 - Write SQL statement to retrieve last name and hire date for all employees who were hired ... Note: sysdate
Part II consists of 3 problems; show all your work on these problems so that .... b.
Write SQL statements to create the corresponding relations that capture all of ...
Nov 6, 2012 ... CS 132 Compiler Construction, Fall 2012. Instructor: Jens Palsberg ... The
question cannot be answered with the information provided d.
Mar 2, 2012 ... MIDTERM EXAM SOLUTION ... (b) network news, file transfer, and the Web ...
The Internet Protocol (IPv4) is an example of a: .... (c) (2 marks) What is the
fundamental underlying control principle during the steady-state.
not discuss the exam with anyone until Oct. 30, after everyone has taken the ....
index k = 1,2,...; time index k corresponds to time t = kh, where h > 0 is the sample
.... is a positive constant that accounts for the capacitance of the interconnec
A control engineer, N. Minorsky, designed an innovative ship steering system in
... V. (a) (4 points) Determine K so that overshoot is 7%. (b) (2 points) What is the
...
Note that the last page of the exam contains extra credit questions about the ...
One of the reasons that health care is different from other sectors of the economy.
Clearly indicate your choice for each multiple choice question in the space ...
MATH 250 Spring 2012 Exam II. 1. ... (a) f1(t)=1,f2(t)=2t, f3(t) = t + 1. (b) f1(t) = t, ...
TOPICS FOR MIDTERM EXAM. Marek Perkowski. 1. ... Use of Binary Decision
Diagrams to create a network from ... Examples of naïve test generation for given
fault. 27. ... Physical design algorithm fundamentals: floorplanning and placement
,.
CS 301: Languages and Automata. Prof. Bob Sloan. Sample Midterm Exam.
February 2012. This is a sample based upon an old hour exam. The material ...
Midterm Exam Material (see “Midterm Exam Study Guide”). Interest Points
Detection ... SIFT features (should know the steps very well) o Scale space
extrema ...
Mar 1, 2012 ... PSYCHOLOGY 452 MIDTERM EXAM. Dr. Michael ... Hopfield Network ... and
explain why the Hebb rule is fundamentally important to modern.
accounts have a mean balance of $1,000 and a standard deviation of $240. ...
statistic for the test of hypothesis that the random sample comes from the same.
1 day ago ... You must not communicate at all with your classmates, your friends, .... For each
of seasons 1 through 10, you can plot the curve of WILI values ...
Page 1 of 5. 1. ELP 518: School Law. Sample Midterm Exam Review. North Carolina State University. Spring 2011. DIRECTION
Dec 17, 2013 ... Honors Algebra'2 REVIEW. Semester 1 Exam. Name: Date: Pd: MIDTERM EXAM
SCHEDULE. Tuesday. December 17, 2013. 7:25 AM — 8:55 ...
Nov 4, 2010 - Task 2 (20 pts). Draw a reduced ordered binary decision diagram (ROBDD) for the boolean func- tion above,
Web Production I: Sample Midterm Exam. The following ... some of the
fundamental differences between this network, and the traditional AT&T phone
network.
Math 115 Midterm Review (Spring 2011). Name: Instructor: KUID:
ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ. This exam consists of two
parts.
CS 344/444 Computer Network Fundamentals Midterm Exam Spring ...
Mar 7, 2007 ... Computer Network Fundamentals. Midterm Exam ... This exam has 8 pages,
including this cover page .... For example, OldPath(5) might be.
Instructions: 1. You have 60 minutes to finish 2. Question 5 is only for 449 students 3. Closed books, closed notes. Write all your answers using the pages on this exam (use back pages if needed) • Calculators allowed • This exam has 8 pages, including this cover page Page 1
Question 1 (10 points) Answer the following using True/False. You do not need to explain your answers.
1. One of the functionalities that transport protocols provide is reliable transfer over unreliable channels. T 2. The Selective Repeat ARQ protocol is more efficient than the Go-Back-N ARQ protocol. T 3. Efficiency of the Token Ring MAC protocol is higher than Ethernet when network utilization is high. T 4. ARP is used to bind MAC addresses to IP addresses. T 5. A router works at the Networking layer of the protocol stack. T 6. Routing on the Internet is divided in two tiers. T 7. CSMA/CD is an appropriate MAC protocol for ad-hoc wireless networks. F 8. Link State routing protocols suffer from the "count to infinity" problem. F 9. Reassembly of IP fragments happens only at the destination host. T 10. Each router in OSPF broadcasts its routing table to all the other routers in the network. F
Page 2
Question 2: Suppose node A is connected to B via an intermediate router R. The A-R link is instantaneous, but the R-B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS=4. For Time=0,1,2, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
SWS: send window size LAR: last acknowledgement received (its sequence number) LFS: last frame sent (its sequence number) LFS-LAR 9->3->5.
p and q increases. Node j need to be checked only when q ∈ Path( j ) or p ∈ Path( j ) . The algorithm below will find out those nodes and put them into set Tentative and recheck them.
Suppose the length of the arc between nodes
Clear set Confirmed and Tentative. minPQ = min(OldDistance(1,q), OldDistance(1,p)); for i = 1 to n { if (OldDistance(1, i) < minPQ) { Add i to set Confirmed ; NewDistance(1, i) = OldDistance(1, i); NewPath(i) = OldPath(i); } else { Add i to set Tentative; } } for each i in set Tentative { tmpPath = reverse OldPath(i); needMove = 1; for each j in tmpPath { if (j == q || j == p) { needMove = 0; break; } if (OldDistance(1, j)
