|
A .4 ,B 15, C . 8 D. 3
4. MAX NO OF NODES IN A BINARY tree of depth (k>=1)
A . 2 raised to power k
B. 2 raised to power (k-1)
C . (2 raised power k)-1
D . 2 raised power (k-2)
5 A complete graph has
a. n vertices and (n-1)edges
b. " n(n-1)/2
c. " 2n(n-1)/3
d. n vertices and n edges
6 . If d is degree of the vertex i in a graph G with n vertices and e edges then
(E : is sigma in the answer)
a . E(dpower n -1); b . 0.5(Ed power n ) ; c. 0.5 (E d base i) d . 0.25 (Edi)
7.
8. what is the error handling in the OSI model
a. data layer b.network layer c. transport layer d. both
9. consider the grammar
s->iCtS
s-> iCtSes
s->a
C-> b
A .ibtaea B . ibtitbtaeaea C. ibteaeaea D. ibta
10. consider 1000 km round turn route with a teransmission rate of 100 mbps.
assume a propagation time of 5m/s . consider a packet size of 1000 bits how
many packets are nedded to fill up the lines along the rate.
a. 5000 b.1000 c . cannot estimated the data d. 1000
and finally the c ques
1. given the folloeing defination
char const *p='p'
A.p++ B.*p++ C. (*p)++ d.all
2. What is the out put of the following program
void printarr(float **arr)
{
printf("o,%f1,%f2,%f\n"arr[0][0],arr[0][1],arr[0][2])
}
void main()
{
float **arr,otr[2][3] = {{1,2,3} , {2,1,0}}
arr= (float**)otr;
printarr(arr);
|
|
