MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E

Similar documents
PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

PLEASE READ CAREFULLY BEFORE YOU START

Transport layer. UDP: User Datagram Protocol [RFC 768] Review principles: Instantiation in the Internet UDP TCP

Transport layer. Review principles: Instantiation in the Internet UDP TCP. Reliable data transfer Flow control Congestion control

ECE697AA Lecture 3. Today s lecture

Suprakash Datta. Office: CSEB 3043 Phone: ext Course page:

Chapter 3 outline. 3.5 Connection-oriented transport: TCP. 3.6 Principles of congestion control 3.7 TCP congestion control

Lecture 5. Transport Layer. Transport Layer 1-1

Internet and Intranet Protocols and Applications

CSE 4213: Computer Networks II

Chapter 4 Network Layer: The Data Plane. Part A. Computer Networking: A Top Down Approach

Application. Transport. Network. Link. Physical

Computer Communication Networks Midterm Review

CPSC 441 COMPUTER COMMUNICATIONS MIDTERM EXAM SOLUTION

Fall 2012: FCM 708 Bridge Foundation I

Chapter 6 Transport Layer

CSC 4900 Computer Networks: TCP

CS 4390 Computer Networks. Transport Services and Protocols

CNT 6885 Network Review on Transport Layer

Lecture 08: The Transport Layer (Part 2) The Transport Layer Protocol (TCP) Dr. Anis Koubaa

CSC 8560 Computer Networks: TCP

Chapter 3: Transport Layer. Chapter 3 Transport Layer. Chapter 3 outline. Transport services and protocols

Preview Test: HW3. Test Information Description Due:Nov. 3

Computer Networking: A Top Down Approach

UNIT IV -- TRANSPORT LAYER

32 bits. source port # dest port # sequence number acknowledgement number not used. checksum. Options (variable length)

CSCI Topics: Internet Programming Fall 2008

Transport Layer. Application / Transport Interface. Transport Layer Services. Transport Layer Connections

Announcements Computer Networking. Outline. Transport Protocols. Transport introduction. Error recovery & flow control. Mid-semester grades

CSEN 503 Introduction to Communication Networks. Mervat AbuElkheir Hana Medhat Ayman Dayf. ** Slides are attributed to J. F.

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control

NWEN 243. Networked Applications. Transport layer and application layer

Student ID: CS457: Computer Networking Date: 3/20/2007 Name:

Chapter 3 outline. 3.5 Connection-oriented transport: TCP. 3.6 Principles of congestion control 3.7 TCP congestion control

The Transport Layer Multiplexing, Error Detection, & UDP

Lecture 3: The Transport Layer: UDP and TCP

Applied Networks & Security

Lecture 8. TCP/IP Transport Layer (2)

CCNA 1 Chapter 7 v5.0 Exam Answers 2013

Chapter 3 Transport Layer

Chapter 3- parte B outline

NT1210 Introduction to Networking. Unit 10

Chapter 3 Transport Layer

The Transmission Control Protocol (TCP)

Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer

User Datagram Protocol

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 9

The Transport Layer: TCP & Reliable Data Transfer

Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1

Different Layers Lecture 20

LECTURE 3 - TRANSPORT LAYER

CS164 Final Exam Winter 2013

Chapter 3 outline. 3.5 connection-oriented transport: TCP segment structure reliable data transfer flow control connection management

Chapter 3 Transport Layer

Lecture 11. Transport Layer (cont d) Transport Layer 1

CSC 401 Data and Computer Communications Networks

Chapter 3: Transport Layer Part A

bitcoin allnet exam review: transport layer TCP basics congestion control project 2 Computer Networks ICS 651

Chapter 4 Network Layer: The Data Plane

Outline. TCP: Overview RFCs: 793, 1122, 1323, 2018, Development of reliable protocol Sliding window protocols

Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP

Chapter 3 Transport Layer

Chapter 3 Transport Layer

Transport Layer: outline

14-740: Fundamentals of Computer and Telecommunication Networks

CS457 Transport Protocols. CS 457 Fall 2014

UNIT IV TRANSPORT LAYER

TCP and Congestion Control (Day 1) Yoshifumi Nishida Sony Computer Science Labs, Inc. Today's Lecture

