Topic4_Practice Questions_Solutions
.pdf
keyboard_arrow_up
School
California State University, Long Beach *
*We aren’t endorsed by this school
Course
301
Subject
Computer Science
Date
Feb 20, 2024
Type
Pages
1
Uploaded by HighnessOxideMouse18
Topic 4: System Bus - Practice Questions - Solutions
CECS 301 © Amin Rezaei Question 1:
True or False
? In master/slave system bus, all bus slaves must negotiate with a bus arbiter to gain the ownership of the bus before starting a data transfer. Question 2:
True or False
? Bus topology has the lowest contention since every node can acquire the bus anytime. Question 3:
True or False? In a mesh topology, a deterministic routing algorithm that routes first in X dimension and then in Y dimension, is deadlock-free. Question 4:
Which of the following topologies has the highest speed? 1) Bus 2) Ring 3) Mesh 4) Torus 5) Point-to-Point Question 5:
In the given mesh topology, a Dimension-Order Routing (DOR) algorithm restricts all turns to the south direction. What is the path that a message takes from source node 2 to destination node 16? (4pt) 1) 2, 3, 4, 8, 12, 16 2) 2, 3, 7, 8, 12, 16 3) 2, 6, 7, 11, 15, 16 4) 2, 6, 10, 11, 12, 16 5) 2, 6, 10, 14, 15, 16
Discover more documents: Sign up today!
Unlock a world of knowledge! Explore tailored content for a richer learning experience. Here's what you'll get:
- Access to all documents
- Unlimited textbook solutions
- 24/7 expert homework help
Related Questions
Create a spanning tree for the given topology. Label all ports with their status i.e. Root, designated or block.
Note: STP link costs are shown in brackets
arrow_forward
computer networking
arrow_forward
Network & Data Communcations
arrow_forward
One of the advantages of hierarchical routing (HR) is easier duty cycling because
O Nodes battery replacement in flat routing in harder that HR
O Nodes are rarely routers in HR than Flat routing
O Nodes are more powerful in HR than Flat routing
Nodes are more organized in HR than Flat routing
O Node have longer hops in HR than in flat routing
arrow_forward
Please written by computer source
arrow_forward
Computer networking subject rcs817
arrow_forward
Channel partitioning MAC protocols are:
A. Efficient for low channel load since the delay is N/2, whereas N is the number of nodes.
B. None is true.
C. Efficient for low channel load since the delay is 1/N, whereas N is the number of nodes.
D. Efficient for high channel load since the delay is N/2, whereas N is the number of nodes.
E. Efficient for high channel load since the delay is 1/N, whereas N is the number of nodes.
arrow_forward
A 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions:
a. What is the minimum length of a contention slot in μsec?
b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation
c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…
arrow_forward
4. The figure below shows a router connected to 4 devices. All devices,
including the router, have transmission rates = 1 Mbits/s. The router can
process the data instantaneously (processing delay= Os for all packets). The
queue can hold a maximum of 10 Mbits at any given time, Note that all
packets have to join the queue. The table in the figure shows the time at
which packets are generated (in s), where they are generated, where they
are going, and the size of each packet.
R=1 Mbits/s
B
R = 1 Mbits/s
A
Router
Queue
Processing Delay = Os
Transmission Rate = 1 Mbits/s
C
R = 1 Mbits/s
Time
(s)
from
to
Size
(Mbits)
t=0
R = 1 Mbits/s
t = 1
D
t = 2
В
t = 10
D
BD
ACBO
5
5
A
10
C
10
t = 11
A
B
5
arrow_forward
Answer me fastvplz
arrow_forward
Classless addressing is one of the solutions of address depletion problem in IP address space.
4-Dual stack transition strategy (from IP v4 to IPv6) is preferred when most internet devices and systems are moved to IPv6 while some systems still use IPv4.
5_In ARP, the ARP query is unicasted while ARP response is broadcasted through the network.
arrow_forward
The Transmission Control Protocol (TCP) is one of the core protocols of the Internet protocol suite (IP), and is so common that the entire suite is often called TCP/IP. A TCP connection is managed by an operating system through a programming interface that represents the local end-point for communications, the Internet socket. During the lifetime of a TCP connection the local end-point undergoes a series of state changes. These states are: (1) TCPEstablished: connection is on and ready for data transfer, (2) TCPCLosed, connection is off, and (3)TCPListen, TCP is listening for connection requests. The TCP Connection performs three operations, where the behavior of the operations changes as the state of the connection changes. These operations are: (1) open, (2) close, and (3) Acknowledge.
What design pattern best suites your needs?
1. Chain of responsibility
2. Strategy
3. Command
4. State
arrow_forward
Assume the VC number of a virtual-circuit network is a 16-bit field. What is the maximum number of virtual circuits that can be carried over a link? If the path and the VC number for each VC are determined by a central node of the network and the same VC number is used for all links along the path of same VC, how does the central node determine the VC number at the setup time?
arrow_forward
Networking & Data Communcations
arrow_forward
Help please. I will like if it is correct . otherwise thumb's down
arrow_forward
2. Subnetting a subnet or using variable-length subnet mask (VLSM) was designed to maximize addressing efficiency. You are required to subnet,
based on the number of hosts, including router interface and WAN interface and WAN connections for the following scenario:
•Toronto: 60 host addresses
•Montreal: 28 host addresses
•Ottawa: 12 host addresses
•Vancouver: 12 host addresses
•WAN1: 2 host addresses
•WAN2: 2 host addresses
•WAN3: 2 host addresses
Using the given address block of 192.168.15.0/24, you can design an address scheme for the network to meet its requirements and save potential
addresses. The data for Toronto is given to help you to fill the remaining all other columns.
Name
Toronto
Montreal
Ottawa
Vancouver
WAN1
WAN2
WAN3
Required no
of addresses
60
28
12
12
~~
2
2
2
Subnet Address
192.168.15.0
Address
Range
.1 - .62
Broadcast
Address
.63
Network/ Prefix
192.168.15.0 /26
19
arrow_forward
Network topology is a physical arrangement of the network.
a) Draw a diagranm that shows 6 nodes of computer in Ring topology.
b) Based on your answer in (a), what will be happen if all these 6 nodes of computers are
disconnected but are connected to ONE host computer?
arrow_forward
3.
15. An entry in the switching table of a virtual-circuit network is normally created during
the setup phase and deleted during the teardown phase. In other words, the entries in
this type of network reflect the current connections, the activity in the network. In
contrast, the entries in a routing table of a datagram network do not depend on the
current connections; they show the configuration of the network and how any packet
should be routed to a final destination. The entries may remain the same even if there is
no activity in the network. The routing tables, however, are updated if there are changes
in the network. Can you explain the reason for these two different characteristics? Can
we say that a virtual-circuit is a connection-oriented network and a datagram network is
a connectionless network because of the above characteristics?
arrow_forward
4. The original HTTP protocol used TCP/IP as the underlying protocol. For each
page, graphic, or applet, a separate TCP connection was constructed, used, and
terminated. This caused several problems: one referred to as the elephant and mice
problem and two aspects of connection overhead. Describe both problems. Why
were separate connections used? Would UDP rather than TCP be a good
alternative? What solution would you propose to these problems to improve HTTP
performance?
arrow_forward
Question::
dont dont post existing one strict warning skip if not known
A new architecture, with N layers, is proposed. User application at the top layer generates a message of M
bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes trailer.
In this architecture, the message M is not divided into smaller packets at any layer.
• What is the size of the final message (in bytes) transferred by the lower layer?
• If we consider the headers and trailers to be an overhead, what is the percentage of such overhead to
the total size of the final message?
arrow_forward
Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much
time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
arrow_forward
Urgent
arrow_forward
SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Related Questions
- One of the advantages of hierarchical routing (HR) is easier duty cycling because O Nodes battery replacement in flat routing in harder that HR O Nodes are rarely routers in HR than Flat routing O Nodes are more powerful in HR than Flat routing Nodes are more organized in HR than Flat routing O Node have longer hops in HR than in flat routingarrow_forwardPlease written by computer sourcearrow_forwardComputer networking subject rcs817arrow_forward
- Channel partitioning MAC protocols are: A. Efficient for low channel load since the delay is N/2, whereas N is the number of nodes. B. None is true. C. Efficient for low channel load since the delay is 1/N, whereas N is the number of nodes. D. Efficient for high channel load since the delay is N/2, whereas N is the number of nodes. E. Efficient for high channel load since the delay is 1/N, whereas N is the number of nodes.arrow_forwardA 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions: a. What is the minimum length of a contention slot in μsec? b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…arrow_forward4. The figure below shows a router connected to 4 devices. All devices, including the router, have transmission rates = 1 Mbits/s. The router can process the data instantaneously (processing delay= Os for all packets). The queue can hold a maximum of 10 Mbits at any given time, Note that all packets have to join the queue. The table in the figure shows the time at which packets are generated (in s), where they are generated, where they are going, and the size of each packet. R=1 Mbits/s B R = 1 Mbits/s A Router Queue Processing Delay = Os Transmission Rate = 1 Mbits/s C R = 1 Mbits/s Time (s) from to Size (Mbits) t=0 R = 1 Mbits/s t = 1 D t = 2 В t = 10 D BD ACBO 5 5 A 10 C 10 t = 11 A B 5arrow_forward
- Answer me fastvplzarrow_forwardClassless addressing is one of the solutions of address depletion problem in IP address space. 4-Dual stack transition strategy (from IP v4 to IPv6) is preferred when most internet devices and systems are moved to IPv6 while some systems still use IPv4. 5_In ARP, the ARP query is unicasted while ARP response is broadcasted through the network.arrow_forwardThe Transmission Control Protocol (TCP) is one of the core protocols of the Internet protocol suite (IP), and is so common that the entire suite is often called TCP/IP. A TCP connection is managed by an operating system through a programming interface that represents the local end-point for communications, the Internet socket. During the lifetime of a TCP connection the local end-point undergoes a series of state changes. These states are: (1) TCPEstablished: connection is on and ready for data transfer, (2) TCPCLosed, connection is off, and (3)TCPListen, TCP is listening for connection requests. The TCP Connection performs three operations, where the behavior of the operations changes as the state of the connection changes. These operations are: (1) open, (2) close, and (3) Acknowledge. What design pattern best suites your needs? 1. Chain of responsibility 2. Strategy 3. Command 4. Statearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning