Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Daggerhunt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Daggerhunt
1
answer
1
TheTrevTutor discrete maths 2 videos
I want to know how good are the videos of discrete maths by TheTrevTutor. Has anyone been following the videos while preparing for GATE? https://www.youtube.com/watch?v=DBugSTeX1zw&list=PLDDGPdw7e6Aj0amDsYInT_8p6xTSTGEi2
I want to know how good are the videos of discrete maths by TheTrevTutor. Has anyone been following the videos while preparing for GATE? https://www.youtube.com/watch?v=D...
303
views
asked
Dec 30, 2016
Combinatory
combinatory
discrete-mathematics
+
–
2
answers
2
Output of this code
Output of this program - int rec(int x) { static int f; if(x == 1) return(1); else __Y__ ; return f ; } What is the value returned by rec(5) ​a) when Y is f = f * 1 + rec(x-1) ; b) when Y is f = f * x + rec(x-1) ; What is proper way to solve this ?
Output of this program - int rec(int x){ static int f; if(x == 1) return(1); else __Y__ ; return f ;} What is the value returned by rec(5)​a) ...
2.6k
views
commented
Dec 22, 2016
Programming in C
programming-in-c
recursion
+
–
1
answer
3
GATE PRACTICE
Avoid the any syntax error ,if there is:What will be the output of the following code ? #inlcude<stdio.h> void myfun(int i) { if(i>0) { myfun(i-1); printf("%d",i); myfun(i-1); } } int main() { myfun(3); }
Avoid the any syntax error ,if there is:What will be the output of the following code ? #inlcude<stdio.h void myfun(int i) { if(i>0) { myfun(i-1); printf("%d",i); myfun(i...
893
views
commented
Dec 22, 2016
Programming in C
programming-in-c
recursion
+
–
2
answers
4
set theory
What is the number of relations which are either symmetric or antisymmetric on a set with 3 elements?
What is the number of relations which are either symmetric or antisymmetric on a set with 3 elements?
1.9k
views
commented
Dec 19, 2016
Set Theory & Algebra
set-theory&algebra
relations
+
–
4
answers
5
GATE CSE 2000 | Question: 2.19
Let $G$ be an undirected graph. Consider a depth-first traversal of $G$, and let $T$ be the resulting depth-first search tree. Let $u$ be a vertex in $G$ and let $v$ be the first new (unvisited) vertex visited after visiting $u$ in the traversal. Which of the following ... in $T$ If $\{u, v\}$ is not an edge in $G$ then $u$ and $v$ must have the same parent in $T$
Let $G$ be an undirected graph. Consider a depth-first traversal of $G$, and let $T$ be the resulting depth-first search tree. Let $u$ be a vertex in $G$ and let $v$ be t...
18.4k
views
asked
Nov 16, 2014
Algorithms
gatecse-2000
algorithms
graph-algorithms
normal
+
–
1
answer
6
What is the best way to study C programming for GATE 2015?
4.6k
views
answer selected
Nov 2, 2014
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register