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
Recent activity by Anand Vijayan
0
answers
1
mit lectures randomised bst
I am referring to this video https://www.youtube.com/watch?v=vgELyZ9LXX4 at 1:08:39 . $n$ : number of nodes in the tree $Z_{n,k}$ : Indicator random variable that activates when rank of the root is k $X_n$ : random variable denoting height of BST $Y_n$ : ... till $n/2$ only. Therefore the choice made by $Z_{n,i}$ affects the possibilities for $Y_{k-1}$ and $Y_{n-k}$
I am referring to this video https://www.youtube.com/watch?v=vgELyZ9LXX4 at 1:08:39 .$n$ : number of nodes in the tree$Z_{n,k}$ : Indicator random variable that activates...
265
views
asked
Aug 15, 2017
1
answer
2
Peterson and Davie Computer networks
Can someone please explain the math in detail.
Can someone please explain the math in detail.
394
views
answer selected
Aug 4, 2017
4
answers
3
TIFR CSE 2016 | Part B | Question: 4
In the following, $A$ stands for a set of apples, and $S(x, y)$ stands for "$x$ is sweeter than $y$. Let $\Psi \equiv \exists x : x \in A$ $\Phi \equiv \forall x \in A : \exists y \in A : S(x, y).$ Which of the following statements implies that there are ...
In the following, $A$ stands for a set of apples, and $S(x, y)$ stands for "$x$ is sweeter than $y$. Let$$\Psi \equiv \exists x : x \in A$$$$\Phi \equiv \forall x \in A :...
3.3k
views
commented
Jul 18, 2017
Mathematical Logic
tifr2016
mathematical-logic
first-order-logic
+
–
7
answers
4
GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable)$((∀x)[α] ⇒ (∀x...
17.0k
views
commented
Jul 16, 2017
Mathematical Logic
gatecse-2003
mathematical-logic
first-order-logic
normal
+
–
6
answers
5
GATE IT 2008 | Question: 27
$G$ is a simple undirected graph. Some vertices of $G$ are of odd degree. Add a node $v$ to $G$ and make it adjacent to each odd degree vertex of $G$. The resultant graph is sure to be regular complete Hamiltonian Euler
$G$ is a simple undirected graph. Some vertices of $G$ are of odd degree. Add a node $v$ to $G$ and make it adjacent to each odd degree vertex of $G$. The resultant graph...
14.2k
views
commented
Jul 12, 2017
Graph Theory
gateit-2008
graph-theory
graph-connectivity
normal
+
–
7
answers
6
TIFR CSE 2015 | Part B | Question: 5
Suppose $\begin{pmatrix} 0&1 &0&0&0&1 \\ 1&0&1&0&0&0 \\ 0&1&0&1&0&1 \\ 0&0&1&0&1&0 \\ 0&0&0&1&0&1 \\ 1&0&1&0&1&0 \end{pmatrix}$ is the adjacency ... the above adjacency matrix? Only $(i)$ Only $(ii)$ Only $(iii)$ Only $(iv)$ $(i)$ and $(ii)$
Suppose $\begin{pmatrix}0&1 &0&0&0&1 \\1&0&1&0&0&0 \\0&1&0&1&0&1 \\0&0&1&0&1&0 \\0&0&0&1&0&1 \\1&0&1&0&1&0\end{pmatrix}$is the adjacency matrix of an undirected graph...
4.4k
views
commented
Jul 11, 2017
Graph Theory
tifr2015
graph-connectivity
graph-theory
+
–
9
answers
7
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
12.9k
views
commented
Jul 5, 2017
Combinatory
gatecse-2001
combinatory
normal
+
–
1
answer
8
binary tree - doubt (in solution given in gatecse blog)
http://gatecse.in/number-of-binary-trees-possible-with-n-nodes/ In the first answer (What is the no. of distinct binary trees possible with n labeled nodes?), "An edge can be made either as a left child of a node or as a ... in right side), the choices allows us to choose like this,we selected n-1 edges,still we didn't get a tree.
http://gatecse.in/number-of-binary-trees-possible-with-n-nodes/In the first answer (What is the no. of distinct binary trees possible with n labeled nodes?), "An edge can...
570
views
commented
Jul 4, 2017
4
answers
9
ISI 2004 MIII
A subset $S$ of set of numbers $\{2,3,4,5,6,7,8,9,10\}$ is said to be good if has exactly $4$ elements and their $gcd=1$, Then number of good subset is $126$ $125$ $123$ $121$
A subset $S$ of set of numbers $\{2,3,4,5,6,7,8,9,10\}$ is said to be good if has exactly $4$ elements and their $gcd=1$, Then number of good subset is$126$$125$$123$$121...
2.8k
views
comment edited
Jul 2, 2017
Combinatory
combinatory
isi2004
discrete-mathematics
normal
+
–
4
answers
10
GATE2014 AE: GA-6
Find the odd one in the following group: $\text{ALRVX, EPVZB, ITZDF,OYEIK}$ $\text{ALRVX}$ $\text{EPVZB}$ $\text{ITZDF}$ $\text{OYEIK}$
Find the odd one in the following group: $\text{ALRVX, EPVZB, ITZDF,OYEIK}$$\text{ALRVX}$$\text{EPVZB}$$\text{ITZDF}$$\text{OYEIK}$
3.1k
views
commented
Jun 2, 2017
Analytical Aptitude
gate2014-ae
odd-one
analytical-aptitude
+
–
2
answers
11
ISI 2017
I find alpha <x+y which gives me x+y<2. But the answer is A. Can someone please help. Consider the statement$:$ $x(\alpha-x)<y(\alpha-y)$ for all $x,y$ with $0<x<y<1.$ The statement is true if and only if $\alpha\geq 2$ if and only if $\alpha >2$ if and only if $\alpha <-1$ for no values of $\alpha$
I find alpha <x+y which gives me x+y<2. But the answer is A. Can someone please help. Consider the statement$:$$x(\alpha-x)<y(\alpha-y)$ for all $x,y$ with $0<x<y<1.$The ...
431
views
answered
Apr 1, 2017
Set Theory & Algebra
isi
inequality
+
–
3
answers
12
TIFR CSE 2012 | Part A | Question: 11
Let $N$ be the sum of all numbers from $1$ to $1023$ except the five primes numbers: $2, 3, 11, 17, 31.$ Suppose all numbers are represented using two bytes (sixteen bits). What is the value of the least significant byte (the least significant eight bits) of $N$? $00000000$ $10101110$ $01000000$ $10000000$ $11000000$
Let $N$ be the sum of all numbers from $1$ to $1023$ except the five primes numbers: $2, 3, 11, 17, 31.$ Suppose all numbers are represented using two bytes (sixteen bits...
1.8k
views
comment edited
Mar 8, 2017
Digital Logic
tifr2012
digital-logic
number-representation
+
–
4
answers
13
GATE2011 AG: GA-10
The horse has played a little known but very important role in the field of medicine. Horses were injected with toxins of diseases until their blood built up immunities. Then a serum was made from their blood. Serums to fight with ... that horses were given immunity to diseases generally quite immune to diseases given medicines to fight toxins given diphtheria and tetanus serums
The horse has played a little known but very important role in the field of medicine. Horses were injected with toxins of diseases until their blood built up immunities. ...
2.6k
views
answered
Mar 7, 2017
Verbal Aptitude
general-aptitude
verbal-aptitude
gate2011-ag
passage-reading
+
–
4
answers
14
GATE2013 AE: GA-2
The Headmaster ___________ to speak to you. Which of the following options is incorrect to complete the above sentence? is wanting wants want was wanting
The Headmaster ___________ to speak to you. Which of the following options is incorrect to complete the above sentence? is wanting wants want was wanting
4.3k
views
answered
Mar 4, 2017
Verbal Aptitude
gate2013-ae
verbal-aptitude
english-grammar
tenses
+
–
2
answers
15
Master's theorem
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1, b>1, k>=0 and p= any real number are satisfied. My doubt is that if k= not a constant( eg: n^n), then can we apply the theorem since we know n will always be positive so k will be positive only?
We know that Master's theorem is applicable if for the reccurence relation T(n)=aT(n/b) +Θ(n^k log^p n) ,the conditions: a>=1, b>1, k>=0 and p= any real number are sati...
499
views
answered
Mar 4, 2017
Algorithms
master-theorem
algorithms
+
–
1
answer
16
ISI 2015 PCB A2
Find all real solutions of the equation $x^{2} - |x-1| - 3 = 0$
Find all real solutions of the equation $x^{2} - |x-1| - 3 = 0$
538
views
answered
Mar 4, 2017
Others
engineering-mathematics
quadratic-equations
isi2015
+
–
3
answers
17
minimum value
If $a, b, c, d$ and $e$ are positive real numbers, then the minimum value of $(a+b+c+d+e)(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e})$ is $25$ $5$ $125$ Cannot be determined.
If $a, b, c, d$ and $e$ are positive real numbers, then the minimum value of $(a+b+c+d+e)(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e})$ is$25$$5$$125$Cann...
708
views
answered
Mar 1, 2017
3
answers
18
TIFR CSE 2013 | Part A | Question: 1
An infinite two-dimensional pattern is indicated below. The smallest closed figure made by the lines is called a unit triangle. Within every unit triangle, there is a mouse. At every vertex there is a laddoo. What is the average number of laddoos per mouse? $\quad 3$ $\quad 2$ $\quad 1$ $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$
An infinite two-dimensional pattern is indicated below.The smallest closed figure made by the lines is called a unit triangle. Within every unit triangle, there is a mous...
1.6k
views
commented
Feb 26, 2017
Combinatory
tifr2013
combinatory
counting
+
–
1
answer
19
Discrete math
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.
475
views
commented
Feb 23, 2017
Set Theory & Algebra
discrete-mathematics
iitg-math
descriptive
non-gate
+
–
2
answers
20
Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
2.2k
views
commented
Feb 23, 2017
Algorithms
algorithms
descriptive
time-complexity
non-gate
+
–
2
answers
21
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A - B) \cup (B - A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
Prove or disprove the following: for finite sets A and B, $\overline{(A - B) \cup (B - A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the ...
476
views
answered
Feb 23, 2017
Set Theory & Algebra
discrete-mathematics
iitg-math
non-gate
descriptive
+
–
0
answers
22
IIIT B admission
Is it true that if someone had got more than 1 arrear in btech(even if it was cleared) cant get admission to IIIT-Banglore whatever be the GATE score and CGPA?
Is it true that if someone had got more than 1 arrear in btech(even if it was cleared) cant get admission to IIIT-Banglore whatever be the GATE score and CGPA?
370
views
asked
Feb 17, 2017
7
answers
23
GATE CSE 2017 Set 1 | Question: 13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.
Consider the following C code:#include<stdio.h int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return...
35.6k
views
commented
Feb 15, 2017
Programming in C
gatecse-2017-set1
programming-in-c
programming
pointers
+
–
9
answers
24
GATE CSE 2017 Set 1 | Question: 53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
Consider the following C program.#include<stdio.h #include<string.h void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) c) ? strlen...
25.3k
views
commented
Feb 15, 2017
Programming in C
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
+
–
3
answers
25
gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?
does Random page replacement algorithm suffers from belady's anomaly?
3.2k
views
commented
Feb 11, 2017
1
answer
26
Shai Simonson Video lectures for TOC
In Shai Simonsons video lecture series , the last few videos are titled as follows : Complexity Theory, Quantified Boolean Formula,Savitchs Theorem, Space hierarchy ,Decidability and complexity relationship,recursion theorem Are any of these part of GATE syllabus ??
In Shai Simonsons video lecture series , the last few videos are titled as follows : Complexity Theory, Quantified Boolean Formula,Savitchs Theorem, Space hierarchy ,Deci...
1.3k
views
answer selected
Feb 9, 2017
0
answers
27
gate cs 2005
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs (a, b) and (c, d) in the chosen set such that "a ≡ c mod 3" and "b ≡ d mod 5" ------------------------------------------------- ... : (2,1) and (8,6) ...so we can have a=2,b=1,c=8,d=6 ....and "2 ≡ 8 mod 3" and "1 ≡ 6 mod 5"
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs (a, b) and (c, d) in the chosen set such that...
820
views
commented
Jan 12, 2017
0
answers
28
Engg Maths syllabus
Is vector calculus in syllabus???? For gate 2017 cse??? Topics like gradient, curl, directional derivative, greens theorem, gauss divergence theorem,..... Are they included???
Is vector calculus in syllabus???? For gate 2017 cse???Topics like gradient, curl, directional derivative, greens theorem, gauss divergence theorem,..... Are they include...
1.9k
views
commented
Jan 10, 2017
1
answer
29
geeks for geeks
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting caught. By some means, the villagers know that their adjacent house is being looted ... ? (a) Brute force (b) Dynamic programming (c) Backtracking (d) Divide and conquer Please provide explanation to your solution :)
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting cau...
2.5k
views
commented
Jan 4, 2017
Algorithms
algorithm-design-technique
+
–
2
answers
30
testbook test series
What is the variance of random variable X whose value when two fair dice are rolled is X((i,j)) = i + j , where i and j are the numbers appearing on the first and second die respectively ? a) 35/6 b) 49/4 c) 91/6 d) 35/12
What is the variance of random variable X whose value when two fair dice are rolled is X((i,j)) = i + j , where i and j are the numbers appearing on the first and second ...
895
views
answered
Dec 24, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register