0 votes
93
what is schema an subschema in dbms a subschema can be used to a)create very different , personalized views of the same datab) hide sensitive information by omitting fie...
0 votes
94
I have read in theory that multiple aggregation = innermost aggregation ,So I was expecting result as min(price)BUTwhen I run this program on www.w3school.com <SQL ...
1 votes
96
The advantage of MOS devices over bipolar devices is thatit allows higher bit densities and also cost effectiveit is easy to fabricateit is higher-impedance and operation...
1 votes
97
2 votes
98
if anyone got this then plz explain me as well..
0 votes
101
0 votes
102
1 votes
103
0 votes
104
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the first host of first subnet (represent last octet) is ________. M...
0 votes
105
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
0 votes
107
0 votes
108
1. Consider a relation R(ABCD) with candidate keys AB and BC then the number of super keys. of Ris __________a) 8 b) 16 c) 6 d) 10
2 votes
109
How much memory is required to implement $z$-buffer algorithm for a $512 \times 512 \times 24$ bit-plane image?$768$ KB$1$ MB$1.5$ MB$2$ MB
53 votes
110
Consider the following message $M = 1010001101$. The cyclic redundancy check (CRC) for this message using the divisor polynomial $x^5+x^4+x^2+1$ is :$01110$$01011$$10101$...
0 votes
113
0 votes
114
If a grammar is both left and right recursive then it is 1) Definitely Ambiguous 2) May or may not be ambiguous3) Data insufficient4) Unambiguous Please give the general ...
2 votes
115
Serial access memories are useful in applications whereData consists of numbersShort access time is requiredEach stored word is processed differently.None of these
0 votes
116
The minimum time delay between the initiation of two independent memory operations is calledAccess timeCycle timeRotational timeLatency time
0 votes
117
0 votes
118
2 votes
120
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these