Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by slow_but_detemined
1
votes
1
TIFR CSE 2016 | Part B | Question: 11
Let $n \geq 4$ be an integer. Regard the set $\mathbb{R}^n$ as a vector space over $\mathbb{R}$. Consider the following undirected graph $H$ ... inifinite number of vertices The diameter of $H$ is infinite $H$ is conneceted $H$ contains an infinite clique $H$ contains an infinite independent set
Let $n \geq 4$ be an integer. Regard the set $\mathbb{R}^n$ as a vector space over $\mathbb{R}$. Consider the following undirected graph $H$.$$ V(H) = \{S \subseteq \math...
732
views
answered
Dec 4, 2019
Graph Theory
tifr2016
graph-theory
graph-connectivity
+
–
4
votes
2
IIIT BLR TEST 1 : ALGORITHMS 1
Solve the following recursions ( in terms of Θ ). T(0) = T(1) = Θ(1) in all of the following. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$ $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$
Solve the following recursions ( in terms of Θ ).T(0) = T(1) = Θ(1) in all of the following.$T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$$T(n) = n + ...
811
views
answered
Aug 28, 2019
Algorithms
iiit-blr
algorithms
time-complexity
recurrence-relation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register