About

I am learner and explorer.

Role

Alma Mater:

Not updated.

Experience:

Not updated.
Techtud Editor
Short answer
8 months 2 weeks ago

yes

moreless
Techtud Editor
Answer
8 months 3 weeks ago

For candidate key, it is yes
but, for primary key, it depends on database administrator whether he wants it to be primary key or not.

moreless
Techtud Editor
Answer
8 months 3 weeks ago

If all finite subsets of L are regular, then L is regular. // true 
but the statement regular language has got its finite subset as regular is  not true.

You can analyse these statements by taking examples.
 

 

moreless
Techtud Editor
Answer
8 months 3 weeks ago
record size = 64 B
index size = 14+2= 16B
blocking factor for record file = 512/64 = 8
blocking factor for index file = 512/16= 32
So, for no. of levels , we have 16K/8= 2K
(ceil)2K/32= 64
(ceil)64/32 =2
(ceil)2/32 =1
So , total 3 levels are required/
moreless
Techtud Editor
Answer
8 months 3 weeks ago

It is one of the implementation of sequence points, undefined behaviour is its output.

moreless
narayanapot's picture
Lakshminarayana Potukuchi
ishan58's picture
Ishan Bhardwaj
sumitverma's picture
Sumit Verma
virtualgate's picture
Virtual GATE
ranita's picture
Ranita Biswas
pritam's picture
Pritam Prasun
pritam's picture
Pritam Prasun
905
shakirhussain's picture
shakir qureshi
1661
simerwadhwa's picture
simer
3222
hero_cs
4709
habibkhan's picture
Habib Mohammad Khan
10290
phanindra's picture
phanindra
10613
sumitverma's picture
Sumit Verma
10677
bantiarya's picture
Banti Arya
10915
AARSHI KANSWA
12929
jecking22's picture
Vijay
13338
rishiyadav's picture
Rishi Yadav
18025
sanjayrao's picture
sanjay
18739
Saurav Shaw
19930
Rahul
21624
Nikhil
21642

Pages

30 Oct 2017 - 7:13pm

For candidate key, it is yes
but, for primary key, it depends on database administrator whether he wants it to be primary key or not.

more less
28 Oct 2017 - 1:23pm

If all finite subsets of L are regular, then L is regular. // true 
but the statement regular language has got its finite subset as regular is  not true.

You can analyse these statements by taking examples.
 

 

more less
27 Oct 2017 - 4:25pm
record size = 64 B
index size = 14+2= 16B
blocking factor for record file = 512/64 = 8
blocking factor for index file = 512/16= 32
So, for no. of levels , we have 16K/8= 2K
(ceil)2K/32= 64
(ceil)64/32 =2
(ceil)2/32 =1
So , total 3 levels are required/
more less
27 Oct 2017 - 11:18am

It is one of the implementation of sequence points, undefined behaviour is its output.

more less
26 Oct 2017 - 8:28pm

F(x) can be redefined as A*X
det(A) =a0*a1*a2*...*an
 

more less
26 Oct 2017 - 6:51pm

This question has got more emphasis on keyword "uniformly distributed"
then it means that [0,500] occurs twice to make it 1000 tuples.
So, for σA≤100(r), we have got 200 tuples.

more less
26 Oct 2017 - 6:45pm

maximum possible size of file depends on no. of blocks and size of blocks.
where, no. of blocks =disk size/block size

more less
16 Oct 2017 - 10:57am

random number is calculated by a predefined formula .

more less
16 Oct 2017 - 12:03am

best case when all are 1's then , time complexity is Ω(n)
worst case happens when all are 0's ,then , time complexity is O(n2)
average case happens when it has equal no. of 0's and 1's, then , time complexity is O(n2)
o(n) is false since it means strictly lower , so correct ans is Θ(n)

more less
15 Oct 2017 - 10:57pm
ans is 1 and 2 are equivalent reason being in 3 from R we are taking a without checking whether b=1 or not.
more less

Pages