Register
Filter

Questions by resilientknight

5 votes
2 answers
1
database-indexing-2
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
5 votes
1 answer
2
database-indexing
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
2 votes
4 answers
3
database-query-normalization-true-false
if table r has only one candidate key then which of the following is true: if R is in 3nf,it is also in bcnf R may not be in bcnf
if table r has only one candidate key then which of the following is true:if R is in 3nf,it is also in bcnfR may not be in bcnf
4 votes
3 answers
4
er model,databases
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE. a) 1:n b)m:m c)n:1 d) none
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE.a) 1:nb)m:mc)n:1d) none
1 votes
1 answer
5
databases-query
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
1 votes
1 answer
6
toc - doubt
W(Wr)+, w belongs to (0*,1*) is Csl because? Is it because we cant decide the no of Wr or the content inside the Wr or both? so if 0111,011,001 a seperate kind of comparison for each? <------- this is the reason?
W(Wr)+, w belongs to (0*,1*) is Csl because? Is it because we cant decide the no of Wr or the content inside the Wr or both? so if 0111,011,001 a seperate kind of compari...
1 votes
2 answers
7
conflict serializability
Consider a schedule S: r1(A); W1(B); W1(C); r2(A); W2(B); W2(C); abort2; r3(A); W3(B); W3(C); C1; C3 How many conflict equivalent serial schedules are possible for the given schedule ?
Consider a scheduleS: r1(A); W1(B); W1(C); r2(A); W2(B); W2(C); abort2; r3(A); W3(B); W3(C); C1; C3 How many conflict equivalent serial schedules are possible for the giv...
1 votes
0 answers
8
Internet- restructuring of b + tree - deletion
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become the root?
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become t...
2 votes
1 answer
9
mutual exclusion,deadlock problem
which of the following statements are correct? a. 1 only b. 2 only c. both d. none
which of the following statements are correct?a. 1 onlyb. 2 onlyc. bothd. none
0 votes
1 answer
13
deadlock question
0 votes
1 answer
14
confusing question? use hierarchical or simultenous
if i use hierarchical system then the equation : 50 = 10 + 0.3(p*400 + (1-p)*125)... is correct?
if i use hierarchical system then the equation : 50 = 10 + 0.3(p*400 + (1-p)*125)... is correct?
2 votes
0 answers
15
operating system - stack,heap,text,numerical
a process has 3 sections stack heap and text and if the size of the page table is 2 mb then on average amount of unused page space per process is?
a process has 3 sections stack heap and text and if the size of the page table is 2 mb then on average amount of unused page space per process is?
2 votes
1 answer
16
true false statment, i-node,FAT
Reading a random location in a big file is faster in i-node based file systems than in FAT file systems. True or False?
Reading a random location in a big file is faster in i-node based file systems than in FAT file systems.True or False?
0 votes
1 answer
17
file system-directory entry
which of the following is not contained in a directory entry of a file? a) file name and extension b) no of free blocks in the disk c) access control d) creation date
which of the following is not contained in a directory entry of a file?a) file name and extensionb) no of free blocks in the diskc) access controld) creation date
2 votes
4 answers
18
operating system cpu utilization
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking on i/o. if s<q<r, then cpu efficiency? a )q/q+s b) q/r+s c) r/r+s d) qr/r+s
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking o...
2 votes
1 answer
19
OS - Privileged,non-privileged concept,typical/crucial
can a non privileged instruction be executed in privileged mode?(like when returning from kernel to user mode) or is it necessary to make it a privileged instruction?
can a non privileged instruction be executed in privileged mode?(like when returning from kernel to user mode) or is it necessary to make it a privileged instruction?
1 votes
1 answer
20
co - memory interface query,whether to do or not
Do we need to practise memory interfacing (not given in syllabus) questions? but people are actively answering questions here on memory interface. If yes, what types might come?
Do we need to practise memory interfacing (not given in syllabus) questions? but people are actively answering questions here on memory interface. If yes, what types migh...
Page: