GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1967 - 1971 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1967

Appeared in Year: 2015

Question

MCQ▾

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Choices

Choice (4)Response

a.

Dense

b.

Clustered

c.

Sparse

d.

Unflustered

Question 1968

Appeared in Year: 2015

Question

MCQ▾

The least number of temporary variables required to create a three-address code in static single assignment form for the expression is

Choices

Choice (4)Response

a.

4

b.

9

c.

8

d.

7

Question 1969

Appeared in Year: 2015

Question

MCQ▾

Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16,17, 8,4. now consider that a value 35 is inserted into this heap. After insertion, the new heap is

Choices

Choice (4)Response

a.

40, 35, 20, 10, 15, 16, 17,8, 4,30

b.

40, 30, 20, 10, 35, 16, 17,8, 4,15

c.

40, 30, 20, 10, 15, 16, 17,8, 4,35

d.

40, 35, 20, 10, 30, 16, 17,8, 4,15

Question 1970

Appeared in Year: 2015

Question

MCQ▾

In the LU decomposition of the matrix , if the diagonal elements of U are both 1, then the lower diagonal entry of L is

Choices

Choice (4)Response

a.

6

b.

5

c.

7

d.

4

Question 1971

Appeared in Year: 2015

Question

MCQ▾

For computer based on three-address instruction formats, each address field can be used to specify which of the following:

S1: A memory operand

S2: A processor registers

S3: An implied accumulator registers

Choices

Choice (4)Response

a.

Only S2 and S3

b.

Either S2 or S3

c.

Either S1 or S2

d.

All of the above

Developed by: