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

Question

MCQ▾

How many states are there in a minimum state automata equivalent to regular expression given below?

Regular expression is

Choices

Choice (4)Response

a.

4

b.

3

c.

2

d.

1

Question 1887

Question

MCQ▾

Hbase uses the ________ file system to store its data

Choices

Choice (4)Response

a.

Map reduce

b.

HIve

c.

Haddop

d.

Hummer

Question 1888

Question

MCQ▾

A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If , and , what is the value of n?

Choices

Choice (4)Response

a.

6

b.

9

c.

5

d.

4

Question 1889

Question

MCQ▾

An array of 35 distinct elements is to be sorted using quick sort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is ________.

Choices

Choice (4)Response

a.

0.040

b.

0.057

c.

0.25

d.

0.001

Question 1890

Question

MCQ▾

How many flip flops are needed to implement a state machine with 30 states

Choices

Choice (4)Response

a.

5

b.

7

c.

6

d.

4

Question 1891

Question

MCQ▾

A particular disk unit uses a bit string to record the occupancy or vacancy of its tracks, with 0 denoting vacant and 1 for occupied. A 32 bit segment of this string has hexadecimal value E3DA1005. The percentage of occupied tracks for the corresponding part of the disk, to the nearest percentage is

Choices

Choice (4)Response

a.

25

b.

48

c.

18

d.

41

Developed by: