Answers by Kumar Ashish / GATE Overflow for GATE CSE

13 votes

1

GATE CSE 2014 Set 1 | Question: 49
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. The set of all possible $1-$pennants is ${(1)}$, the set of all possible ... $(1,2)$ is not the same as the pennant $(2,1)$. The number of $10-$pennants is________

A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. ...

11.8k views

answered Jun 17, 2018

1 votes

2

GATE CSE 2003 | Question: 34
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be placed in the bags if each bag must contain at least $k$ ... $\left( \begin{array}{c} m - kn + n + k - 2 \\ n - k \end{array} \right)$

$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be place...

11.6k views

answered Jun 9, 2018

2 votes

3

Introduction to Computer Theory
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?

Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?

469 views

answered Apr 13, 2018

1 votes

4

BST Data Structure
a:) If given Tree is BST => Inorder of keys is sorted b:) Inorder of keys is sorted => Tree is BST(converse of above) I know first one holds.Is second one also true?If not can someone give counter example?

a:) If given Tree is BST = Inorder of keys is sortedb:) Inorder of keys is sorted = Tree is BST(converse of above)I know first one holds.Is second one also true?If not ca...

733 views

answered Apr 12, 2018

2 votes

5

time complexity

591 views

answered Apr 11, 2018

5 votes

6

#Algorithms MST Question Doubt
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is decreased by the same value (constraint is - keeping all edge positive all the time), then is it TRUE or FALSE? Shortest path between any pair of vertices does not change?

Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is decreased by the same value (constraint is - keeping all edge ...

996 views

answered Apr 11, 2018

2 votes

7

Regular Expressions
Can (ab* + b)* be written as (a + b)*.If so then how?

Can (ab* + b)* be written as (a + b)*.If so then how?

577 views

answered Apr 7, 2018

1 votes

8

TIFR CSE 2016 | Part B | Question: 7
Let $n = m!$. Which of the following is TRUE? $m = \Theta (\log n / \log \log n)$ $m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$ $m = \Theta (\log^2 n)$ $m = \Omega (\log^2 n)$ but not $m = Ο(\log^2 n)$ $m = \Theta (\log^{1.5} n)$

Let $n = m!$. Which of the following is TRUE?$m = \Theta (\log n / \log \log n)$$m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$$m = \Theta (\log...

6.3k views

answered Mar 29, 2018

3 votes

9

Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?
Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?

Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?

8.9k views

answered Feb 6, 2018

0 votes

10

[Discrete maths] Predicate logic
Which of the following is true about below predicate logic P? A) P is satisfiable B) P is tautology C) P is contradiction D) None This expression in the end reduces to:- ~ ∀z { True } Now this should mean => ∃z { False} So, how can it be contradiction as given answer is contradiction

Which of the following is true about below predicate logic P?A) P is satisfiableB) P is tautologyC) P is contradictionD) NoneThis expression in the end reduces to:-~ ∀z...

464 views

answered Feb 1, 2018

3 votes

11

Mathematical Logic
$Student(a)$ : $a$ is a student $Loves(a,b)$ : $a$ loves $b$ Consider the following First Order Logic Statement: $\exists x (Student(x)\ \Lambda\ \forall y(student(y)\ \Lambda\ \sim(x=y)\Rightarrow Loves(y,x)\ ))$ Which of the following is ... by every other student There is a student who is not loved by every other student I think here B) and C) both could be answer, Isnot it??

$Student(a)$ : $a$ is a student$Loves(a,b)$ : $a$ loves $b$Consider the following First Order Logic Statement:$\exists x (Student(x)\ \Lambda\ \forall y(student(y)\ \Lamb...

791 views

answered Feb 1, 2018

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