CS610 Assignment No 02 Solution & Discussion Due Date: Dec 02, 2016

[+M.Tariq Malik]

CS610 Assignment No 02 Solution & Discussion Due Date: Dec 02, 2016

CS610 - Computer Network Assignment No. 2 Solution Fall 2016 Due Date: Dec 02, 2016 

	Assignment No. 02 Semester: Fall 2016 CS610 –Computer Networks		Total Marks: 20   Due Date: 02-12-2016
Assignment Objective: To know about Packet Switching which are used for routing To know about how routing tables are formed To know about how next hops can be calculated. Uploading instructions: Your assignment must be in .doc format (Any other formats like scan images, PDF, bmp, etc will not be accepted). Save your assignment with your ID (e.g. bc020200786.doc). No assignment will be accepted through email. Rules for Marking:   It should be clear that your assignment will not get any credit if: The assignment is submitted after due date. The submitted assignment does not open or file is corrupted. Your assignment is copied from internet, handouts or from any other student       (Strict disciplinary action will be taken in this case).
Assignment
Problem Statement:                                                                                                                             Consider the following graph showing switches as nodes with edges.                             a)      Give the routing table for all 4 switches containing information of destination and next hop.   [Marks: 10] b)      Give routing table with default routes for the above scenario.                                                     [Marks: 10]         Sample Tables:   Node 1 Node2 Node3 Node4   Destination Next Hop Destination Next Hop Destination Next Hop Destination Next Hop                                                                   Default Routes:   Node 1 Node2 Node3 Node4   Destination Next Hop Destination Next Hop Destination Next Hop Destination Next Hop
Deadline: Your assignment must be submitted on or before 02-12-2016

 

 

[+M.Tariq Malik]

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•. 

[Mian Chand]

[Dr. Ghulam Hussain]

It is in Lecture No.16

[Sardar Shahid]

please share solved assignment.

[+M.Tariq Malik]

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

[Wasfa Baig (MIT 4th)]

Solution-1:

Route Table:

Node 1		Node2		Node3		Node4
Destination	Next Hop	Destination	Next Hop	Destination	Next Hop	Destination	Next Hop
1	-	1	(2,1)	1	(3,1)	1	(4,3)
2	(1,2)	2	-	2	(3,1)	2	(4,3)
3	(1,3)	3	(2,1)	3	-	3	(4,3)
4	(1,3)	4	(2,1)	4	(3,4)	4	-

 

Solution-2:

Default Table:

 

Node 1		Node2		Node3		Node4
Destination	Next Hop	Destination	Next Hop	Destination	Next Hop	Destination	Next Hop
1	-	2	-	3	-	4	-
2	(1,2)	*	(2,1)	4	(3,4)	*	(4,3)
*	(1,3)			*	(3,1)

 

Hey chk it... is this corrct r not>>

[Bilal javaid]

Route table mein NODE 2 Destination 4 mein i think (1,3) aye ga

[Ayeeza]

No she is right .... (2,1 ) hi aye ga (1,3) ni

[Ayeeza]

i have submitted my assignment .... you can solve this assignment easily by taking lecture 16.

[shono pari]

(1,3) aye ga qk 1 tu direct 3 say attach hai

[Wasfa Baig (MIT 4th)]

ni pari... hm node 2 ko dekh re hn.. beshhk 1 n 3 se r 3 4 se attach hn.. bt link hm ne 2 ka chk krna ha, wo 1 k sth ho ra ha  r phr 3 k sth.. r phr 3  4 k sth

so node 2 k destination 4 k liye hm (2,1) kren ge. bcz 2 one k sth link kr ra ha r 1 3 k n 3  4 k sth.

[Nosheen Khalid]

is this solution is correct.......????