is the entire database.
is a standard way of organizing information into accessible parts.
describes how data is actually stored on disk.
both A) and C)
A. is the entire database.
Primary key
Secondary Key
Foreign Key
None of these
1
2
3
4
top-down approach.
bottom-up approach.
left-right approach.
none of the above
i, ii only
ii and iv only
ii and iv only
i, iv only
Two-phase locking
Timestamped based locking
Graph-based locking
none of the above
only i)
only i) and ii)
only ii) and iii)
i) ii) iii)
Subschema of the database
Schema of the database
Structure of the database
View of the database
1NF
2NF
3NF
BCNF
Physical data independence
Logical data independence
External data independence
Static data
12 bits
16 bits
24 bits
28 bits
where
exist
with
select
magnetic tape
juke box
optical disk
All of the above
entity integrity rule
referential integrity constraint
composite attribute
action assertion
Ellipse
Dashed ellipse
Dashed Rectangle
Doubled Rectangle
active rules
passive rules
inferences
none of the above
Left Right approach
Right Left approach
Top Down approach
Bottom Up approach
First
Second
Third
BCNF
Attenuation
Distortion
Delay
Noise
BCNF is stronger than 3NF
Relational algebra is a non-procedural language
Every conflict serializable schedule is view serializable.
none of the above
System View
User View
Logical View
Data View
procedural query language
nonprocedural query language
scan(), write()
none of the above
Partner
Mutual
Exclusive
Atomic
sequential access storage
direct access storage
random access storage
none of the above
executable statement.
declarative statement.
Ordered file
none of the above
i ,iii only
ii, iv only
iii, iv only
ii, iii, iv
TO clause
FROM clause
RANGE clause
none of the above
500
7
3500
none of these
Hierarchical model
E-R model
Network based model
none of these
IMAP
TELNET
POP3
Infrared
Min
Max
Select
Avg