GATE CSE format:msq PYQs & Answers

Home
GATE
Computer Science and Information Technology
Topics
format:msq

Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.

Questions 1–10 of 160. Imported answers require independent review unless marked reviewed.

Topic practice 160 questionsPage 1 of 16

Which of the following statements is/are true with respect to the interaction of a web browser with a web server using HTTP 1.1?

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

HTTP 1.1 facilitates downloading multiple objects of the same webpage over the same TCP connection, if the objects are stored in the same server

HTTP 1.1 facilitates downloading multiple objects of the same webpage over the same TCP connection, even if they are stored in different servers

HTTP 1.1 facilitates sending a request for downloading one object without waiting for a previously requested object to be downloaded completely

HTTP 1.1 facilitates downloading multiple webpages on the same server to be downloaded over a single TCP connection

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

Let

. Consider an

matrix

with its elements from

. Let the vector

be in the null space of

Which of the following options is/are always correct?

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

Determinant of

is 1

Determinant of

is 0

Rank of

is 1

There are at least two non-zero vectors in the null space of

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

Consider the following Boolean expression of a function

Which of the following expressions is/are equivalent to

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 the 8-bit signed integers

and

represented using the sign-magnitude form. The binary representations of

and

are as follows:

Which of the following operations to compute

result(s) in an 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

Let

be an odd number greater than 100. Consider a binary min heap with

elements stored in an array

whose index starts from 1.

Which of the following indices of

do/does NOT correspond to a leaf node of the min heap?

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 a hash table

that is initially empty. The hash table is maintained using open addressing with linear probe. The hash function used is

Consider the following sequence of insertions performed on

Which of the following positions in the hash table is/are empty after these insertions are performed?

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 the following grammar where

is the start symbol, and

and

are terminal symbols.

Which of the following statements is/are true?

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

The grammar is ambiguous

The string

has two distinct derivations in this grammar

The string

has only one rightmost derivation

The language generated by the grammar is undecidable

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 can be recurrence relation(s) corresponding to an algorithm with time complexity

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

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

GATE CSE format:msq PYQs

How to practice format:msq

Question 19

Question 20

Question 21

Question 22

Question 23

Question 24

Question 25

Question 25

Question 26

Question 26