GATE CSE exam:gate PYQs & Answers — Page 6

Home
GATE
Computer Science and Information Technology
Topics
exam:gate

Questions 51–60 of 975. Imported answers require independent review unless marked reviewed.

Topic practice 975 questionsPage 6 of 98

Let

be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.

Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to

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

128

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

Let

be a binary relation on the set

, where

if the product of

and

is square of an integer. Which of the following properties is/are satisfied by

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

Reflexive

Symmetric

Transitive

Antisymmetric

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

Consider the following C statements:

char *str = "Hello; /* Statement S1 */

char *str2 = "Hello;"; /* Statement S2 */

int *str3 = "Hello; /* Statement S3 */

Which of the following options is/are correct?

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

S1 and S2 have syntactic errors

S2 has a lexical error and S3 has a syntactic error

S1 has a lexical error and S3 has a semantic error

S1 has a syntactic error and S3 has a semantic error

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

For a real number

, let

. Which of the following statements is/are true?

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

The value of

is independent of the value of

The value of

can vary with the value of

There exists

such that

is a positive real number

There exists

such that

is a negative real number

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

Which of the following statements is/are true?

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

LL(1) parser uses backtracking

For a grammar to be LL(1), it must be left-recursive

For a grammar to be LL(1), it must be left-factored

The LL(1) parsers are more powerful than the SLR parsers

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

In a system, numbers are represented using 4-bit two’s complement form. Consider four numbers

and

in the system. Which of the following operations will result in arithmetic overflow?

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

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?

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

Banker’s algorithm is used to prevent deadlocks

Deadlock formation can be prevented by ensuring that the hold and wait condition is not allowed

An assignment edge in a resource allocation graph is marked from a process to a resource

A safe state guarantees that all processes can finish without formation of a deadlock

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

Which of the following grammars is/are ambiguous?

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

Let

and

be the attributes of a relation in a relational schema. Let

indicate functional dependency in the context of a relational database, where

Which of the following options is/are always true?

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

and

, then

and

, then

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

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function

. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is __________. (answer in integer)

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

GATE CSE exam:gate PYQs

Question 26

Question 26

Question 27

Question 27

Question 28

Question 28

Question 29

Question 29

Question 30

Question 30