The Nameless Blog

                      |----Res---|
                     |          |
        in----Res----+--Inv-----+--- out
                        CMOS
   What is the given circuit
a) Latch b)Amplifier   c)Schmitt trigger. d)

                   o Vdd
                  |
          --------+
          |       |
       B  |C      |
 o------- Tr NPN  |
          |E      |-------------o
          |       |
          |    B  |C
          +------ Tr NPN
                  |E
                  |
  o---------------+-------------o
the gain of the circuit is
a) beta^2 b)beta + 1 c) (beta+1)^2 d)

Function of C in the circuit below is
a) Improve switching b)dc coupling c) ac coupling d) None
                                    o
                       C            |
                 +------||--+       |
                 |          |       |C
          o------+----Res---+------Tr NPN
                                    |E
                                    |
                                   _|_
                                   __

if a 5-stage pipe-line is flushed and then we have to execute 5 and 12
instructions respectively then no. of  cycles will be
a. 5 and 12
b. 6 and 13
c. 9 and 16
d.none

Minimize the K-map
        A'B' A'B  AB  AB'
       \_________________
     c'| 1    X   0   1 |
       |----------------|
      c| 1    X   0   1 |
       |----------------|
a) A'B' b) A'+B' c)B' d)A'+B'+C'

WHAT'S THE ADDRESS OF A[3][4] AND B[3][4]
IF ADDRESS OD A IS OX1000 AND B IS 0X2000

A. 0X1030 AND 0X20C3
B. OX1031 AND OX20C4
AND SOME OTHERS..

int f(int *a)
{
int b=5;
a=&b;
}

main()
{
int i;
printf("\n %d",i);
f(&i);
printf("\n %d",i);
}

what's the output .

1.10,5
2,10,10
c.5,5
d. none

main()
{
int i;
fork();
fork();
fork();
printf("----");
}

how many times the printf will be executed .
a.3
b. 6
c.5

void f(int i)
{
int j;
for (j=0;j<16;j++)
{
if (i & (0x8000>>j))
printf("1");
else
printf("0");
}
}
what's the purpose of the program

a. its output is hex representation of i
b. bcd
c. binary

#define f(a,b) a+b
#define g(a,b) a*b


main()
{
int m;
m=2*f(3,g(4,5));
printf("\n m is %d",m);
}

what's the value of m
a.70
b.50
c.26

main()
{
char a[10];
strcpy(a,"\0");
if (a==NULL)
printf("\a is null");
else
printf("\n a is not null");}

what happens with it .
a. compile time error.
b. run-time error.
c. a is  null

char a[5]="hello"

a. in array we can't do the operation .
b. size of a is too large
c. size of a is too small

local variables can be store by compiler
a. in register or heap
b. in register or stack
c .in stack or heap .

global variable conflicts due to multiple file occurance
is resolved during
a. compile-time
b. run-time
c. link-time

two program is given of factorial.
one  with  recursion and one without recursion .
question was which program won't run for very big no. input because of
stack overfow .
a. i only  (ans.)
b. ii only
c. i& ii both .

struct a
{
int a;
char b;
int c;
}

union b
{
char a;
int b;
int c;
};
which is correct .
a. size of a is always diff. form size of b.(ans.)
b. size of a is always same  form size of b.
c. we can't say anything because of not-homogeneous (not in ordered)

d. size of a can be same if ...
c. none
d. load-time
d. global memory.
d. nothing wrong with it .
d. a is not  null.
d. 69
d. decimal
d. 8

IF the rate of removal of elements in a queue containing N elements is
proportional to the no of  elements already existing in the queue at that
instant then the no. of elements----
a)decrease linearly b)Exponetialy decrease b) Logarithmcally