Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Himanshu555
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Himanshu555
0
votes
2
answers
1
mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).
Which of the following statements is/are true?A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree.B. In a label...
589
views
asked
Nov 8, 2022
Algorithms
made-easy-test-series
graph-theory
depth-first-search
graph-algorithm
+
–
0
votes
0
answers
2
made easy test series
Caption
Caption
366
views
asked
Oct 24, 2022
Compiler Design
made-easy-test-series
three-address-code
grammar
+
–
0
votes
0
answers
3
TOC doubt
How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countable? Please explain I am getting confused in this.
How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countab...
155
views
asked
Aug 5, 2022
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register