Recent questions tagged 2019 / GATE Overflow for GATE CSE

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

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 I...

SPluto

591 views

SPluto asked May 2, 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 NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard

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....

SPluto

518 views

SPluto asked May 2, 2019

0 votes

0 answers

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 pre-empts 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

A scheduler – such as an OS scheduler – can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority proce...

SPluto

489 views

SPluto asked May 2, 2019

0 votes

2 answers

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.

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 Aggre...

SPluto

497 views

SPluto asked May 2, 2019

1 votes

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

for(; i != 0; i) { printf("\nIITM"); i; }If i is initialized to 100, then IITM will be printed 50 timesIf i is initialized to 101, then IITM will be printed 51 timesBot...

SPluto

635 views

SPluto asked May 2, 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

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 numbe...

SPluto

737 views

SPluto asked May 2, 2019

2 votes

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.

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 dif...

vivek_mishra

491 views

vivek_mishra asked Feb 17, 2019

1 votes

0 answers

8

JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)

Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)](Memory based – Original question had a lot of ad...

dan31

397 views

dan31 asked Feb 17, 2019

0 votes

0 answers

9

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.

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 decr...

dan31

482 views

dan31 asked Feb 17, 2019

1 votes

0 answers

10

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.

Suppose that G contains a cycle C, and a path of length at least k between some twovertices of C. Show that G contains a cycle of length at least √k.

dan31

414 views

dan31 asked Feb 17, 2019

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