S. No.

Question Option – “A” Option – “B” Option – “C” Option – “D”

If a non-prime attribute determines a prime attribute it is a Fully Partial Transitive Boyce Codd
Functional Functional Functional Functional
Dependency Dependency Dependency Dependency
Consider attributes ID , CITY and NAME . Which one of this can be considered as a super key ? NAME ID CITY CITY,NAME
A _________ consists of a sequence of query and/or update statements. Transaction Commit Rollback Flashback
Which of the following makes the transaction permanent in the database ? View Partial Commit Rollback
Commit
In order to undo the work of transaction after last commit which one should be used ? View Partial Commit Rollback
Commit
Consider the following action: Undoes the Undoes all Commit No action
Transaction….. transaction the
Commit; transaction
Rollback;
What does Rollback do?
In case of any shut down during transaction before commit which of the following statement is done automatically ? Rollback View Commit None of
these
In the __________ normal form, a composite attribute is converted to individual attributes. First Second Third BCNF
Tables in second normal form (2NF): Have a Eliminate all Eliminate all None of
composite possibilities possibilities these
key of insertion of hidden
anomalies dependencie
s
The data model which describes how the data is actually stored is : Internal External Logical None of
these
Data about data is normally termed as : Directory Data bank Meta data None of
these
The scheme for hierarchical database is : A tree A graph A B-Tree None of
these
Which one is an example for network database ? Unify Ingress IDMS None of
these
One of the following is a valid record-based data model : Object- Relational Entity- None of
oriented relationship these
A view of database that appears to an application program is known as : Schema Subschema Virtual table None of
these
A top-to-bottom relationship among the items in a database is established by a : Hierarchical Network Relational All of the
above
Manager salary is hidden from the employee Internal External Conceptual None of
level level level these
Minimize the given functional dependencies R(ABCDEFG) AB, BCDE, AEGG Already AEGG is Not sufficient None of
minimum extra data these
Minimize the given functional dependencies R(ABCDE) ABC, CDE, EA, BD BD is extra Can not be Not sufficient None of
minimized data these
Find out the candidate key from the given relation R(ABCDEFGH) ABC, ADE, BF, FGH AB BC A B
Find out the candidate key from the given relation R(ABCDEFGH0 ABC , BDEF, ADG, AH AB ABC ABD None of
these
Concurrency makes the transaction Fast Reliable Both A and B None of
these
SQL is acronym for Structured Structures Structure None of
Query Query Query Logic these
Language language
A primary key is Minimal Accessible Definitive All of these
No component of which key is allowed to be null Primary key Candidate Both A and B None of
key these
Data depends upon dependency or dependency depends upon data Data Dependency Both A and B None of
depends depends these
What is the proper set of R(ABC) AB BC AC All of these
What is the proper set of R(ABCD) AB ABC AD C
Which one of the following is used to define the structure of the relation ,deleting relations and relating schemas ? DML(Data DDL(Data Query Relational
Manipulation Definition Schema
Langauge) Langauge)
Which one of the following provides the ability to query information from the database and to insert tuples into, DDL DML Query Relational
delete tuples from, and modify tuples in the database ? Schema

Create table employee (name varchar ,id integer) DML DDL VIEW Constraint
What type of statement is this ?

. Select * from employee DML DDL VIEW CONSTRAINT

What type of statement is this?

The basic data type char(n) is a _____ length character string and varchar(n) is _____ length character. Fixed, equal Equal, Fixed, Variable,
variable variable equal
An attribute A of datatype varchar(20) has the value “Avi” . The attribute B of datatype char(20) has value 3, 20 20, 4 20 , 20 3, 4
”Reed” .Here attribute A has ____ spaces and attribute B has ____ spaces .

To remove a relation from an SQL database, we use the ______ command. DELETE PURGE REMOVE DROP TABLE

Delete from r; r – relation Remove Clear Delete fields Delete rows

relation relation
entries
. Insert into instructor values (10211, ’Smith’, ’Biology’, 66000); Query DML Relational DDL
What type of statement is this ?
Updates that violate __________ are disallowed . Integrity Transaction Authorizatio DDL
constraints control n constraints
A relational database consists of a collection of Tables Fields Records Keys
. A ________ in a table represents a relationship among a set of values. Column Key Row Entry

The term _______ is used to refer to a row. Attribute Tuple Field Instance

The term attribute refers to a ___________ of a table. Record Column Tuple KEY
For each attribute of a relation, there is a set of permitted values, called the ________ of that attribute. Domain Relation Set Schema

Database __________ , which is the logical design of the database, and the database _______,which is a Instance, Relation, Relation, Schema,
snapshot of the data in the database at a given instant in time. Schema Schema Domain Instance
Course(course_id,sec_id,semester) Relations, Attributes, Tuple, Tuple,
Here the course_id,sec_id and semester are __________ and course is a _________ . Attribute Relation Relation Attributes
Department (dept name, building, budget) and Employee (employee_id , name, dept name,salary) Attributes of Tuple of Tuple of Attributes of
Here the dept_name attribute appears in both the relations .Here using common attributes in relation schema is common common distinct distinct
one way of relating ___________ relations.
Department (dept name, building, budget) and Employee (employee_id , name, dept name,salary) Attributes of Tuple of Tuple of Attributes of
Here the dept_name attribute appears in both the relations .Here using common attributes in relation schema is common common distinct distinct
one way of relating ___________ relations.
. A domain is atomic if elements of the domain are considered to be ____________ units. Different Indivisbile Constant Divisible

The tuples of the relations can be of ________ order. ANY SAME SORTED CONSTANT
Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record? Candidate Sub key Super key Super key
key
Consider attributes ID , CITY and NAME . Which one of this can be considered as a super key ? NAME ID CITY CITY, ID

The subset of super key is a candidate key under what condition ? No proper All subsets Subset is a Each subset
subset is a are super super key is a super
super key keys key

A _____ is a property of the entire relation, rather than of the individual tuples in which each tuple is unique. ROW KEYS ATTRIBUTE FIELDS

Which one of the following attribute can be taken as a primary key ? NAME STREET ID DEPARTMENT

Which one of the following cannot be taken as a primary key ? ID REGISTER DEPT_ID STREET
NUMBER
. A attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that CANDIDATE PRIMARY SUPER SUB
relation .
The relation with the attribute which is the primary key is referenced in another relation. The relation which has Referential Referencing Referenced Referred
the attribute as primary key is called relation relation relation relation

The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation . Referential Referencing Referenced Referred
relation relation relation relation
A _________ integrity constraint requires that the values appearing in specified attributes of any tuple in the Referential Referencing Specific Primary
referencing relation also appear in specified attributes of at least one tuple in the referenced relation.

Using which language can a user request information from a database ? Query Relational Structural Compiler
Student(ID, name, dept name, tot_cred) Name Dept Tot_cred ID
In this query which attribute form the primary key?

Which one of the following is a procedural language ? Domain Tuple Relational Query
relational relational algebra language
calculus calculus
The_____ operation allows the combining of two relations by merging pairs of tuples, one from each relation, into Select Join Union Intersection
a single tuple.

The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute Join Cartesian Intersection Set
values match. product difference
The _______operation performs a set union of two “similarly structured” tables Union Join Product Intersect

The most commonly used operation in relational algebra for projecting a set of tuple from a relation is Join Projection Select Union

The _______ operator takes the results of two queries and returns only rows that appear in both result sets. a) Union Intersect Difference Projection
A ________ is a pictorial depiction of the schema of a database that shows the relations in the database, their Schema Relational Database Schema flow
attributes, and primary keys and foreign keys. diagram algebra diagram

