GATE CSE discipline:computing-and-data PYQs & Answers — Page 41

Questions 401–410 of 975. Imported answers require independent review unless marked reviewed.

Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2: The back-end includes phases that are specific to the target hardware. S3: The back-end includes phases that are specific to the programming language used in the source code.

Identify the CORRECT option.

Your answerChoose one option.

Only S1 is TRUE.

Only S1 and S2 are TRUE.

S1, S2, and S3 are all TRUE.

Only S1 and S3 are TRUE.

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 sequences, when stored in an array at locations A[1], . . . , A[10] forms a max-heap?

Your answerChoose one option.

23, 17, 10, 6, 13, 14, 1, 5, 7, 12

23, 17, 14, 7, 13, 10, 1, 5, 6, 12

23, 17, 14, 6, 13, 10, 1, 5, 7, 15

23, 14, 17, 1, 10, 13, 16, 12, 7, 5

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

Let SLDel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLDel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list. Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLDel and DLDel?

Your answerChoose one option.

SLDel is O(1) and DLDel is O(n)

Both SLDel and DLDel are O(log(n))

Both SLDel and DLDel are O(1)

SLDel is O(n) and DLDel is O(1)

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

Consider the Deterministic Finite-state Automaton (DFA) shown below. The DFA runs on the alphabet

, and has the set of states

, with

being the start state and

being the only final state.

Diagram for Computer Science and Information Technology question 14

Which one of the following regular expressions correctly describes the language accepted by

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

The Lucas sequence

is defined by the recurrence relation:

with

and

Which one of the options given is TRUE?

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 options given below refers to the degree (or arity) of a relation in relational database systems?

Your answerChoose one option.

Number of attributes of its relation schema.

Number of tuples stored in the relation.

Number of entries in the relation.

Number of distinct domains of its relation schema.

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

Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the link is the lowest.

Your answerChoose one option.

Longer link length and lower transmission rate

Longer link length and higher transmission rate

Shorter link length and lower transmission rate

Shorter link length and higher transmission rate

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

Let

and

Let

and

denote the determinants of the matrices

and

, respectively.

Which one of the options given below is TRUE?

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 definition of a lexical token id for an identifier in a programming language, using extended regular expressions:

letter

[A–Za–z] digit

[0–9] id

letter (letter

digit)

Which one of the following Non-deterministic Finite-state Automata with

-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 19

Diagram for Computer Science and Information Technology question 19 (figure 2)

Diagram for Computer Science and Information Technology question 19 (figure 3)

Diagram for Computer Science and Information Technology question 19 (figure 4)

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

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let

be the number of keys,

be the number of slots in the hash table, and

Which one of the following is the best hashing strategy to counteract the adversary?

Your answerChoose one option.

Division method, i.e., use the hash function

Multiplication method, i.e., use the hash function

, where

is a carefully chosen constant.

Universal hashing method.

is a prime number, use Division method. Otherwise, use Multiplication method.

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

GATE CSE discipline:computing-and-data PYQs

Question 11

Question 12

Question 13

Question 14

Question 15

Question 16

Question 17

Question 18

Question 19

Question 20