14.9k
views
7 answers
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...
395
views
2 answers
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...
1.3k
views
1 answers
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
6.4k
views
6 answers
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 ...
273
views
1 answers
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...