The _________ provides a set of operations that take one or more relations as input and return a relation as an Schematic Relational Scheme Relation flow
output. representati algebra diagram
on
Select name ____ instructor name, course id From Rename As Join
from instructor, teaches
where instructor.ID= teaches.ID;
Which keyword must be used here to rename the field name ?

Select * from employee where dept_name=”Comp Sci”; Dept_name Employee “Comp Sci” From
In the SQL given above there is an error . Identify the error .

. Select emp_name % _ || $
from department
where dept_name like ’ _____ Computer Science’;
Which one of the following has to be added into the blank to select the dept_name which has Computer Science
as its ending string ?

. Select name Descending Any Same Ascending

from instructor
where dept name = ’Physics’
order by name;
By default, the order by clause lists items in ______ order.

. In the __________ normal form, a composite attribute is converted to individual attributes FIRST SECOND THIRD FOURTH
A table on the many side of a one to many or many to many relationship must: Be in Be in Third Have a Have a
Second Normal single composite
Normal Form (3NF) attribute key key
Form (2NF)

Tables in second normal form (2NF): Eliminate all Eliminate the Have a Have all non
hidden possibility of composite key fields
dependencie a insertion key depend on
s anomalies the whole
primary key
Which-one ofthe following statements about normal forms is FALSE? BCNF is Lossless, Loss less, Any relation
stricter than dependency dependency with two
3 NF -preserving – preserving attributes is
decompositi decompositi BCNF
on into 3 NF on into
is always BCNF is
possible always
possible
Functional Dependencies are the types of constraints that are based on______ Key Key revisited Superset None of
key these
Find the Closure set of attribute “A” if Relation R(A,B,C) and dependency is AB, BC A A,B A,B,C All of the
above
Find the closure set of “AC” if Relation R(A,B,C,D,E,F,G) And dependency is AB,BCDE, AEGG A A,B,C A,C,B,D A,C,B,D,E

