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

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

Consider the following two well-formed formulas in prepositional logic.

Which of the following statements is correct? (November paper III)

Choices

Choice (4)Response

a.

F1 is unsatisfiable, F2 is Satisfiable

b.

F1 and F2 both are Satisfiable

c.

F1 is unsatisfiable, F2 is valid

d.

F1 is Satisfiable, F2 is valid

Question 1261

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search? (November paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1262

Question

MCQ▾

The number of 1՚s present in the binary representation of

will be? (Model paper III)

Choices

Choice (4)Response

a.

9

b.

8

c.

7

d.

6

Question 1263

Question

MCQ▾

Below is a statement about “Software maintenance” .

“The software product is modified and updated to keep it up-to date and in line with the ever changing world of technology”

What kind of maintenance is this? (Model paper III)

Choices

Choice (4)Response

a.

Preventive maintenance

b.

Perfective maintenance

c.

Corrective maintenance

d.

Adaptive maintenance

Question 1264

Question

MCQ▾

Number of binary trees that can be formed using nodes is? (Model paper II)

Choices

Choice (4)Response

a.

429

b.

237

c.

132

d.

42

Developed by: