Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Notes  >  Computer Networks  >  Important Questions & Answers: Routing

Important Questions & Answers: Routing | Computer Networks - Computer Science Engineering (CSE) PDF Download


1. Define packet switching?
A packet switch is a device with several inputs and outputs leading to and from the hosts that the switch interconnects.

2. What is a virtual circuit?
A logical circuit made between the sending and receiving computers. The connection is made after both computers do handshaking. After the connection, all packets follow the same route and arrive in sequence.

3. What are data grams?
In datagram approach, each packet is treated independently from all others. Even when one packet represents just a place of a multi packet transmission, the network treats it although it existed alone. Packets in this technology are referred to as datagram.

4. What is meant by switched virtual circuit?
Switched virtual circuit format is comparable conceptually to dial-up line in circuit switching. In this method, a virtual circuit is created whenever it is needed and exits only for the duration of specific exchange.

5. What is meant by Permanent virtual circuit?
Permanent virtual circuits are comparable to leased lines in circuit switching. In this method, the same virtual circuit is provided between two uses on a continuous basis. The circuit is dedicated to the specific uses.

6. What are the properties in star topology?
Even though a switch has a fixed number of inputs and outputs, which limits the number of hosts that can be connected to a single switch , large networks can be built by interconnecting a number of switches.
  • We can connect switches to each other and to hosts using point-to point links, which typically means that we can build networks of large geographic scope.


7. What is VCI?
A Virtual Circuit Identifier that uniquely identifies the connection at this switch, and which will be carried inside the header of the packets that belongs to this connection.

8. What is hop-by-hop flow control?
Each node is ensured of having the buffers it needs to queue the packets that arrive on that circuit. This basic strategy is usually called hop-by-hop flow control.

9. Explain the term best-effort?
If something goes wrong and the packet gets lost, corrupted, misdelivered, or in any way fails to reach its intended destination, the network does nothing.

10. What is maximum transmission unit?
MTU- which is the largest IP datagram that it can carry in a frame .

11. Define Routing?
It is the process of building up the tables that allow thwe collect output for a packet to be determined.

12. Define ICMP?
Internet Control Message Protocol is a collection of error messages that are sent back to the source host whenever a router or host is unable to process an IP datagram successfully

13. Write the keys for understanding the distance vector routing?
The three keys for understanding the algorithm are,

  • Knowledge about the whole networks
  • Routing only to neighbors
  • Information sharing at regular intervals


14.Write the keys for understanding the link state routing?
The three keys for understanding the algorithm are,

  • Knowledge about the neighborhood.
  • Routing to all neighbors.
  • Information sharing when there is a range.


15. How the packet cost referred in distance vector and link state routing?
In distance vector routing, cost refer to hop count while in case of link state routing, cost is a weighted value based on a variety of factors such as security levels, traffic or the state of the link.

16. Define Reliable flooding?
It is the process of making sure that all the nodes participating in the routing protocol get a copy of the link state information from all the other nodes.

17.What are the features in OSPF?

  • Authentication of routing messages.
  • Additional hierarchy.
  • Load balancing.


18.Define Subnetting?

Subnetting provides an elegantly simple way to reduce the total number of network numbers that are assigned. The idea is to take a single IP network number and allocate the IP address with that network to several physical networks, which are now referred to as subnets.

19.What are the different types of AS?

  • Stub AS
  • Multi homed AS
  • Transit AS


20.What is an Area?
An Area is a set of routers that are administratively configured to exchange link-state information with each other. There is one special area- the backbone area, also known as area 0.

21. What is Source Specific Multicast?
SSM , a receiving host specifies both a multicast group and a specific host .the receiving host would then receive multicast addressed to the specified group, but only if they are from the special sender.

22. What is meant by congestion?
Congestion in a network occurs if user sends data into the network at a rate greater than that allowed by network resources.

23. Why the congestion occurs in network?
Congestion occurs because the switches in a network have a limited buffer size to store arrived packets.

24. What are the rules of non boundary-level masking?

  • The bytes in the IP address that corresponds to 255 in the mask will be repeated in the sub network address
  • The bytes in the IP address that corresponds to 0 in the mask will change to 0 in the sub network address
  • For other bytes, use the bit-wise AND operator.

25.What is LSP?
In link state routing, a small packet containing routing information sent by a router to all other router by a packet called link state packet.

The document Important Questions & Answers: Routing | Computer Networks - Computer Science Engineering (CSE) is a part of the Computer Science Engineering (CSE) Course Computer Networks.
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)
21 videos|113 docs|66 tests

Top Courses for Computer Science Engineering (CSE)

FAQs on Important Questions & Answers: Routing - Computer Networks - Computer Science Engineering (CSE)

1. What is routing in computer science engineering (CSE)?
Ans. Routing in computer science engineering (CSE) refers to the process of selecting a path for network traffic to travel from one network node to another. It involves determining the most efficient route based on factors such as network congestion, link quality, and distance.
2. What are the different types of routing algorithms used in CSE?
Ans. There are several types of routing algorithms used in CSE, including: - Distance Vector Routing: This algorithm calculates the distance to all reachable destinations and selects the shortest path. - Link State Routing: In this algorithm, each router maintains a map of the entire network and uses this information to determine the best path. - Path Vector Routing: This algorithm is commonly used in large-scale networks and is similar to distance vector routing, but it also includes information about the entire path taken. - Hierarchical Routing: This algorithm divides the network into smaller subnetworks, reducing the complexity of routing. - Adaptive Routing: Adaptive routing algorithms dynamically adjust the routing paths based on changing network conditions.
3. What is the role of routing tables in CSE?
Ans. Routing tables play a crucial role in CSE. They are data structures stored in routers that contain information about the network topology and the best paths to reach different destinations. The routing table is used by routers to make routing decisions and determine the next hop for forwarding network traffic.
4. What is dynamic routing in CSE?
Ans. Dynamic routing in CSE refers to the process of automatically updating routing tables based on real-time changes in the network. This is achieved through the use of routing protocols that exchange information between routers and adapt to network changes. Dynamic routing enables efficient routing in large and dynamic networks by automatically adjusting the routing paths as network conditions change.
5. What are some common challenges in routing for computer science engineering (CSE)?
Ans. Some common challenges in routing for CSE include: - Scalability: Routing algorithms need to handle large-scale networks efficiently and effectively. - Congestion: Routing protocols should consider network congestion to avoid overloaded links and ensure optimal traffic flow. - Security: Routing protocols need to be secure against attacks, as malicious actors can manipulate routing information and disrupt network operations. - Quality of Service (QoS): Routing should consider QoS requirements, such as ensuring low latency or high bandwidth for specific types of traffic. - Fault tolerance: Routing algorithms should be resilient to failures and able to quickly reroute traffic in the event of link or node failures.
21 videos|113 docs|66 tests
Download as PDF
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

past year papers

,

Important Questions & Answers: Routing | Computer Networks - Computer Science Engineering (CSE)

,

video lectures

,

shortcuts and tricks

,

Sample Paper

,

mock tests for examination

,

Viva Questions

,

Important Questions & Answers: Routing | Computer Networks - Computer Science Engineering (CSE)

,

Semester Notes

,

Important questions

,

practice quizzes

,

pdf

,

Summary

,

Previous Year Questions with Solutions

,

MCQs

,

ppt

,

Extra Questions

,

Important Questions & Answers: Routing | Computer Networks - Computer Science Engineering (CSE)

,

Objective type Questions

,

Free

,

study material

,

Exam

;