A logical schema
is the entire database
Describes how data is actually stored on disk.
is a standard way of organizing information into accessible parts.
All of the above
Correct Answer :
C. is a standard way of organizing information into accessible parts.
Related Questions
In a relational schema, each tuple is divided into fields called
Relations
Queries
Domains
All of the above
DFD stands for
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
A data type or format is specified for each _________
Relation
Tuple
Database
Domain
A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer systems.
None
Multi
Single
Concurrent
Employees in a company are each assigned their own office, i.e. for each employee there exists a unique office and for each office there exists a unique employee; This statement is an example of ____ type of relation.
1:1
1: Many
Many: One
Many : Many
DROP is a statement in SQL.
Query
Embedded SQL
DDL
DCL
Relational Algebra is
Data Definition Language .
Meta Language
Procedural query Language
None of the above
The drawback of shadow paging technique are
Commit overhead
Data fragmentation
Garbage collection
All of these
Which is the best file organization when data is frequently added or deleted from a file?
Sequential
Direct
Index sequential
None of the above
Wait-for graph is used for
detecting view serializability.
detecting conflict serializability.
deadlock prevention
deadlock detection
It is an abstraction through which relationships are treated as higher level entities
Generalization.
Specialization.
Aggregation.
Inheritance.
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
_____ command can be used to modify a column in a table
alter
update
set
create
The one guideline to be followed while designing the database is
A database design may be ambiguous.
It should avoid/reduce the redundancy.
Unrelated data should be in the same table so that updating the data will be easy.
An entity should not have attributes.
By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0) or one (1).
Vulcanizing
Galvanizing
Magnetizing
Passing UV rays
Data independence means
data is defined separately and not included in programs.
programs are not dependent on the physical attributes of data
programs are not dependent on the logical attributes of data
both B and C
Which of the following relational algebraic operations is not from set theory?
Union
Intersection
Cartesian Product
Select
______is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
Domain Integrity Constraints
Referential Integrity Constraints
Domain Constraints
Entity Integrity Constraints
A ______ module is typically designed so that it will run on a user workstation or personal computer.
Software
Server
Program
Client
In multiple granularity of locks SIX lock is compatible with
IX
IS
S
SIX
Union operator is a :
Unary Operator
Ternary Operator
Binary Operator
Not an operator
______is a preferred method for enforcing data integrity
Constraints
Triggers
Stored procedure
Cursors
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
Clustered
Hashed
Un-clustered
Collision
The data in the database at a particular moment of time is called the _______
Snapshot
Dynaset
Stateless
Stateful
_____ is a utility to capture a continuous record of server activity and provide auditing capability.
SQL server Profile
SQL server wizard.
SQL server service manager
SQL server setup
When an E-R diagram is mapped to tables, the representation is redundant for
weak entity sets
weak relationship sets
strong entity sets
strong relationship sets
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
Union
Intersection
Difference
Join
Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
It will result in a deadlock situation.
It will immediately be rejected.
It will immediately be granted.
It will be granted as soon as it is released by A .
If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
left outer join
right outer join
full outer join
inner join