CS and IT GATE 2023 Questions with Answer

1 2 3 4 5

Ques 1 Aptitude

We reached the station late, and _______ missed the train.

Mostly

Near

Utterly

Nearly

Ques 2 Aptitude

Kind : ______ :: often : frequently

Type

Cruel

Mean

Kindly

Ques 3 Aptitude

f(x) and g(y) are function of x and y, respectively and f(x) = g(y) for all real values of x and y. Which one of the following options is necessary true?

f(x)=0 and g(y)=0

f(x) = g(y) = constant

f(x) + g(y) = f(x) - g(y)

f(x)≠constant and g(y)≠constant

Ques 4 Aptitude

A series of natural numbers 𝐹₁, 𝐹₂, 𝐹₃, 𝐹₄, 𝐹₅, 𝐹₆, 𝐹₇, … obeys 𝐹_𝑛+1 = 𝐹_𝑛 + 𝐹_𝑛−1 for all integers 𝑛 ≥ 2 .
If 𝐹₆ = 37, and 𝐹₇ = 60, then what is 𝐹₁ ?

Ques 5 Aptitude

Looking at the surface of a smooth 3-dimensional object from the outside, which one of the following options is TRUE?

The surface of the object must be concave everywhere.

The surface of the object must be convex everywhere.

The surface of the object may be concave in some places and convex in other places.

The object can have edges, but no corners.

Ques 6 Aptitude

The country of Zombieland is in distress since more than 75% of its working population is suffering from serious health issues. Studies conducted by competent health experts concluded that a complete lack of physical exercise among its working population was one of the leading causes of their health issues. As one of the measures to address the problem, the Government of Zombieland has decided to provide monetary incentives to those who ride bicycles to work. Based only on the information provided above, which one of the following statements can be logically inferred with certainty?

All the working population of Zombieland will henceforth ride bicycles to work.

Riding bicycles will ensure that all of the working population of Zombieland is free of health issues.

The health experts suggested to the Government of Zombieland to declare riding bicycles as mandatory.

The Government of Zombieland believes that riding bicycles is a form of physical exercise.

Ques 7 Automata

Which of the following statements is/are CORRECT?

The intersection of two recursively enumerable languages is recursively enumerable.

The intersection of two recursive languages is recursive.

The intersection of two context free languages is context free.

The intersection of two regular languages is regular.

a) is correct

The class of recursively enumerable (RE) languages is closed under intersection.
If L1 and L2 are RE languages, then L1 ∩ L2 is also RE.
This can be done by constructing a Turing machine that runs the machines for both L1 and L2 in parallel and accepts if both accept.
For example:
Let L1 = { w | w contains at least one 'a' } and L2 = { w | w contains at least one 'b' }.
Their intersection is L1 ∩ L2 = { w | w contains both 'a' and 'b' }, which is RE.

b) is incorrect

The class of recursive languages is not always closed under intersection.
If L1 and L2 are recursive, their intersection L1 ∩ L2 might not necessarily be recursive because deciding membership in L1 ∩ L2 could require undecidable steps.
For example:
Let L1 = { w | w halts on input 0 } and L2 = { w | w halts on input 1 }.
Their intersection is L1 ∩ L2 = { w | w halts on both input 0 and input 1 }, which is not recursive because the halting problem is undecidable.

c) is incorrect

The class of context-free languages (CFLs) is not closed under intersection.
There exist CFLs L1 and L2 such that their intersection L1 ∩ L2 is not a CFL.
For example:
Let L1 = { aⁿ bⁿ c^m | n, m ≥ 0 } and L2 = { a^m bⁿ cⁿ | n, m ≥ 0 }.
Their intersection is L1 ∩ L2 = { aⁿ bⁿ cⁿ | n ≥ 0 }, which is not a CFL.

d) is correct

The class of regular languages is closed under intersection.
If L1 and L2 are regular, then L1 ∩ L2 is also regular.
This can be achieved using the product construction of finite automata.
For example:
Let L1 = { w | w starts with 'a' } and L2 = { w | w ends with 'b' }.
Their intersection is L1 ∩ L2 = { w | w starts with 'a' and ends with 'b' }, which is regular.

So, a, c, d is correct option

Ques 8 Automata

Consider the following language L = {w ∈ {0,1}*| w does not contains three or more consecutive 1's}. The number of states in minimal DFA that accepts L is

4 is the correct answer.

Ques 9 Automata

Consider the following grammar:
S —> aSb|X
X —>aX|Xb|a|b
What can be said about the language generated by grammar?

The regular expression for language generated by the grammar is a*(a + b)b*

The language generated by the grammar is non-regular

The regular expression for language generated by the grammar is a* b*(a + b)

The regular expression for language generated by the grammar is (a + b)*

Ques 10 Computer Science

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.

Only S1 is TRUE.

Only S1 and S2 are TRUE.

S1, S2, and S3 are all TRUE.

Only S1 and S3 are TRUE.

Ques 11 Computer Science

Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap?

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

Ques 12 Computer Science

Let SLLdel 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 DLLdel 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 SLLdel and DLLdel?

SLLdel is O(1) and DLLdel is O(n)

Both SLLdel and DLLdel are O(log(n))

Both SLLdel and DLLdel are O(1)

SLLdel is O(n) and DLLdel is O(1)

Ques 13 Computer Science

Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s,p,q,r}, with s being the start state and p being the only final state.

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

1(0*11)*

0(0+1)*

1(0+11)*

1(110*)*

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2023 Questions with Answer