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

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Which of the following is application of depth-first search? (June)

Choices

Choice (4)Response

a.

Only topological sort

b.

Only strongly connected components

c.

Both a. and b. are correct

d.

Question does not provide sufficient data or is vague

Question 1735

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

With respect to relational algebra, which of the following operations are included from mathematical set theory? (June)

1) Join

2) Intersection

3) Cartesian product

4) Project

Choices

Choice (4)Response

a.

2 and 3

b.

2 and 4

c.

1 and 4

d.

3 and 4

Question 1736

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Consider three CPU-intensive processes, which require 10,20 and 30 time units and arrive at times 0,2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. (June)

Choices

Choice (4)Response

a.

1

b.

4

c.

2

d.

3

Question 1737

Appeared in Year: 2019 (UGC-NET)

Question

Match List-Ⅰ List-Ⅱ▾

Match List-I with List-II: (June)

List-Ⅰ (Column-I)List-Ⅱ (Column-II)
(A)

Lowest cost-first

(i)

Minimal

(B)

Greedy best-first

(ii)

Minimal

(C)

A ⚹ algorithm

(iii)

Minimal

Choices

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

a.

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

b.

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

c.

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

d.

All of the above

Developed by: