# GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 2000 - 2005 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-

## Question 2000

Appeared in Year: 2012 (UGC-NET)

### Question

MCQ▾

Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is (December Paper III)

### Choices

Choice (4)Response

a.

b.

c.

d.

## Question 2001

### Question

MCQ▾

The operators + and = have following precedence relationship

### Choices

Choice (4)Response

a.

+ has higher precedence

b.

Both have equal precedence

c.

= has higher precedence

d.

All of the above

## Question 2002

### Question

MCQ▾

If in a graph G there is one and only one path between every pair of vertices then G is called as

### Choices

Choice (4)Response

a.

Completed graph

b.

Tree

c.

Edges

d.

Circuits

## Question 2003

### Question

MCQ▾

In an examination, 70 % of the students have passed in English and 75 % in Mathematics, while 50 % passed in both if 22 students failed in both. In this case find the total number of students sit for that exam.

### Choices

Choice (4)Response

a.

110

b.

112

c.

109

d.

100

## Question 2004

### Question

MCQ▾

Suppose & Then find the solution of .

### Choices

Choice (4)Response

a.

b.

c.

d.

## Question 2005

### Question

MCQ▾

If a fair 15-sided dice is rolled, then is the probability that the roll is an odd number or prime number or both?

### Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: