Path testing isA. Black box testing strategyB. White box testing strategyC. An installationD. An environment
Find the output of the following C programvoid f(char *p){p=(char *) malloc(6);strcpy(p,"hello");}void main( ){char *P="bye";f(p);printf("%s',p);}
Given the following C programfunc(){static int i = 10;printf("%d",i);i++;}What is the value of i if the function is called twice?
Context free grammar is accepted byA. finite automataB. push down automataC. two way bounded automataD. both B and C
There are 10 items in a box, out of which 3 are defective. 2 balls are taken one after the other.What is the probability that both of them are defective?
Given the following C programfunc(int *i, int*j){*i=*i * *i;*j=*j* *j;}main(){ int i = 5, j = 2;func(&i,&j);printf("%d %d", i, j);}
In TCP/IP header, checksum containsA. sum of all the wordsB. ones complement of the dataC. ones complement of the sum of all the wordsD. ones complement of the sum in ones complement
Which of following statements about heap is wrongA. An n element heap has height log n(base of log is 2)B. Smallest element of heap is always a leafC. An array in reverse sorted order is a heapD. A heap can't contain any element more than once
If a binary tree is constructed using nodes with two pointers each,how many null pointers does a tree with N nodes have?A. n-1B. nC. n+1D. Depends on the number of edges
What is the number of comparisons in the worst case to merge two sorted lists containing n elements each?A. 2nB. 2n-1C. 2n+1D. 2n-2
View page << Previous 1 2 [3] 4 5 Next >>
Go Top
