GATE CSE format:msq PYQs & Answers — Page 2

Home
GATE
Computer Science and Information Technology
Topics
format:msq

Questions 11–20 of 160. Imported answers require independent review unless marked reviewed.

Topic practice 160 questionsPage 2 of 16

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

In the context of relational database normalization, which of the following statements is/are true?

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

It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

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

Let

be defined as follows:

Which of the following statements is/are true?

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

has a local maximum

has a local minimum

is continuous over

is not differentiable over

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

Let

be a simple, undirected graph. A vertex cover of

is a subset

such that for every

. Let the size of the smallest vertex cover in

. Let

be any vertex cover of size

For a vertex

, which of the following constraints will always ensure that

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

The degree of

is at least $k+1

The vertex

is on a path of length $k+1

The vertex

is on a cycle of length $k+1

The vertex

is a part of a clique of size $k

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

GATE CSE format:msq PYQs

Question 27

Question 27

Question 28

Question 28

Question 29

Question 29

Question 30

Question 31

Question 46

Question 47