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

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

Let L be the language generated by regular expression and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, has … equivalence classes.

Choices

Choice (4)Response

a.

6

b.

2

c.

4

d.

5

Question 387

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

Consider the reference string

0 1 2 3 0 1 4 0 1 2 3 4

If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are … and … respectively.

Choices

Choice (4)Response

a.

9,10

b.

10,9

c.

10,10

d.

9,9

Question 388

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

The number of different binary trees with 6 nodes is …

Choices

Choice (4)Response

a.

42

b.

256

c.

132

d.

6

Question 389

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

In TCP/IP Reference model, the job of … layer is to permit hosts to inject packets into any network and travel them independently to the destination.

Choices

Choice (4)Response

a.

Transport

b.

Physical

c.

Host-to-network

d.

Application

Question 390

Appeared in Year: 2016 (UGC-NET)

Question

MCQ▾

Consider the following binary search tree:

The Binary Search Tree

If we remove the root node, which of the node from the left subtree will be the new root?

Choices

Choice (4)Response

a.

13

b.

11

c.

16

d.

12

Developed by: