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 syed qamar
4
answers
1
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...
24.0k
views
commented
Nov 29, 2018
Theory of Computation
gatecse-2015-set1
theory-of-computation
pushdown-automata
normal
+
–
2
answers
2
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes?
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes? 2⌈n⁄2⌉ 2(⌊ n/2⌋ ) 2⌈n⁄2⌉ -1 2(�...
6.8k
views
commented
May 23, 2018
Combinatory
counting
combinatory
+
–
2
answers
3
UGC NET CSE | November 2017 | Part 3 | Question: 31
Consider a full binary tree with $n$ internal nodes, internal path length $I$, and external path length $e$. the internal length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path ... of the following is correct for the full binary tree? $e=i+n$ $e=i+2n$ $e=2i+n$ $e=2n+i$
Consider a full binary tree with $n$ internal nodes, internal path length $I$, and external path length $e$. the internal length of a full binary tree is the sum, taken o...
2.3k
views
answered
Apr 27, 2018
Graph Theory
ugcnetcse-nov2017-paper3
data-structures
binary-tree
+
–
1
answer
4
UGC NET CSE | November 2017 | Part 3 | Question: 36
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each edge $(v_i, v_j)$ is assigned a weight $i+j$. The cost of the minimum spanning tree of such a graph with $10$ nodes is $88$ $91$ $49$ $21$
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each...
1.1k
views
commented
Apr 27, 2018
Unknown Category
ugcnetcse-nov2017-paper3
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register