Register
Filter

Answers by Bhagirathi

0 votes
41
INDEXING DATABASE
Clustering index is always sparse?? comment with explanation...??
Clustering index is always sparse?? comment with explanation...??
0 votes
42
why do we not apply Binary search for insertion in the heap ?
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn), time complexity in case of binary search- O(logn) and in case of linear it is also O(logn)
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn),time complexity in case of binary search- O(logn) and in case of linear it i...
3 votes
43
CO 2001
A processor needs software interrupt to (a) test the interrupt system of the processor (b) implement co routines (c) obtain system services which need execution of priviledge instructions (d) return from subroutine
A processor needs software interrupt to(a) test the interrupt system of the processor(b) implement co routines(c) obtain system services which need execution of priviledg...
37 votes
44
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
0 votes
48
The process of assigning similar objects/entities to object/entity type known as
The process of assigning similar objects/entities to object/entity type known as a)Classification b)Instantiation c)Specialization d)Generalization
The process of assigning similar objects/entities to object/entity type known asa)Classification b)Instantiationc)Specializationd)Generalization
0 votes
50
Segmentation
Segmentation may contain a) Internal fragmentation b) External fragmentation c) Both d) None Also please explain the answer...
Segmentation may contain a) Internal fragmentationb) External fragmentationc) Both d) NoneAlso please explain the answer...
3 votes
54
simple uniform hashing
why in a hash table in which collisions are resolved by a chaining , a successful search takes average- case time ⊖(1+load factor) ,under the assumption of simple uniform hashing ?
why in a hash table in which collisions are resolved by a chaining , a successful search takes average- case time ⊖(1+load factor) ,under the assumption of simple unifo...
3 votes
55
process state
When parent process executes fork system call process moves into a) created state b)ready state c)running state d)zombie state
When parent process executes fork system call process moves into a) created state b)ready state c)running state d)zombie state
0 votes
56
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
5 votes
57
hashing
In a separate chaining hash table with load factor =0.8, what is the average length of a list ? a) 0.8 b) 1.0 c) 1.25 d) there is not enough information e) there is enough information, but none of the above are correct
In a separate chaining hash table with load factor =0.8, what is the average length of a list ?a) 0.8 b) 1.0 c) 1.25d) there is not enough informatione) there is enough i...
4 votes
58
linear probing
How are elements deleted in linear probing ? (a) Deletion is not allowed (b) they are changed to zero (c) they are marked deleted (d) unchecked deallocation (e) None of the above
How are elements deleted in linear probing ?(a) Deletion is not allowed(b) they are changed to zero(c) they are marked deleted(d) unchecked deallocation(e) None of the ab...
0 votes
59
DBMS general
Decompose a relation into 3NF , BCNF, 2NF , How to get it?
Decompose a relation into 3NF , BCNF, 2NF , How to get it?
0 votes
60
DFA to accept a binary number divisible by 2
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
6 votes
65
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways...
0 votes
66
is it context free?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ? i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language as a^n b^n c^2n ?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ?i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language ...
0 votes
69
Matching in graph theory
Can anone please explain what is a perfect matching in graph theory?
Can anone please explain what is a perfect matching in graph theory?
–1 votes
70
Omega notation
Is sqrt(n)+ log n = omega(log n)? If yes then please explain why...?
Is sqrt(n)+ log n = omega(log n)? If yes then please explain why...?
Page: