1. Gain margin of g(s)h(s)=1/s(s+k);

a. sqrt(1+k2)             b. 0                 c. infinity                   d. 1

2. Possion distribution is used for ___________

a. used in FSM
b. used for queuing delay system of mutually identical events of arrival
a. both 

3. The code set is {00000,00111,11100,11011} what is the error detecting and correcting capability?

Answer : 2,1

4. If "AaBbCc" is passed to the char

char x(*a)
{
a[0]?x(a+1):1;
printf("%c",a[0]);
return 1;
}

What will be the output?

5. Two sorted lists of n elements will take at least fine the order of complexity?

a. 2n           b. n/2                  c. square(n)

6. Deadlock condition

7. Execution phase can be

a. pipelined                   b. no parallelism is possible                    c. vector processing

8. In 32 bit representation, the range of numbers in 2's complement form

Answer : -2 to the power of 31 to 2 to the power of 31 minus 1

9. A table contains less than 10 elements which one is fastest

a. bubble sort                    b. selection sort                   c. quick sort

10. f(*p)
{
p=(char *)malloc(6);
p="hello";
return;
}

main()
{
char *p="bye";
f(p);
printf("%s",p);
}

What is the o/p?

Answer : bye

11. Which of the folowing is not correct

a. (x+y)'=x'.y'               b. (x'+y')'=x.y                  c. (x'.y')'=x+y                      d. (x'+y')'=x'.y' [d]

12. If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions from X to Y is 97 then

a. |X|=97 |Y|=1                         b. |X|=1 |Y|=97                     c. |X|=97 |Y|=97

13. Advantage of SRAM over DRAM

Answer : faster

14. RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines are required to access each byte

a. 12             b. 16                c.15                   d. 17

15. Method used for Disk searching..

a.linked list              b. AVL          c. B-tree              d. binary tree