Programming and Data Structures (Test 1)

a = b + c 

c = a + d 

d = b + c 

e = d - b 

a = e + b

The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are

For each IP address in Group I identify the correct choice of the next hop from Group II using the entries from the routing table above. 

The following is comment written for a C function

/* This function computes the roots of a quadratic equation

a.x^2+b.x+c=0. The function stores two real roots

in *root1 and *root2 and returns the status of validity of

roots. It handles four different kinds of cases.

(i) When coefficient a is zero irrespective of discriminant

(ii) When discriminant is positive

(iii) When discrimanant is zero

(iv) When discrimanant is negative

Only in cases (ii) and (iii), the stored roots are valid.

Otherwise 0 is stored in the roots. the function returns 0 when 

the roots are valid and -1 otherwise. 

The functin also ensures root1>=root2.

int get_QuadRoots (float a, float b, float c, float *root1, float *root2) ; 

*/

A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant. 

Which one of the following options provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing? 

The net work uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following

N1 : (0, 1, 7, 8, 4) 

N2 : (1, 0, 6, 7, 3) 

N3 : (7, 6, 0, 2, 6) 

N4 : (8, 7, 2, 0, 4) 

N5 : (4, 3, 6, 4, 0)

Each distance vector is the distance of the best known path at that instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors

The cost of link N2-N3 reduces to 2 in (both directions). After the next round of updates, what will be the new distance vector at node, N3?