answersLogoWhite

Top Answer
User Avatar
Wiki User
Answered 2010-06-10 03:40:25

Rip V1 is Classful routing protocol

Rip V2 is Classless routing Protocol

001
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
๐Ÿ˜‚
0
User Avatar

Your Answer

Related Questions


Particulars RIP V1 RIP V2 VLSM Support NO Route Propogation Mechanism Broadcast (255.255.255.255 ) Multicast (224.0.0.9) Authentication Mechanism No Yes ( Text & MD5 )----RIP V1-----> Classful routing protocol.RIP V2-----> Classless routing protocol.-----------------------------------------------------RIP V1------> Subnet masks are NOT included in the routing update.RIP V2------> Subnet masks are included in the routing update.-----------------------------------------------------RIP V2 is actually an enhancement of RIP V1's features and extensions raether than an entirely new protocol.



The most common multi output systems are used for getting differential output. i.e., if V1 and V2 are the 2 outputs, then usually the difference, V2-V1 or V1-V2 is used.


RIP v2 supports subnets of different sizes. So I guess it would be the router that can, or can not, be configured to summarize routes. (This would not be possible in RIP v1; the size of the subnet is implicit, it is not sent with the routing updates.)RIP v2 supports subnets of different sizes. So I guess it would be the router that can, or can not, be configured to summarize routes. (This would not be possible in RIP v1; the size of the subnet is implicit, it is not sent with the routing updates.)RIP v2 supports subnets of different sizes. So I guess it would be the router that can, or can not, be configured to summarize routes. (This would not be possible in RIP v1; the size of the subnet is implicit, it is not sent with the routing updates.)RIP v2 supports subnets of different sizes. So I guess it would be the router that can, or can not, be configured to summarize routes. (This would not be possible in RIP v1; the size of the subnet is implicit, it is not sent with the routing updates.)


v1 = initial velocity v2 = final velocity


v1 is design speed and v2 rotation speed


[ ((v2 - v1) / |v1|) * 100 ]



Let t1 and t2 be the times for the two stages. Then t1 = x/v1 and t2 = x/v2 Total distance = x + x = 2x Total time = t1 + t2 = x/v1 + x/v2 = x*(1/v1 + 1/v2) Average velocity = total distance / total time = 2x divided by x/(1/v1 + 1/v2) = 2(1/v1 + 1/v2) which is the Harmonic mean of v1 and v2.


Electrically, V2-V1 (volts) where V2 and V1 are the electrical potentials at different points. Mechanically, mg(y2-y1) where m is mass, g is acceleration due to gravity, y =vertical position.


T1 V2 / V1 = T2 V1 / V1 ..not sure though?


Charles' Law: V1/T1 = V2/T2 or V2/V1 = T2/T1 This signifies a direct relationship between temperature and volume when all other variables are held constant.


5 * 10**-12 mol 32 * 10**-9 mol Concentration (M) * Volume (L) = mols C1*V1=C2*V2 (5*10**-12)*V1=(32*10**-9)*V2 (5*10**-12)*V1/(32*10**-9)=V2 (5*10**-3)*V1/32=V2 The volume of the 5 picomolar solution that you wish take = V1 The volume of the 32 nanomolar solution that you need to make V1 at 5pM concentration = V2 Take V2, and place into graduated cylinder and fill to V1.



From figure V1T = V1 sin θ1, V2T = V2 sin θ2 But V1T = V2T V1 sin θ1 = V2 sin θ2 Or V2/V1 = sin θ1 / sin θ2


the V2 rocket was bigger and faster than the V1 flying bomb. the V1 being a flying bomb was smaller and had a pulse jet engine and the V2 which was a rocket had a bigger rocket engine. ACTUAL SIZE COMPARISON: V1: Length: 25' 4" wingspan: 8.32 meters V2: length 14 m (45 ft 11 in)


The volume of a cylinder is:V1 = pi r2 hV2 = pi (2r)2 2h = pi 4r2 2h = 8pi r2 hV1/V2 = (pi r2 h)/(8 pi r2 h)V1/V2 = 1/8Thus, V2 is 8 times bigger than V1.


