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 Crackcer
14.9k
views
7
answers
GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...
14.9k
views
commented
Jan 23, 2022
Theory of Computation
gatecse-2020
theory-of-computation
decidability
2-marks
+
–
395
views
2
answers
Made Easy Test Series
Which of the following can be the best algorithm(s) for all pair of the shortest path problem?I. ‘V’ invocations of Dijkstra algorithm ⇒ Ο(VE logV).II. ‘V’ inv...
395
views
answered
Jan 22, 2022
Algorithms
made-easy-test-series
shortest-path
time-complexity
+
–
1.3k
views
1
answers
question
L = {ai bj ck dm} | i+j+k+m is multiple of 13}L is ?(a) Regular (b) Context-free(c) Turing-decidable (d) Turing-Recognizable
1.3k
views
commented
Jan 20, 2022
6.4k
views
6
answers
Databases
A Clustered indexA) is a dense index always.B) is a sparse index always.C) can be either dense index or a sparse index,but not both.D) can be both dense index and sparse ...
6.4k
views
commented
Jan 10, 2022
Databases
databases
indexing
+
–
273
views
1
answers
Order of B and B+ tree(ACE academy test series)
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
273
views
asked
Jan 10, 2022
Databases
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register