Transport Layer. Chapter 3: Transport Layer

Internet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer

Transport Layer Marcos Vieira

COMP 431 Internet Services & Protocols. Transport Layer Protocols & Services Outline. The Transport Layer Reliable data delivery & flow control in TCP

CMPE 80N: Introduction to Networking and the Internet

TCP: Overview RFCs: 793, 1122, 1323, 2018, 2581

Transport protocols. Transport Layer 3-1

Multiple unconnected networks

Correcting mistakes. TCP: Overview RFCs: 793, 1122, 1323, 2018, TCP seq. # s and ACKs. GBN in action. TCP segment structure

CS4700/CS5700 Fundamentals of Computer Networks

NWEN 243. Networked Applications. Layer 4 TCP and UDP

CC451 Computer Networks

Announcements Computer Networking. What was hard. Midterm. Lecture 16 Transport Protocols. Avg: 62 Med: 67 STD: 13.

CS Lecture 1 Review of Basic Protocols

Chapter 4 Network Layer: The Data Plane

CS321: Computer Networks Congestion Control in TCP

Transport Protocols & TCP TCP

Lecture 20 Overview. Last Lecture. This Lecture. Next Lecture. Transport Control Protocol (1) Transport Control Protocol (2) Source: chapters 23, 24

TCP. TCP: Overview. TCP Segment Structure. Maximum Segment Size (MSS) Computer Networks 10/19/2009. CSC 257/457 - Fall

Computer Networking Introduction

Da t e: August 2 0 th a t 9: :00 SOLUTIONS

Guide To TCP/IP, Second Edition UDP Header Source Port Number (16 bits) IP HEADER Protocol Field = 17 Destination Port Number (16 bit) 15 16

Development of reliable protocol Sliding window protocols. C = channel capacity in bps I = interrupt/service time + propagation delay

Department of Computer and IT Engineering University of Kurdistan. Transport Layer. By: Dr. Alireza Abdollahpouri

Computer Networks and Data Systems

Computer Networking Introduction

TCP reliable data transfer. Chapter 3 outline. TCP sender events: TCP sender (simplified) TCP: retransmission scenarios. TCP: retransmission scenarios

Chapter 3: Transport Layer

Transcription:

MIDTERM EXAMINATION #2 OPERATING SYSTEM CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Intersession 2008 Last Name: First Name: Student ID: PLEASE READ CAREFULLY BEFORE YOU START 1. This is a CLOSED book test; no notes, textbooks, calculators or computer aids are allowed. 2. PRINT your name legibly and clearly with your Student ID in the space indicated above. 3. You will be asked to sign your name once before leaving the exam room (sign-out). 4. PLACE ANSWERS on Scantron sheet provided. DO NOT REMOVE any pages or attach any papers to this test or you will void your test and receive a mark of zero. If you need more space for rough work you may use any additional space on the examination paper. 5. You are not allowed to give or receive unauthorized help with your test. Any misconduct, as outlined by the Senate bylaw 31 article I, will be reported accordingly. 6. You have 75 minutes to complete this test. 7. Midterm examination papers will be returned to students. TOTAL MARK: Good Luck! I AGREE TO THE ABOVE TERMS AND WILL NEITHER RECEIVE NOR GIVE UNAUTHORIZED HELP ON THIS EXAM /60 SIGNATURE DATE SIGN HERE 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 1 of 11

All questions are either Multiple Choice or True-False. For each Multiple Choice question, you are to choose only one response which best answers the question. For True-False questions you may only choose one option (True or False). Place all responses on the Scantron sheet provided. In each case, be sure to carefully check the question number on both this examination paper and also the Scantron sheet. Completely fill in the circular area on the Scantron sheet, once again making sure to choose the correct circle corresponding to the examination question responses provided. If an error is made you must carefully and completely erase the incorrect circular area on the Scantron sheet, then completely fill in the corrected circle you have selected. 1. Transport services and protocols provide logical communication between hosts. 2. Network services and protocols provide logical communication between processes. 3. Transport protocols run in end systems. 4. Internet transport-layer protocols provide delay and bandwidth guarantees. 5. In TCP based demultiplexing, TCP sockets are identified by. A) both sender and receiver port numbers B) sender IP address and port numbers C) receiver IP address and port number D) both sender and receiver IP addresses and port numbers 6. UDP does not provide. A) no frills, bare bones Internet transport protocol B) best effort service C) handshaking between UDP sender, receiver D) congestion control E) Both A and B are correct responses 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 2 of 11

