Solved MCQ of CS610 Computer Network Midterm Past Examination
MIDTERM EXAMINATION
Spring 2010
CS610- Computer Network
Spring 2010
CS610- Computer Network
In Point-to-Point topology there are two topologies.
► Tree and Ring ► Star and Ring ► Star and Tree ► None of the given
InPoint-to-Point topology there are two topologies.
1) STAR topology
2) TREE topology
------ Program sends a message to a remote computer and reports whether the computer responds.
►
------ has no way to determine the cause of the problem.
► ICMP ► Ping ► Trace route ► Non of the given
The term----- ------- refers to the general concept of a small block of data
► Packet ► Frame ► Data ► None of the given
Packet is a generic term that refers to small block of data. Packet have different format. Each hardware uses different packet format.
---------- scheme, which is designed to help detect transmissions errors, send one extra bit of information with each character
► Parity ► Checksums ► CRC ► None of given
A parity scheme, which is designed to help detect transmission errors, sends one extra hit of information with each character. Although it allows receiver to determine if a single bit has been changed parity can not detect transmission errors that change an even number of bits.
Local Talk is a LAN technology that employs -------------
► Bus topology ► Ring topology ► Star topology ► None of the given
LOCAL TALK:
Apple invented the LAN technology that uses bus topology. Its interface is included with all Macintosh computers.
Most LANs that employ ring topology use an access mechanism known as-------
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
Most LANs that employ ring topology use an access mechanism known as-------
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
Most LANs that employ ring technology use an access mechanism known as token passing. A token ring operates as a single, shared medium. When a computer wants to send data, it must wait until it obtains the token, when it is in control of the ring
Ethernet uses a ------ bit static addressing scheme in which each device is assigned a unique address by the manufacturer.
► 64 ► 48 ► 32 ► 8
Ethernet uses a 48-bit static addressing scheme
Formally named __________ informally known as the thick wire Ethernet or Thick net.
► 10 Base 2 ► 10 Base 5 ► 10 Base T ► None of the given
Ethernet uses a ------ bit static addressing scheme in which each device is assigned a unique address by the manufacturer.
► 64 ► 48 ► 32 ► 8
Ethernet uses a 48-bit static addressing scheme
Formally named __________ informally known as the thick wire Ethernet or Thick net.
► 10 Base 2 ► 10 Base 5 ► 10 Base T ► None of the given
Thick Ethernet Wiring informally called thick wire Ethernet or Thick net
Formally named __________ informally known as the twisted pair Ethernet or TP Ethernet.
► 10 Base 2 ► 10 Base 5 ► 10 Base T ► None of the given
twisted pair ethernet
- Formally called 10 Base –T
- Also twisted pair Ethernet or simply TP Ethernet
The maximum size of an Ethernet segment is___________
► 250 meters ► 500 meters ► 700 meters ► None of the given
One Ethernet cable is sometimes called a segment. This segment is limited to 500 meters in length. The minimum separation between connections is 3 meters. (P# 27)
A Bridge can ________
► Filter a frame ► Forward a frame ► Extend a LAN ► Do all the above
A bridge is a hardware device also used to connect two LAN segments to extend a LAN. It listens to all traffic and recognizes frame format. It also forwards only correct complete frames and discards the collided and error frames.
► Filter a frame ► Forward a frame ► Extend a LAN ► Do all the above
A bridge is a hardware device also used to connect two LAN segments to extend a LAN. It listens to all traffic and recognizes frame format. It also forwards only correct complete frames and discards the collided and error frames.
The most important task a bridge performs is frame filtering.
_______ computes shortest paths in a graph by using weights on edges as a measure of distance.
► Greedy algorithm ► Distance vector algorithm ► Dijksta’s algorithm ► Non of the given
Dijkstras algorithm computes shortest paths in a graph by using weights on edg as a measure of distance. A path with the fewest number of edges may not be the path with least weight. (P# 173 e-books)
_______ computes shortest paths in a graph by using weights on edges as a measure of distance.
► Greedy algorithm ► Distance vector algorithm ► Dijksta’s algorithm ► Non of the given
Dijkstras algorithm computes shortest paths in a graph by using weights on edg as a measure of distance. A path with the fewest number of edges may not be the path with least weight. (P# 173 e-books)
__________is used for compressed audio and video where the data rate depends on the level of compression that can be achieved.
► Constant Bit Rate (CBR) service ► Variable Bit Rate (VBR) service
► Available Bit Rate (ABR) service ► None of the given
VARIABLE BIT RATE (VBR):
► Constant Bit Rate (CBR) service ► Variable Bit Rate (VBR) service
► Available Bit Rate (ABR) service ► None of the given
VARIABLE BIT RATE (VBR):
It is used for compressed audio and video where the data rate depends on the level of compression that can be achieved.
Basic LAN technologies such as Ethernet, Token Ring, and FDDI use a _____.
► Connectionless service paradigm ► Connection-oriented service paradigm
► Both Connectionless and Connection-oriented service paradigm
► None of the given
The product of delay and throughput measures the _____ of data that can be present on the network.
► Area ► Volume ► Length ► None of the given
Basic LAN technologies such as Ethernet, Token Ring, and FDDI use a _____.
► Connectionless service paradigm ► Connection-oriented service paradigm
► Both Connectionless and Connection-oriented service paradigm
► None of the given
The product of delay and throughput measures the _____ of data that can be present on the network.
► Area ► Volume ► Length ► None of the given
DELAY THROUPUT PRODUCT:
It is computed as delay time multiplied by effective throughput. It measures
amount of data that can be present in the network (P# 80)
A network with throughput T and delay D has a total of ________ bit in transit at any time.
► T / D ► T x D ► T + D ► None of the given
A network with throughput T and delay D has a total of T x D bits in transit at
any time. (e-books)
A network with throughput T and delay D has a total of ________ bit in transit at any time.
► T / D ► T x D ► T + D ► None of the given
A network with throughput T and delay D has a total of T x D bits in transit at
any time. (e-books)
One repeater _______, two repeaters ________ the maximum cable length limitation.
► doubles, triple ► square roots, cude roots ► and, triple ► doubles, cancel
One repeater doubles, two repeaters triple the maximum cable length limitation. (P# 49)
A network uses a ------ if all computers attach to a central point
► Star Topology ► Ring Topology ► Bus Topology ► None of the given
STAR TOPOLOGY:
In this topology, all computers are attached to a central point, which is sometimes called the “Hub” (P# 25)
Computers attached to an ethernet use ------ in which a computer waits for the other to be idle before transmitting a frame.
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
Computers attached to an ethernet use ------ in which a computer waits for the other to be idle before transmitting a frame.
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
All computers attached to the Ethernet use CSMA/CD to co-ordinate their activities. A computer wishing to transmit checks for electrical activity on the cable, informally called a carrier. If there is no carrier, the computer can transmit. If a carrier is present, the computer waits for the sender to finish before proceeding.
Question No: 21 ( Marks: 2 )
What is the difference between LAN and WAN?
Question No: 22 ( Marks: 2 )
Define the term Jitter.
What is the difference between LAN and WAN?
Question No: 22 ( Marks: 2 )
Define the term Jitter.
Question No: 23 ( Marks: 3 )
GIve a comparision of wiring Schemes.
Question No: 24 ( Marks: 3 )
How can Switched Virtual Network be established?
Question No: 25 ( Marks: 5 )
Describe permanent virtual circuits (PVC).
Mid Term Examination
CS 610 (Computer networks)
No error detection scheme is perfect because transmission errors can affect the additional information as well as the data.
► True ► False
------ Program sends a message to a remote computer and reports whether the computer responds.
► Ping ► Traceroute ► ICMP ► Non of the given
---------- was especially concerned about the lack of high powered computers.
► ARPA ► IEEE ► EIA ► Non of the given
The term -------- is used to denote the definition of a packet used with a specific type of network.
► Packet ► Frame ► Data ► None of the given
Computer networks are often called -------------- because they use packet technology.
► Ethernet ► Switch networks ► Packet networks ► None of the given
-------------- have advantages arisen from the size and ease of computation.
► CRC ► Parity ► Checksums ► None of given
Most LANs that employ ring topology use an access mechanism known as-------
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
IEEE LLC/SNAP header is --------, which is used to specify the type of data.
► 8 octets ► 8 bytes ► 8 bits ► None of the given
Formally named __________ informally known as the twisted pair Ethernet or TP Ethernet.
► 10 Base 2 ► 10 Base 5 ► 10 Base T ► None of the given
twisted pair ethernet
· Formally called 10 Base –T
· Also twisted pair Ethernet or simply TP Ethernet
An interface for twisted pair Ethernet must have an ____________ connector , and must generate signals according to the_____________ specification.
► RJ-45, 10 Base T ► RJ-45, 10 Base 5 ► BNC, 10 Base 2 ► BNC, 10 Base T
A bridges function in the _________ layers(s).
► Physical (MAC) ► Data link ► Network ► Physical (MAC) and Data link
A Bridge can ________
► Filter a frame ► Forward a frame ► Extend a LAN ► Do all the above
A Bridge forwards or filters a frame by comparing the information in its address table to the frame’s__________
► Layer 2 source address ► Source node’s physical address
► Layer 2 destination address ► Layer 3 destination address
________ computes shortest paths in a graph by using weights on edges as a measure of distance.
► Greedy algorithm ► Distance vector algorithm ► Dijksta’s algorithm
► Non of the given
___________ is used for audio and video, since these have predefined maximum data rates
► Constant Bit Rate (CBR) service ► Variable Bit Rate (VBR) service
► Available Bit Rate (ABR) service ► None of the given
Unlike Frame Relay and ATM, SMDS (Switched multi-megabit Data service) offers_______ .
► Connectionless service paradigm ► Connection oriented service paradigm
► Both Connectionless and Connection-oriented service paradigm ► None of the given
A network with throughput T and delay D has a total of ________ bit in transit at any time.
► T / D ► T x D ► T + D ► None of the given
ATM is designed to work on___________.
► Twisted Pair ► Coaxial ► Radio Frequency ► Fiber
ATM is designed to work on fiber (but can be used with a twisted pair). (P# 72)
Computers attached to an ethernet use ------ in which a computer waits for the ether to be idle before transmitting a frame.
► CSMA/CD ► CSMA/CA ► TOKEN PASSING ► None of the given
FDDI can transmits data at a rate of ----------
► 100 million bits per second
► 10 million bits per second ► 1000 million bits per second ► None of the given
FDDI: Fiber distributed data interconnect (FDDI) is another ring technology. Its most important features are: It uses fiber optics between stations and transmits data at 100Mbps.
No comments: