doubt

A_i_$_h asked Oct 22, 2017 • retagged Jul 13, 2022 by makhdoom ghaya

429 views

2 votes

https://gateoverflow.in/30720/tifr2016-b-7

the above question is already discussed

but still am not clear enuf

can someone help

Algorithms
asymptotic-notation
tifr2016

+ –

A_i_$_h asked Oct 22, 2017 • retagged Jul 13, 2022 by makhdoom ghaya

A_i_$_h

429 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

As a hint: for analysis of asymptotic complexity, take Log ( n! ) = n Log n.

Proof: https://stackoverflow.com/questions/2095395/is-logn-%CE%98n-logn

use this and you will easily get answer for every option.

In case you still have any query, please ask specifically what you are not able to understand.

AskHerOut answered Oct 22, 2017

AskHerOut

See all

1 1 comment

A_i_$_h

commented Oct 22, 2017

@ask

n=m!

Taking log on both sides .

logn = log(m!)

logn=mlogm ( Using strling approximation )

m = logn / logm

aftre this??

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

50 votes

6 answers

Rohith AP asked Dec 13, 2015

6,108 views

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

Rohith AP

6.1k views

Rohith AP asked Dec 13, 2015

Algorithms
tifr2016
algorithms
asymptotic-notation

+ –

6 votes

1 answer

go_editor asked Dec 29, 2016

732 views

TIFR CSE 2016 | Part B | Question: 12
A computer program computes a function $\: f \: \{0, 1\}^* \times \{0, 1\}^* \rightarrow \{0, 1\}^*$. Suppose $f(a, b)$ ahs length $\mid b \mid ^2$, where $\mid a \mid$ and $\mid b \mid$ are the lengths of $a$ and $b$. Suppose, using this program, the following ... $n^2 < t \leq n^{\log_2 n}$ $ n^{\log_2 n} < t \leq 2^{(2n)}$ $2^{(2n)} < t$

A computer program computes a function $\: f \: \{0, 1\}^* \times \{0, 1\}^* \rightarrow \{0, 1\}^*$. Suppose $f(a, b)$ ahs length $\mid b \mid ^2$, where $\mid a \mid$ a...

go_editor

732 views

go_editor asked Dec 29, 2016

Algorithms
tifr2016
algorithms
identify-function

+ –

3 votes

1 answer

go_editor asked Dec 29, 2016

832 views

TIFR CSE 2016 | Part B | Question: 15
Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ so that the resulting graph has no $x-y$ ... and iv are possible but neither ii nor iii ii and iv are possible but neither i not iii iii and iv are possible but neither i nor ii

Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ s...

go_editor

832 views

go_editor asked Dec 29, 2016

Graph Theory
tifr2016
graph-theory
graph-connectivity

+ –

7 votes

1 answer

go_editor asked Dec 29, 2016

1,044 views

TIFR CSE 2016 | Part B | Question: 14
Consider a family $\mathcal{F}$ of subsets of $\{1, 2, \dots , n\}$ such that for any two distinct sets $A$ and $B$ in $\mathcal{F}$ we have: $A \subset B$ or $ B \subset A$ or $A \cap B = \emptyset$. Which of the following statements is TRUE? ... $\mathcal{F}$ such that $\mid \mathcal{F} \mid =2^{n-1}$ None of the above

Consider a family $\mathcal{F}$ of subsets of $\{1, 2, \dots , n\}$ such that for any two distinct sets $A$ and $B$ in $\mathcal{F}$ we have: $A \subset B$ or $ B \subset...

go_editor

1.0k views

go_editor asked Dec 29, 2016

Set Theory & Algebra
tifr2016
set-theory&algebra
set-theory

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

0

1 1 comment