GATE CS IT Question Paper 1996

GATE CS IT Question Paper 1996.

GATE CS IT Question Paper 1996 with Answers Solution Computer Science Information Technology 1996

GATE i.e. Graduate Aptitude Test in Engineering Computer Science Information Technology 1996 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS IT 1996 examination is the procedure to get the admission in M.Tech

GATE Computer Science Information Technology i.e. CS IT Question Paper, This GATE CS IT 1996 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this GATE CS IT 1996 question paper in pdf file for GATE CS IT you can download it in FRCS IT, if GATE Computer Science Information Technology 1996 paper in text for GATE CS IT you can download GATE CS IT 1996 page also just Go to menu bar, Click on File->then Save.

GATE CS IT Question Paper 1996

GATE CS IT 1996 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science Information Technology 1996 paper is available for all the students in FRCS IT and also GATE CS IT 1996 question paper fully solved i.e with answer keys and solution.

You can get daily updates on GATE CS IT 1996 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science Information Technology exam. Here GATE CS IT 1996 question is also available in English.

Section -A

1.2 Let X = (2,3,6,12,24), Let be the partial order defined by X V if x divides y. Number of edge as in the Hasse diagram of (X.) is
(a)3 (b)4
(c) 9 (d) None of the above

1.4 Which of the following statements is false?
(a) The set of rational numbers is an abelian group under addition.
(b) The set of integers in an abelian group under addition.
(C) The set of rational numbers form an abellan group under multiplication.
(d) The set of real numbers exduding zero in an abellan group under multiplication.

1.7 Let Ax = b be a system of linear equations where A is an m x n matrix and b is a m x 1 column vector and X is a n x 1 column vector of unknows. Which of the following is false?
(a) The system has a solution if and only if, both A and the augmented matrix [A b] have the same rank.
(b) If m < n and b is the zero vector, then the system has infinitely many solutions.
(c) If m = n and b is non-zero vector, then the system has a unique solution.
(d) The system will have only a trivial solution when m = n, b is the zero vector and rank (A) = n.

1.12 Consider the following statements:
(i) First-in-first out types of computations are efficiently supported by STACKS.
(ii) Implementing USTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic UST operations.
(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
(iv) Last-in-first-out type of computations are efficiently supported by QUEUES.
(a) (ii) and (iii) are true (b) (i) and (ii) are true
(c) (iii) and (iv) are true (d) (ii) and (iv) are true

1.13 An advantage of chained hash table (external hashing) over the open addressing scheme is
(a) Worst case complexity of search operations is less?
(b) Space used is less (c) Deletion is easier
(d) None of the above

Download Paper