|
(c)0,1,2
(d)0,1,0
Computer science
----------------
1.Deadlock occur when
(a)Some resources are held up by some process.
(b)...
(c)...
(d)None of these
2. A prefix expression can be equal to a postfix
expression reversed only if
(a)It is left associative
(b)It is commutative
(c)It is right associative
3.How many lines will be printed in the following
Pascal pgm
[I don't remember the Pascal version,so I am giving C
version]
void print(int n)
{
if(n>0)
{
print(n-1);
printf("%d",n);//println(n) in Pascal version.
print(n-1);
}
}
(a)3
(b)7
(c)15
(d)31
4.Maximum number of nodes in a tree with n levels.
(a)2^(n-1)
(b)(2^n)-1
(c)2^(n-1) - 1
5.Complete graphwith n nodes have
|
|
