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

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Consider the following minimax game tree search (Dec)

Image Shows the Minimax Game Tree

What will be the value propagated at the root?

Choices

Choice (4)Response

a.

3

b.

4

c.

6

d.

5

Question 1609

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Consider ISO-OSI network architecture reference model Session layer of this model offers dialog control, token management, and ________ as services. (December)

Choices

Choice (4)Response

a.

Flow Control

b.

Synchronization

c.

Asyncronization

d.

Errors

Question 1610

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Consider the following two languages: (December)

Which one of the following is correct?

Choices

Choice (4)Response

a.

Only is regular language

b.

and are not regular languages

c.

and are regular languages

d.

Only is regular language

Question 1611

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

In PERT/CPM, the merge event represents ________ of two or more events. (Dec)

Choices

Choice (4)Response

a.

Completion

b.

Splitting

c.

Beginning

d.

Joining

Question 1612

Appeared in Year: 2018 (UGC-NET)

Question

Match List-Ⅰ List-Ⅱ▾

Match List I with List II and Choose the correct answer from the code given below. (December)

List-Ⅰ (Coloum-1)List-Ⅱ (Coloum-2)
(A)

Greedy Best-First Search

(i)

Suffers from excessive node generation.

(B)

Recursive Best-First Search

(ii)

Selects a node for expansion if optimal path to that node has been found.

(C)

Iterative deepening Search

(iii)

Time complexity depends on the quality of heuristic.

(D)

Search

(iv)

Avoids substantial overhead associated with keeping the sorted queue of nodes.

Choices

Choice (4)Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (ii)
  • (i)
  • (iv)
  • (iii)

b.

  • (i)
  • (ii)
  • (iv)
  • (iii)

c.

  • (iii)
  • (i)
  • (iv)
  • (ii)

d.

  • (iv)
  • (iii)
  • (i)
  • (ii)

Developed by: