The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged 2019
0
votes
1
answer
1
IIT Madras MS written test 2019  TOC  1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
asked
May 2
in
Theory of Computation
by
SPluto
Junior
(
611
points)

97
views
iitmadras
ms
writtentest
2019
0
votes
0
answers
2
IIT Madras MS written test 2019  Algorithms  1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NPhard, LP is not LP is NPhard, SP is not Both are NPhard Neither SP nor LP is NPhard
asked
May 2
in
Algorithms
by
SPluto
Junior
(
611
points)

95
views
iitmadras
ms
writtentest
2019
0
votes
1
answer
3
IIT Madras MS written test 2019  OS  1
A scheduler  such as an OS scheduler  can suffer from the priority inversion problem, in which a lower priority process indirectly preempts a higher priority process, and this can happen due to the usage of shared resources and mutual exclusion. ... the highest priority by the time it exits the CS. S1 alone S2 alone Neither S1 nor S2 Either S1 or S2
asked
May 2
in
Operating System
by
SPluto
Junior
(
611
points)

60
views
iitmadras
ms
writtentest
2019
0
votes
1
answer
4
IIT Madras MS written test 2019  DBMS
Which of the following statements about SQL queries is true? The GROUP BY clause has nothing to do with Aggregate functions. The GROUP BY clause can only be used when Aggregate functions are used. Aggregate functions can only be used when the GROUP BY clause has been used. The GROUP BY clause can be used even when Aggregate functions are not used.
asked
May 2
in
Databases
by
SPluto
Junior
(
611
points)

48
views
iitmadras
ms
writtentest
2019
+1
vote
1
answer
5
IIT Madras MS written test 2019  C prog.
for(; i != 0; i) { printf("\nIITM"); i; } If i is initialized to 100, then IITM will be printed 50 times If i is initialized to 101, then IITM will be printed 51 times Both I and II are true I is true, II is false I is false, II is true Both I and II are false
asked
May 2
in
Programming
by
SPluto
Junior
(
611
points)

62
views
iitmadras
ms
writtentest
2019
0
votes
1
answer
6
IIT Madras MS written test 2019
Which of the following infinite sets have the same cardinality? $\mathbb{N}$ : Set of Natural numbers $\mathbb{E}$ : Set of Even numbers $\mathbb{Q}$ : Set of Rational numbers $\mathbb{R}$ : Set of Real numbers $\mathbb{N}$ and $\mathbb{E}$ $\mathbb{Q}$ and $\mathbb{R}$ $\mathbb{R}$ and $\mathbb{N}$ None of the above
asked
May 2
in
Set Theory & Algebra
by
SPluto
Junior
(
611
points)

81
views
iitmadras
ms
writtentest
2019
+1
vote
0
answers
7
JEST 2019
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint couldn't remember rest of the options.
asked
Feb 17
in
Set Theory & Algebra
by
vivek_mishra
(
459
points)

71
views
jest
2019
discretemathematics
0
votes
1
answer
8
JEST 2019
Solve the recurrence relation given as: T(n)=2T(n2)+n; where T(2)=2 and T(1)=0 What is the time complexity?
asked
Feb 17
in
Algorithms
by
vivek_mishra
(
459
points)

250
views
jest
2019
algorithms
0
votes
0
answers
9
JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary submatrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)
asked
Feb 17
in
Algorithms
by
dan31
Junior
(
823
points)

73
views
jest
2019
algorithms
0
votes
0
answers
10
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
823
points)

83
views
jest
2019
discretemathematics
0
votes
0
answers
11
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
823
points)

55
views
jest
2019
discretemathematics
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIITH Interview Experience
Thanks GO!!
IIIT Hyerabad Interview Expeience  MS by Research in CSE
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
Follow @csegate
Recent questions tagged 2019
Recent Blog Comments
Congratulations :)
Congratulations 😊 👍
Thank you bro @Shaik
Thank you Sir.
congratulations :)
49,532
questions
54,123
answers
187,319
comments
71,044
users