Register

JNU

378 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Vasu_gate2017 asked Sep 30, 2016
365 views
JNU
User Avatar
0 votes
0 votes
0 answers
2
MonikaV asked May 19, 2019
234 views
jnu mtech 2016- 47
Which of the following is not true about Turing machine? (a) It can accept any palindrome (b) It can accept any context free language (c) It can accept {a^m b^n c^mn:m,n>=0 (d) One tape Turing machine can be converted into C++ programs
Which of the following is not true about Turing machine?(a) It can accept any palindrome(b) It can accept any context free language(c) It can accept {a^m b^n c^mn:m,n>=0(...
User Avatar
0 votes
0 votes
0 answers
3
8676rau asked Feb 24, 2019
1,911 views
JNU , DS TREE, INORDER
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal would return (a) FAEKCDBHG (b) FAEKCDHGB (c) EAFKHDCBG (d) FEAKDCHBG
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal wouldreturn(a) FAEKCDBHG(b) FAEKCDHGB(c) EAFKHDCBG(d) FEAKDCHBG
User Avatar
0 votes
0 votes
1 answer
4
nepobose asked May 14, 2018
333 views
JNU exam
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partitions are a) {{6},{7},{8,9},{10}} b) {{6,7,8},{9,10}} c) {{6},{7,8},{9,10}} d) {{6,7},{8,9,10}}
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partit...
User Avatar
Link Copied!