I have posted these solution keys here because all the books, available in the market, have lots of wrong solutions. Most of the students, like me, find themselves in dilemma and waste a lot of time in finding the correct keys. These solution keys are those which I had corrected while preparing for GATE Computer Science 2012 Exam. You will find most of these solution keys to be correct, except few for which I could not find the correct solution. Still I suggest you that please keep your mind open while using these keys.
GATE 1996 CS Solution Keys
The answer to 1.23 is (a) 101010101010
This gives the worst performance in booth’s algorithm
answer for Q. 23 is A, As Booths algorithm gives worst performance when the multiplier consists of alternating 1’s and 0’s.
answer for 17 is D,
Activation Record – Subroutine Call
Location counter -Assembler(Assembler uses 2 counters- location and line counter)
Reference count – garbage collector
address relocation – linking loader(or relocating loader)
solution of 1.3 should be B , since it has been given that there is exactly 97 function from X->Y :
by If we consider solution is A |x| = 1 and |y| = 97
meaning element(only one in our case) of x is related to all the 97 elements y (which cant be a function ).
as per function definition each element of domain can correspond exactly one value of co-domain. that is the only possible in over case
in most extereme case when |x| = 97
and |y| = 1 So I think Answer should be B. (What’s Your Opinion).
Answer of 2.2 should be D.
Let R is Symmetric Over (A,B)
then if there is xRy then there should be yRx this implies that y is in set A also that means A intersection B is not phi (but in question it has been given that A intersection B = phi ).
hence R can not be Symmetric.
and it cannot be Reflexive also because reflexive means aRa holds .that means a is in Set A and a is Also in Set B (wich is not possible if A intersection B is = phi)
(Am I Right or wrong ???)