Find out the minimal set of functional dependency from relation R(A,B,C,D,E) where dependencies given are ABC, CDE BD EA None of
CDE, BD, EA these
A key which can be promoted as a primary key but not promoted by the DBA as a primary key is known as Artificial key Alternate Key Super Key Both A and B
R(A,B,C,D,E,F,G,H) ABC, ADE, BF, FGH find out the candidate key in the given relation AB A B F

Find out the number of candidate keys in the given relation R(A,B,C,D,E) with the functional dependency as follows 2 3 4 5
BCADE, DB
Find out the number of candidate keys in the given relation R(A,B,C,D,E) with the functional dependency as follows 2 3 4 5
ABCD, DA, BCDE
What is Transitive Functional dependency A prime A non-prime A prime None of
attribute determines a attribute these
determines non prime determine
prime attribute non prime
attribute attribute
If a relational doesn’t contain any partial functional dependency the relation is in 1NF 2NF 3NF Both B and C
If a relation has all the determiners as Super Key than the relation is in 2NF 3NF BCNF All of the
these
This relation R(A,B,C,D,E) is in which normal form if FD’s are CED, DB, CA 1NF 2NF 3NF BCNF
This relation R(A,B,C,D,E) is in which normal form If FD’s are BCADE,DB 1NF 2NF 3NF BCNF
Which component handles ATOMICITY of Transactions Transaction System Concurrency Recovery
management programmer Control management
component component Component component
Which component handles CONSISTENCY of Transactions Transaction System Concurrency Recovery
management programmer Control management
component component Component component
Which component handles ISOLATION of Transactions Transaction System Concurrency Recovery
management programmer Control management
component component Component component
Which component handles DURABILITY of Transactions Transaction System Concurrency Recovery
management programmer Control management
component component Component component
How many states a transaction can have 5 6 7 8
Can a transaction be rolled back from the committed state Yes No Both A and B None of
these
If a transaction is partially committed it can go to Failed State Committed Both A and B None of
State these
All the transactions run in isolation, is this statement true practically No Yes
In a Relation R(ABCD) ABCD, BD which type of functional dependency exists between the attributes Fully Partial Transitive Boyce Codd
Functional Functional Functional Functional
Dependency Dependency Dependency Dependency
If a non- prime attribute determines non prime attribute it is a Fully Partial Transitive Boyce Codd
Functional Functional Functional Functional
Dependency Dependency Dependency Dependency