1 answer
1
If a system is Byte-addressable system ,Can we always conclude that 1 word = 1 Byte ???Please explain your answer ...
1 answer
5
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4)ANSWER :PLEASE VERIFY ...
1 answer
6
Above solution GUARANTEES : ProgressDOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvationIs this correct ???
0 answers
11
Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvation-freedom, E) d...
4 answers
12
A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering
6 answers
13
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 ...
3 answers
14
Which of the following statements is TRUE ?A) Every primary index is also a clustered index.B) Every clustered index is also a primary index.C) Both primary index and clu...
0 answers
15
This index is a dense index ...right ...???
0 answers
16
State TRUE or FALSE."In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1"....
2 answers
17
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
0 answers
20
L = { <M / M is a Turing machine and M accepts a regular language }.This Language L is recursively enumerable but not recursive. ...right ??
1 answer
21
This language,L = { <M,w / M is a TM,w is a string and M does not halt on string w }is not recursively enumerable ...right ???
0 answers
23
why the above language is not Recursively enumerable ??? please explain