GATE CSE format:mcq PYQs & Answers — Page 40

Questions 391–400 of 534. Imported answers require independent review unless marked reviewed.

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all the three machines. Which one of the following is true?

Your answerChoose one option.

M, N, and P all belong to the same subnet

Only M and N belong to the same subnet

Only N and P belong to the same subnet

M, N, and P belong to three different subnets

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

Your answerChoose one option.

X sends an ARP request packet to the local gateway’s IP address which then finds the MAC address of Y and sends to X

X sends an ARP request packet to the local gateway’s MAC address which then finds the MAC address of Y and sends to X

X sends an ARP request packet with broadcast MAC address in its local subnet

X sends an ARP request packet with broadcast IP address in its local subnet

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider three 4-variable functions

, and

, which are expressed in sum-of-minterms as

. For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:

Diagram for Computer Science and Information Technology question 30

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Which one of the following languages over

is NOT context-free?

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let the set of functional dependencies

hold on a relation schema

is not in BCNF. Suppose

is decomposed into two schemas

and

, where

and

. Consider the two statements given below. I. Both

and

are in BCNF II. Decomposition of

into

and

is dependency preserving and lossless Which of the above statements is/are correct?

Your answerChoose one option.

Both I and II

I only

II only

Neither I nor II

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following sets: S1. Set of all recursively enumerable languages over the alphabet

S2. Set of all syntactically valid C programs S3. Set of all languages over the alphabet

S4. Set of all non-regular languages over the alphabet

Which of the above sets are uncountable?

Your answerChoose one option.

S1 and S2

S3 and S4

S2 and S3

S1 and S4

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the first order predicate formula

Here ‘

’ denotes that ‘

divides

’, where

and

are integers. Consider the following sets: S1.

S2. Set of all positive integers S3. Set of all integers Which of the above sets satisfy

Your answerChoose one option.

S1 and S2

S1 and S3

S2 and S3

S1, S2 and S3

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let

, and

be the placeholders for the non-terminals D, T, L or

in the following table:

Production rule	Semantic action
D → T L	.type = .type
T → int	T.type = int
T → float	T.type = float
L → , id	.type = .type; addType(id.entry, .type)
L → id	addType(id.entry, .type)

Which one of the following are the appropriate choices for

and

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

There are

unsorted arrays:

. Assume that

is odd. Each of

contains

distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE format:mcq PYQs

Question 28

Question 29

Question 30

Question 31

Question 32

Question 33

Question 34

Question 35

Question 36

Question 37