7. In pipelining protocols, the Go-back-N approach requires. A) Sender can have up to N unacked packets in pipeline B) Receiver acks individual packets C) If sender timer expires, retransmit all N packets D) Sender has timer for each unacked packet E) All of the above responses are correct 8. In order to establish a virtual connection (also called a virtual circuit) that permits datagrams to flow between communicating end hosts, it is necessary to. A) involve all intervening routers B) initiate the connection using specialized datagrams that carry historical information about the end-end route C) complete the connection using receiver and sender acknowledgements 9. Router buffer sizes should be selected based on. A) message round-trip time (eg. as determined by acknowledgements) B) link capacity C) tolerance for data loss due to overflow 10. The first item in an IP datagram is the. A) header length (in bytes) B) total datagram length (in bytes) C) protocol version number D) type of service 11. IP datagrams may be fragmented into several smaller IP datagrams. A) that are reassembled at the next router link B) in order to adapt to the largest link layer frame C) that are reassembled only at the final destination D) Both B and C are correct responses. 12. A router is able to direct a message along its path by examining the destination IP address embedded within a UDP packet. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 3 of 11

13. The IPv4 datagram header has length 40 bytes. 14. Network layer protocols must be defined in every host and router. 15. In TCP slow start, after establishing the connection, the message flow rate is. A) increased linearly until first loss event B) increased linearly after the first loss event C) increased exponentially until first loss event D) Both B and C are correct responses. 16. Forwarding refers to. A) the manner by which datagrams are routed from source to destination ports of end hosts B) the manner by which datagrams are routed from input to output ports of individual routers C) the set of algorithms required to ensure near-optimal path selection of datagrams D) the control of traffic between communicating routers 17. The Best effort service model for Internet traffic provides no guarantees of bandwidth, loss or packet order and, further, requires that the occurrence of congestion must be inferred (ie. derived), rather than determined directly through network feedback. 18. Assuming that W is the maximum window size established by TCP slow start, and the round-trip time is RTT, what is the average throughout of TCP as a function of W and RTT? A) RTT/W B) 0.5 x W/RTT C) 0.75 x W/RTT D) 0.75 x RTT/W. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 4 of 11

19. Datagram networks do not require call setup at the network layer. 20. In datagram networks. A) routers maintain state about end-to-end connections B) packets forwarded using destination host address and virtual circuit number C) packets between same source-destination pair may take different paths 21. The calculated value of a TCP timeout should. A) be greater than the round-trip time B) eliminate unnecessary retransmissions C) allow quick reaction to changes in network topology 22. Round-trip time (RTT) is estimated based on. A) a weighted average RTT that is fixed after several samples B) a weighted average RTT that is continuously updated C) sampling of routes to determine minimum cost paths 23. TCP flow control is provided by. A) including value of the receiver buffer available size in acknowledgements B) keeping out-of-order segments in the receiver buffer C) keeping the send rate always less than the receive rate 24. The message payload of a UDP segment contains the 4-byte hexadecimal string E666D555 16. The UDP checksum of this segment is. A) BBBB B) BBBC C) 4443 D) 4444 25. In pure P2P networks, peers may not change IP addresses. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 5 of 11

26. Flow control is guaranteed to solve congestion problems. 27. In packet switched networks, store and forward refers to:. A) entire message must arrive at router before it can be transmitted on next link B) scheduling of packets to avoid congestion C) entire packet must arrive at router before it can be transmitted on next link D) entire packet must be stored on router until acknowledgement received 28. Routers provide feedback to end systems to help in. A) Network-assisted congestion control B) Network-assisted flow control C) End-end congestion control D) End-end flow control 29. An elastic service is one that is capable of providing a range of service delivery adapted to available resources. 30. Packet switching in the network core leads to. A) bandwidth subdivision B) resource contention C) shared circuit switching D) packet loss 31. ATM devices use a packet structure whose size is bytes. A) 20 B) 48 C) 53 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 6 of 11

