Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Psnjit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Psnjit
10
answers
1
GATE CSE 2005 | Question: 82a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that ... of $G$ the weighted shortest path from $s$ to $t$ each path from $s$ to $t$ the weighted longest path from $s$ to $t$
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...
12.6k
views
commented
Apr 24, 2019
Algorithms
gatecse-2005
algorithms
graph-algorithms
normal
+
–
1
answer
2
Kenneth H Rosen 7th edition
Please see example 6. l am not getting the mathematical insight. Can anyone please tell how they are arriving at the answer.
Please see example 6. l am not getting the mathematical insight. Can anyone please tell how they are arriving at the answer.
724
views
asked
Apr 21, 2019
Combinatory
kenneth-rosen
discrete-mathematics
combinatory
+
–
0
answers
3
Gate counseling
My gate 2019 rank is 2966, score 563, marks 48.67 which colleges I can get with this rank? I belong to unreserved category. Graduation marks 68%.
My gate 2019 rank is 2966, score 563, marks 48.67 which colleges I can get with this rank? I belong to unreserved category. Graduation marks 68%.
526
views
asked
Apr 10, 2019
0
answers
4
Self doubt
Which fields of DLL, NL and TL header get changed during routing?
Which fields of DLL, NL and TL header get changed during routing?
143
views
asked
Jan 31, 2019
2
answers
5
Ace Test Series: Algorithms - Time Complexity Notation
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
843
views
answer edited
Jan 29, 2019
Algorithms
ace-test-series
algorithms
time-complexity
+
–
2
answers
6
made easy test series
Consider the following language:? L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’} Is L regular? If so, please provide a DFA for L.
Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...
3.2k
views
answered
Jan 29, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
2
answers
7
self doubt
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
504
views
commented
Jan 29, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
0
answers
8
Ace Test Series: Algorithms - Prims Algorithm Time Complexity
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is- 1. (n+e)*log^2n 2. n^2 3. n^2*logn 4. n*logn
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is-1. (n+e)*log^2n...
323
views
asked
Jan 29, 2019
Algorithms
ace-test-series
+
–
1
answer
9
Doubt
What is the exact definition of full and complete binary tree? And what is the relation between them.
What is the exact definition of full and complete binary tree? And what is the relation between them.
232
views
commented
Jan 27, 2019
0
answers
10
Graph Theory
What is the relation between cut set and edge connectivity?
What is the relation between cut set and edge connectivity?
187
views
asked
Jan 20, 2019
3
answers
11
GATE CSE 1996 | Question: 2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot $1, 2, 3, \dots n$ $n, n-1, n-2, \dots, 2, 1$ Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then, $C_1 < C_2$ $C_1 > C_2$ $C_1 = C_2$ we cannot say anything for arbitrary $n$
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot$1, 2, 3, \dots n$$n, n-1, n-2, \dots, 2, 1$Let $C_1$ and $C_2$ be the...
10.9k
views
commented
Jan 18, 2019
Algorithms
gate1996
algorithms
sorting
normal
+
–
2
answers
12
GATE CSE 2016 Set 2 | Question: 39
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the wor...
16.3k
views
commented
Jan 15, 2019
Algorithms
gatecse-2016-set2
algorithms
time-complexity
recurrence-relation
normal
numerical-answers
+
–
1
answer
13
C Programming
main() { unsigned int i= 255; char *p= &i; int j= *p; printf("%d\n", j); unsigned int k= *p; printf("%d", k); } Both the outputs are -1. I have even tried with - int i = 255(3rd line). Still the output is -1. I don't understand how it is -1.
main(){unsigned int i= 255;char *p= &i;int j= *p;printf("%d\n", j);unsigned int k= *p;printf("%d", k);} Both the outputs are -1. I have even tried with - int i = 255(3rd ...
1.1k
views
comment edited
Jan 12, 2019
Programming in C
programming-in-c
output
programming
pointers
+
–
0
answers
14
Deadlock
I got confused between 2 options of a question- 1. Safe and not deadlock 2. Not safe and not deadlock. Can anybody tell me the difference between these 2 options?
I got confused between 2 options of a question-1. Safe and not deadlock2. Not safe and not deadlock.Can anybody tell me the difference between these 2 options?
222
views
commented
Jan 2, 2019
2
answers
15
Paging ,os. Galvin book page no. 332
Paging increases context switch time how and why ???
Paging increases context switch time how and why ???
6.9k
views
commented
Sep 13, 2018
Operating System
operating-system
paging
context-switch
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register