GATE DA topic:computing PYQs & Answers — Page 16

Questions 151–160 of 195. Imported answers require independent review unless marked reviewed.

Consider performing uniform hashing on an open address hash table with load factor

, where

elements are stored in the table with

slots. The expected number of probes in unsuccessful search is at most

. Inserting an element in this hash table requires at most _____ probes, on average.

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

For any binary classification dataset, let

and

be the between-class and within-class scatter (covariance) matrices, respectively. The Fisher linear discriminant is defined by

, that maximizes

is non-singular and

, then

must satisfy which ONE of the following equations?

Note:

denotes the set of real numbers.

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

and

be two admissible heuristics used in

search.

Which ONE of the following expressions is always an admissible heuristic?

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 five random variables

, and

whose joint distribution satisfies:

Which ONE of the following statements is FALSE?

Your answerChoose one option.

is conditionally independent of

given

is conditionally independent of

given

and

are conditionally independent given

and

are conditionally independent given

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

Consider the following statement:

In adversarial search,

pruning can be applied to game trees of any depth where

is the _____ (m) value choice we have formed so far at any choice point along the path for the MAX player and

is the _____ (n) value choice we have formed so far at any choice point along the path for the MIN player.

Which ONE of the following choices of (m) and (n) makes the above statement valid?

Your answerChoose one option.

(m) = highest, (n) = highest

(m) = lowest, (n) = highest

(m) = highest, (n) = lowest

(m) = lowest, (n) = lowest

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

Consider a database that includes the following relations:

Defender(name, rating, side, goals)

Forward(name, rating, assists, goals)

Team(name, club, price)

Which ONE of the following relational algebra expressions checks that every name occurring in Team appears in either Defender or Forward, where

denotes the empty set?

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 minimum, maximum, mean and standard deviation values for the attribute income of data scientists be ₹4600, ₹17000, ₹9600, and ₹2100, respectively. The z-score normalized income value of ₹10600 is closest to which ONE of the following options?

Your answerChoose one option.

0.217

0.476

0.623

2.304

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

Consider the following tree traversals on a full binary tree:

(i) Preorder (ii) Inorder (iii) Postorder

Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?

Your answerSelect all correct options. You can choose more than one.

(i) and (ii)

(ii) and (iii)

(i) and (iii)

(ii) only

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

Let

and

be two propositions. Which of the following statements is a tautology/are tautologies?

Your answerSelect all correct options. You can choose more than one.

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

Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last element as the pivot.

60 70 80 90 100

The minimum number of swaps performed during this Quicksort is ______.

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

GATE DA topic:computing PYQs

Question 21

Question 22

Question 23

Question 24

Question 25

Question 26

Question 27

Question 28

Question 29

Question 30