GATE CSE 2000 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

The most appropriate matching for the following pairs
$$X:$$ Indirect addressing
$$Y:$$ Immediate addressing
$$Z:$$ Auto decrement addressing is

$$1:$$ Loops
$$2:$$ Pointers
$$3.$$ Constants

$$X - 3,\,Y - 2,\,Z - 1$$

$$X - 1,\,Y - 3,\,Z - 2$$

$$X - 2,\,Y - 3,\,Z - 1$$

$$X - 3,\,Y - 1,\,Z - 2$$

GATE CSE 2000

MCQ (Single Correct Answer)

-0.6

A graphics card has on board memory of $$1$$ $$MB.$$ Which of the following modes can the card not support?

$$1600\,\, \times \,\,400$$ resolution with $$256$$ colours on a $$17$$ inch monitor

$$1600\,\, \times \,\,400$$ resolution with $$16$$ million colours on a $$14$$ inch monitor

$$800\,\, \times \,\,400$$ resolution with $$16$$ million colours on a $$17$$ inch monitor

$$800\,\, \times \,\,400$$ resolution with $$256$$ colours on a $$14$$ inch monitor

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?

(1 2 (4 5 6 7))

(1 (2 3 4) 5 6) 7)

(1 (2 3 4)(5 6 7))

(1 (2 3 NULL) (4 5))

GATE CSE 2000

MCQ (Single Correct Answer)

-0.6

Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal. Respectively, of a complete binary tree. Which of the following is always tree?

LASTIN = LASTPOST

LASTIN = LASTPRE

LASTPRE = LASTPOST

None of the above

PREVIOUS NEXT

GATE CSE Papers

2025