Abstract:
Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the Interior Gateway Protocol (IGP) working group of the Internet Engineering Task Force (IETF). design an IGP based on the Shortest Path First (SPF) algorithm for use in the Internet. Similar to the Interior Gateway Routing Protocol (IGRP), Routing Information Protocol (RIP) was increasingly incapable of serving large, heterogeneous internetworks ....etc

[:=Read Full Message Here=:]

161/2014
Maximum : 100 marks
Time : 1 hour and 15 minutes

1.Which constituent in the earth gives plasticity to mould bricks?
(A)Lime
(B)Magnesia
(C ) Silica ’
(D) Alumina

2.The distance from the optical centre to the principle focus of a lens :
(A)Radius of curvature
(B)Focal length
(C )Focus
(D)None of these

3.The study of static electricity ;
(A)Electronics
(C )Electrostatic
(B)Electrostatic Field 
(D)Electron gravity

4.In optical systems, the lens of system of lenses closest to the observer� ....etc

[:=Read Full Message Here=:]

PROGRAM TO FIND THE SUM OF ARRAY USING RECURSION ....etc

[:=Read Full Message Here=:]

needs one source code shortest remaining time in C/C++
thanks ....etc

[:=Read Full Message Here=:]

import java.io.*;
class Arraysum
{
int temp;
int sum(int a,int n)
{
if(n==1)
return a;
else
{
temp =sum(a,n-1);
temp=temp+a;
return temp;
}
}
}
class Newarray
{
public static void main(String args)throws IOException
{
DataInputStream dis=new DataInputStream(System.in);
System.out.println(Enter limit);
int n=Integer.parseInt(dis.readLine());
int a=new int;
System.out.println(Enter the array);


fo ....etc

[:=Read Full Message Here=:]

I need the documention of two techniques for fast computation of constrained shortest path ....etc

[:=Read Full Message Here=:]

Combining Breadth-First and Depth-First Strategies in Searching for Treewidth

Rong Zhou
Palo Alto Research Center
3333 Coyote Hill Road
Palo Alto, CA 94304


Eric A. Hansen
Dept. of Computer Science and Engineering
Mississippi State University
Mississippi State, MS 39762

Abstract Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combi ....etc

[:=Read Full Message Here=:]

I hv tu give a seminar for the first time in colg. so i m trying to give a perfect so that i could hv a good memory for the next seminar ....etc

[:=Read Full Message Here=:]

A ROBUST UART ARCHITECTURE BASED ON RECURSIVE RUNNING SUM FILTER FOR BETTER NOISE PERFORMANCE
Universal Asynchronous Receiver Transmitter (UART) based on Recursive Running Sum (RRS) filter. UART is used for asynchronous serial data communication between remote embedded systems. The robust UART core used in this project, utilizes recursive running sum filter to remove noisy samples. Input data signal is directly sampled with system clock and samples are accumulated over a window size . The window size is user programmable and it should be set ....etc

[:=Read Full Message Here=:]

plz guys, anyone having uart ppt......forward that meatirial ....etc

[:=Read Full Message Here=:]