<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[CS432 Assignment 3 Solution and Discussion]]></title><description><![CDATA[<pre><code>Assignment No. 03
</code></pre>
<p dir="auto">Semester: Fall 2019<br />
CS432 –Network modeling and simulation	Total Marks: 20</p>
<p dir="auto">Due Date: 22 Jan, 2020<br />
Assignment Objective:</p>
<p dir="auto">•	To enhance the leaning capability of the students by using “Built-in Package/ Framework and Routing Protocols”</p>
<p dir="auto">Uploading Instructions:</p>
<p dir="auto">•	Your assignment must be in .doc format (Any other formats like scan images, PDF, bmp, etc will not be accepted).<br />
•	Save your assignment with your ID (e.g. bc020200786.doc).<br />
•	No assignment will be accepted through email.</p>
<p dir="auto">Rules for Marking:</p>
<p dir="auto">It should be clear that your assignment will not get any credit if:</p>
<p dir="auto">•	The assignment is submitted after due date.<br />
•	The submitted assignment does not open or file is corrupted.<br />
•	Your assignment is copied from internet, handouts or from any other student. Strict disciplinary action will be taken in this case.</p>
<p dir="auto">Assignment</p>
<p dir="auto">Question No. 1                                                                                                                                   [Marks: 10]</p>
<p dir="auto">Network can be represent via graph G by considering the network devices like routers as nodes N and links as edges E i.e. G=(N, E) shown in the following figure.<br />
<img src="https://i.imgur.com/274Uf5X.png" alt="a0f35f16-3ca5-409d-bce8-af592e923e93-image.png" class=" img-fluid img-markdown" /></p>
<p dir="auto">You are required to provide solution for the following tasks:</p>
<ol>
<li>Set of all nodes.</li>
<li>Set of all links or edges.</li>
<li>Shortest path from A to D.</li>
<li>Longest path from A to D with no cycle.</li>
</ol>
<p dir="auto">Question No. 2                                                                                                                                         [Marks: 10]</p>
<p dir="auto">a.	Which built-in module is used for routing in OMNeT++?  Also import this module in existing projects of OMNeT++ by providing step by step detail of all the procedures.</p>
<p dir="auto">b.	Run any built-in example of routing algorithm by providing the screen shot.</p>
<p dir="auto">Deadline: Your assignment must be uploaded/submitted on or before  22 Jan 2020</p>
]]></description><link>https://community.secnto.com//topic/1141/cs432-assignment-3-solution-and-discussion</link><generator>RSS for Node</generator><lastBuildDate>Tue, 09 Jun 2026 01:19:21 GMT</lastBuildDate><atom:link href="https://community.secnto.com//topic/1141.rss" rel="self" type="application/rss+xml"/><pubDate>Wed, 22 Jan 2020 12:28:17 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to CS432 Assignment 3 Solution and Discussion on Wed, 28 Jul 2021 15:54:33 GMT]]></title><description><![CDATA[<p dir="auto">ap k pas latest assgniment pas ha cs 432 ki aj xtended date ha plz help for cs subject</p>
]]></description><link>https://community.secnto.com//post/6815</link><guid isPermaLink="true">https://community.secnto.com//post/6815</guid><dc:creator><![CDATA[Aoune Ahmad]]></dc:creator><pubDate>Wed, 28 Jul 2021 15:54:33 GMT</pubDate></item></channel></rss>