CS/IT Gate Yearwise
CS/IT Gate 2022
CS/IT Gate 2021
CS/IT Gate 2020
CS/IT Gate 2019
CS/IT Gate 2018
CS/IT Gate 2017 (Set 1)
CS/IT Gate 2017 (Set 2)
CS/IT Gate 2016 (Set 1)
CS/IT Gate 2016 (Set 2)
CS/IT Gate 2015 (Set 1)
CS/IT Gate 2015 (Set 2)
CS/IT Gate 2015 (Set 3)
CS/IT Gate 2014 (Set 1)
CS/IT Gate 2014 (Set 2)
CS/IT Gate 2014 (Set 3)
Computer Science Gate 2023 Questions
Ques 1Aptitude
We reached the station late, and _______ missed the train.
a) Mostly
b) Near
c) Utterly
d) Nearly
d is the correct answer.
Ques 2Aptitude
Kind : ______ :: often : frequently
a) Type
b) Cruel
c) Mean
d) Kindly
a is the correct answer.
Ques 3Aptitude
90% of the pregnant women take medical care atleast once before child birth. Out of
them, 60% took medical care from doctors while the remaining took medical care from
health providers.
What can be logically inferred from this?
a) More than half of the pregnant women took medical care atleast once before child birth.
b) More than half of the pregnant women took medical care atmost once before child birth.
c) Exactly half of the pregnant women took medical care atleast once before child birth.
d) Atleast half of the pregnant women took medical care atmost once before child birth.
a is the correct answer.
Ques 4Aptitude
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?
a) f(x)=0 and g(y)=0
b) f(x) = g(y) = constant
c) f(x) + g(y) = f(x) - g(y)
d) f(x)≠constant and g(y)≠constant
b is the correct answer.
Ques 5Aptitude
A series of natural numbers πΉ1, πΉ2, πΉ3, πΉ4, πΉ5, πΉ6, πΉ7, β¦ obeys πΉπ+1 = πΉπ + πΉπβ1
for all integers π β₯ 2 .
If πΉ6 = 37, and πΉ7 = 60, then what is πΉ1 ?
a) 4
b) 5
c) 8
d) 9
a is the correct answer.
Ques 6Aptitude
A survey for a certain year found that 90% of pregnant women received medical care at least once before giving birth. Of these women, 60% received medical care from doctors, while 40% received medical care from other healthcare providers. Given this information, which one of the following statements can be inferred with certainty?
a) More than half of the pregnant women received medical care at least once from a doctor.
b) Less than half of the pregnant women received medical care at least once from a doctor.
c) More than half of the pregnant women received medical care at most once from a doctor.
d) Less than half of the pregnant women received medical care at most once from a doctor.
a is the correct answer.
Ques 7Aptitude
Looking at the surface of a smooth 3-dimensional object from the outside, which one of the following options is TRUE?
a) The surface of the object must be concave everywhere.
b) The surface of the object must be convex everywhere.
c) The surface of the object may be concave in some places and convex in other places.
d) The object can have edges, but no corners.
d is the correct answer.
Ques 8Aptitude
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?
a) All the working population of Zombieland will henceforth ride bicycles to work.
b) Riding bicycles will ensure that all of the working population of Zombieland is free of health issues.
c) The health experts suggested to the Government of Zombieland to declare riding bicycles as mandatory.
d) The Government of Zombieland believes that riding bicycles is a form of physical exercise.
d is the correct answer.
Ques 9Automata
Which of the following is true?
a) The intersection of two recursively enumerable languages is recursively enumerable.
b) The intersection of two recursive languages is recursive.
c) The intersection of two context free languages is context free.
d) The intersection of two regular languages is regular.
a,c,d is the correct answer.
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 = { an bn cm | n, m β₯ 0 }
and L2 = { am bn cn | n, m β₯ 0 }
.
Their intersection is L1 β© L2 = { an bn cn | 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 10Automata
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 11Automata
Consider the following grammar:
S β> aSb|X
X β>aX|Xb|a|b
What can be said about the language generated by grammar?
a) The regular expression for language generated by the grammar is a*(a + b)b*
b) The language generated by the grammar is non-regular
c) The regular expression for language generated by the grammar is a* b*(a + b)
d) The regular expression for language generated by the grammar is (a + b)*
a is the correct answer.
Ques 12DBMS
Which one of the option given below refers to the degree of relation in relational database systems?
a) Number of distinct domains of its relation schema.
b) Number of attributes of its relation schema.
c) Number of entries in the relation.
d) Number of tuples stored in the relation.
b is the correct answer.
Ques 13Descrete Mathematics
Suppose you look at a three-dimensional figure. Which of the following must necessarily be true?
a) All parts are concave
b) All parts are convex
c) The figure can have edges but no corners
d) Some parts may be concave and some may be convex
d is the correct answer.
Ques 14OS
Which of the following CPU scheduling algorithm can potential cause starvation?
a) FCFS
b) SJF
c) Priority scheduling
d) Round Robin
b,c is the correct answer.
Ques 15OS
Consider a computer system with 57 bit virtual address using multilevel page tables with L levels for virtual to physical address translation. The page size is 4 KB and page table entry at any of the levels occupy 8 bytes. What is the value of L?
5 is the correct answer.
Ques 16OS
Which one or more of the following option guarantee that a computer system transit from user mode to kernel mode
a) Page fault
b) System call
c) Malloc call
d) Function call
a,b is the correct answer.
Ques 17OS
Which one of more of the following need to be saved on context switch form one thread (T1) of a process to another thread (T2) of the same process?
a) Program counter
b) Stack pointer
c) General purpose register
d) Page table base register
a,b,c is the correct answer.
Computer Science
Gate 2023 Questions