Questions by bhuv / GATE Overflow for GATE CSE

1 votes

0 answers

1

What is Aggregate Analysis? Where to use it? How to use it?

418 views

asked Aug 18, 2017

1 votes

0 answers

2

prims algo from cormen
Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it) Algorithms uses min queue in process, my dobut is when it came to choice b/w vertex 'c' and 'd' as at that ... , so prism deal with this case? If you need algo I will given you, or just please refer chapter 23 cormen prim's algorithm.

Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it)Algorithms uses min queue in process, my dobut is when ...

1.1k views

asked Aug 4, 2017

2 votes

1 answer

3

Kenneth Rosen Edition 6th Exercise 5.3 Question 13 (Page No. 361)
I was doing two Questions of rosen counting chapter Q1. A group contains n mens and n women. How many ways are there to "arrange" these people in a row if the men and women alternate ? Answer is 2(n!)^2, I agree with logic ... from (n+1) places created my positioning the men and permuting them again i.e P(n,n)*P(n+1,n) ??

I was doing two Questions of rosen counting chapterQ1. A group contains n mens and n women. How many ways are there to "arrange" these people in a row if the men and wome...

4.5k views

asked Jul 8, 2017

2 votes

0 answers

4

CLRS Heapsort, number of nodes of height h ?
Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular case to say it is true. But didn't get what going behind it.

Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular ...

491 views

asked Jul 5, 2017

1 votes

1 answer

5

Sheldon Ross chapter 2 questions 26
The game of craps is played as follows: A player rolls two dice. If the sum of the dice is either a 2, 3, or 12, the player loses; if the sum is either a 7 or an 11, the player wins. If the outcome is anything else, the player continues to roll the ... the initial sum is i and the player wins on the nth roll. Argue that P(Ei) =$\sum_{n=1}^{infinte}$ P(Ei,n).

The game of craps is played as follows: A player rolls two dice. If the sum of the dice is either a 2, 3, or 12, the player loses; if the sum is either a 7 or an 11, the ...

2.0k views

asked Jun 8, 2017

2 votes

1 answer

6

sheldon ross, chapter 2, question 17
If 8 rooks are randomly placed on a chessboard, compute the probability that none of the rooks can caputre any of the others. That is compute the probability that no row or file contains more than one rook.

If 8 rooks are randomly placed on a chessboard, compute the probability that none of the rooks can caputre any of the others. That is compute the probability that no row ...

1.3k views

asked Jun 8, 2017

1 votes

0 answers

7

#general #mathematics #PropositionalLogic How to Choose which one is better answer?
How to Choose which one is a better answer and which is ideally good answer in propositional logic? let me tell you the context. Let's take an example. Use quantifiers and predicates with more than one variable ... how to choose the limit of domain and flexibility of it. How to choose which is one is better?

How to Choose which one is a better answer and which is ideally good answer in propositional logic? let me tell you the context. Let's take an example. Use quantifiers an...

444 views

asked Jun 3, 2017

0 votes

1 answer

8

rosen ex 1.3 q-37
c) A student must take at least 60 course hours, or at least 45 course hours and write master's thesis, and receive a grade no lower than a B in all required courses, to receive a master's degree. My question : In book answer is given as MD(x)->{set of ... my answer is {Set of conditions}->MD(x) As we know a->b ≠ b->a Why anyone of the above is correct. ?

c) A student must take at least 60 course hours, or at least 45 course hours and write master's thesis, and receive a grade no lower than a B in all required courses, to ...

563 views

asked May 21, 2017

0 votes

1 answer

9

Subsequence Theorem From Rosen.
There is a theorem Every sequence of n^2 + 1 distinct real numbers contains a subsequence of length n + 1 that is either strictly increasing or strictly decreasing. Proof: Let a1, a2,...,an2+1 be a sequence of n^2 + 1 distinct real numbers.Associate ... ds must be greater than dt , which is a contradiction. My question is how n^2 ordered pair possible for (ik,dk) ??

There is a theoremEvery sequence of n^2 + 1 distinct real numbers contains a subsequence of length n + 1 thatis either strictly increasing or strictly decreasing.Proof: L...

1.5k views

asked May 14, 2017

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