#include <stdio.h> #include <conio.h> #include <alloc.h> #define TRUE 1 #define FALSE 0 #define MAX 8 struct node { int data ; struct node *next ; } ; int visited[MAX] ; int q[8] ; int front, rear ; void bfs ( int, struct node ** ) ; struct node * getnode_write ( int ) ; void addqueue ( int ) ; int deletequeue( ) ; int isempty( ) ; void del ( struct node * ) ; void main( ) { struct node *arr[MAX] ; struct node *v1, *v2, *v3, *v4 ; int i ; clrscr( ) ; v1 = getnode_write ( 2 ) ; arr[0] = v1 ; v1 -> next = v2 = getnode_write ( 3 ) ; v2 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[1] = v1 ; v1 -> next = v2 = getnode_write ( 4 ) ; v2 -> next = v3 = getnode_write ( 5 ) ; v3 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[2] = v1 ; v1 -> next = v2 = getnode_write ( 6 ) ; v2 -> next = v3 = getnode_write ( 7 ) ; v3 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[3] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[4] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[5] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[6] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 4 ) ; arr[7] = v1 ; v1 -> next = v2 = getnode_write ( 5 ) ; v2 -> next = v3 = getnode_write ( 6 ) ; v3 -> next = v4 = getnode_write ( 7 ) ; v4 -> next = NULL ; front = rear = -1 ; bfs ( 1, arr ) ; for ( i = 0 ; i < MAX ; i++ ) del ( arr[i] ) ; getch( ) ; } void bfs ( int v, struct node **p ) { struct node *u ; visited[v - 1] = TRUE ; printf ( "%d\t", v ) ; addqueue ( v ) ; while ( isempty( ) -1 ) return TRUE ; return FALSE ; } void del ( struct node *n ) { struct node *temp ; while ( n != NULL ) { temp = n -> next ; free ( n ) ; n = temp ; } }


#include <stdio.h> #include <conio.h> #include <malloc.h> #define TRUE 1 #define FALSE 0 #define MAX 8 struct node { int data ; struct node *next ; } ; int visited[MAX] ; int q[8] ; int front, rear ; void bfs ( int, struct node ** ) ; struct node * getnode_write ( int ) ; void addqueue ( int ) ; int deletequeue( ) ; int isempty( ) ; void del ( struct node * ) ; int main( ) { struct node *arr[MAX] ; struct node *v1, *v2, *v3, *v4 ; int i ; v1 = getnode_write ( 2 ) ; arr[0] = v1 ; v1 -> next = v2 = getnode_write ( 3 ) ; v2 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[1] = v1 ; v1 -> next = v2 = getnode_write ( 4 ) ; v2 -> next = v3 = getnode_write ( 5 ) ; v3 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[2] = v1 ; v1 -> next = v2 = getnode_write ( 6 ) ; v2 -> next = v3 = getnode_write ( 7 ) ; v3 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[3] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[4] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[5] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[6] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 4 ) ; arr[7] = v1 ; v1 -> next = v2 = getnode_write ( 5 ) ; v2 -> next = v3 = getnode_write ( 6 ) ; v3 -> next = v4 = getnode_write ( 7 ) ; v4 -> next = NULL ; front = rear = -1 ; bfs ( 1, arr ) ; for ( i = 0 ; i < MAX ; i++ ) del ( arr[i] ) ; getch( ) ; return 0; } void bfs ( int v, struct node **p ) { struct node *u ; visited[v - 1] = TRUE ; printf ( "%d\t", v ) ; addqueue ( v ) ; while ( isempty( ) -1 ) return TRUE ; return FALSE ; } void del ( struct node *n ) { struct node *temp ; while ( n != NULL ) { temp = n -> next ; free ( n ) ; n = temp ; } }


N1*V1 = N2*V2 (where N1 & N2 are the normality of respective acid or base while V1 & V2 is their respective volume).


Two vectors; V1 + V2=0 where V1= -V2, two opposite vectors.


SR={((V1-V2)/V2)*100}/(W1-W2) where,SR=srinkage ratio v1=initial volume v2=final w1=initial moisture content w2-final


The cube with twice the width has 8 times the volume of the first cube. Lets say Cube1 has width A lets say Cube2 has width 2*A so V1 = A cubed V2 = (2*A) cubed so A = the cubed root of V1 so V2 = (2 * (the cubed root of V1)) cubed so V2 = 2 cubed * V1 so V2 = 8 * V1


• Array is the set of an multiple values where as variable can store single value at a time.• The difference between the definition of array and ordinary variable is the, array is always declared, initialized, and accessed using subscript whereas ordinary variable do not have any subscript.• The syntax for ordinary variable definition is data_type v1, v2, ….;• And the syntax for array variable is data_type v1[N1],v2[N2],…; where v1,v2 are name of variable and N1, N2 are the integer constants indicating the maximum size of array.


It describe the relationship of Pressure and volume >> P1 V1 = P2 V2



Copyright ยฉ 2021 Multiply Media, LLC. All Rights Reserved. The material on this site can not be reproduced, distributed, transmitted, cached or otherwise used, except with prior written permission of Multiply.