GATE CS question library
Practise GATE CS Computer Science previous year questions free. Browse by subject, syllabus topic, year and question type, with answers and available solutions.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
The matrices and commute under multiplication
Which one of the following is false?
Which of the following is NOT True? (Read as AND, as OR, as NOT, as one way implication and as two way implication)
Let be a non-empty relation on a collection of sets defined by if and only if . Then, (pick the true statement)
Consider the following floating-point number representation. The exponent is in complement representation and the mantissa is in the sign-magnitude representation. The range of the magnitude of the …
Let denote the set of real numbers. Let be a bijective function defined by . The inverse function of is given by
For the daisy chain scheme of connecting I/O devices, which of the following statements is true?
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is
A ROM is used to store the table for multiplication of two -bit unsigned integers. The size of ROM required is
Which of the following is an example of spooled device?
A critical section is a program segment
The process state transition diagram in the below figure is representative of
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are
Relative mode of addressing is most relevant to writing:
Which of the following sequences denotes the post order traversal sequence of the below tree?
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?
An advantage of chained hash table (external hashing) over the open addressing scheme is
Consider the following statements: First-in-first out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two …
Which of the following statements is false?
Let where . Which of the following is true?
