#Create a simulator object set ns [new Simulator] #Open a nam trace file set nf [open PING.nam w] $ns namtrace-all $nf #Open a trace file set nt [open PING.tr w]…
#Create a simulator object set ns [new Simulator] #Open a trace file set nt [open lab1.tr w] $ns trace-all $nt #Open a nam trace file set nf [open lab1.nam W]…
Traveling Salesperson problem:Given n cities, a salesperson starts at a specified city (source), visit all n-1 cities only once and return tio the the city from where he has started.…
Depth First Search:Depth-first search starts visiting vertices of a graph at an arbitrary vertex by marking it as having been visited. On each iteration, the algorithm proceeds to an unvisited…
Breadth First Search:BFS explores graph moving across to all the neighbors of last visited vertex traversals i.e., it proceeds in a concentric manner by visiting all the vertices that are…
Kruskal’s algorithm:Kruskal‟s algorithm finds the minimum spanning tree for a weighted connected graph G=(V,E) to get an acyclic subgraph with |V|-1 edges for which the sum of edge weights is…
Single Source Shortest Paths Problem:For a given vertex called the source in a weighted connected graph, find the shortest paths to all its other vertices. Dijkstra‟s algorithm is the best…
#Create a simulator object set ns [new Simulator] #Open a nam trace file set nf [open PING.nam w] $ns namtrace-all $nf #Open a trace file set nt [open PING.tr w]…
#Create a simulator object set ns [new Simulator] #Open a trace file set nt [open lab1.tr w] $ns trace-all $nt #Open a nam trace file set …
import java.util.*; import java.net.*; import java.io.*; public class udpserver { public static void main(String args[]) { DatagramSocket aSocket=null; Scanner scan=new Scanner(System.in); int ServerPort=999; System.out.println("Server ready n Waiting for connectionn"); try…