Partner Sites
section A:30 bits
section B:20 bits
section C:20 bits
section A is compulsory attempt either section C or section B for electronics background,it is better to attempt
sec B
Section C
an lead compensator zero is at Z=Zc, pole is at P=Pc then the following is correct
a. Pc > Zc, pc< 0, zc< 0
b.
c.
gain margin of g(s)h(s)=1/s(s+k);
a. sqrt(1+k2)
b. 0
c. infinity
d. 1
machestor code does not improves
a. clock recovery
b. bandwidth efficiency
c.
possion distribution is used for
a. used in FSM
b.
c.used for queuing delay system of mutually identical events of arrival
d. both a and c
no.of filpflops for mod 11 counter
a. four
b. five
c.
no.of filpflops for mod 11 counter
a. four
b. five
c.
if even parity is used for parity generation, what is the hamming distance (simple fig is given) ans:2
the code set is {00000,00111,11100,11011}what is the error detecting and correcting capability?
ans:2,1
operational amp characteristics following is correct:
1. input impedance is 0
2. output impedance is infinity
3. input impedance is infinity
4. gain is infinity which combinations are correc
band pass signal having frequencies 2.5k and 4.5k?give the sampling freq
a. 9k
b. 4k
c. 4.5k
d. 7k
definition of avalanche diode multiplication
more no of ripples are present in the diagram?which is correct
a. lower order filter
b. high order filter
c.
If CPU have one interrupt pin and on to connect with external devices with some priority? which type of the following is used?
a. parallel priority interrupt
b. daisy chain
c. RS filpflop
d.
one megabit file transfer, serially on 9600 baud one start bit and two stop bits, then how much time it takes (approx)
a. 4 hours
b. 2 hours
c. 20 minutes
d. 2 minute
IEEE 802.5 is ans: TOKEN RING
Code sequence is given what is the error correcting distance
bit stuffing used in HDLC Protocol for ans: b is correct(read on text book)
Section A AND B (Both are mixed )
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?
f(*p)
{
p=(char *)malloc(6);
p="hello";
return;
}
main()
{
char *p="bye";
f(p);
printf("%s",p);
}
what is the o/p? ans:bye
when the program counter is incremented in the instruction cycle
a. fetch cycle
b. int cycle
c. execuation cycle
d.
two sorted lists of n elements will take at least fine the order of complexity?
a. 2n
b. n/2
c. square(n)
logic diagram is given? find the expression ans: OR gate
question on JAVA string ans: string ends without a null character
cache access time is 100ns. main memory access time is 1000ns, hit ratio is .9, find mean access time?
ans :200ns
which is not suitable to find out IP address ans:ARP
about deadlock condition
convert 41.6875 into binary
read about IP AND IPX
read about NFS
DHCP is
a. for routing
b. for network address conversion
c. for diagnosis
d.
execution phase can be
a. pipelined
b. no parallelism is possible
c. vector processing
d.
In public key algorithm , A wants to send message to B ..... which key is used
a. A public key
b. A private key
c. B public key
d. B private key
to prevent replay attacks in transmission
a. symmetric encoding
b. Asymmetric encoding
c. for every exchange, key should be changed
irtual functionality is used in C++
a. dynamic binding
b. if the derived func is present but base class not present
c.
if there are n nodes in a binary tree, how many null pointers are there ans:n+1;
if heap sort contains n elements, no of comparsions required are
a. log(n)
b. height of heap sort
c.
d.
question on ICV(integrity check)
which of the following is efficient in terms of space
a. insertion sort
b. quick sort
c. selection
d. both a and c
in 32 bit representation, the range of numbers in 2's complement form
ans :-2 to the power of 31 to 2 to the power of 31 minus 1
about normalization
socket is implemented in TCP Layer. which of the following is related to TCP layer
ans: port number
in reentrant procedure, which should be not used for passing parameters?
a. passed by reg
b. by direct
c. by indirect
d. by stack
flow control is used for
a. congestion at receiver
b.
c.
d.
flow control is used for a. congestion at receiver
b.
c.
d.
5 questions on DBMS are there
in global static variable , declartion in a file
a. localization of scope
b. persistance of the value through out the file
c.
d.
in sorted table contains elements , which of the searching is false
a. hash table
b. binary searching
in demand paging overhead of context switching is more due to
a. copy processes from disk to memory
b. viceversa
c. to get associative table
d. swapping to the disk
when write through is better than write back(related to cache memory)
which is false when normalization is used?can't express
I :verification: are we doing right product
II: validation:are we doing product right
a. i and ii are true
b. i and ii are false
c. i true and ii false
d. i false and ii true
A table contains less than 10 elements which one is fastest
a. bubble sort
b. selection sort
c. quick sort
about subroutine, precondition is false. what about post condition
a. post condition is not defined
b. post condition is always true
c.
d.
When static variables are used, which one of the following is not possible?
a. dynamic run time
b.
c.
in product of x and y,
if(x=0|y=0)
y=1;
else
y=0;
(not cleared)
what is cyclometric complexity?
a. 3
b. 2
c. 1
d. 0
CREATE TABLE NEW AS SELECT BIG FROM EMP
The above SQL statement is correct or not?
(question is not cleared)
path testing is
a. white box
b. black box
c. installation test
d. environment test
program is given?
above algorithm represents what type of search?
a. binary search
b. interpolation search
c. sequential search
d. (may be "b" is correct);
if x->y in a relation R, x1 and x2 are in x, y1 and y2 are in y (question not cleared),about functional dependancy
a.x1=x2 and y1=y2
b.
c.
in a down loading from website ,which one is correct? ans: check the byte code and indicate the error, if any.
about UDP one Address is given but that is not the state table what will it do the packet
a. packet is discarded
b. packet is sent to ethernet server
c. packet is sent to other address
d.
in associated memory for fast accessing which one is used
a. single linked list
b. double "
c. hash table
d.