32. Delays in packet delivery are usually caused by. A) queuing in router buffers B) overflow in router buffers C) retransmission of lost packets 33. The term goodput refers to the situation where. A) sending rate is larger than receiving rate B) sending rate is smaller than receiving rate C) sending rate is equal to receiving rate D) packet loss occurs, but it is minimized 34. With end-to-end congestion control congestion is inferred from end-system observed loss and delay. 35. The size of the TCP receive window (RcvWindow) never changes throughout the duration of the connection. 36. With TCP in the context of client-server connectivity, a disconnection from the session is achieved. A) When the client sends a FIN control segment to server and the server returns an ACK. B) When the client sends a FIN control segment to server and the server returns an ACK followed by a FIN. C) When the client sends a FIN control segment to server and the server returns an ACK, followed by the server sending a FIN control segment to client and the client returns an ACK. 37. In order to establish support for a possible TCP connection session it is necessary for the server side to create a listening socket. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 7 of 11

38. UDP is often used for streaming multimedia apps because. A) it is loss tolerant B) it is rate sensitive C) Both A and B responses are correct. 39. The length of a UDP packet header is bytes. A) 4 B) 8 C) 12 D) 16 40. The characteristics of unreliable channels determines the complexity of reliable data transfer protocol. 41. In the client-server model the time it takes for a server to distribute a file of size F to N clients is. A) proportional to F B) increases linearly with N, for large N C) Both A and B responses are correct. 42. A host-local, application-created, OS-controlled interface into which an application process can both send and receive messages to or from another application process is called a(n). A) client-server paradigm B) peer C) socket D) protocol 43. Servers distinguish between multiple connected clients in TCP using. A) source port numbers B) client IP addresses C) client side socket numbers D) All of these are correct responses. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 8 of 11

44. A is a sequence of characters that flow into or out of a process. A) pipeline B) stream C) message flow D) socket 45. In client-server programming with UDP. A) sender explicitly attaches IP address and port of destination to each packet B) there is no handshaking C) server must extract IP address, port of sender from received packet 46. Gathering data from multiple sockets and enveloping data with a header is called. A) segmentation B) multiplexing C) demultiplexing D) integration 47. Transport layer protocols do not provide. A) logical communication between hosts B) delay guarantees C) bandwidth guarantees D) All of the above responses are correct. 48. Socket API s provide. A) unreliable datagram transport service B) reliable, byte stream-oriented transport service C) Both A and B are correct responses. 49. Network layer protocols must exist in every host and router. 50. In socket programming it may happen that transmitted data may be received out of order, or lost. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 9 of 11

51. A router examines header fields in all IP datagrams passing through it. 52. An ATM network layer service model that guarantees minimum bandwidth, packet ordering and congestion feedback is. A) ABR B) CBR C) UBR D) VBR 53. In Virtual Circuits. A) it is required to allocate bandwidth and router buffers at call setup B) every router on the source-destination path maintains state for each passing connection C) each packet carries the destination host address 54. Datagram networks require call setup at the network layer. 55. In datagram networks packets between the same source-destination pair may take different paths. 56. In datagram networks the time a datagram spends in a router buffer is controlled by the round trip time. 57. IP fragmentation occurs due to different network link types with different maximum transfer units. 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 10 of 11

58. An IP datagram must specify. A) the length (in bytes) of the payload data B) the maximum number of hops the datagram must take C) the transport layer protocol to deliver payload to 59. In pipelining protocols, the selective repeat approach requires. A) Receiver only sends cumulative acks B) Sender maintains timer for each unacked packet C) Receiver acks individual packets D) Both B and C responses are correct. 60. In pipelining protocols, the Go-back-N approach requires. A) sender can have up to N unacked packets in pipeline, in general B) receiver acks individual packets C) if sender timer expires, retransmit all N packets D) sender has timer for each in flight packet 2008 by Dr. R. Kent All Rights Reserved. No part of this document may be reproduced without written author permission. Page 11 of 11