Register
Filter

Answers by Bhagirathi

0 votes
31
serializability
1 votes
32
Is decomposition upto 5NF required for gate?
3 votes
33
GATE CSE 2008 | Question: 1
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals $1$ $-1$ $\infty$ $-\infty$
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals$1$$-1$$\infty$$-\infty$
0 votes
34
program
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; } a>10 b>20 c>Compiler error d>Runtime Error
void fun(int *p){ int q = 10; p = &q;} int main(){ int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0;}a>10b>20c>Compiler errord>Runtime Error
0 votes
35
Probablity_basic
What is the probability that a five-card poker hand contains a straight, that is, five cards that have consecutive kinds? Answer is 10240/C(52,5) My approch: 2*(4)^5/C(52,5)
What is the probability that a five-card poker hand contains a straight, that is, five cards that have consecutive kinds?Answer is 10240/C(52,5)My approch:2*(4)^5/C(52,5)...
1 votes
36
GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$
1 votes
37
Probability
4 votes
39
set
set (N,*) , (Z,*) closed or not ?
set (N,*) , (Z,*) closed or not ?
2 votes
40
set
identity element for (N,+) ,(N ,*) , (Z,* ) ,(R,*) exists? where R=real no N =natural no Z=integer
identity element for (N,+) ,(N ,*) , (Z,* ) ,(R,*) exists?where R=real noN =natural noZ=integer
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)
Page: