ZEAL EDUCATION SOCIETY’S

ZEAL COLLEGE OF ENGINEERING AND RESEARCH

NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-III
1) .............................. is the process of organizing data into related tables.

A) Normalization
B) Generalization
C) Specialization
D) None of the above

Ans: A
2) 4NF is designed to cope with:
a. Transitive dependency
b. Join dependency
c. Multi valued dependency
d. None of these
Ans: C
3) The operation which violates only one constraint called referential integrity
when it is Performed called as
a.insert
b.delete
c.Update
d.new
Ans: b
4) In a relational model, relations are termed as

a. Tuples.
b. Attributes
c. Tables.
d. Rows.
Ans: C
5) A relational database developer refers to a record as

a. criteria
b. a relation
c. a tuple
d. an attribute
Ans: C
6) In the __________ normal form, a composite attribute is converted to
individual attributes.
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

a) First
b) Second
c) Third
d) Fourth
Ans: a
7) A function that has no partial functional dependencies is in _______ form :
A
a. 3NF
b. B 2NF
c. C 4NF
d. D BCNF

Ans: b
8) A property which ensures that each functional dependency is represented in
some individual relational resulting after decomposition
A
a. Loss less join
b. Dependency preservation
c. Both [A] and [B]
d. None of the above

Ans: C
9) Third normal form is based on the concept of _________
View Answer
a. A Closure Dependency
b. B Transitive Dependency
c. C Normal Dependency
d. D Functional Dependency

Ans: b
10) A functional dependency of the form X→Y is trivial if
A
a. X⊆X
b. Y⊂X
c. X⊆Yor Y⊂X
d. X⊂Y and Y⊂X

Ans: b
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

11) If every non-key attribute is functionally dependent on the primary key, then
the relation will be in :
A
View Answer

a. 1NF
b. 2NF
c. 3NF
d. D4NF

Ans: b
12)
Most of the time modification anamalies are serious enough that tables
should be normalized into:
a) First
b) Second
c) Third
d) BCNF
Ans: d
13)
The Normal form which only includes indivisible values or single atomic
values is classified as:
a) First
b) Second
c) Third
d) BCNF
Ans: a
Explanation:
14)
Normalization_________the data duplication.
a.eliminates
b.reduces
c.increases
d.maximizes
Ans: a
Explanation:
15) If a relation is in BCNF, then it is also in

a. 1 NF

b. 2 NF

c. 3 NF
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

a. d. All of
the
above

Ans: d
Explanation:
16) A functional dependency is a relationship between or among

A. Entities
B. Rows
C. Attributes
D. Tables

Ans: C
Explanation:
17) Third normal form is inadequate in situations where the relation :

A. has multiple candidate keys

B. has candidate keys that are composite
C. has overlapped candidate keys
D. none of the above

Ans: D
Explanation:
18) 5NF is designed to cope with :

A. Transitive dependency
B. Join dependency
C. Multi valued dependency
D. None of these

Ans: B
Explanation:
19) A relation is in 2NF if:

A. All the values of non-key attributes are dependent fully on the

candidate key.
B. Any non-key attribute that are dependent on only part of the candidate
key should be moved to another relation where the partial key is the
actual full key.
C. It must be already in the 1NF.
D. All of the above.
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: D
20) A relation is considered as:

a.Column
b.One-dimensional
c.Two-dimensional
d.Three-dimensional
Ans: c

21) Who proposed relational model?

a.Bill Gates
b.E.F.Codd
c.Herman Hollerith
d.Charles Babbage
Ans: b
22) Which of the following is true regarding Referential Integrity?

a.Every primary-key value must match a primary-key value in an associated

table
b.Every primary-key value must match a foreign-key value in an associated
table
c.Every foreign-key value must match a primary-key value in an associated
table
d.Every foreign-key value must match a foreign-key value in an associated
table
Ans: c
23) A attribute in a relation is a foreign key if the _________key from one
relation is used as an attribute in that relation.

a.Candidate Key
b.Primary Key
c.Super Key
d.Sub Key
Ans: b
24) Foreign key is which of the following?

a.Any attribute
b.The same thing as a primary key
c.An attribute that serves as the primary key of other relation
d.None of the above
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: C
25) When mapping a multivalued attribute into a relation which of the following
is true?
a. One relation is created.
b. Two relation are created
c. Three relation are created
d. Four relations are created
Ans: b

Name and Sign of Subject Teacher

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-II
1) .................................is a full form of SQL.

A) Standard query language

B) Sequential query language
C) Structured query language
D) Server side query language

Ans: C
2) Grant and revoke are ............... statements.

A. DDL
B. TCL
C. DCL
D. DML

Ans: C
3) Which of the following is not the DML statement?

A. modify
B. update
C. insert
D. delete

Ans: A
4) To eliminate duplicate rows ............................. is used

A) NODUPLICATE
B) ELIMINATE
C) DISTINCT
D) None of these

Ans: C
5) Which of the following is/are the DDL statements?
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

A) Create
B) B) Drop
C) Alter
D) All of the above

Ans: D
6) For like predicate which of the following is true.
i) % matches zero of more characters. ii) _ matches exactly
one character.

A) i-only
B) ii-only
C) Both of them
D) None of them

Ans: C
7) ........................ defines rules regarding the values allowed in columns
and is the standard mechanism for enforcing database integrity.

A) Column
B) Constraint
C) Index
D) Trigger

Ans: B
8) Which of the following are TCL commands?

a. COMMIT and ROLLBACK

b. UPDATE and TRUNCATE
c. SELECT and INSERT
d. GRANT and REVOKE

Ans: a
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

9) Which of the following is not Constraint in SQL?

a. Primary Key

b. Not Null

c. Check

d. Union

Ans: d
10) _________ command makes the updates performed by the
transaction permanent in the database?

a. ROLLBACK

b. COMMIT

c. TRUNCATE

d. DELETE

Ans: b
11) Which command is used to change the definition of a table in
SQL?

a. CREATE

b. UPDATE

c. ALTER

d. SELECT

Ans: c
12) Which of the following is the correct order of a SQL statement?

a. SELECT, GROUP BY, WHERE, HAVING

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

b. SELECT, WHERE, GROUP BY, HAVING

c. SELECT, HAVING, WHERE, GROUP BY
d. SELECT, WHERE, HAVING, GROUP BY

Ans: b
13)
What are the different events in Triggers ?

a] Define, Create
b] Drop, Comment
c] Insert, Update, Delete
d] All of the above
Ans: c
14) ______ is NOT a type of constraint in SQL language?

a. FOREIGN KEY
b. PRIMARY KEY
c. UNIQUE
d. ALTERNATE KEY

Ans: d
15 The basic data type char(n) is a _____ length character
string and varchar(n) is _____ length character.

A. Fixed, equal
B. Fixed, variable
C. Equal, variable
D. Variable, equal

Ans: B
16) Which statement is used to get all data from the student table
whose name starts with p?

a. SELECT * FROM student WHERE name LIKE '%p%';

b. SELECT * FROM student WHERE name LIKE 'p%';

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c. SELECT * FROM student WHERE name LIKE '_p%';

d. SELECT * FROM student WHERE name LIKE '%p';

Ans: b
17) Which of the following statement is correct to display all the
cities with the condition, temperature, and humidity whose
humidity is in the range of 60 to 75 from the 'whether' table?

a. SELECT * FROM weather WHERE humidity IN (60 to 75)

b. SELECT * FROM weather WHERE humidity BETWEEN 60 AND

75

c. SELECT * FROM weather WHERE humidity NOT IN (60 AND

75)

d. SELECT * FROM weather WHERE humidity NOT BETWEEN 60

AND 75

Ans: b
18) Which of the following are the synonyms for Column and ROW
of a table?

1. Row = [Tuple, Record]

2. Column = [Field, Attribute]

3. Row = [Tuple, Attribute]

4. Columns = [Field, Record]

a. 1 and 2

b. 3 and 4

c. Only 1

d. Only 2

Ans: a
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

19) How can you change "Thomas" into "Michel" in the "LastName"
column in the Users table?

a. UPDATE User SET LastName = 'Thomas' INTO LastName =

'Michel'

b. MODIFY Users SET LastName = 'Michel' WHERE LastName =

'Thomas'

c. MODIFY Users SET LastName = 'Thomas' INTO LastName =

'Michel'

d. UPDATE Users SET LastName = 'Michel' WHERE LastName =

'Thomas'

Ans: d
20) If we have not specified ASC or DESC after a SQL ORDER
BY clause, the following is used by default

a. DESC

b. ASC

c. There is no default value

d. None of the mentioned

Ans: b
21)
Which data manipulation command is used to combines the records
from one or more tables.
a. Select
b. Project
c. Join
d. product
Ans: c
22)
Which of the following is true about the execution section of a PL/SQL
block?
a. It is enclosed between the keywords BEGIN and END
b.It is mandatory section
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c.It consists of the executable PL/SQL statements.

d.all the above
Ans: d
23)
Which of the following is true about PL/SQL Cursors?

a. Explicit cursors are automatically created by oracle.

b. Implicit cursors are programmer defined cursors.
c. The most recent implicit cursor is called the SQL cursor, and
has the attributes like %FOUND,%ISOPEN,%NOTFOUND
and % ROWCOUNT
d. All of above
Ans: c
24)
Which of the following is not correct about a View ?

a] To protect some of the columns of a table from other users

b] Occupies data storage space
c] To hide complexity of a query
d] To hide complexity of a calculations

Ans: b
25) a. Portable Language/SQL
b. Programming Language/SQL
c. Procedural Language/SQL
d. None of these

Ans: c

Name and Sign of Subject Teacher

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-1
1) The number of entities to which another entity can be associated via a
relationship set is expressed as:

a. Entity
b. Cardinality
c. Schema
d. Attributes

Ans: b
2) 2. What is not true about a view?

a. It is a definition of a restricted portion of the database

b. It is a security mechanism
c. It is always updatable like any other table
d. All are true

Ans: c
3) 3. A super key is a set of one or more attributes that, taken collectively,
allow us

a. to identify uniquely an entity in the entity set

b. to make the key most powerful for faster retrieval
c. to increase effectiveness of database access
d. none of the above

Ans: a
4) Prevention of access to the database by unauthorized users is referred to
as:

a. Integrity
b. Productivity
c. Security
d. Reliability

Ans: c
5) DML is provided for
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

a.Description of logical structure of database.

b.Addition of new structures in the database system.
c.Manipulation & processing of database.
d.Definition of physical structure of database system.

Ans: c
Explanation: DML is Data Manipua
6) ODBC stands for

a. Object Database Connectivity

b. Oral Database Connectivity.
c. Oracle Database Connectivity
d. Open Database Connectivity.

Ans: d
7) Architecture of the database can be viewed as

a. two levels.
b. four levels.
c. three levels.
d. one level.

Ans: c
8) An entity set that does not have sufficient attributes to form a primary key
is a

a. strong entity set.

b. weak entity set
c. simple entity set
d. primary entity set

Ans: b
9) In an E-R diagram attributes are represented by

a. rectangle.
b. square.
c. ellipse.
d. triangle.

Ans: C
10) An advantage of the database management approach is
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

A. data is dependent on programs

B. data redundancy increases
C. data is integrated and can be accessed by multiple
programs
D. none of the above

Ans: C
11) DBMS helps to achieve

A. Data independence
B. Centralized control of data
C. Neither A nor B
D. Both A and B

Ans: D
12) DCL stands for

A) Data Control Language

B) Data Console Language
C) Data Console Level
D) Data Control Level

Ans: A
13) ----------is the preferred method for enforcing data integrity

a. Constraints
b. Stored Procedure
c. Triggers
d. Cursors

Ans: a
14) The database schema is written in

A. HLL
B. DML
C. DDL
D. DCL
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: C
15) In the architecture of a database system external level is the

(A) physical level.

(B) logical level.
(C) conceptual level
(D) view level.
Ans. D
16) The language used in application programs to request data from
the DBMS is referred to as the

a. DML
b. DDL
c. VDL
d. SDL

Ans: a
17) DBMS is a collection of ........................that enables user to create and
maintain a database.

A) Keys
B) Translators
C) Program
D) Language Activity

Ans: C
18) 1. In an ER model, ...................... is described in the database by storing its
data.

A) Entity B) Attribute C) Relationship D)

Notation

Ans: A
19) A________is used to define overall design of the database

A. schema
B. application program
C. data definition language
D. code
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: A
20) State true or false
i) A candidate key is a minimal super key.
ii) A candidate key is a Maximum of super key.

A) i-true, ii-false
B) B) i-false, ii-true
C) i-true, ii-true
D) i-false, ii-false

Ans: A
21) In an E-R diagram derived attributes are represented by

a. rectangle.
b. square.
c. ellipse.
d. Dotted ellipse

Ans: d
Explanation: In an E-R diagram derived attributes are represented by dotted ellipse

22) ___________is a top-down approach in which a higher-level

entity is divided into multiple specialized lower-level entities.
a. Specialization
b. Generalization
c. Aggregation
d. None of the above
Ans: a
23) -----------------is a candidate key chosen by database designer for
unique identification of records.
a. Primary Key
b. Super Key
c. Unique Key
d. Foreign Key
Ans: a
24) ------------------- is a bottom-up approach in which multiple lower-level
entities are combined to form a single higher-level entity.
a. Specialization
b. Generalization
c. Aggregation
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

d. None of the above

Ans: b
25) _________a single row of first entity set associates with more than one rows
of second entity set.
a. One to One
b. One to Many
c. Many to One
d. Many to many
Ans: b

Name and Sign of Subject Teacher

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-IV
1) The ‘All or none “ property referred as
a. Isolation
b. Durability
c. Atomicity
d. None of the mentioned
Ans: C
2) Execution of transaction in isolation preserves the _________ of a
database
a. Atomicity
b. Consistency
c. Durability
d. All of the mentioned
Ans: b
Explanation: Isolation ensures that no other transaction is running concurrently.
3) Which of the following systems is responsible for ensuring
durability
a. Recovery system
b. Atomic system
c. Concurrency control system
d. Compiler system
Ans: a
4) Which of the following is the state of transaction?
a. Active
b. Partially committed
c. Failed
d. Compensated
Ans: d
5) The execution sequences in concurrency control are termed as
________

a) Serials
b) Schedules
c) Organizations
d) Time tables
Ans: b
6) I and J are _________ if they are operations by different transactions on
the same data item, and at least one of them is a write operation.
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

a) Conflicting
b) Overwriting
c) Isolated
d) Durable

Ans: a
7) If a schedule S can be transformed into a schedule S’ by a series of
swaps of non-conflicting instructions, then S and S’ are

a) Non conflict equivalent

b) Equal
c) Conflict equivalent
d) Isolation equivalent
Ans: c
8) A schedule is __________ if it is conflict equivalent to a serial schedule.
a) Conflict serializable
b) Conflicting
c) Non serializable
d) None of the mentioned
Ans: a
9) The set of ________ in a precedence graph consists of all the
transactions participating in the schedule

a) Vertices
b) Edges
c) Directions
d) None of the mentioned
Ans: a
Explanation: The set of vertices in a precedence graph consists of all the
transactions participating in the schedule. Precedence graph is a simple
and efficient way of determining conflict serializability of the schedule.
10) If a schedule is equivalent to a serial schedule, it is called as a
_________

a) Serializable schedule
b) Equivalent schedule
c) Committed schedule
d) None of the mentioned
Ans: a
Explanation: If a schedule is equivalent to a serial schedule, it is called as a
Serializable schedule.
11) The phenomenon in which one failure leads to a series of transaction
rollbacks is called as ________
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

a) Cascading rollback
b) Cascadeless rollback
c) Cascade cause
d) None of the mentioned

Ans: a
12) When is a timestamp allotted

a) When execution begins

b) When execution is taking place
c) When execution is completed
d) None of the mentioned
Ans: a
13) A transaction is made to wait until all ________ locks held on the item
are released

a) Compatible
b) Incompatible
c) Concurrent
d) Equivalent
Ans: a
14) The two phase locking protocol consists which of the following
phases?
a) Growing phase
b) Shrinking phase
c) More than one of the mentioned
d) None of the mentioned
Ans: C
15) If a transaction may release locks but may not obtain any
locks, it is said to be in ______ phase
a) Growing phase
b) Shrinking phase
c) Deadlock phase
d) Starved phase
Ans. b
16) Two phase locking protocol does not ensure freedom from
a.Obtain locks
b.Release locks
c.New locks
d.Deadlocks

Ans: d
17) Two modes of locking a data item,are termed as shared and
a.Composite
b.compatible
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c.exclusive
d.linear
Ans: c
18) A transaction completes its execution is said to be
a.aborted
b.rolled back
c.commited
d.saved
Ans: c
19) When transaction Ti requests a data item currently held by Tj, Ti is
allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is
younger than Tj). Otherwise, Tj is rolled back(Tj is wounded byTi). This is
when

a.wait-die
b.wait-wound
c.wound-wait
d.wait
Ans: c
20) A deadlock exits in the system if and only if the wait for graph contains
a_______
a. Cycle
b.rotation
c.direction
d.bi-direction
Ans: a
21) Locking may cause which of the following problems?
a.Erroneous Updates
b.Deadlocks
c.versioning
d.All of the above
Ans: b
22) A transaction that has not been completed successfully is called as
a. Compensating Transaction
b. aborted transaction
c. Active transaction
d.partially commited transaction
Ans: b
23) Which of the following is not comes under ACID properties of transaction
a.Atomicity
b.Consistency
c.Integrity
d.Durability
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: C
24) If a transaction does not modify the database until it has committed, it is
said to use the ___________ technique.

a) Deferred-modification
b) Late-modification
c) Immediate-modification
d) Undo
Ans: a
25) Which of the following is not a recovery technique?
a.Deferred Update
b.immediate Update
C.Two Phase Locking Protocol
d.recovery management
Ans: c

Name and Sign of Subject Teacher

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-VI
1) Cap theorem states that we can only achieve at most two of three gurantees
for a database :
a. Consistency Availability
b. Availability Partition Tolerance
c. Consistency Partition Tolerance
d. All the above
Ans: d
2) Which one of the following stores data?

A. Name node

B. Data node

C. Master node

D. None of these

Ans: B
3) As compared to RDBMS, Hadoop

A. Has higher data Integrity

B. Does ACID transactions

C. IS suitable for read and write many times

D. Works better on unstructured and semi-structured data

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Ans: D
4)
What are the four V’s of Big Data?

(A) Volume
(B) Velocity
(C) Variety
(D) All the above

Ans: D
5)
What was Hadoop named after?

a) Creator Doug Cutting’s favorite circus act

b) Cutting’s high school rock band
c) The toy elephant of Cutting’s son
d) A sound Cutting’s laptop made during Hadoop development

Ans: C
6)
All of the following accurately describe Hadoop, EXCEPT ___________
_

a) Open-source
b) Real-time
c) Java-based
d) Distributed computing approach

Ans: b
7)
_________ can best be described as a programming model used to devel
op Hadoop-based applications that can process massive amounts of dat
a.

a) MapReduce
b) Mahout
c) Oozie
d) All of the mentioned

Ans: a
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

8) MongoDB has been adopted as ________ software by a number of major

websites and services.

a.Frontend

b.Backend

c.Proprietary

d.All of the mentioned

Ans: b
9) Which of the following is a NoSQL Database Type ?

a.SQL
b.Document Databases
C.JSON
d.All of the mentioned

Ans: b
10) Which of the following is not a NoSQL database?

a) SQL Server
b) MongoDB
c) Cassandra
d) None of the mentioned
Ans: a
11) ________ stores are used to store information about networks, such as
social connections.

a) Key-value
b) Wide-column
c) Document
d) Graph
Ans: d
12) Transaction data of the bank is?

a. structured data
b. unstructured data
c. Both a and b
d. None of the above

Ans: a
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

13) What are the main components of Big Data?

A. MapReduce
B. HDFS
C. YARN
D. All of the above

Ans: D
14) • Which of the following is not a strong feature for nosql databases?

a.Relational data
b.Faster data access than RDBMS
c.Data easily held across multiple servers
d.data availability
Ans: a
15) NoSQL stands for
a. No SQL
b. Only SQL
c. Not Only SQL
d. SQL Undefined
Ans. c
16) The core principle of NoSql is

a. High Availability
b. Low availability
c. Both high & low availability
d. None of the above
Ans: a
17) Which of the following is not an example of a nosql database management
system?

a. Hbase
b. MongoDB
c. CouchDB
d. PostgreSQL
Ans: d
18) What does commodity Hardware in Hadoop world mean?

•
a.Very cheap Hardware
b.Industry Standard Hardware
c.Discarded Hardware
d.Low specifications Industry grade hardware
Ans: a
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

19) Which of the following is a wide-column store ?

a. Cassandra
b. Riak
c. MongoDB
d. Redis
Ans: a
20) Point out the wrong statement :

a. Non Relational databases require that schemas be defined before

you can add data
b. NoSQL databases are built to allow the insertion of data without
a predefined schema
c. NewSQL databases are built to allow the insertion of data
without a predefined schema
d. All of the mentioned

Ans: a
21)
What are the types of nosql databases?
a. Document based
b. Wide column
c. Graph & Key Value Store
d. All the above
Ans: d
22)
MongoDB a NoSQL database?
a. Yes
b. No
Ans: a
23) Collection is a group of MongoDB ___________?

A. Database
B. Document
C. Field
D. None of the above

Ans: B
24) Instead of Primary Key mongoDB use?
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

A. Embedded Documents
B. Default key _id
C. mongod
D. mongo

Ans: B
25) Which of the following statement is correct with respect to mongoDB?

A. MongoDB is a NoSQL Database

B. MongoDB used XML over JSON for data exchange
C. MongoDB is not scalable
D. All of the above

Ans: A

Name and Sign of Subject Teacher

ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

Name of the Teacher: Ms. R.T.Waghmode

Class: TE Subject: DBMS
AY: 2020-21 SEM: II

UNIT-V
1) A hetrogenous distributed database is which of the following
a. The same DBMS is used at each location and data are not distributed
across all nodes.

b. A different DBMS is used at each location and data are not

distributed across all nodes.

c. A different DBMS is used at each location and data are not

distributed across all nodes.

d. A different DBMS is used at each location and data are distributed

across all nodes.

Ans: d
2) Some of the columns of a relation are at different sites is which of the
following?

a. Data Replication

b. Horizontal Partitioning

c. Vertical Partitioning

d. Horizontal and Vertical Partitioning

Ans: c
3) A homogenous distributed database is which of the following?

a. The same DBMS is used at each location and data are not
distributed across all nodes.

b. The same DBMS is used at each location and data are distributed
across all nodes.
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c. A different DBMS is used at each location and data are not

distributed across all nodes.

d. A different DBMS is used at each location and data are distributed

across all nodes.
Ans: b
4) Storing a separate copy of the database at multiple locations is which of the
following?

a. Data Replication

b. Horizontal Partitioning

c. Vertical Partitioning

d. Horizontal and Vertical Partitioning

Ans: a
5) A distributed database is which of the following?

a. A single logical database that is spread to multiple locations and is

interconnected by a network

b. A loose collection of file that is spread to multiple locations and is

interconnected by a network

c. A single logical database that is limited to one location.

d. A loose collection of file that is limited to one location.

Ans: a
6) Which of the following parallel database architectures is/are mainly used by
distributed database system?

a) Shared Memory
b) Shared Disk
c) Shared Nothing
d) Hierarchical

Ans: c
7) Let us suppose that in a distributed database, during a transaction T1, one of
the sites, say S1, is failed. When recovers, the site S1 has to check its log file
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

a) Need not do anything

b) Perform Undo
c) Perform Redo
d) Abort the transaction

Ans: c
8) In parallel databases speedup is linear when
a.Speedup is linear if the speedup is N. That is, the small system elapsed
time is N times larger than the large system elapsed time
b.Speedup is linear if the speedup is N. That is, the small system elapsed
time is N times smaller than the large system elapsed time
c.Both a & b
d.None of the above
Ans: a
9) What are the reasons for Sub-linear performance of speedup and
scaleup?

a. Startup cost
b. Interference
c. Skew
d. All of the above
Ans: d
10) Each site has a transaction coordinator, which is responsible for:

a. Starting the execution of transactions that originate at the site.

b. Distributing subtransactions at appropriate sites for execution.
c. Coordinating the termination of each transaction that originates at
the site, which may result in the transaction being committed at all
sites or aborted at all sites.
d. All the above

Ans: d
11) A distributed database is a collection of data which belong —————– to
the same system but are spread over the ————– of the network.

a. Logically, sites
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

b. Physically, sites

c. Database, DBMS

d. None of the above

Ans: a
12) Which of the following is/are the main goals of a distributed database?

a. Interconnection of database

b. Incremental growth

c. Reduced communication overhead

d. All of the above

Ans: d
13) Advantages of data replication is/are
a. Availability
b. Increased cost of updates
c. Increased complexity of concurrency control
d. All of above
Ans: a
14) • Performance metrics of parallel databases are

• A.Speedup
• B.scaleup
• C.Both a & b
• D.Neither a & b

Ans: c
15) The distributed transaction can be completely read-only and the transaction
is started with a .......... READ ONLY statement.

A. Distributed _Transactions
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

B. Transaction

C. Set Transaction

D. Read Transaction

Ans: C
16) Each site has a local transaction manager responsible for:

a. Maintaining a log for recovery purposes

b. Participating in coordinating the concurrent execution of the
transactions executing at that site.
c. Both a & b
d. Neither a or b

Ans: c
17) A coarse-grain parallel machine consists of a small number of powerful
processors

a.True
b.false
Ans: a
18) A fine grain parallel machine utilizes thousands of smaller processors.
a.True
b.false
Ans: a
19) Which of the following is not the parallel database architecture
a.Shared memory
b.shared data
c. Shared Disk
d.Shared nothing
Ans: b
20) Disadvantage of 2Phase Commit protocol is

a.It is blocking protocol

b.It is nonblocking protocol
c.Weak in concurrency control
d.Weak in data availability
Ans: a
21) 3PC is a protocol that eliminates this blocking problem on certain basic
requirements:

a. No network partitioning
b. At least one site must be available
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c. At most K simultaneous site failures are accepted

d. All the above

Ans: d
22) Which new phase is added in distributed 3 Phase commit protocol
a. Prepare Phase
b. Prepare to Commit Phase
c.Commit phase
d.Abort Phase
Ans: b
23) Which of the following is true in Distributed Database
a.
Databases in the collection are logically interrelated with each other.
Often they represent a single logical database.
b. Data is physically stored across multiple sites. Data in each site can
be managed by a DBMS independent of the other sites.
c. The processors in the sites are connected via a network. They do not
have any multiprocessor configuration.
d. All the above

Ans: d
24) While using commit protocols for handling atomicity issues, the distributed
database system may enter into a situation called Blocking problem. Which
of the following commit protocols can avoid Blocking problem?

a) Two-phase commit protocol

b) Three-phase commit protocol
c) Both of the above
d) None of the above

Ans: b
25) Which of the following concurrency control protocol is suitable for an
application where frequency of read operation is much greater than that
of write operation?

a) Majority protocol
b) Quorum-consensus protocol
ZEAL EDUCATION SOCIETY’S
ZEAL COLLEGE OF ENGINEERING AND RESEARCH
NARHE │PUNE -41 │ INDIA
DEPARTMENT OF COMPUTER ENGINEERING

c) Biased protocol
d) Single lock protocol

Ans: c

Name and Sign of Subject Teacher

1. Given the evolution of DBMSs, business data is now:

a. Stored in main memory and stays resident there even after the application that uses it terminates.

b. Stored only if it is relevant to business decisions.

c. Stored indefinitely in case it's needed since storing it is much cheaper now.

d. None of the above.

Answer: (b).Stored only if it is relevant to business decisions.

2. Which of the following is not true of a DBMS?

a. It provides efficient storage and retrieval of data.

b. It has evolved over the years into a fairly simple set of tools that are relatively easy to master.

c. Marketplace demands and product innovation have led to the development of a broad range of features.

d. None of the above.

Answer: (b).It has evolved over the years into a fairly simple set of tools that are relatively easy to master.

3. Nonprocedural access to a database:

a. Can provide a dramatic improvement in software productivity.

b. Allows a user to submit queries to a database without having to know how the data will be retrieved.

c. Is supported by more than one tool in most DBMSs.

d. All of the above.

Answer: (d).All of the above.

4. Which of the following statements is not true of a desktop DBMS?

a. They usually run on personal computers or small servers.

b. They have a much lower cost than other DBMSs.

c. Although useful for processing ad hoc queries, they cannot perform transaction processing.

d. They usually support databases used by work teams and small businesses.

Answer: (c).Although useful for processing ad hoc queries, they cannot perform transaction processing.

5. In the evolution of database technology, second-generation products are considered to be the first true DB

a. They were "navigational", i.e. the programmer had to write code to navigate through a network of linked re

b. Of their foundation on mathematical relations and associated operators.

c. They supported sequential and random searching.

d. They could manage multiple entities and relationships.

Answer: (d).They could manage multiple entities and relationships.

6. In the evolution of database technology, third-generation products supplanted second-generation systems

a. Nonprocedural database access was an improvement over navigational access.

b. IBM supported the CODASYL standard of database definition and manipulation.

c. Nonprocedural languages were still not very efficient.

d. All of the above.

Answer: (a).Nonprocedural database access was an improvement over navigational access.

7. Which statement is not true of the Three Schema Architecture?

a. It is an official standard of the American Standards Institute (ANSI).

b. It is an architecture for compartmentalizing database descriptions.

c. Its details have been widely adopted in third- and fourth-generation DBMSs.
d. None of the above.

Answer: (c).Its details have been widely adopted in third- and fourth-generation DBMSs.

8. Which of the following statements is not true of information resource management?

a. It is very different and much more challenging than managing the other physical resources of an organizat

b. Its goal is to use information technology as a tool for processing, distributing, and integrating information th

c. Its emergence has created new management responsibilities.

d. None of the above.

Answer: (a).It is very different and much more challenging than managing the other physical resources of an org

9. A Database Management System (DBMS) is

a. Collection of interrelated data

b. Collection of programs to access data

c. Collection of data describing one particular enterprise

d. All of the above

Answer: (d).All of the above

10. Data Manipulation Language enables users to

a. Retrieval of information stored in database

b. Insertion of new information into the database

c. Deletion of information from the database

d. All of the above

Answer: (d).All of the above

11. Which of the following is Database Language?

a. Data Definition Language

b. Data Manipulation Language

c. Query Language

d. All of the above

Answer: (d).All of the above

12. Which of the following in not a function of DBA?

a. Network Maintenance

b. Routine Maintenance

c. Schema Definition

d. Authorization for data access

Answer: (a).Network Maintenance

13. Which of the following represents a relationship among a set of values.

a. A Row

b. A Table

c. A Field

d. A Column

Answer: (a).A Row

14. Column header is refer as

a. Table

b. Relation

c. Attributes

d. Domain

Answer: (c).Attributes

15. Which of the following is not Modification of the Database?

a. Deletion

b. Insertion

c. Sorting

d. Updating

Answer: (c).Sorting

16. Which of the following in true regarding Null Value?

a. Null = 0

b. Null < 0

c. Null > 0

d. Null <> 0

Answer: (d).Null <> 0

17. ODBC stands for ______

a. Offline database connection

b. Oriented database connection

c. Open database connection

d. None of the above

Answer: (c).Open database connection

18. _____________ refers to the correctness and completeness of the data in a database?

a. Data security

b. Data integrity

c. Data constraint

d. Data independence

19. Data integrity constraints are used to:

a. Control who is allowed access to the data

b. Ensure that duplicate records are not entered into the table

c. Improve the quality of data entered for a specific property (i.e., table column)

d. Prevent users from changing the values stored in the table

Answer: (c).Improve the quality of data entered for a specific property (i.e., table column)

20. The DBMS acts as an interface between what two components of an enterprise-class database system?

a. Database application and the database

b. Data and the database

c. The user and the database application

Answer: (a).Database application and the database

1. Which of the following is not a level of data abstraction?

a. Physical Level

b. Critical Level

c. Logical Level

d. View Level

Answer: (b).Critical Level

2. Which of the following is not an Schema?

a. Database Schema

b. Physical Schema

c. Critical Schema

d. Logical Schema

Answer: (c).Critical Schema

3. Which of the following is a Data Model?

a. Entity-Relationship model

b. Relational data model

c. Object-Based data model

d. All of the above

Answer: (d).All of the above

4. Logical design of database is called

a. Database Instance

b. Database Snapshot

c. Database Schema

d. All of the above

Answer: (c).Database Schema

5. Snapshot of the dta in the database at a given instant of time is called

a. Database Schema

b. Database Instance

c. Database Snapshot

d. All of the above

Answer: (b).Database Instance

6. Which of the following is the structure of the Database?

a. Table

b. Schema

c. Relation

d. None of these

Answer: (b).Schema
7. A logical description of some portion of database that is required by a user to perform task is called as

a. System View

b. User View

c. Logical View

d. Data View

Answer: (b).User View

8. _____________ is a classical approach to database design?

a. Left – Right approach

b. Right – Left approach

c. Top – Down approach

d. Bottom – Up approach

Answer: (c).Top – Down approach

9. Which of the following is the oldest database model?

a. Relational

b. Hierarchical

c. Physical

d. Network

Answer: (d).Network

10. Which of the following indicates the maximum number of entities that can be involved in a relationship?

a. Minimum cardinality
b. Maximum cardinality

c. ERD

d. Greater Entity Count (GEC)

Answer: (b).Maximum cardinality

11. Which of the following data constraints would be used to specify that the value of cells in a column must be

a. A domain constraint

b. A range constraint

c. An intrarelation constraint

d. An interrelation constraint

Answer: (a).A domain constraint

12. In a 1:N relationship, the foreign key is placed in:

a. either table without specifying parent and child tables.

b. the parent table.

c. the child table.

d. either the parent table or the child table.

Answer: (c).the child table.

13. Which of the following column properties specifies whether or not cells in a column must contain a data va

a. Null status

b. Data type

c. Default value
d. Data constraints

Answer: (a).Null status

14. A primary key should be defined as:

a. NULL

b. NOT NULL

c. Either of the above can be used

d. None of the above are correct

Answer: (b).NOT NULL

15. Which of the following column properties would be used to specify that cells in a column must contain a m

a. Null status

b. Data type

c. Default value

d. Data constraints

Answer: (b).Data type

16. If a denormalization situation exists with a one-to-one binary relationship, which of the following is true?

a. All fields are stored in one relation.

b. All fields are stored in two relations.

c. All fields are stored in three relations.

d. All fields are stored in four relations.

Answer: (a).All fields are stored in one relation.

17. Selecting a data type involves which of the following?

a. Maximize storage space

b. Represent most values

c. Improve data integrity

d. All of the above

Answer: (c).Improve data integrity

18. What is the best data type definition for Oracle when a field is alphanumeric and has a length that can vary

a. VARCHAR2

b. CHAR

c. LONG

d. NUMBER

Answer: (a).VARCHAR2

19. A multidimensional database model is used most often in which of the following models?

a. Data warehouse

b. Relational

c. Hierarchical

d. Network

Answer: (a).Data warehouse

20. Which of the following is not a factor to consider when switching from small to large block size?

a. The length of all of the fields in a table row.

b. The number of columns

c. Block contention

d. Random row access speed

Answer: (b).The number of columns

1. A Relation is a

a. Subset of a Cartesian product of a list of attributes

b. Subset of a Cartesian product of a list of domains

c. Subset of a Cartesian product of a list of tuple

d. Subset of a Cartesian product of a list of relations

Answer: (b).Subset of a Cartesian product of a list of domains

2. In mathematical term Table is referred as

a. Relation

b. Attribute

c. Tuple

d. Domain

Answer: (a).Relation
3. In mathematical term Row is referred as

a. Relation

b. Attribute

c. Tuple

d. Domain

Answer: (c).Tuple

4. _______ allow us to identify uniquely a tuple in the relation.

a. Superkey

b. Domain

c. Attribute

d. Schema

Answer: (a).Superkey

5. Minimal Superkeys are called

a. Schema keys

b. Candidate keys

c. Domain keys

d. Attribute keys

Answer: (b).Candidate keys

1. Which of the following is correct regarding Aggregate functions?

a. it takes a list of values and return a single values as result

b. it takes a list of values and return a list of values as result

c. it takes a single value and returns a list of values as result

d. it takes a single value and returns a single value as result

Answer: (a).it takes a list of values and return a single values as result

2. Which of the following option is use to retrieval of data?

a. Stack

b. Data Structure

c. Linked list

d. Query

Answer: (d).Query

3. Establishing limits on allowable property values, and specifying a set of acceptable, predefined options tha
of:

a. Attributes

b. Data integrity constraints

c. Method constraints

d. Referential integrity constraints

Answer: (b).Data integrity constraints

4. ______ is a special type of integrity constraint that relates two relations & maintains consistency across th

a. Entity Integrity Constraints

b. Referential Integrity Constraint

c. Domain Integrity Constraints

d. Domain Constraints

Answer: (b).Referential Integrity Constraint

5. Which of the following is a physical storage media ?

a. Tape Storage

b. Optical Storage

c. Flash memory

d. All of the mentioned

Answer: (d).All of the mentioned

6. Which of the following creates a virtual relation for storing the query ?

a. Function

b. View

c. Procedure

d. None of the mentioned

7. Which of the following is the syntax for views where v is view name ?

a. Create view v as “query name”;

b. Create “query expression” as view;

c. Create view v as “query expression”;

d. Create view “query expression”;

Answer: (c).Create view v as “query expression”;

1. Disadvantages of File systems to store data is:

a. Data redundancy and inconsistency

b. Difficulty in accessing data

c. Data isolation

d. All of the above

Answer: (d).All of the above

2. Which level of RAID refers to disk mirroring with block striping?

a. RAID level 1

b. RAID level 2

c. RAID level 0

d. RAID level 3

Answer: (a).RAID level 1

3. Optical disk technology uses

a. Helical scanning

b. DAT

c. a laser beam

d. RAID

Answer: (d).RAID
1. State true or false: SQL specifies a way of mentioning functional dependencies

a. True

b. False

c. May be

d. Can't say

Answer: (b).False

2. State true or false: Most current database systems do not support constraints on materialized view

a. True

b. False

c. May be

d. Can't say

Answer: (a).True

3. Multi valued dependencies are also called as __________

a. Equality generating dependencies

b. Tuple generating dependencies

c. Multi-purpose dependencies

d. None of the mentioned

Answer: (b).Tuple generating dependencies

4. Functional dependencies are sometimes referred to as ________

a. Equality generating dependencies

b. Tuple generating dependencies

c. Multi-purpose dependencies

d. None of the mentioned

Answer: (a).Equality generating dependencies

5. The _______ is a set of all functional and multi values dependencies implied by a set of functional depend

a. Star

b. Closure

c. Derivation

d. Evolution

Answer: (b).Closure

6. State true or false: If a relational schema is in _______ NF and A is a subset of R and B is also a subset o
values dependency.

a. 1

b. 2

c. 3

d. 4

Answer: (d).4

7. Which of the following normal forms does not exist?

a. BCNF

b. PJNF
c. 5NF

d. None of the mentioned

Answer: (d).None of the mentioned

1. The SQL database language includes statements for:

a. Database definition.

b. Database manipulation.

c. Database control.

d. All of the above.

Answer: (d).All of the above.

2. A command to remove a relation from an SQL database

a. Delete table table name

b. Drop table table name

c. Erase table table name

d. Alter table table name

Answer: (b).Drop table table name

3. Which SQL Query is use to remove a table and all its data from the database?

a. Create Table

b. Alter Table

c. Drop Table

d. None of these
Answer: (c).Drop Table

4. A type of query that is placed within a WHERE or HAVING clause of another query is called

a. Super query

b. Sub query

c. Master query

d. Multi-query

Answer: (b).Sub query

5. Aggregate functions are functions that take a ___________ as input and return a single value.

a. Collection of values

b. Single value

c. Aggregate value

d. Both a & b

6. Select __________ from instructor where dept name= ’Comp. Sci.’;

Which of the following should be used to find the mean of the salary ?

a. Mean(salary)

b. Avg(salary)

c. Sum(salary)

d. Count(salary)
Answer: (b).Avg(salary
SeatNo-
Totalnumberofquest ions: 60
1000755_ T1DBMS
Ti
me: 1hr
MaxMar ks:50
N.B
1)Allquesti
onsar eMul t
ipleChoiceQuesti
onshav ingsinglecorr
ectopti
on.
2)Att
emptany50quest i
onsoutof60.
3)Useofcal culatorisallowed.
4)Eachquest ioncar r
ies1Mar k.
5)Speciall
yabl edstudent sareall
owed20mi nutesextr
af orexaminat
ion.
6)Donotusepenci l
stodar kenanswer .
7)Useonl yblack/bluebal lpoi
ntpent odarkentheappropr i
ateci
rcl
e.
8)Nochangewi l
lbeal l
owedoncet heanswerismar kedonOMRSheet .
9)Roughwor kshal l
notbedoneonOMRsheetoronquest i
onpaper.
10)DarkenONLYONECI RCLEf oreachanswer.

Set1

Q.no1.Fort hegivensetoffunctionaldependencyF,i
t’
scl
osureis
denotedas
A: F+
B: FC
:F*
D: F_
Q.no2.Whatdoy oumeanbyonet omanyr elat
ionshi
pbetweenTeacher
and
Classtable?
A: Oneclassmayhav emanyteacher s
B: Oneteachercanhav emanycl asses
Set1
C: Oneteachercanhav eoneclass
D: Manyt eacher smayhavemanycl asses
Q.no3.Dat ar edundancymayl eadt o:
A: Dataintegrity
B: Atomicityproblem
C: Datainconsi st
ency
D: Dataabst racti
on
Q.no4.Whi choneoft hefol
lowinguni quel
yidenti
fi
estheelement
sinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no5.Theconcept ualmodeli s_ _
______
_.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof t
war e
D: Independentofbot hhar dwareandsof t
war e
Q.no6.Al laggr egat ef uncti
onsexcept_ ____ignorenullval
uesinthei
r
i
nput
coll
ect i
on.
A: Count (attribut e)
B: Count (*)
C: Av g
D: Sum
Q.no7.Thedat abaseenv i
ronmenthasal lofthef ol
lowingcomponents
except _
_ ___ ___
A: Users.
B: Separ atef iles
C: Database.
D: Databaseadmi nistrator
Q.no8.I nwhi chst at eonegat hersandl i
stallthenecessaryfi
eldsfort
he
database
designpr oject .
A: DataDef inition
B: DataRef inement
C: Establishi ngRel ationship
D: Datadel etion
Q.no9.Thi skeyt hatuni quelyidentif
ieseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fiel
dName
Q.no10.Hi er ar chicalmodeli salsocall
ed_________.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Normal i
zeSt r
uct ure
D: TableSt ruct ure
Q.no11.I nanEnt ity -
Relati
onshipDiagram “
Di amonds”
represents_ ____ ____ __
_______
A: Attri
but es
B: Mul t
i-
v aluedat tributes
C: Weakent i
tyset
D: Relati
onshi pset s
Q.no12.Whi choft hefoll
owingat t
ri
butecanbef urtherdivi
dedinto
subpar ts
A: Simpleat t
ribute
B: Mul t
ivaluedat t
r i
but e
C: Composi teat tri
but e
D: Derivedat tribute
Q.no13.Whoi smor econcernedaboutt heconcept uall
eveloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Cli
ent
D: DBA
Q.no14.Whi choft hefoll
owingisthest r
uctureoftheDat abase?
A: Table
B: .Schema
C: Relati
on
D: Structure
Q.no15.Theuser swhouseeasy -
to-usemenuar ecal l
ed
A: Sophist icatedenduser s
B: Naïveuser s
C: Stand-al oneuser s
D: Casual enduser
Q.no16.Adat adi ctionaryisarepositor
ythatmanages_ ____
A: Memor y
B: Met adat a
C: SpellChecker
D: DataVal idat or
Q.no17.E- Rmodelusest hi
ssymbolt orepresentweakent it
yset?
A: Dot t
edr ectangl e
B: Diamond
C: Doubl yout l
inedr ectangle
D: Dot t
eddi amond
Q.no18.I nE- Rdi agr am general
izati
onisrepresentedby
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no19.I nSQL‘ rel
at i
onAcont ainsr el
ationB’canbewr it
tenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no20.I nE- RDi agram der ivedat tri
butear er
epr esentedby _
____
___.
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no21.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper ator
C: Binar yOper ator
D: Notanoper ator
Q.no22.Whent hechangescausedbyanabor tedtransactionhavebeen
undone,
thet r
ansact i
oni ssai dt obe__ _
_ _____.
A: Failed
B: commi t
t ed
C: partiall
ycommi t
ted
D: roll
edback.
Q.no23.Dat aMani pulationLanguage( DML)isnott o__ _
___
A: Creat ei nformat i
ont ableintheDat abase
B: Insertionofnewi nformat i
oni ntot heDatabase
C: Delet i
onofi nformat i
oni ntheDat abase
D: Modi ficat i
onofi nformat i
oni nt heDat abase
Q.no24.Car t
esianpr oducti nrelationalalgebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef i
ned
Q.no25.Tor emov ear elat
ionfrom anSQLdat abase, weuset he____
__
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no26.I none- t
o-manyr el
ationshipt hetableon'many'
sideiscalledas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no27.Whi chofthefollowingf i
eldshaswi dt
hof8by t
es?
A: Memo
B: Number
C: Dat e/ ti
me
D: Hy per li
nk
Q.no28.Mi nimalSuperkeysar ecalled
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attribut ekeys
Q.no29.Funct i
onalDependenci esar ethet y
pesofconstrai
ntsthatare
based
on___ ___
A: Key
B: Keyr ev i
sit
ed
C: Super setkey
D: Tupl e
Q.no30.Whi chnormalf ormisconsi der
edadequat ef
orrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Af il
emani pul
ationcommandt hatext
ract
ssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no32.TheRDBMSt ermi nologyforar owi s________.
A: Tupl e.
B: Rel ation.
C: Attr i
but e.
D: Degr ee.
Q.no33.I nSQLt hest at ementsel ect*fr
om R, Sisequi valentt o____
___ .
A: Sel ect*f rom Rnat ur aljoinS
B: Sel ect*f rom Rcr ossj oinS
C: Sel ect*f rom Runi onj oinS
D: Sel ect*f rom Ri nnerj oinS
Q.no34.Whi chSQLQuer yisusetor emov eat ableandal litsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no35.I nthe_ ________ _nor malform,acomposi t
eat tribut eisconv erted
to
i
ndiv i
dualat tributes.
A: First
B: Second
C: Thi rd
D: Four t
h
Q.no36.Thet erm_ ____ __isusedt or ef
ert oar ow.
A: Attr i
but e
B: Tupl e
C: Field
D: Inst ance
Q.no37.Whi choft hef ollowingint r
uer egardingRef erent ialIntegri
ty?
A: Ever ypr imar y-
keyv al uemustmat chapr i
mar y-keyv aluei nan
associ at edtabl e
B: Ever ypr imar y-
keyv al uemustmat chaf orei
gn-keyv aluei nanassoci ated
table
C: Ever yf oreign-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ at edtabl e
D: Ev eryf oreign-keyv aluemustmat chaf oreign-keyv aluei nanassoci ated
table
Q.no38.Theempl oyeesal aryshouldnotbegr eaterthanRs.2000.Thi sis
__
_ ____
A: i
ntegr it
yconst raint
B: referent ialconst r
ai nt
C: over -def inedconst raint
D: feasi bleconst raint
Q.no39.Cust omerwi thdrawingmoneyf r
om ATM i sanexample
of
_ ____ ___ __
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci al izeduser
D: Sophi sticat eduser
Q.no40._ _ _ ____pr oducest her el
ationt hathasat tri
butesofR1andR2
A: Car tesi anpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no41.Thecol l
ect ionofi nterrelateddat aiscal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no42.NULLi s_ ____ _____ .
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar act er
C: Thesameas0f ori ntegerandbl ankf orchar acter
D: Notav al ue
Q.no43.Thenat ur al j
oi nisequalt o:
A: Car tesi anPr oduct
B: Combi nat ionofUni onandCar tesianpr oduct
C: Combi nat ionofsel ectionandCar t
esianpr oduct
D: Combi nat ionofpr ojectionandCar t
esianpr oduct
Q.no44.At ablej oinedwi thitselfiscalledas_ _______
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Joi n
Q.no45.I ndomai nr elationalcal culuswecr eateav ari
ablefor
every_ ___ __ __
A: Row
B: Column
C: Table
D: Attri
but e
Q.no46.The_ __ __
_ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q.no47.Whi chnamemustbeuni quewithinadat abase?
A: Table
B: Field
C: Recor d
D: Char acter
Q.no48.Whi choft hef ol
lowingi sanunar yoperation?
A: Selectionoper ation
B: Gener ali
zedsel ect i
on
C: Primitiveoper ati
on
D: Projectionoper ation
Q.no49.A_ __ _____inat abler epresent
sar elat
ionshipamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no50.whi choft hef ol
lowingi snotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relationshi ps
D: Repor ts
Q.no51.At abl eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi r
dNor mal Form( 3NF)
C: Hav easi ngl eat tr
ibut ekey
D: Hav eacomposi tekey
Q.no52.I fev erynon- keyat t
ributeisfuncti
onallydepedentpr
imar
ykey,
t
hent he
rel
at i
onwi l
lbei n_____ _____
__ _.
A: Firstnor mal for m
B: Secondnor mal for m
C: ThirdNor mal form
D: Four thnor mal for m
Q. no53.I far elat i
oni sinBCNF, t
heni tisalsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no54.I nther elat i
onalmodel ,thenumberofat tr
ibutesandnumberof
tupl es
i
riar elationar et er medas_ _
_ ___
_ ___and_ ______
_______respecti
vely
A: Car dinal i
ty,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinal i
ty,degr ee
Q. no55.Whi char et hetwoway si nwhi chent i
ti
escanpar ti
cipat
eina
relat i
onshi p?
A: Passi v eandact i
v e
B: Tot alandpar tial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q. no56.Whi choft hef oll
owingi snott r
uef orNormal i
zat i
on?
A: Remov esr edundancy
B: Remov esinser tionanomal y
C: Decomposest her el
ati
on
D: Quer yexecut ionbecomesf aster
Q. no57.Cr eat et abl eempl oy ee(namev archar,i
dinteger)Whatt ypeof
stat ement
i
st his?
A: DML
B: DDL
C: View
D: Integrityconst raint
Q. no58.Af tert hef inalstatementofat ransacti
onhasbeenexecut ed,
a
transact ionent er sina_ ________st at
e. _
_ _
____.
A: Act i
ve
B: abor t
ed
C: Commi t
ted
D:Part
iall
ycommi t
ted
Q.
no59.The_ _______ _
pr otocolensuresf
reedom f
rom deadlock.
A:Two-phasel ockingpr otocol
B:St
ri
ctt wo-phasel ockingpr otocol
C:Ri
goroust wo-phasel ockingprotocol
D:Ti
mest ampor deringpr otocol
Q.
no60.Dupl icationofdat aatsev er
alpl
acesisknownas_ _
_ _
A:Concurrentaccessanomal ies
B:Dataisolat
ion
C:Datainconsistency
D:Dataredundancy

A: Logicallyi mpl i
ed
B: Funct i
onal l
yi mpl ied
C: Logicallydet ermined
D: Funct i
onal l
ydet ermi ned
Q.no2.4NFi sdesi gnedt ocopewi th:
A: Transitiv edependency
B: Joindependency
C: Multi valueddependency
D: Funct i
onal dependency
Q.no3.Asubschemaexpr esses_ ____
____.
A: Thel ogical view
B: Thephy si cal view
C: Theext ernal view
D: Thei nter nal v i
ew
Q.no4.Rel at ionalcal culusisa:
A: Procedur al language
B: Non-Pr ocedur allanguage
C: Datadef initionl anguage
D: Highl ev el l
anguage
Q.no5.Whati sACI Dpr oper t
iesofTr ansacti
ons?
A: Atomi city ,Consi st ency,Isolation,Database
B: Atomi city, Consi st ency,Isolation,Durabil
i
ty
C: Atomi city ,Consi st ency,Inconsi stent,
Durabil
i
ty
D: Automat i
cal ly,Concur rency ,Isolati
on,Durabi
li
ty
Q.no6.Aggr egat ef unct i
onsar ef uncti
onsthattakea_
___
___
___
_asi
nput
and
ret
ur nasi ngl ev alue.
A: Col l
ect ionofv alues
B: Singl ev al ue
C: Aggr egat ev alue
D: Tabl es
Q.no7.Whi choneoft hefollowi ngisnottr
uef orav iew:
A: Viewi sder i
vedf rom othert ables
B: Viewi sav irt
ual table.
C: Av i
ewdef initi
oni sper manent l
ystor
edaspar tofthedatabase.
D: Viewnev ercont ainsder i
v edcol umns.
Q.no8.A‘ book’ isa_ _
_______ typeofenti
ty.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no9.Whi choft hef oll
owi ngshoul dbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary)
B: Av g(sal ar y)
C: Sum( sal ar y)
D: Count (sal ar y)
Q.no10.Sel ect*f r
om empl oy eeWhatt ypeofst atementisthis?
A: DML
B: Integr ityconst raint
C: DDL
D: View
Q.no11.Theov eralldescriptionofadat abasei scalled_
_____.
A: Dat ai nt egr it
y
B: Dat amani pulat i
on
C: Dat abaseschema
D: Dat adef i
ni ti
on
Q.no12.E- Rmodel ingt echni queis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -leftappr oach
D: Treest ruct ure
Q.no13.Thebasi cdat atypechar (n)i
sa_ ___
_l engthcharacterstr
ingand
varchar (n)i s_ ____l engthchar acter
A: Fixed, equal
B: Equal ,v ariabl e
C: Fixed, var iabl e
D: Var i
abl e, equal
Q.no14.Keyt or epr esentrelati
onshipbetweent ablesiscal
led
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dat eKey
Q.no15.Toappl yt heaggr egatefuncti
on,toagr oupofsetof
tuples_ ____ __cl ausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no16.The_ _ ____connect i
v ei
susedt otestforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no17.Thedat abaseenv ir
onmenthasal loft hefoll
owingcomponent
s
except ___ ___ __
A: User s.
B: Separ at ef il
es
C: Dat abase.
D: Dat abaseadmi nistr
ator
Q.no18.Hi er ar chicalmodeli salsocalled__
_ _
__ _
__.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Nor mal izeSt r
uct ure
D: Tabl eSt r
uct ure
Q.no19.Whi choft hef oll
owingattri
butecanbef ur
therdivi
dedint
o
subpar ts
A: Simpl eat tribute
B: Mul ti
v aluedat t
ribute
C: Composi teat tr
ibut e
D: Der i
vedat tribute
Q.no20.I nanEnt ity-Relat
ionshipDiagram “Di
amonds”
represent s_ __________ _
_ _
____
A: Attri
but es
B: Mul t
i-valuedat tr
ibutes
C: Weakent ityset
D: Relationshi pset s
Q.no21.Whi choneoft hefoll
owi nguniquelyidenti
fiestheelement
sinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no22.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper ator
C: BinaryOper ator
D: Notanoper ator
Q.no23.Theconcept ualmodelis_ ____
____.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof tware
D: Independentofbot hhar dwareandsof tware
Q.no24.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eoneclass
D: Manyt eacher smayhav emanycl asses
Q.no25.Al laggr egatef uncti
onsexcept_ _
___i gnorenullval
uesint
heir
i
nput
coll
ect i
on.
A: Count (at tr
ibute)
B: Count (* )
C: Av g
D: Sum
Q.no26.Af unctiont hathasnopar ti
alfuncti
onaldependenci esi
sin
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no27.Rel ationalAl gebrais
A: Dat aDef i
nitionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pul at i
onLanguage
Q.no28.I fever ynon- keyatt
ri
but
eisfuncti
onall
ydependentont he
pri
mar ykey ,
therel ationwi llbei n______
_
A: Fi
r stNor mal For m
B: SecondNor mal For m
C: Thir dNor mal For m
D: Four t hFor mal Form
Q.no29.Themet hodofaccesswhi chuseskeytransf
ormat i
oni sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no30.Whi choft hefoll
owingi
snotal ev
elofdataabstracti
on?
A: Phy si calLev el
B: Critical Level
C: Logi cal Level
D: ViewLev el
Q.no31.Whi choft hefoll
owingi
sNotaRel ati
on-al
gebraOper ati
on
A: Select
B: Uni on
C: Rename
D: Dropt abl
e
Q.no32.Whi choft hefoll
owingi
snotModi fi
cati
onoftheDat abase
A: Del etion
B: I
nser tion
C: Sor ting
D: Updat ing
Q.no33.Whati sar elati
onshi
pcall
edwheni ti
smai nt
ainedbet weentwo
entit
ies?
A: Unar y
B: Binar y
C: Ternar y
D: Quat ernary
Q.no34.Af unct i
onaldependencyi sar el
ationshi
pbet weenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q.no35.Whi choft hefollowi
ngar et heproperti
esofent i
ti
es?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no36.Whi choft hefollowi
ngenabl esustov i
ewdat afrom at
abl
e
basedona
specificcr i
terion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no37.Thecol l
ecti
onofi nt
errelateddataiscalledas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst racti
on
Q.no38.whi choft hefoll
owingisnotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relationshi ps
D: Repor ts
Q.no39.Mi nimalSuper keysarecal l
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no40.At abl ej
oinedwi thi
tselfiscall
edas_ ___
_ _
__
A: Join
B: SelfJoi n
C: OuterJoi n
D: Equi Join
Q.no41.Thet erm_ _ ___ __isusedt or efert
oar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no42.Theempl oy eesal aryshoul dnotbegr eatert
hanRs.2000.Thisis
_______
A: i
nt egr i
tyconst r
aint
B: referent ialconst raint
C: over -definedconst raint
D: feasi bleconst raint
Q.no43.The_ _____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no44.I nSQLt hest at ementsel ect *
from R,Sisequival
entto__
_____
.
A: Select*f r
om Rnat ur aljoinS
B: Select*f r
om Rcr ossj oinS
C: Select*f r
om Runi onj oinS
D: Select*f r
om Ri nnerj oinS
Q.no45.Whi chnor malf or mi sconsideredadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no46.Whi choft hef ollowingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no47.Funct ionalDependenci esar ethetypesofconst r
aint
sthatare
based
on__ ____
A: Key
B: Keyr evisited
C: Super setkey
D: Tupl e
Q.no48.I nthe_ _____
_ ___nor malform, acomposi t
eat t
ri
buteisconv er
ted
to
i
ndividualat tributes.
A: Fi
rst
B: Second
C: Third
D: Four th
Q.no49.Thenat uraljoinisequalt o:
A: Car tesianPr oduct
B: Combi nati
onofUni onandCar t
esianpr oduct
C: Combi nati
onofsel ectionandCar t
esianpr oduct
D: Combi nati
onofpr ojectionandCar t
esianpr oduct
Q.no50.Whi chSQLQuer yisuset oremov eat ableandal li
tsdataf r
om
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no51.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eat
es_ _
_ _
__
A: Par ent-Chil
dr elat
ionshi pbetweent het ablest hatconnectthem
B: Manyt omanyr el
ationshipbet weent hetabl esthatconnectthem.
C: Net wor kmodel betweent hetablesthatconnectt hem.
D: Manyt ooner elati
onshi pbetweent het ablest hatconnectthem.
Q.no52.I nthe_ _____
_ ___nor malform, acomposi t
eat t
ri
buteisconv er
ted
to
i
ndividualat tributes
A: Fi
rst
B: Second
C: Third
D: Four th
Q.no53.Ther esul toftheUNI ONoper ationbet weenR1andR2i sa
rel
ationt hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q. no54.Amongstt heACI Dpr opertiesofat ransacti
on,the'
Dur abil
it
y'
proper t
y
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, ev enifther ei saf ail
ureofanyki nd
Q. no55.Doesi ndext akespacei nthedisk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, I
ndexesar est or edondi sk
Q. no56.At abl ehasf ieldsF1, F2,F3, F4,F5wi ththefoll
owingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
Int ermsofnor mal ization, thist abl
ei si
n
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no57._ __ __ _
_al l
owust oi dentif
yuniquel yatupleintherelati
on.
A: Super key
B: Domai n
C: Attri
bute
D: Schema
Q. no58.Whi choft hef ollowi ngoper ati
oni susedi fwear ei
nterestedin
onl y
cer taincolumnsofat abl e?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q. no59.Whi choft hef ollowi ngi snotapr opertyofat r
ansaction?
A: Atomi city
B: Consist ency
C: Int
egrit
y
D: Durabil
ity
Q.no60.Consi derthefoll
owi ng
S1:For ei
gnkeyal lowsnul lvalues.
S2:Ev erybinarytablesisinBCNF
Whi chofthef oll
owi ngistrue?
A: BothS1andS2ar et
rue
B: S1ist r
ue
C: S2i str
ue
D: BothS1andS2ar ef
alse

Set3
Q.no1.Tor emov ear elati
onf r
om anSQLdat abase,weusethe_ _
___
_
command.
A: Delete
B: Purge
C: Remov e
D: Dropt able
Q.no2.Rel ati
onalcal culusisa:
A: Procedur allanguage
B: Non-Pr ocedur allanguage
C: Datadef i
niti
onl anguage
D: Highlev ellanguage
Q.no3.I fBi sanat tributeandA→B, ThenBi ssai
dtobe_ ___
____byA.
A: Logicallyimpl i
ed
B: Functionallyimpl ied
C: Logicallydet ermined
D: Functionallydet ermi ned
Q.no4.I nE- Rdi agram gener al
izati
oni sr epr
esent
edby
A: Ell
ipse
B: Dashedel l
ipse
C: Rectangl e
D: Tri
angl e
Q.no5.Whoi smor econcer nedaboutt heconceptuall
eveloftheDBMS
A: TheSy st emspr ogr ammer
B: Theenduser
C: Cli
ent
D: DBA
Q.no6.I nSQL‘ relationAcont ainsrelationB’canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no7.Theuser swhouseeasy -to-usemenuar ecall
ed
A: Sophi sticat edenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no8.Asubschemaexpr esses_ ________.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal vi
ew
D: Thei nter nal view
Q.no9.Dat ar edundancymayl eadt o:
A: Dat ai nt egr ity
B: Atomi ci typr oblem
C: Dat ai nconsi stency
D: Dat aabst raction
Q.no10.Whent hechangescausedbyanabor tedtr
ansact
ionhavebeen
undone,
thet r
ansact ioni ssai dtobe_ ___ _
_ _
_ _.
A: Failed
B: commi tt ed
C: partial l
ycommi t
ted
D: roll
edback.
Q.no11.Adat adi cti
onaryi sar eposi t
orythatmanages_ __
_ _
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idat or
Q.no12.Whati sACI Dproper t
iesofTr ansacti
ons?
A: Atomi ci ty, Consi stency,Isol
at i
on, Database
B: Atomi ci ty, Consi stency,Isol
at i
on, Durabil
i
ty
C: Atomi ci ty, Consi stency,Inconsistent,Durabil
ity
D: Aut omat ical ly,Concurrency,Isolation,Durabil
it
y
Q.no13.E- Rmodelusest hissy mbolt orepresentweakenti
tyset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout l
inedr ect angle
D: Dot teddi amond
Q.no14.Whi choft hef ollowingi sthest r
uctur
eoft heDatabase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no15.Car tesianpr oducti nr elat
ionalalgebrais:
A: aUnar yoper at
or
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no16.I nE- RDiagr am der i
v edattri
butear er
epr esentedby____
_ _
__.
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no17.Fort hegiv ensetoff unctionaldependencyF, it
’scl
osureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no18.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul tiv alueddependency
D: Funct ional dependency
Q.no19.Dat aMani pul at i
onLanguage( DML)isnott o_
_ _
___
A: Creat ei nf ormat i
ont ableint heDat abase
B: Inser t
ionofnewi nf or mationintot heDatabase
C: Delet i
onofi nformat ionint heDat abase
D: Modi fi
cat ionofi nf ormat ioni ntheDat abase
Q.no20.I nwhi chst at eonegat hersandl i
stal
lthenecessar yfi
eldsfort
he
databasedesi gnpr oj ect .
A: Dat aDef initi
on
B: Dat aRef inement
C: Establ ishi ngRel ationshi p
D: Dat adel et ion
Q.no21.Thi skeyt hatuni quelyident i
fi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: FieldName
Q.no22.A‘ book’ i
sa_ _______
_typeofent it
y.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no23.Whatdoy oumeanbyonet omanyrelationshi
pbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no24.Thebasi cdat atypechar (n)isa_____lengthcharact
erstr
ingand
varchar (n)i s_ ____lengt hcharact er
A: Fixed, equal
B: Equal , v ariable
C: Fixed, var iable
D: Variabl e, equal
Q.no25.I nanEnt it
y -Relat
ionshipDi agram “
Diamonds”
represent s_ _ ____
____ ________
A: Attribut es
B: Mul ti-
v al uedat tr
ibut es
C: Weakent it
yset
D: Relat ionshi psets
Q.no26.Cust omerwi t
hdrawingmoneyf r
om ATM i sanexampl e
of_____ ___ _ _
A: Appl icat ionpr ogr ammer
B: Naïv euser
C: Speci al izeduser
D: Sophi st i
cat eduser
Q.no27._ ___ ___producest herelationthathasat tr
ibut
esofR1andR2
A: Cart esi anpr oduct
B: Difference
C: Product
D: Inter section
Q.no28.I fev erynon- keyat t
ri
buteisfunctionall
ydependentont he
primar ykey ,
ther elat i
onwi llbei n__ _____
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal Form
Q.no29.Rel at ionalAl gebr ais
A: Dat aDef i
ni ti
onLanguage
B: Met aLanguage
C: Pr ocedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no30.Whi choft hef ollowingisnotal evelofdat aabstracti
on?
A: Phy sicalLev el
B: Cr i
tical Lev el
C: Logi calLev el
D: ViewLev el
Q.no31.I ndomai nr elationalcalcul
uswecr eateav ariabl
ef or
every __ ______
A: Row
B: Col umn
C: Tabl e
D: At tri
but e
Q.no32.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char acter
Q.no33.TheRDBMSt ermi nologyforarowi s________.
A: Tupl e.
B: Rel at i
on.
C: At tri
but e.
D: Degr ee.
Q.no34.Whi choft hef ollowingintrueregardingRef erenti
alInt
egri
ty?
A: Ev er yprimar y-keyv aluemustmat chapr imary-keyvalueinan
associ at edtabl e
B: Ev erypr imar y-keyv aluemustmat chaf orei
gn-keyv alueinanassociat
ed
table
C: Everyforei gn-keyv al
uemustmat chapr imar y-keyv alueinan
associatedt able
D: Everyf or
ei gn-keyv al
uemustmat chaf orei
gn- keyv aluei
nanassoci ated
table
Q.no35.A_ ______ _inat ablerepresentsar elationshi pamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no36.Whi choft hef ollowingisNotaRel ation- algebraOper at
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no37.Themet hodofaccesswhi chuseskeyt ransf ormati
onisknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent i
al
Q.no38.NULLi s__ _______ _
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar act
er
C: Thesameas0f orintegerandbl ankf orchar act er
D: Notav al
ue
Q.no39.Af unct i
ont hathasnopar tialf
unctionaldependenci esisin
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no40.Af ilemani pulationcommandt hatext ract ssomeoft herecords
from a
fil
eiscalled
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no41.Whi choft hef ollowingi sanunar yoperati
on?
A: Select ionoper ation
B: Gener ali
zedsel ect i
on
C: Primi t
iveoper ati
on
D: Proj ect i
onoper at i
on
Q.no42.I none- t
o- manyr elati
onshipthetableon'many '
sideiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no43.Whi choft hef ollowingi snotModi fi
cati
onoftheDat abase
A: Del etion
B: I
nser ti
on
C: Sor ting
D: Updat ing
Q.no44.I nSQLt hest at ementsel ect*
from R,Sisequi
valentt
o_ _
_____
.
A: Select*f r
om Rnat ur al j
oinS
B: Select*f r
om Rcr ossj oinS
C: Select*f r
om Runi onj oinS
D: Select*f r
om Ri nnerj oinS
Q.no45.The_ _
__ __ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no46.Mi nimalSuper key sar ecalled
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attribut ekey s
Q.no47.Theempl oy eesal aryshoul dnotbegr eat
erthanRs.2000.Thisis
_______
A: i
nt egr i
tyconst raint
B: refer entialconstraint
C: over -definedconst raint
D: feasi bleconst raint
Q.no48.Funct i
onalDependenci esar ethetypesofconstrai
ntsthatare
based
on__ ____
A: Key
B: Keyr evisit
ed
C: Super setkey
D: Tupl e
Q.no49.I nthe_ _
_ _______normalform,acomposi t
eat t
ributeisconver
ted
to
i
ndiv i
dualat tributes.
A: Fir
st
B: Second
C: Third
D: Four t
h
Q.no50.Whi choft hef oll
owingfi
eldshaswidthof8by tes?
A: Memo
B: Number
C: Dat e/ti
me
D: Hy perli
nk
Q.no51.At ableont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal Form(2NF)
B: Bei nThi r
dNor mal Form(3NF)
C: Hav easi ngl eat t
ributekey
D: Hav eacomposi tekey
Q.no52.I far elati
oni si nBCNF, t
heniti
salsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no53.Cr eat etabl eempl oyee(namev ar
char,i
dinteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst rai
nt
Q.no54.Whi char et het woway sinwhichenti
ti
escanpar t
ici
pateina
rel
at i
onshi p?
A: Passiv eandact i
ve
B: Tot alandpar t
ial
C: Simpl eandCompl ex
D: si
mpl eandpar ti
al
Q. no55.The_ ______ __
pr otocolensur esf reedom from deadlock.
A: Two- phasel ocki ngpr ot ocol
B: Stri
ctt wo-phasel ockingpr otocol
C: Rigoroust wo- phasel ocki ngprotocol
D: Timest ampor deringpr ot ocol
Q. no56.Af unct i
onaldependencyoft hef orm x—>yi stri
v ali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no57.Dupl i
cat ionofdat aatsev er
alpl acesisknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisolati
on
C: Dat ainconsi stency
D: Dat aredundancy
Q. no58.I feverynon- keyat tri
buteisfunct ional
lydepedentpr i
marykey,
thent he
relationwi l
lbei n_ ________ ____.
A: Fi
rstnor mal form
B: Secondnor mal f
orm
C: ThirdNor mal form
D: Four t
hnor mal for m
Q. no59.Whi choft hef ollowi ngisnott r
uef orNormali
zation?
A: Remov esr edundancy
B: Remov esinser t
ionanomal y
C: Decomposest her elation
D: Quer yexecut i
onbecomesf ast
er
Q. no60.Af tert hef inalstat ementofat ransact i
onhasbeenexecut ed,a
transact ionent er sina_ __ ______stat
e. _
__ ____.
A: Act i
ve
B: abor t
ed
C: Commi t
ted
D: Par t
iall
ycommi t
ted
Q. no1.Al laggr egat efunct ionsexcept_ ____ignorenullvaluesint
heir
i
nput
col l
ect i
on.
A: Count (attr
ibute)
B: Count (*)
C: Av g
D: Sum
Q.no2.Toappl yt heaggr egatefunction,toagr oupofsetof
tuples_ __ ____ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no3.Theconcept ualmodelis_________.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof tware
D: Independentofbot hhardwareandsof tware
Q.no4.Whi choneoft hefoll
owinguni quel
yidentifi
estheelementsi
nthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: For eignkey
D: Composi tekey
Q.no5.I nE- Rdi agram gener ali
zati
oni srepresentedby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no6.Theuser swhouseeasy -
to-usemenuar ecalled
A: Sophi sticat edenduser s
B: Naï veuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no7.Rel at ionalcal cul
usi sa:
A: Procedur al language
B: Non- Procedur allanguage
C: Dat adef initionl anguage
D: Highl ev ellanguage
Q.no8.Whent hechangescausedbyanabor tedtransact
ionhavebeen
undone,
thet r
ansact ioni ssai dtobe_ _
_____
_ _.
A: Failed
B: commi t
t ed
C: partiallycommi tted
D: roll
edback.
Q.no9.I fBi sanat tri
but eandA→B, ThenBi ssaidtobe_____
_ _
_byA.
A: Logi callyi mpl i
ed
B: Funct ional lyi mpl i
ed
C: Logi callydet er mi ned
D: Funct ional lydet ermi ned
Q.no10.Hi er archi calmodeli salsocall
ed_____
_ _
__.
A: Treest ruct ure
B: PlexSt r
uct ure
C: Nor mal izeSt ruct ure
D: Tabl eSt r uctur e
Q.no11.Tor emov ear elat
ionfrom anSQLdat abase,weuset he__
___
_
command.
A: Delet e
B: Purge
C: Remov e
D: Dropt abl e
Q.no12.Dat ar edundancymayl eadto:
A: Dat aint egr ity
B: Atomi ci typr obl em
C: Dat ainconsi stency
D: Dat aabst r
act ion
Q.no13.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ternar yOper at or
C: Binar yOper ator
D: Notanoper at or
Q.no14.Thedat abaseenv i
ronmenthasal lofthefol
lowi
ngcomponents
except ___ ___ __
A: User s.
B: Separ at ef il
es
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no15.I nSQL‘ r elationAcont ainsrelat
ionB’canbewr i
ttenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: exist sAexceptB
Q.no16.E- Rmodel i
ngt echniqueis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ur e
Q.no17.Sel ect*f r
om empl oyeeWhatt ypeofst atementisthis?
A: DML
B: I
nt egr i
tyconst raint
C: DDL
D: View
Q.no18.Asubschemaexpr esses_____
_ ___.
A: Thel ogical view
B: Thephy sical view
C: Theext er nal view
D: Thei nternal v i
ew
Q.no19.Aggr egat ef unctionsar efunctionst hattakea_ _
________
_as
i
nputand
ret
urnasi ngl ev alue.
A: Col l
ect i
onofv alues
B: Singl ev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no20.Theov eralldescr i
pti
onofadat abasei scalled__
____.
A: Dat ai ntegr ity
B: Dat amani pul at i
on
C: Dat abaseschema
D: Dat adef inition
Q.no21.Whi choft hef ollowingat t
ri
butecanbef urt
herdivi
dedinto
subpar ts
A: Simpl eat tribut e
B: Mul tivaluedat tri
but e
C: Composi t eat t
ribut e
D: Der i
v edat tribut e
Q.no22.Whi choneoft hefollowingisnott ruef orav i
ew:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav i
rtual tabl e.
C: Av iewdef init i
oni sper manentlystoredaspar tofthedatabase.
D: Viewnev ercont ainsderivedcol umns.
Q.no23.Keyt or epresentrelationshipbetweentablesiscall
ed
A: Primar ykey
B: Secondar yKey
C: For ei
gnKey
D: Candi dat eKey
Q.no24.The_ __
_ __connecti
v eisusedt otestforabsenceofset
member ship.
A: except
B: exists
C: noti n
D: in
Q.no25.Whi choft hef ol
lowi ngshoul dbeusedt ofi
ndt hemeanofthe
salary?
A: Mean( salar y)
B: Avg( salary )
C: Sum( salary )
D: Count (
sal ary)
Q.no26.Whi chSQLQuer yisuset oremoveat ableandalli
tsdatafr
om
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no27.Whi chnor malf ormi sconsi der
edadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no28.Thecol lectionofint er
relateddataiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst racti
on
Q.no29.At abl ejoinedwi thitselfiscall
edas________
A: Join
B: Sel fJoi n
C: Out erJoi n
D: Equi Joi n
Q.no30.Whati sar el
ationshipcall
edwheni ti
smai ntainedbetweent
wo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat ernary
Q.no31.Whi choft hef oll
owingar ethepr operti
esofent i
ti
es?
A: Gr oups
B: Tabl e
C: At tri
but es
D: Swi tchboar ds
Q.no32._ _ _
_ ___pr oducest herelati
ont hathasat tr
ibutesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Pr oduct
D: Inter section
Q.no33.I fev erynon- keyat tr
ibut
ei sfunctionall
ydependentont he
pri
mar ykey ,
ther elat i
onwi llbei n_
_ _____
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no34.Thet erm_ __
_ ___isusedtor efertoar ow.
A: At tri
but e
B: Tupl e
C: Field
D: Inst ance
Q.no35.Af unct i
onaldependencyi sarelationshipbetweenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: At tri
but es
Q.no36.Thenat uralj
oini sequalto:
A: Car tesi anPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nationofsel ectionandCar t
esianproduct
D: Combi nationofpr ojectionandCar tesianproduct
Q.no37.Whi choft hef ollowingenabl esust oviewdat af r
om atabl
e
basedona
specificcr i
terion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no38.whi choft hef oll
owi ngisnotadat abaseobj ect?
A: Tables
B: Quer i
es
C: Relationshi ps
D: Repor ts
Q.no39.Cust omerwi thdrawingmoneyf r
om ATM i sanexampl e
of_______ ___
A: Applicationpr ogrammer
B: Naïveuser
C: Speci ali
zeduser
D: Sophi sti
cat eduser
Q.no40.A_ __ __
___inat ablerepresentsar elat
ionshipamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no41.Whi choft hef ollowingisnotModi fi
cationoft heDatabase
A: Deletion
B: Insertion
C: Sorting
D: Updat ing
Q.no42.Whi choft hef ollowingisanunar yoperation?
A: Select i
onoper ation
B: Gener ali
zedsel ection
C: Primitiveoper ati
on
D: Project i
onoper ation
Q.no43.Themet hodofaccesswhi chuseskeyt ransformati
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no44.I nt he_ _____ __
__normalf orm,acomposi teattr
ibut
eisconvert
ed
t
o
i
ndiv i
dualat tr
ibutes.
A: First
B: Second
C: Thi r
d
D: Four th
Q.no45.TheRDBMSt erminologyforar owis__ __
_ _
__.
A: Tupl e.
B: Relat ion.
C: Attribut e.
D: Degr ee.
Q.no46.Af unct i
ont hathasnopar t i
alf
unctionaldependenciesisin
__
_ ____f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no47.Theempl oy eesalaryshoul dnotbegr eaterthanRs.2000.Thi
sis
__
_ ____
A: i
nt egr it
yconst r
ai nt
B: referent ialconst raint
C: over -def i
nedconst r
aint
D: feasi bleconst raint
Q.no48.NULLi s__ ________
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandblankf orcharacter
D: Notav alue
Q.no49.I none- to-manyr elat
ionshipthetableon' many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no50.Whi choft hef oll
owingf i
eldshaswi dthof8by t
es?
A: Memo
B: Number
C: Dat e/time
D: Hy per l
ink
Q. no51.Amongstt heACI Dproper t
iesofat ransacti
on,the'Durabil
ity'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, ev eni fther eisaf ail
ureofanyki nd
Q. no52.I nt he_ ___ ______normalf orm, acomposi teattr
ibuteisconv ert
ed
to
i
ndi v i
dualat tributes
A: First
B: Second
C: Third
D: Four th
Q. no53.Whi choft hefollowingi snotapr opertyofat r
ansaction?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur abi l
ity
Q. no54.Doesi ndext akespacei nthedi sk?
A: Indexesar enev erstoredondi sk
B: I
tst oresmemor yasandwhenr equired
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q. no55.I nt her elationalmodel ,t
henumberofat tri
butesandnumberof
tupl es
i
riar elationar et ermedas_ _________and_ __
_ _
______
___respectivel
y
A: Car dinal it
y ,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Car dinal it
y ,degr ee
Q. no56.Ther esultoft heUNI ONoper ati
onbet weenR1andR2i sa
relat i
ont hat
i
ncl udes
A: AllthetuplesofR1
B: AllthetuplesofR2
C: AllthetuplesofR1andR2
D: AllthetuplesofR1andR2whi chhavecommoncolumns
Q.no57.Consi derthef oll
owi ng
S1:For ei
gnkeyal lowsnul lvalues.
S2:Ev erybinarytablesi sinBCNF
Whi chofthef oll
owi ngi strue?
A: BothS1andS2ar etrue
B: S1i str
ue
C: S2i str
ue
D: BothS1andS2ar efalse
Q.no58.At ablehasf i
eldsF1, F2, F3,F4,F5wit
hthefol
lowingfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI
,F2)—>F5
Intermsofnor malization,thistableisi
n
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no59.Whi choft hef oll
owi ngoperati
onisusedifweareinter
estedin
only
certaincolumnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q.no60.At ableont hemanysi deofaonet omanyormanyt omany
rel
at i
onship
must :
A: Bei nSecondNor mal For m( 2NF)
B: Bei nThirdNormal Form( 3NF)
C: Hav easingleattributekey
D: Hav eacomposi tekey

Set4
Q.no1.Thi
skeyt
hatuni
quel
yident
if
ieseachr
ecor
discal
led
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no2.Adat adi cti
onar yisar eposit
orythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idator
Q.no3.A‘ book’ isa_ _______ _
ty peofentit
y.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no4.I nanEnt i
ty-Relati
onshi pDi agram “
Di amonds”
represent s_ ________ _
___ _
___ _
A: Attribut es
B: Mul ti-
v aluedat tr
ibutes
C: Weakent i
tyset
D: Rel ationshi pset s
Q.no5.Whoi smor econcer nedaboutt heconceptuall
eveloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no6.Thebasi cdat atypechar (n)i
sa_ ____lengt
hcharacterst
ri
ngand
varchar (
n)i s_ _
__ _lengthchar acter
A: Fixed, equal
B: Equal , var i
able
C: Fixed, var i
able
D: Var iabl e,equal
Q.no7.E- Rmodelusest hissy mbolt orepresentweakenti
tyset?
A: Dot tedr ectangl e
B: Diamond
C: Doubl yout li
nedr ectangle
D: Dot teddi amond
Q.no8.Whati sACI Dpr oper t
iesofTr ansacti
ons?
A: Atomi ci t
y ,Consi st
ency ,Isolati
on,Database
B: Atomi ci t
y ,Consistency ,I
sol ati
on,Durabil
it
y
C: Atomi ci ty, Consi stency ,I
nconsi stent,Dur abilit
y
D: Aut omat ically,Concur rency ,Isolation,Dur abili
ty
Q.no9.I nwhi chst ateonegat her sandl istallthenecessar yfi
eldsfort
he
database
designpr oject .
A: Dat aDef initi
on
B: Dat aRef inement
C: Establ i
shi ngRel at i
onshi p
D: Dat adel et ion
Q.no10.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul tival ueddependency
D: Funct ional dependency
Q.no11.Whi choft hef oll
owi ngi sthest r
uct ureoft heDatabase?
A: Tabl e
B: .Schema
C: Relation
D: Structur e
Q.no12.Fort hegiv ensetoff unct ionaldependencyF, it
’scl
osureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no13.Dat aMani pulationLanguage( DML)i snott o_
_ _
___
A: Creat ei nf ormat iont ableint heDat abase
B: Insertionofnewi nformat ioni ntot heDat abase
C: Delet i
onofi nformat i
oni nt heDat abase
D: Modi ficat ionofi nformat ioni nt heDat abase
Q.no14.I nE- RDiagr am der i
v edat tributear er epresentedby_____
___.
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no15.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no16.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper at or
C: Binar yOper ator
D: Notanoper ator
Q.no17.I nE- Rdi agr am gener ali
zati
oni sr
epresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no18.Theuser swhouseeasy -
to-usemenuar ecall
ed
A: Sophi st icatedenduser s
B: Naï veuser s
C: Stand- al oneuser s
D: Casual enduser
Q.no19.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -
lef tappr oach
D: Treest ruct ure
Q.no20.Whi choneoft hefollowingisnottrueforav iew:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav i
rtual table.
C: Av iewdef i
niti
oni sper manent l
ystoredaspar tofthedat
abase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no21.Whi choft hef ollowingshoul dbeusedt ofindthemeanofthe
salary?
A: Mean( sal ary )
B: Avg( sal ary )
C: Sum( sal ary)
D: Count (
sal ary)
Q.no22.Whent hechangescausedbyanabor tedtransact
ionhav
ebeen
undone,
thetransact ioni ssai dtobe_ _______
_ .
A: Failed
B: commi tted
C: par t
iallycommi t
ted
D: roll
edback.
Q.no23.Toappl yt heaggr egat
ef uncti
on, toagr oupofsetof
tuples_ ______ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no24.Car t
esi anpr oducti nr
elati
onalal gebrais:
A: aUnar yoper at or
B: aBi nar yoper ator
C: aTer naryoper ator
D: notdef i
ned
Q.no25.I fBi sanat tri
buteandA→B, ThenBi ssaidtobe_ ___
____byA.
A: Logi callyimpl i
ed
B: Funct ional l
yi mpl i
ed
C: Logi callydet er mined
D: Funct ional lydet ermined
Q.no26.Whi chSQLQuer yisuset oremov eatableandallitsdat
af r
om
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no27._ ____ __pr oducest herel
ationthathasat t
ri
butesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect i
on
Q.no28.Whi choft hef ol
lowingaret heproper ti
esofentit
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no29.Af unct ionaldependencyi sar elationshi
pbetweenoramong:
A: Tabl es
B: Rows
C: Relations
D: Attri
but es
Q.no30.Af i
lemani pul
ati
oncommandt hatextr
actssomeoft her ecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no31.Whi chnamemustbeuni quewithi
nadat abase?
A: Table
B: Fi
eld
C: Recor d
D: Charact er
Q.no32.Rel ati
onalAlgebrais
A: DataDef i
niti
onLanguage
B: Met aLanguage
C: Procedur alqueryLanguage
D: DataMani pulat
ionLanguage
Q.no33.Whati sar el
ati
onshi
pcalledwheni ti
smai nt
ainedbet weent wo
entit
ies?
A: Unary
B: Binary
C: Ternar y
D: Quat ernary
Q.no34.Whi chnormalformisconsideredadequateforrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no35.Funct ionalDependenci
esar et
het y
pesofconst rai
ntst hatare
based
on___ _
__
A: Key
B: Keyr ev i
sit
ed
C: Super setkey
D: Tuple
Q.no36.Whi choft hef ollowingintrueregar dingRef erentialIntegri
ty?
A: Everypr imar y-
keyv aluemustmat chapr imar y-keyv alueinan
associatedt able
B: Everypr imar y-
keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
table
C: Everyfor ei gn-keyvaluemustmat chapr i
mar y-
keyv aluei nan
associatedt able
D: Everyf orei gn-keyvaluemustmat chafor eign-keyv alueinanassoci ated
table
Q.no37.I ndomai nrelationalcalcul
uswecr eat eav ariablef or
every_____ ___
A: Row
B: Column
C: Table
D: Attri
but e
Q.no38.Mi nimalSuper key sarecalled
A: Schemakey s
B: Candidat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no39.Thecol l
ecti
onofi nter
relat
eddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst r acti
on
Q.no40.Whi choft hef ollowingisNotaRel ation-algebr aOper ati
on
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no41.I fev er ynon-keyat t
ri
buteisfunctional l
ydependentont he
primarykey ,
therelati
onwi l
lbein__ _____
A: Fir
stNor mal Form
B: SecondNor mal Form
C: ThirdNor mal Form
D: FourthFor mal Form
Q.no42.I nSQLt hestat ementsel ect*
from R, Sisequi valentt o_____
__.
A: Select*f r om Rnat ur aljoi
nS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Ri nnerj oinS
Q.no43.Thet er m_ _ ___ __isusedtor ef
ert oar ow.
A: Attribute
B: Tupl e
C: Field
D: Instance
Q.no44.The_ _____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no45.At ablejoinedwi thitsel
fiscall
edas_ __ _
__ __
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no46.Whi choft hef oll
owingisnotal evelofdat aabst
ract
ion?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no47.Theempl oy eesal ar
yshouldnotbegr eaterthanRs.2000.Thi
sis
__
_ ____
A: i
nt egr i
tyconst r
aint
B: referent i
al const raint
C: over -definedconst raint
D: feasi bleconst raint
Q.no48.Thenat ural joini sequalto:
A: Car tesianPr oduct
B: Combi nat i
onofUni onandCar tesi
anpr oduct
C: Combi nat i
onofsel ect i
onandCar tesianpr oduct
D: Combi nat i
onofpr oject i
onandCar tesianpr oduct
Q.no49.Af unct i
ont hathasnopar ti
alfunct i
onaldependenci esisin
__
_ ____f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no50.Whi choft hef ollowingi sanunar yoper ati
on?
A: Selectionoper ation
B: Gener ali
zedsel ection
C: Primitiveoper at i
on
D: Projectionoper ation
Q.no51.I far elationi sinBCNF, t
heni ti
sal soin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no52.Dupl i
cat ionofdat aatsev er
alplacesi sknownas_ _ __
A: Concur rentaccessanomal ies
B: Dat aisolation
C: Dat ainconsi stency
D: Dat aredundancy
Q.no53.The_ ______ __protocolensur esf r
eedom f r
om deadl ock.
A: Two- phasel ockingpr ot ocol
B: Stri
ctt wo-phasel ockingpr otocol
C: Rigoroust wo- phasel ockingpr otocol
D: Timest ampor deringpr otocol
Q.no54.I fever ynon- keyat t
ributeisfunctionall
ydepedentpr i
marykey,
thent he
rel
at i
onwi l
lbei n_ ________ ___
_ .
A: Fir
stnor mal form
B: Secondnor mal f
orm
C: ThirdNor mal form
D: Four t
hnor mal for m
Q.no55._ _____ _al l
owust oidentifyuniquelyat upl
eint herelat
ion.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q.no56.Cr eat etabl eempl oyee( namev archar,i
dinteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst raint
Q. no57.Whi charet hetwoway sinwhichent i
tiescanpar ti
cipateina
relat i
onshi p?
A: Passi veandact i
v e
B: Tot alandpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q. no58.Af terthef inalstatementofat r ansact i
onhasbeenexecut ed,a
t
r ansact i
onent ersi na_ ______
__st at
e._______.
A: Act i
ve
B: abor t
ed
C: Commi tted
D: Par ti
all
ycommi tted
Q. no59.Apr imarykeyi scombi nedwi t
haf oreignkeycr eates____
__
A: Par ent-
Chi l
drelationshipbetweent het ablest hatconnectthem
B: Manyt omanyr elat i
onshipbetweent hetabl esthatconnectt hem.
C: Net workmodel bet weenthetablesthatconnectt hem.
D: Manyt ooner elat i
onshipbetweent het ablest hatconnectthem.
Q. no60.Af uncti
onaldependencyoft hef orm x—>yi str
ivalif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x

Set5
Q.no1.InSQL‘ relati
onAcontai
nsrelat
ionB’canbewri
ttenas
A: NotexistsBexceptA
B: exi
stsBexceptA
C: NotexistsAexceptB
D: exi
stsAexceptB
Q.no2.Asubschemaexpr esses__
_______.
A: Thelogical v
iew
B: Thephy sicalview
C: Theexternal vi
ew
D: Theinternalview
Q.no3.Adat adict i
onar
yisareposit
orythatmanages_
____
A: Memor y
B: Metadata
C: Spel
lChecker
D: DataVal i
dat or
Q.no4.Thedat abaseenv i
ronmenthasal lofthefoll
owingcomponents
except__ ____ __
A: Users.
B: Separ atef il
es
C: Database.
D: Databaseadmi nistrator
Q.no5.E- Rmodelusest hi ssymbolt orepresentweakent i
tyset?
A: Dottedr ect angle
B: Diamond
C: Doubl yout l
inedr ectangl e
D: Dotteddi amond
Q.no6.Rel at i
onalcal culusi sa:
A: Procedur allanguage
B: Non-Pr ocedur allanguage
C: Datadef i
ni ti
onl anguage
D: Highl evel language
Q.no7.I nanEnt ity-Relationshi pDiagram “Diamonds”
represent s__ _________ __
_ ____
A: Attri
but es
B: Multi-
v aluedat t
ributes
C: Weakent it
yset
D: Relationshi pset s
Q.no8.Whi choft hef oll
owi ngat t
ri
butecanbef ur
therdiv
idedint
o
subpar t
s
A: Simpl eat tri
but e
B: Multivaluedat tr
ibut e
C: Composi t eattri
but e
D: Derivedat tri
bute
Q.no9.Whi choneoft hef ollowinguniquelyidenti
fi
estheelementsi
nthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi t ekey
Q.no10.Theconcept ualmodeli s______
__ _
.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwareandsof tware
D: Independentofbot hhar dwareandsof tware
Q.no11.Keyt or epresentr el
ationshipbetweent abl
esiscall
ed
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no12.Dat ar edundancymayl eadto:
A: Dat ai nt egr it
y
B: Atomi ci typr obl em
C: Dat ai nconsi st ency
D: Dat aabst ract i
on
Q.no13.Thebasi cdat atypechar (n)isa_____lengt
hcharacterstr
ingand
varchar (n)i s_ ___ _lengthchar acter
A: Fixed, equal
B: Equal , var iable
C: Fixed, var iable
D: Var iabl e, equal
Q.no14.Theov eralldescripti
onofadat abasei scall
ed____
__.
A: Dat ai nt egr it
y
B: Dat amani pulat i
on
C: Dat abaseschema
D: Dat adef i
ni ti
on
Q.no15.Whoi smor econcer nedaboutt heconceptuall
eveloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no16.The_ __ ___connect i
veisusedt otestforabsenceofset
member shi p.
A: except
B: exist s
C: noti n
D: in
Q.no17.Al laggr egatef uncti
onsexcept_ _
___ignorenullv
aluesinthei
r
i
nput
coll
ect ion.
A: Count (at tribute)
B: Count (* )
C: Av g
D: Sum
Q.no18.I nwhi chst ateonegat hersandl istallthenecessaryf
iel
dsf orthe
databasedesi gnpr oject.
A: Dat aDef inition
B: Dat aRef inement
C: Est ablishi ngRel ati
onship
D: Dat adel etion
Q.no19.Hi er ar chicalmodeli sal socalled_ ________.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Nor mal i
zeSt r
uct ure
D: Tabl eSt ruct ure
Q.no20.Whati sACI Dproperti
esofTr ansact i
ons?
A: Atomi city, Consi stency,I
solation,Database
B: Atomi city, Consi stency,I
solation,Durabi l
ity
C: Atomi city, Consi stency,I
nconsi stent
, Dur abil
it
y
D: Aut omat ical l
y ,Concurrency,Isolati
on, Dur abi
li
t y
Q.no21.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul t ivalueddependency
D: Funct i
onal dependency
Q.no22.Aggr egat ef uncti
onsar ef uncti
onst hatt akea___
____
____as
i
nputand
ret
urnasi ngl ev alue.
A: Col lectionofv alues
B: Si
ngl ev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no23.Sel ect*f rom empl oyeeWhatt y peofst atementi
sthi
s?
A: DML
B: I
nt egr i
tyconst raint
C: DDL
D: View
Q.no24.Tor emov ear el
ati
onf rom anSQLdat abase,weusethe_ _
__ _
_
command.
A: Del ete
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no25.Thi skeyt hatuni quelyidenti
fi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no26.I nt he_ _________normalf orm,acomposi teattr
ibut
eisconvert
ed
to
i
ndi vi
dualat tri
butes.
A: First
B: Second
C: Thir d
D: Four th
Q.no27.Whi choft hefollowingf i
eldshaswi dthof8by t
es?
A: Memo
B: Number
C: Dat e/t i
me
D: Hy per li
nk
Q.no28.A_ _____
_ _inat ablerepresentsar elat
ionshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no29.I none- to-manyr el
ationshipthetableon' many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no30.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of_____ ____ _
A: Appl icat ionprogr ammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticateduser
Q.no31.TheRDBMSt ermi nologyforar owi s__
_ __
___.
A: Tupl e.
B: Relat i
on.
C: Attribut e.
D: Degree.
Q.no32.Whi chofthef oll
owingarethepropertiesofent i
ties?
A: Groups
B: Table
C: Attr
ibutes
D: Switchboards
Q.no33.Themet hodofaccesswhi chuseskeyt ransformationisknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent i
al
Q.no34.NULLi s____
__ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharact
er
C: Thesameas0f orintegerandblankforcharacter
D: Notav al
ue
Q.no35.Whi chofthef oll
owingenablesustov iewdat af r
om at abl
e
basedona
specifi
ccr it
eri
on
A: Form
B: Query
C: Macr o
D: Repor t
Q.no36.Whi chofthef oll
owingisnotModi f
icationoft heDat abase
A: Deleti
on
B: I
nser t
ion
C: Sorti
ng
D: Updat i
ng
Q.no37.whi chofthefollowingisnotadatabaseobj ect?
A: Tables
B: Queries
C: Relati
onships
D: Repor t
s
Q.no38.Af uncti
onaldependencyi sarelat
ionshi pbetweenoramong:
A: Tables
B: Rows
C: Relati
ons
D: Attri
butes
Q.no39.Whi chSQLQuer yisuset or emov eat ableandalli
tsdatafr
om
the
database?
A: Cr eat eTabl e
B: AlterTabl e
C: Dr opTabl e
D: Remov eTabl e
Q.no40._ ______pr oducest herelationt hathasattri
butesofR1andR2
A: Car t esianpr oduct
B: Diff erence
C: Pr oduct
D: Inter section
Q.no41.I fev erynon- keyat tr
ibuteisf uncti
onallydependentonthe
pri
mar ykey ,
ther elat i
onwi llbei n_______
A: FirstNor mal Form
B: SecondNor mal For m
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no42.Thecol lectionofi nterrel
ateddat aiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst ract i
on
Q.no43.Thet erm_ ______isusedt or efertoarow.
A: At tribute
B: Tupl e
C: Fiel d
D: Inst ance
Q.no44.The_ _ _
_ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: St ruct ure
D: Pr i
mar ykey
Q.no45.I nSQLt hest atementsel ect*from R,Sisequival
entto_
____
__.
A: Sel ect*f r
om Rnat uraljoinS
B: Sel ect*f r
om Rcr ossjoinS
C: Sel ect*f r
om Runi onjoinS
D: Sel ect*f r
om Ri nnerj oinS
Q.no46.Whi chnor malf ormisconsider
edadequat eforr el
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no47.Rel ationalAl gebr ai
s
A: Dat aDef initionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no48.Whi choft hef oll
owi
ngi sNotaRelati
on-algebraOper ati
on
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no49.Funct ionalDependenci esarethetypesofconst r
aint
sthatare
based
on__ ____
A: Key
B: Keyr ev isited
C: Super setkey
D: Tupl e
Q.no50.Theempl oy eesal ar
yshouldnotbegr eaterthanRs.2000.Thisis
_______
A: i
ntegr ityconst raint
B: referent ial const raint
C: over -
def inedconst raint
D: feasibl econst raint
Q.no51.Whi choft hef oll
owi
ngi snotapropertyofat ransacti
on?
A: Atomi city
B: Consi stency
C: I
nt egrity
D: Dur ability
Q.no52.I nt her elationalmodel ,thenumberofat tri
butesandnumberof
tuples
i
riar elationar et ermedas_ _
_______
_and___________
_ _
_ r
espectiv
ely
A: Car dinality ,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinal it
y ,degr ee
Q. no53.Doesi ndext akespacei nthedisk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est or edondi sk
Q. no54.Whi choft hef ollowingoper ati
oni susedifwear ei
nter
estedin
onl y
cer taincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q. no55.Ther esul toft heUNI ONoper ationbetweenR1andR2i sa
relat i
ont hat
i
ncl udes
A: Allthet upl esofR1
B: Allthet upl esofR2
C: Allthet upl esofR1andR2
D: Allthet upl esofR1andR2whi chhav ecommoncol umns
Q. no56.Whi choft hef ollowingi snottrueforNormalizat
ion?
A: Remov esr edundancy
B: Remov esi nser tionanomal y
C: Decomposest her elation
D: Quer yexecut ionbecomesf aster
Q. no57.Amongstt heACI Dpropertiesofat r
ansacti
on,the'Dur
abi
lit
y'
proper ty
requi res.t hatt hechangesmadet othedatabasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, ev eni ft herei saf ail
ureofanyki nd
Q. no58.Consi dert hef ollowing
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar ytabl esi si nBCNF
Whichoft
hef ol
lowingistr
ue?
A:BothS1andS2ar et
rue
B:S1istr
ue
C:S2istr
ue
D:BothS1andS2ar ef
alse
Q.
no59.Ifarelati
onisinBCNF, t
heni
tisal
soi
n
A:1NF
B:2NF
C:3NF
D:5NF
Q.
no60.Af uncti
onaldependencyoft
hefor
m x—>yi
str
ivali
f
A:y⊆x
B:y⊂x
C:x⊂y
D:x⊂yandy ⊂x

Set6

Q.no1.A‘ book’i
sa____
_ _
___typeofentit
y.
A: concept ual
B: concr ete
C: real
D: abstract
Q.no2.Theuser swhouseeasy -
to-
usemenuar ecal
led
A: Sophi sticat
edendusers
B: Naï v
euser s
C: Stand- aloneuser
s
D: Casual enduser
Q.no3.Whi chofthefol
lowingisthestructur
eoftheDat abase?
A: Table
B: .Schema
C: Relation
D: Structur e
Q.no4.Fort hegi
vensetoff unct
ionaldependencyF,
it’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no5.I fBi sanat tr
ibuteandA→B, ThenBi ssaidtobe_ ___
___
_byA.
A: Logi cal l
yi mpl ied
B: Funct i
onal l
yi mpl i
ed
C: Logi cal l
ydet ermi ned
D: Funct i
onal lydet ermined
Q.no6.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ter nar yOper ator
C: Binar yOper at or
D: Notanoper ator
Q.no7.Car tesi anpr oductinr el
ati
onalalgebrais:
A: aUnar yoper ator
B: aBi nar yoper at or
C: aTer nar yoper ator
D: notdef i
ned
Q.no8.I nE- Rdi agr am gener ali
zat
ionisrepresentedby
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no9.Whi choft hef oll
owingshouldbeusedt ofindthemeanoft he
salary?
A: Mean( salar y )
B: Av g(sal ary )
C: Sum( sal ary )
D: Count (sal ary )
Q.no10.Dat aMani pulationLanguage( DML)i snotto_____
_
A: Creat ei nf or mat i
ont ableintheDatabase
B: Inser ti
onofnewi nformat i
onint
ot heDatabase
C: Del etionofi nfor mat i
oni ntheDatabase
D: Modi ficat i
onofi nformat i
onintheDat abase
Q.no11.Toappl yt heaggr egatefuncti
on,toagr oupofsetof
tuples_ ___ ___ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no12.Whent hechangescausedbyanabor tedtransact
ionhavebeen
undone,
thet r
ansact ioni ssai dt obe_ _______
_ .
A: Failed
B: commi tted
C: partiallycommi tted
D: roll
edback.
Q.no13.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -
lef tappr oach
D: Treest ruct ure
Q.no14.Whi choneoft hefollowingisnott r
uef oraview:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav i
rtual table.
C: Av iewdef i
niti
oni sper manent l
ystoredaspar tofthedatabase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no15.I nE- RDi agr am der i
vedat tr
ibutearerepresentedby______
__.
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no16.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no17.I nwhi chst ateonegat hersandl i
stallthenecessaryfi
eldsfort
he
databasedesi gnpr oject .
A: Dat aDef initi
on
B: Dat aRef inement
C: Establ i
shi ngRel ationship
D: Dat adel etion
Q.no18.Hi er archi calmodeli salsocal l
ed_________
.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal izeSt ruct ure
D: Tabl eSt r ucture
Q.no19.Whoi smor econcer nedaboutt heconceptuall
eveloft heDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no20.Thebasi cdat aty pechar (n)isa_ ____lengt
hchar acterst
ri
ngand
varchar (
n)i s_ ____l engt hchar acter
A: Fixed,equal
B: Equal ,variable
C: Fixed,v ariable
D: Var i
able, equal
Q.no21.Adat adi ct i
onar yi sar epositorythatmanages_ __ __
A: Memor y
B: Met adat a
C: Spel l
Checker
D: Dat aVal i
dat or
Q.no22.Theconcept ualmodeli s_________.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwar eandsof tware
D: Independentofbot hhar dwareandsof tware
Q.no23.The_ ____ _connect i
veisusedt otestforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no24.Dat ar edundancymayl eadt o:
A: Dat aintegr i
ty
B: Atomi citypr oblem
C: Dat ainconsi stency
D: Dat aabst raction
Q.no25.Whati sACI Dpr oper ti
esofTr ansacti
ons?
A: Atomi city,Consi stency ,Isolati
on,Dat abase
B: Atomi city,Consi st ency ,Isolati
on,Dur abil
i
ty
C: Atomi city,Consi stency ,Inconsistent,Durabil
ity
D: Aut omat ically
, Concur r ency ,I
solati
on, Durabi
lit
y
Q.no26.Whi chSQLQuer yi suset oremov eat ableandallitsdatafr
om
t
he
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no27.TheRDBMSt erminologyforar owi s_
__ _
____.
A: Tuple.
B: Relati
on.
C: Attri
but e.
D: Degree.
Q.no28.Mi nimalSuper keysar ecalled
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no29.I nt he_ __ _______normalf orm, acomposi teatt
ri
buteisconv
ert
ed
to
i
ndividualat tri
but es.
A: Fi
rst
B: Second
C: Third
D: Fourth
Q.no30.Whi choft hef oll
owingar et heproper
tiesofentit
ies?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no31.NULLi s__ ___
_ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandbl ankforcharacter
D: Notav al ue
Q.no32.Cust omerwi thdrawingmoneyf r
om ATM i sanexampl e
of_________ _
A: Applicat ionpr ogr ammer
B: Naïveuser
C: Specializeduser
D: Sophi sticateduser
Q.no33.Themet hodofaccesswhi chuseskeyt r
ansformationi
sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent i
al
Q.no34.Af i
lemani pulationcommandt hatext ractssomeoft herecords
from a
fil
ei scal l
ed
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no35.I ndomai nrelationalcal
culuswecr eateav ariablef or
ev ery________
A: Row
B: Column
C: Table
D: Attri
bute
Q.no36.Whi choft hef ollowingi
nt r
ueregar dingRef erentialIntegr
ity
?
A: Everyprimar y-
keyv aluemustmat chapr i
mar y-keyv alueinan
associ atedtable
B: Everyprimar y
-keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
tabl e
C: Everyforeign-keyv al
uemustmat chapr i
mar y-keyv aluei nan
associ atedtable
D: Everyforeign-keyv al
uemustmat chaf oreign- keyv alueinanassoci ated
tabl e
Q.no37.Af unctiont hathasnopar tialf
unct ionaldependenci esisin
___ ____form:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no38.At ablejoinedwi thi
tsel
fiscall
edas_ ___ ___
_
A: Join
B: SelfJoin
C: OuterJoin
D: Equi Joi
n
Q.no39.Whi chnamemustbeuni quewi thinadat abase?
A: Tabl e
B: Fi
el d
C: Recor d
D: Char act er
Q.no40.Thenat ural joinisequalto:
A: Car tesi anPr oduct
B: Combi nat ionofUni onandCar tesi
anpr oduct
C: Combi nat ionofsel ecti
onandCar tesianpr oduct
D: Combi nat ionofpr ojecti
onandCar tesianpr oduct
Q.no41.Whi choft hef oll
owingfiel
dshaswi dthof8by t
es?
A: Memo
B: Number
C: Dat e/time
D: Hy per l
ink
Q.no42.Whi choft hef oll
owingisnotal evelofdataabstract
ion?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no43.Whi choft hef oll
owingisanunar yoper at
ion?
A: Select ionoper ation
B: Gener alizedsel ection
C: Primi tiveoper at i
on
D: Project i
onoper ation
Q.no44.whi choft hef oll
owingisnotadat abaseobj ect
?
A: Tabl es
B: Quer ies
C: Relat i
onshi ps
D: Repor ts
Q.no45.Af unct i
onaldependencyi sar elationshipbetweenoramong:
A: Tabl es
B: Rows
C: Relat i
ons
D: Attribut es
Q.no46.Whi choft hef oll
owingenabl esust ov iewdatafrom atabl
e
basedona
specificcr iterion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q. no47.A_ _ ______inat ablerepr esentsar elati
onshipamongasetof
val ues.
A: Column
B: Key
C: Row
D: Entry
Q. no48.Whi choft hef ollowingi snotModi fi
cationoft heDat abase
A: Deletion
B: Inserti
on
C: Sorting
D: Updat ing
Q. no49.I none- t
o-manyr elat
ionshipt hetableon' many' si
deiscall
edas:
A: Parent
B: Mast er
C: Sister
D: Child
Q. no50.Whati sar el ationshi pcal l
edwheni tismai ntainedbetweentwo
ent iti
es?
A: Unar y
B: Binary
C: Ternar y
D: Quat ernar y
Q. no51.At abl eont hemanysi deofaonet omanyormanyt omany
relat i
onshi p
must :
A: Bei nSecondNor mal For m( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngleattribut ekey
D: Hav eacomposi tekey
Q. no52.Af t
ert hef i
nalst at ementofat ransact i
onhasbeenexecut ed,
a
transact i
onent ersina_ __ ____
__st ate.___
____ .
A: Active
B: abor t
ed
C: Commi tt
ed
D: Partiall
ycommi tted
Q. no53.Apr imarykeyi scombi nedwi t
haf oreignkeycr eat
es_____
_
A: Parent -Chi l
drelationshi pbetweent hetablest hatconnectthem
B: Manyt omanyr elati
onshi pbet weent het abl
est hatconnectt hem.
C: Net wor kmodel betweent het ablesthatconnectt hem.
D: Manyt ooner elationshi pbet weent het ablesthatconnectt hem.
Q.no54.I nt he_ _________nor malf orm, acomposi teat t
ribut
ei sconvert
ed
to
i
ndiv i
dualat tr
ibutes
A: Fir
st
B: Second
C: Thir d
D: Four th
Q.no55.The_ _____ ___
pr otocolensur esf r
eedom f rom deadl ock.
A: Two- phasel ockingpr ot ocol
B: Strictt wo- phasel ockingpr otocol
C: Rigor oust wo-phasel ockingpr otocol
D: Timest ampor deringpr otocol
Q.no56.Whi choft hef ollowingi snotapr oper t
yofat ransact i
on?
A: Atomi city
B: Consi stency
C: Integr it
y
D: Dur abi l
ity
Q.no57.Cr eatetabl eempl oy ee( namev archar,i
di nteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q.no58.Dupl icationofdat aatsev eralplacesi sknownas_ ___
A: Concur rentaccessanomal ies
B: Dat ai solation
C: Dat ai nconsi stency
D: Dat ar edundancy
Q.no59._ __ ____al l
owust oident if
yuniquel yat upleint herelati
on.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no60.I fev erynon- keyat t
ributei sfunctionall
ydepedentpr i
mar ykey
,
thent he
r
elat
ionwil
lbei
n___ _
____
___
__.
A:Fi
rstnor
malform
B:Secondnor
mal form
C:Thir
dNormalform
D:Fourt
hnormalform

Set7

Q.no1.Thi skeyt hatuni quelyident

ifieseachrecordiscal
led
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fiel
dName
Q.no2.Aggr egat ef unctionsar efunct i
onsthatt
akea_ ___
_ _
____
_asi
nput
and
ret
urnasi ngl ev al ue.
A: Collectionofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tables
Q.no3.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper ator
C: BinaryOper at or
D: Notanoper ator
Q.no4.Theuser swhouseeasy -
to-usemenuar ecalled
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no5.Asubschemaexpr esses_________
.
A: Thel ogi cal v i
ew
B: Thephy sical v i
ew
C: Theext ernal view
D: Thei nter nal vi
ew
Q.no6.I fBi sanat tr
ibuteandA→B, ThenBi ssaidtobe______
__byA.
A: Logical lyimpl ied
B: Funct i
onal l
yi mpl i
ed
C: Logical lydet ermi ned
D: Funct i
onal lydet ermined
Q.no7.Sel ect*f rom empl oy eeWhatt ypeofstatementi sthis?
A: DML
B: Int
egr i
tyconst r
aint
C: DDL
D: View
Q.no8.Whi choft hef oll
owi ngat t
ri
butecanbef urt
herdiv i
dedinto
subpar t
s
A: Simpl eat tribute
B: Multivaluedat t
ri
bute
C: Composi t eat tr
ibute
D: Derivedat tribute
Q.no9.A‘ book’ i
sa_ ________typeofentit
y.
A: concept ual
B: concret e
C: real
D: abstract
Q.no10.E- Rmodelusest hissy mboltorepr
esentweakent it
yset?
A: Dottedr ect angl e
B: Diamond
C: Doubl yout l
inedr ectangle
D: Dotteddi amond
Q.no11.Al laggr egatef unctionsexcept_____ignorenullvaluesinthei
r
i
nput
coll
ection.
A: Count (attribute)
B: Count (*)
C: Avg
D: Sum
Q.no12.I nanEnt it
y-Relati
onshi pDiagram “
Diamonds”
represent s__ ___ __
___________
A: Attri
but es
B: Multi-
v aluedat tri
butes
C: Weakent it
yset
D: Relationshi pset s
Q.no13.Keyt or epresentr elat
ionshipbetweentablesiscalled
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dateKey
Q.no14.Theov eralldescr i
pti
onofadat abasei scall
ed______.
A: Dat aintegrit
y
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef i
niti
on
Q.no15.Whi choft hef ollowingi st
hest ruct
ureoft heDatabase?
A: Tabl e
B: .Schema
C: Relation
D: Structure
Q.no16.Whi choneoft hefollowinguniquelyidenti
fiestheelementsint
he
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no17.I nSQL‘ r
elat i
onAcont ainsrel
ationB’ canbewr it
tenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no18.Fort hegi vensetoff uncti
onaldependencyF, it
’sclosurei
s
denot edas
A: F+
B: FC
:F*
D: F_
Q.no19.Tor emov ear elati
onf rom anSQLdat abase,weuset he____
__
command.
A: Delete
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no20.4NFi sdesi gnedt ocopewi th:
A: Transi t
ivedependency
B: Joindependency
C: Mul tivalueddependency
D: Funct i
onal dependency
Q.no21.Thedat abaseenv i
ronmenthasal lofthefoll
owingcomponent
s
except ________
A: User s.
B: Separ atefi
les
C: Dat abase.
D: Dat abaseadmi ni
strator
Q.no22.Rel ationalcal culusisa:
A: Procedur allanguage
B: Non- Procedur al l
anguage
C: Dat adefiniti
onl anguage
D: Highl evellanguage
Q.no23.Theconcept ualmodeli s_______
__ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof twar e
D: Independentofbot hhar dwareandsof twar e
Q.no24.Adat adi ctionaryisar epositor
yt hatmanages_ ___
_
A: Memor y
B: Met adata
C: Spel lChecker
D: Dat aValidator
Q.no25.I nE-RDi agram der i
vedat t
ribut
ear erepresentedby__
___
___
.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angle
D: Triangle
Q.no26.Thet erm_ ______isusedt or ef
ert oarow.
A: Attribute
B: Tupl e
C: Field
D: Instance
Q.no27.Thecol lectionofi nter
relateddatai scal
ledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst r
act i
on
Q.no28.The_ _ _
_ __ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: St ruct ure
D: Pr i
mar ykey
Q.no29.Rel ationalAl gebrais
A: Dat aDef initionLanguage
B: Met aLanguage
C: Pr ocedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no30.Theempl oy eesalaryshoul dnotbegr eatert
hanRs.2000.Thisis
______ _
A: i
nt egr i
tyconst raint
B: refer ent ial const raint
C: ov er -definedconst rai
nt
D: feasi bleconst raint
Q.no31._ __ ___ _pr oducest herelationt hathasattri
butesofR1andR2
A: Car t esianpr oduct
B: Diff erence
C: Pr oduct
D: Inter sect ion
Q.no32.I fev er ynon- keyat t
ributeisf uncti
onallydependentonthe
pri
mar ykey ,
ther elat ionwi llbei n_ _____
_
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal For m
Q.no33.I nSQLt hest atementsel ect*from R,Sisequival
entto__
_____
.
A: Sel ect*f rom Rnat uralj
oinS
B: Sel ect*f rom Rcr ossj oi
nS
C: Sel ect*f rom Runi onjoi
nS
D: Sel ect*f rom Ri nnerj oi
nS
Q.no34.Funct ionalDependenci esar et hetypesofconstrai
ntsthatare
based
on__ __ __
A: Key
B: Keyr evisited
C: Super setkey
D: Tupl e
Q.no35.Whi chnor malf ormi sconsi deredadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no36.Whi chofthef ollowingi
sNotaRel at i
on-al
gebraOper ati
on
A: Select
B: Union
C: Rename
D: Dropt able
Q.no37.Whati sar elationshipcall
edwheni ti
smai nt
ainedbet weent
wo
entit
ies?
A: Unary
B: Binary
C: Ternary
D: Quaternary
Q.no38.Mi nimalSuper key sarecall
ed
A: Schemakey s
B: Candidatekey s
C: Domai nkey s
D: Attri
butekeys
Q.no39.I ndomai nr elationalcal
culuswecr eateav ar
iabl
ef or
every________
A: Row
B: Column
C: Table
D: Attri
bute
Q.no40.Whi chofthef ollowingi
snotModi ficati
onoftheDat abase
A: Deleti
on
B: I
nser t
ion
C: Sorti
ng
D: Updating
Q.no41.Af uncti
onaldependencyi sar el
ationshipbetweenoramong:
A: Tables
B: Rows
C: Relati
ons
D: Attri
butes
Q.no42.Whi chofthef ollowingar
et heproperti
esofent i
ti
es?
A: Groups
B: Tabl e
C: Attribut es
D: Swi tchboar ds
Q.no43.Whi choft hefollowingisnotal evelofdataabstracti
on?
A: Phy sical Lev el
B: Critical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no44.Whi chSQLQuer yisuset oremov eatableandallitsdat
afrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no45.Whi choft hefollowingisanunar yoperation?
A: Select ionoper ati
on
B: Gener alizedsel ecti
on
C: Primi tiveoper at i
on
D: Proj ectionoper ati
on
Q.no46.Cust omerwi thdrawingmoneyf rom ATM isanexampl e
of_____ ____ _
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticateduser
Q.no47.Themet hodofaccesswhi chuseskeyt ransf
ormat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no48.A_ ___ __
_ _inat ablerepresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no49.I none- to-manyr el
ationshipthetableon'many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q. no50.Whi choft hef oll
owingenabl esustov i
ewdat afrom at abl
e
basedona
speci ficcr i
terion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q. no51.I far elationisi nBCNF, thenitisal
soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no52.Whi choft hef oll
owingoper ati
onisusedi fwear einter
estedin
onl y
cer taincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q. no53.Amongstt heACI Dproper t
iesofatransaction,the'Durabil
it
y'
proper ty
requi res.thatt hechangesmadet othedatabasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsystem cr
ash
B: Excepti ncaseofadi skcrash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni fthereisaf ail
ureofanykind
Q. no54.Whi char ethet woway sinwhichentit
iescanpar ti
cipateina
relationshi p?
A: Passi veandact i
ve
B: Total andpar ti
al
C: Simpl eandCompl ex
D: simpl eandpar ti
al
Q. no55.I nt her elati
onalmodel ,t
henumberofat t
ributesandnumberof
tuples
i
riar elationar et er medas_ ______
___and_____
____
_ _
___respecti
vely
A: Car dinality,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinality,degr ee
Q.no56.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar yt ablesi sinBCNF
Whi choft hef ollowi ngi strue?
A: Bot hS1andS2ar etrue
B: S1i st r
ue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q.no57.At abl ehasf i
eldsF1, F2, F3,F4,F5withthefoll
owingf unct
ional
dependenci es
Fi—>F3,
F2—>F4
(FI,
F2)—>F5
I
nt ermsofnor mal ization,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no58.I fev erynon- keyat tri
buteisfuncti
onall
ydepedentpr i
mar ykey,
thent he
rel
at i
onwi llbei n_ ____________.
A: Firstnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four thnor mal form
Q.no59.At abl eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal For m( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngl eat tributekey
D: Hav eacomposi tekey
Q.no60.Whi choft hef oll
owi ngisnotapr oper
tyofat r
ansaction?
A:Atomicity
B:
Consi stency
C:I
ntegrit
y
D:Durabil
ity

Set8
Q.no1.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ternar yOper at or
C: Binar yOper at or
D: Notanoper at or
Q.no2.The_ _ __ __ connect iveisusedtot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no3.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bottom- upmet hod
C: Right -
lef tappr oach
D: Treest ructur e
Q.no4.Whent hechangescausedbyanabor t
edtransact
ionhavebeen
undone,
thet r
ansact i
oni ssai dt obe_ _
_______
.
A: Failed
B: commi tted
C: partiall
ycommi tted
D: roll
edback.
Q.no5.Dat aMani pul ationLanguage( DML)i snotto_____
_
A: Creat ei nfor mat iont ableintheDatabase
B: Insertionofnewi nformat i
onintotheDat abase
C: Delet i
onofi nf or mat i
oni ntheDatabase
D: Modi ficat i
onofi nformat i
oni ntheDatabase
Q.no6.Dat ar edundancymayl eadto:
A: Dat aint egrity
B: Atomi ci typr obl em
C: Dat ainconsi stency
D: Dat aabst ract ion
Q.no7.Whi choneoft hefollowingi snott rueforav iew:
A: Viewi sder ivedf r
om ot hertabl es
B: Viewi sav ir
tual table.
C: Av i
ewdef i
niti
oni sper manent lystoredaspar tofthedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no8.I nwhi chst ateonegat hersandl i
stallthenecessar yfi
eldsfort
he
database
designpr oj ect .
A: Dat aDef ini t
ion
B: Dat aRef inement
C: Est abl i
shi ngRel ationship
D: Dat adel etion
Q.no9.Whi choft hef ollowingshoul dbeusedt of i
ndthemeanoft he
salary?
A: Mean( sal ar y)
B: Av g( sal ary )
C: Sum( sal ary )
D: Count (
sal ary)
Q.no10.Toappl yt heaggr egatef uncti
on, toagr oupofsetof
tuples_ _ ___ __ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no11.Thi skeyt hatuni quelyidentifi
eseachr ecordiscalled
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no12.Whatdoy oumeanbyonet omanyr el
ationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no13.I nE- Rdi agr am gener ali
zat i
onisr epresentedby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no14.Theuser swhouseeasy -
to-usemenuar ecal l
ed
A: Sophi st icatedenduser s
B: Naï veuser s
C: Stand- al oneuser s
D: Casual enduser
Q.no15.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no16.Thebasi cdat atypechar (n)isa_ ____lengthcharacterstr
ingand
varchar (n)i s_ __ __lengt hchar acter
A: Fi
xed, equal
B: Equal ,v ariable
C: Fi
xed, v ariable
D: Var i
abl e, equal
Q.no17.Whati sACI Dproper ti
esofTr ansact i
ons?
A: Atomi city,Consi stency,Isolati
on,Dat abase
B: Atomi city,Consi stency,Isolati
on,Dur abi l
it
y
C: Atomi city,Consi stency,Inconsistent, Durabil
ity
D: Aut omat ically,Concur rency ,I
solation, Durabil
it
y
Q.no18.Aggr egat ef uncti
onsar efunct i
onst hatt akea_ _
_______
__as
i
nputand
ret
urnasi ngl ev alue.
A: Col l
ect ionofv alues
B: Si
ngl ev alue
C: Aggr egat ev alue
D: Tabl es
Q.no19.Hi erarchi calmodeli salsocal led_ __
______.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt ruct ure
D: Tabl eSt ructure
Q.no20.Car tesianpr oducti nrelati
onalal gebrais:
A: aUnar yoper ator
B: aBi nar yoper at or
C: aTer nar yoper ator
D: notdef i
ned
Q.no21.Theconcept ualmodeli s_ ________.
A: Dependentonhar dwar e
B: Dependentonsof t war e.
C: Dependentonbot hhar dwar eandsof twar e
D: Independentofbot hhar dwar eandsof t
war e
Q.no22.I nE- RDi agr am der i
vedat tri
butear erepresentedby ___
_____.
A: Elli
pse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no23.I fBi sanat tribut eandA→B, ThenBi ssai dtobe_ ____
___byA.
A: Logical lyimpl ied
B: Funct i
onal l
yi mpl i
ed
C: Logical lydet ermi ned
D: Funct ional l
ydet ermi ned
Q.no24.Adat adi cti
onar yisar eposi t
oryt hatmanages_ _
__ _
A: Memor y
B: Met adat a
C: Spell Checker
D: Dat aVal i
dat or
Q.no25.Whi choft hef oll
owi ngat tri
butecanbef urtherdi
videdinto
subpar ts
A: Simpl eat tribute
B: Mul ti
val uedat t
r i
but e
C: Composi teat tri
but e
D: Der i
vedat tribute
Q.no26.NULLi s_ _____ ____.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f ori ntegerandbl ankf orcharacter
D: Notav alue
Q.no27.Whi chnamemustbeuni quewi thinadatabase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no28.TheRDBMSt ermi nologyf orar owi s__
______.
A: Tupl e.
B: Relat ion.
C: Attribut e.
D: Degr ee.
Q.no29.The_ ____ _
ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no30.Af unct i
ont hathasnopar t i
alf
uncti
onaldependenci
esisin
__
_ ____f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Thet erm_ ____ __i
susedt or ef
ertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no32.Whi choft hef oll
owingf i
eldshaswidthof8by t
es?
A: Memo
B: Number
C: Dat e/ ti
me
D: Hy per li
nk
Q.no33.Thecol l
ect ionofi nterrel
ateddataiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst r action
Q.no34.Theempl oy eesal aryshoul dnotbegreatert
hanRs.2000.Thi
sis
__
_ ____
A: i
nt egr it
yconst raint
B: referent ial const raint
C: over -def i
nedconst raint
D: feasi bleconst rai
nt
Q.no35.Rel at i
onalAl gebr ais
A: Dat aDef init i
onLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: DataMani pul ati
onLanguage
Q.no36.Af ilemani pulationcommandt hatext r
actssomeoft herecords
from a
fil
eiscal l
ed
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no37.whi choft hef oll
owi ngisnotadat abaseobj ect ?
A: Tables
B: Queries
C: Relati
onshi ps
D: Repor t
s
Q.no38._ _ ____ _producest herel
ationt hathasat tr
ibutesofR1andR2
A: Cartesianpr oduct
B: Dif
ference
C: Product
D: Int
ersection
Q.no39.Whi choft hef ollowingint r
uer egar dingRef erent i
alIntegr
ity
?
A: Everypr i
mar y-keyv aluemustmat chapr imar y-keyv alueinan
associatedt abl e
B: Everypr i
mar y-keyv aluemustmat chaf oreign-keyv aluei nanassoci ated
table
C: Everyforei gn-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associatedt abl e
D: Everyforei gn-keyv aluemustmat chaf oreign-keyv alueinanassoci ated
table
Q.no40.Thenat ural j
oi nisequalt o:
A: CartesianPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ectionandCar tesianpr oduct
D: Combi nat i
onofpr ojectionandCar t
esianpr oduct
Q.no41.I nt he_ ______ ___nor malform, acomposi t
eat tributeisconver t
ed
to
i
ndi vi
dualat tributes.
A: Fir
st
B: Second
C: Third
D: Four th
Q.no42.I fev er ynon- keyat t
ri
buteisfunct i
onallydependentont he
pri
mar ykey ,
therel ationwi llbein_ ______
A: FirstNor mal Form
B: SecondNor mal For m
C: Thir dNor mal Form
D: Four thFor mal Form
Q.no43.At ablejoinedwi thit
selfiscal
ledas_ _
______
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no44.A_ ___ __
__i nat ablerepresent
sar elati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no45.Whati sar elati
onshipcal l
edwheni tismaintainedbetweent
wo
entit
ies?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat ernar y
Q.no46.Whi choft hef ollowingisnotal evelofdat aabstract
ion?
A: Phy si cal Lev el
B: Critical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no47.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of_____ __ ___
A: Appl icat ionpr ogrammer
B: Naï veuser
C: Speci ali
zeduser
D: Sophi sticateduser
Q.no48.Af unct i
onaldependencyi sarelationshipbet weenoramong:
A: Tabl es
B: Rows
C: Relations
D: Attri
but es
Q.no49.Whi choft hefollowingisNotaRel ation-algebraOper at
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no50.I ndomai nrel
ationalcalculuswecr eateav ar
iablefor
every____ ____
A: Row
B: Column
C: Table
D: Attri
but e
Q.no51.The_ ________protocolensuresfreedom f rom deadlock.
A: Two- phasel ockingprot ocol
B: Stri
ctt wo-phasel ocki
ngpr ot
ocol
C: Rigoroust wo- phasel ockingpr ot
ocol
D: Timest ampor deri
ngpr otocol
Q.no52.I nthe_ ________
_nor malf orm,acomposi t
eat tri
buteisconver
ted
to
i
ndividualat tributes
A: Fi
rst
B: Second
C: Third
D: Four t
h
Q.no53.Ther esul toftheUNI ONoper ati
onbet weenR1andR2i sa
rel
ationt hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhavecommoncol umns
Q.no54.Af unct i
onaldependencyoft heform x—>yi st r
ivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no55.Whi choft hefollowingisnott r
ueforNor malizati
on?
A: Remov esr edundancy
B: Remov esinsertionanomal y
C: Decomposest her elati
on
D: Quer yexecut i
onbecomesf aster
Q.no56.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eates__
____
A: Par ent -
Childrelationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshipbet weent het ablesthatconnectt hem.
C: Net wor kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elat i
onshipbet weent het ablest hatconnectt hem.
Q.no57.Cr eatetabl eempl oy ee( namev archar,idinteger )Whattypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr i
tyconst r
ai nt
Q.no58.Af terthef inalstatementofat r ansact i
onhasbeenexecut ed,
a
tr
ansact ionent ersina_ ________st at
e._______.
A: Act i
v e
B: abor ted
C: Commi tted
D: Par ti
al l
ycommi tted
Q.no59.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst or esmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no60._ ______allowust oident if
yuniquel yat upleint her el
ati
on.
A: Super key
B: Domai n
C: Attribut e
D: Schema

Set7
Q.no1.Select*f
rom employeeWhattypeofstat
ementi
sthi
s?
A: DML
B: I
ntegr
it
yconstr
aint
C: DDL
D: Vi
ew
Q.no2.InanEnti
ty-Rel
ati
onshi
pDiagr
am “Diamonds”
represent s__ ___ _______ ______
A: Attri
but es
B: Multi-
v aluedat t
ributes
C: Weakent it
yset
D: Relationshi pset s
Q.no3.Theov er alldescr i
pti
onofadat abasei scal
led_____
_.
A: Datai ntegr ity
B: Datamani pul ation
C: Databaseschema
D: Datadef i
ni ti
on
Q.no4.Whi choneoft hefollowinguniquelyidenti
fiestheelement
sinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi t ekey
Q.no5.Rel at i
onalcal cul usisa:
A: Procedur allanguage
B: Non-Pr ocedur allanguage
C: Datadef i
ni ti
onl anguage
D: Highl evel language
Q.no6.Tor emov ear elati
onf rom anSQLdat abase,weuset he__
____
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no7.Cr ossPr oducti sa:
A: UnaryOper at or
B: Ternar yOper at or
C: BinaryOper ator
D: Notanoper at or
Q.no8.Thedat abaseenv ir
onmenthasal lofthefollowingcomponent
s
except__ ____ __
A: Users.
B: Separ atef il
es
C: Database.
D: Databaseadmi nistrator
Q.no9.Asubschemaexpr esses____
___ _
_.
A: Thel ogical vi
ew
B: Thephy si calview
C: Theext ernal view
D: Thei nter nal v
iew
Q.no10.Whi choft hef oll
owi ngisthestructureoftheDatabase?
A: Table
B: .Schema
C: Relation
D: Structur e
Q.no11.E- Rmodelusest hissy mboltorepresentweakent i
tyset?
A: Dot t
edr ectangl e
B: Diamond
C: Doubl yout l
inedr ectangle
D: Dot t
eddi amond
Q.no12.Keyt or epresentr elati
onshi
pbet weent abl
esiscall
ed
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dat eKey
Q.no13.I nSQL‘ rel
at i
onAcont ainsrel
ati
onB’ canbewr it
tenas
A: Notexi st sBexceptA
B: existsBexceptA
C: Notexi st sAexceptB
D: existsAexceptB
Q.no14.The_ __
_ __connect i
v ei
susedt otestforabsenceofset
member shi p.
A: except
B: exists
C: notin
D: in
Q.no15.4NFi sdesi gnedtocopewi th:
A: Transi t
iv edependency
B: Joindependency
C: Mul t
i valueddependency
D: Funct i
onal dependency
Q.no16.Al laggr egat efunctionsexcept_____ignorenullval
uesinthei
r
i
nput
coll
ect i
on.
A: Count (at t
r i
bute)
B: Count (
* )
C: Av g
D: Sum
Q.no17.Fort hegi v ensetoff uncti
onaldependencyF,i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no18.A‘ book’ isa_ _
_______typeofent i
ty.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no19.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no20.Car tesianpr oducti nr el
ati
onalalgebrais:
A: aUnar yoper ator
B: aBi naryoper ator
C: aTer nar yoper at or
D: notdef ined
Q.no21.Thebasi cdat atypechar (n)i
sa_ _
___lengt
hcharacterstr
ingand
varchar (n)i s_ _
_ _
_l engthchar acter
A: Fixed, equal
B: Equal ,var iable
C: Fixed, var iable
D: Var i
abl e, equal
Q.no22.I nwhi chst ateonegat hersandlistallt
henecessar
yf i
eldsfort
he
databasedesi gnpr oject .
A: Dat aDef initi
on
B: Dat aRef inement
C: Establ i
shi ngRel ationship
D: Dat adel etion
Q.no23.Hi er archi calmodeli salsocalled______
___.
A: Treest ruct ure
B: PlexSt r uct ure
C: Nor mal i
zeSt r
ucture
D: Tabl eSt r
ucture
Q.no24.Dat aMani pulationLanguage( DML)i snotto__ __
_ _
A: Creat ei nfor
mat iont ablei nt heDatabase
B: I
nser ti
onofnewi nformat ionintotheDatabase
C: Delet ionofi nfor
mat i
oni nt heDatabase
D: Modi ficati
onofi nformat ionintheDat abase
Q.no25.Theconcept ualmodeli s________
_.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwar eandsof t
ware
D: Independentofbot hhar dwar eandsof t
ware
Q.no26.Themet hodofaccesswhi chuseskeyt ransformat i
oni sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no27.I none- t
o-manyr elationshipthetableon'many '
sidei scall
edas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no28.Whi choft hef ollowi ngenabl esustov i
ewdat af rom at abl
e
basedona
specificcr i
teri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no29.I nSQLt hest at ementsel ect*fr
om R,Sisequiv al
entt o_____
__.
A: Select*f rom Rnat ur al j
oinS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Rinnerj oinS
Q.no30.TheRDBMSt ermi nol ogyforar owis________
.
A: Tupl e.
B: Relat i
on.
C: Attribut e.
D: Degr ee.
Q.no31.Whi chofthef ol
lowi
ngisnotModi fi
cati
onoftheDat abase
A: Deletion
B: I
nser ti
on
C: Sorting
D: Updat ing
Q.no32.Mi nimalSuper keysarecal
led
A: Schemakey s
B: Candi dat ekeys
C: Domai nkey s
D: Attri
but ekey s
Q.no33.Whi chofthef ol
lowi
ngisanunar yoperati
on?
A: Selectionoper ation
B: Gener alizedselection
C: Primitiveoper ati
on
D: Project i
onoper ation
Q.no34.Whi chnormalf ormisconsider
edadequat ef
orrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no35.Whi chnamemustbeuni quewi t
hinadatabase?
A: Table
B: Fiel
d
C: Recor d
D: Char acter
Q.no36.The_ ____
_ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q.no37.Whi chofthef ol
lowi
ngaret heproper
ti
esofenti
ties?
A: Groups
B: Table
C: Attri
but es
D: Swi t
chboar ds
Q.no38.NULLi s_________
_.
A: Thesameas0f ori
nt eger
B: Thesameasbl ankforchar acter
C: Thesameas0f ori
nt egerandblankf orchar act er
D: Notav alue
Q.no39.Whi chSQLQuer yisuset oremov eat abl eandal litsdat afrom
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no40.Funct ionalDependenci esar et
het ypesofconst r
aintst hatare
based
on______
A: Key
B: Keyrev isit
ed
C: Super setkey
D: Tuple
Q.no41.Whi choft hefol l
owingi ntr
ueregar dingRef erentialIntegrit
y?
A: Everypr imar y-
keyvaluemustmat chapr i
mar y
- keyv alueinan
associatedt abl e
B: Everypr imar y-
keyvaluemustmat chaforeign- keyv alueinanassoci ated
table
C: Everyf oreign-keyvaluemustmat chapr imar y-keyv aluei nan
associatedt abl e
D: Everyf oreign-keyvaluemustmat chaf oreign-keyv alueinanassoci at
ed
table
Q.no42.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of__________
A: Applicationpr ogrammer
B: Naïveuser
C: Specializeduser
D: Sophi sti
cat eduser
Q.no43.Af unct i
onthathasnopar tialf
unctionaldependenci esi si
n
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no44.whi choft hef oll
owingi snotadat abaseobj ect?
A: Tabl es
B: Quer ies
C: Relat ionshi ps
D: Repor ts
Q.no45.Whati sar elati
onshipcal l
edwheni tismai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nar y
Q.no46.At abl ejoinedwi thitselfiscal
ledas___ _
_ _
_ _
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Joi n
Q.no47.Thecol lectionofi nt
errelateddataiscalledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no48._ _ _
_ ___pr oducest her el
ationthathasat tr
ibutesofR1andR2
A: Car tesi anpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no49.Thet erm_ ______isusedt orefertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no50.Af ilemani pulati
oncommandt hatextractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no51.I nt her elationalmodel ,thenumberofat t
ributesandnumberof
tupl es
i
riar elationar et er medas_ ________
_ and__ _
_ _
_ _
____
___respectivel
y
A: Car dinal it
y,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinal it
y,degr ee
Q. no52.Whi choft hefol l
owi ngi snotapr opertyofat r
ansact i
on?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur abi l
ity
Q. no53.Amongstt heACI Dpr operti
esofat ransacti
on,the'Durabil
ity
'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no54.Dupl icat ionofdat aatsev eralplacesi sknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisol ation
C: Dat ainconsi stency
D: Dat ar edundancy
Q. no55.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar yt ablesi sinBCNF
Whi choft hef ollowi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i st rue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q. no56.I far elat ionisi nBCNF, theni ti
salsoi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no57.Whi char et het woway sinwhi chentiti
escanpar ti
cipateina
rel
at i
onshi p?
A: Passi veandact i
ve
B: Tot alandpar tial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no58.I feverynon- keyatt
ri
buteisf
unctional
lydepedentpri
mar ykey
,
thent he
rel
at i
onwi l
lbei n__ _____
___
___.
A: Fir
stnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four thnor mal for m
Q.no59._ ______al lowust oident
if
yuniquelyatupl
eint herel
ati
on.
A: Super key
B: Domai n
C: Attribute
D: Schema
Q.no60.Cr eat etabl eemployee(namev ar
char,idi
nteger)Whattypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst raint

Set9
Q.no1.Whi choft hef ol
lowingat tr
ibutecanbef urt
herdi
vi
dedi
nto
subparts
A: Si
mpl eattr
ibute
B: Multi
val
uedat t
ri
bute
C: Composi t
eat tr
ibute
D: Deri
vedat t
ribute
Q.no2.Whati sACI Dproper t
iesofTr ansacti
ons?
A: Atomici
ty,Consi st
ency,Isolat
ion,Database
B: Atomici
ty,Consi st
ency,Isolat
ion,Durabil
i
ty
C: Atomici
ty,Consi st
ency,Inconsistent,
Durabil
i
ty
D: Automaticall
y,Concur r
ency ,I
solati
on,Durabi
li
ty
Q.no3.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A: Sophist
icatedenduser s
B: Naï veuser s
C: Stand- al oneuser s
D: Casual enduser
Q.no4.Whi choft hef oll
owi ngshouldbeusedt of i
ndt
hemeanoft he
salary?
A: Mean( sal ar y)
B: Av g( sal ary )
C: Sum( sal ary )
D: Count (sal ary )
Q.no5.Toappl yt heaggr egatefuncti
on,toagr oupofsetof
tuples_ _ ___ __ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no6.Aggr egat ef unct ionsar efuncti
onst hattakea___
______
__asi
nput
and
returnasi ngl ev alue.
A: Col lect ionofv alues
B: Singl ev alue
C: Aggr egat ev alue
D: Tabl es
Q.no7.I nanEnt ity-Rel ationshipDiagram “Diamonds”
represent s_ ___ ______ ____ ___
_
A: Attribut es
B: Mul ti-val uedat tr
ibut es
C: Weakent ityset
D: Rel at i
onshi pset s
Q.no8.Adat adi ct i
onar yi sareposit
orythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel l Checker
D: Dat aVal idat or
Q.no9.I fBi sanat tributeandA→B, ThenBi ssaidtobe_____
___byA.
A: Logi cal lyi mpl i
ed
B: Funct ional l
yi mpl ied
C: Logi cal lydet er mined
D: Funct ional lydet ermi ned
Q.no10.Sel ect*f rom empl oyeeWhatt ypeofst atementi st hi
s?
A: DML
B: Integrit
yconst raint
C: DDL
D: View
Q.no11.Whoi smor econcer nedaboutt heconcept uallev
eloft heDBMS
A: TheSy stemspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no12.I nE- Rdi agr am gener al
izati
oni srepresent edby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angle
D: Triangle
Q.no13.Theov er alldescripti
onofadat abasei scal led______.
A: Dat aintegr ity
B: Dat amani pul ation
C: Dat abaseschema
D: Dat adef initi
on
Q.no14.Whi choneoft hefollowingisnott rueforav i
ew:
A: Viewi sder ivedf rom othertables
B: Viewi sav ir
tual table.
C: Av iewdef initioni spermanent l
ystoredaspar toft hedatabase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no15.Dat ar edundancymayl eadto:
A: Dat aintegr ity
B: Atomi citypr obl em
C: Dat ainconsi stency
D: Dat aabst r action
Q.no16.Whent hechangescausedbyanabor tedt ransactionhavebeen
undone,
thet r
ansact ioni ssai dtobe_ _______
_ .
A: Failed
B: commi tted
C: par ti
all
ycommi t
ted
D: rolledback.
Q.no17.I nE- RDi agr am der i
vedat tr
ibutearer epresent edby __
_____
_.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no18.Whatdoy oumeanbyonet omanyr el
ationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no19.Thi skeyt hatuni quelyidentifi
eseachrecordiscalled
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fi
el dName
Q.no20.Tor emov ear elati
onf rom anSQLdat abase, weuset he__
____
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no21.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no22.Car tesianpr oducti nr el
at i
onalal
gebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no23.Rel ationalcal culusisa:
A: Procedur allanguage
B: Non- Pr ocedur allanguage
C: Dat adef initi
onl anguage
D: Highl evel language
Q.no24.Al laggr egatef unctionsexcept_ ____i
gnorenul lv
aluesint
heir
i
nput
coll
ect ion.
A: Count (att r
ibute)
B: Count (*)
C: Avg
D: Sum
Q.no25.4NFi sdesi gnedt ocopewi th:
A: Transitivedependency
B: Joindependency
C: Mul t
iv alueddependency
D: Functional dependency
Q.no26.Whi choft hef ollowingfi
eldshaswi dthof8bytes?
A: Memo
B: Number
C: Date/time
D: Hyper l
ink
Q.no27.Mi nimalSuper keysarecalled
A: Schemakey s
B: Candidat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no28.Thenat ural joi
ni sequalto:
A: Cartesi anPr oduct
B: Combi nat i
onofUni onandCar t
esianpr oduct
C: Combi nat i
onofsel ectionandCar tesianpr oduct
D: Combi nat i
onofpr ojectionandCar tesianpr oduct
Q.no29.Whi choft hef ollowingenabl esust ov iewdatafr
om atabl
e
basedona
specificcr iteri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no30.I nSQLt hest atementselect *fr
om R, Sisequival
entto_
____
__.
A: Select*f rom Rnat uraljoi
nS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no31.Whi choft hef ollowingi
sanunar yoper at
ion?
A: Selectionoper ation
B: Gener alizedsel ect i
on
C: Pri
mi tiveoper ati
on
D: Projectionoper at i
on
Q.no32.Whi chnamemustbeuni quewithi
nadat abase?
A: Table
B: Fi
eld
C: Recor d
D: Char acter
Q.no33.Themet hodofaccesswhi chuseskeyt ransformat
ioni
sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent i
al
Q.no34.TheRDBMSt erminologyforarowi s_
_______
.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no35.I ndomai nr elati
onalcalcul
uswecr eateav ari
ablef
or
every___ _____
A: Row
B: Column
C: Table
D: Attri
but e
Q.no36.Rel ati
onalAl gebr ais
A: DataDef i
nit
ionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: DataMani pulationLanguage
Q.no37.Whi choft hef ol
lowingisNotaRel ati
on-al
gebraOperat
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no38.I feverynon- keyat t
ri
buteisfuncti
onall
ydependentonthe
pri
mar ykey ,
therelationwi llbei n__ __
___
A: Fi
rstNor mal Form
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal For m
Q.no39.I none- to-manyr el
ationshipthetableon'many '
sideiscall
edas:
A: Par ent
B: Mast er
C: Sist er
D: Chi ld
Q.no40.Whi choft hef ollowingisnotal evelofdataabstracti
on?
A: Phy si calLev el
B: Critical Level
C: Logi cal Lev el
D: ViewLev el
Q.no41.A_ _____
_ _inat ablerepresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no42.Theempl oy eesal aryshouldnotbegr eatert
hanRs.2000.Thi sis
_______
A: integr it
yconst r
aint
B: refer entialconst raint
C: over -def i
nedconst r
aint
D: feasi bleconst raint
Q.no43.I nt he_ _____ __
__nor malf orm,acomposi teattr
ibuteisconver
ted
to
i
ndi vi
dualat tr
ibutes.
A: First
B: Second
C: Thi rd
D: Four th
Q.no44.Af unct i
onaldependencyi sar el
ationshi
pbet weenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Attr i
but es
Q.no45.Whi chnor malf or misconsi der
edadequat eforrelati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no46.Whi chofthef oll
owingisnotModi f
icat
ionoft heDatabase
A: Deletion
B: I
nser ti
on
C: Sorting
D: Updat ing
Q.no47.At ablej
oinedwi thitsel
fiscall
edas_ ____
_ _
_
A: Join
B: SelfJoi n
C: Out erJoin
D: Equi Join
Q.no48.Whati sar el
ationshipcall
edwheni ti
smai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binary
C: Ternar y
D: Quat ernary
Q.no49.Af il
emani pulati
oncommandt hatextr
actssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no50.The_ ___
__ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q.no51.Whi chofthef oll
owingoper at
ionisusedi fwear einter
estedi
n
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q. no52.At ableont hemanysi deofaonet omanyormanyt omany
relationshi p
must :
A: BeinSecondNor mal For m( 2NF)
B: BeinThi rdNor mal Form( 3NF)
C: Hav easi ngleat tri
butekey
D: Hav eacomposi tekey
Q. no53.At ablehasf i
eldsF1, F2, F3, F4, F5wi ththefollowingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor malization, t
hist ableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no54.Af terthef inalstatementofat ransact i
onhasbeenexecut ed,a
transact ionent ersi na_ _____ ___state.______ _
.
A: Active
B: aborted
C: Commi tted
D: Parti
allycommi tted
Q. no55.The_ _____ ___protocolensur esf r
eedom f r
om deadl ock.
A: Two- phasel ockingpr otocol
B: Stri
ctt wo-phasel ockingpr otocol
C: Rigoroust wo-phasel ockingpr ot
ocol
D: Timest ampor deringpr otocol
Q. no56.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eates_ _
____
A: Parent -
Childrelationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshipbet weent het ablesthatconnectt hem.
C: Networ kmodel betweent het ablesthatconnectt hem.
D: Manyt ooner elat i
onshipbet weent het ablest hatconnectt hem.
Q. no57.I nthe_ ____ __
_ _
_nor malf orm, acomposi t
eattri
butei sconverted
to
i
ndi vidualat tri
butes
A: Fi
rst
B: Second
C: Third
D: Fourth
Q.no58.Doesi ndext akespacei nthedisk?
A: I
ndexesar enev erstoredondisk
B: I
tstoresmemor yasandwhenr equir
ed
C: I
ndexest akenospace
D: Yes,Indexesar est oredondisk
Q.no59.Af unctionaldependencyoft heform x—>yi strivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no60.I nther elati
onalmodel ,t
henumberofat tr
ibutesandnumberof
t
upl es
i
riar el
ationaret ermedas_ __
_______
and_ _
_____
_______respecti
vel
y
A: Cardinal
ity
,domai n
B: Degree,cardinalit
y
C: Domai ndegree
D: Cardinal
ity
,degr ee

Set10
Q.no1.A‘ book’ isa_ __
______
typeofentit
y.
A: concept ual
B: concr et
e
C: real
D: abstract
Q.no2.Aggr egat efunctionsarefuncti
onst hatt
akea____
_______asi
nput
and
ret
ur nasi nglev alue.
A: Collecti
onofv alues
B: Singlev al
ue
C: Aggr egatev alue
D: Tables
Q.no3.E- Rmodelusest hi
ssy mboltorepresentweakent
ityset?
A: Dot t
edr ectangle
B: Diamond
C: Doubl youtlinedr ect
angle
D: Dot t
eddi amond
Q.no4.Fort hegi vensetoff unct
ionaldependencyF,i
t’
scl
osureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no5.Keyt orepresentr elat
ionshipbetweent ablesiscall
ed
A: Primar ykey
B: Secondar yKey
C: Forei gnKey
D: Candi dateKey
Q.no6.Thedat abaseenv ir
onmenthasal lofthefollowi
ngcomponent
s
except __ ______
A: User s.
B: Separ atef i
l
es
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no7.Hi erarchi
calmodeli salsocalled_________
.
A: Treest ructure
B: PlexSt ructure
C: Nor mal i
zeSt r
uct ure
D: Tabl eSt r
ucture
Q.no8.Theconcept ualmodeli s________
_ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof t
war e
D: Independentofbot hhar dwar eandsof tware
Q.no9.I nanEnt it
y -
Rel ationshipDiagram “Diamonds”
represent s____________ _
_ ____
A: Attribut es
B: Mul ti-
v aluedattri
but es
C: Weakent i
tyset
D: Relat ionshipset s
Q.no10.Whi choft hef ollowingi st
hest ructur
eoft heDatabase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no11.I nSQL‘ relationAcont ainsrelat
ionB’ canbewr i
ttenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no12.Thebasi cdat at y pechar (n)isa_ _
_ __l
engthcharacterstr
ingand
varchar(n)i s_ _ ___l engt hchar act er
A: Fixed, equal
B: Equal, var iabl e
C: Fixed, var i
abl e
D: Variabl e,equal
Q.no13.I nwhi chst ateonegat her sandl i
stallthenecessaryfi
eldsfort
he
databasedesi gnpr oject.
A: DataDef i
ni tion
B: DataRef i
nement
C: Establishi ngRel at i
onshi p
D: Datadel et ion
Q.no14.Theuser swhouseeasy -to-usemenuar ecall
ed
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no15.Dat aMani pulationLanguage( DML)i snotto______
A: Createi nfor mat iont ablei ntheDat abase
B: I
nser ti
onofnewi nformat i
oni nt otheDat abase
C: Deletionofi nf ormat i
oni ntheDat abase
D: Modi ficat ionofi nformat i
oni nt heDat abase
Q.no16.Whi choft hef oll
owi ngat t
ri
but ecanbef urt
herdivi
dedinto
subpar ts
A: Simpl eat tribut e
B: Mul t
ival uedat tri
but e
C: Composi teat tribut e
D: Derivedat tribut e
Q.no17.Whati sACI Dproper t
iesofTr ansact i
ons?
A: Atomi ci ty,Consi stency ,Isolation, Database
B: Atomi ci ty,Consi stency ,Isolation,Dur abil
ity
C: Atomi ci ty,Consi stency ,Inconsi stent ,
Dur abil
it
y
D: Automat i
cal l
y ,Concur rency ,Isolation,Dur abi
li
ty
Q.no18.Asubschemaexpr esses_ ___ _
____.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal vi
ew
D: Thei nt
er nal vi
ew
Q.no19.Toappl ytheaggr egatef unct
ion,toagr oupofsetof
tuples_ ______ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no20.Whi choneoft hef oll
owi nguniquelyi
dentif
iest
heel ement
sinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: For eignkey
D: Composi tekey
Q.no21.Whi choft hefollowingshoul dbeusedt ofi
ndthemeanoft he
salary?
A: Mean( salar y )
B: Av g(salary )
C: Sum( salary )
D: Count (
sal ary )
Q.no22.The_ _ _
_ __
connect iveisusedt otestforabsenceofset
member ship.
A: except
B: exist s
C: noti n
D: in
Q.no23.Cr ossPr oductisa:
A: Unar yOper ator
B: Ter naryOper ator
C: Binar yOper at or
D: Notanoper ator
Q.no24.Al laggr egatefunct i
onsexcept_ __
__ignorenul
lvaluesint
hei
r
i
nput
collection.
A: Count (
attribut e)
B: Count (
*)
C: Av g
D: Sum
Q.no25.Car tesi anpr oducti nrelati
onalalgebr
ai s:
A: aUnar yoper at or
B: aBi naryoper ator
C: aTer naryoper at
or
D: notdef i
ned
Q.no26.Thet er m_ _
__ ___i
susedt or ef
ertoar ow.
A: Attribute
B: Tupl e
C: Field
D: Instance
Q.no27.Whi choft hef oll
owingaret heproper ti
esofent it
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no28.Whi chSQLQuer yisusetor emov eat ableandal litsdataf
rom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no29.Whi choft hef oll
owingintrueregar dingRef erentialInt
egri
ty?
A: Ever ypr i
mar y-keyv aluemustmat chapr imar y-keyv alueinan
associ atedt abl e
B: Ever ypr i
mar y-keyv aluemustmat chaf oreign-keyv aluei nanassociat
ed
table
C: Ever yforei gn- keyvaluemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ev eryforei gn- keyvaluemustmat chaf oreign-keyv alueinanassociated
table
Q.no30._ _____ _pr oducest herel
ati
ont hathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersection
Q.no31.Thecol lecti
onofi nter
rel
ateddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dataabst racti
on
Q.no32.Af unct i
ont hathasnopar t i
alf
unctionaldependenciesisin
______
_f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.Funct ionalDependenci esar et
het ypesofconst r
aint
sthatare
based
on______
A: Key
B: Keyrev i
sited
C: Super setkey
D: Tuple
Q.no34.NULLi s__________.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandblankf orcharacter
D: Notav alue
Q.no35.Cust omerwi t
hdr awi
ngmoneyf rom ATM i sanexampl e
of____
__ __ _
_
A: Applicationpr ogrammer
B: Naïveuser
C: Special i
zeduser
D: Sophi sti
cat eduser
Q.no36.whi choft hef ol
lowingisnotadat abaseobj ect
?
A: Tables
B: Queries
C: Rel
at i
onshi ps
D: Repor ts
Q.no37.Af i
lemani pulati
oncommandt hatextractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no38.Whi choft hef oll
owingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per l
ink
Q.no39.At ablejoinedwi thitselfiscall
edas_ __
_____
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no40.I nSQLt hest atementsel ect*fr
om R,Sisequivalentto____
___.
A: Select*f rom Rnat ural j
oinS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no41.Whi choft hef ollowingi sanunar yoperati
on?
A: Select ionoper ation
B: Gener ali
zedsel ect i
on
C: Primi tiveoperat i
on
D: Proj ectionoper ation
Q.no42.I none- t
o-manyr elat
ionshi pthetableon'many '
sidei scal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no43.I nthe_ _____ __
_ _nor malf orm,acomposi t
eat tr
ibuteisconvert
ed
t
o
i
ndi vi
dualat tri
butes.
A: First
B: Second
C: Third
D: Four th
Q.no44.A_ _______inat abler epresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no45.Rel ati
onalAl gebr ais
A: Dat aDef i
nit
ionLanguage
B: Met aLanguage
C: Pr ocedur al queryLanguage
D: Dat aMani pul ati
onLanguage
Q.no46.Whi choft hef oll
owingisNotaRel ati
on-algebraOper ati
on
A: Sel ect
B: Uni on
C: Rename
D: Dr opt able
Q.no47.I fev er ynon-keyat t
ri
buteisf
unctionall
ydependentont he
pri
mar ykey ,
ther elat i
onwi llbei n_
__ __
__
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no48.Whi choft hef oll
owingisnotalevelofdat aabst ract
ion?
A: Phy sical Lev el
B: Cr i
tical Level
C: Logi cal Lev el
D: ViewLev el
Q.no49.TheRDBMSt erminologyf
orar owi s_
______ _
.
A: Tupl e.
B: Rel at i
on.
C: At tri
but e.
D: Degr ee.
Q.no50.Whati sar el
ationshi
pcall
edwheni ti
smai ntai
nedbet weent
wo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no51.Whi choft hef oll
owingisnotaproper t
yofat ransacti
on?
A: At omi city
B: Consi st ency
C: Integr ity
D: Dur abi lity
Q.no52.Whi choft hef oll
owingisnottr
uef orNor malizati
on?
A: Remov esr edundancy
B: Remov esinser ti
onanomal y
C: Decomposest herelati
on
D: Quer yexecut i
onbecomesf aster
Q. no53.Cr eatet abl eempl oyee( namev archar,idint
eger)Whatt y
peof
stat ement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q. no54.Dupl icat ionofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat ai solation
C: Dat ai nconsi stency
D: Dat ar edundancy
Q. no55.Whi char et het woway sinwhichent it
iescanparti
cipateina
relat i
onshi p?
A: Passi v eandact i
ve
B: Tot al andpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar t i
al
Q. no56.Ther esul toftheUNI ONoper ationbet weenR1andR2i sa
relat i
ont hat
i
ncl udes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q. no57.Amongstt heACI Dproperti
esofat ransacti
on,t
he'Durabili
ty'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcrash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no58.Consi dert hef oll
owing
S1:For eignkeyal lowsnul lvalues.
S2:Ev er ybi nar yt ablesi si
nBCNF
Whi choft hef ol lowi ngist r
ue?
A: Bot hS1andS2ar etrue
B: S1i strue
C: S2i st r
ue
D: Bot hS1andS2ar efalse
Q.no59.I far elat ioni si nBCNF, thenitisal soin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no60.I fever ynon- keyat t
ributei sfuncti
onal lydepedentpri
marykey,
thent he
rel
ationwi l
lbei n_ __ __________.
A: Fi
rstnor mal for m
B: Secondnor mal form
C: ThirdNor mal for m
D: Four thnor mal f or m
Q.no1.I nE-Rdi agr am gener alizati
oni srepr esentedby
A: El
lipse
B: Dashedel l
ipse
C: Rect angle
D: Triangle
Q.no2.Dat ar edundancymayl eadt o:
A: Dat aintegrity
B: Atomi citypr obl em
C: Dat ainconsi stency
D: Dat aabst ract ion
Q.no3.Adat adi ct ionar yisar epositorythatmanages_ ____
A: Memor y
B: Met adata
C: Spel lChecker
D: Dat aVal i
dat or
Q.no4.E- Rmodelusest hi
ssy mbolt or epresentweakent it
yset?
A: Dot t
edr ect angl e
B: Diamond
C: Doubl yout linedr ectangle
D: Dot t
eddi amond
Q.no5.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt able?
A:Onecl assmayhav emanyt eachers
B:Onet eachercanhav emanycl asses
C:Onet eachercanhav eonecl ass
D:Manyt eacher smayhav emanycl asses
Q.
no6.Whoi smor econcer nedaboutt heconcept
ualleveloftheDBMS
A:TheSy st emspr ogr ammer
B:Theenduser
C:Client
D:DBA
Q.
no7.Rel at i
onalcal culusisa:
A:Procedur allanguage
B:Non- Pr ocedur al language
C:Dat adef i
ni ti
onl anguage
D:Highl ev el language
Q.
no8.Theov er alldescr i
pti
onofadat abasei
scall
ed______.
A:Dat aint egr it
y
B:Dat amani pulat ion
C:Dat abaseschema
D:Dat adef i
ni ti
on
Q.
no9.Thi skeyt hatuni quelyi
dentif
ieseachrecordiscall
ed
A:Primar yKey
B:KeyRecor d
C:Uni queKey
D:FieldName
Q.
no10.I fBi sanat tr
ibuteandA→B, ThenBissaidtobe_ _____
__byA.
A:Logi callyi mpl ied
B:Funct ional lyimpl ied
C:Logi callydet ermi ned
D:Funct ional lydet ermi ned
Q.
no11.Sel ect*f rom empl oyeeWhatt y
peofstat
ementi sthi
s?
A:DML
B:I
nt egrityconst raint
C:DDL
D:View
Q.
no12.4NFi sdesi gnedt ocopewi th:
A:Transi tivedependency
B:Joindependency
C:Mul tival ueddependency
D:Funct ional dependency
Q.no13.I nE- RDi agr am der i
vedat tr
ibutearerepresentedby_____
___.
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no14.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -leftappr oach
D: Treest ructure
Q.no15.Whent hechangescausedbyanabor tedt r
ansacti
onhav ebeen
undone,
thet r
ansact i
onissai dt obe_ _______
_ .
A: Failed
B: commi tted
C: part i
al l
ycommi tted
D: roll
edback.
Q.no16.Whi choneoft hefollowingisnott r
uef orav i
ew:
A: Viewi sder iv
edf rom ot hertables
B: Viewi sav i
rt
ual table.
C: Av iewdef i
nit
ioni sper manent l
ystoredaspar tofthedatabase.
D: Viewnev ercont ai nsder i
vedcol umns.
Q.no17.Aggr egat ef unct i
onsar efunctionsthattakea_ __
_______
_as
i
nputand
ret
ur nasi ngl evalue.
A: Col l
ect ionofv al ues
B: Singl ev al ue
C: Aggr egat evalue
D: Tabl es
Q.no18.Tor emov ear elati
onf r
om anSQLdat abase,weuset he____
__
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no19.A‘ book’ isa_ __ _
_____typeofent i
ty.
A: concept ual
B: concr ete
C: real
D: abstract
Q.no20.Toappl ytheaggr egatef unct i
on,toagr oupofsetof
tuples___ ___ _clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q.no21.Asubschemaexpr esses_ ________.
A: Thel ogical v i
ew
B: Thephy si cal view
C: Theext er nal view
D: Thei nter nal vi
ew
Q.no22.Whati sACI Dproper t
iesofTr ansact i
ons?
A: Atomi city ,Consi stency,Isol
ation,Dat abase
B: Atomi city ,Consi stency,Isol
ation,Dur abil
ity
C: Atomi city ,Consi stency,Inconsistent,Dur abil
it
y
D: Automat ical ly,Concurrency,Isolation,Dur abi
li
ty
Q.no23.I nwhi chst ateonegat her sandl istallthenecessaryf
iel
dsfort
he
databasedesi gnpr oject.
A: DataDef ini ti
on
B: DataRef inement
C: Establishi ngRel ati
onship
D: Datadel et i
on
Q.no24.Cr ossPr oductisa:
A: Unar yOper ator
B: Ternar yOper ator
C: BinaryOper at or
D: Notanoper ator
Q.no25.Theuser swhouseeasy -to-usemenuar ecall
ed
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no26.Whi choft hef ol
lowingenabl esust oviewdatafrom atabl
e
basedona
specificcr i
t erion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no27.Whi choft hef oll
owingarethepropertiesofent i
ties?
A: Groups
B: Tabl e
C: Attribut es
D: Swi tchboar ds
Q.no28.Theempl oy eesalaryshouldnotbegr eaterthanRs.2000.Thi si
s
_______
A: i
nt egr i
tyconst rai
nt
B: referent ialconstraint
C: over -def i
nedconst r
aint
D: feasi bleconst rai
nt
Q.no29.I ndomai nrelati
onalcalcul
uswecr eateav ar
iablef or
every_ ___ ____
A: Row
B: Col umn
C: Tabl e
D: Attribut e
Q.no30.Whi choft hef oll
owingisnotModificationoft heDat abase
A: Del etion
B: I
nser ti
on
C: Sor ti
ng
D: Updat ing
Q.no31.Thet erm_ _ _____i
susedt oref
ertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no32.Whi chnor malf ormisconsideredadequat eforr elati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.Themet hodofaccesswhi chuseskeyt ransformat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no34._ ___ ___pr oducest herelati
ont hathasat tri
butesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Product
D: Inter sect ion
Q.no35.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no36.The_ __
_ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ure
D: Primar ykey
Q.no37.Whi choft hef oll
owingint rueregar dingRef erentialInt
egri
ty?
A: Ev erypr imar y-
keyv aluemustmat chapr imar y-keyv alueinan
associ at edt able
B: Ever ypr imar y
-keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
table
C: Ev eryf orei gn-keyv al
uemustmat chapr i
mar y
-keyv aluei nan
associ at edt able
D: Ev eryf orei gn-keyv al
uemustmat chaf oreign-keyv alueinanassociated
table
Q.no38.Mi nimalSuper keysar ecalled
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Att ri
but ekey s
Q.no39.Af unct ionaldependencyi sar el
ationshi pbet weenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Att ri
but es
Q.no40.Whi chSQLQuer yisuset or emov eat ableandal litsdataf
rom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no41.Thenat ural j
oi nisequalt o:
A: Car tesi anPr oduct
B: Combi nat i
onofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ectionandCar t
esianpr oduct
D: Combi nat i
onofpr ojectionandCar t
esianpr oduct
Q.no42.I fev erynon- keyat tr
ibut
eisf unctionall
ydependentont he
pri
mar ykey ,
therel ationwi llbei n_ ______
A: Fi
r stNor mal Form
B: SecondNor mal For m
C: Thir dNor mal Form
D: Four thFor mal For m
Q.no43.Cust omerwi thdrawi ngmoneyf r
om ATM i sanexample
of_____ ___ __
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci al izeduser
D: Sophi sticateduser
Q.no44.I none- to-manyr elat
ionshipthet ableon' many'si
deiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no45.I nt he_ _ ______ __nor malform, acomposi t
eat t
ri
butei
sconv er
ted
to
i
ndividualat tri
but es.
A: Fi
r st
B: Second
C: Thir d
D: Four th
Q.no46.Whi choft hef ollowingisNotaRel ati
on-algebr
aOperati
on
A: Select
B: Uni on
C: Rename
D: Dropt abl e
Q.no47.Whi choft hef oll
owingi snotal evelofdataabst r
acti
on?
A: Phy sical Lev el
B: Crit
ical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no48.Rel ationalAl gebr ais
A: DataDef i
nitionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: DataMani pul ationLanguage
Q.no49.TheRDBMSt erminologyf orar owis_______
_.
A: Tupl e.
B: Relat ion.
C: Attri
but e.
D: Degr ee.
Q.no50.At ablej oinedwi thitselfiscalledas_ ___
____
A: Join
B: SelfJoi n
C: OuterJoi n
D: Equi Joi n
Q.no51.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst or esmemor yasandwhenr equired
C: Indexest akenospace
D: Yes, Indexesar est or edondi sk
Q.no52.Af tert hef inalst atementofat ransacti
onhasbeenexecut ed,
a
t
ransact ionent ersi na_ ________state._______.
A: Activ e
B: abor ted
C: Commi tted
D: Partial lycommi tted
Q.no53.I nt her elationalmodel ,thenumberofat t
ri
butesandnumberof
t
upl es
i
riar elat ionar et ermedas_ _
_ _
__ ____and_ ___
_________
_respect
ivel
y
A: Cardi nal ity,domai n
B: Degr ee, cardi nality
C: Domai ndegr ee
D: Cardi nal ity,degr ee
Q.no54.Af uncti
onaldependencyoft hef orm x—>yi strivalif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no55.Apr imarykeyi scombi nedwi t
haf oreignkeycr eates______
A: Parent-
Chi l
drel
ationshipbet weent hetablest hatconnectt hem
B: Manyt omanyr elati
onshi pbet weent hetablesthatconnectt hem.
C: Networkmodel betweent het ablesthatconnectt hem.
D: Manyt ooner el
ationshipbet weent hetablest hatconnectt hem.
Q.no56._ ______all
owust oident if
yuniquelyat upleint her elat
ion.
A: Superkey
B: Domai n
C: Attr
ibut
e
D: Schema
Q.no57.Whi chofthef oll
owi ngoper ati
oni susedi fwear einterestedin
only
certai
ncolumnsofat able?
A: PROJECTI ON
B: SELECTION
C: UNION
D: JOIN
Q.no58.At ablehasf i
eldsF1, F2, F3, F4,F5wi ththef ollowingf uncti
onal
dependencies
Fi—>F3,
F2—>F4
(FI
,F2)—>F5
Intermsofnor mali
zation,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no59.At ableonthemanysi deofaonet omanyormanyt omany
rel
ationship
must :
A: BeinSecondNor mal Form( 2NF)
B: BeinThirdNor mal Form( 3NF)
C: Haveasi ngleattr
ibutekey
D: Haveacomposi tekey
Q.no60.I nt he_ __ _
_ _____normalfor m,acomposi teattri
buteisconv
erted
to
i
ndi vi
dualat tri
but es
A: First
B: Second
C: Thi rd
D: Four th
Q.no1.I nanEnt ity-Relationshi
pDi agram “Diamonds”
represent s_ _ __________ _
_ ___
_
A: Attributes
B: Mul ti-
val uedat tr
ibutes
C: Weakent ityset
D: Rel ati
onshi pset s
Q.no2.Hi er ar chicalmodeli salsocalled_______
__.
A: Treest ruct ure
B: PlexSt r uct ure
C: Nor mal izeSt r
uct ure
D: Tabl eSt r ucture
Q.no3.Whi choft hef oll
owi ngshouldbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary)
B: Av g(salar y )
C: Sum( sal ary)
D: Count (
sal ary)
Q.no4.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponent s
except _ _
__ _ ___
A: User s.
B: Separ at ef il
es
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no5.Thebasi cdat atypechar (
n)isa_ _ __
_lengthcharacterst
ri
ngand
varchar (n)i s_ ____l engthchar act
er
A: Fixed, equal
B: Equal ,var iable
C: Fixed, var iable
D: Var iable, equal
Q.no6.Whi choft hef oll
owi ngisthest r
uctureoftheDat abase?
A: Tabl e
B: .Schema
C: Relation
D: Structur e
Q.no7.Whi choneoft hef ol
lowi nguni quelyidenti
fi
estheelementsint
he
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no8.Dat aMani pulationLanguage( DML)i snotto_____
_
A: Createi nformat i
ont ableintheDat abase
B: Inserti
onofnewi nformat i
oni ntot heDat abase
C: Deletionofi nfor mat i
oni ntheDat abase
D: Modi ficat i
onofi nformat i
oni nt heDat abase
Q.no9.The_ _ _
_ _
_ connect iveisusedt ot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no10.Al laggr egat ef uncti
onsexcept_ ____ignorenul
lvaluesi
nthei
r
i
nput
coll
ect i
on.
A: Count (at tri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no11.Fort hegi vensetoff unct ionaldependencyF, i
t’
sclosurei
s
denot edas
A: F+
B: FC
:F*
D: F_
Q.no12.Dat aredundancymayl eadt o:
A: Dat aint egrity
B: Atomi ci typrobl em
C: Dat ainconsi stency
D: Dat aabst racti
on
Q.no13.I nSQL‘ relati
onAcont ainsr el
ationB’ canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no14.Whi choft hef oll
owi ngat t
ri
butecanbef ur
therdi
videdint
o
subpar t
s
A: Simpl eat tri
but e
B: Mul ti
v aluedat tri
but e
C: Composi teat tribut e
D: Der ivedat t
r i
but e
Q.no15.Theconcept ualmodeli s______
___.
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof tware
D: Independentofbot hhar dwar eandsof tware
Q.no16.I nE- Rdi agr am gener alizati
onisrepresentedby
A: Ell
ipse
B: Dashedel lipse
C: Rect angl e
D: Triangl e
Q.no17.Adat adi ctionar yisar epositor
ythatmanages_ _
__ _
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal i
dat or
Q.no18.Car tesianpr oductinr elati
onalalgebrais:
A: aUnar yoper at or
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no19.Keyt or epr esentr elati
onshi pbetweent abl
esiscalled
A: Primar ykey
B: Secondar yKey
C: For ei
gnKey
D: Candi dateKey
Q.no20.Asubschemaexpr esses_ _____
___.
A: Thel ogi cal view
B: Thephy sical view
C: Theext ernal view
D: Thei nt ernal view
Q.no21.Whati sACI Dpr oper tiesofTr ansact ions?
A: Atomi city, Consi stency ,Isolation,Dat abase
B: Atomi city, Consist ency ,I
sol ation,Dur abil
i
ty
C: Atomi city, Consi stency ,Inconsi stent
, Durabi l
it
y
D: Aut omat ically,Concur rency ,Isolati
on, Durabi l
i
ty
Q.no22.Rel ationalcal culusi sa:
A: Procedur al l
anguage
B: Non- Procedur allanguage
C: Dat adef initi
onl anguage
D: Highl evel language
Q.no23.Whoi smor econcer nedaboutt heconcept uall
eveloft heDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no24.Aggr egatef unctionsar ef unctionst hattakea_ _
_ _
_ _
_ _
___as
i
nputand
ret
ur nasi ngl ev alue.
A: Col l
ectionofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tabl es
Q.no25.Whi choneoft hef ollowingi snott ruef oraview:
A: Viewi sder ivedf rom ot hert ables
B: Viewi sav i
rtualt able.
C: Av iewdef initi
oni sper manent lystoredaspar tofthedatabase.
D: Viewnev ercont ai nsder ivedcol umns.
Q.no26.Theempl oy eesal aryshoul dnotbegr eatert
hanRs.2000.Thi si
s
_______
A: i
nt egri
tyconst raint
B: referential const raint
C: over -
def i
nedconst r
aint
D: feasibleconst raint
Q.no27.Funct i
onalDependenci esar ethet ypesofconst raintsthatar
e
based
on__ ____
A: Key
B: Keyr evisited
C: Super setkey
D: Tuple
Q.no28.Whi chofthef oll
owingfieldshaswi dthof8by t
es?
A: Memo
B: Number
C: Date/time
D: Hyper l
ink
Q.no29.Whi chofthef oll
owingenabl esust oviewdat afrom at
abl
e
basedona
specificcr i
t eri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no30.Whi chofthef oll
owingisanunar yoperation?
A: Selectionoper ation
B: Gener alizedselection
C: Pri
mi tiveoper ati
on
D: Projectionoper ation
Q.no31.NULLi s__________
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharact
er
C: Thesameas0f orintegerandbl ankforcharacter
D: Notav al ue
Q.no32.Af uncti
ont hathasnopar ti
alf
unct i
onaldependenciesisi
n
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.whi chofthef ol
lowingisnotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relati
onshi ps
D: Repor ts
Q.no34.Whi chofthef oll
owingar etheproper t
iesofent i
ti
es?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no35.A_ ___
____inat abler epresentsar elati
onshi
pamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no36.I nSQLt hestatementsel ect*fr
om R, Sisequi
v alentto_ ___
___.
A: Select*fr
om Rnat ural j
oinS
B: Select*fr
om Rcr ossjoinS
C: Select*fr
om Runi onjoinS
D: Select*fr
om Ri nnerjoinS
Q.no37.Thecol l
ecti
onofi nter r
elateddatai scall
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabstracti
on
Q.no38.Whati sarelat
ionshi pcal l
edwheni tismaintainedbet weentwo
entit
ies?
A: Unar y
B: Binary
C: Ternary
D: Quat er
nary
Q.no39.Af i
lemanipulationcommandt hatextract
ssomeoft herecor
ds
fr
om a
fi
leiscal l
ed
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no40.I none-to-
manyr elat
ionshipt hetableon' many 'sideiscalledas:
A: Parent
B: Mast er
C: Sister
D: Child
Q.no41.Whi chnor malfor mi sconsi deredadequat ef
orr elat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no42.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no43.At ablej oinedwi thit
selfi
scall
edas_ __
_ ____
A: Joi n
B: Sel fJoin
C: Out erJoi n
D: Equi Join
Q.no44._ ___ ___producest herel
ati
onthathasat tr
ibut esofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no45.Themet hodofaccesswhi chuseskeyt ransf ormat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no46.Rel at i
onalAl gebr ais
A: Dat aDef i
ni t
ionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pulati
onLanguage
Q.no47.Whi choft hef oll
owingintrueregardingRef erent i
alInt
egri
ty?
A: Ev erypr imar y-keyv aluemustmat chapr i
mar y-keyv alueinan
associ atedt abl e
B: Ever ypr imar y-keyv aluemustmat chaf orei
gn-keyv aluei nanassociat
ed
table
C: Ev eryfor eign-keyv aluemustmat chapr i
mar y
-keyv al ueinan
associ atedt abl e
D: Ev eryfor eign-keyv aluemustmat chaforeign-keyv alueinanassociated
table
Q.no48.Thenat ural j
oinisequalto:
A: Car tesianPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nationofsel ectionandCar t
esi anpr oduct
D: Combi nationofpr ojectionandCar tesianpr oduct
Q.no49.TheRDBMSt ermi nologyf orar owi s_____
_ _
_.
A: Tupl e.
B: Relat i
on.
C: Attribut e.
D: Degr ee.
Q.no50.Whi chSQLQuer yi suset oremov eat ableandallitsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no51.Whi char ethet woway sinwhi chent i
tiescanpar t
ici
pateina
rel
ationshi p?
A: Passi v eandact i
ve
B: Tot al andpar t
ial
C: Si
mpl eandCompl ex
D: si
mpl eandpar t
ial
Q.no52.Whi choft hef ollowingi snott ruef orNor malizat
ion?
A: Remov esr edundancy
B: Remov esi nser t
ionanomal y
C: Decomposest her elation
D: Quer yexecut i
onbecomesf ast
er
Q.no53.Ther esultoft heUNI ONoper ationbet weenR1andR2i sa
rel
ationt hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q.no54.The_ ________ protocolensur esf reedom f rom deadlock.
A: Two- phasel ockingpr ot ocol
B: Strictt wo- phasel ockingpr otocol
C: Rigor oust wo-phasel ockingpr ot ocol
D: Ti
mest ampor deri
ngpr otocol
Q.no55.Cr eatetabl eempl oyee( namev ar char,idint
eger)Whatt ypeof
stat ement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst raint
Q. no56.Whi choft hefol l
owi ngisnotapr opertyofat ransact
ion?
A: Atomi city
B: Consi stency
C: Integrit
y
D: Dur abil
ity
Q. no57.Dupl icat ionofdat aatsev eralplacesi sknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisolation
C: Dat ainconsi stency
D: Dat aredundancy
Q. no58.I far elat ionisi nBCNF, thenitisalsoi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no59.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar yt ablesi sinBCNF
Whi choft hef ol lowi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i strue
C: S2i strue
D: Bot hS1andS2ar efalse
Q. no60.Amongstt heACI Dpr operti
esofat ransacti
on, t
he'Durabi
li
ty'
proper ty
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no1.Whent hechangescausedbyanabor tedtransacti
onhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ ____
_ _
_ _.
A: Failed
B: commi t
ted
C: par ti
all
ycommi t
ted
D: rolledback.
Q.no2.Sel ect*f rom empl oy eeWhatt ypeofstatementisthi
s?
A: DML
B: Integrityconst raint
C: DDL
D: View
Q.no3.Hi er archi calmodeli sal socal l
ed______
___.
A: Treest r
uct ur e
B: PlexSt r
uct ur e
C: Nor mal izeSt r
uct ure
D: Tabl eSt ruct ure
Q.no4.Theuser swhouseeasy -to-usemenuar ecall
ed
A: Sophi sticatedenduser s
B: Naï veuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no5.4NFi sdesi gnedt ocopewi th:
A: Transi ti
v edependency
B: Joindependency
C: Mul tivalueddependency
D: Funct ional dependency
Q.no6.I nanEnt ity-Rel
at i
onshipDi agram “Diamonds”
represent s_ ____ _____________
A: Attributes
B: Mul ti-
valuedat tr
ibutes
C: Weakent ityset
D: Rel ati
onshi pset s
Q.no7.I nE- RDi agram der ivedattri
but earerepresentedby__
___
___
.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no8.Theov eralldescr i
ptionofadat abaseiscalled___
___.
A: Dat aintegr ity
B: Datamani pulat ion
C: Databaseschema
D: Datadef initi
on
Q.no9.Whi choft hef ollowingshouldbeusedt ofi
ndthemeanoft he
salary?
A: Mean( sal ary )
B: Avg(sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no10.E- Rmodel ingt echniqueis:
A: Top-downmet hod
B: Bottom- upmet hod
C: Right-
lef tappr oach
D: Treest ruct ure
Q.no11.E- Rmodelusest hissymboltorepresentweakenti
tyset?
A: Dottedr ectangl e
B: Diamond
C: Doublyout l
inedr ectangle
D: Dotteddi amond
Q.no12.Cr ossPr oducti sa:
A: UnaryOper ator
B: TernaryOper ator
C: BinaryOper ator
D: Notanoper ator
Q.no13.I fBi sanat t r
ibuteandA→B, ThenBi ssai
dtobe_ _
______byA.
A: Logicallyi mpl ied
B: Functional l
yimpl ied
C: Logicallydet ermi ned
D: Functional l
ydet ermi ned
Q.no14.Tor emov ear elati
onf r
om anSQLdat abase,weusethe_ _
___
_
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no15.A‘ book’ isa_ _ ___
____ty
peofentit
y.
A: concept ual
B: concret e
C: real
D: abst ract
Q.no16.Thi skeyt hatuni quelyidentifi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: FieldName
Q.no17.Whatdoy oumeanbyonet omanyr elationshi
pbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no18.Toappl ytheaggr egatef uncti
on,toagr oupofsetof
tuples__ _____ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no19.I nwhi chstat eonegat her sandli
stallthenecessaryfi
eldsfort
he
databasedesi gnpr oject.
A: Dat aDef i
ni t
ion
B: Dat aRef i
nement
C: Establ i
shi ngRel ationship
D: Dat adel etion
Q.no20.Rel at i
onalcal culusisa:
A: Procedur al language
B: Non- Procedur al l
anguage
C: Dat adef initionlanguage
D: Highl ev el l
anguage
Q.no21.I nE- Rdi agram gener ali
zat i
onisrepresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no22.Al laggr egat efunctionsexcept_ ____ignorenullval
uesinthei
r
i
nput
coll
ect i
on.
A: Count (at tri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no23.The_ _
__ __connecti
veisusedtotestforabsenceofset
member shi p.
A: except
B: exist s
C: noti n
D: in
Q.no24.Aggr egatef uncti
onsarefuncti
onsthattakea_ _
_ _
_ _
_ _
__ _as
i
nputand
ret
ur nasi ngl evalue.
A: Col lect i
onofv alues
B: Singl ev al ue
C: Aggr egat evalue
D: Tabl es
Q.no25.Whoi smor econcernedabouttheconceptuall
eveloft heDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no26.Whi choft hefol
lowingisNotaRelati
on-al
gebraOper ation
A: Select
B: Uni on
C: Rename
D: Dropt abl e
Q.no27.Funct i
onalDependenci esarethetypesofconstraintsthatare
based
on___ __ _
A: Key
B: Keyr ev isited
C: Super setkey
D: Tupl e
Q.no28.Whi choft hefol
lowingisanunaryoperati
on?
A: Select i
onoper at i
on
B: Gener alizedsel ection
C: Primi t i
veoper ation
D: Proj ect i
onoper at i
on
Q.no29.Whi choft hef oll
owingfiel
dshaswi dthof8by t
es?
A: Memo
B: Number
C: Dat e/time
D: Hy perlink
Q.no30.I fev erynon- keyat tr
ibut
eisfuncti
onallydependentonthe
pri
mar ykey ,
ther elati
onwi llbei n__ ____
_
A: FirstNor mal For m
B: SecondNor mal For m
C: Thir dNor mal For m
D: Four thFor mal Form
Q.no31.Whi choft hef oll
owingisnotModi f
icationoftheDatabase
A: Del eti
on
B: I
nser t
ion
C: Sor ti
ng
D: Updat ing
Q.no32.I ndomai nr elati
onalcalculuswecreateav ar
iabl
efor
every ________
A: Row
B: Col umn
C: Tabl e
D: At t
ribute
Q.no33.NULLi s___ _
_ _____.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f ori ntegerandblankforcharacter
D: Notav al
ue
Q.no34.Thet erm_ ___ ___i
susedt orefert
oar ow.
A: At t
ribute
B: Tupl e
C: Field
D: Instance
Q.no35.The_ _ ____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: St r
uctur e
D: Pr i
mar ykey
Q.no36.Theempl oyeesal aryshouldnotbegr eaterthanRs.2000.Thi
sis
_______
A: i
ntegr it
yconst raint
B: referent ial constraint
C: over -def inedconst r
aint
D: feasi bleconst raint
Q.no37.Whi choft hef ollowi
ngisnotal evelofdat
aabstraction?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no38.Af unct i
ont hathasnopar ti
alfuncti
onaldependenciesisin
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no39.I nt he_ _
_ _
_ _____normalform,acomposi t
eattr
ibuteisconver
ted
to
i
ndiv i
dualat tri
but es.
A: Fir
st
B: Second
C: Third
D: Four th
Q.no40.Whi choft hef ollowi
ngenabl esustov i
ewdatafrom at abl
e
basedona
specificcr i
t erion
A: For m
B: Quer y
C: Macr o
D: Repor t
Q.no41.Cust omerwi thdrawi
ngmoneyf rom ATM i
sanexampl e
of______ ___ _
A: Appl icat ionpr ogrammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticat eduser
Q.no42.Mi nimalSuper keysarecall
ed
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Attribut ekeys
Q.no43.Af uncti
onaldependencyisar elat
ionshi
pbet weenoramong:
A: Tabl es
B: Rows
C: Relat ions
D: Attribut es
Q.no44.whi chofthefol
lowingisnotadat abaseobject?
A: Tabl es
B: Quer ies
C: Relat ionships
D: Repor ts
Q.no45.Whi chnamemustbeuni quewi thi
nadat abase?
A: Tabl e
B: Fi
el d
C: Recor d
D: Char act er
Q.no46.At ablejoi
nedwithitsel
fiscall
edas_ ___
____
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no47.TheRDBMSt erminologyforar owis______
__.
A: Tupl e.
B: Relat ion.
C: Attribut e.
D: Degr ee.
Q.no48.I none- t
o-manyrel
ationshipthetableon'many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no49.Whi chSQLQuer yisuset oremov eatableandallit
sdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q. no50.I nSQLt hest at ementsel ect*from R,Sisequivalentto_ _
_ __
__ .
A: Select*f rom Rnat ur al j
oinS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Ri nnerj oinS
Q. no51._ ______al l
owust oidentifyuniquel yatupl
eint her elati
on.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q. no52.Af terthef i
nalst atementofat ransacti
onhasbeenexecut ed, a
transact ionent er sina_ __ ______state._______.
A: Act i
ve
B: aborted
C: Commi t
ted
D: Par t
iall
ycommi tted
Q. no53.At ablehasf ieldsF1, F2, F3, F4, F5witht
hef ollowingf unctional
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor mal ization, thi
st ableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no54.I feverynon- keyat tr
ibuteisf unctional
lydepedentpr imar ykey ,
thent he
relationwi l
lbei n___ ______ ____.
A: Fi
rstnor mal f orm
B: Secondnor mal form
C: ThirdNor mal form
D: Four t
hnor mal form
Q. no55.I nthe_ _ _______ _nor malf or
m, acomposi t
eatt r
ibutei sconv erted
to
i
ndi vidualat tri
but es
A: Fi
rst
B: Second
C: Third
D: Four th
Q.no56.At ableont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal For m(2NF)
B: Bei nThi rdNor mal For m( 3NF)
C: Hav easi ngleat tributekey
D: Hav eacomposi tekey
Q.no57.I nt her elat i
onalmodel ,thenumberofat tribut
esandnumberof
tuples
i
riar elationar et er medas_ ___
_ _____
and_ ______ _
_ ____
_respect i
vel
y
A: Cardi nality,domai n
B: Degr ee, cardi nal i
ty
C: Domai ndegr ee
D: Cardi nality,degr ee
Q.no58.Whi choft hef ollowi ngoper ati
oni susedi fwear einterest
edin
only
certaincol umnsofat abl e?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q.no59.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no60.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eat
es_ _____
A: Parent -Chi l
dr el
at ionshi pbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshi pbet weent het ablest hatconnectt hem.
C: Networ kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elationshi pbet weent het ablest hatconnectt hem.
Q.no1.Theconcept ualmodeli s_ _
_______.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwareandsof twar e
D: Independentofbot hhar dwareandsof t
war e
Q.no2.Whent hechangescausedbyanabor t
edt ransacti
onhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ _ ___
____.
A: Fail
ed
B: commi tted
C: parti
allycommi tted
D: roll
edback.
Q.no3.Dat ar edundancymayl eadt o:
A: Datai ntegr ity
B: Atomi citypr oblem
C: Datai nconsi stency
D: Dataabst raction
Q.no4.Whati sACI Dpr oper t
iesofTr ansactions?
A: Atomi city, Consi stency ,Isolati
on,Database
B: Atomi city, Consi stency ,Isolati
on,Durabili
ty
C: Atomi city, Consi stency ,Inconsistent,Durabil
i
ty
D: Automat ical ly
, Concur rency ,I
solati
on, Durabi
li
ty
Q.no5.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponent
s
except _
_ ____ __
A: Users.
B: Separ atef iles
C: Database.
D: Databaseadmi nistr
at or
Q.no6.I nanEnt ity-Rel
at ionshipDi agram “Diamonds”
represent s__ __ _________ _____
A: Attri
but es
B: Multi-
v aluedat t
ributes
C: Weakent ityset
D: Relationshi pset s
Q.no7.Hi erar chi calmodeli sal socalled________
_.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Normal i
zeSt r
uct ure
D: TableSt ruct ure
Q.no8.Keyt or epr esentr elati
onshi pbetweent ablesiscal
led
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dateKey
Q.no9.4NFi sdesi gnedt ocopewi th:
A: Transitivedependency
B: Joindependency
C: Mul tivalueddependency
D: Funct i
onal dependency
Q.no10.I nSQL‘ relat i
onAcont ainsr elati
onB’ canbewr it
tenas
A: Notexi stsBexceptA
B: exist sBexceptA
C: Notexi stsAexceptB
D: exist sAexceptB
Q.no11.Whi choft hef oll
owi ngist hest ructur
eoft heDat abase?
A: Tabl e
B: .Schema
C: Rel ation
D: Struct ure
Q.no12.Whi choneoft hefollowingi snott rueforav iew:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav i
rtual table.
C: Av iewdef initi
oni spermanent l
yst oredaspar toft hedatabase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no13.Fort hegi v ensetoff uncti
onaldependencyF, it
’sclosurei
s
denot edas
A: F+
B: FC
:F*
D: F_
Q.no14.Sel ect*f rom empl oyeeWhatt ypeofstatementi st hi
s?
A: DML
B: Integr it
yconst raint
C: DDL
D: View
Q.no15.Whi choft hef oll
owi ngat t
ribut ecanbef urtherdividedint
o
subpar ts
A: Simpl eat tribute
B: Mul tivaluedat t
ribut e
C: Composi t eat tr
ibut e
D: Der ivedat tribute
Q.no16.Adat adict ionaryisar eposi torythatmanages_ _
__ _
A: Memor y
B: Met adata
C: Spel lChecker
D: DataVal i
dat or
Q.no17.Thebasi cdat at y
pechar (n)isa_ _
___lengt
hcharacterst
ri
ngand
varchar(n)i s_ __ _
_l engt hchar acter
A: Fi
xed, equal
B: Equal, var iable
C: Fi
xed, var iable
D: Variabl e, equal
Q.no18.Whi choneoft hefollowi nguni quelyi
dentif
iestheel
ementsinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no19.Dat aMani pul at i
onLanguage( DML)isnott o__
____
A: Createi nformat i
ont ableint heDat abase
B: I
nser ti
onofnewi nfor mationi ntotheDat abase
C: Deletionofi nformat i
oni nt heDat abase
D: Modi ficat ionofi nf ormat ioni ntheDat abase
Q.no20.Car tesianpr oducti nr elati
onalal gebrais:
A: aUnar yoper ator
B: aBinar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no21.Asubschemaexpr esses_ ___ _
____.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal view
D: Thei nter nal v i
ew
Q.no22.Theuser swhouseeasy -
to-usemenuar ecall
ed
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no23.Tor emov ear elati
onf r
om anSQLdat abase,weuset he___
___
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no24.Al laggr egat efunctionsexcept_ __
_ _ignorenul lval
uesinthei
r
i
nput
collection.
A: Count (
at tri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no25.E- Rmodel ingtechniqueis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -
leftappr oach
D: Treest ructur e
Q.no26.Whi choft hefollowingisNotaRel ation-al
gebr aOperat
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no27.A_ _ _
_ ____inat ablerepresentsarel ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no28.Themet hodofaccesswhi chuseskeyt ransformationi
sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no29.Whi choft hefollowingaret heproper ti
esofent it
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no30._ ___ _
_ _pr oducesther el
ationthathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no31.Whi chofthef ollowingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no32.I ndomai nr elationalcalculuswecr eateav ari
ablefor
every_ ___ ____
A: Row
B: Column
C: Tabl e
D: Attribut e
Q.no33.The_ _____
ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no34.Thet erm_ ___ ___isusedt or ef
ertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no35.Funct ionalDependenci esarethet ypesofconst r
aint
st hatar
e
based
on__ ____
A: Key
B: Keyr evisit
ed
C: Super setkey
D: Tupl e
Q.no36.NULLi s______ ____.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f ori ntegerandbl ankf orcharacter
D: Notav alue
Q.no37.Whati sar elationshipcal l
edwheni tismaintai
nedbet weentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no38.Af i
lemani pul ati
oncommandt hatext r
actssomeoft herecords
from a
fil
eiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no39.Thecol l
ectionofi nter
relat
eddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst racti
on
Q.no40.Whi choft hef oll
owingisnotModi fi
cationoft heDat abase
A: Del eti
on
B: Inser t
ion
C: Sor ti
ng
D: Updat ing
Q.no41.Whi chnor malf ormisconsi deredadequat eforr elat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no42.Whi choft hef oll
owingintruer egar dingRef erent i
alIntegri
ty?
A: Ev erypri
mar y-
keyv aluemustmat chapr imar y-keyv alueinan
associ atedtable
B: Ev erypri
mar y-
keyv aluemustmat chaf oreign-keyv aluei nanassoci at
ed
table
C: Ev eryforeign-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ atedtable
D: Ev eryforeign-keyv aluemustmat chaf or eign-keyv alueinanassoci ated
table
Q.no43.I fever ynon- keyat t
ri
buteisf unctional l
ydependentont he
primar ykey ,
ther elati
onwi l
lbein_ _ ___
__
A: FirstNor mal Form
B: SecondNor mal For m
C: Thi rdNormal Form
D:Four thFor mal For m
Q.
no44.Rel ationalAl gebr ai
s
A:DataDef i
nitionLanguage
B:Met aLanguage
C:Procedur al quer yLanguage
D:DataMani pul ationLanguage
Q.
no45.Whi choft hef oll
owingisanunar yoper ati
on?
A:Select ionoper ation
B:Gener alizedsel ect ion
C:Primi tiveoper ation
D:Project i
onoper at i
on
Q.
no46.Thenat ur al j
oi ni
sequalt o:
A:Cartesi anPr oduct
B:Combi nat i
onofUni onandCar tesi
anpr oduct
C:Combi nat i
onofsel ecti
onandCar tesianpr oduct
D:Combi nat i
onofpr oject
ionandCar tesianpr oduct
Q.
no47.Whi choft hef oll
owingisnotal ev elofdataabstract
ion?
A:Phy sical Lev el
B:Crit
ical Lev el
C:Logi cal Lev el
D:ViewLev el
Q.
no48.Cust omerwi thdr
awingmoneyf rom ATM i sanexampl e
of
______ _ ___
A:Appl icat ionpr ogr ammer
B:Naïv euser
C:Speci al izeduser
D:Sophi sticateduser
Q.
no49.TheRDBMSt erminologyforar owi s_ _
______.
A:Tupl e.
B:Relat ion.
C:Attri
but e.
D:Degr ee.
Q.
no50.At ablej oinedwi thit
selfiscall
edas_ _____
__
A:Join
B:SelfJoi n
C:OuterJoi n
D:Equi Joi n
Q.
no51.Cr eat et abl eempl oyee(namev ar char, i
dinteger
)Whattypeof
st
atement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst rai nt
Q. no52.Consi dert hefol l
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi narytabl esisi nBCNF
Whi choft hef oll
owi ngist rue?
A: Bot hS1andS2ar et
r ue
B: S1i strue
C: S2i strue
D: Bot hS1andS2ar efalse
Q. no53.Whi choft hefol l
owi ngisnotapr oper t
yofatransact
ion?
A: Atomi city
B: Consi stency
C: Integrit
y
D: Dur abil
ity
Q. no54.I far el
ationi sinBCNF, theniti
sal soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no55.Whi choft hefol l
owi ngisnott r
uef orNormali
zati
on?
A: Remov esr edundancy
B: Remov esinser tionanomal y
C: Decomposest her el
at i
on
D: Quer yexecut i
onbecomesf aster
Q. no56.Af unctionaldependencyoft hefor m x—>yi stri
vali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no57.Amongstt heACI Dpr operti
esofat r
ansact
ion,t
he'Durabi
li
ty'
proper ty
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper ati
ngsy stem crash
B: Excepti ncaseofadi skcrash
C: Excepti ncaseofapowerf ail
ure
D: Alway s,ev eni fther eisaf ail
ureofanyki nd
Q. no58.Whi char et het woway sinwhi chent i
tiescanpart
ici
patei
na
relat i
onshi p?
A: Passiv eandact ive
B: Totalandpar t
ial
C: SimpleandCompl ex
D: simpleandpar ti
al
Q. no59.Dupl icationofdat aatsev er alplacesisknownas_ __
_
A: Concur rentaccessanomal i
es
B: Dataisol ation
C: Datainconsi stency
D: Datar edundancy
Q. no60.Af tert hef inalst atementofat ransact i
onhasbeenexecuted,
a
transact ionent ersi na_ ________state.__
_ ___
_.
A: Activ
e
B: aborted
C: Commi tted
D: Parti
allycommi tt
ed
Q. no1.A‘ book’ i
sa_ _ _
__ __
_ _
typeofent i
ty.
A: concept ual
B: concret e
C: real
D: abstract
Q. no2.Dat ar edundancymayl eadt o:
A: Dataint egrity
B: Atomi citypr oblem
C: Datainconsi stency
D: Dataabst raction
Q. no3.Thi skeyt hatuni quelyidentifi
eseachr ecor
discall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fiel
dName
Q. no4.I nwhi chst ateonegat hersandl i
stallthenecessar
yfiel
dsfort
he
dat abase
desi gnpr oject .
A: DataDef ini
t i
on
B: DataRef inement
C: Establ ishi ngRel at ionship
D: Datadel etion
Q.no5.Whi choft hef ollowingshoul dbeusedt of i
ndthemeanoft he
salary?
A: Mean( sal ar y)
B: Avg( sal ary )
C: Sum( sal ary )
D: Count (salar y)
Q.no6.I fBi sanat tr i
but eandA→B, ThenBi ssaidtobe_ ___
____byA.
A: Logical lyi mpl i
ed
B: Funct ional l
yi mpl i
ed
C: Logical lydet er mi ned
D: Funct ional l
ydet er mi ned
Q.no7.Whati sACI Dpr oper t
iesofTr ansact ions?
A: Atomi city, Consi stency ,Isolat
ion,Dat abase
B: Atomi city, Consi st ency ,Isolat
ion,Dur abili
ty
C: Atomi city, Consi stency ,Inconsistent,Dur abil
i
ty
D: Automat ical l
y ,Concur r
ency ,I
solation,Dur abi
li
ty
Q.no8.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponents
except_ __ __ ___
A: User s.
B: Separ at ef iles
C: Database.
D: Databaseadmi ni strator
Q.no9.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ternar yOper at or
C: Binar yOper ator
D: Notanoper at or
Q.no10.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Cli
ent
D: DBA
Q.no11.Aggr egat ef unct i
onsar ef unctionst hattakea_ _
______
___as
i
nputand
ret
urnasi ngl ev alue.
A: Collect ionofv alues
B: Singlev al
ue
C: Aggr egat ev alue
D: Tabl es
Q.no12.Toappl ytheaggr egatefuncti
on, toagr oupofsetof
tuples_ ____ _
_clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no13.I nE- Rdi agr am gener ali
zati
onisr epresentedby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no14.Rel ationalcal cul
usi sa:
A: Procedur allanguage
B: Non- Procedur allanguage
C: Dat adef i
niti
onl anguage
D: Highl ev ellanguage
Q.no15.Theov eralldescripti
onofadat abasei scalled__
____
.
A: Dat aint egrit
y
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef i
niti
on
Q.no16.E- Rmodelusest hissy mboltorepr esentweakent i
tyset?
A: Dot tedr ectangl e
B: Diamond
C: Doubl yout l
inedr ectangle
D: Dot teddi amond
Q.no17.Theconcept ualmodeli s_____
__ _
_ .
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsoftwar e
D: Independentofbot hhar dwar eandsof t
war e
Q.no18.Whatdoy oumeanbyonet omanyr el
ationshipbet
weenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no19.Whent hechangescausedbyanabor t
edt r
ansactionhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ ________.
A: Failed
B: commi tt
ed
C: par t
ial l
ycommi tted
D: roll
edback.
Q.no20.The_ ____ _
connect i
vei susedt otestforabsenceofset
member ship.
A: except
B: exists
C: noti n
D: in
Q.no21.I nE- RDi agr am der i
vedat tri
butearerepresentedby __
__ ___
_.
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no22.Asubschemaexpr esses_ ___
_____.
A: Thel ogical v i
ew
SeatNo-
Total numberofquest ions: 60
1000755_ T1DBMS
Time: 1hr
MaxMar ks: 50
N.B
1)Al lquest ionsar eMul ti
pleChoi ceQuestionshavingsinglecorrectoption.
2)At t
emptany50quest ionsoutof60.
3)Useofcal culatori sallowed.
4)Eachquest ioncar ries1Mar k.
5)Speci all
yabl edst udent sareal l
owed20mi nutesextr
af orexami nati
on.
6)Donotusepenci lstodar kenanswer .
7)Useonl ybl ack/ bl
uebal lpointpent odarkentheappropr i
atecircl
e.
8)Nochangewi l
lbeal l
owedoncet heanswerismar kedonOMRSheet .
9)Roughwor kshal lnotbedoneonOMRsheetoronquest i
onpaper .
10)Dar kenONLYONECI RCLEf oreachanswer .
Q.no1.Fort hegiv ensetoff unctionaldependencyF, i
t’
sclosur
eis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no2.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt able?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
Set1
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no3.Dat ar edundancymayl eadt o:
A: Dat aintegrity
B: Atomi cityprobl em
C: Dat ainconsi stency
D: Dat aabst racti
on
Q.no4.Whi choneoft hefollowinguni quelyidenti
fiestheelement
si nthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no5.Theconcept ualmodeli s_ ____
____.
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof twar e
D: Independentofbot hhar dwar eandsof twar e
Q.no6.Al laggr egatef unctionsexcept_ _
_ __ignorenullval
uesinthei
r
i
nput
coll
ect i
on.
A: Count (attri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no7.Thedat abaseenv i
ronmenthasal lofthefollowingcomponents
except ________
A: User s.
B: Separ atef iles
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no8.I nwhi chst at eonegat hersandl istallthenecessaryfiel
dsfort
he
database
designpr oj ect .
A: Dat aDef inition
B: Dat aRef inement
C: Est ablishi ngRel ationship
D: Dat adel etion
Q.no9.Thi skeyt hatuni quel yidentifi
eseachr ecordi scal
led
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no10.Hi erar chicalmodeli sal socalled________
_.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Nor mal i
zeSt r
uct ure
D: Tabl eSt ruct ure
Q.no11.I nanEnt ity-RelationshipDi agram “Diamonds”
represent s_ ___ _______ __
_ ___
_
A: Attribut es
B: Mul ti-
v aluedat tributes
C: Weakent ityset
D: Rel ati
onshi pset s
Q.no12.Whi choft hef ollowingat tr
ibutecanbef urtherdi
videdint
o
subpar t
s
A: Simpl eat tribute
B: Mul tivaluedat t
ribut e
C: Composi teat tr
ibut e
D: Der ivedat tribute
Q.no13.Whoi smor econcer nedaboutt heconcept uallev
eloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no14.Whi choft hef ollowingi sthest r
uctureoft heDatabase?
A:Tabl e
B:.Schema
C:Relation
D:Struct ure
Q.
no15.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A:Sophi sticatedenduser s
B:Naï veuser s
C:Stand- aloneuser s
D:Casual enduser
Q.
no16.Adat adi ctionaryisarepositorythatmanages_ ____
A:Memor y
B:Met adat a
C:Spell Checker
D:Dat aVal idat or
Q.
no17.E- Rmodelusest hi
ssy mboltor epresentweakent i
tyset?
A:Dot t
edr ectangl e
B:Diamond
C:Doubl yout linedr ectangle
D:Dot t
eddi amond
Q.
no18.I nE- Rdi agr am generali
zati
oni srepresentedby
A:Ell
ipse
B:Dashedel l
ipse
C:Rect angl e
D:Triangl e
Q.
no19.I nSQL‘ relat i
onAcont ainsrelati
onB’ canbewr i
tt
enas
A:Notexi stsBexceptA
B:existsBexceptA
C:Notexi stsAexceptB
D:existsAexceptB
Q.
no20.I nE- RDi agr am derivedattr
ibutearer epresentedby___
___
__.
A:Ell
ipse
B:Dashedel l
ipse
C:Rect angl e
D:Triangl e
Q.
no21.Cr ossPr oducti sa:
A:Unar yOper at or
B:Ternar yOper at or
C:Binar yOper at or
D:Notanoper at or
Q.no22.Whent hechangescausedbyanabor tedtr
ansactionhavebeen
undone,
thet r
ansact i
oni ssaidt obe_ ____ ____.
A: Failed
B: commi t ted
C: part i
allycommi t
ted
D: roll
edback.
Q.no23.Dat aMani pulat i
onLanguage( DML)i snotto_
_____
A: Creat ei nformat i
ont ableint heDat abase
B: Inser ti
onofnewi nfor mationint ot heDatabase
C: Delet ionofi nformat i
oni nt heDat abase
D: Modi ficat i
onofi nformat ioni ntheDat abase
Q.no24.Car t
esianpr oducti nr elati
onalal gebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper at
or
D: notdef ined
Q.no25.Tor emov ear elati
onf rom anSQLdat abase,weuset he_____
_
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no26.I none- to-manyr el
ationshi pt hetableon'many'sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no27.Whi choft hef ollowingf ieldshaswi dt
hof8by tes?
A: Memo
B: Number
C: Dat e/t i
me
D: Hy per link
Q.no28.Mi nimalSuper keysar ecal led
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Attribut ekey s
Q.no29.Funct i
onalDependenci esar ethetypesofconst r
aint
sthatare
based
on______
A: Key
B: Keyr ev i
sit
ed
C: Super setkey
D: Tuple
Q.no30.Whi chnormalfor mi sconsi
deredadequateforr el
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Af i
lemanipulationcommandt hatext
ractssomeoft herecor
ds
from a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no32.TheRDBMSt er
mi nologyforarowis_____
___.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degree.
Q.no33.I nSQLt hestatementsel ect
*fr
om R,Sisequivalentto___
____.
A: Select*f rom Rnatural j
oinS
B: Select*f rom RcrossjoinS
C: Select*f rom RunionjoinS
D: Select*f rom RinnerjoinS
Q.no34.Whi chSQLQuer yisusetoremov eatableandal li
tsdatafrom
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTable
Q.no35.I nthe__________nor malfor
m,acomposi teattr
ibuteisconvert
ed
to
i
ndiv i
dualat tributes.
A: First
B: Second
C: Thi r
d
D: Four th
Q.no36.Thet er m_ ____ __isusedt oref
ert oar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no37.Whi choft hef oll
owi ngintrueregardingRef erentialI
ntegr
it
y?
A: Ever ypr imar y-keyv al uemustmat chapr i
mar y-keyv alueinan
associ atedt abl e
B: Ever ypr imar y-keyv al uemustmat chaf orei
gn-keyv alueinanassociated
table
C: Ever yf orei gn-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ev eryf orei gn-keyv aluemustmat chaforeign-keyv alueinanassociated
table
Q.no38.Theempl oy eesal aryshouldnotbegr eaterthanRs.2000.Thi sis
______ _
A: i
nt egr it
yconst raint
B: referent ial const raint
C: over -definedconst raint
D: feasi bleconst raint
Q.no39.Cust omerwi thdr awingmoneyf r
om ATM i sanexampl e
of____ ______
A: Appl icationpr ogr ammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sti
cat eduser
Q.no40._ __ ___ _pr oducest herel
ati
onthathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no41.Thecol l
ect ionofi nterr
elat
eddat aiscal l
edas:
A: DBMS
B: RDBMS
C:Database
D:Dat aabst racti
on
Q.
no42.NULLi s__ ________ .
A:Thesameas0f orinteger
B:Thesameasbl ankf orchar act er
C:Thesameas0f orintegerandbl ankf orchar acter
D:Notav al ue
Q.
no43.Thenat ural joi
ni sequalt o:
A:Cart esi anPr oduct
B:Combi nat i
onofUni onandCar tesianpr oduct
C:Combi nat i
onofsel ectionandCar tesianpr oduct
D:Combi nat i
onofpr ojectionandCar tesianpr oduct
Q.
no44.At ablejoi nedwi thitselfiscal l
edas_ _______
A:Join
B:SelfJoi n
C:Out erJoi n
D:Equi Joi n
Q.
no45.I ndomai nr elationalcal culuswecr eateav ar
iabl
efor
ev
ery__ ___ _ __
A:Row
B:Column
C:Tabl e
D:Attribut e
Q.
no46.The_ _____ofadat abasekeepsonchangi ng.
A:Instance
B:Schema
C:Struct ur e
D:Primar ykey
Q.
no47.Whi chnamemustbeuni quewi t
hinadat abase?
A:Tabl e
B:Fiel
d
C:Recor d
D:Char act er
Q.
no48.Whi choft hef ollowingi sanunar yoper ation?
A:Select ionoper ation
B:Gener alizedsel ection
C:Primi tiveoper at i
on
D:Project i
onoper ation
Q.
no49.A_ __ _
_ _
_ _inat abler epresent sar el
ationshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no50.whi choft hef ol
lowingi snotadat abaseobject?
A: Tabl es
B: Quer ies
C: Relat i
onshi ps
D: Repor t
s
Q.no51.At abl eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngl eat tri
but ekey
D: Hav eacomposi t
ekey
Q.no52.I fev erynon- keyat t
ributei sfunct
ionall
ydepedentpr imarykey
,
t
hent he
rel
at i
onwi l
lbei n___ _______
__ _.
A: Firstnor mal f orm
B: Secondnor mal form
C: ThirdNor mal form
D: Four thnor mal form
Q.no53.I far elat i
oni si nBCNF, t
heni tisalsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no54.I nther elationalmodel ,thenumberofat t
ri
butesandnumberof
t
upl es
i
riar elationar et ermedas_ ____ _
_ ___
and_ ____
______
___respecti
vely
A: Car dinali
ty,domai n
B: Degr ee,car dinality
C: Domai ndegr ee
D: Car dinali
ty,degr ee
Q.no55.Whi char et het woway si nwhichentiti
escanpar ti
cipat
eina
rel
at i
onshi p?
A: Passi veandact ive
B: Tot al andpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar ti
al
Q.no56.Whi choft hef ol lowi ngisnott rueforNormal i
zat
ion?
A: Remov esr edundancy
B: Remov esinser t
ionanomal y
C: Decomposest her el
at ion
D: Quer yexecut i
onbecomesf ast
er
Q.no57.Cr eat etabl eempl oy ee(namev archar,i
dinteger
)Whatt y
peof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q.no58.Af tert hef inalst at ementofat ransacti
onhasbeenexecut ed,
a
tr
ansact ionent er si na_ __ ______state.______
_.
A: Act ive
B: abor ted
C: Commi tted
D: Par ti
al l
ycommi t
ted
Q.no59.The_ _____ ___pr otocolensur esf reedom fr
om deadlock.
A: Two- phasel ocki ngpr ot ocol
B: Strictt wo-phasel ocki ngpr otocol
C: Rigor oust wo- phasel ocki ngprotocol
D: Timest ampor deringpr ot ocol
Q.no60.Dupl i
cat ionofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat ai solati
on
C: Dat ai nconsi stency
D: Dat ar edundancy
A: Logi callyimpl ied
B: Funct ional l
yi mpl ied
C: Logi callydet ermi ned
D: Funct i
onal l
ydet ermi ned
Q.no2.4NFi sdesi gnedt ocopewi th:
A: Transi t
ivedependency
B: Joindependency
C: Mul ti val
ueddependency
D: Funct ional dependency
Q.no3.Asubschemaexpr esses_ ____
___ _.
A: Thel ogi cal view
B: Thephy si cal view
C: Theext ernal view
D: Thei nt er nal view
Q.no4.Rel at ionalcal culusisa:
A: Procedur al language
B: Non- Pr ocedur allanguage
C: Dat adef initionl anguage
D: Highl ev el l
anguage
Q.no5.Whati sACI Dpr oper t
iesofTr ansact ions?
A: Atomi city ,Consi stency , I
solation,Dat abase
B: Atomi city, Consi stency ,Isolation,Dur abil
ity
C: Atomi city ,Consi stency , I
nconsi stent,Dur abil
it
y
D: Aut omat i
cal ly,Concur r
ency ,Isolati
on, Dur abi
li
ty
Q.no6.Aggr egat ef unctionsar ef uncti
onst hattakea_ _
___
____
__asi
nput
and
ret
ur nasi ngl ev alue.
A: Col l
ect ionofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tabl es
Q.no7.Whi choneoft hef oll
owi ngi snott ruef oraview:
A: Viewi sder ivedf r
om ot hert ables
B: Viewi sav i
rtual table.
C: Av i
ewdef i
ni t
ioni sper manent lystoredaspar tofthedat
abase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no8.A‘ book’ isa_ ____ _
_ __t
y peofent it
y.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no9.Whi choft hef ollowingshoul dbeusedt ofi
ndthemeanofthe
salary?
A: Mean( sal ar y)
B: Av g(sal ary )
C: Sum( sal ar y)
D: Count (sal ary )
Q.no10.Sel ect*f r
om empl oy eeWhatt ypeofst atementisthis?
A: DML
B: Integr i
t yconst r
aint
C: DDL
D: View
Q.no11.Theov eralldescriptionofadat abasei scal l
ed__
____.
A: Dat ai nt egr i
ty
B: Dat amani pulat i
on
C: Dat abaseschema
D: Dat adef i
ni ti
on
Q.no12.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no13.Thebasi cdat atypechar (n)isa_ ____lengthcharacterstr
ingand
varchar (n)i s_ ___ _lengthchar acter
A: Fixed, equal
B: Equal , var iable
C: Fixed, var iable
D: Var iabl e, equal
Q.no14.Keyt or epresentr elationshipbet weent ablesiscal
led
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no15.Toappl ytheaggr egat efunction,toagr oupofsetof
tuples_ ___ __ _clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no16.The_ __ ___connect i
v eisusedt otestforabsenceofset
member shi p.
A: except
B: exist s
C: noti n
D: in
Q.no17.Thedat abaseenv ironmenthasal lofthefoll
owingcomponent
s
except _
_ ___ ___
A: Users.
B: Separ atef il
es
C: Database.
D: Databaseadmi nistrator
Q.no18.Hi erar chicalmodeli sal socalled_______
__.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Normal i
zeSt ructure
D: TableSt ruct ure
Q.no19.Whi choft hefollowi ngat t
ri
butecanbef ur
therdiv
idedi
nto
subpar t
s
A: Simpl eat tribut e
B: Multivaluedat tri
but e
C: Composi teat t r
ibute
D: Derivedat tribut e
Q.no20.I nanEnt it
y -
Relationshi pDi agram “Diamonds”
represent s_ ____ ____ _
_ _______
A: Attri
but es
B: Multi-
v aluedat tri
butes
C: Weakent ityset
D: Relationshi pset s
Q.no21.Whi choneoft hef ollowi nguniquelyidenti
fi
estheelement
sinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no22.Cr ossPr oducti sa:
A: UnaryOper at or
B: Ternar yOper ator
C: BinaryOper at or
D: Notanoper at or
Q.no23.Theconcept ualmodeli s_ ____
_ _
__.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof tware
D: Independentofbot hhar dwar eandsof tware
Q.no24.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt able?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no25.Al laggr egat efuncti
onsexcept_ _
_ _
_i gnorenullv
aluesinthei
r
i
nput
coll
ection.
A: Count (attr
ibut e)
B: Count (*)
C: Avg
D: Sum
Q.no26.Af unct iont hathasnopar tialfunctionaldependenciesisin
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no27.Rel ationalAl gebrais
A: DataDef i
nitionLanguage
B: MetaLanguage
C: Procedur al quer yLanguage
D: DataMani pul at i
onLanguage
Q.no28.I fever ynon- keyattr
ibuteisf unctionallydependentont he
pri
mar ykey ,
therelationwi llbei n_______
A: Fi
rstNor mal For m
B: SecondNor mal For m
C: ThirdNor mal For m
D: Four t
hFor mal Form
Q.no29.Themet hodofaccesswhi chuseskeyt r
ansformati
oni sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent ial
Q.no30.Whi choft hefoll
owingi snotal evelofdat aabstr
action?
A: Phy sicalLevel
B: Crit
ical Level
C: Logi calLevel
D: ViewLev el
Q.no31.Whi chofthefoll
owingisNotaRel at i
on- al
gebraOperati
on
A: Select
B: Union
C: Rename
D: Dropt able
Q.no32.Whi chofthefoll
owingisnotModi ficationoftheDatabase
A: Delet i
on
B: I
nser t
ion
C: Sorting
D: Updat ing
Q.no33.Whati sarelat
ionshi
pcal l
edwheni ti
smai nt
ainedbetweentwo
entit
ies?
A: Unar y
B: Binar y
C: Ternar y
D: Quat ernary
Q.no34.Af uncti
onaldependencyisar el
ationshi pbetweenoramong:
A: Tabl es
B: Rows
C: Relat i
ons
D: Attri
but es
Q.no35.Whi chofthefoll
owingaret heproperti
esofent i
ti
es?
A: Groups
B: Tabl e
C: Attri
but es
D: Swit chboards
Q.no36.Whi chofthefoll
owingenabl esustov iewdat afrom atabl
e
basedona
specificcr it
eri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no37.Thecol l
ecti
onofinter
relateddataiscal ledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst racti
on
Q.no38.whi choft hef oll
owingisnotadatabaseobj ect?
A: Tabl es
B: Quer i
es
C: Rel ationshi ps
D: Repor ts
Q.no39.Mi nimalSuper keysarecall
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attr i
but ekey s
Q.no40.At abl ej
oinedwi t
hitsel
fiscall
edas____
__ _
_
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no41.Thet erm_ ______isusedtorefert
oar ow.
A: Attribut e
B: Tupl e
C: Field
D: Inst ance
Q.no42.Theempl oy eesal ar
yshouldnotbegreaterthanRs.2000.Thi
sis
__
_ ____
A: i
nt egr it
yconst raint
B: refer enti
al constraint
C: over -definedconst rai
nt
D: feasi bleconst raint
Q.no43.The_ _____
ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ure
D: Primar ykey
Q.no44.I nSQLt hest atementselect*f
rom R,
Sisequi val
entt
o___
____.
A: Select*f rom Rnat uralj
oinS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oi
nS
Q.no45.Whi chnor malf ormi sconsideredadequat eforrelational
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no46.Whi choft hef oll
owingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Date/ t
ime
D: Hyper li
nk
Q.no47.Funct ionalDependenci esaret het ypesofconst rai
nt sthatare
based
on______
A: Key
B: Keyr ev isi
ted
C: Super setkey
D: Tuple
Q.no48.I nt he_ ____
__ __
_nor malform, acomposi teatt
ributei sconvert
ed
to
i
ndividualat tr
ibutes.
A: Fir
st
B: Second
C: Thir
d
D: Fourth
Q.no49.Thenat uraljoi
ni sequalto:
A: Cartesi anPr oduct
B: Combi nationofUni onandCar t
esianpr oduct
C: Combi nationofsel ecti
onandCar t
esianpr oduct
D: Combi nationofpr ojecti
onandCar t
esianpr oduct
Q.no50.Whi chSQLQuer yisuset oremov eat ableandal li
tsdat afrom
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no51.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycreat es______
A: Par ent -
Childr elationshi pbet weent het ablesthatconnectthem
B: Manyt omanyr elationshi pbet weent het abl
esthatconnectthem.
C: Net wor kmodel bet weent het ablest hatconnectt hem.
D: Manyt ooner elationshi pbet weent het ablesthatconnectthem.
Q. no52.I nt he_ ______ __ _normalf orm, acomposi t
eat tr
ibut
eisconverted
to
i
ndi v i
dualat tributes
A: First
B: Second
C: Third
D: Four th
Q. no53.Ther esul toft heUNI ONoper ationbet weenR1andR2i sa
relat i
ont hat
i
ncl udes
A: Allthet upl esofR1
B: Allthet uplesofR2
C: Allthet upl esofR1andR2
D: Allthet upl esofR1andR2whi chhav ecommoncol umns
Q. no54.Amongstt heACI Dpr oper tiesofat r
ansaction,the'
Durabil
it
y'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsy stem cr ash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ailure
D: Alway s,eveni ft her ei saf ail
ur eofanyki nd
Q. no55.Doesi ndext akespacei nthedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equi r
ed
C: Indexest akenospace
D: Yes, Indexesar est or edondi sk
Q. no56.At ablehasf ieldsF1, F2, F3, F4, F5withthef oll
owingfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor malizat ion,thist ablei sin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no57._ ____ _
_al lowust oi denti
fyuni
quel
yat upl
eintherel
at i
on.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q.no58.Whi choft hef oll
owi ngoperati
onisusedifweareinterest
edin
only
certai
ncol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q.no59.Whi choft hef oll
owi ngisnotapropertyofatr
ansaction?
A: Atomi city
B: Consi stency
C: Int
egr it
y
D: Durabi l
ity
Q.no60.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi naryt ablesi sinBCNF
Whi choft hef ollowi ngist rue?
A: BothS1andS2ar etrue
B: S1ist rue
C: S2i strue
D: BothS1andS2ar efalse
Q.no1.Tor emov ear elationf r
om anSQLdat abase,weusethe_ __
___
command.
A: Delete
B: Purge
C: Remov e
D: Dropt able
Q.no2.Rel ationalcal culusi sa:
A: Procedur al l
anguage
B: Non- Procedur al l
anguage
C: Datadef i
niti
onl anguage
D: Highl evellanguage
Q.no3.I fBi sanat tri
buteandA→B, ThenBi ssaidtobe_ ____
___byA.
A: Logi cal lyimpl i
ed
B: Funct i
onal l
yi mpl i
ed
C: Logi cal lydet er mined
D: Funct i
onal l
ydet ermined
Q.no4.I nE- Rdi agram general
izati
oni sr epresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Tri
angl e
Q.no5.Whoi smor econcernedaboutt heconcept uall
eveloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Cli
ent
D: DBA
Q.no6.I nSQL‘ relati
onAcont ainsrelationB’ canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no7.Theuser swhouseeasy -t
o-usemenuar ecal l
ed
A: Sophi sticat edenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no8.Asubschemaexpr esses________ _.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal view
D: Thei nter nal view
Q.no9.Dat ar edundancymayl eadto:
A: Dat ai nt egrity
B: Atomi ci typr oblem
C: Dat ai nconsi stency
D: Dat aabst ract i
on
Q.no10.Whent hechangescausedbyanabor tedt r
ansacti
onhavebeen
undone,
thetransact ioni ssai dtobe_________.
A: Failed
B: commi tted
C: partiallycommi tted
D: roll
edback.
Q.no11.Adat adi ctionar yisar epositorythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idat or
Q.no12.Whati sACI Dpr opertiesofTr ansacti
ons?
A: Atomi city, Consi st ency ,I
solat i
on,Dat abase
B: Atomi city, Consi st ency ,I
solat i
on,Dur abil
it
y
C: Atomi city, Consi st ency ,I
nconsi stent,Durabili
ty
D: Aut omat ical l
y ,
Concur rency,Isolation,Durabil
it
y
Q.no13.E- Rmodelusest hissy mbolt orepresentweakent it
yset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout li
nedr ect angle
D: Dot teddi amond
Q.no14.Whi choft hef ollowingi sthest ructureoft heDatabase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no15.Car tesi anpr oducti nr elati
onalal gebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no16.I nE- RDi agr am der i
vedat tributearer epresent
edby ____
____.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no17.Fort hegi vensetoff unctionaldependencyF, i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no18.4NFi sdesi gnedt ocopewi th:
A: Transit i
v edependency
B: Joindependency
C: Mul ti
v al ueddependency
D: Funct i
onal dependency
Q.no19.Dat aMani pul ationLanguage( DML)i snott o____
__
A: Createi nf ormati
ont ableintheDat abase
B: Inserti
onofnewi nformat i
oni nt otheDatabase
C: Deletionofi nf
ormat i
oni ntheDat abase
D: Modi ficat ionofi nformat i
oni nt heDat abase
Q.no20.I nwhi chstat eonegat her sandl i
stallthenecessaryfiel
dsfort
he
databasedesi gnpr oject.
A: DataDef initi
on
B: DataRef inement
C: Establishi ngRelat i
onship
D: Datadel et ion
Q.no21.Thi skeyt hatuni quelyi dent i
fi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: FieldName
Q.no22.A‘ book’ i
sa_ ________typeofent i
ty.
A: concept ual
B: concret e
C: real
D: abstract
Q.no23.Whatdoy oumeanbyonet omanyr elationshi
pbetweenTeacher
and
Classt able?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no24.Thebasi cdat at ypechar (n)isa_ _
___l engthcharact
erstri
ngand
varchar (
n)i s_ ____lengt hchar act er
A: Fixed, equal
B: Equal, var iable
C: Fixed, var iable
D: Variabl e, equal
Q.no25.I nanEnt it
y -RelationshipDiagr
am “ Diamonds”
represent s_ __ ___ _
___ __ _
__ ___
A: At tr
ibut es
B: Mul ti-valuedat tr
ibut es
C: Weakent ityset
D: Rel ationshi pset s
Q.no26.Cust omerwi thdrawingmoneyf rom ATM isanexampl e
of___ ___ ____
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci ali
zeduser
D: Sophi sticat eduser
Q.no27._ __ _ ___pr oducest herelat
ionthathasat t
ri
butesofR1andR2
A: Car tesianpr oduct
B: Differ ence
C: Pr oduct
D: Inter sect ion
Q.no28.I fev erynon- keyat t
ribut
eisfunct i
onall
ydependentont he
pri
mar ykey ,
ther elat i
onwi llbei n_ ______
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal Form
D: Four t hFor mal For m
Q.no29.Rel at ionalAl gebr ais
A: Dat aDef ini ti
onLanguage
B: Met aLanguage
C: Pr ocedur al quer yLanguage
D: Dat aMani pul ati
onLanguage
Q.no30.Whi choft hef ollowingisnotal evelofdataabstracti
on?
A: Phy si cal Lev el
B: Cr i
tical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no31.I ndomai nr elationalcalculuswecr eateav ar
iabl
ef or
every ___ ____ _
A: Row
B: Col umn
C: Tabl e
D: Att ri
but e
Q.no32.Whi chnamemustbeuni quewi thinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no33.TheRDBMSt ermi nologyforar owi s________.
A: Tupl e.
B: Rel ati
on.
C: Attr i
but e.
D: Degr ee.
Q.no34.Whi choft hef ollowingintrueregar dingRef erentialIntegri
ty?
A: Ev erypr imar y-
keyv aluemustmat chapr i
mar y-keyv alueinan
associ atedt able
B: Ever ypr imar y-
keyv al uemustmat chaf orei
gn-keyv alueinanassoci at
ed
table
C: Ev eryfor eign-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ atedt able
D: Ev eryf oreign-keyv aluemustmat chaf oreign-keyv alueinanassoci ated
table
Q.no35.A_ ______ _inat ablerepresentsar elati
onshi pamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no36.Whi choft hef ollowingisNotaRel ation-algebraOper ati
on
A: Sel ect
B: Uni on
C: Rename
D: Dropt able
Q.no37.Themet hodofaccesswhi chuseskeyt ransf ormat i
oni sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no38.NULLi s___ _
__ ____.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f orintegerandbl ankforcharacter
D: Notav alue
Q.no39.Af unct
iont hathasnopar ti
alf
unctionaldependenciesisin
_______f orm:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no40.Af i
lemani pulationcommandt hatextractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no41.Whi choft hef ollowingisanunar yoperation?
A: Select i
onoper ation
B: Gener alizedsel ect i
on
C: Primitiveoper at i
on
D: Project ionoper ation
Q.no42.I none- to-manyr elati
onshipthetableon' many '
sideiscal
ledas:
A: Parent
B: Mast er
C: Sister
D: Child
Q.no43.Whi choft hef ollowingisnotModi f
icationoftheDatabase
A: Deletion
B: I
nser tion
C: Sorting
D: Updat ing
Q.no44.I nSQLt hest atementsel ect
*fr
om R,Si sequival
entto____
___.
A: Select*f rom Rnat ural j
oinS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no45.The_ _____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no46.Mi nimalSuper keysarecal led
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attribut ekey s
Q.no47.Theempl oy eesal ar
yshoul dnotbegreat
erthanRs.2000.Thisis
_______
A: i
ntegr i
tyconst rai
nt
B: referent ial constraint
C: over -definedconst r
aint
D: feasi bleconst r
aint
Q.no48.Funct i
onalDependenci esar ethety
pesofconstrai
ntsthatare
based
on__ _
_ __
A: Key
B: Keyr evisited
C: Super setkey
D: Tupl e
Q.no49.I nt he_ _____ __
_ _normalf orm, acomposi
teattr
ibuteisconvert
ed
to
i
ndiv i
dualat tri
butes.
A: Fir
st
B: Second
C: Third
D: Four th
Q.no50.Whi choft hef ollowingf i
eldshaswi dt
hof8by t
es?
A: Memo
B: Number
C: Dat e/ ti
me
D: Hy per li
nk
Q.no51.At abl eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal Form(2NF)
B: Bei nThi rdNor mal For m(3NF)
C: Hav easi ngleat t
ribut ekey
D: Hav eacomposi tekey
Q.no52.I far elationi sinBCNF, t
heni ti
sal soin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no53.Cr eat etabl eempl oyee(namev archar,i
dinteger
)Whatt y
peof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q.no54.Whi char ethet woway sinwhi chent i
ti
escanpar ti
cipateina
rel
at i
onshi p?
A: Passi v eandact i
ve
B: Tot al andpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar ti
al
Q.no55.The_ ______ __protocolensuresf r
eedom f r
om deadlock.
A: Two- phasel ockingpr otocol
B: Strictt wo-phasel ockingpr otocol
C: Rigor oust wo- phasel ockingprotocol
D: Timest ampor deringpr otocol
Q.no56.Af unct i
onaldependencyoft heform x—>yi str
ivalif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no57.Dupl i
cat ionofdat aatsev er
alplacesi sknownas_ ___
A: Concur rentaccessanomal ies
B: Dat ai solation
C: Dat ai nconsi stency
D: Dat ar edundancy
Q.no58.I fever ynon- keyat tri
buteisfunctionall
ydepedentpr imarykey,
thent he
rel
at i
onwi l
lbei n_ ____________.
A: Fir
stnor mal form
B: Secondnor mal f
orm
C: Thir dNor mal form
D: Fourthnor mal form
Q. no59.Whi choft hef ol
lowi ngi snottr
uef orNor mali
zati
on?
A: Remov esr edundancy
B: Remov esi nser ti
onanomal y
C: Decomposest her el at
ion
D: Quer yexecut ionbecomesf aster
Q. no60.Af tert hef i
nalst at ementofat ransactionhasbeenexecuted,a
transact ionent er sina_ _
_ ______state.
___ __
_ _
.
A: Active
B: aborted
C: Commi t
ted
D: Partial
lycommi tted
Q. no1.Al laggr egat ef unct i
onsexcept_ ____ignorenul
lvaluesint
heir
i
nput
col l
ect i
on.
A: Count (attri
but e)
B: Count (*)
C: Av g
D: Sum
Q. no2.Toappl yt heaggr egat efuncti
on, toagr oupofsetof
tupl es____ _
_ _clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q. no3.Theconcept ualmodeli s______
___ .
A: Dependentonhar dwar e
B: Dependentonsof t ware.
C: Dependentonbot hhar dwar eandsoftwar e
D: Independentofbot hhar dwar eandsof tware
Q. no4.Whi choneoft hef oll
owi nguniquelyidentifi
est
heel ement
sinthe
relat i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q. no5.I nE- Rdi agr am gener alizati
onisr epresentedby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no6.Theuser swhouseeasy -to-usemenuar ecall
ed
A: Sophi st i
cat edenduser s
B: Naï veuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no7.Rel at ionalcal culusisa:
A: Procedur al language
B: Non- Pr ocedur al language
C: Dat adef initionl anguage
D: Highl ev el language
Q.no8.Whent hechangescausedbyanabor tedt r
ansact
ionhavebeen
undone,
thet r
ansact ioni ssai dt obe___
___ _
_ _.
A: Failed
B: commi tted
C: part i
allycommi tted
D: roll
edback.
Q.no9.I fBi sanat tributeandA→B, ThenBissaidtobe_ __
____
_byA.
A: Logi callyi mpl ied
B: Funct ional l
yi mpl ied
C: Logi callydet ermi ned
D: Funct ional l
ydet ermi ned
Q.no10.Hi er ar chi calmodeli salsocal l
ed_
________
.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Nor mal izeSt ruct ur e
D: Tabl eSt r uct ure
Q.no11.Tor emov ear elat
ionf
rom anSQLdat abase,weusethe____
__
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no12.Dat ar edundancymayl eadt o:
A: Dat aint egr ity
B: Atomi ci typr obl em
C: Dat ai nconsi stency
D: Dat aabst ract ion
Q.no13.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ter nar yOper at or
C: Binar yOper ator
D: Notanoper at or
Q.no14.Thedat abaseenv i
ronmenthasal lofthefoll
owingcomponent
s
except __ __ __ __
A: User s.
B: Separ at ef i
les
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no15.I nSQL‘ r elationAcont ainsr el
ati
onB’ canbewritt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: exist sAexceptB
Q.no16.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -lef tappr oach
D: Treest ruct ure
Q.no17.Sel ect*f rom empl oyeeWhatt ypeofstatementisthi
s?
A: DML
B: Integr i
t yconst r aint
C: DDL
D: View
Q.no18.Asubschemaexpr esses_ ____
____.
A: Thel ogi cal v iew
B: Thephy sical view
C: Theext er nal v iew
D: Thei nter nal view
Q.no19.Aggr egat ef unct i
onsar ef uncti
onsthattakea_______
___
_as
i
nputand
ret
ur nasi ngl ev alue.
A: Col l
ect ionofv al ues
B: Singl ev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no20.Theov eralldescr iptionofadat abasei scalled____
__.
A: Dat ai ntegr it
y
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef initi
on
Q.no21.Whi choft hef oll
owi ngat t
ri
butecanbef ur
therdivi
dedinto
subpar t
s
A: Simpl eat tri
but e
B: Mul ti
v aluedat tri
but e
C: Composi teat t
ribut e
D: Der ivedat tri
bute
Q.no22.Whi choneoft hefol lowingisnott rueforav i
ew:
A: Viewi sder iv
edf rom ot hert ables
B: Viewi sav i
rt
ual tabl e.
C: Av iewdef i
niti
oni spermanent l
ystoredaspar toft hedatabase.
D: Viewnev ercont ai nsder i
v edcol umns.
Q.no23.Keyt or epr esentr elat i
onshipbetweent abl
esi scall
ed
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no24.The_ __ ___connect i
v eisusedt ot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no25.Whi choft hef oll
owi ngshoul dbeusedt ofindt hemeanofthe
salary?
A: Mean( salary)
B: Avg( sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no26.Whi chSQLQuer yi suset oremov eat ableandal li
tsdatafr
om
the
database?
A: Creat eTabl e
B: AlterTabl e
C: Dr opTabl e
D: Remov eTabl e
Q.no27.Whi chnor malf ormisconsi deredadequat eforrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no28.Thecol lectionofinterr
elateddat aiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no29.At ablej oinedwi thit
selfiscalledas_ _
______
A: Joi n
B: Sel fJoi n
C: Out erJoi n
D: Equi Join
Q.no30.Whati sar elati
onshi
pcal l
edwheni tismaintainedbetweent
wo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no31.Whi choft hef oll
owingaret hepr opert
iesofent i
ti
es?
A: Gr oups
B: Tabl e
C: At tri
but es
D: Swi tchboar ds
Q.no32._ ___ ___pr oducest herel
ationt hathasattri
butesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Pr oduct
D: Intersect ion
Q.no33.I fev erynon- keyatt
ri
buteisf unctional
lydependentont he
pri
mar ykey ,
ther elationwi l
lbei n______
_
A: FirstNor mal Form
B: SecondNor mal Form
C: ThirdNor mal Form
D: Four t
hFor mal Form
Q.no34.Thet erm_ _
_ ____isusedt or ef
ert oar ow.
A: Attr
ibut e
B: Tuple
C: Fiel
d
D: Instance
Q.no35.Af unct i
onaldependencyi sar elationshipbetweenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q.no36.Thenat uralj
oi nisequalt o:
A: Cartesi anPr oduct
B: Combi nat ionofUni onandCar tesi
anpr oduct
C: Combi nat ionofsel ectionandCar tesianpr oduct
D: Combi nat ionofpr ojectionandCar tesianpr oduct
Q.no37.Whi choft hef ollowingenabl esust oviewdatafrom at
abl
e
basedona
specifi
ccr iterion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no38.whi choft hef oll
owi ngisnotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relationshi ps
D: Repor ts
Q.no39.Cust omerwi thdrawingmoneyf r
om ATM i sanexample
of________ __
A: Appl i
cat ionpr ogrammer
B: Naïveuser
C: Special izeduser
D: Sophi sticat eduser
Q.no40.A_ __ ___
__inat ablerepresentsar elat
ionshi
pamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no41.Whi choft hefoll
owingisnotModif
icati
onoft heDatabase
A: Deletion
B: I
nser tion
C: Sorting
D: Updat ing
Q.no42.Whi choft hefoll
owingisanunaryoperation?
A: Select i
onoper at i
on
B: Gener alizedsel ecti
on
C: Pri
mi tiveoper at i
on
D: Project i
onoper ati
on
Q.no43.Themet hodofaccesswhi chuseskeyt r
ansf ormat
ionisknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent ial
Q.no44.I nt he_ _
_ _____
__normalform,acomposi teat t
ri
but
ei sconver
ted
to
i
ndividualat tri
butes.
A: Fi
rst
B: Second
C: Third
D: Fourt h
Q.no45.TheRDBMSt erminologyf
orar owis_
_ __
_ ___
.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no46.Af uncti
ont hathasnopar t
ialf
unct
ionaldependenciesi si
n
_______f orm:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no47.Theempl oyeesalar
yshouldnotbegr eaterthanRs.2000.Thisis
_______
A: i
nt egrit
yconst r
ai nt
B: referential const rai
nt
C: over -
def i
nedconst raint
D: feasibleconst raint
Q. no48.NULLi s__ ___
_ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f orintegerandbl ankf orchar act
er
D: Notav al ue
Q. no49.I none- to-manyr elationshipt hetabl eon'many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q. no50.Whi choft hef oll
owi ngf i
eldshaswi dt
hof8by t
es?
A: Memo
B: Number
C: Dat e/ti
me
D: Hy perli
nk
Q. no51.Amongstt heACI Dpr opertiesofat ransacti
on,the'
Durabi
lit
y'
proper ty
requi res.thatt hechangesmadet ot hedat abasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsy stem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, ev enift hereisaf ail
ureofanyki nd
Q. no52.I nt he_ _________nor malf or m,acomposi teattr
ibut
eisconvert
ed
to
i
ndi v i
dualat tributes
A: First
B: Second
C: Thi r
d
D: Four th
Q. no53.Whi choft hef oll
owi ngisnotapr opertyofat r
ansacti
on?
A: Atomi city
B: Consi stency
C: Integrit
y
D: Durabi lity
Q.no54.Doesi ndext akespacei nt hedisk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no55.I nther elationalmodel ,thenumberofat tr
ibutesandnumberof
tuples
i
riar elationar et ermedas_ _________
and_ _______
______respecti
v el
y
A: Cardi nal i
ty,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Cardi nal i
ty,degr ee
Q.no56.Ther esul toft heUNI ONoper ationbetweenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q.no57.Consi dert hef oll
owi ng
S1:For eignkeyal l
owsnul lvalues.
S2:Ev erybi naryt abl esi sinBCNF
Whi choft hef ol l
owi ngi strue?
A: BothS1andS2ar etrue
B: S1ist rue
C: S2i st rue
D: BothS1andS2ar efalse
Q.no58.At ablehasf ieldsF1, F2, F3, F4,F5wi t
hthef ol
lowi ngfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,
F2)—>F5
I
nt ermsofnor mal izat i
on,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no59.Whi choft hef oll
owi ngoper ati
oni susedifwear einter
estedin
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q.no60.At abl
eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor malForm( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngleattri
butekey
D: Hav eacomposi tekey
Q.no1.Thi skeyt hatuniquelyident
ifi
eseachrecor
discall
ed
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no2.Adat adicti
onar yisareposit
orythatmanages_____
A: Memor y
B: Met adata
C: Spel lChecker
D: Dat aVal idator
Q.no3.A‘ book’ i
sa_ _______
_typeofentit
y.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no4.I nanEnt i
ty-Relati
onshipDiagram “
Diamonds”
represent s_ ___
_ _
_ _
_ __
_______
A: Attributes
B: Mul ti-
valuedat tr
ibutes
C: Weakent it
yset
D: Rel ati
onshi psets
Q.no5.Whoi smor econcernedaboutt heconcept
uall
eveloftheDBMS
A: TheSy stemspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no6.Thebasi cdat at ypechar (
n)isa_ _
___l engthcharacterstr
ingand
varchar (n)i s_ ____lengt hchar acter
A: Fixed, equal
B: Equal ,v ariabl e
C: Fixed, v ariabl e
D: Var i
abl e, equal
Q.no7.E- Rmodelusest hissy mbolt orepresentweakent it
yset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout li
nedr ect angle
D: Dot teddi amond
Q.no8.Whati sACI Dpr oper t
iesofTr ansactions?
A: Atomi city, Consi stency ,Isolati
on,Database
B: Atomi city, Consist ency ,I
sol ati
on,Durabili
ty
C: Atomi city, Consi stency ,Inconsistent,
Dur abili
ty
D: Aut omat ical l
y,Concur rency ,I
solati
on,Dur abil
it
y
Q.no9.I nwhi chst ateonegat hersandl istallthenecessar yfi
eldsfort
he
database
designpr oj ect .
A: Dat aDef inition
B: Dat aRef inement
C: Establ ishi ngRel ationshi p
D: Dat adel etion
Q.no10.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul tiv alueddependency
D: Funct ional dependency
Q.no11.Whi choft hef ollowingi sthest r
uct ur
eoft heDat abase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no12.Fort hegi vensetoff unct i
onaldependencyF, it
’sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no13.Dat aMani pul at i
onLanguage( DML)i snott o___
___
A: Creat ei nformat i
ont ableint heDat abase
B: I
nser tionofnewi nf ormat ioni ntotheDat abase
C: Delet i
onofi nfor mat i
oni nt heDat abase
D: Modi f i
cat i
onofi nf ormat ioni ntheDat abase
Q.no14.I nE- RDi agr am der i
v edat tr
ibutear er epresentedby___
___
__.
A: El
lipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no15.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no16.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper at or
C: Binar yOper ator
D: Notanoper ator
Q.no17.I nE- Rdi agr am gener al i
zati
oni sr epresent edby
A: El
lipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no18.Theuser swhouseeasy -
to-usemenuar ecall
ed
A: Sophi st i
catedenduser s
B: Naï v
euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no19.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -
lef tapproach
D: Treest ructure
Q.no20.Whi choneoft hef ollowi ngisnott ruef orav i
ew:
A: Viewi sder ivedf rom ot hert ables
B: Viewi sav ir
tual table.
C: Av iewdef i
nitioni sper manent lyst oredaspar tofthedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no21.Whi choft hef oll
owi ngshoul dbeusedt ofindthemeanoft he
salary?
A: Mean( sal ar y)
B: Avg( sal ary )
C: Sum( sal ary )
D: Count (sal ary)
Q.no22.Whent hechangescausedbyanabor t edtransacti
onhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ __
__ ____.
A: Failed
B: commi tted
C: partiallycommi tted
D: roll
edback.
Q.no23.Toappl yt heaggr egatef unct i
on,toagr oupofsetof
tuples_ ____ __ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no24.Car tesi anpr oductinr elationalalgebr
ai s:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no25.I fBi sanat tributeandA→B, ThenBissai dtobe_ _____
__byA.
A: Logi callyi mpl i
ed
B: Funct ional l
yi mpl i
ed
C: Logi callydet ermi ned
D: Funct ional lydet ermi ned
Q.no26.Whi chSQLQuer yisuset oremov eatableandal li
tsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no27._ _ _____producestherel
ationthathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect i
on
Q.no28.Whi chofthefoll
owingaret heproperti
esofent i
ti
es?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no29.Af uncti
onaldependencyisar elat
ionshipbetweenoramong:
A: Tabl es
B: Rows
C: Relat i
ons
D: Attributes
Q.no30.Af i
lemani pul
ati
oncommandt hatextr
actssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no31.Whi chnamemustbeuni quewi thi
nadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no32.Rel ati
onalAlgebrais
A: Dat aDef i
nit
ionLanguage
B: Met aLanguage
C: Procedur alqueryLanguage
D: Dat aMani pulat
ionLanguage
Q.no33.Whati sar el
ati
onshi
pcalledwheni ti
smai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nary
D: Quat ernar y
Q.no34.Whi chnor malf ormisconsi der
edadequat eforr elati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no35.Funct ionalDependenciesar ethetypesofconst r
aintst hatare
based
on______
A: Key
B: Keyr evisited
C: Super setkey
D: Tuple
Q.no36.Whi choft hefollowingintrueregardingRef erent i
alIntegrit
y?
A: Everypr imar y-
keyvaluemustmat chapr i
mar y-keyv alueinan
associatedt able
B: Everypr imar y-
keyvaluemustmat chaf orei
gn-keyv aluei nanassoci ated
table
C: Everyf orei gn-keyval
uemustmat chapr i
mar y-
keyv aluei nan
associatedt able
D: Everyf orei gn-keyval
uemustmat chaf or
eign-keyv alueinanassoci at
ed
table
Q.no37.I ndomai nrel
at i
onalcalcul
uswecr eateav ariablef or
every____ ____
A: Row
B: Column
C: Table
D: Attr
ibut e
Q.no38.Mi nimalSuper keysarecalled
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attr
ibut ekey s
Q.no39.Thecol l
ecti
onofi nter
relat
eddat aiscal l
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst r acti
on
Q.no40.Whi choft hefollowingisNotaRel at
ion-algebraOperati
on
A: Sel ect
B: Uni on
C: Rename
D: Dr opt able
Q.no41.I feverynon- keyat tr
ibut
eisfuncti
onall
ydependentont he
pri
mar ykey ,
ther elat ionwi llbei n_______
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal Form
Q.no42.I nSQLt hest atementsel ect*f
rom R,
Sisequi valentt
o_____
__.
A: Sel ect*f rom Rnat uraljoinS
B: Sel ect*f rom Rcr ossjoinS
C: Sel ect*f rom Runi onjoinS
D: Sel ect*f rom Ri nnerjoinS
Q.no43.Thet er m_ ______isusedt orefert
oar ow.
A: At tri
but e
B: Tupl e
C: Field
D: Inst ance
Q.no44.The_ _____ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: St r
uct ure
D: Pr i
mar ykey
Q.no45.At ablejoinedwi thitsel
fiscall
edas________
A: Joi n
B: Sel fJoi n
C: Out erJoi n
D: Equi Join
Q.no46.Whi choft hefollowingisnotal ev
elofdat aabst r
act
ion?
A: Phy sical Lev el
B: Cr i
tical Level
C: Logi cal Level
D: ViewLev el
Q.no47.Theempl oyeesal aryshouldnotbegreatert hanRs.2000.Thi
sis
______ _
A: i
ntegr ityconst raint
B: refer ent ialconst raint
C: over -def inedconst raint
D: feasi bl econst raint
Q.no48.Thenat ur al joini sequalt o:
A: Car tesi anPr oduct
B: Combi nat i
onofUni onandCar tesi
anpr oduct
C: Combi nat i
onofsel ect ionandCar t
esi anpr oduct
D: Combi nat i
onofpr oj ectionandCar tesianpr oduct
Q.no49.Af unct i
ont hathasnopar ti
alfunct i
onaldependenciesi
sin
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no50.Whi choft hef ollowingi sanunar yoper ati
on?
A: Select ionoper ation
B: Gener al i
zedsel ect ion
C: Primi ti
v eoper at ion
D: Proj ect ionoper at ion
Q.no51.I far elationi si nBCNF, t
heni tisal soin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no52.Dupl i
cat ionofdat aatsev er
alpl acesi sknownas_ ___
A: Concur rentaccessanomal ies
B: Dat ai sol ation
C: Dat ai nconsi stency
D: Dat ar edundancy
Q.no53.The_ ____ ___ _pr otocolensur esf reedom f r
om deadlock.
A: Two- phasel ocki ngpr ot ocol
B: Strictt wo- phasel ocki ngpr otocol
C: Rigor oust wo- phasel ockingpr otocol
D: Timest ampor der ingpr otocol
Q.no54.I fev er ynon- keyat t
ributeisfunct ionall
ydepedentpr i
marykey
,
t
hent he
rel
at i
onwi l
lbei n_ __ __ ____ ___
_ .
A: Fir
stnor mal form
B: Secondnor mal for m
C: ThirdNor mal f or m
D: Four thnor mal for m
Q. no55._ ______al lowust oident if
yuni quel yat upleint her el
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q. no56.Cr eat et abl eempl oy ee( namev archar,idinteger )Whatt ypeof
stat ement
i
st his?
A: DML
B: DDL
C: View
D: Integr i
tyconst raint
Q. no57.Whi char et hetwoway si nwhi chent it
iescanpar ti
cipateina
relat i
onshi p?
A: Passi v eandact i
v e
B: Tot alandpar tial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q. no58.Af tert hef inalstatementofat r ansact i
onhasbeenexecut ed,
a
transact ionent er si na_ ________st ate._______.
A: Act i
v e
B: abor ted
C: Commi tted
D: Par ti
allycommi tted
Q. no59.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eates______
A: Par ent -
Chi l
dr el ationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elat i
onshipbet weent het ablesthatconnectt hem.
C: Net wor kmodel bet weenthet ablest hatconnectt hem.
D: Manyt ooner elat i
onshipbet weent het ablest hatconnectt hem.
Q. no60.Af unct ionaldependencyoft hef orm x—>yi strivalif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no1.I nSQL‘ r elat ionAcont ai
nsr el
ationB’ canbewr i
t tenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi st sAexceptB
D: existsAexceptB
Q.no2.Asubschemaexpr esses__
_ _
__ _
__ .
A: Thel ogical v i
ew
B: Thephy si cal view
C: Theext ernal view
D: Thei nter nal v
iew
Q.no3.Adat adi cti
onar yisar eposit
oryt hatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idat or
Q.no4.Thedat abaseenv ir
onmenthasal loft hefoll
owingcomponent
s
except __ ___ ___
A: User s.
B: Separ atef i
les
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no5.E- Rmodelusest hissymbolt orepr esentweakent i
tyset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout linedr ectangl e
D: Dot teddi amond
Q.no6.Rel at ionalcal cul usisa:
A: Procedur al language
B: Non- Pr ocedur allanguage
C: Dat adef initionl anguage
D: Highl ev el l
anguage
Q.no7.I nanEnt ity-RelationshipDiagram “Di amonds”
represent s_ ___ ________ _
_ ____
A: Attribut es
B: Mul ti-valuedat tr
ibutes
C: Weakent ityset
D: Relat ionshi pset s
Q.no8.Whi choft hef oll
owi ngattr
ibutecanbef ur
therdiv
idedint
o
subpar ts
A: Simpl eat tribut e
B: Mul tivaluedat tri
bute
C: Composi teat t
r i
bute
D: Der ivedat tr
ibut e
Q.no9.Whi choneoft hefoll
owi nguniquelyidenti
fi
est heelementsinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: For eignkey
D: Composi tekey
Q.no10.Theconcept ualmodeli s______
_ _
_.
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof tware
D: Independentofbot hhar dwareandsof t
war e
Q.no11.Keyt or epresentr el
ationshipbetweent ablesiscalled
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no12.Dat ar edundancymayl eadto:
A: Dat ai nt egr i
ty
B: Atomi ci typr obl em
C: Dat ai nconsi st ency
D: Dat aabst ract i
on
Q.no13.Thebasi cdat atypechar (n)isa_ __
__lengthchar acterst
ri
ngand
varchar (n)i s_ ___ _lengthchar acter
A: Fixed, equal
B: Equal , var iable
C: Fixed, var iable
D: Var iabl e, equal
Q.no14.Theov eralldescript
ionofadat abaseiscal l
ed______.
A: Dat ai nt egr i
ty
B: Dat amani pulat i
on
C: Dat abaseschema
D: Dat adef i
ni t
ion
Q.no15.Whoi smor econcer nedaboutt heconcept uallev
eloft heDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no16.The_ ___ __connect i
vei susedt ot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no17.Al laggr egat efunctionsexcept_ _ ___ignorenul
lval
uesinthei
r
i
nput
coll
ect ion.
A: Count ( attribut e)
B: Count ( *)
C: Av g
D: Sum
Q.no18.I nwhi chst at eonegat hersandl istallthenecessar
yfiel
dsfort
he
databasedesi gnpr oj ect.
A: Dat aDef inition
B: Dat aRef inement
C: Establ ishi ngRel ationship
D: Dat adel etion
Q.no19.Hi er ar chicalmodeli sal socalled_ ________
.
A: Treest ruct ur e
B: PlexSt ruct ur e
C: Nor mal i
zeSt r
uct ur e
D: Tabl eSt ruct ure
Q.no20.Whati sACI Dpr opertiesofTr ansact i
ons?
A: Atomi city, Consi st ency,I
solation,Database
B: Atomi ci ty, Consi st ency,I
solation,Durabi li
ty
C: Atomi city, Consi st ency,I
nconsi stent
, Dur abil
it
y
D: Aut omat ical l
y ,Concur rency,Isolati
on, Dur abil
i
ty
Q.no21.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul tiv alueddependency
D: Funct ional dependency
Q.no22.Aggr egat ef unctionsar ef uncti
onst hattakea_ _
____
_____as
i
nputand
ret
ur nasi ngl ev alue.
A: Collect ionofv alues
B: Singlev alue
C: Aggr egatev al
ue
D: Tabl es
Q.no23.Sel ect*f r
om empl oyeeWhatt ypeofst at
ementi sthi
s?
A: DML
B: Integr i
tyconstr
aint
C: DDL
D: View
Q.no24.Tor emov ear el
ati
onf rom anSQLdat abase,weuset he_____
_
command.
A: Del ete
B: Pur ge
C: Remov e
D: Dropt abl
e
Q.no25.Thi skeyt hatuniquelyidenti
fi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no26.I nthe_ ______
___normalf orm,acomposi teattr
ibut
eisconverted
to
i
ndi vi
dualat tri
butes.
A: First
B: Second
C: Thi rd
D: Four th
Q.no27.Whi choft hefol
lowingf i
eldshaswi dt
hof8by t
es?
A: Memo
B: Number
C: Dat e/time
D: Hy per l
ink
Q.no28.A_ _______inatablerepresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no29.I none- t
o-manyr el
ationshipthetableon'many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Si
st er
D: Child
Q.no30.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of______ ____
A: Appl icationpr ogrammer
B: Naïv euser
C: Speci alizeduser
D: Sophi st
icateduser
Q.no31.TheRDBMSt erminologyforarowis___ _____
.
A: Tupl e.
B: Relat i
on.
C: Attri
but e.
D: Degr ee.
Q.no32.Whi choft hef oll
owingarethepropertiesofent i
ties?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no33.Themet hodofaccesswhi chuseskeyt ransformationisknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent ial
Q.no34.NULLi s_____
_ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharact
er
C: Thesameas0f orintegerandblankforcharacter
D: Notav alue
Q.no35.Whi choft hef oll
owingenablesustov iewdat af r
om at abl
e
basedona
specificcr iterion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no36.Whi choft hef oll
owingisnotModi f
icationoft heDat abase
A: Delet ion
B: I
nser t i
on
C: Sor ti
ng
D: Updat i
ng
Q.no37.whi choft hef oll
owingisnotadat abaseobj ect?
A: Tabl es
B: Quer ies
C: Rel ati
onshi ps
D: Repor t
s
Q.no38.Af unct ionaldependencyi sar elationshipbetweenoramong:
A: Tabl es
B: Rows
C: Rel ati
ons
D: At tri
butes
Q.no39.Whi chSQLQuer yisuset oremov eat ableandal li
tsdataf
rom
the
database?
A: Cr eateTabl e
B: AlterTabl e
C: Dr opTabl e
D: Remov eTabl e
Q.no40._ _ _
_ ___pr oducest herelat
iont hathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Pr oduct
D: Intersection
Q.no41.I fev erynon- keyattr
ibutei
sf uncti
onal l
ydependentont he
pri
mar ykey ,
ther elati
onwi llbei n_______
A: FirstNor mal Form
B: SecondNor mal For m
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no42.Thecol lectionofi nt
errel
ateddat aiscalledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no43.Thet erm_ ______isusedtor efertoar ow.
A: At tr
ibute
B: Tupl e
C: Field
D: Instance
Q.no44.The_ _____ ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no45.I nSQLt hest atementsel ect*
from R,Sisequivalentto__
_ _
___
.
A: Select*f rom Rnat uraljoinS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no46.Whi chnor malf or mi sconsideredadequat eforr el
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no47.Rel ati
onalAl gebr ais
A: Dat aDef i
nit
ionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: Dat aMani pulationLanguage
Q.no48.Whi choft hef ollowingi sNotaRel ati
on-algebraOper at
ion
A: Select
B: Uni on
C: Rename
D: Dropt able
Q.no49.Funct ionalDependenci esar ethetypesofconst rai
ntsthatare
based
on__ ____
A: Key
B: Keyr evisi
ted
C: Super setkey
D: Tupl e
Q.no50.Theempl oy eesal aryshoul dnotbegr eat
ert hanRs.2000.Thisis
_______
A: i
nt egr i
tyconst raint
B: referent ial const rai
nt
C: over -
def i
nedconst raint
D: feasibl econst raint
Q.no51.Whi choft hef oll
owingisnotapr opert
yofat ransaction?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur ability
Q.no52.I nt her elat i
onalmodel ,thenumberofat tr
ibutesandnumberof
tuples
i
riar elationar et ermedas_ _____
_ ___
and_ ______
_______respecti
vel
y
A: Car dinal i
ty ,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Car dinal i
ty ,degr ee
Q.no53.Doesi ndext akespacei nt hedisk?
A: Indexesar enev erst oredondisk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est or edondisk
Q.no54.Whi choft hef oll
owingoper ati
oni susedifwear eint
erest
edi
n
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q.no55.Ther esul toft heUNI ONoper ationbetweenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: Allthet upl esofR1
B: Allthet upl esofR2
C: Allthet upl esofR1andR2
D: Allthet upl esofR1andR2whi chhav ecommoncol umns
Q.no56.Whi choft hef oll
owingisnott rueforNormal i
zat i
on?
A: Remov esr edundancy
B: Remov esi nser ti
onanomal y
C: Decomposest her elati
on
D: Quer yexecut ionbecomesf aster
Q. no57.Amongstt heACI Dpr oper t
iesofat r
ansact
ion,
the'Durabi
li
ty'
proper t
y
requi res.t hatt hechangesmadet othedatabasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni fthereisaf ail
ureofanykind
Q. no58.Consi derthef oll
owi ng
S1:For eignkeyal l
owsnul lvalues.
S2:Ev erybi nar ytablesi sinBCNF
Whi choft hef oll
owi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i strue
C: S2i st r
ue
D: Bot hS1andS2ar efalse
Q. no59.I far elationisi nBCNF, t
henitisalsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no60.Af unctionaldependencyoft heform x—>yi str
ivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no1.A‘ book’ isa_ ________typeofent i
ty.
A: concept ual
B: concr ete
C: real
D: abst r
act
Q. no2.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A: Sophi sticatedenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q. no3.Whi choft hef ol
lowi ngi sthestr
uctureoftheDatabase?
A: Tabl e
B: .Schema
C: Rel ati
on
D: Struct ure
Q.no4.Fort hegi vensetoff uncti
onaldependencyF, i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no5.I fBi sanat tr
ibuteandA→B, ThenBi ssai
dt obe_ ___
____byA.
A: Logi callyi mpl ied
B: Funct ional l
yimpl i
ed
C: Logi callydet ermi ned
D: Funct ional l
ydet ermined
Q.no6.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ter naryOper ator
C: Binar yOper ator
D: Notanoper ator
Q.no7.Car tesianpr oductinr el
ati
onalalgebrais:
A: aUnar yoper ator
B: aBi nar yoper at or
C: aTer nar yoper ator
D: notdef ined
Q.no8.I nE- Rdi agr am gener ali
zati
onisrepresentedby
A: Elli
pse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no9.Whi choft hef oll
owingshouldbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary )
B: Av g(sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no10.Dat aMani pulationLanguage( DML)i snotto____
__
A: Creat ei nf ormat i
ont ableintheDatabase
B: Inser t
ionofnewi nformat i
onintotheDatabase
C: Del eti
onofi nfor mat i
oni ntheDatabase
D: Modi f i
cationofi nformat i
oni ntheDat abase
Q.no11.Toappl ytheaggr egat efunction,
toagr oupofsetof
tuples_ ______ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no12.Whent hechangescausedbyanabor t
edt ransacti
onhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ _______
_ .
A: Failed
B: commi tt
ed
C: partiallycommi t
ted
D: roll
edback.
Q.no13.E- Rmodel ingt echni queis:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -
leftappr oach
D: Treest ructur e
Q.no14.Whi choneoft hef ollowingisnott r
uef orav iew:
A: Viewi sder iv edf rom ot hert ables
B: Viewi sav irtualtabl e.
C: Av iewdef ini ti
oni sper manent l
ystoredaspar toft hedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no15.I nE- RDi agram der ivedat tr
ibutearerepr esentedby______
__.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no16.Whatdoy oumeanbyonet omanyr elationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no17.I nwhi chst at eonegat hersandl i
stallthenecessar yfi
eldsfort
he
databasedesi gnpr oject .
A: Dat aDef initi
on
B: Dat aRef inement
C: Est ablishi ngRel ationship
D: Dat adel etion
Q.no18.Hi erarchicalmodeli salsocal l
ed_________.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt ructure
D: Tabl eSt ructure
Q.no19.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no20.Thebasi cdat atypechar (n)isa_ ____lengt
hcharacterst
ri
ngand
varchar (
n)i s_ ___ _lengthchar acter
A: Fixed, equal
B: Equal , variable
C: Fixed, v ariable
D: Var iable, equal
Q.no21.Adat adi ctionaryisar epositorythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idator
Q.no22.Theconcept ualmodeli s________
_ .
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof t
war e
D: Independentofbot hhar dwareandsof t
war e
Q.no23.The_ _
__ __connect i
veisusedt ot estforabsenceofset
member shi p.
A: except
B: exist s
C: noti n
D: in
Q.no24.Dat ar edundancymayl eadt o:
A: Dat ai ntegr it
y
B: Atomi citypr oblem
C: Datainconsi stency
D: Dataabst racti
on
Q.no25.Whati sACI Dpr opertiesofTr ansact i
ons?
A: Atomi ci
ty,Consi stency ,I
solation,Dat abase
B: Atomicity,Consi stency ,I
solation,Dur abil
ity
C: Atomi ci
ty,Consi stency ,I
nconsi stent,Dur abil
ity
D: Automat icall
y,Concur rency,Isolation,Dur abi
lit
y
Q.no26.Whi chSQLQuer yi suset or emov eat ableandallitsdat
afr
om
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no27.TheRDBMSt ermi nologyf orar owi s______
__.
A: Tuple.
B: Relati
on.
C: Attri
bute.
D: Degree.
Q.no28.Mi nimalSuper key sar ecal l
ed
A: Schemakey s
B: Candidatekey s
C: Domai nkey s
D: Attri
butekey s
Q.no29.I nt he_ _________nor malf or m, acomposi teat
tri
buteisconver
ted
to
i
ndividualat tr
ibutes.
A: Fi
rst
B: Second
C: Third
D: Fourth
Q.no30.Whi choft hef ollowingar et hepr oper t
iesofenti
ties?
A: Groups
B: Table
C: Attri
butes
D: Switchboar ds
Q.no31.NULLi s__ __
_ _____.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f orint egerandblankforchar act er
D: Notav alue
Q.no32.Cust omerwi thdrawingmoneyf r
om ATM i sanexampl e
of_ _______ _
_
A: Applicationpr ogr ammer
B: Naïveuser
C: Special i
zeduser
D: Sophi sti
cat eduser
Q.no33.Themet hodofaccesswhi chuseskeyt ransf ormat i
oni sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent ial
Q.no34.Af i
lemani pulat i
oncommandt hatext ract ssomeoft herecords
from a
fil
ei scal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no35.I ndomai nr el
at i
onalcalcul
uswecr eateav ariablef or
ev ery____ ____
A: Row
B: Column
C: Table
D: Attr
ibut e
Q.no36.Whi choft hefol l
owingintrueregardingRef erentialIntegri
ty?
A: Everypr imar y-
keyv aluemustmat chapr i
mar y-keyv alueinan
associ atedt abl e
B: Everypr imar y-
keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
tabl e
C: Everyf oreign-keyv aluemustmat chapr i
mar y-keyv aluei nan
associ atedt abl e
D: Everyf oreign-keyv aluemustmat chaforeign- keyv alueinanassoci ated
tabl e
Q.no37.Af unctiont hathasnopar ti
alf
unct ionaldependenci esisin
___ ____for m:
A: 1NF
B:2NF
C:3NF
D:BCNF
Q.
no38.At abl ej
oi nedwi thitsel
fiscalledas_ _____
__
A:Join
B:SelfJoi n
C:Out erJoi n
D:Equi Joi n
Q.
no39.Whi chnamemustbeuni quewi t
hinadat abase?
A:Tabl e
B:Fi
el d
C:Recor d
D:Char act er
Q.
no40.Thenat ural joinisequalto:
A:Car tesi anPr oduct
B:Combi nat ionofUni onandCar tesianpr oduct
C:Combi nat ionofsel ecti
onandCar t
esianpr oduct
D:Combi nat ionofpr ojecti
onandCar t
esianpr oduct
Q.
no41.Whi choft hef oll
owingfieldshaswi dthof8by t
es?
A:Memo
B:Number
C:Dat e/ ti
me
D:Hy per li
nk
Q.
no42.Whi choft hef oll
owingisnotal evelofdataabstract
ion?
A:Phy sical Lev el
B:Criti
cal Lev el
C:Logi cal Lev el
D:ViewLev el
Q.
no43.Whi choft hef oll
owingisanunar yoper at
ion?
A:Select ionoper ation
B:Gener alizedsel ection
C:Primi tiveoper at i
on
D:Project i
onoper ation
Q.
no44.whi choft hef oll
owingisnotadat abaseobj ect
?
A:Tabl es
B:Quer ies
C:Relat ionshi ps
D:Repor ts
Q.
no45.Af unct i
onaldependencyi sar elationshipbetweenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q.no46.Whi chofthef ollowingenablesust ov i
ewdat af r
om atabl
e
basedona
specificcr i
teri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no47.A_ _____
__i nat ablerepresentsarelati
onshi
pamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no48.Whi chofthef ollowingisnotModi fi
cationoftheDatabase
A: Deletion
B: Inserti
on
C: Sorting
D: Updat ing
Q.no49.I none-to-manyr el
ationshi
pt het
ableon' many 'si
deiscall
edas:
A: Parent
B: Mast er
C: Sister
D: Child
Q.no50.Whati sar elationshipcal l
edwheni tismaintainedbetweentwo
entiti
es?
A: Unar y
B: Binary
C: Ternar y
D: Quat ernary
Q.no51.At abl
eont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal For m( 2NF)
B: Bei nThi r
dNor mal Form( 3NF)
C: Hav easi ngleattri
but ekey
D: Hav eacomposi tekey
Q.no52.Af terthef inalstat ementofat ransact i
onhasbeenexecut ed,
a
tr
ansact ionent ersi na_ __ ___ ___st at
e.___ ____.
A: Act ive
B: abor ted
C: Commi tted
D: Par ti
al l
ycommi t
ted
Q.no53.Apr imarykeyi scombi nedwi t
haf oreignkeycr eates_ __
___
A: Par ent -
Chi l
drelationshi pbet weent het abl est hatconnectt hem
B: Manyt omanyr elationshi pbet weent het ablesthatconnectt hem.
C: Net wor kmodel betweent het ablesthatconnectt hem.
D: Manyt ooner elat i
onshi pbet weent het ablest hatconnectt hem.
Q.no54.I nt he_ ____ _
__ _
_nor malf orm, acomposi t
eat t
ri
butei sconvert
ed
to
i
ndiv i
dualat tri
butes
A: Fir
st
B: Second
C: Thir d
D: Four th
Q.no55.The_ _____ ___protocolensur esf reedom f r
om deadl ock.
A: Two- phasel ockingpr ot ocol
B: Strictt wo- phasel ockingpr otocol
C: Rigor oust wo-phasel ocki ngpr otocol
D: Timest ampor deringpr ot ocol
Q.no56.Whi choft hef ollowi ngi snotapr oper tyofat ransact i
on?
A: Atomi city
B: Consi stency
C: Integr it
y
D: Dur abi l
ity
Q.no57.Cr eatetabl eempl oy ee( namev ar char,idinteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q.no58.Dupl i
cationofdat aatsev eralpl acesi sknownas_ __ _
A: Concur rentaccessanomal ies
B: Dat ai solat i
on
C: Dat ainconsi stency
D: Dat ar edundancy
Q.no59._ ___ ___al l
owust oidentif
yuni quelyatupleintherelati
on.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q.no60.I fev erynon- keyat t
ributeisfunctionall
ydepedentprimar ykey,
thent he
rel
ationwi llbei n_ _
_ _
_ _______
_ .
A: Fi
rstnor mal for m
B: Secondnor mal form
C: ThirdNor mal f orm
D: Four thnor mal form
Q.no1.Thi skeyt hatuni quelyidenti
fieseachr ecordiscal
led
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fi
el dName
Q.no2.Aggr egat ef unctionsar efunct i
onst hattakea______
__ _
__asi nput
and
retur
nasi ngl ev alue.
A: Collect i
onofv alues
B: Si
ngl ev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no3.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ternar yOper at or
C: Binar yOper at or
D: Notanoper at or
Q.no4.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A: Sophi st i
cat edenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no5.Asubschemaexpr esses_________.
A: Thel ogi cal v iew
B: Thephy sical view
C: Theext er nal vi
ew
D: Thei nt ernal view
Q.no6.I fBi sanat tribut eandA→B, ThenBi ssaidtobe_ _____
__byA.
A: Logical lyi mpl ied
B: Funct i
onal lyi mpl ied
C: Logical lydet ermi ned
D: Funct ional lydet ermi ned
Q.no7.Sel ect*f r om empl oyeeWhatt ypeofst atementisthis?
A: DML
B: Int
egr ityconst raint
C: DDL
D: View
Q.no8.Whi choft hef oll
owingat t
ri
butecanbef urt
herdi
v i
dedinto
subparts
A: Simpl eat tribut e
B: Multival uedat tri
but e
C: Composi t eat tribute
D: Derivedat tribut e
Q.no9.A‘ book’ i
sa_ _ _______
typeofentit
y.
A: concept ual
B: concr et e
C: real
D: abstract
Q.no10.E- Rmodelusest hi
ssy mboltorepresentweakent it
yset?
A: Dottedr ect angl e
B: Diamond
C: Doubl yout l
inedr ect angle
D: Dotteddi amond
Q.no11.Al laggr egat ef uncti
onsexcept_ _
___i gnorenul
lvaluesinthei
r
i
nput
coll
ection.
A: Count (at tribute)
B: Count (* )
C: Avg
D: Sum
Q.no12.I nanEnt it
y-Rel ati
onshipDiagram “Diamonds”
represent s_ _ ___ _____ ________
A: Attr
ibut es
B: Multi-val uedat tri
but es
C: Weakent ityset
D: Relationshipset s
Q.no13.Keyt or epresentr elati
onshipbet weent abl
esi scalled
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dateKey
Q.no14.Theov eralldescr i
ptionofadat abasei scalled______.
A: Dat aintegrit
y
B: Dat amani pulat i
on
C: Dat abaseschema
D: Dat adef i
niti
on
Q.no15.Whi choft hef ollowingi st
hest ruct
ureoft heDat abase?
A: Tabl e
B: .Schema
C: Relation
D: Structure
Q.no16.Whi choneoft hefollowinguniquelyident i
fi
est heelementsint
he
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no17.I nSQL‘ rel
ationAcont ainsrel
ationB’ canbewr it
tenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no18.Fort hegi vensetoff uncti
onaldependencyF, it
’sclosurei
s
denot edas
A: F+
B: FC
:F*
D: F_
Q.no19.Tor emov ear elati
onf rom anSQLdat abase, weuset he____
__
command.
A: Delete
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no20.4NFi sdesi gnedt ocopewi t
h:
A: Transi tivedependency
B: Joindependency
C: Mul tivalueddependency
D: Funct ional dependency
Q.no21.Thedat abaseenv i
ronmenthasal lofthefoll
owingcomponent
s
except ____ ____
A: User s.
B: Separ at efi
les
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no22.Rel ationalcal culusisa:
A: Procedur allanguage
B: Non- Pr ocedur allanguage
C: Dat adef ini
t i
onl anguage
D: Highl ev ellanguage
Q.no23.Theconcept ualmodeli s_______
__ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwareandsof twar e
D: Independentofbot hhar dwareandsof twar e
Q.no24.Adat adi ctionaryisar epositor
yt hatmanages_ ___
_
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal idator
Q.no25.I nE- RDi agr am der i
vedat t
ribut
ear erepresentedby__
___
___
.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no26.Thet erm_ ______isusedt or ef
ert oarow.
A: Attribute
B: Tupl e
C: Field
D: Instance
Q.no27.Thecol lectionofi nter
relateddatai scal
ledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no28.The_ ___ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: St ruct ure
D: Pr i
mar ykey
Q.no29.Rel at i
onalAl gebrais
A: Dat aDef i
ni t
ionLanguage
B: Met aLanguage
C: Pr ocedur al quer yLanguage
D: Dat aMani pulationLanguage
Q.no30.Theempl oy eesalaryshoul dnotbegr eatert
hanRs.2000.Thisis
______ _
A: i
nt egr i
tyconst raint
B: refer ent i
al const raint
C: ov er -definedconst rai
nt
D: feasi bleconst raint
Q.no31._ ___ ___pr oducest herelationthathasattri
butesofR1andR2
A: Car t esianpr oduct
B: Diff erence
C: Pr oduct
D: Inter sect ion
Q.no32.I fev erynon- keyat tr
ibuteisfuncti
onallydependentonthe
pri
mar ykey ,
ther elat ionwi l
lbei n_ _____
_
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal For m
Q.no33.I nSQLt hest atementsel ect*f
rom R,Sisequival
entto_
______
.
A: Sel ect*f rom Rnat uralj
oinS
B: Sel ect*f rom Rcr ossj oi
nS
C: Sel ect*f rom Runi onjoi
nS
D: Sel ect*f rom Ri nnerj oi
nS
Q.no34.Funct ionalDependenci esar ethetypesofconstrai
ntsthatare
based
on__ __ __
A: Key
B: Keyr ev i
sit
ed
C: Super setkey
D: Tuple
Q.no35.Whi chnormalf or misconsider
edadequateforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no36.Whi chofthef ollowingi
sNotaRel ati
on-al
gebraOperati
on
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no37.Whati sar elationshipcall
edwheni ti
smai nt
ainedbetweent
wo
entit
ies?
A: Unary
B: Binary
C: Ternar y
D: Quater nary
Q.no38.Mi nimalSuper key sarecall
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attri
but ekeys
Q.no39.I ndomai nr elationalcal
culuswecreateav ar
iabl
efor
every____ ____
A: Row
B: Column
C: Table
D: Attri
but e
Q.no40.Whi chofthef ollowingi
snotModi f
icati
onoftheDatabase
A: Deletion
B: I
nser ti
on
C: Sorti
ng
D: Updat ing
Q.no41.Af uncti
onaldependencyi sar el
ati
onshipbetweenoramong:
A: Tabl es
B: Rows
C: Relat i
ons
D: Attri
but es
Q.no42.Whi choft hefollowingaret heproperti
esofenti
ties?
A: Groups
B: Tabl e
C: Attri
but es
D: Swi tchboar ds
Q.no43.Whi choft hefollowingisnotal evelofdataabstr
act i
on?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no44.Whi chSQLQuer yisuset oremov eatableandallitsdat
afrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no45.Whi choft hefollowingisanunar yoper at
ion?
A: Select ionoper ati
on
B: Gener alizedsel ecti
on
C: Primi tiveoper at i
on
D: Project ionoper ati
on
Q.no46.Cust omerwi thdrawingmoneyf rom ATM isanexampl e
of______ ___ _
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticateduser
Q.no47.Themet hodofaccesswhi chuseskeyt ransf
ormationisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no48.A_ ___ __
_ _inat ablerepresentsar el
ati
onshipamongasetof
val ues.
A: Column
B: Key
C: Row
D: Entr y
Q. no49.I none- to-manyr elationshipthetableon'many '
sidei scall
edas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q. no50.Whi choft hef oll
owi ngenabl esustov i
ewdat afrom at abl
e
basedona
speci ficcr i
terion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q. no51.I far elati
oni sinBCNF, thenitisal
soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no52.Whi choft hef oll
owi ngoper ati
onisusedi fwear einter
estedin
onl y
cer taincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q. no53.Amongstt heACI Dpr operti
esofat ransacti
on,the'Durabil
it
y'
proper ty
requi res.thatt hechangesmadet othedatabasebyasuccessf ul
transact i
on
per sist
A: Excepti ncaseofanoper atingsystem cr
ash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, evenifthereisaf ail
ureofanykind
Q. no54.Whi char et hetwoway sinwhichentit
iescanpar ti
cipateina
rel
at i
onshi p?
A: Passi veandact ive
B: Tot al andpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no55.I nt her elat i
onalmodel ,thenumberofat t
ri
butesandnumberof
tuples
i
riar elat ionar eter medas_ _______
__and____
_______
___respecti
vel
y
A: Car di nal i
ty,domai n
B: Degr ee, cardinal i
ty
C: Domai ndegr ee
D: Car di nal i
ty,degr ee
Q.no56.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev er ybi naryt ablesi sinBCNF
Whi choft hef ollowi ngi strue?
A: Bot hS1andS2ar etrue
B: S1i st r
ue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q.no57.At ablehasf ieldsF1, F2, F3,F4,F5withthefol
lowingfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,
F2)—>F5
I
nt ermsofnor mal ization,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no58.I fev er ynon- keyat tri
buteisfuncti
onall
ydepedentpr i
marykey,
thent he
rel
at i
onwi llbei n_ ____________.
A: Firstnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four t hnor mal form
Q.no59.At ableont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi rdNor mal For m( 3NF)
C: Hav easi ngl eat tributekey
D: Hav eacomposi tekey
Q.no60.Whi choft hef ollowingi snotapr opertyofatransact
ion?
A: Atomi city
B: Consi stency
C: Integrity
D: Dur ability
Q.no1.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ter naryOper at or
C: Binar yOper ator
D: Notanoper ator
Q.no2.The_ ___ __connect i
vei susedtot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no3.E- Rmodel ingt echni quei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -
lef tappr oach
D: Treest ruct ure
Q.no4.Whent hechangescausedbyanabor t
edt r
ansacti
onhav ebeen
undone,
thet r
ansact i
oni ssai dt obe_ ________
.
A: Failed
B: commi tted
C: par ti
allycommi t ted
D: roll
edback.
Q.no5.Dat aMani pul ationLanguage( DML)i snott o_
_____
A: Creat ei nfor mat iont ableint heDatabase
B: Inser t
ionofnewi nformat ionintotheDat abase
C: Del eti
onofi nfor mat i
oni nt heDatabase
D: Modi f
icat ionofi nformat ioni ntheDatabase
Q.no6.Dat ar edundancymayl eadto:
A: Dat ai nt egr ity
B: Atomi citypr obl em
C: Dat ai nconsi stency
D: Dat aabst raction
Q.no7.Whi choneoft hefollowingi snott r
ueforav iew:
A: Viewi sder ivedf r
om ot hertabl es
B: Viewi sav ir
tual table.
C: Av i
ewdef i
niti
oni sper manent lystoredaspar tofthedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no8.I nwhi chst ateonegat hersandl i
stallt
henecessar yfi
eldsfort
he
database
designpr oj ect .
A: Dat aDef ini t
ion
B: Dat aRef inement
C: Est abl ishi ngRel ationship
D: Dat adel etion
Q.no9.Whi choft hef ollowingshoul dbeusedt of i
ndthemeanoft he
salary?
A: Mean( sal ar y)
B: Av g( sal ary )
C: Sum( sal ary )
D: Count (sal ary)
Q.no10.Toappl yt heaggr egatef uncti
on, t
oagr oupofsetof
tuples_ _ ___ __ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no11.Thi skeyt hatuni quelyidentifi
eseachr ecordiscalled
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no12.Whatdoy oumeanbyonet omanyr el
ationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no13.I nE- Rdi agr am gener ali
zat i
oni sr epresentedby
A: Ell
ipse
B: Dashedel lipse
C: Rect angl e
D: Triangl e
Q.no14.Theuser swhouseeasy -to-usemenuar ecal l
ed
A: Sophi st icatedenduser s
B: Naï veuser s
C: Stand- al oneuser s
D: Casual enduser
Q.no15.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no16.Thebasi cdat atypechar (n)isa_ ____lengthcharacterstr
ingand
varchar (n)i s_ ____l engt hchar act er
A: Fi
xed, equal
B: Equal ,v ariable
C: Fi
xed, v ariable
D: Var i
abl e, equal
Q.no17.Whati sACI Dpr oper tiesofTr ansact i
ons?
A: Atomi city,Consi stency,Isolation,Dat abase
B: Atomi city,Consi stency ,Isolation,Dur abili
ty
C: Atomi city,Consi stency,Inconsi stent, Durabil
ity
D: Aut omat ically,Concur rency ,Isolation, Durabil
it
y
Q.no18.Aggr egatef unct i
onsar ef unct i
onst hatt akea_ _
_______
__as
i
nputand
ret
urnasi ngl ev alue.
A: Col l
ect ionofv alues
B: Si
ngl ev alue
C: Aggr egat ev alue
D: Tabl es
Q.no19.Hi erarchicalmodeli sal socal led_________.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt r
uct ur e
D: Tabl eSt ruct ure
Q.no20.Car tesi anpr oducti nr elat
ionalalgebr
ais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer naryoper ator
D: notdef i
ned
Q.no21.Theconcept ualmodeli s____
_____.
A: Dependentonhar dwar e
B: Dependentonsof t war e.
C: Dependentonbot hhar dwareandsof tware
D: Independentofbot hhar dwar eandsof tware
Q.no22.I nE- RDi agr am der i
vedat tri
butearerepresentedby ___
_____.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no23.I fBi sanat tribut eandA→B, ThenBi ssai dtobe_ ____
___byA.
A: Logi callyimpl i
ed
B: Funct ional l
yi mpl i
ed
C: Logi callydet ermi ned
D: Funct ional l
ydet ermi ned
Q.no24.Adat adi cti
onar yisar eposit
orythatmanages_ _
__ _
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal i
dat or
Q.no25.Whi choft hef oll
owi ngat tr
ibutecanbef urtherdi
videdinto
subpar ts
A: Simpl eat tribute
B: Mul tivaluedat t
r i
but e
C: Composi teat tri
but e
D: Der i
v edat tribute
Q.no26.NULLi s_ _____ ____.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f ori ntegerandbl ankforcharacter
D: Notav alue
Q.no27.Whi chnamemustbeuni quewi t
hinadatabase?
A: Tabl e
B: Field
C: Recor d
D: Char acter
Q.no28.TheRDBMSt erminologyforar owis______
__.
A: Tupl e.
B: Rel at i
on.
C: Attr i
but e.
D: Degr ee.
Q.no29.The_ ____
_ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ure
D: Primar ykey
Q.no30.Af unctiont hathasnopar t i
alf
uncti
onaldependenciesisin
__
_ ___ _f orm:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Thet er
m_ _ _____i
susedt or ef
ertoar ow.
A: Attr i
but e
B: Tupl e
C: Field
D: Inst ance
Q.no32.Whi choft hef oll
owingf i
eldshaswidthof8by t
es?
A: Memo
B: Number
C: Dat e/ ti
me
D: Hy per li
nk
Q.no33.Thecol lectionofinterrel
ateddataiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst racti
on
Q.no34.Theempl oy eesalaryshoul dnotbegreaterthanRs.2000.Thi
sis
__
_ ___ _
A: i
nt egr it
yconst raint
B: refer entialconstraint
C: ov er-def i
nedconst r
aint
D: feasi bleconst raint
Q.no35.Rel ationalAl gebr ais
A: Dat aDef initionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no36.Af ilemani pulationcommandt hatext r
actssomeoft herecords
from a
fil
eiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no37.whi choft hef oll
owi ngisnotadat abaseobj ect ?
A: Tabl es
B: Quer ies
C: Relat ionshi ps
D: Repor ts
Q.no38._ _ ____ _pr oducest herel
ationt hathasat tr
ibutesofR1andR2
A: Car tesi anpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no39.Whi choft hef ollowingint r
uer egar dingRef erent i
alIntegr
ity
?
A: Ever ypr i
mar y-keyv aluemustmat chapr imar y-keyv alueinan
associ atedt abl e
B: Ever ypr i
mar y-keyv aluemustmat chaf oreign-keyv aluei nanassoci ated
table
C: Ever yf orei gn-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ever yf orei gn-keyv aluemustmat chaf oreign-keyv alueinanassoci ated
table
Q.no40.Thenat ur aljoinisequalt o:
A: Car tesi anPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ectionandCar tesianpr oduct
D: Combi nat i
onofpr ojectionandCar t
esianpr oduct
Q.no41.I nt he_ ___ __
_ ___nor malform, acomposi t
eat tributeisconver t
ed
to
i
ndi vi
dualat tri
but es.
A: First
B: Second
C: Thir d
D: Four th
Q.no42.I fever ynon- keyat t
ri
buteisfunct i
onallydependentonthe
pri
mar ykey ,
therel ationwi llbei n_ ______
A: FirstNor mal For m
B: SecondNor mal For m
C: Thir dNor mal For m
D: Four thFor mal For m
Q.no43.At ablejoi nedwi thit
selfiscal
ledas_ _
______
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no44.A_ ___ __
_ _i nat ablerepresent
sar elati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no45.Whati sar elati
onshipcal l
edwheni tismaintai
nedbetweent
wo
entit
ies?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat ernary
Q.no46.Whi choft hef ollowingisnotal evelofdat aabstr
acti
on?
A: Phy si calLev el
B: Critical Level
C: Logi cal Lev el
D: ViewLev el
Q.no47.Cust omerwi thdrawingmoneyf rom ATM i sanexample
of_____ __ ___
A: Appl icat i
onpr ogr ammer
B: Naï veuser
C: Speci ali
zeduser
D: Sophi sticat eduser
Q.no48.Af unct i
onaldependencyi sar el
ationshi
pbet weenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q.no49.Whi choft hefollowingisNotaRel ation-al
gebraOper at
ion
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no50.I ndomai nrel
ationalcalculuswecr eateav ar
iablefor
every____ ___ _
A: Row
B: Column
C: Table
D: Attri
but e
Q.no51.The_ ________protocolensuresfreedom f r
om deadlock.
A: Two- phasel ockingprot ocol
B: Stri
ctt wo- phasel ocki
ngpr ot
ocol
C: Rigoroust wo- phasel ockingpr ot
ocol
D: Timest ampor deri
ngpr otocol
Q.no52.I nt he_ ________
_nor malf orm,acomposi t
eattr
ibuteisconver
ted
to
i
ndividualat tributes
A: Fi
rst
B: Second
C: Third
D: Four t
h
Q.no53.Ther esul toftheUNI ONoper ati
onbet weenR1andR2i sa
rel
ationt hat
i
ncludes
A: Allthet upl esofR1
B: Allthet upl esofR2
C: Allthet upl esofR1andR2
D: Allthet upl esofR1andR2whi chhavecommoncol umns
Q.no54.Af unct i
onaldependencyoft heform x—>yi st r
ivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no55.Whi choft hef oll
owi ngisnott ruef orNor mal i
zat ion?
A: Remov esr edundancy
B: Remov esinser tionanomal y
C: Decomposest her elati
on
D: Quer yexecut i
onbecomesf aster
Q.no56.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eates______
A: Par ent -
Chi l
dr elationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshipbet weent het ablest hatconnectt hem.
C: Net wor kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elat i
onshipbet weent het ablest hatconnectt hem.
Q.no57.Cr eat etabl eempl oy ee( namev archar,idi nteger )Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr i
tyconst r
ai nt
Q.no58.Af tert hef inalstatementofat r ansact i
onhasbeenexecut ed,
a
tr
ansact ionent er sina_ ________st at
e._______.
A: Act i
v e
B: abor ted
C: Commi tted
D: Par ti
al l
ycommi tted
Q.no59.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst or esmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no60._ ______al lowust oident if
yuniquel yat upleint her el
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no1.Sel ect*f rom empl oyeeWhatt ypeofst atementi st hi
s?
A: DML
B: I
nt egrityconst r
ai nt
C: DDL
D: View
Q.no2.I nanEnt ity-RelationshipDiagr
am “ Diamonds”
represent s__ ___ _______ ______
A: Attri
but es
B: Multi-
v aluedat t
ributes
C: Weakent it
yset
D: Relationshi pset s
Q.no3.Theov er alldescr i
pt i
onofadat abasei scal
led_____
_.
A: Datai ntegr ity
B: Datamani pul ation
C: Databaseschema
D: Datadef i
ni ti
on
Q.no4.Whi choneoft hef oll
owinguniquelyidenti
fiestheelement
sinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi t ekey
Q.no5.Rel at i
onalcal cul usi sa:
A: Procedur allanguage
B: Non-Pr ocedur allanguage
C: Datadef i
ni ti
onl anguage
D: Highl evel language
Q.no6.Tor emov ear elationf r
om anSQLdat abase,weuset he__
____
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no7.Cr ossPr oducti sa:
A: UnaryOper at or
B: Ternar yOper at or
C: BinaryOper ator
D: Notanoper at or
Q.no8.Thedat abaseenv ironmenthasal lofthefollowingcomponent
s
except__ ____ __
A: Users.
B: Separ atef il
es
C: Database.
D:Dat abaseadmi nistrator
Q.
no9.Asubschemaexpr esses____
_ _
___.
A:Thel ogical vi
ew
B:Thephy si calview
C:Theext ernal view
D:Thei nter nal v
iew
Q.
no10.Whi choft hef ollowingisthest r
uctureoftheDatabase?
A:Tabl e
B:.Schema
C:Relat ion
D:Struct ur e
Q.
no11.E- Rmodelusest hissy mboltorepresentweakent i
tyset?
A:Dot tedr ectangl e
B:Diamond
C:Doubl yout l
inedr ectangl e
D:Dot teddi amond
Q.
no12.Keyt or epr esentr elati
onshipbetweent abl
esiscall
ed
A:Primar ykey
B:Secondar yKey
C:Forei gnKey
D:Candi dat eKey
Q.
no13.I nSQL‘ relationAcont ainsrel
ati
onB’ canbewr it
tenas
A:Notexi st sBexceptA
B:existsBexceptA
C:Notexi st sAexceptB
D:existsAexceptB
Q.
no14.The_ __
_ __connect ivei
susedt otestforabsenceofset
member shi p.
A:except
B:exists
C:noti n
D:in
Q.
no15.4NFi sdesi gnedt ocopewi th:
A:Transi t
iv edependency
B:Joindependency
C:Mul ti valueddependency
D:Funct i
onal dependency
Q.
no16.Al laggr egat ef unctionsexcept_ __
__ignorenullval
uesinthei
r
i
nput
coll
ect i
on.
A: Count (
at tribute)
B: Count (
* )
C: Av g
D: Sum
Q.no17.Fort hegi v ensetoff uncti
onaldependencyF,i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no18.A‘ book’ isa_ _
_______typeofent i
ty.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no19.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot t
om- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no20.Car tesianpr oducti nr el
ati
onalalgebrais:
A: aUnar yoper ator
B: aBi naryoper ator
C: aTer nar yoper at or
D: notdef ined
Q.no21.Thebasi cdat atypechar (n)i
sa_ _
___lengt
hcharacterstr
ingand
varchar (n)i s_ _
_ _
_l engthchar acter
A: Fixed, equal
B: Equal ,var iable
C: Fixed, var iable
D: Var i
abl e, equal
Q.no22.I nwhi chst ateonegat hersandlistallt
henecessar
yf i
eldsfort
he
databasedesi gnpr oject .
A: Dat aDef initi
on
B: Dat aRef inement
C: Establ i
shi ngRel ationship
D: Dat adel et ion
Q.no23.Hi er archi calmodeli salsocalled______
___.
A: Treest r
ucture
B: PlexSt ructure
C: Nor mal i
zeSt r
ucture
D: Tabl eSt r
ucture
Q.no24.Dat aMani pulationLanguage( DML)i snotto__ __
_ _
A: Creat ei nformationt ablei nt heDatabase
B: I
nser t i
onofnewi nformat ionintotheDatabase
C: Delet ionofi nfor
mat i
oni nt heDatabase
D: Modi ficati
onofi nformat ionintheDat abase
Q.no25.Theconcept ualmodeli s________
_.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwar eandsof t
ware
D: Independentofbot hhar dwar eandsof t
ware
Q.no26.Themet hodofaccesswhi chuseskeyt ransformat i
oni sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no27.I none- t
o-manyr elationshipthetableon'many '
sidei scall
edas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no28.Whi choft hef ollowi ngenabl esustov i
ewdat af rom at abl
e
basedona
specificcr i
teri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no29.I nSQLt hest at ementsel ect*fr
om R,Sisequiv al
entt o_____
__.
A: Select*f rom Rnat ur al j
oinS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Rinnerj oinS
Q.no30.TheRDBMSt ermi nol ogyforar owis________
.
A: Tupl e.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no31.Whi chofthef ol
lowi
ngisnotModi fi
cati
onoftheDat abase
A: Deletion
B: I
nser ti
on
C: Sorting
D: Updat ing
Q.no32.Mi nimalSuper keysarecal
led
A: Schemakey s
B: Candi dat ekeys
C: Domai nkey s
D: Attri
but ekey s
Q.no33.Whi chofthef ol
lowi
ngisanunar yoperati
on?
A: Selectionoper ation
B: Gener alizedselection
C: Primitiveoper ati
on
D: Project i
onoper ation
Q.no34.Whi chnormalf ormisconsider
edadequat ef
orrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no35.Whi chnamemustbeuni quewi t
hinadatabase?
A: Table
B: Fiel
d
C: Recor d
D: Char acter
Q.no36.The_ ____
_ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q.no37.Whi chofthef ol
lowi
ngaret heproper
ti
esofenti
ties?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no38.NULLi s_____
_ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandblankf orchar act er
D: Notav alue
Q.no39.Whi chSQLQuer yisuset oremov eat abl eandal litsdat afrom
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no40.Funct ionalDependenci esar et
het ypesofconst r
aintst hatare
based
on______
A: Key
B: Keyr evisit
ed
C: Super setkey
D: Tuple
Q.no41.Whi choft hef oll
owingi ntr
ueregar dingRef erentialIntegrit
y?
A: Everypr imar y-
keyv aluemustmat chapr i
mar y
- keyv alueinan
associatedt abl e
B: Everypr imar y-
keyv aluemustmat chaforeign- keyv alueinanassoci ated
table
C: Everyf oreign-keyvaluemustmat chapr imar y-keyv aluei nan
associatedt abl e
D: Everyf oreign-keyvaluemustmat chaf oreign-keyv alueinanassoci at
ed
table
Q.no42.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of__________
A: Applicationpr ogrammer
B: Naïveuser
C: Specializeduser
D: Sophi sti
cat eduser
Q.no43.Af unct i
onthathasnopar tialf
unctionaldependenci esi si
n
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no44.whi choft hef oll
owingi snotadat abaseobj ect?
A: Tabl es
B: Quer ies
C: Relat ionshi ps
D: Repor ts
Q.no45.Whati sar elati
onshipcal l
edwheni tismai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no46.At abl ejoi
nedwi thitselfiscal
ledas___ _
_ _
_ _
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Joi n
Q.no47.Thecol l
ectionofi nt
errelateddataiscalledas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no48._ _ _
_ ___producest her el
ationthathasat tr
ibutesofR1andR2
A: Car tesi anpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no49.Thet erm_ ______isusedt orefertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no50.Af il
emani pulati
oncommandt hatextractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q. no51.I nt her elat i
onalmodel ,
thenumberofat tr
ibutesandnumberof
tupl es
i
riar elationar et er medas_ ________
_ and__ _
_ _
_ _
_______respectiv
ely
A: Car dinal it
y,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinal it
y,degr ee
Q. no52.Whi choft hefol l
owi ngi snotapr opertyofat ransaction?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur abi l
ity
Q. no53.Amongstt heACI Dpr operti
esofat ransaction,the'Durabil
it
y'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no54.Dupl icat ionofdat aatsev eralplacesi sknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisol ation
C: Dat ainconsi stency
D: Dat ar edundancy
Q. no55.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar yt ablesi sinBCNF
Whi choft hef ollowi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i st rue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q. no56.I far elat ionisi nBCNF, theni ti
salsoi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no57.Whi char et het woway sinwhi chent i
ti
escanpar t
ici
pateina
rel
at i
onshi p?
A: Passi v eandact i
ve
B: Tot alandpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no58.I fev erynon- keyat tr
ibuteisfunct i
onall
ydepedentpr imarykey,
thent he
rel
at i
onwi l
lbei n__ ___________.
A: Fir
stnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four thnor mal for m
Q.no59._ ___ ___allowust oidentifyuniquelyat upl
eint herel
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no60.Cr eat etabl eempl oy ee(namev archar,i
dinteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst raint
Q.no1.Whi choft hef ol
lowingat tr
ibutecanbef urt
herdi v
idedinto
subpar ts
A: Simpl eat tri
bute
B: Mul tivaluedat t
ribute
C: Composi teat tr
ibut e
D: Der ivedat t
ribute
Q.no2.Whati sACI Dpr oper t
iesofTr ansactions?
A: Atomi city,Consi stency,Isolat
ion,Database
B: Atomi city,Consi stency,Isolat
ion,Durabili
ty
C: Atomi city,Consi stency,Inconsistent,Durabil
i
ty
D: Aut omat icall
y,Concur r
ency ,I
solati
on, Durabi
li
ty
Q.no3.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A: Sophi st i
cat edenduser s
B: Naï veuser s
C: Stand- al oneuser s
D: Casual enduser
Q.no4.Whi choft hef oll
owi ngshouldbeusedt of i
ndt
hemeanoft he
salary?
A: Mean( sal ar y)
B: Av g( sal ary )
C: Sum( sal ary )
D: Count (sal ary )
Q.no5.Toappl yt heaggr egatefuncti
on,toagr oupofsetof
tuples_ _ ___ __ clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no6.Aggr egat ef unct ionsar efuncti
onst hattakea___
______
__asi
nput
and
returnasi ngl ev alue.
A: Col lect ionofv alues
B: Singl ev alue
C: Aggr egat ev alue
D: Tabl es
Q.no7.I nanEnt ity-Rel ationshipDiagram “Diamonds”
represent s_ ___ ______ ____ ___
_
A: Attribut es
B: Mul ti-val uedat tr
ibut es
C: Weakent ityset
D: Rel at i
onshi pset s
Q.no8.Adat adi ct i
onar yi sareposit
orythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel l Checker
D: Dat aVal idat or
Q.no9.I fBi sanat tributeandA→B, ThenBi ssaidtobe_____
___byA.
A: Logi cal lyi mpl i
ed
B: Funct ional l
yi mpl ied
C: Logi cal lydet er mined
D: Funct ional lydet ermi ned
Q.no10.Sel ect*f rom empl oyeeWhatt ypeofst atementi st hi
s?
A: DML
B: Integrit
yconst raint
C: DDL
D: View
Q.no11.Whoi smor econcer nedaboutt heconcept uallev
eloft heDBMS
A: TheSy stemspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no12.I nE- Rdi agr am gener al
izati
oni srepresent edby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angle
D: Triangle
Q.no13.Theov er alldescripti
onofadat abasei scal led______.
A: Dat aintegr ity
B: Dat amani pul ation
C: Dat abaseschema
D: Dat adef initi
on
Q.no14.Whi choneoft hefollowingisnott rueforav i
ew:
A: Viewi sder ivedf rom othertables
B: Viewi sav ir
tual table.
C: Av iewdef initioni spermanent l
ystoredaspar toft hedatabase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no15.Dat ar edundancymayl eadto:
A: Dat aintegr ity
B: Atomi citypr obl em
C: Dat ainconsi stency
D: Dat aabst r action
Q.no16.Whent hechangescausedbyanabor tedt ransactionhavebeen
undone,
thet r
ansact ioni ssai dtobe_ _______
_ .
A: Failed
B: commi tted
C: par ti
all
ycommi t
ted
D: rolledback.
Q.no17.I nE- RDi agr am der i
vedat tr
ibutearer epresent edby __
_____
_.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no18.Whatdoy oumeanbyonet omanyr el
ationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no19.Thi skeyt hatuni quelyidentifi
eseachrecordiscalled
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fi
el dName
Q.no20.Tor emov ear elati
onf rom anSQLdat abase, weuset he__
____
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no21.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no22.Car tesianpr oducti nr el
at i
onalal
gebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no23.Rel ationalcal culusisa:
A: Procedur allanguage
B: Non- Pr ocedur allanguage
C: Dat adef initi
onl anguage
D: Highl evel language
Q.no24.Al laggr egatef unctionsexcept_ ____i
gnorenul lv
aluesint
heir
i
nput
coll
ect ion.
A: Count (att r
ibute)
B: Count (*)
C: Avg
D: Sum
Q.no25.4NFi sdesi gnedt ocopewi th:
A: Transitivedependency
B: Joindependency
C: Mul t
iv alueddependency
D: Functional dependency
Q.no26.Whi choft hef ollowingfi
eldshaswi dthof8bytes?
A: Memo
B: Number
C: Date/time
D: Hyper l
ink
Q.no27.Mi nimalSuper keysarecalled
A: Schemakey s
B: Candidat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no28.Thenat ural joi
ni sequalto:
A: Cartesi anPr oduct
B: Combi nat i
onofUni onandCar t
esianpr oduct
C: Combi nat i
onofsel ectionandCar tesianpr oduct
D: Combi nat i
onofpr ojectionandCar tesianpr oduct
Q.no29.Whi choft hef ollowingenabl esust ov iewdatafr
om atabl
e
basedona
specificcr iteri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no30.I nSQLt hest atementselect *fr
om R, Sisequival
entto_
____
__.
A: Select*f rom Rnat uraljoi
nS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no31.Whi choft hef ollowingi
sanunar yoper at
ion?
A: Selectionoper ation
B: Gener alizedsel ect i
on
C: Pri
mi tiveoper ati
on
D: Projectionoper at i
on
Q.no32.Whi chnamemustbeuni quewithi
nadat abase?
A: Table
B: Fi
eld
C: Recor d
D: Char acter
Q.no33.Themet hodofaccesswhi chuseskeyt ransformat
ioni
sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent i
al
Q.no34.TheRDBMSt erminologyforarowi s_
_______
.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no35.I ndomai nr elati
onalcalcul
uswecr eateav ari
ablef
or
every___ _____
A: Row
B: Column
C: Table
D: Attri
but e
Q.no36.Rel ati
onalAl gebr ais
A: DataDef i
nit
ionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: DataMani pulationLanguage
Q.no37.Whi choft hef ol
lowingisNotaRel ati
on-al
gebraOperat
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no38.I feverynon- keyat t
ri
buteisfuncti
onall
ydependentonthe
pri
mar ykey ,
therelationwi llbei n__ __
___
A: Fi
rstNor mal Form
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal For m
Q.no39.I none- to-manyr el
ationshipthetableon'many '
sideiscall
edas:
A: Par ent
B: Mast er
C: Sist er
D: Chi ld
Q.no40.Whi choft hef ollowingisnotal evelofdataabstracti
on?
A: Phy si calLev el
B: Critical Level
C: Logi cal Lev el
D: ViewLev el
Q.no41.A_ _____
_ _inat ablerepresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no42.Theempl oy eesal aryshouldnotbegr eatert
hanRs.2000.Thi sis
_______
A: integr it
yconst r
aint
B: refer entialconst raint
C: over -def i
nedconst r
aint
D: feasi bleconst raint
Q.no43.I nt he_ _____ __
__nor malf orm,acomposi teattr
ibuteisconver
ted
to
i
ndi vi
dualat tr
ibutes.
A: First
B: Second
C: Thi rd
D: Four th
Q.no44.Af unct i
onaldependencyi sar el
ationshi
pbet weenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Attr i
but es
Q.no45.Whi chnor malf or misconsi der
edadequat eforrelati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no46.Whi chofthef oll
owingisnotModi f
icat
ionoft heDatabase
A: Deletion
B: I
nser ti
on
C: Sorting
D: Updat ing
Q.no47.At ablej
oinedwi thitsel
fiscall
edas_ ____
_ _
_
A: Join
B: SelfJoi n
C: Out erJoin
D: Equi Join
Q.no48.Whati sar el
ationshipcall
edwheni ti
smai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binary
C: Ternar y
D: Quat ernary
Q.no49.Af il
emani pulati
oncommandt hatextr
actssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no50.The_ ___
__ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q.no51.Whi chofthef oll
owingoper at
ionisusedi fwear einter
estedi
n
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q. no52.At ableont hemanysi deofaonet omanyormanyt omany
relationshi p
must :
A: BeinSecondNor mal For m( 2NF)
B: BeinThi rdNor mal Form( 3NF)
C: Hav easi ngleat tri
butekey
D: Hav eacomposi tekey
Q. no53.At ablehasf i
eldsF1, F2, F3, F4, F5wi ththefollowingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor malization, t
hist ableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no54.Af terthef inalstatementofat ransact i
onhasbeenexecut ed,a
transact ionent ersi na_ _____ ___state.______ _
.
A: Active
B: aborted
C: Commi tted
D: Parti
allycommi tted
Q. no55.The_ _____ ___protocolensur esf r
eedom f r
om deadl ock.
A: Two- phasel ockingpr otocol
B: Stri
ctt wo-phasel ockingpr otocol
C: Rigoroust wo-phasel ockingpr ot
ocol
D: Timest ampor deringpr otocol
Q. no56.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eates_ _
____
A: Parent -
Childrelationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshipbet weent het ablesthatconnectt hem.
C: Networ kmodel betweent het ablesthatconnectt hem.
D: Manyt ooner elat i
onshipbet weent het ablest hatconnectt hem.
Q. no57.I nthe_ ____ __
_ _
_nor malf orm, acomposi t
eattri
butei sconverted
to
i
ndi vidualat tri
butes
A: Fi
rst
B: Second
C: Third
D: Four th
Q.no58.Doesi ndext akespacei nt hedisk?
A: Indexesar enev erstoredondi sk
B: Itstor esmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no59.Af unct ionaldependencyoft heform x—>yi strivalif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no60.I nther elationalmodel ,t
henumberofat tr
ibutesandnumberof
tuples
i
riar elationar et ermedas_ _
_____ ___
and_ _____
_ _
______respectivel
y
A: Car dinal i
ty,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Car dinal i
ty,degr ee
Q.no1.A‘ book’ isa_ ________
typeofent i
ty.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no2.Aggr egat ef unctionsarefunct i
onst hattakea_ __________asinput
and
returnasi ngl ev alue.
A: Collect ionofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tabl es
Q.no3.E- Rmodelusest hi
ssy mbolt orepresentweakent ityset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout linedr ectangle
D: Dot teddi amond
Q.no4.Fort hegi vensetoff unctionaldependencyF, it
’sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no5.Keyt orepresentr elat
ionshipbetweent ablesiscall
ed
A: Primar ykey
B: Secondar yKey
C: Forei gnKey
D: Candi dateKey
Q.no6.Thedat abaseenv ir
onmenthasal lofthefollowi
ngcomponent
s
except __ ______
A: User s.
B: Separ atef i
l
es
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no7.Hi erarchi
calmodeli salsocalled_________
.
A: Treest ructure
B: PlexSt ructure
C: Nor mal i
zeSt r
uct ure
D: Tabl eSt r
ucture
Q.no8.Theconcept ualmodeli s________
_ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof t
war e
D: Independentofbot hhar dwar eandsof tware
Q.no9.I nanEnt it
y -
Rel ationshipDiagram “Diamonds”
represent s____________ _
_ ____
A: Attribut es
B: Mul ti-
v aluedattri
but es
C: Weakent i
tyset
D: Relat ionshipset s
Q.no10.Whi choft hef ollowingi st
hest ructur
eoft heDatabase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no11.I nSQL‘ relationAcont ainsrelat
ionB’ canbewr i
ttenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no12.Thebasi cdat at y pechar (n)isa_ _
_ __l
engt hcharacterstr
ingand
varchar(n)i s_ _ ___l engt hchar act er
A: Fi
xed, equal
B: Equal, var iabl e
C: Fi
xed, var i
abl e
D: Variabl e,equal
Q.no13.I nwhi chst ateonegat her sandl i
stallthenecessar yfi
eldsfort
he
databasedesi gnpr oject.
A: DataDef i
ni tion
B: DataRef i
nement
C: Establishi ngRel at i
onshi p
D: Datadel et ion
Q.no14.Theuser swhouseeasy -to-usemenuar ecalled
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no15.Dat aMani pulationLanguage( DML)i snott o____
__
A: Createi nfor mat iont ablei ntheDat abase
B: I
nser ti
onofnewi nformat i
oni nt otheDat abase
C: Deletionofi nf ormat i
oni ntheDat abase
D: Modi ficat ionofi nformat i
oni nt heDat abase
Q.no16.Whi choft hef oll
owi ngat t
ri
but ecanbef ur
therdi
videdinto
subpar ts
A: Simpl eat tribut e
B: Multival uedat tri
but e
C: Composi teat tribut e
D: Derivedat tribut e
Q.no17.Whati sACI Dproper t
iesofTr ansact i
ons?
A: Atomi ci ty,Consi stency ,Isolation, Database
B: Atomi ci ty,Consi stency ,Isolation,Dur abil
ity
C: Atomi ci ty,Consi stency ,Inconsi stent ,
Dur abil
it
y
D: Automat i
cal l
y ,Concur rency ,Isolation,Dur abi
li
ty
Q.no18.Asubschemaexpr esses_ ___ _
____.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal vi
ew
D: Thei nter nal view
Q.no19.Toappl yt heaggr egat ef unct i
on,toagr oupofsetof
tuples_ ______clausei s
used.
A: Groupby
B: hav ing
C: select
D: wher e
Q.no20.Whi choneoft hefollowi nguniquelyi
dentif
iest
heelement
sinthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: For eignkey
D: Composi t
ekey
Q.no21.Whi choft hefollowingshoul dbeusedt ofi
ndthemeanofthe
salary?
A: Mean( salary )
B: Av g(salary)
C: Sum( salary)
D: Count (
salary )
Q.no22.The_ _ ____
connect i
vei susedt otestforabsenceofset
member ship.
A: except
B: exist s
C: noti n
D: in
Q.no23.Cr ossPr oductisa:
A: Unar yOper ator
B: Ter naryOper ator
C: Binar yOper at or
D: Notanoper ator
Q.no24.Al laggr egatefuncti
onsexcept_ __
__ignorenul
lval
uesint
hei
r
i
nput
collection.
A: Count (
attri
but e)
B: Count (
*)
C: Av g
D: Sum
Q.no25.Car tesianpr oductinr elati
onalalgebr
ai s:
A: aUnar yoper ator
B: aBi naryoper ator
C: aTer naryoper ator
D: notdef i
ned
Q.no26.Thet erm_ ______i
susedt or ef
ertoar ow.
A: Attribute
B: Tupl e
C: Field
D: Instance
Q.no27.Whi choft hefoll
owingaret heproper ti
esofent it
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no28.Whi chSQLQuer yisusetor emov eat ableandal litsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no29.Whi choft hefoll
owingintrueregar dingRef erentialIntegr
it
y?
A: Ever ypr i
mar y-keyvaluemustmat chapr imar y-keyv alueinan
associ atedt abl e
B: Ever ypr i
mar y-keyvaluemustmat chaf oreign-keyv aluei nanassociated
table
C: Ever yforei gn-keyv al
uemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ev eryforei gn-keyv al
uemustmat chaf oreign-keyv alueinanassoci at
ed
table
Q.no30._ ____ __producest herel
ati
ont hathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersection
Q.no31.Thecol l
ect i
onofinter
rel
ateddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst r action
Q.no32.Af unct i
ont hathasnopar t
ialfunctionaldependenci esisin
______
_f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.Funct ionalDependenci esarethetypesofconst r
aint
sthatare
based
on______
A: Key
B: Keyrev i
sited
C: Super setkey
D: Tuple
Q.no34.NULLi s__________.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandblankforcharacter
D: Notav alue
Q.no35.Cust omerwi t
hdr awi
ngmoneyf r
om ATM i sanexampl e
of____
_ ___ _
_
A: Applicationpr ogrammer
B: Naïveuser
C: Special i
zeduser
D: Sophi sti
cat eduser
Q.no36.whi choft hefollowingisnotadat abaseobject
?
A: Tables
B: Queries
C: Rel
at i
onshi ps
D: Repor ts
Q.no37.Af i
lemani pulati
oncommandt hatextractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no38.Whi choft hef oll
owingf i
eldshaswidthof8by tes?
A: Memo
B: Number
C: Date/t i
me
D: Hy per l
ink
Q.no39.At ablejoi nedwi thitselfiscall
edas_ __
_____
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no40.I nSQLt hest atementsel ect*fr
om R,Sisequivalentto____
___.
A: Select*f rom Rnat ural j
oinS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerj oinS
Q.no41.Whi choft hef ollowingi sanunar yoperati
on?
A: Select ionoper at ion
B: Gener ali
zedsel ect i
on
C: Primi tiveoper at i
on
D: Proj ectionoper ation
Q.no42.I none- t
o- manyr elat
ionshi pthetableon'many '
sidei scal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no43.I nthe_ __ ___ __
_ _nor malf orm,acomposi t
eat tr
ibuteisconvert
ed
t
o
i
ndi vi
dualat tri
but es.
A: First
B: Second
C: Third
D: Four th
Q.no44.A_ ______ _inat abler epresentsar el
ati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no45.Rel ati
onalAl gebr ais
A: Dat aDef i
nit
ionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: Dat aMani pulat i
onLanguage
Q.no46.Whi choft hef oll
owingisNotaRel ati
on-algebraOper ati
on
A: Sel ect
B: Uni on
C: Rename
D: Dr opt abl e
Q.no47.I fev er ynon-keyat t
ri
buteisfuncti
onal l
ydependentont he
pri
mar ykey ,
ther elat i
onwi llbein___ __
__
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no48.Whi choft hef oll
owingisnotal evelofdat aabst ract
ion?
A: Phy sical Lev el
B: Cr i
tical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no49.TheRDBMSt erminologyforarowi s_
______ _.
A: Tupl e.
B: Rel at i
on.
C: At tri
but e.
D: Degr ee.
Q.no50.Whati sar el
ationshi
pcalledwheni ti
smai ntai
nedbet weent
wo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nar y
Q.no51.Whi choft hef oll
owingisnotapr oper t
yofat ransacti
on?
A: At omi city
B: Consi st ency
C: Integr ity
D: Dur abi lity
Q.no52.Whi choft hef oll
owingisnottruef orNor mal i
zation?
A: Remov esr edundancy
B: Remov esi nser ti
onanomal y
C: Decomposest herelati
on
D: Quer yexecut i
onbecomesf ast
er
Q.no53.Cr eat etableempl oyee(namev archar, i
dint eger)Whatt y
peof
stat ement
i
st his?
A: DML
B: DDL
C: View
D: Integrityconst raint
Q. no54.Dupl icat ionofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisol ation
C: Dat ainconsi stency
D: Dat ar edundancy
Q. no55.Whi char et het woway sinwhichent it
iescanpart
ici
pateina
relat i
onshi p?
A: Passi v eandact i
ve
B: Tot alandpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar t i
al
Q. no56.Ther esul toftheUNI ONoper ationbet weenR1andR2i sa
relat i
ont hat
i
ncl udes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q. no57.Amongstt heACI Dproperti
esofat ransact
ion,
the'Durabi
li
ty'
proper ty
requi res.t hatt hechangesmadet othedat abasebyasuccessful
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcrash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no58.Consi dert hef oll
owing
S1:For ei
gnkeyal lowsnul lvalues.
S2:Ev er ybi nar yt ablesi si
nBCNF
Whi choft hef ol lowi ngist r
ue?
A: Bot hS1andS2ar etrue
B: S1i st rue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q.no59.I far elat ioni si nBCNF, thenitisal soin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no60.I fever ynon- keyat t
ributei sfuncti
onal lydepedentpri
marykey,
thent he
rel
ationwi l
lbei n_ __ __________.
A: Fi
rstnor mal for m
B: Secondnor mal form
C: ThirdNor mal for m
D: Four thnor mal f or m
Q.no1.I nE- Rdi agr am gener alizati
oni srepr esentedby
A: El
lipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no2.Dat ar edundancymayl eadt o:
A: Dat aint egrity
B: Atomi citypr obl em
C: Dat ainconsi stency
D: Dat aabst ract ion
Q.no3.Adat adi ct ionar yisar epositorythatmanages_ ____
A: Memor y
B: Met adat a
C: Spell Checker
D: Dat aVal i
dat or
Q.no4.E- Rmodelusest hi
ssy mbolt or epresentweakent it
yset?
A: Dot t
edr ect angl e
B: Diamond
C: Doubl yout linedr ectangle
D: Dot t
eddi amond
Q.no5.Whatdoy oumeanbyonet omanyr elati
onshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C:Onet eachercanhav eonecl ass
D:Manyt eacher smayhav emanycl asses
Q.
no6.Whoi smor econcer nedaboutt heconcept uallev
eloft heDBMS
A:TheSy st emspr ogr ammer
B:Theenduser
C:Client
D:DBA
Q.
no7.Rel at i
onalcal culusisa:
A:Procedur allanguage
B:Non- Pr ocedur al language
C:Dat adef i
ni ti
onl anguage
D:Highl ev el language
Q.
no8.Theov er alldescr i
pti
onofadat abaseiscalled______
.
A:Dat aint egr it
y
B:Dat amani pulat ion
C:Dat abaseschema
D:Dat adef i
ni ti
on
Q.
no9.Thi skeyt hatuni quelyi
dentif
ieseachr ecordiscalled
A:Primar yKey
B:KeyRecor d
C:Uni queKey
D:FieldName
Q.
no10.I fBi sanat tr
ibuteandA→B, ThenBi ssaidt obe_ ___
_ _
__byA.
A:Logi callyi mpl ied
B:Funct ional lyimpl ied
C:Logi callydet ermi ned
D:Funct ional lydet ermi ned
Q.
no11.Sel ect*f rom empl oyeeWhatt ypeofstatementist hi
s?
A:DML
B:I
nt egrityconst raint
C:DDL
D:View
Q.
no12.4NFi sdesi gnedt ocopewi th:
A:Transi tivedependency
B:Joindependency
C:Mul tival ueddependency
D:Funct ional dependency
Q.
no13.I nE- RDi agr am der i
vedattri
but earerepresentedby __
_ _
___
_.
A:Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no14.E- Rmodel ingt echni queis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -leftappr oach
D: Treest ructure
Q.no15.Whent hechangescausedbyanabor tedt r
ansacti
onhav ebeen
undone,
thet r
ansact i
onissai dt obe_ _______
_.
A: Failed
B: commi tted
C: part i
al l
ycommi tted
D: roll
edback.
Q.no16.Whi choneoft hef ollowingisnottruef orav i
ew:
A: Viewi sder iv
edf rom ot hert ables
B: Viewi sav i
rt
ual table.
C: Av iewdef i
nit
ioni sper manent l
ystor
edaspar toft hedatabase.
D: Viewnev ercont ai nsder ivedcol umns.
Q.no17.Aggr egat ef unct i
onsar efuncti
onst hatt akea_ _
________
_as
i
nputand
ret
ur nasi ngl evalue.
A: Col l
ect ionofv al ues
B: Singl ev al ue
C: Aggr egat evalue
D: Tabl es
Q.no18.Tor emov ear elationf rom anSQLdat abase, weuset he____
__
command.
A: Delet e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no19.A‘ book’ isa_ __ _
__ ___typeofentit
y.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no20.Toappl yt heaggr egat efuncti
on,toagr oupofsetof
tuples___ ___ _clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q.no21.Asubschemaexpr esses_ ________.
A: Thel ogical v i
ew
B: Thephy si cal view
C: Theext er nal view
D: Thei nter nal vi
ew
Q.no22.Whati sACI Dproperti
esofTr ansact i
ons?
A: Atomi city ,Consi stency,I
solation,Dat abase
B: Atomi city ,Consi stency,I
solation,Dur abil
ity
C: Atomi city ,Consi stency,I
nconsi stent,Dur abil
it
y
D: Automat ical ly,Concurrency,Isolation,Dur abi
li
ty
Q.no23.I nwhi chst ateonegat hersandl istallthenecessar
yfiel
dsfort
he
databasedesi gnpr oject.
A: DataDef ini ti
on
B: DataRef inement
C: Establishi ngRel ati
onship
D: Datadel et i
on
Q.no24.Cr ossPr oductisa:
A: Unar yOper ator
B: Ternar yOper ator
C: BinaryOper at or
D: Notanoper ator
Q.no25.Theuser swhouseeasy -to-usemenuar ecal
led
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no26.Whi choft hef ol
lowingenabl esust oviewdatafrom atabl
e
basedona
specificcr i
t erion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no27.Whi choft hef oll
owingarethepropertiesofent i
ties?
A: Groups
B: Tabl e
C: Attribut es
D: Swi tchboar ds
Q.no28.Theempl oy eesalaryshouldnotbegr eaterthanRs.2000.Thi si
s
_______
A: i
nt egr i
tyconst rai
nt
B: referent ialconstraint
C: over -def i
nedconst r
aint
D: feasi bleconst rai
nt
Q.no29.I ndomai nrelati
onalcalcul
uswecr eateav ar
iablef or
every_ ___ ____
A: Row
B: Col umn
C: Tabl e
D: Attribut e
Q.no30.Whi choft hef oll
owingisnotModificationoft heDat abase
A: Del etion
B: I
nser ti
on
C: Sor ti
ng
D: Updat ing
Q.no31.Thet erm_ _ _____i
susedt oref
ertoar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no32.Whi chnor malf ormisconsideredadequat eforr elati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.Themet hodofaccesswhi chuseskeyt ransformat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no34._ ___ ___pr oducest herelati
ont hathasat tri
butesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Product
D: Inter sect ion
Q.no35.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no36.The_ __
_ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ure
D: Primar ykey
Q.no37.Whi choft hef oll
owingint rueregar dingRef erentialInt
egri
ty?
A: Ev erypr imar y-
keyv aluemustmat chapr imar y-keyv alueinan
associ at edt able
B: Ever ypr imar y
-keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
table
C: Ev eryf orei gn-keyv al
uemustmat chapr i
mar y
-keyv aluei nan
associ at edt able
D: Ev eryf orei gn-keyv al
uemustmat chaf oreign-keyv alueinanassociated
table
Q.no38.Mi nimalSuper keysar ecalled
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Att ri
but ekey s
Q.no39.Af unct ionaldependencyi sar el
ationshi pbet weenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Att ri
but es
Q.no40.Whi chSQLQuer yisuset or emov eat ableandal litsdataf
rom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no41.Thenat ural j
oi nisequalt o:
A: Car tesi anPr oduct
B: Combi nat i
onofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ectionandCar t
esianpr oduct
D: Combi nat i
onofpr ojectionandCar t
esianpr oduct
Q.no42.I fev erynon- keyat tr
ibut
eisf unct i
onall
ydependentont he
pri
mar ykey ,
therel ationwi llbei n_ ______
A: Fi
r stNor mal Form
B: SecondNor mal For m
C: Thir dNor mal Form
D: Four thFor mal For m
Q.no43.Cust omerwi thdrawi ngmoneyf rom ATM i sanexample
of_____ ___ __
A: Appl icat ionpr ogr ammer
B: Naï veuser
C: Speci al izeduser
D: Sophi sticateduser
Q.no44.I none- to-manyr elat
ionshipthet ableon' many'si
deiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no45.I nt he_ _ ______ __nor malform, acomposi t
eat t
ri
butei
sconv er
ted
to
i
ndividualat tri
but es.
A: Fi
r st
B: Second
C: Thir d
D: Four th
Q.no46.Whi choft hef ollowingisNotaRel ati
on-algebr
aOperati
on
A: Select
B: Uni on
C: Rename
D: Dropt abl e
Q.no47.Whi choft hef ollowingisnotal evelofdat aabstr
acti
on?
A: Phy sical Lev el
B: Crit
ical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no48.Rel ationalAl gebr ais
A: DataDef i
nitionLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: DataMani pul ationLanguage
Q.no49.TheRDBMSt erminologyf orar owis_______
_.
A: Tupl e.
B: Relat ion.
C: Attri
but e.
D: Degr ee.
Q.no50.At ablej oinedwi thitselfiscal l
edas_ ___
____
A: Join
B: SelfJoi n
C: OuterJoi n
D: Equi Joi n
Q.no51.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst or esmemor yasandwhenr equi r
ed
C: Indexest akenospace
D: Yes, Indexesar est or edondi sk
Q.no52.Af tert hef inalst atementofat ransacti
onhasbeenexecut ed,
a
t
ransact ionent ersi na_ ________state. __
_____.
A: Activ e
B: abor ted
C: Commi tted
D: Partial lycommi tt
ed
Q.no53.I nt her elati
onalmodel ,thenumberofat t
ri
butesandnumberof
t
upl es
i
riar elat ionar et ermedas_ _
_ _
__ ____and_ ___
_________
_respecti
vel
y
A: Cardi nal ity
, domai n
B: Degr ee, cardi nalit
y
C: Domai ndegr ee
D: Cardi nal ity
, degr ee
Q.no54.Af unct ionaldependencyoft heform x—>yi st r
ivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no55.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eates______
A: Parent-
Chi l
dr el
at ionshipbet weent hetablest hatconnectthem
B: Manyt omanyr elati
onshi pbet weent hetablesthatconnectt hem.
C: Networkmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elationshipbet weent hetablest hatconnectthem.
Q.no56._ ____ _
_al lowust oident if
yuniquelyat upleinther elati
on.
A: Superkey
B: Domai n
C: Attr
ibute
D: Schema
Q.no57.Whi choft hef oll
owi ngoper ati
onisusedi fwear einterestedin
only
certai
ncol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNION
D: JOIN
Q.no58.At ablehasf i
eldsF1, F2, F3, F4,F5wi ththefollowingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI
,F2)—>F5
Intermsofnor mal ization,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no59.At ableont hemanysi deofaonet omanyormanyt omany
rel
ationship
must :
A: BeinSecondNor mal Form( 2NF)
B: BeinThi rdNor mal Form( 3NF)
C: Haveasi ngleat tributekey
D: Haveacomposi tekey
Q.no60.I nthe_ _ _
_ ______nor malf orm, acomposi t
eattri
butei sconverted
to
i
ndi vi
dualat tri
but es
A: First
B: Second
C: Thi rd
D: Four th
Q.no1.I nanEnt ity-Relationshi
pDi agr
am “Diamonds”
represent s_ _ __________ _
_ ___
_
A: Attribut es
B: Mul ti-
v aluedat tr
ibutes
C: Weakent ityset
D: Rel ati
onshi pset s
Q.no2.Hi erar chicalmodeli salsocall
ed_______
__.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt r
uct ure
D: Tabl eSt ructure
Q.no3.Whi choft hef oll
owi ngshouldbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary)
B: Av g(sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no4.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponents
except _ _
_ __ ___
A: User s.
B: Separ at ef il
es
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no5.Thebasi cdat atypechar (
n)isa_ ___
_lengthcharacterst
ri
ngand
varchar (n)i s_ ____l engthchar act
er
A: Fixed, equal
B: Equal ,v ariable
C: Fixed, v ariable
D: Var iable, equal
Q.no6.Whi choft hef oll
owi ngisthestruct
ureoftheDat abase?
A: Tabl e
B: .Schema
C: Rel ati
on
D: Struct ure
Q.no7.Whi choneoft hef ol
lowi nguni quelyidenti
fi
estheelementsint
he
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no8.Dat aMani pulationLanguage( DML)i snotto_____
_
A: Createi nformat i
ont ableintheDat abase
B: Inserti
onofnewi nformat i
oni ntot heDat abase
C: Deletionofi nfor mat i
oni ntheDat abase
D: Modi ficat i
onofi nformat i
oni nt heDat abase
Q.no9.The_ _ _
_ _
_ connect iveisusedt ot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no10.Al laggr egat ef uncti
onsexcept_ ____ignorenul
lvaluesi
nthei
r
i
nput
coll
ect i
on.
A: Count (at tri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no11.Fort hegi vensetoff unct ionaldependencyF, i
t’
sclosurei
s
denot edas
A: F+
B: FC
:F*
D: F_
Q.no12.Dat aredundancymayl eadt o:
A: Dat aint egrity
B: Atomi ci typrobl em
C: Dat ainconsi stency
D: Dat aabst racti
on
Q.no13.I nSQL‘ relati
onAcont ainsr el
ationB’ canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no14.Whi choft hef ollowingat t
ri
but ecanbef ur
therdi
videdint
o
subpar t
s
A: Simpl eat tri
but e
B: Mul ti
v aluedat tri
but e
C: Composi teat tribut e
D: Der ivedat t
r i
but e
Q.no15.Theconcept ualmodeli s_________.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof tware
D: Independentofbot hhar dwar eandsof tware
Q.no16.I nE- Rdi agr am gener alizati
oni srepresentedby
A: Ell
ipse
B: Dashedel lipse
C: Rect angl e
D: Triangl e
Q.no17.Adat adi ct i
onar yisar epositorythatmanages_ _
__ _
A: Memor y
B: Met adat a
C: Spel lChecker
D: Dat aVal i
dat or
Q.no18.Car tesianpr oductinr elati
onalal gebrais:
A: aUnar yoper at or
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no19.Keyt or epr esentr elati
onshi pbet weent abl
esiscalled
A: Primar ykey
B: Secondar yKey
C: For ei
gnKey
D: Candi dateKey
Q.no20.Asubschemaexpr esses_ ________.
A: Thel ogi cal view
B: Thephy sical view
C: Theext ernal view
D: Thei nt ernal view
Q.no21.Whati sACI Dpr oper t
iesofTr ansacti
ons?
A: Atomi city,Consi stency ,I
solat i
on, Database
B: Atomi city, Consist ency ,I
sol ation, Durabil
i
ty
C: Atomi city, Consi stency ,Inconsi stent,Durabilit
y
D: Aut omat ically,Concur r
ency ,I
sol ation,Durabi l
i
ty
Q.no22.Rel ationalcal cul
usi sa:
A: Procedur al l
anguage
B: Non- Procedur allanguage
C: Dat adef initi
onl anguage
D: Highl evel language
Q.no23.Whoi smor econcer nedaboutt heconcept uall
ev eloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no24.Aggr egatef unctionsar ef unctionst hattakea_ _________
_as
i
nputand
ret
ur nasi ngl ev alue.
A: Col l
ectionofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tabl es
Q.no25.Whi choneoft hef ollowingi snottruef oraview:
A: Viewi sder ivedf rom ot hert ables
B: Viewi sav i
rtualt able.
C: Av iewdef initi
oni spermanent lyst or
edaspar tofthedat abase.
D: Viewnev ercont ai nsder ivedcol umns.
Q.no26.Theempl oy eesal aryshoul dnotbegr eatert
hanRs.2000.Thi si
s
_______
A: i
nt egri
tyconst raint
B: referential const raint
C: over -
def i
nedconst r
aint
D: feasibleconst raint
Q.no27.Funct i
onalDependenci esar ethetypesofconst r
aintsthatar
e
based
on__ ____
A: Key
B: Keyr evisited
C: Super setkey
D: Tupl e
Q.no28.Whi choft hef oll
owi ngf ieldshaswi dt hof8by tes?
A: Memo
B: Number
C: Date/time
D: Hyper l
ink
Q.no29.Whi choft hef ollowingenabl esust oviewdat afrom at
abl
e
basedona
specificcr i
t eri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no30.Whi choft hef ollowingisanunar yoperation?
A: Selectionoper ation
B: Gener alizedsel ection
C: Pri
mi tiveoper at i
on
D: Projectionoper ation
Q.no31.NULLi s__ ________.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar act
er
C: Thesameas0f orintegerandbl ankf orcharacter
D: Notav al ue
Q.no32.Af uncti
ont hathasnopar ti
alfunct i
onaldependenciesisi
n
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no33.whi choft hef ol
lowi ngisnotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relati
onshi ps
D: Repor ts
Q.no34.Whi choft hef ollowingaret heproper t
iesofent i
ti
es?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no35.A_ _____
_ _inat ablerepresentsar elat
ionshipamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no36.I nSQLt hestatementsel ect*fr
om R, Sisequi
v alentto_ ___
___.
A: Select*fr
om Rnat ural j
oinS
B: Select*fr
om Rcr ossjoinS
C: Select*fr
om Runi onjoinS
D: Select*fr
om Ri nnerjoinS
Q.no37.Thecol l
ecti
onofi nterrel
ateddataiscal l
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabstracti
on
Q.no38.Whati sarelat
ionshi pcall
edwheni tismaintainedbet weentwo
entit
ies?
A: Unar y
B: Binary
C: Ternary
D: Quat er
nary
Q.no39.Af i
lemanipulationcommandt hatextract
ssomeoft herecor
ds
fr
om a
fi
leiscal l
ed
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no40.I none-to-
manyr elat
ionshipthetableon' many 'sideiscalledas:
A: Parent
B: Mast er
C: Sister
D: Child
Q.no41.Whi chnor malfor mi sconsideredadequat ef
orr elat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no42.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no43.At ablej oinedwi thit
selfiscall
edas_ __
_ ____
A: Joi n
B: Sel fJoin
C: Out erJoi n
D: Equi Join
Q.no44._ ___ ___producest herel
ationthathasat tr
ibut esofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no45.Themet hodofaccesswhi chuseskeyt ransf ormat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no46.Rel at i
onalAl gebr ais
A: Dat aDef i
ni t
ionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pulati
onLanguage
Q.no47.Whi choft hef oll
owingint r
ueregar dingRef erent i
alInt
egri
ty?
A: Ev erypr imar y-keyv aluemustmat chaprimar y-keyv alueinan
associ atedt abl e
B: Ever ypr imar y-keyv aluemustmat chaforeign-keyv aluei nanassociat
ed
table
C: Ev eryfor eign-keyv aluemustmat chapr i
mar y
-keyv al ueinan
associ atedt abl e
D: Ev eryfor eign-keyv aluemustmat chaf oreign-keyv alueinanassociated
table
Q.no48.Thenat ural j
oinisequalt o:
A: Car tesianPr oduct
B: Combi nat ionofUni onandCar tesianproduct
C: Combi nat ionofsel ect i
onandCar t
esi
anpr oduct
D: Combi nationofpr oj
ect ionandCar tesianproduct
Q.no49.TheRDBMSt ermi nologyf orar owi s_____
_ _
_.
A: Tupl e.
B: Relat i
on.
C: Attribut e.
D: Degr ee.
Q.no50.Whi chSQLQuer yi suset oremov eat ableandallitsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no51.Whi char ethet woway sinwhi chent i
tiescanpar t
ici
pateina
rel
at i
onshi p?
A: Passi v eandact i
ve
B: Tot al andpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar t
ial
Q.no52.Whi choft hef ollowingi snott rueforNor malizat
ion?
A: Remov esr edundancy
B: Remov esi nser t
ionanomal y
C: Decomposest her elation
D: Quer yexecut i
onbecomesf ast
er
Q.no53.Ther esultoft heUNI ONoper ationbetweenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q.no54.The_ ________pr otocolensur esf reedom from deadlock.
A: Two- phasel ockingpr ot ocol
B: Strictt wo- phasel ockingpr otocol
C: Rigor oust wo-phasel ockingpr otocol
D: Timest ampor deri
ngpr otocol
Q.no55.Cr eatetabl eempl oyee( namev archar,idint
eger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrit
yconst raint
Q. no56.Whi choft hefol l
owi ngisnotapr opertyofat ransact
ion?
A: Atomi city
B: Consi stency
C: Integrit
y
D: Dur abil
ity
Q. no57.Dupl icat ionofdat aatsev eralplacesi sknownas_ ___
A: Concur rentaccessanomal i
es
B: Dat aisolation
C: Dat ainconsi stency
D: Dat aredundancy
Q. no58.I far elat ionisi nBCNF, thenitisalsoi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no59.Consi dert hef oll
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi nar yt ablesi sinBCNF
Whi choft hef ol lowi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i strue
C: S2i strue
D: Bot hS1andS2ar efalse
Q. no60.Amongstt heACI Dpr operti
esofat ransacti
on, t
he'Durabi
li
ty'
proper ty
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, eveni ft hereisaf ail
ureofanyki nd
Q. no1.Whent hechangescausedbyanabor tedtransacti
onhav ebeen
undone,
thet r
ansact i
oni ssai dtobe_ _______
_ .
A: Failed
B: commi t
ted
C: par ti
all
ycommi t
ted
D: rolledback.
Q.no2.Sel ect*f rom empl oyeeWhatty peofstatementisthi
s?
A: DML
B: Integrityconst raint
C: DDL
D: View
Q.no3.Hi er archi calmodeli salsocall
ed______
___.
A: Treest r
uct ur e
B: PlexSt r
uct ur e
C: Nor mal izeSt r
uct ure
D: Tabl eSt ruct ure
Q.no4.Theuser swhouseeasy -t
o-usemenuar ecall
ed
A: Sophi sticatedenduser s
B: Naï veuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no5.4NFi sdesi gnedt ocopewi t
h:
A: Transi ti
v edependency
B: Joindependency
C: Mul tivalueddependency
D: Funct ional dependency
Q.no6.I nanEnt ity-Relat
ionshi
pDiagram “Diamonds”
represent s_ ____ ____ _
_______
_
A: Attributes
B: Mul ti-
valuedat tr
ibutes
C: Weakent it
yset
D: Rel ati
onshi pset s
Q.no7.I nE- RDi agr am deri
vedattr
ibutearerepresentedby__
___
___
.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no8.Theov eralldescripti
onofadat abaseiscalled___
___.
A: Dat aintegr ity
B: Dat amani pul ation
C: Dat abaseschema
D: Datadef initi
on
Q.no9.Whi choft hef ollowingshouldbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary )
B: Avg(sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no10.E- Rmodel ingt echniqueis:
A: Top-downmet hod
B: Bottom- upmet hod
C: Right-l
ef tappr oach
D: Treest ruct ure
Q.no11.E- Rmodelusest hissymboltorepresentweakentityset?
A: Dottedr ectangl e
B: Diamond
C: Doubl yout l
inedr ectangle
D: Dotteddi amond
Q.no12.Cr ossPr oducti sa:
A: UnaryOper ator
B: TernaryOper ator
C: BinaryOper ator
D: Notanoper ator
Q.no13.I fBi sanat t r
ibuteandA→B, ThenBi ssaidtobe________byA.
A: Logicallyi mpl ied
B: Functional l
yimpl ied
C: Logicallydet ermi ned
D: Functional l
ydet ermi ned
Q.no14.Tor emov ear elati
onf r
om anSQLdat abase,weuset he_ _
___
_
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no15.A‘ book’ isa_ _ ____
___ty
peofentit
y.
A: concept ual
B: concret e
C: real
D: abstract
Q.no16.Thi skeyt hatuni quelyi
denti
fi
eseachr ecordiscal
led
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: FieldName
Q.no17.Whatdoy oumeanbyonet omanyr elationshi
pbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no18.Toappl ytheaggr egatefuncti
on,toagr oupofsetof
tuples__ _____ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no19.I nwhi chstat eonegat hersandli
stallthenecessaryfi
eldsfort
he
databasedesi gnpr oject.
A: Dat aDef i
ni t
ion
B: Dat aRef i
nement
C: Establ i
shi ngRel ationship
D: Dat adel etion
Q.no20.Rel at i
onalcal culusisa:
A: Procedur al language
B: Non- Procedur al l
anguage
C: Dat adef initionlanguage
D: Highl ev el l
anguage
Q.no21.I nE- Rdi agram gener ali
zati
onisrepresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no22.Al laggr egat efunctionsexcept_____ignorenullv
aluesinthei
r
i
nput
coll
ect i
on.
A: Count (
at t
ribut e)
B: Count (
* )
C: Av g
D: Sum
Q.no23.The_ _
__ __connecti
veisusedtotestforabsenceofset
member shi p.
A: except
B: exist s
C: noti n
D: in
Q.no24.Aggr egatef uncti
onsarefuncti
onsthattakea_ _______
__ _as
i
nputand
ret
ur nasi ngl evalue.
A: Col lect i
onofv alues
B: Singl ev al ue
C: Aggr egat evalue
D: Tabl es
Q.no25.Whoi smor econcernedabouttheconceptuall
ev eloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no26.Whi choft hefol
lowingisNotaRelati
on-al
gebraOper ation
A: Select
B: Uni on
C: Rename
D: Dropt abl e
Q.no27.Funct i
onalDependenci esarethetypesofconst r
aintsthatare
based
on___ __ _
A: Key
B: Keyr ev isited
C: Super setkey
D: Tupl e
Q.no28.Whi choft hefol
lowingisanunaryoperati
on?
A: Select i
onoper at i
on
B: Gener alizedsel ection
C: Primi t i
veoper ation
D: Proj ect i
onoper at i
on
Q.no29.Whi choft hefol
lowingfi
eldshaswidthof8by tes?
A: Memo
B: Number
C: Dat e/time
D: Hy perlink
Q.no30.I fev erynon- keyat tr
ibut
eisfuncti
onallydependentonthe
pri
mar ykey ,
ther elati
onwi llbei n__ ____
_
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal For m
D: Four thFor mal Form
Q.no31.Whi choft hef oll
owingisnotModi f
icationoftheDatabase
A: Del eti
on
B: I
nser t
ion
C: Sor ti
ng
D: Updat ing
Q.no32.I ndomai nr elati
onalcalculuswecreateav ar
iabl
efor
every ________
A: Row
B: Col umn
C: Tabl e
D: At t
ribute
Q.no33.NULLi s___ _
_ _____.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f ori ntegerandblankforcharacter
D: Notav al
ue
Q.no34.Thet erm_ ___ ___i
susedt orefert
oar ow.
A: At t
ribute
B: Tupl e
C: Field
D: Instance
Q.no35.The_ _ ____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: St r
uctur e
D: Pr i
mar ykey
Q.no36.Theempl oyeesal aryshouldnotbegr eaterthanRs.2000.Thi
sis
_______
A: i
nt egrityconst raint
B: referent ial constraint
C: over -def inedconst r
aint
D: feasi bleconst raint
Q.no37.Whi choft hef ollowi
ngisnotal evelofdat
aabstraction?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no38.Af unct i
ont hathasnopar ti
alfuncti
onaldependenciesisin
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no39.I nt he_ _
_ _
_ _____normalform,acomposi t
eattr
ibuteisconver
ted
to
i
ndiv i
dualat tri
but es.
A: Fir
st
B: Second
C: Third
D: Four th
Q.no40.Whi choft hef ollowi
ngenabl esustov i
ewdatafrom at abl
e
basedona
specificcr i
t erion
A: For m
B: Quer y
C: Macr o
D: Repor t
Q.no41.Cust omerwi thdrawi
ngmoneyf rom ATM i
sanexampl e
of______ ___ _
A: Appl icat ionpr ogrammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticat eduser
Q.no42.Mi nimalSuper keysarecall
ed
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no43.Af uncti
onaldependencyi sar elat
ionshi
pbet weenoramong:
A: Tabl es
B: Rows
C: Relat ions
D: Attribut es
Q.no44.whi chofthefoll
owi ngisnotadat abaseobject?
A: Tabl es
B: Quer ies
C: Relat ionships
D: Repor ts
Q.no45.Whi chnamemustbeuni quewi thi
nadat abase?
A: Tabl e
B: Fi
el d
C: Recor d
D: Char act er
Q.no46.At ablejoi
nedwithi tsel
fiscall
edas_ ___
____
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no47.TheRDBMSt ermi nologyforar owis______
__.
A: Tupl e.
B: Relat ion.
C: Attribut e.
D: Degr ee.
Q.no48.I none- t
o-manyrelationshipthetableon'many '
si deiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Child
Q.no49.Whi chSQLQuer yi suset oremov eatableandal lit
sdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no50.I nSQLt hestatementsel ect*fr
om R,Sisequivalentto____
___.
A: Select*f rom Rnaturalj
oi nS
B: Select*f rom Rcr ossj oi
nS
C: Select*f rom Runi onj oi
nS
D: Select*f rom Ri nnerj oi
nS
Q. no51._ ______al l
owust oidentif
yuniquelyatupl
eint herelati
on.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q. no52.Af terthef i
nalst atementofat r
ansacti
onhasbeenexecut ed,a
transact ionent er sina_ ________st
ate.____
___.
A: Act i
ve
B: aborted
C: Commi t
ted
D: Par t
iall
ycommi tted
Q. no53.At ablehasf ieldsF1, F2,F3, F4,F5witht
hef oll
owingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor mal ization,thi
st abl
eisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no54.I feverynon- keyat tr
ibuteisfuncti
onal
lydepedentprimar ykey,
thent he
relationwi l
lbei n___ __________.
A: Fi
rstnor mal f orm
B: Secondnor mal form
C: ThirdNor mal form
D: Four t
hnor mal form
Q. no55.I nthe_ _ ________nor malform, acomposit
eatt r
ibut
ei sconverted
to
i
ndi vidualat tri
but es
A: Fi
rst
B: Second
C: Third
D: Four t
h
Q. no56.At ableont hemanysi deofaonet omanyormanyt omany
rel
at i
onshi p
must :
A: Bei nSecondNor mal For m(2NF)
B: Bei nThi rdNor mal For m( 3NF)
C: Hav easi ngleat tributekey
D: Hav eacomposi tekey
Q.no57.I nt her elat i
onalmodel ,thenumberofat tribut
esandnumberof
tuples
i
riar elationar et er medas_ ___
_ _____
and_ ______ _
_ ____
_respect i
vel
y
A: Cardi nalit
y ,domai n
B: Degr ee, cardi nal i
ty
C: Domai ndegr ee
D: Cardi nalit
y ,degr ee
Q.no58.Whi choft hef ollowi ngoper ati
oni susedi fwear einterest
edin
only
certaincol umnsofat abl e?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q.no59.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no60.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eat
es_ _____
A: Parent -Chi l
dr el
at ionshi pbet weent het ablest hatconnectt hem
B: Manyt omanyr elationshi pbet weent het ablest hatconnectt hem.
C: Networ kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elationshi pbet weent het ablest hatconnectt hem.
Q.no1.Theconcept ualmodeli s_ _
_______.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwareandsof twar e
D: Independentofbot hhar dwareandsof t
war e
Q.no2.Whent hechangescausedbyanabor t
edt ransacti
onhav ebeen
undone,
thet r
ansact i
oni ssai dt obe_ __
_ _____.
A: Fail
ed
B: commi tted
C: parti
allycommi tted
D: roll
edback.
Q.no3.Dat ar edundancymayl eadt o:
A: Datai ntegr it
y
B: Atomi citypr oblem
C: Datai nconsi stency
D: Dataabst r
action
Q.no4.Whati sACI Dpr oper t
iesofTr ansactions?
A: Atomi city,Consi stency ,Isolati
on,Database
B: Atomi city,Consi stency ,Isolati
on,Durabili
ty
C: Atomi city,Consi stency ,Inconsistent,Durabil
i
ty
D: Automat ically,Concur rency ,I
solati
on, Durabi
li
ty
Q.no5.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponent
s
except__ ____ __
A: Users.
B: Separ atef il
es
C: Database.
D: Databaseadmi nistr
at or
Q.no6.I nanEnt ity-Rel
at ionshipDi agram “Diamonds”
represent s__ ___________ _____
A: Attri
but es
B: Multi-
v aluedat t
ributes
C: Weakent it
yset
D: Relationshi pset s
Q.no7.Hi erar chicalmodeli sal socalled________
_.
A: Treest ruct ure
B: PlexSt ruct ure
C: Normal i
zeSt r
uct ure
D: TableSt ructure
Q.no8.Keyt orepr esentr elati
onshi pbetweent ablesiscal
led
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dateKey
Q.no9.4NFi sdesi gnedt ocopewi th:
A: Transitivedependency
B: Joindependency
C: Mul t
iv alueddependency
D: Funct i
onal dependency
Q.no10.I nSQL‘ relat i
onAcont ainsr elati
onB’ canbewr it
tenas
A: Notexi stsBexceptA
B: exist sBexceptA
C: Notexi stsAexceptB
D: exist sAexceptB
Q.no11.Whi choft hef oll
owi ngist hest ructureoft heDat abase?
A: Tabl e
B: .Schema
C: Rel ation
D: Struct ure
Q.no12.Whi choneoft hefollowingi snott rueforav iew:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav i
rtual table.
C: Av iewdef initi
oni spermanent l
yst oredaspar toft hedat abase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no13.Fort hegi v ensetoff uncti
onaldependencyF, it
’sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no14.Sel ect*f rom empl oyeeWhatt ypeofst atementi st his?
A: DML
B: Integr it
yconst raint
C: DDL
D: View
Q.no15.Whi choft hef oll
owi ngat t
ribut ecanbef urtherdividedinto
subpar ts
A: Simpl eattribute
B: Mul tivaluedat t
ribut e
C: Composi teat tr
ibut e
D: Der ivedat tribute
Q.no16.Adat adict ionaryisar eposi torythatmanages_ _
_ __
A: Memor y
B: Met adata
C: Spel lChecker
D: Dat aVal i
dat or
Q.no17.Thebasi cdat atypechar (n)i sa_ ____lengt hchar acterstr
ingand
varchar(n)i s_ __ __lengt hchar acter
A: Fi
xed, equal
B: Equal, var iable
C: Fi
xed, var iable
D: Variabl e, equal
Q.no18.Whi choneoft hefollowi nguni quelyidentif
iestheelement
sinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no19.Dat aMani pul at i
onLanguage( DML)i snott o__
_ _
__
A: Createi nformat i
ont ableint heDat abase
B: I
nser ti
onofnewi nfor mationi ntotheDat abase
C: Deletionofi nformat i
oni nt heDat abase
D: Modi ficat ionofi nf ormat ioni ntheDat abase
Q.no20.Car tesianpr oducti nr elati
onalal gebrai s:
A: aUnar yoper ator
B: aBinar yoper ator
C: aTer nar yoper at
or
D: notdef ined
Q.no21.Asubschemaexpr esses_ ___ _
____.
A: Thel ogi cal view
B: Thephy sical view
C: Theext er nal view
D: Thei nter nal v i
ew
Q.no22.Theuser swhouseeasy -
to-usemenuar ecall
ed
A: Sophi sticat edenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no23.Tor emov ear elati
onf r
om anSQLdat abase,weuset he__
___
_
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no24.Al laggr egat ef unctionsexcept_ ___
_i gnorenullval
uesint
hei
r
i
nput
collection.
A: Count (
at tri
bute)
B: Count (*)
C: Av g
D: Sum
Q.no25.E- Rmodel ingtechniqueis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -
leftappr oach
D: Treest ructur e
Q.no26.Whi choft hefollowingisNotaRel ation-al
gebr aOperat
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no27.A_ _ _
_ ____inat ablerepresentsarelati
onshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no28.Themet hodofaccesswhi chuseskeyt ransformationi
sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no29.Whi choft hefollowingaret heproperti
esofent it
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no30._ ___ _
_ _pr oducesther el
ationthathasat tr
ibutesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no31.Whi choft hefollowingfi
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no32.I ndomai nr elationalcalculuswecreateav ar
iabl
efor
every_ ___ ____
A: Row
B: Column
C: Tabl e
D: Attribut e
Q.no33.The_ _____
ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no34.Thet erm_ ___ ___isusedt orefert
oar ow.
A: Attribut e
B: Tupl e
C: Field
D: Instance
Q.no35.Funct ionalDependenci esarethetypesofconst rai
ntsthatare
based
on__ ____
A: Key
B: Keyr evisit
ed
C: Super setkey
D: Tupl e
Q.no36.NULLi s______ ___ _
.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f ori ntegerandbl ankforcharacter
D: Notav alue
Q.no37.Whati sar elationshi pcall
edwheni tismai nt
ainedbetweent wo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no38.Af i
lemani pul ationcommandt hatextractssomeoft her ecor
ds
fr
om a
fil
eiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no39.Thecol l
ecti
onofi nterr
elat
eddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst racti
on
Q.no40.Whi choft hef oll
owingisnotModi fi
cationoft heDat abase
A: Del eti
on
B: Inser t
ion
C: Sor ti
ng
D: Updat ing
Q.no41.Whi chnor malf ormisconsi deredadequat eforr elat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no42.Whi choft hef oll
owingintruer egar dingRef erent i
alIntegri
ty?
A: Ev erypri
mar y-
keyv aluemustmat chapr imar y-keyv alueinan
associ atedtable
B: Ev erypri
mar y-
keyv aluemustmat chaf oreign-keyv aluei nanassoci at
ed
table
C: Ev eryforeign-keyvaluemustmat chapr i
mar y-
keyv aluei nan
associ atedtable
D: Ev eryforeign-keyvaluemustmat chaf or eign-keyv alueinanassoci ated
table
Q.no43.I fever ynon-keyat t
ri
buteisf unctional l
ydependentont he
primar ykey ,
ther elati
onwi l
lbein__ ___
__
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNormal Form
D: Four thFor mal Form
Q.no44.Rel at i
onalAlgebr ais
A:DataDef i
nitionLanguage
B:Met aLanguage
C:Procedur al quer yLanguage
D:DataMani pul ati
onLanguage
Q.
no45.Whi choft hef ol
lowingisanunar yoper ati
on?
A:Select ionoper ation
B:Gener alizedsel ection
C:Primi tiveoper ati
on
D:Project i
onoper ation
Q.
no46.Thenat ural joinisequalt o:
A:Cartesi anPr oduct
B:Combi nat i
onofUni onandCar tesi
anpr oduct
C:Combi nat i
onofsel ectionandCar tesianpr oduct
D:Combi nat i
onofpr ojectionandCar tesianpr oduct
Q.
no47.Whi choft hef ol
lowingisnotal ev elofdataabstract
ion?
A:Phy sical Lev el
B:Crit
ical Lev el
C:Logi cal Lev el
D:ViewLev el
Q.
no48.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of
______ _ ___
A:Appl icat ionpr ogr ammer
B:Naïv euser
C:Speci al izeduser
D:Sophi sticateduser
Q.
no49.TheRDBMSt erminologyforar owi s_ _
______.
A:Tupl e.
B:Relat ion.
C:Attri
but e.
D:Degr ee.
Q.
no50.At ablej oinedwi thit
selfiscall
edas_ _____
__
A:Join
B:SelfJoi n
C:OuterJoi n
D:Equi Joi n
Q.
no51.Cr eat et ableempl oyee(namev ar char, i
dinteger
)Whattypeof
st
atement
i
sthis?
A:DML
B: DDL
C: View
D: Integrit
yconst rai nt
Q. no52.Consi dert hefol l
owi ng
S1:For eignkeyal lowsnul lvalues.
S2:Ev erybi narytabl esisi nBCNF
Whi choft hef oll
owi ngist rue?
A: Bot hS1andS2ar et
r ue
B: S1i strue
C: S2i strue
D: Bot hS1andS2ar efalse
Q. no53.Whi choft hefol l
owi ngisnotapr oper t
yofatransact
ion?
A: Atomi city
B: Consi stency
C: Integrit
y
D: Dur abil
ity
Q. no54.I far el
ationi sinBCNF, theniti
sal soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q. no55.Whi choft hefol l
owi ngisnott r
uef orNormali
zati
on?
A: Remov esr edundancy
B: Remov esinser tionanomal y
C: Decomposest her el
at i
on
D: Quer yexecut i
onbecomesf aster
Q. no56.Af unctionaldependencyoft hefor m x—>yi stri
vali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no57.Amongstt heACI Dpr operti
esofat r
ansact
ion,t
he'Durabi
li
ty'
proper ty
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsystem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s,ev eni fther eisaf ail
ureofanyki nd
Q. no58.Whi char et het woway sinwhi chent i
tiescanpart
ici
patei
na
relat i
onshi p?
A: Passiv eandact ive
B: Totalandpar t
ial
C: SimpleandCompl ex
D: simpleandpar ti
al
Q. no59.Dupl icationofdat aatsev er alplacesisknownas_ __
_
A: Concur rentaccessanomal i
es
B: Dataisol ation
C: Datainconsi stency
D: Datar edundancy
Q. no60.Af tert hef inalst atementofat ransact i
onhasbeenexecuted,
a
transact ionent ersi na_ ________state.__
_ ___
_.
A: Activ
e
B: aborted
C: Commi tted
D: Parti
allycommi tt
ed
Q. no1.A‘ book’ i
sa_ _ _
__ __
_ _
typeofent i
ty.
A: concept ual
B: concret e
C: real
D: abstract
Q. no2.Dat ar edundancymayl eadt o:
A: Dataint egrity
B: Atomi citypr oblem
C: Datainconsi stency
D: Dataabst raction
Q. no3.Thi skeyt hatuni quelyidentifi
eseachr ecor
discall
ed
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fiel
dName
Q. no4.I nwhi chst ateonegat hersandl i
stallthenecessar
yfiel
dsfort
he
dat abase
desi gnpr oject .
A: DataDef ini
t i
on
B: DataRef i
nement
C: EstablishingRel ationship
D: Dat adel eti
on
Q.no5.Whi choft hef ollowingshoul dbeusedt of i
ndthemeanoft he
salary?
A: Mean( sal ary )
B: Av g(sal ary)
C: Sum( sal ary)
D: Count (salary )
Q.no6.I fBi sanat tr i
but eandA→B, ThenBi ssaidtobe_ ___
____byA.
A: Logi callyi mpl i
ed
B: Funct ional lyi mpl i
ed
C: Logi callydet er mi ned
D: Funct ional lydet er mi ned
Q.no7.Whati sACI Dpr oper t
iesofTr ansact ions?
A: Atomi city,Consi stency ,Isolat
ion,Dat abase
B: Atomi city,Consi st ency ,Isolat
ion,Dur abili
ty
C: Atomi city,Consi stency ,Inconsistent,Dur abil
i
ty
D: Aut omat ically ,Concur r
ency ,I
solation,Dur abi
li
ty
Q.no8.Thedat abaseenv ir
onmenthasal lofthefoll
owingcomponents
except ___ __ ___
A: User s.
B: Separ at ef i
les
C: Dat abase.
D: Dat abaseadmi ni strator
Q.no9.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ter naryOper at or
C: Binar yOper at or
D: Notanoper at or
Q.no10.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no11.Aggr egat ef unct i
onsar ef unctionst hattakea_ _
______
___as
i
nputand
ret
urnasi ngl ev alue.
A: Col l
ect ionofv alues
B: Singlev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no12.Toappl ytheaggr egatef uncti
on, toagr oupofsetof
tuples_ ______clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no13.I nE- Rdi agr am gener ali
zat i
onisr epresentedby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no14.Rel ationalcal cul
usi sa:
A: Procedur allanguage
B: Non- Procedur allanguage
C: Dat adef i
niti
onl anguage
D: Highl ev ellanguage
Q.no15.Theov eralldescripti
onofadat abasei scalled__
____
.
A: Dat aint egrit
y
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef i
niti
on
Q.no16.E- Rmodelusest hissy mbolt orepr esentweakent i
tyset?
A: Dot tedr ectangl e
B: Diamond
C: Doubl yout linedr ectangle
D: Dot teddi amond
Q.no17.Theconcept ualmodeli s_ ____
__ _
_ .
A: Dependentonhar dware
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof twar e
D: Independentofbot hhar dwar eandsof t
war e
Q.no18.Whatdoy oumeanbyonet omanyr el
ationshipbet
weenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no19.Whent hechangescausedbyanabor tedt
ransacti
onhav ebeen
undone,
thet r
ansact i
oni ssai dt obe______
___.
A: Failed
B: commi tted
C: partial l
ycommi tted
D: roll
edback.
Q.no20.The_ ___ __connect i
veisusedt otestforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no21.I nE- RDi agr am deri
vedat t
ri
butearerepresentedby____
____.
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no22.Asubschemaexpr esses____
_____.
A: Thel ogical view
B: Thephy sical view
C: Theext ernal view
D: Thei nternal view
Q.no23.Whi choft hef oll
owingattri
butecanbef urtherdi
vi
dedinto
subpar ts
A: Simpl eat tr
ibut e
B: Mul tivaluedat tri
but e
C: Composi t
eat tribut e
D: Der i
v edat t
ribut e
Q.no24.Whi choft hef oll
owingisthestructur
eoft heDatabase?
A: Tabl e
B: .Schema
C: Relat ion
D: Struct ur e
Q.no25.Al laggr egat ef unct
ionsexcept_____ignorenullv
aluesinthei
r
i
nput
coll
ect ion.
A: Count (attri
but e)
B: Count (
* )
C: Av g
D: Sum
Q.no26.I none- t
o-manyr elat
ionshipt hetabl
eon' many '
sideiscal
ledas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no27.Themet hodofaccesswhi chuseskeyt r
ansformationisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no28.Whi chSQLQuer yisuset or emov eatableandallitsdat
afrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no29.Whi choft hef oll
owingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per l
ink
Q.no30.Theempl oy eesalaryshoul dnotbegr eatert
hanRs.2000.Thi si
s
_______
A: i
nt egr i
tyconst raint
B: referent i
al const raint
C: over -defi
nedconst r
aint
D: feasi bleconst r
ai nt
Q.no31.Whi choft hef oll
owingar ethepr oper
tiesofentit
ies?
A: Groups
B: Tabl e
C: Attributes
D: Swi tchboar ds
Q.no32._ _____ _pr oducest herelati
ont hathasattri
butesofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersection
Q.no33.whi choft hef oll
owi ngisnotadat abaseobject?
A: Tabl es
B: Quer ies
C: Relat i
onshi ps
D: Repor t
s
Q.no34.I nt he_ _
_ _______nor malform,acomposi teattr
ibuteisconvert
ed
to
i
ndi vi
dualat tri
butes.
A: First
B: Second
C: Third
D: Four th
Q.no35.Whi chnamemustbeuni quewi thi
nadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char acter
Q.no36.A_ _ ____
_ _inat ablerepresentsarelat
ionshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no37.I nSQLt hest atementsel ect*fr
om R,Sisequivalentto__
_____.
A: Select*f r om Rnat uraljoi
nS
B: Select*f rom Rcr ossjoinS
C: Select*f r om Runi onjoinS
D: Select*f r om Ri nnerjoinS
Q.no38.Whi choft hefollowingenabl esustoviewdat afrom atable
basedona
speci f
iccr i
ter i
on
A: For m
B: Quer y
C: Macr o
D: Repor t
Q.no39.Mi nimalSuper keysar ecall
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no40.Whi choft hefollowingisNotaRel at i
on-al
gebraOperat
ion
A: Select
B: Union
C: Rename
D: Dropt able
Q.no41.I ndomai nrel
ationalcalcul
uswecr eateav ar
iabl
efor
every____ ____
A: Row
B: Column
C: Table
D: Attri
but e
Q.no42.Af unct i
onaldependencyi sarelati
onshi pbetweenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q.no43.Af unct i
onthathasnopar t
ialf
unct ionaldependenci
esisi
n
__
_ ____for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no44.Thet er
m_ ______isusedt oref
ert oar ow.
A: Attri
but e
B: Tuple
C: Fiel
d
D: Instance
Q.no45.Thecol l
ecti
onofi nter
relat
eddat aiscalledas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst racti
on
Q.no46.Cust omerwi thdrawingmoneyf rom ATM i sanexampl e
of
_ ________ _
A: Appl i
cat i
onpr ogrammer
B: Naïveuser
C: Speci ali
zeduser
D: Sophi sticat eduser
Q.no47.At ablejoinedwi thitselfi
scall
edas_ ______
_
A: Join
B: SelfJoi n
C: OuterJoi n
D: Equi Join
Q.no48.Af i
lemani pul ati
oncommandt hatext r
actssomeoft herecords
from a
fil
eiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no49.TheRDBMSt erminologyf orarowi s________.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no50.Whi choft hef oll
owingi ntrueregardingRef erentialI
ntegr
ity
?
A: Everypr imar y-
keyv aluemustmat chapr i
mar y-keyv alueinan
associat edt abl e
B: Everypr imar y-
keyv aluemustmat chaf orei
gn-keyv alueinanassoci at
ed
table
C: Everyf or eign-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associat edt abl e
D: Everyf or eign-keyv aluemustmat chaforeign-keyv alueinanassociated
table
Q.no51._ __ ___ _all
owust oident i
fyuni
quelyat uplei nt herel
ati
on.
A: Super key
B: Domai n
C: Attri
but e
D: Schema
Q.no52.Doesi ndext akespacei nthedisk?
A: Indexesar enev erst oredondi sk
B: Itstoresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est or edondi sk
Q.no53.Cr eatet abl eempl oy ee( namev archar,idi nteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrityconst r
ai nt
Q.no54.At abl ehasf i
eldsF1, F2, F3, F4, F5wi tht hef ol
lowingf unctional
dependenci es
Fi—>F3,
F2—>F4
(FI,
F2)—>F5
Intermsofnor mal ization,thistableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no55.Ther esultoft heUNI ONoper ationbet weenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q.no56.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eates_ _____
A: Par ent -
Chi ldr el
at ionshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elati
onshi pbet weent het ablest hatconnectt hem.
C: Net wor kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elationshipbet weent het ablest hatconnectt hem.
Q.no57.I nt her elat i
onalmodel ,thenumberofat tributesandnumberof
tuples
i
riar elationar et er medas_ _________
and_ ______ _
_ _____respect i
vely
A: Car dinal i
ty,domai n
B: Degr ee, car dinal i
ty
C: Domai ndegr ee
D: Car dinal it
y,degr ee
Q.no58.I fev erynon- keyat tr
ibutei sfunctional l
ydepedentpr imarykey ,
thent he
rel
at i
onwi l
lbei n__ ___________.
A: Fir
stnor mal form
B: Secondnor mal form
C: ThirdNor mal for m
D: Four thnor mal for m
Q.no59.I nt he_ ___ ______nor malform, acomposit
eatt
ri
buteisconv
ert
ed
t
o
i
ndi v
idualat tr
ibutes
A: Fir
st
B: Second
C: Third
D: Four th
Q.no60.At abl eont hemanysi deofaonet omanyormanyt omany
rel
ationshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngleat tributekey
D: Hav eacomposi tekey
Q.no1.4NFi sdesi gnedt ocopewi th:
A: Transi ti
v edependency
B: Joindependency
C: Mul tival ueddependency
D: Funct ional dependency
Q.no2.Dat ar edundancymayl eadto:
A: Dat aint egr i
ty
B: Atomi ci typr oblem
C: Dat ainconsi stency
D: Dat aabst raction
Q.no3.I nSQL‘ relat i
onAcont ainsrelat
ionB’canbewri
ttenas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no4.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bottom- upmet hod
C: Right -
leftappr oach
D: Treest ruct ure
Q.no5.Adat adict ionaryisar epositorythatmanages_
____
A: Memor y
B: Met adat a
C: SpellChecker
D: DataVal idator
Q.no6.Whi choneoft hef ollowinguni quelyident i
fi
estheelementsinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no7.Theuser swhouseeasy -to-usemenuar ecalled
A: Sophi sticatedenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no8.Whi choneoft hef ollowingi snott ruef orav i
ew:
A: Viewi sder iv
edf rom ot hert ables
B: Viewi sav i
rt
ual tabl e.
C: Av i
ewdef init
ioni sper manent l
yst oredaspar tofthedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no9.Tor emov ear elat i
onf rom anSQLdat abase,weuset he__
___
_
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no10.I nanEnt i
ty-Rel ationshipDi agram “Diamonds”
represent s_ __________ __ ____
_
A: Attri
but es
B: Multi-
v aluedat t
ribut es
C: Weakent ityset
D: Relationshi pset s
Q.no11.Dat aMani pul at i
onLanguage( DML)i snott o____
__
A: Createi nf ormationt ableint heDat abase
B: I
nser ti
onofnewi nf or mationi ntot heDatabase
C: Deletionofi nformat ionint heDat abase
D: Modi ficationofi nf ormat i
oni ntheDat abase
Q.no12.Thi skeyt hatuni quelyident ifi
eseachr ecordiscalled
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no13.Thebasi cdat at y
pechar (n)isa_ _
___lengthcharacterstr
ingand
varchar (n)i s_ _
_ __lengt hcharacter
A: Fixed, equal
B: Equal ,var iable
C: Fixed, var iable
D: Var iable, equal
Q.no14.Hi er archi calmodeli salsocal l
ed_____
____.
A: Treest ruct ure
B: PlexSt r uct ure
C: Nor mal izeSt ruct ure
D: Tabl eSt ruct ure
Q.no15.A‘ book’ isa_ ____
___ _
typeofent i
ty.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no16.Fort hegi v ensetoff uncti
onaldependencyF, i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no17.Car tesianpr oductinr el
ati
onalalgebrais:
A: aUnar yoper ator
B: aBi nar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no18.Sel ect*f rom empl oyeeWhatt ypeofst atementisthis?
A: DML
B: Integr i
tyconst r
ai nt
C: DDL
D: View
Q.no19.Keyt or epr esentrelati
onshipbetweent ablesi
scalled
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no20.I nE- RDi agr am der i
vedat t
ri
butear er epr
esentedby____
____
.
A: Ell
ipse
B: Dashedel li
pse
C: Rectangl e
D: Triangle
Q.no21.I nE- Rdi agram gener ali
zati
onisr epresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rectangl e
D: Triangle
Q.no22.Cr ossPr oducti sa:
A: Unar yOper ator
B: Ternar yOper at or
C: BinaryOper at or
D: Notanoper ator
Q.no23.Theconcept ualmodeli s________
_ .
A: Dependentonhar dwar e
B: Dependentonsof t war e.
C: Dependentonbot hhar dwar eandsoftwar e
D: Independentofbot hhar dwar eandsof t
war e
Q.no24.Whi choft hef ol
lowi ngshoul dbeusedt ofindthemeanofthe
salary?
A: Mean( salary )
B: Avg(sal ary)
C: Sum( sal ary)
D: Count (salary )
Q.no25.I fBi sanat tribut eandA→B, ThenBi ssai
dt obe______
__byA.
A: Logical l
yi mpl ied
B: Funct i
onal lyimpl i
ed
C: Logical l
ydet ermi ned
D: Funct i
onal lydet ermi ned
Q.no26.Whi chnor malf or misconsi deredadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no27.Whi choft hef oll
owingisnotal evelofdataabstracti
on?
A: Phy sical Lev el
B: Criti
cal Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no28.Whi choft hef oll
owingisanunar yoperation?
A: Select ionoper ati
on
B: Gener alizedsel ection
C: Primi tiveoper at i
on
D: Project ionoper ation
Q.no29.Whi chSQLQuer yisuset or emoveat ableandal li
tsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no30.Funct ionalDependenci esar ethetypesofconst rai
ntsthatare
based
on__ _
_ __
A: Key
B: Keyr evisi t
ed
C: Super setkey
D: Tupl e
Q.no31.Theempl oy eesalaryshoul dnotbegr eaterthanRs.2000.Thisis
_______
A: i
ntegr i
tyconst rai
nt
B: referent ial const raint
C: over -def inedconst r
aint
D: feasi bleconst raint
Q.no32.Whi choft hef oll
owingfieldshaswi dt
hof8by t
es?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no33.Themet hodofaccesswhi chuseskeyt r
ansf or
mat i
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent i
al
Q.no34.Whi choft hef oll
owingar ethepr opertiesofent
it
ies?
A: Gr oups
B: Tabl e
C: At tri
but es
D: Swi t
chboar ds
Q.no35.Thenat uraljoi
nisequalt o:
A: Car tesi anPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nationofsel ecti
onandCar tesianpr oduct
D: Combi nat i
onofpr oject
ionandCar tesianpr oduct
Q.no36.The_ ___ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: St ructur e
D: Pr i
mar ykey
Q.no37.I fev er ynon- keyat tr
ibut
ei sf unctionall
ydependentonthe
pri
mar ykey ,
ther elationwi llbei n_____
__
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no38.Whi choft hef oll
owingisnotModi f
icationoft
heDatabase
A: Del etion
B: I
nser tion
C: Sor ting
D: Updat ing
Q.no39.Rel ationalAl gebrais
A: Dat aDef initionLanguage
B: Met aLanguage
C: Pr ocedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no40.NULLi s_ _________.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandbl ankf orchar acter
D: Notav al
ue
Q.no41.Whati sar elationshi pcalledwheni ti
smai ntainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nary
Q.no42.I none- to-
manyr el
ationshipt hetableon' many 'si
deiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no43._ ___ _
__pr oducest her el
ationthathasat tri
but esofR1andR2
A: Car tesianpr oduct
B: Difference
C: Product
D: Intersect ion
Q.no44.whi choft hef ollowi ngi snotadat abaseobj ect?
A: Tabl es
B: Quer ies
C: Relat ionships
D: Repor ts
Q.no45.I ndomai nr elationalcal culuswecr eateav ari
abl efor
every_ ___ __
_ _
A: Row
B: Col umn
C: Tabl e
D: Attribut e
Q.no46.At ablejoinedwi thitselfi
scal l
edas_ ___
_ ___
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no47.Whi choft hef ollowingi sNotaRel ati
on-algebr aOperati
on
A: Select
B: Union
C: Rename
D: Dropt able
Q.no48.TheRDBMSt ermi nologyf orar owi s_
______ _.
A: Tupl e.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no49.Mi nimalSuper key sar ecal l
ed
A: Schemakey s
B: Candi dat ekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no50.Cust omerwi t
hdr awingmoneyf r
om ATM isanexampl e
of_______ _
_ _
A: Appl i
cat ionpr ogr ammer
B: Naïveuser
C: Speci al
izeduser
D: Sophi sticat eduser
Q.no51.Whi choft hef ollowingoper ati
oni susedifweareinterest
edi
n
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q.no52.The_ _______ _
pr otocolensur esfreedom f
rom deadlock.
A: Two- phasel ockingpr ot ocol
B: Stri
ctt wo- phasel ockingpr otocol
C: Rigoroust wo- phasel ockingpr otocol
D: Timest ampor deringpr otocol
Q.no53.Whi choft hef ollowingi snott rueforNormali
zation?
A: Remov esr edundancy
B: Remov esi nser t
ionanomal y
C: Decomposest her elation
D: Quer yexecut i
onbecomesf ast
er
Q.no54.Dupl i
cat ionofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal ies
B: Datai solat i
on
C: Datai nconsi stency
D: Datar edundancy
Q.no55.Whi choft hef ollowingi snotapr opert
yofatransaction?
A: Atomi city
B: Consi stency
C: Int
egrity
D: Durabili
ty
Q.no56.Consi dert hef ol l
owi ng
S1:For ei
gnkeyal lowsnul lvalues.
S2:Ev erybinar yt abl esi si nBCNF
Whi choft hef ollowi ngi st rue?
A: BothS1andS2ar et rue
B: S1ist r
ue
C: S2i str
ue
D: BothS1andS2ar ef alse
Q.no57.I nt he_ ___ ___ ___nor malf orm, acomposi t
eattri
butei sconver
ted
to
i
ndiv i
dualat tributes
A: Fir
st
B: Second
C: Third
D: Fourth
Q.no58.I far elationi sinBCNF, thenitisal soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no59.Apr imar ykeyi scombi nedwi t
haf oreignkeycr eates_____
_
A: Parent-Chi l
dr elat ionshi pbet weent het ablest hatconnectthem
B: Manyt omanyr el ationshi pbet weent hetabl esthatconnectt hem.
C: Networ kmodel bet weent het ablesthatconnectt hem.
D: Manyt ooner elat ionshi pbet weent het ablest hatconnectthem.
Q.no60._ _ ____ _al l
owust oident if
yuniquel yat upleinther el
at i
on.
A: Superkey
B: Domai n
C: Attri
bute
D: Schema
Q.no1.I nwhi chst ateonegat hersandl istallthenecessar yfieldsfort
he
database
designpr oject .
A: DataDef inition
B: DataRef inement
C: Establi
shi ngRel at i
onshi p
D: Datadel etion
Q.no2.The_ _____ connect i
vei susedtot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no3.Asubschemaexpr esses_____
__ __.
A: Thel ogical view
B: Thephy sical view
C: Theext ernal vi
ew
D: Thei nternal view
Q.no4.Theov eral ldescriptionofadat abasei scalled_
_____.
A: Dat ai ntegr i
ty
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef i
ni t
ion
Q.no5.Whi choft hef oll
owi ngat t
ri
butecanbef urtherdivi
dedinto
subpar ts
A: Simpl eat tri
but e
B: Mul tivaluedat tribut
e
C: Composi teat tribute
D: Der i
v edat tr
ibut e
Q.no6.Whi choft hef oll
owi ngi st
hest ructur
eoft heDat abase?
A: Tabl e
B: .Schema
C: Relat ion
D: Struct ur e
Q.no7.Dat aredundancymayl eadto:
A: Dat ai ntegr i
ty
B: Atomi citypr oblem
C: Dat ai nconsi stency
D: Dat aabst raction
Q.no8.Al laggr egat efunctionsexcept_ ____ignorenullvaluesi
nt hei
r
i
nput
coll
ect ion.
A: Count (attri
but e)
B: Count (*)
C: Avg
D: Sum
Q.no9.Aggr egat ef unctionsaref uncti
onsthatt akea_ _
______
___asinput
and
returnasi ngl ev alue.
A: Collect i
onofv alues
B: Singlev alue
C: Aggr egat ev alue
D: Tabl es
Q.no10.Whent hechangescausedbyanabor tedtransact
ionhavebeen
undone,
thet r
ansact ioni ssai dtobe_ ___
__ _
__.
A: Failed
B: commi tted
C: partiall
ycommi tted
D: roll
edback.
Q.no11.Toappl yt heaggr egat
ef uncti
on,toagr oupofsetof
tuples_ ____ __ clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q.no12.Rel at ionalcal culusisa:
A: Procedur al language
B: Non- Pr ocedur allanguage
C: Datadef initionl anguage
D: Highl ev el language
Q.no13.4NFi sdesi gnedt ocopewi th:
A: Transi tivedependency
B: Joindependency
C: Mul tival ueddependency
D: Funct ional dependency
Q.no14.E- Rmodelusest hissymbolt orepresentweakent i
tyset?
A: Dot tedr ect angle
B: Diamond
C: Doubl yout linedr ectangle
D: Dot teddi amond
Q.no15.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy st emspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no16.Whatdoy oumeanbyonet omanyr elati
onshipbet weenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no17.Whati sACI Dpr oper t
iesofTr ansact ions?
A: Atomi city,Consi stency ,I
sol ation,Dat abase
B: Atomi city
, Consi stency ,I
sol ation,Dur abi
lit
y
C: Atomi city,Consi stency ,I
nconsi stent,Durabi l
it
y
D: Aut omat i
cal ly
, Concur rency ,Isolati
on, Durabili
ty
Q.no18.Thedat abaseenv i
ronmenthasal loft hefoll
owi ngcomponent s
except _ __ _____
A: User s.
B: Separ at efiles
C: Dat abase.
D: Dat abaseadmi nistrat or
Q.no19.I nSQL‘ relationAcont ainsr el
at i
onB’ canbewr itt
enas
A: Notexi stsBexceptA
B: exist sBexceptA
C: Notexi stsAexceptB
D: exist sAexceptB
Q.no20.Dat aMani pul at i
onLanguage( DML)i snotto____ _
_
A: Creat ei nformat i
ont ableint heDat abase
B: Inser tionofnewi nf or mationi nt otheDat abase
C: Del etionofi nformat ionint heDat abase
D: Modi f i
cat i
onofi nf ormat ioni nt heDat abase
Q.no21.Whi choneoft hefollowi ngisnott ruef oraview:
A: Viewi sder ivedf rom ot hert abl es
B: Viewi sav i
rtual tabl e.
C: Av iewdef ini t
ioni sper manent lystoredaspar tofthedat abase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no22.Whi choneoft hefollowi nguniquel yidenti
fi
est heel ementsi
nthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no23.I fBi sanat tri
buteandA→B, ThenBi ssaidtobe_ ___
____byA.
A: Logical lyimplied
B: Funct i
onal l
yimpl i
ed
C: Logical lydetermi ned
D: Funct ional l
ydet ermined
Q.no24.Adat adi cti
onaryisareposit
orythatmanages_ ___
_
A: Memor y
B: Met adat a
C: Spell Checker
D: DataVal i
dator
Q.no25.Theuser swhouseeasy -to-
usemenuar ecal
led
A: Sophi sticatedenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no26.Whi chnamemustbeuni quewithinadatabase?
A: Table
B: Fi
eld
C: Recor d
D: Char act er
Q.no27.Whi choft hef ol
lowi
ngenablesust oviewdatafrom atabl
e
basedona
specificcr iteri
on
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no28.Whi choft hef ol
lowi
ngfiel
dshaswi dthof8by t
es?
A: Memo
B: Number
C: Date/ time
D: Hyper link
Q.no29.Whi choft hef ol
lowi
ngisanunar yoperati
on?
A: Select i
onoper ation
B: Gener al i
zedsel ection
C: Primitiv eoperat i
on
D: Project ionoper ation
Q.no30.Af unct i
ont hathasnopartialf
unctionaldependenciesisin
_______form:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Whi chnor malf ormisconsideredadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no32.I nthe_ _
_ _
__ _
___normalform,acomposi teatt
ri
buteisconvert
ed
to
i
ndividualattr
ibutes.
A: Fir
st
B: Second
C: Third
D: Fourth
Q.no33.Whi chSQLQuer yi
suset oremov eat ableandalli
tsdatafrom
the
database?
A: CreateTable
B: Alt
erTable
C: DropTable
D: Remov eTable
Q.no34.Thecol l
ectionofint
err
elateddataiscal l
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabstracti
on
Q.no35.Af ilemani pulat
ioncommandt hatextractssomeoft herecor
ds
from a
fi
leiscalled
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no36.A_ ___ ___
_i nat ablerepresentsar elati
onshi pamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no37.Theempl oy eesal aryshouldnotbegr eaterthanRs.2000.Thi sis
_______
A: int
egr it
yconst r
aint
B: refer ential const raint
C: over -def i
nedconst raint
D: feasi bleconst raint
Q.no38.I nSQLt hest at ementsel ect*f
rom R, Sisequi valentto_______.
A: Select*f rom Rnat ur aljoi
nS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Ri nnerj oinS
Q.no39.Af unct i
onaldependencyi sar el
ationshi pbet weenoramong:
A: Tabl es
B: Rows
C: Relat ions
D: Attribut es
Q.no40.Whi choft hef ollowingisnotal evelofdat aabst ract
ion?
A: Phy si calLev el
B: Critical Lev el
C: Logi cal Lev el
D: ViewLev el
Q.no41.Whi choft hef ollowingintrueregar dingRef erentialI
ntegrit
y?
A: Ever ypr imar y-
keyv al uemustmat chapr imar y-keyv alueinan
associ at edt abl e
B: Ever ypr imar y-
keyv al uemustmat chaf oreign-keyv aluei nanassociated
table
C: Ever yf orei gn-keyv aluemustmat chapr i
mar y
-keyv aluei nan
associ at edt abl e
D: Ever yf orei gn-keyv aluemustmat chaf or
ei gn-keyv alueinanassoci ated
table
Q.no42.Funct ionalDependenci esar ethety pesofconst r
aintsthatare
based
on_ __
_ _ _
A: Key
B: Keyr ev isi
ted
C: Super setkey
D: Tupl e
Q.no43.Thet erm_ ______isusedt or efertoar ow.
A: At tri
but e
B: Tupl e
C: Field
D: Inst ance
Q.no44.I none- to-manyr elationshi
pt het ableon'many '
sidei
scal
ledas:
A: Par ent
B: Mast er
C: Sist er
D: Chi ld
Q.no45._ _ _____pr oducest herelat
iont hathasat tr
ibutesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Pr oduct
D: Inter sect i
on
Q.no46.Thenat uralj
oini sequalt o:
A: Car tesi anPr oduct
B: Combi nationofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ecti
onandCar tesianpr oduct
D: Combi nat i
onofpr ojecti
onandCar t
esianpr oduct
Q.no47.I fev erynon- keyat tri
buteisf unctionall
ydependentont he
pri
mar ykey ,
ther elat ionwi llbei n_______
A: FirstNor mal Form
B: SecondNor mal Form
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no48.TheRDBMSt ermi nologyforar owis_ _
______.
A: Tupl e.
B: Rel at i
on.
C: At tri
but e.
D: Degr ee.
Q.no49.Rel ati
onalAl gebr ai s
A: Dat aDef i
niti
onLanguage
B: Met aLanguage
C: Procedur alquer yLanguage
D: DataMani pulati
onLanguage
Q. no50.NULLi s_ _____ __ __.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar act
er
C: Thesameas0f ori ntegerandbl ankf orcharacter
D: Notav alue
Q. no51.Doesi ndext akespacei nt hedisk?
A: Indexesar enev erst or edondi sk
B: I
tst oresmemor yasandwhenr equi r
ed
C: Indexest akenospace
D: Yes, I
ndexesar est or edondi sk
Q. no52.Whi choft hef ollowi ngoper ati
oni susedifwear einter
estedin
onl y
cer taincol umnsofat abl e?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOIN
Q. no53.The_ ______ __pr ot ocolensur esfreedom from deadl
ock.
A: Two- phasel ockingpr ot ocol
B: Stri
ctt wo-phasel ocki ngpr otocol
C: Rigoroust wo-phasel ocki ngprotocol
D: Timest ampor deringpr otocol
Q. no54.At abl
ehasf ieldsF1, F2, F3, F4,F5wi ththefol
lowingfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
Int ermsofnor malizat ion, t
histableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no55.Af t
erthef inalst atementofat r
ansactionhasbeenexecut ed,a
transact ionent ersina_ _ _______state.______
_.
A: Active
B: abor t
ed
C: Commi tted
D: Par ti
allycommi tted
Q. no56.At abl eont hemanysi deofaonet omanyormanyt omany
relat i
onshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngleat tributekey
D: Hav eacomposi tekey
Q. no57.Amongstt heACI Dpr opertiesofat ransacti
on,the'Durabil
ity
'
proper ty
requi res.t hatt hechangesmadet othedatabasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsy stem crash
B: Excepti ncaseofadi skcrash
C: Excepti ncaseofapowerf ailure
D: Alway s, eveni ft hereisaf ailureofanyki nd
Q. no58.Ther esul toft heUNI ONoper at
ionbet weenR1andR2i sa
relat i
ont hat
i
ncl udes
A: Allthet uplesofR1
B: Allthet uplesofR2
C: Allthet uplesofR1andR2
D: Allthet uplesofR1andR2whi chhav ecommoncol umns
Q. no59.I fev erynon- keyat t
ributei sfuncti
onal l
ydepedentpr i
mar ykey,
thent he
relat i
onwi l
lbei n__ _________
_ _.
A: Firstnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four thnor mal form
Q. no60.I nt her elat i
onalmodel ,thenumberofat t
ri
butesandnumberof
tupl es
i
riar elationar et ermedas_ ___ ______and____ _
______
___respecti
v el
y
A: Car dinal it
y,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Car dinal it
y,degr ee
Q. no1.I nwhi chst ateonegat her sandl i
stallthenecessar yfi
eldsforthe
database
designpr oj ect .
A: Dat aDef ini t
ion
B: Dat aRef inement
C: Est ablishi ngRel ationshi p
D: Dat adel et i
on
Q.no2.Asubschemaexpr esses______
_ _
_.
A: Thel ogi cal view
B: Thephy si cal view
C: Theext ernal vi
ew
D: Thei nt er nal view
Q.no3.Thi skeyt hatuni quel yidenti
fi
eseachr ecordiscall
ed
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no4.Whi choft hef ollowi ngat t
ri
butecanbef urt
herdivi
dedint
o
subpar t
s
A: Simpl eat tr i
but e
B: Mul ti
v aluedat tribut e
C: Composi teat tribut e
D: Der ivedat t r
ibut e
Q.no5.Theov eral ldescr i
pt i
onofadat abaseiscalled_
_____.
A: Dat ai ntegr i
ty
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef ini t
ion
Q.no6.Theconcept ualmodeli s______
_ _
_.
A: Dependentonhar dwar e
B: Dependentonsof twar e.
C: Dependentonbot hhar dwareandsof t
ware
D: Independentofbot hhar dwar eandsof t
ware
Q.no7.Sel ect*f rom empl oyeeWhatt ypeofst atementisthi
s?
A: DML
B: I
nt egr i
tyconst rai nt
C: DDL
D: View
Q.no8.Tor emov ear elationf rom anSQLdat abase, weusethe____
__
command.
A: Del ete
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no9.Whi choft hef oll
owingshoul dbeusedt of i
ndt hemeanoft he
salary?
A: Mean( salar y)
B: Av g(sal ary)
C: Sum( sal ary )
D: Count (salar y)
Q.no10.Fort hegi vensetoff uncti
onaldependencyF, it’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no11.Thebasi cdat atypechar (
n)isa_____lengt hcharacterstr
ingand
varchar (n)i s_ __
_ _lengthcharacter
A: Fixed, equal
B: Equal , variable
C: Fixed, variable
D: Var iabl e,equal
Q.no12.I nE- RDi agram deri
vedat tri
but
earerepr esentedby ____
____.
A: Elli
pse
B: Dashedel lipse
C: Rect angl e
D: Triangl e
Q.no13.Whi choft hef oll
owingi sthest
ructureoft heDat abase?
A: Tabl e
B: .Schema
C: Rel ation
D: Struct ur e
Q.no14.Cr ossPr oductisa:
A: Unar yOper ator
B: Ter nar yOper ator
C: Binar yOper ator
D: Notanoper ator
Q.no15.The_ _____connecti
vei susedtotestforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no16.A‘ book’ isa_ _
_______
typeofent i
ty.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no17.I nE- Rdi agr am generali
zationisrepresentedby
A: Ell
ipse
B: Dashedel lipse
C: Rect angl e
D: Triangl e
Q.no18.Car tesianpr oducti
nr el
ationalalgebrais:
A: aUnar yoper at or
B: aBi nar yoper at or
C: aTer nar yoper ator
D: notdef ined
Q.no19.I nanEnt ity-
Relati
onshipDi agram “Diamonds”
represent s_ ______ _____
______
A: Attribut es
B: Mul ti-
v aluedat tri
butes
C: Weakent it
yset
D: Relat ionshi pset s
Q.no20.Keyt or epresentrelati
onshi pbetweent abl
esiscal
led
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dat eKey
Q.no21.Dat ar edundancymayl eadt o:
A: Dat ai ntegr it
y
B: Atomi citypr obl em
C: Dat ai nconsi st ency
D: Dat aabst raction
Q.no22.Hi erarchi calmodelisal socalled______
___.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt ructure
D: TableSt ruct ure
Q.no23.E- Rmodel i
ngt echniquei s:
A: Top-downmet hod
B: Bottom- upmet hod
C: Right-
lef tappr oach
D: Treest ruct ure
Q.no24.Rel at i
onalcal cul usisa:
A: Procedur al l
anguage
B: Non-Pr ocedur al l
anguage
C: Datadef initi
onl anguage
D: Highlev el language
Q.no25.Dat aMani pulat i
onLanguage( DML)i snotto__
___
_
A: Createi nf ormat iont ableint heDat abase
B: Insert
ionofnewi nformat ioni ntotheDat abase
C: Deleti
onofi nfor mat i
oni nt heDat abase
D: Modi f
icat ionofi nformat ioni ntheDat abase
Q.no26.Af unct iont hathasnopar t
ialfunctionaldependenci
esisi
n
_______for m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no27.Thecol l
ect i
onofi nter r
elateddat ai scall
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst racti
on
Q.no28.A_ __ _
___ _inat abler epresent sar elati
onshipamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no29.Whi choft hef ollowingi sNotaRel ation-
algebr
aOperat
ion
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no30.The_ _____ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Struct ure
D: Primar ykey
Q.no31.Whi chofthef ollowingi
snotModi f
icati
onoftheDat abase
A: Delet ion
B: I
nser ti
on
C: Sor ti
ng
D: Updat ing
Q.no32.Themet hodofaccesswhi chuseskeytransf
ormationisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no33.I ndomai nr elationalcal
culuswecreateav ar
iabl
efor
every_ ___ ____
A: Row
B: Column
C: Tabl e
D: Attribut e
Q.no34.At ablej
oinedwi thi
tsel
fiscall
edas______
__
A: Join
B: SelfJoi n
C: Out erJoi n
D: Equi Join
Q.no35.Whi chofthef ollowingi
sanunar yoperati
on?
A: Select ionoperation
B: Gener ali
zedselect i
on
C: Primi tiveoperati
on
D: Project i
onoperation
Q.no36.Whi chofthef ollowingf
ieldshaswidthof8by t
es?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no37.Whati sar elationshipcall
edwheni ti
smai nt
ainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nar y
D: Quat er nar y
Q.no38.Cust omerwi thdrawingmoneyf r
om ATM i sanexampl e
of____ _____ _
A: Appl icat ionpr ogrammer
B: Naï veuser
C: Speci alizeduser
D: Sophi sticat eduser
Q.no39.whi choft hef oll
owi ngisnotadat abaseobject?
A: Tabl es
B: Quer ies
C: Rel ationshi ps
D: Repor ts
Q.no40.Whi chSQLQuer yi susetor emov eatableandallitsdatafr
om
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no41.Whi chnor malf ormi sconsi
deredadequat eforrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no42.Theempl oy eesal aryshouldnotbegr eatert
hanRs.2000.Thi si
s
_______
A: i
nt egr it
yconst raint
B: referent ial constraint
C: over -def inedconst r
aint
D: feasi bleconst raint
Q.no43.Whi choft hef oll
owi ngarethepr opert
iesofenti
ties?
A: Groups
B: Tabl e
C: Attribut es
D: Swi tchboar ds
Q.no44.Af ilemani pul
ationcommandt hatextr
actssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOIN
D: PRODUCT
Q.no45.I nt he_ _
_ _
______normalf orm,acomposi t
eattr
ibut
eisconvert
ed
to
i
ndividualat tr
ibutes.
A: Fi
rst
B: Second
C: Third
D: Fourth
Q.no46.Mi nimalSuper keysar ecall
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attri
but ekey s
Q.no47.Whi choft hef ol
lowingenabl esustov i
ewdat afrom at
able
basedona
specificcr i
terion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no48.Whi chnamemustbeuni quewi thi
nadat abase?
A: Table
B: Fi
eld
C: Recor d
D: Char acter
Q.no49.TheRDBMSt erminologyforar owis________
.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degr ee.
Q.no50.Af unct i
onaldependencyi sar elat
ionshipbetweenoramong:
A: Tables
B: Rows
C: Relat i
ons
D: Attribut es
Q.no51.Consi dert hef oll
owi ng
S1:For ei
gnkeyal lowsnul lvalues.
S2:Ev er ybi narytabl esi sinBCNF
Whi choft hef oll
owi ngist rue?
A: Bot hS1andS2ar etrue
B: S1i st rue
C: S2i st rue
D: Bot hS1andS2ar efalse
Q.no52.Whi char et het woway si nwhichent i
tiescanpar tici
pateina
rel
at i
onshi p?
A: Passi v eandact i
ve
B: Tot alandpar tial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no53.Whi choft hef oll
owi ngisnotapr opertyofat ransact i
on?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur ability
Q.no54._ __ __
__al lowust oident if
yuniquel yat upleint her el
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no55.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eates______
A: Par ent-Chi l
drel ationshipbet weent het ablest hatconnectt hem
B: Manyt omanyr elati
onshi pbet weent het ablesthatconnectt hem.
C: Net wor kmodel betweent het ablesthatconnectt hem.
D: Manyt ooner elationshipbet weent het ablest hatconnectt hem.
Q.no56.Cr eatetabl eempl oyee( namev archar,idinteger )Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrityconst raint
Q.no57.Whi choft hef oll
owi ngisnott ruef orNor mal i
zat ion?
A: Remov esr edundancy
B: Remov esinser ti
onanomal y
C: Decomposest her elati
on
D: Quer yexecut i
onbecomesf aster
Q.no58.I far el
ationi si nBCNF, t
heni tisalsoi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no59.Af unctionaldependencyoft hef or
m x—>yi strivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q.no60.Doesi ndext akespacei nt hedi sk?
A: Indexesar enev erst oredondi sk
B: Itst oresmemor yasandwhenr equi r
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondi sk
Q.no1.Whoi smor econcer nedaboutt heconcept uall eveloftheDBMS
A: TheSy st
emspr ogr ammer
B: Theenduser
C: Client
D: DBA
Q.no2.Whent hechangescausedbyanabor tedtransactionhavebeen
undone,
thet r
ansact ionissai dt obe_ ____
_ __ _.
A: Failed
B: commi tt
ed
C: par tiallycommi t
t ed
D: rolledback.
Q.no3.Whati sACI Dpr oper ti
esofTr ansact i
ons?
A: Atomi cit
y ,Consi stency ,I
solati
on, Dat abase
B: Atomi ci t
y ,Consist ency ,I
solati
on, Dur abil
i
ty
C: Atomi cit
y ,Consi stency ,I
nconsi stent ,Durabili
ty
D: Aut omat ically,Concur rency,I
sol ation, Durabil
it
y
Q.no4.I nSQL‘ relat i
onAcont ai
nsr elationB’ canbewr it
tenas
A: Notexi stsBexceptA
B: exist sBexceptA
C: Notexi st sAexceptB
D: exi stsAexceptB
Q.no5.Aggr egat ef uncti
onsar efuncti
onst hattakea_ _
____
_____asinput
and
returnasi ngl ev alue.
A: Col lectionofv alues
B: Si nglev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no6.E- Rmodelusest hissymbolt orepresentweakent i
tyset?
A: Dot t
edr ect angl e
B: Di amond
C: Doubl yout li
nedr ectangl
e
D: Dot t
eddi amond
Q.no7.4NFi sdesi gnedt ocopewi th:
A: Tr ansitivedependency
B: Joi ndependency
C: Mul tivalueddependency
D: Funct i
onal dependency
Q.no8.Al laggr egat efunctionsexcept_ __
__i gnorenul
lval
uesinthei
r
i
nput
collect i
on.
A: Count (attribut e)
B: Count (*)
C: Av g
D: Sum
Q.no9.I nwhi chst ateonegat hersandlistallthenecessar
yfiel
dsforthe
database
desi gnpr oj ect .
A: Dat aDef initi
on
B: Dat aRef inement
C: Est ablishi ngRel ati
onship
D: Dat adel etion
Q.no10.Whatdoy oumeanbyonet omanyr elati
onshi
pbetweenTeacher
and
Classt able?
A: Onecl assmayhav emanyt eachers
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no11.Whi choneoft hefoll
owi ngisnott rueforav iew:
A: Viewi sder ivedf rom ot hertables
B: Viewi sav ir
tual table.
C: Av iewdef initi
oni spermanent lystoredaspar tofthedat abase.
D: Viewnev ercont ainsder i
vedcol umns.
Q.no12.I fBi sanat tri
buteandA→B, ThenBi ssai dtobe_ _____
__byA.
A: Logi cal l
yi mpl ied
B: Funct ional l
yi mpl i
ed
C: Logi cal l
ydet ermi ned
D: Funct i
onal lydet ermined
Q.no13.Theuser swhouseeasy -to-usemenuar ecalled
A: Sophi sticat edenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no14.Toappl yt heaggr egat efunction,toagr oupofsetof
tuples__ _ ____ clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q.no15.Adat adi cti
onar yisar epositorythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: DataVal idat or
Q.no16.Whi choneoft hefoll
owi nguni quel
yidentifi
est heelement si
nthe
rel
at i
on?
A: Primar ykey
B: Secondar yKey
C: Forei gnkey
D: Composi tekey
Q.no17.Thedat abaseenv i
ronmenthasal lofthef ol
lowi ngcomponent s
except __ ___ ___
A: User s.
B: Separ atef iles
C: Database.
D: Dat abaseadmi ni strator
Q.no18.Theconcept ualmodeli s_____
_ _
__ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsoftwar e
D: Independentofbot hhar dwar eandsoftwar e
Q.no19.I nE- Rdi agr am gener ali
zati
onisr epresent edby
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no20.A‘ book’ isa_ _ _
_ ___
__typeofent i
ty.
A: concept ual
B: concr et e
C: real
D: abst ract
Q.no21.Whi choft hef ollowingat t
ri
butecanbef urtherdi
vi
dedint
o
subpar ts
A: Simpl eat tri
but e
B: Mul tivaluedat tribut e
C: Composi t eattribut e
D: Der i
v edat tri
but e
Q.no22.E- Rmodel ingt echniqueis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
eftappr oach
D: Treest ruct ure
Q.no23.Rel ationalcal culusisa:
A: Procedur allanguage
B: Non- Pr ocedur al l
anguage
C: Dat adef i
ni ti
onl anguage
D: Highl evel language
Q.no24.Sel ect*f r
om empl oyeeWhatt ypeofst atementisthi
s?
A: DML
B: Integr i
tyconst rai nt
C: DDL
D: View
Q.no25.I nanEnt ity-RelationshipDiagram “Diamonds”
represent s__ ______ __ ___
_ ___
_
A: Attribut es
B: Mul ti-valuedat tributes
C: Weakent i
tyset
D: Relat ionshipset s
Q.no26._ ___ _
_ _pr oducest herelationthathasat tri
butesofR1andR2
A: Car tesianpr oduct
B: Differ ence
C: Product
D: Inter section
Q.no27.Af unct i
ont hathasnopar tialf
unctionaldependenciesi si
n
_______f orm:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no28.NULLi s__ _______ _
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f orintegerandbl ankf orcharacter
D: Notav alue
Q.no29.Whi choft hef ollowingi snotal evelofdat aabstract
ion?
A: Phy si calLev el
B: Critical Level
C: Logi cal Lev el
D: ViewLev el
Q.no30.I none- t
o-manyr el
ationshipt hetableon' many '
sideiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no31.A_ _ _
_ ____i nat ablerepr esentsar elat
ionshipamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no32.Funct ionalDependenci esar ethet ypesofconst r
aint
st hatar
e
based
on_ ____ _
A: Key
B: Keyr ev isit
ed
C: Super setkey
D: Tupl e
Q.no33.I fev er ynon- keyat t
ri
but
eisf unctional l
ydependentont he
primar ykey ,
therel ationwi l
lbei n__ _____
A: FirstNor mal Form
B: SecondNor mal For m
C: Thi rdNor mal Form
D: Four thFor mal Form
Q.no34.I nSQLt hest at ementselect*from R, Sisequi valentto____
___.
A: Sel ect*f rom Rnat ur aljoi
nS
B: Sel ect*f rom Rcr ossj oinS
C: Sel ect*f rom Runi onj oinS
D: Sel ect*f rom Ri nnerj oinS
Q.no35.Whi choft hef ollowingi
nt r
uer egar dingRef erentialI
ntegri
ty?
A: Ever ypr imar y-keyv aluemustmat chapr imar y-keyv alueinan
associ atedt abl e
B: Ever ypr imar y-keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
table
C: Ever yf or eign- keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ev eryf or eign- keyv al uemustmat chaf oreign-keyv alueinanassociated
table
Q.no36.Rel ationalAl gebr ais
A: Dat aDef i
nitionLanguage
B: Met aLanguage
C: Procedur al quer yLanguage
D: Dat aMani pul ationLanguage
Q.no37.Thenat uraljoini sequalto:
A: Car tesi anPr oduct
B: Combi nat i
onofUni onandCar t
esianpr oduct
C: Combi nat i
onofsel ect ionandCartesianpr oduct
D: Combi nat i
onofpr oj ectionandCar t
esianpr oduct
Q.no38.Thet er m_ ___ ___isusedtor efertoar ow.
A: Attr i
but e
B: Tupl e
C: Field
D: Inst ance
Q.no39.Thecol lectionofint
errelateddataiscall
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst ract
ion
Q.no40.Whi choft hef oll
owi
ngi sanunar yoperation?
A: Sel ectionoper ation
B: Gener ali
zedsel ection
C: Primi t
iveoper ati
on
D: Proj ectionoper ation
Q.no41.Whi choft hef oll
owi
ngi sNotaRel ati
on-algebraOperat
ion
A: Sel ect
B: Uni on
C: Rename
D: Dropt abl e
Q.no42.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char acter
Q.no43.Theempl oy eesalar
yshoul dnotbegr eaterthanRs.2000.Thi
sis
______ _
A: i
nt egr i
tyconst raint
B: refer entialconstraint
C: ov er-definedconst r
aint
D: feasi bleconst rai
nt
Q.no44.Themet hodofaccesswhi chuseskeyt r
ansf or
mati
onisknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no45.At ablejoinedwi thi
tselfiscal
ledas________
A: Joi n
B: Sel fJoi n
C: Out erJoi n
D: Equi Join
Q.no46.Af unctionaldependencyi sar el
ati
onshipbet weenoramong:
A: Tables
B: Rows
C: Relations
D: Attri
but es
Q. no47.Cust omerwi t
hdrawi ngmoneyf r
om ATM i sanexampl e
of_ ______ _
_ _
A: Appl i
cat ionpr ogrammer
B: Naï veuser
C: Speci al
izeduser
D: Sophi sticateduser
Q. no48.Whi chSQLQuer yisuset or emoveat ableandalli
tsdatafrom
the
dat abase?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q. no49.I nt he_ __ _
_ _
____nor malform, acomposi teatt
ri
buteisconvert
ed
to
i
ndi v i
dualat tri
but es.
A: First
B: Second
C: Third
D: Four th
Q. no50.The_ __
__ _ofadat abasekeepsonchangi ng.
A: Instance
B: Schema
C: Structure
D: Primar ykey
Q. no51.Af terthef inalstatementofat r
ansact i
onhasbeenexecut ed,a
transact i
onent ersi na_ _
_ ______state.
_______.
A: Act i
ve
B: abor t
ed
C: Commi tt ed
D: Par t
iall
ycommi t
ted
Q. no52.Amongstt heACI Dpr oper
t i
esofat ransacti
on,t
he'Durabi
lit
y'
proper t
y
requi res.thatt hechangesmadet othedat abasebyasuccessf ul
transact i
on
persist
A: Excepti ncaseofanoper atingsy stem cr ash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ailure
D: Alway s, ev eni ft hereisaf ailureofanyki nd
Q.no53.I fev er ynon- keyat t
ributeisf unctionall
ydepedentpri
mar ykey
,
thent he
rel
ationwi l
lbei n_ ________ ____.
A: Firstnor mal f orm
B: Secondnor mal f
orm
C: Thir dNor mal form
D: Four thnor mal form
Q.no54.The_ __ _____ _
pr otocolensur esfreedom fr
om deadlock.
A: Two- phasel ocki ngpr ot ocol
B: Strictt wo- phasel ockingpr otocol
C: Rigor oust wo- phasel ockingpr ot
ocol
D: Timest ampor deringpr otocol
Q.no55.Dupl icat ionofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal ies
B: Dat ai solat ion
C: Dat ai nconsi st ency
D: Dat ar edundancy
Q.no56.Whi choft hef ollowingoper ati
oni susedifwear eint
erestedi
n
only
certaincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q.no57.At abl eont hemanysi deofaonet omanyormanyt omany
rel
ationshi p
must :
A: Bei nSecondNor mal For m( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngl eat t
ributekey
D: Hav eacomposi tekey
Q.no58.I nt he_ _ ________nor malf orm, acomposi t
eattri
buteisconvert
ed
to
i
ndiv i
dualat tribut es
A: First
B: Second
C: Thir d
D: Four th
Q.no59.I nt her elationalmodel ,thenumberofat t
ri
butesandnumberof
tuples
i
riar elat i
onar et ermedas_ _
___ ____
_and_ _____
_____
___respecti
vel
y
A: Car dinal i
ty,domai n
B: Degr ee, cardi nality
C: Domai ndegr ee
D: Car dinal i
ty,degr ee
Q.no60.At ablehasf ieldsF1, F2, F3, F4,F5wi ththefollowingf
uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,
F2)—>F5
I
nt ermsofnor mal ization,thi
st ableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no1.Whi choft hef oll
owingi sthest ructureoftheDat abase?
A: Tabl e
B: .Schema
C: Relat i
on
D: Struct ure
Q.no2.Keyt or epr esentr elati
onshi pbet weent abl
esiscal l
ed
A: Primar ykey
B: Secondar yKey
C: For eignKey
D: Candi dateKey
Q.no3.Hi erarchi calmodeli sal socal l
ed_ _
_ _
_ _
___.
A: Treest ructure
B: PlexSt ructure
C: Nor mal izeSt r uctur e
D: Tabl eSt ructur e
Q.no4.Dat aMani pul ationLanguage( DML)i snotto____
_ _
A: Creat ei nformat i
ont ableintheDat abase
B: Insert i
onofnewi nformat i
oni ntotheDat abase
C: Delet i
onofi nf ormat ionintheDat abase
D: Modi ficationofi nf or
mat ionint heDat abase
Q.no5.E- Rmodelusest hissymbolt or epresentweakentit
yset?
A: Dot tedr ect angl e
B: Diamond
C: Doubl yout linedr ect angle
D: Dot teddi amond
Q.no6.Theov er alldescr ipti
onofadat abasei scall
ed___
___.
A: Dat ai ntegr ity
B: Dat amani pul ation
C: Dat abaseschema
D: Dat adef inition
Q.no7.Whent hechangescausedbyanabor tedtr
ansacti
onhav ebeen
undone,
thet r
ansact ioni ssai dt obe_ __
_ _____.
A: Failed
B: commi tted
C: partiallycommi tted
D: roll
edback.
Q.no8.Car t
esi anpr oducti nrelati
onalal gebrais:
A: aUnar yoper ator
B: aBi nar yoper at or
C: aTer nar yoper at or
D: notdef i
ned
Q.no9.4NFi sdesi gnedt ocopewi t
h:
A: Transi t i
vedependency
B: Joindependency
C: Mul tiv alueddependency
D: Funct ional dependency
Q.no10.I nE- RDi agr am der i
vedat tr
ibutear erepr
esentedby___
_____.
A: Ell
ipse
B: Dashedel l
ipse
C: Rect angl e
D: Triangl e
Q.no11.Dat ar edundancymayl eadto:
A: Dat ai ntegr ity
B: Atomi citypr obl em
C: Dat ai nconsi stency
D: Dat aabst r act ion
Q.no12.I nwhi chst ateonegat hersandlistallthenecessaryf
ieldsf orthe
databasedesi gnpr oj
ect.
A: Dat aDef inition
B: Dat aRef inement
C: Est abl i
shi ngRel ationship
D: Dat adel etion
Q.no13.Whoi smor econcer nedaboutt heconcept uall
eveloftheDBMS
A: TheSy stemspr ogrammer
B: Theenduser
C: Client
D: DBA
Q.no14.Aggr egat ef unctionsar efuncti
onst hattakea_ _
_____
___ _as
i
nputand
ret
ur nasi ngl ev alue.
A: Col lectionofv alues
B: Singl ev alue
C: Aggr egat ev al ue
D: Tabl es
Q.no15.The_ ___ __connect i
veisusedt ot estforabsenceofset
member ship.
A: except
B: exist s
C: noti n
D: in
Q.no16.Thi skeyt hatuni quelyidenti
fi
eseachr ecor
discall
ed
A: Primar yKey
B: KeyRecor d
C: Uni queKey
D: FieldName
Q.no17.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ter nar yOper at or
C: Binar yOper ator
D: Notanoper at or
Q.no18.Tor emov ear elati
onf rom anSQLdat abase,weusethe_ _
__ _
_
command.
A: Del ete
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no19.Whati sACI Dpr oper t
iesofTr ansact i
ons?
A: Atomi city ,Consistency ,Isol
at i
on,Dat abase
B: Atomi city, Consistency ,Isol
at i
on,Dur abi
li
ty
C: Atomi city ,Consistency ,Inconsistent,Durabil
ity
D: Aut omat ically,Concur rency,Isolati
on, Durabil
it
y
Q.no20.Thebasi cdat aty pechar (n)isa_ ____lengt
hcharacterstr
ingand
varchar (n)i s_ _
__ _l
engt hchar act er
A: Fixed, equal
B: Equal ,v ar i
able
C: Fixed, v ariable
D: Var i
abl e, equal
Q.no21.Asubschemaexpr esses_ ________.
A: Thel ogical vi
ew
B: Thephy si calview
C: Theext ernal view
D: Thei nter nal v
iew
Q.no22.Whi choft hef ollowingshoul dbeusedt ofi
ndthemeanoft he
salary?
A: Mean( sal ar y
)
B: Av g(sal ary )
C: Sum( sal ar y)
D: Count (sal ary)
Q.no23.Al laggr egatef unct i
onsexcept_ ____ignorenul
lvaluesinthei
r
i
nput
collection.
A: Count (attr i
bute)
B: Count (*)
C: Av g
D: Sum
Q.no24.I nSQL‘ rel
ationAcont ai
nsr elati
onB’ canbewr i
tt
enas
A: Notexi st sBexceptA
B: existsBexceptA
C: Notexi st sAexceptB
D: existsAexceptB
Q.no25.Fort hegi v
ensetoff unct i
onaldependencyF, i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no26.TheRDBMSt ermi nologyforar owis____
____.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degree.
Q.no27.I nSQLt hestat ementsel ect*f
rom R,Sisequival
entto__
_____
.
A: Select*f rom Rnatur aljoi
nS
B: Select*f r
om Rcr ossj oinS
C: Select*f rom Runionj oinS
D: Select*f rom Rinnerj oinS
Q.no28.Funct ionalDependenci esarethetypesofconst r
aint
sthatare
based
on_ _
____
A: Key
B: Keyr evisi
ted
C: Super setkey
D: Tuple
Q.no29.whi choft hefol l
owi ngisnotadat abaseobject?
A: Tables
B: Queries
C: Relationships
D: Repor ts
Q.no30.Whi choft hef ollowingar ethepropert
iesofentit
ies?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no31.Whi choft hef ollowingf i
eldshaswidthof8by tes?
A: Memo
B: Number
C: Date/ ti
me
D: Hyper li
nk
Q.no32.A_ ______
_inat ablerepresentsarelat
ionshi
pamongasetof
values.
A: Column
B: Key
C: Row
D: Ent ry
Q.no33.Whati sar elationshipcalledwheni tismai nt
ainedbetweentwo
entiti
es?
A: Unar y
B: Binar y
C: Ter nary
D: Quat ernary
Q.no34.I ndomai nr elationalcalculuswecr eateav ar
iabl
efor
every_ _______
A: Row
B: Col umn
C: Tabl e
D: Attribute
Q.no35._ __
_ _
__pr oducest herel
ationthathasat t
ri
butesofR1andR2
A: Car tesianproduct
B: Difference
C: Product
D: Intersection
Q.no36.NULLi s_
_ ____ ___ _
.
A: Thesameas0f ori nteger
B: Thesameasbl ankf orchar act
er
C: Thesameas0f ori ntegerandbl ankforchar acter
D: Notav al
ue
Q.no37.Whi choft hef ollowingisnotModi ficationoftheDatabase
A: Del eti
on
B: I
nser t
ion
C: Sor ti
ng
D: Updat i
ng
Q.no38.Whi chnor malf or misconsi der
edadequat eforrel
ati
onal
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no39.Af il
emani pul ationcommandt hatext ractssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no40.Af unct i
onthathasnopar ti
alfunctionaldependenci
esisin
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no41.Mi ni
malSuper keysar ecal
led
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attribut ekey s
Q.no42.I none- to-manyr el
ationshi
pthet ableon'many 'si
deiscall
edas:
A: Par ent
B: Mast er
C: Sister
D: Chi l
d
Q.no43.I feverynon- keyattri
buteisfunctionall
ydependentont he
pri
mar ykey ,
therel ationwi llbein_______
A: Fi
r stNor mal Form
B: SecondNor mal Form
C: Thir dNor mal Form
D: Four thFor mal Form
Q.no44.Whi choft hefollowingisnotal evelofdataabst r
act
ion?
A: Phy sical Lev el
B: Critical Level
C: Logi cal Level
D: ViewLev el
Q.no45.Whi choft hefollowingenablesust ov iewdataf r
om atabl
e
basedona
specificcr i
teri
on
A: For m
B: Quer y
C: Macr o
D: Repor t
Q.no46.Thet er m_ _
_____isusedt orefertoar ow.
A: Attr i
but e
B: Tupl e
C: Field
D: Inst ance
Q.no47.Whi choft hefoll
owingisNotaRel ation-algebraOper ati
on
A: Sel ect
B: Uni on
C: Rename
D: Dropt able
Q.no48.Whi choft hefoll
owingintr
ueregar dingRef erent ialIntegri
ty?
A: Ever ypr i
mar y-
keyv aluemustmat chaprimar y-keyv aluei nan
associ atedt abl e
B: Ever ypr i
mar y-
keyv aluemustmat chaforeign-keyv aluei nanassoci ated
table
C: Ever yf oreign-keyv al
uemustmat chapr i
mar y-
keyv aluei nan
associ atedt abl e
D: Ev eryf oreign-keyv al
uemustmat chaf oreign-keyv aluei nanassoci at
ed
table
Q.no49.Whi chSQLQuer yisusetoremov eat ableandal litsdatafrom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no50.I nthe_ _______
__normalform,acomposi t
eat tribut eisconv ert
ed
to
i
ndiv i
dualat tributes.
A: First
B: Second
C: Thi rd
D: Four t
h
Q.no51.I far elati
oni sinBCNF,theniti
sal soi n
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no52.Ther esul toftheUNI ONoperat
ionbet weenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: Allthet upl esofR1
B: Allthet upl esofR2
C: Allthet upl esofR1andR2
D: Allthet upl esofR1andR2whi chhav ecommoncol umns
Q.no53.Doesi ndext akespaceint hedi sk?
A: Indexesar enev erst oredondi sk
B: I
tst oresmemor yasandwhenr equir
ed
C: Indexest akenospace
D: Yes, Indexesar est oredondisk
Q.no54.Whi charet het woway si nwhichent i
tiescanpar tici
pateina
rel
at i
onshi p?
A: Passi v eandact i
ve
B: Tot alandpar t
ial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no55.Cr eat et
abl eempl oyee( namev archar,idinteger )Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integrityconst raint
Q.no56.Apr imarykeyi scombinedwi t
haf oreignkeycr eates______
A: Par ent-Chi l
drelationshipbetweent het ablest hatconnectt hem
B: Manyt omanyr elationshi
pbet weent het ablesthatconnectt hem.
C: Net wor kmodel betweenthet ablesthatconnectt hem.
D: Manyt ooner elationshipbetweent het ablest hatconnectt hem.
Q.no57.Whi choft hef oll
owingisnotapr opertyofat ransact i
on?
A: Atomi city
B: Consi st ency
C: Integrity
D: Dur ability
Q.no58._ __ ____allowust oidentif
yuniquel yat upleint her el
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no59.Whi choft hef oll
owingisnott ruef orNor mal i
zat ion?
A: Remov esr edundancy
B: Remov esi nser ti
onanomal y
C: Decomposest her el
ation
D: Quer yexecut ionbecomesf aster
Q.no60.I fev erynon- keyat t
ributeisf uncti
onall
ydepedentpri
marykey
,
t
hent he
rel
at i
onwi llbei n_ _
_ _________
_ .
A: Fir
stnor mal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four t
hnor mal form
Q.no1.I nanEnt it
y-RelationshipDi agram “Diamonds”
represent s_ _ _____ _
_ _________
A: Attri
but es
B: Mul ti
-val uedat tri
butes
C: Weakent it
yset
D: Relationshi pset s
Q.no2.I fBi sanat tributeandA→B, ThenBi ssaidt
obe_ ____
___byA.
A: Logical lyi mpl ied
B: Funct i
onal lyimpl i
ed
C: Logical lydet ermi ned
D: Funct ional lydet er mined
Q.no3.Adat adi ctionaryisar eposit
or ythatmanages_____
A: Memor y
B: Met adat a
C: Spell Checker
D: Dat aVal i
dat or
Q.no4.A‘ book’ i
sa_ __
_ ___
__ty peofent i
ty.
A: concept ual
B: concr et e
C: real
D: abst r
act
Q.no5.Rel at i
onalcal culusisa:
A: Procedur allanguage
B: Non- Pr ocedur allanguage
C: Dat adef i
nit i
onl anguage
D: Highl ev el language
Q.no6.Theconcept ualmodeli s_________.
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof t
ware
D: Independentofbot hhar dwar eandsof t
ware
Q.no7.Whi choneoft hef ollowi ngisnott r
uef orav iew:
A: Viewi sder ivedf rom ot hert ables
B: Viewi sav ir
tual table.
C: Av iewdef initi
oni sper manent l
ystoredaspar tofthedatabase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no8.Sel ect*f rom empl oy eeWhatt ypeofst at ementisthis?
A: DML
B: I
nt egr i
t yconst raint
C: DDL
D: View
Q.no9.Toappl ytheaggr egat efuncti
on,toagr oupofsetof
tuples_ ___ ___ clausei s
used.
A: Groupby
B: hav i
ng
C: select
D: wher e
Q.no10.E- Rmodel ingt echni queis:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -leftappr oach
D: Treest r
uct ur e
Q.no11.Thedat abaseenv ironmenthasal lofthef oll
owingcomponent s
except __ __ ____
A: User s.
B: Separ atef iles
C: Dat abase.
D: Dat abaseadmi nistrator
Q.no12.Whi choft hef ol
lowi ngat t
ri
butecanbef ur
therdiv
idedinto
subpar ts
A: Simpl eat tribute
B: Mul tivaluedat t
ribut e
C: Composi teat tri
but e
D: Der i
v edat tribute
Q.no13.Whi choneoft hef ollowinguniquelyident i
fi
estheelement si
nthe
rel
at i
on?
A: Primarykey
B: Secondar yKey
C: Foreignkey
D: Composi tekey
Q.no14.Cr ossPr oducti sa:
A: Unar yOper ator
B: TernaryOper ator
C: BinaryOper ator
D: Notanoper ator
Q.no15.Hi erarchi calmodelisalsocalled_________.
A: Treest ructure
B: PlexSt r
uct ure
C: Nor malizeSt ruct ur
e
D: Tabl eStructure
Q.no16.Fort hegi vensetoff uncti
onaldependencyF, i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no17.Al laggr egat efunct
ionsexcept_ ___
_i gnorenul
lvaluesinthei
r
i
nput
coll
ect i
on.
A: Count (
at t
ribute)
B: Count (
*)
C: Av g
D: Sum
Q.no18.Car tesianpr oducti
nr el
ati
onalalgebrai s:
A: aUnar yoper ator
B: aBi naryoper ator
C: aTer naryoper ator
D: notdef i
ned
Q.no19.I nSQL‘ relati
onAcont ainsrel
ationB’ canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no20.I nwhi chst ateonegathersandlistallthenecessaryfi
eldsfort
he
databasedesi gnpr oject.
A: Dat aDef initi
on
B: Dat aRef inement
C: Est abl ishi ngRel at
ionship
D: Dat adel etion
Q.no21.I nE- Rdiagram gener al
izati
onisrepr esent
edby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no22.Tor emov earelati
onf r
om anSQLdat abase,weuset he_ __
_ _
_
command.
A: Del et e
B: Pur ge
C: Remov e
D: Dropt abl e
Q.no23.Whi choft hefollowingisthest r
uctur eoftheDat abase?
A: Tabl e
B: .Schema
C: Rel at i
on
D: Struct ure
Q.no24.Aggr egatefunctionsaref uncti
onst hattakea_ _ __
_ _
_ _
___as
i
nputand
ret
urnasi ngl ev alue.
A: Col lect ionofv alues
B: Singl ev alue
C: Aggr egat ev alue
D: Tabl es
Q.no25.Whi choft hefollowingshouldbeusedt ofindthemeanoft he
salary?
A: Mean( sal ary)
B: Av g( sal ary )
C: Sum( sal ary)
D: Count (salar y)
Q.no26.I nSQLt hestatementsel ect*f
rom R,Si sequivalentto_______.
A: Select*f rom Rnat uraljoi
nS
B: Select*f rom Rcr ossjoinS
C: Select*f rom Runi onjoinS
D: Select*f rom Ri nnerjoinS
Q.no27.Funct i
onalDependenci esar ethetypesofconst raintsthatare
based
on______
A: Key
B: Keyr ev isit
ed
C: Super setkey
D: Tuple
Q.no28.Thenat ural j
oi ni
sequalt o:
A: Cartesi anPr oduct
B: Combi nat i
onofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ecti
onandCar t
esianpr oduct
D: Combi nat i
onofpr oject
ionandCar t
esianpr oduct
Q.no29.Whi choft hef oll
owingfieldshaswi dthof8by t
es?
A: Memo
B: Number
C: Date/ ti
me
D: Hyper li
nk
Q.no30.Themet hodofaccesswhi chuseskeyt ransfor
mat i
oni
sknown
as:
A: Dir
ect
B: Hash
C: Random
D: Sequent ial
Q.no31.Whi choft hef oll
owingar ethepr operti
esofent i
ti
es?
A: Groups
B: Table
C: Attr
ibut es
D: Switchboar ds
Q.no32.Rel ationalAl gebr ais
A: DataDef i
nitionLanguage
B: MetaLanguage
C: Procedur al queryLanguage
D: DataMani pul ati
onLanguage
Q.no33.Cust omerwi thdr
awi ngmoneyf r
om ATM i sanexample
of________ __
A: Applicat ionpr ogr ammer
B: Naïveuser
C: Special izeduser
D: Sophi sticateduser
Q.no34.The_ _____ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ure
D: Primar ykey
Q.no35.At ablejoinedwi thi
tselfiscal
ledas_ ______
_
A: Joi n
B: Sel fJoi n
C: Out erJoi n
D: Equi Join
Q.no36.Theempl oy eesalar
yshoul dnotbegr eaterthanRs.2000.Thi
sis
__
_ ___ _
A: i
nt egr it
yconst raint
B: refer ential constraint
C: ov er-def inedconst r
aint
D: feasi bleconst raint
Q.no37.Af unctionaldependencyi sar el
ationshipbetweenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Att ri
but es
Q.no38.Whi chnamemustbeuni quewi t
hinadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char acter
Q.no39.Whi choft hef oll
owi
ngi sanunar yoper ati
on?
A: Sel ectionoper ation
B: Gener alizedsel ection
C: Primi t
iveoper ati
on
D: Proj ectionoper ation
Q.no40.whi choft hef ol
lowi
ngisnotadat abaseobj ect
?
A: Tabl es
B: Quer i
es
C: Rel ationshi ps
D: Repor ts
Q.no41.Thecol lectionofint
errelateddataiscal l
edas:
A: DBMS
B: RDBMS
C: Dat abase
D: Dat aabst raction
Q.no42.TheRDBMSt ermi nologyforar owi s________.
A: Tupl e.
B: Rel at i
on.
C: Attr i
but e.
D: Degr ee.
Q.no43.I none- t
o-manyr el
ationshi
pt hetableon' many 'sideiscalledas:
A: Par ent
B: Mast er
C: Sist er
D: Chi ld
Q.no44.A_ _ ______inat ablerepresentsar elati
onshi pamongasetof
values.
A: Col umn
B: Key
C: Row
D: Ent ry
Q.no45._ ___ ___producest herelat
ionthathasat tri
butesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Product
D: Inter sect ion
Q.no46.Whi choft hef ollowingisnotModi f i
cationoft heDat abase
A: Del et ion
B: Inser t i
on
C: Sor ting
D: Updat ing
Q.no47.Thet erm_ ____ __isusedt or ef
ertoar ow.
A: Attr i
but e
B: Tupl e
C: Field
D: Inst ance
Q.no48.Whi choft hef ollowingintrueregar dingRef erentialI
nt egr
ity
?
A: Ev erypr imar y-keyval uemustmat chaprimar y-keyv alueinan
associ at edt abl e
B: Ever ypr imar y-keyval uemustmat chaforeign-keyv aluei nanassoci at
ed
table
C: Ev eryf oreign-keyv aluemustmat chapr i
mar y-
keyv aluei nan
associ at edt abl e
D: Ev eryf oreign- keyv aluemustmat chaf orei
gn- keyval
uei nanassociated
tabl e
Q. no49.I fev erynon- keyat t
ributeisf uncti
onall
ydependentont he
pr i
mar ykey ,
ther elati
onwi llbei n__ ___
__
A: FirstNor mal For m
B: SecondNor mal For m
C: Thi rdNor mal Form
D: Four thFor mal For m
Q. no50.Af il
emani pul ati
oncommandt hatextractssomeoft herecords
from a
fileiscal l
ed
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q. no51.Dupl icat i
onofdat aatsev eralplacesisknownas_ ___
A: Concur rentaccessanomal ies
B: Dat aisol ation
C: Dat ainconsi stency
D: Dat ar edundancy
Q. no52.I nt her elationalmodel ,thenumberofat t
ri
butesandnumberof
tupl es
i
r iar elationar et ermedas_ ___ ____
__and_ ____
_ _____
___respecti
vely
A: Car dinality,domai n
B: Degr ee, car dinality
C: Domai ndegr ee
D: Car dinality,degr ee
Q. no53.At abl eont hemanysi deofaonet omanyormanyt omany
relat i
onshi p
must :
A: Bei nSecondNor mal Form( 2NF)
B: Bei nThi rdNor mal Form( 3NF)
C: Hav easi ngl eat tri
but ekey
D: Hav eacomposi t
ekey
Q. no54.At abl ehasf ieldsF1, F2, F3, F4,F5wit hthefol
lowingf uncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
Int ermsofnor malization,thist abl
ei sin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no55.Af unctionaldependencyoft heform x—>yi str
ivali
f
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no56.Consi derthef oll
owi ng
S1:For eignkeyal l
owsnul lvalues.
S2:Ev erybi nar ytablesi sinBCNF
Whi choft hef oll
owi ngi strue?
A: Bot hS1andS2ar etrue
B: S1i strue
C: S2i strue
D: Bot hS1andS2ar efalse
Q. no57.Amongstt heACI Dpr opert i
esofat r
ansacti
on,
the'Durabi
lit
y'
proper t
y
requi res.thatt hechangesmadet ot hedatabasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsy stem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ail
ure
D: Alway s, ev enifthereisaf ail
ureofanyki nd
Q. no58.Af terthef inalstatementofat ransacti
onhasbeenexecut ed,a
transact ionent ersina_ _______ _state._
______.
A: Active
B: abor t
ed
C: Commi tted
D: Par t
iall
ycommi tted
Q. no59.Whi choft hef oll
owi ngoper ati
onisusedi fweareint
erestedin
onl y
cer taincol umnsofat able?
A: PROJECTI ON
B: SELECTI ON
C: UNI ON
D: JOI N
Q.no60.I nt he_ __ __ _____nor malfor
m, acomposi teatt
ri
but eisconvert
ed
t
o
i
ndi v
idualat tri
butes
A: First
B: Second
C: Third
D: Four th
Q.no1.Asubschemaexpr esses____
_ _
_ __.
A: Thel ogical view
B: Thephy sical view
C: Theext er nal vi
ew
D: Thei nternal view
Q.no2.I fBi sanat tributeandA→B, ThenBi ssai dtobe_ _____
__byA.
A: Logi callyi mpl i
ed
B: Funct i
onal lyimpl ied
C: Logi callydet ermi ned
D: Funct i
onal lydet ermi ned
Q.no3.The_ _____ connect iv
ei susedtot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no4.Theov eral ldescr i
ptionofadat abasei scall
ed______.
A: Dat ai ntegr i
ty
B: Dat amani pulation
C: Dat abaseschema
D: Dat adef i
ni t
ion
Q.no5.Thebasi cdat at ypechar(n)i
sa_ ____lengthcharacterstr
ingand
varchar (n)i s_ ____l engt hcharacter
A: Fixed, equal
B: Equal , variable
C: Fixed, var iable
D: Var i
abl e, equal
Q.no6.Adat adict ionar yi sareposit
oryt hatmanages_ _
_ __
A: Memor y
B: Met adat a
C: SpellChecker
D: DataVal idator
Q.no7.A‘ book’ isa_________t
y peofent it
y.
A: concept ual
B: concret e
C: real
D: abstract
Q.no8.Keyt orepresentrelati
onshi pbet weent ablesiscal
led
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dat eKey
Q.no9.Theuser swhouseeasy -
t o-usemenuar ecal l
ed
A: Sophi st i
catedenduser s
B: Naïveuser s
C: Stand- aloneuser s
D: Casual enduser
Q.no10.E- Rmodelusest hissy mbolt orepresentweakent ityset?
A: Dottedr ectangle
B: Diamond
C: Doubl yout l
inedrectangle
D: Dotteddi amond
Q.no11.Thi skeyt hatuniquelyi dent ifi
eseachr ecordiscalled
A: Primar yKey
B: KeyRecor d
C: UniqueKey
D: Fiel
dName
Q.no12.Whatdoy oumeanbyonet omanyr el
ationshipbetweenTeacher
and
Classt abl e?
A: Onecl assmayhav emanyt eacher s
B: Onet eachercanhav emanycl asses
C: Onet eachercanhav eonecl ass
D: Manyt eacher smayhav emanycl asses
Q.no13.Whent hechangescausedbyanabor tedt r
ansacti
onhav ebeen
undone,
thet r
ansact ionissaidt obe_ _____ _
_ _.
A: Fail
ed
B: commi tt
ed
C: parti
allycommi tt ed
D: rol
ledback.
Q.no14.I nanEnt i
ty -Rel ationshi pDi agr am “ Di
amonds”
represent s__ __ _____ __ ____ ___
A: Attri
but es
B: Mul t
i-
v aluedat t
ribut es
C: Weakent ityset
D: Relati
onshi pset s
Q.no15.Whoi smor econcer nedaboutt heconcept ualleveloftheDBMS
A: TheSy stemspr ogr ammer
B: Theenduser
C: Cli
ent
D: DBA
Q.no16.4NFi sdesi gnedt ocopewi th:
A: Transitivedependency
B: Joindependency
C: Mul t
iv alueddependency
D: Functional dependency
Q.no17.Whati sACI Dpr oper ti
esofTr ansact i
ons?
A: Atomi city, Consi stency ,Isolation,Dat abase
B: Atomi city, Consi st ency ,Isolation,Dur abilit
y
C: Atomi city, Consi stency ,Inconsi stent, Durabili
ty
D: Automat ical ly
, Concur rency ,Isolation, Durabil
ity
Q.no18.Dat ar edundancymayl eadt o:
A: Dataint egr ity
B: Atomi citypr oblem
C: Datainconsi stency
D: Dataabst r action
Q.no19.I nE- RDi agr am der ivedat tributear er epresentedby __
_____
_.
A: Ell
ipse
B: Dashedel l
ipse
C: Rectangl e
D: Tri
angl e
Q.no20.Dat aMani pul ationLanguage( DML)i snott o__ __
__
A: Createi nf or mat iont ablei nt heDat abase
B: I
nser t
ionofnewi nf ormat i
oni ntot heDat abase
C: Deleti
onofi nformat i
oni nt heDat abase
D: Modi f
icat ionofi nf ormat i
oni nt heDat abase
Q.no21.Sel ect*f rom empl oy eeWhatt y peofst atementi sthi
s?
A: DML
B: Integr it
yconst raint
C: DDL
D: View
Q.no22.Rel ationalcal culusisa:
A: Procedur al l
anguage
B: Non- Procedur allanguage
C: Dat adef i
niti
onl anguage
D: Highl evellanguage
Q.no23.Whi choft hefollowingisthestructureoftheDatabase?
A: Tabl e
B: .Schema
C: Rel ation
D: Struct ure
Q.no24.Fort hegi vensetoff unct
ionaldependencyF,i
t’
sclosureis
denot edas
A: F+
B: FC
:F*
D: F_
Q.no25.Aggr egat efunct i
onsar efuncti
onst hatt
akea_ _
_ _
_____
__as
i
nputand
ret
ur nasi nglev alue.
A: Col lectionofv alues
B: Singl ev al
ue
C: Aggr egatev alue
D: Tabl es
Q.no26.I ndomai nr el
ationalcalculuswecreat eavari
ablefor
ever y
_ __ ____
_
A: Row
B: Col umn
C: Tabl e
D: Attr i
but e
Q.no27.I nthe_ __ ____
_ __normalf orm,acomposi teat
tri
buteisconver
ted
to
i
ndi vi
dualat tri
but es.
A: First
B: Second
C: Thi rd
D: Four th
Q.no28.Thenat uralj
oini sequalt o:
A: Car tesianPr oduct
B: Combi nati
onofUni onandCar tesi
anpr oduct
C: Combi nationofsel ect i
onandCar tesianpr oduct
D: Combi nationofpr ojectionandCar tesianpr oduct
Q.no29.Mi nimalSuper keysarecal l
ed
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attributekey s
Q.no30.Whi chnor malf ormisconsi deredadequat eforrelat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no31.Whati sar el
at i
onshipcal l
edwheni ti
smai nt
ainedbet weentwo
entit
ies?
A: Unar y
B: Binar y
C: Ter nary
D: Quat ernary
Q.no32.Whi choft hef ollowingisNotaRel ati
on-al
gebraOper ati
on
A: Select
B: Union
C: Rename
D: Dropt able
Q.no33.Whi chSQLQuer yisuset oremov eat abl
eandal li
tsdat af
rom
the
database?
A: Creat eTabl e
B: AlterTabl e
C: DropTabl e
D: Remov eTabl e
Q.no34.Whi choft hef ollowingenabl esust oviewdatafrom at abl
e
basedona
specificcr it
erion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no35.Funct i
onalDependenci esar ethet ypesofconst r
aintst hatare
based
on____ __
A: Key
B: Keyr evisit
ed
C: Super setkey
D: Tupl e
Q.no36.Whi choft hef ollowingf i
eldshaswi dthof8by tes?
A: Memo
B: Number
C: Dat e/ t
ime
D: Hy per li
nk
Q.no37.I nSQLt hest at ementsel ect*fr
om R, Sisequival
entto_ ______
.
A: Select*f rom Rnat ur aljoi
nS
B: Select*f rom Rcr ossj oinS
C: Select*f rom Runi onj oinS
D: Select*f rom Ri nnerj oinS
Q.no38.NULLi s__ __
__ ____.
A: Thesameas0f orinteger
B: Thesameasbl ankf orchar acter
C: Thesameas0f orintegerandbl ankf orcharacter
D: Notav alue
Q.no39.Whi choft hef ollowingi snotal evelofdat aabstraction?
A: Phy sical Level
B: Criti
cal Level
C: Logi cal Level
D: ViewLev el
Q.no40.Af uncti
ont hathasnopar tialf
unctionaldependenci esi si
n
_______f or m:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no41.Themet hodofaccesswhi chuseskeyt r
ansformat i
oni sknown
as:
A: Direct
B: Hash
C: Random
D: Sequent ial
Q.no42.The_ _
__ __ofadat abasekeepsonchangi ng.
A: Inst ance
B: Schema
C: Struct ur e
D: Primar ykey
Q.no43.Whi chnamemustbeuni quewithi
nadat abase?
A: Tabl e
B: Field
C: Recor d
D: Char act er
Q.no44.Af i
lemani pulati
oncommandt hatextr
actssomeoft herecor
ds
fr
om a
fi
leiscal led
A: SELECT
B: PROJECT
C: JOI N
D: PRODUCT
Q.no45.Af unctionaldependencyi sarelat
ionshipbetweenoramong:
A: Tabl es
B: Rows
C: Rel ations
D: Att ri
but es
Q.no46.Theempl oy eesalaryshoul dnotbegreaterthanRs.2000.Thi
sis
______ _
A: i
nt egr it
yconst raint
B: refer ent i
al constraint
C: ov er-def inedconst r
aint
D: feasi bleconst raint
Q.no47.At ablejoinedwi thitselfi
scall
edas_ _______
A: Joi n
B: Sel fJoi n
C: Out erJoi n
D: Equi Joi n
Q.no48._ _ _____pr oducest her el
ati
onthathasat tri
butesofR1andR2
A: Car tesi anpr oduct
B: Differ ence
C: Pr oduct
D: Inter section
Q.no49.I fev erynon- keyat t
ributeisfunctional l
ydependentont he
primar ykey ,
ther elat i
onwi llbei n_ _____
_
A: FirstNor mal For m
B: SecondNor mal Form
C: Thi rdNor mal For m
D: Four thFor mal For m
Q.no50.Thet erm_ ______i
susedt orefertoar ow.
A: At tr
ibut e
B: Tupl e
C: Field
D: Instance
Q.no51.Whi char et het woway sinwhichent i
tiescanpar ti
cipateina
rel
at i
onshi p?
A: Passi veandact ive
B: Tot al andpar tial
C: Simpl eandCompl ex
D: simpl eandpar tial
Q.no52.Ther esul toft heUNI ONoper ationbet weenR1andR2i sa
rel
at i
ont hat
i
ncludes
A: All t
het uplesofR1
B: All t
het uplesofR2
C: All t
het uplesofR1andR2
D: All thet uplesofR1andR2whi chhav ecommoncol umns
Q.no53.Apr i
mar ykeyi scombi nedwi t
haf oreignkeycr eat
es_ ___
__
A: Par ent -
Chi ldr elationshipbetweent het ablest hatconnectthem
B: Manyt omanyr elati
onshipbet weent het ablesthatconnectt hem.
C: Net wor kmodel bet weent hetablesthatconnectt hem.
D: Manyt ooner elationshipbetweent het ablest hatconnectthem.
Q.no54.I fev erynon- keyat t
ributeisfunctional l
ydepedentpr imarykey,
thent he
rel
at i
onwi l
lbei n__ ___________.
A: Firstnor mal form
B: Secondnor mal form
C: Thi rdNor mal form
D: Four thnor mal form
Q.no55._ __ ___ _all
owust oident
ifyuniquel
yat upl
eint herel
ation.
A: Super key
B: Domai n
C: Attribut e
D: Schema
Q.no56.I far elati
oni sinBCNF, t
henitisalsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Q.no57.Doesi ndext akespaceinthedi sk?
A: Indexesar enev erstoredondisk
B: I
tst or esmemor yasandwhenr equired
C: Indexest akenospace
D: Yes, Indexesar est oredondisk
Q.no58.Whi choft hefoll
owingisnotapr opert
yofat ransacti
on?
A: Atomi city
B: Consi st ency
C: Integr i
ty
D: Dur abi l
ity
Q.no59.Whi choft hefoll
owingisnottrueforNor mali
zation?
A: Remov esr edundancy
B: Remov esi nser ti
onanomal y
C: Decomposest her el
ati
on
D: Quer yexecut i
onbecomesf ast
er
Q.no60.Cr eat etabl eemployee(namev ar
char,
idinteger)Whatt ypeof
statement
i
st his?
A: DML
B: DDL
C: View
D: Integr it
yconst r
aint
Q.no1.Whi choft hef oll
owingattr
ibutecanbef urt
herdi v
idedinto
subpar ts
A: Simpl eat tribute
B: Mul tivaluedat t
ri
but e
C: Composi teat tr
ibute
D: Der i
v edat tribute
Q.no2.Al laggr egat ef unctionsexcept_ ____ignorenullv
aluesinthei
r
i
nput
coll
ection.
A: Count (at tribut e)
B: Count (* )
C: Avg
D: Sum
Q.no3.Theov er alldescriptionofadat abasei scall
ed____
__.
A: Datai nt egr ity
B: Datamani pul at i
on
C: Databaseschema
D: Datadef i
ni tion
Q.no4.Cr ossPr oducti sa:
A: Unar yOper at or
B: Ternar yOper ator
C: BinaryOper at or
D: Notanoper at or
Q.no5.Asubschemaexpr esses_ __
_____
_.
A: Thel ogi cal view
B: Thephy sical v i
ew
C: Theext er nal view
D: Thei nter nal v i
ew
Q.no6.Thebasi cdat atypechar (
n)isa_ __
_ _lengt
hcharacterstr
ingand
varchar(n)i s_ _ __ _lengthchar acter
A: Fi
xed, equal
B: Equal, var iabl e
C: Fi
xed, var iabl e
D: Variabl e, equal
Q.no7.Car tesi anpr oducti nr elat
ionalal
gebr ais:
A: aUnar yoper at or
B: aBinar yoper ator
C: aTer nar yoper ator
D: notdef ined
Q.no8.Keyt or epr esentr elati
onshipbetweent abl
esiscall
ed
A: Primar ykey
B: Secondar yKey
C: ForeignKey
D: Candi dat eKey
Q.no9.E- Rmodel ingt echniquei s:
A: Top- downmet hod
B: Bot tom- upmet hod
C: Right -l
ef tappr oach
D: Treest ruct ure
Q.no10.I nE- Rdiagr am gener al
izat
ionisr epresentedby
A: Ell
ipse
B: Dashedel li
pse
C: Rect angl e
D: Triangl e
Q.no11.Whi choft hef ol
lowingshouldbeusedt ofindt
hemeanofthe
salary?
A: Mean( sal ary)
B: Avg( sal ary )
C: Sum( sal ary)
D: Count (sal ary)
Q.no12.I fBi sanat tr
ibuteandA→B, ThenBi ssai
dt obe___
___
__byA.
A: Logi callyi mpl i
ed
B: Funct ional l
yimpl ied
C: Logi callydet ermi ned
D: Funct i
onal l
ydet ermi ned
Q.no13.The_ _
_ ___ connect i
veisusedt ot estforabsenceofset
member shi p.
A: except
B: exists
C: noti n
D: in
Q.no14.Whi choneoft hefollowinguniquelyidenti
f i
estheel
ement
sinthe
rel
ation?
A: Primar ykey
B: Secondar yKey
C: For eignkey
D: Composi tekey
Q.no15.Hi erarchi calmodeli salsocalled_________
.
A: Treest ruct ure
B: PlexSt ruct ure
C: Nor mal i
zeSt ruct ure
D: Tabl eSt ructure
Q.no16.Theconcept ualmodeli s____
__ _
__ .
A: Dependentonhar dwar e
B: Dependentonsof tware.
C: Dependentonbot hhar dwar eandsof tware
D: Independentofbot hhar dwar eandsof tware
Q.no17.Toappl yt heaggr egat efunction,toagr oupofsetof
tuples__ _____ clausei s
used.
A: Groupby
B: having
C: select
D: wher e
Q.no18.Theuser swhouseeasy -t
o-usemenuar ecalled
A: Sophi sticat edenduser s
B: Naïv euser s
C: Stand- aloneuser s
D: Casual enduser
Q.no19.Thedat abaseenv ironmenthasal lofthef ol
lowingcomponents
except ____ ____
A: User s.
B: Separ at efiles
C: Database.
D: Databaseadmi nistrator
Q.no20.Tor emov ear elationf rom anSQLdat abase,weuset he___
___
command.
A: Delete
B: Purge
C: Remov e
D: Dropt abl e
Q.no21.Whi choneoft hef oll
owi ngisnott rueforav iew:
A: Viewi sder ivedf rom ot hert ables
B: Viewi sav ir
tual table.
C: Av iewdef initi
oni sper manent l
ystoredaspar tofthedat abase.
D: Viewnev ercont ainsder ivedcol umns.
Q.no22.Adat adict i
onar yi sar epositorythatmanages_ ____
A: Memor y
B: Met adat a
C: Spel lChecker
D: DataVal idat or
Q.no23.I nSQL‘ relationAcont ainsrelati
onB’ canbewr i
tt
enas
A: Notexi stsBexceptA
B: existsBexceptA
C: Notexi stsAexceptB
D: existsAexceptB
Q.no24.A‘ book’ i
sa_ ____ __
__typeofenti
ty.
A: concept ual
B: concr ete
C: real
D: abst ract
Q.no25.I nwhi chst at eonegat hersandli
stallt
henecessaryf i
eldsf
orthe
databasedesi gnpr oject.
A: Dat aDef i
nition
B: Dat aRef inement
C: Establ i
shi ngRel ationshi p
D: Dat adel etion
Q.no26.Whati sar elationshi pcall
edwhenitismai nt
ainedbetweent wo
entiti
es?
A: Unar y
B: Binar y
C: Ternar y
D: Quat ernar y
Q.no27.Rel ationalAl gebr ais
A: Dat aDef i
nitionLanguage
B: Met aLanguage
C: Procedur al queryLanguage
D: Dat aMani pul ati
onLanguage
Q.no28.I ndomai nr elationalcalculuswecreateavariablef
or
ever y
__ ______
A: Row
B: Column
C: Tabl e
D: Attribute
Q.no29.Whi choft hef ollowingisnotModi f
icat
ionoftheDat abase
A: Delet i
on
B: Inser t
ion
C: Sor t
ing
D: Updat i
ng
Q.no30.I nt he_ _________nor malf orm,acompositeattr
ibut
ei sconvert
ed
to
i
ndi vi
dualat tri
but es.
A: Fi
rst
B: Second
C: Third
D: Fourth
Q.no31.Cust omerwi thdrawi
ngmoneyf rom ATM i sanexampl e
of_________ _
A: Applicat ionpr ogrammer
B: Naïveuser
C: Specializeduser
D: Sophi sticateduser
Q.no32.Whi choft hef oll
owingisanunaryoper ation?
A: Selectionoper ation
B: Gener alizedsel ection
C: Pri
mi tiveoper ati
on
D: Projectionoper ation
Q.no33.Whi choft hef oll
owingarethepropertiesofent i
ties?
A: Groups
B: Table
C: Attri
but es
D: Switchboar ds
Q.no34.Whi choft hef oll
owingenablesust oviewdat afrom at abl
e
basedona
specificcr i
t erion
A: Form
B: Quer y
C: Macr o
D: Repor t
Q.no35.Whi choft hef oll
owingisNotaRel ati
on-algebraOper ati
on
A: Select
B: Union
C: Rename
D: Dropt abl e
Q.no36.whi choft hef oll
owingi
snotadat abaseobj ect
?
A: Tables
B: Quer i
es
C: Relati
onshi ps
D: Repor ts
Q.no37.Whi chSQLQuer yisusetoremov eat ableandal litsdataf
rom
the
database?
A: CreateTabl e
B: Alt
erTabl e
C: DropTabl e
D: Remov eTabl e
Q.no38.Funct ionalDependenci esar ethet y pesofconst r
aintsthatare
based
on_ _
____
A: Key
B: Keyr ev isit
ed
C: Super setkey
D: Tuple
Q.no39.TheRDBMSt ermi nologyf orar owi s________.
A: Tuple.
B: Relation.
C: Attri
but e.
D: Degree.
Q.no40.Thenat uralj
oi ni sequalt o:
A: Cartesi anPr oduct
B: Combi nat i
onofUni onandCar tesianpr oduct
C: Combi nat i
onofsel ect ionandCar t
esi anpr oduct
D: Combi nat i
onofpr oject ionandCar tesianpr oduct
Q.no41.Whi choft hef ollowingi ntruer egar dingRef erentialI
ntegrit
y?
A: Everypr imar y-
keyv al uemustmat chapr imar y-keyv alueinan
associatedt able
B: Everypr imar y-
keyv al uemustmat chaf oreign-keyv alueinanassoci ated
table
C: Everyf or eign-keyv aluemustmat chapr i
mar y
-keyv aluei nan
associatedt able
D: Everyf or eign-keyv aluemustmat chaf oreign-keyv alueinanassoci at
ed
table
Q.no42.Thecol l
ecti
onofi nterr
elat eddat ai scal l
edas:
A: DBMS
B: RDBMS
C: Database
D: Dataabst racti
on
Q.no43.A_ __ _
_ __
_inat ablerepr esent sar elati
onshi pamongasetof
values.
A: Column
B: Key
C: Row
D: Entry
Q.no44.Whi chnor malf ormisconsi der
edadequat eforr elat
ional
database
design?
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q.no45.I none- t
o-manyr elat
ionshipt hetableon'many 'sideiscall
edas:
A: Parent
B: Mast er
C: Sister
D: Child
Q.no46.Mi nimalSuper keysar ecalled
A: Schemakey s
B: Candi datekey s
C: Domai nkey s
D: Attri
but ekeys
Q.no47.Whi chnamemustbeuni quewi thi
nadat abase?
A: Table
B: Fi
eld
C: Recor d
D: Char acter
Q.no48.NULLi s_ ____
_ ____
.
A: Thesameas0f orinteger
B: Thesameasbl ankf orcharacter
C: Thesameas0f orintegerandbl ankf orcharact
er
D: Notav alue
Q.no49.At ablejoinedwi thit
selfiscal l
edas_ _____
__
A: Join
B: SelfJoi n
C: OuterJoi n
D: Equi Join
Q.no50.Af uncti
ont hathasnopar ti
alfunctionaldependenciesisin
_______f orm:
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no51.At ablehasf i
el dsF1, F2, F3, F4,F5wi tht
hefol
lowingfuncti
onal
dependenci es
Fi—>F3,
F2—>F4
(FI,F2)—>F5
I
nt ermsofnor mal i
zation, thist ableisin
A: 1NF
B: 2NF
C: 3NF
D: BCNF
Q. no52.At ableont hemanysi deofaonet omanyormanyt omany
relat i
onshi p
must :
A: Bei nSecondNor mal For m( 2NF)
B: BeinThi rdNor mal For m( 3NF)
C: Hav easi ngleat t
r i
but ekey
D: Hav eacomposi tekey
Q. no53.Af terthef inalst at ementofat r
ansactionhasbeenexecuted,a
transact ionent ersina_ __ ___ ___state._______
.
A: Active
B: aborted
C: Commi tted
D: Partiall
ycommi tted
Q. no54.The_ _ _
_ _
__ __pr otocolensur esf reedom fr
om deadl
ock.
A: Two- phasel ockingpr ot ocol
B: Stri
ctt wo-phasel ocki ngpr otocol
C: Rigoroust wo- phasel ocki ngpr otocol
D: Timest ampor deringpr ot ocol
Q. no55.Consi derthef ol lowi ng
S1:For eignkeyal l
owsnul lv alues.
S2:Ev erybinar ytablesi si nBCNF
Whi choft hef oll
owi ngi st rue?
A: BothS1andS2ar etr ue
B: S1ist rue
C: S2i strue
D: BothS1andS2ar ef alse
Q. no56.Af unctionaldependencyoft hef orm x—>yistri
valif
A: y⊆x
B: y⊂x
C: x⊂y
D: x⊂yandy ⊂x
Q. no57.Amongstt heACI Dpr opertiesofat r
ansacti
on,t
he'Durabil
it
y'
proper t
y
requi res.thatthechangesmadet othedatabasebyasuccessf ul
transact ion
per sist
A: Excepti ncaseofanoper atingsy stem crash
B: Excepti ncaseofadi skcr ash
C: Excepti ncaseofapowerf ailure
D: Alway s,evenifther eisaf ailureofanykind
Q. no58.I nthe_ _________normalf orm, acompositeatt
ri
buteisconvert
ed
to
i
ndi vidualat tr
ibutes
A: First
B: Second
C: Third
D: Four t
h
Q. no59.I feverynon- keyattributei sfuncti
onall
ydepedentpri
mar ykey,
thent he
relationwi l
lbein___ _
_ __
______ .
A: Firstnormal form
B: Secondnor mal form
C: ThirdNor mal form
D: Four t
hnor mal form
Q. no60.I farelati
oni sinBCNF, thenitisalsoin
A: 1NF
B: 2NF
C: 3NF
D: 5NF
Database Transactions and Query Processing

1. Collections of operations that form a single logical unit of work are called __________

a) Views

b) Networks

c) Units

d) Transactions

2. The “all-or-none” property is commonly referred to as _________

a) Isolation

b) Durability

c) Atomicity

d) None of the mentioned

3. Which of the following is a property of transactions?

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

4. Execution of translation in isolation preserves the _________ of a database

a) Atomicity

b) Consistency

c) Durability

d) All of the mentioned

5. Which of the following systems is responsible for ensuring durability?

a) Recovery system

b) Atomic system

c) Concurrency control system

d) Compiler system

6. Which of the following is not a transaction state?

a) Active

b) Partially committed

c) Failed

d) Compensated

7. The execution sequences in concurrency control are termed as ________

a) Serials

b) Schedules

c) Organizations

d) Time tables

8. The scheme that controls the interaction between executing transactions is called as _____

a) Concurrency control scheme

b) Multiprogramming scheme

c) Serialization scheme

d) Schedule scheme
9. The deadlock in a set of transaction can be determined by

a. Read-only graph

b. Wait graph

c. Wait-for graph

d. All of the mentioned

10 A deadlock exists in the system if and only if the wait-for graph contains a ___________.

a. Cycle

b. Direction

c. Bi-direction

d. Rotation

11 __________ rollback requires the system to maintain additional information about the state of all
the running transactions.

a. Total

b. Partial

c. Time

d. Commit

12. A transaction for which all committed changes are permanent is called:

a. atomic

b. consistent

c. isolated

d. durable
13. In this instance, dirty reads are disallowed, while nonrepeatable reads and phantom reads are
allowed.

a. Read committed

b. Read uncommitted

c. Repeatable read

d. Serializable

14. A transaction may not always complete its execution successfully. Such a transaction is termed

a. Aborted

b. Terminated

c. Closed

d. All of the mentioned

15. Transaction management ensures ____________ and __________ properties.

a. Atomicity and Intigrity

b. Atomicity and Durability

c. Atomicity and Abstraction

d. None of these

16. ____________ is an interface between low level database and application program.

a. Database Associator

b. Database Server

c. Database Manage

d. None of these
17. Who detects the failure of the system and restore the database to consistent state ?

a. Database Administrator

b. Application Programmer

c. Naive User

d. Storage Manager

18. Which of the following is the preferred way to recover a database after a transaction in progress
terminates abnormally?

a. Rollback

b. Rollforward

c. Switch to duplicate database

d. Reprocess transactions

19. Which of the following is the preferred way to recover a database after a system failure?

a. Rollback

b. Rollforward

c. Switch to duplicate database

d. Reprocess transactions

20. A shared lock allows which of the following types of transactions to occur?

a. Delete

b. Insert

c. Read

d. Update
21. A transaction that performs only one operation is called as a _________

a) Partial schedule

b) Complete schedule

c) Dependent schedule

d) Independent schedule

22. The phenomenon in which one failure leads to a series of transaction rollbacks is called as
________

a) Cascading rollback

b) Cascadeless rollback

c) Cascade cause

d) None of the mentioned

23. State true or false: Every cascadeless schedule is also recoverable

a) True

b) False

24. Which of the following are the advantages of transaction concurrency?

a) Increased throughput

b) Increased utilization

c) Reduces average response time

d) All of the mentioned

25. If a schedule is equivalent to a serial schedule, it is called as a _________

a) Serializable schedule

b) Equivalent schedule

c) Committed schedule

d) None of the mentioned

26. Which of the following is not a type of a schedule?

a) Partial schedule

b) Dependent schedule

c) Recoverable schedule

d) None of the mentioned

27. If a transaction has obtained a __________ lock, it can read but cannot write on the item

a) Shared mode

b) Exclusive mode

c) Read only mode

d) Write only mode

28. A transaction can proceed only after the concurrency control manager ________ the lock to the
transaction

a) Grants

b) Requests

c) Allocates

d) None of the mentioned

29. The situation where no transaction can proceed with normal execution is known as ________

a) Road block

b) Deadlock

c) Execution halt

d) Abortion
30. The log is a sequence of _________ recording all the update activities in the database.

a) Log records

b) Records

c) Entries

d) Redo

31. The current copy of the database is identified by a pointer, called ____________ which is stored
on disk.

a) Db-pointer

b) Update log

c) Update log records

d) All of the mentioned

32. If a transaction does not modify the database until it has committed, it is said to use the
___________ technique.

a) Deferred-modification

b) Late-modification

c) Immediate-modification

d) Undo

33. In the __________ phase, the system replays updates of all transactions by scanning the log
forward from the last checkpoint.

a) Repeating

b) Redo

c) Replay

d) Undo
34.Which of the following is not a recovery technique?

a.Deferred update

b.Immediate update

c.Two-phase commit

d.Recovery management

35.Checkpoints are a part of

a.Recovery measures

b.Security measures

c.Concurrency measures

d.Authorization measures

36. ....... deals with soft errors, such as power failures.

a. system recovery

b. media recovery

c. database recovery

d. failure recovery

37. Which commands are used to control which users have which privilege over which objects ?

a. QUE and QUIST

b. GRANT and REVOKE

c. CASECADE and MVD

d. None of the above

38. Which of the following are steps in query processing?

a) Parsing and translation

b) Optimization

c) Evaluation

d) All of the mentioned

39. A sequence of primitive operations that can be used to evaluate a query are called as
__________

a) Query evaluation algebra

b) Query evaluation plan

c) Query evaluation primitive

d) Query evaluation engine

40. Sorting of relations that do not fit in memory is called as _______

a) Internal sorting

b) External sorting

c) Overflow sorting

d) Overload sorting

41. A system is in a _______ state if there exists a set of transactions in which every transaction is
waiting for another transaction in the set.

a) Deadlock

b) Starved

c) Isolated

d) None of the mentioned

42. Which of the following is not a method in deadlock handling

a) Deadlock prevention

b) Deadlock detection

c) Deadlock recovery

d) Deadlock distribution

43. Deadlocks can be prevented using

a) Preemption and transaction rollbacks

b) Wait and die scheme

c) Wound-wait scheme

d) All of the mentioned

44. State true or false: Wait die scheme is a non-preemptive technique

a) True

b) False

45. Lock timeouts have which of the following advantages?

a) Unnecessary rollbacks do not occur

b) Transactions do not starve

c) It is easy to implement

d) All of the mentioned

46. The _________ graph describes deadlocks precisely

a) Wound wait graph

b) Wait die graph

c) Wait for graph

d) None of the mentioned

47. How do we generally recover from a deadlock?

a) By aborting all the transactions

b) By rolling back all the transactions

c) By rolling back only a selected number of transactions

d) None of the mentioned

48. State true or false: Partial rollback is not possible.

a) True

b) False

49. Which of the following steps must be taken while choosing a victim?

a) Avoiding starvation

b) Number of transactions involved in rollback

c) Data items used by the transaction

d) All of the mentioned

50. Which of the following cannot be used to implement a timestamp

a) System clock

b) Logical counter

c) External time counter

d) None of the mentioned

51. A logical counter is _________ after a new timestamp has been assigned

a) Incremented

b) Decremented

c) Doubled

d) Remains the same

52. W-timestamp(Q) denotes?

a) The largest timestamp of any transaction that can execute write(Q) successfully

b) The largest timestamp of any transaction that can execute read(Q) successfully

c) The smallest timestamp of any transaction that can execute write(Q) successfully

d) The smallest timestamp of any transaction that can execute read(Q) successfully

53. R-timestamp(Q) denotes?

a) The largest timestamp of any transaction that can execute write(Q) successfully

b) The largest timestamp of any transaction that can execute read(Q) successfully

c) The smallest timestamp of any transaction that can execute write(Q) successfully

d) The smallest timestamp of any transaction that can execute read(Q) successfully

54. A ________ ensures that any conflicting read and write operations are executed in timestamp
order

a) Organizational protocol

b) Timestamp ordering protocol

c) Timestamp execution protocol

d) 802-11 protocol
55. The default timestamp ordering protocol generates schedules that are

a) Recoverable

b) Non-recoverable

c) Starving

d) None of the mentioned

56. State true or false: The Thomas write rule has a greater potential concurrency than the
timestamp ordering protocol

a) True

b) False

57. Which of the following timestamp based protocols generates serializable schedules?

a) Thomas write rule

b) Timestamp ordering protocol

c) Validation protocol

d) None of the mentioned

58. In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-
timestamp(Q), then

a) Read operation is executed

b) Read operation is rejected

c) Write operation is executed

d) Write operation is rejected

59. In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-
timestamp(Q), then

a) Read operation is executed

b) Read operation is rejected

c) Write operation is executed

d) Write operation is rejected

60. _______________ is a procedural extension of Oracle – SQL that offers language constructs
similar to those in imperative programming languages.

a) SQL

b) PL/SQL

c) Advanced SQL

d) PQL

61. ___________ combines the data manipulating power of SQL with the data processing power of
Procedural languages.

a) PL/SQL

b) SQL

c) Advanced SQL

d) PQL

62. _______________ has made PL/SQL code run faster without requiring any additional work on
the part of the programmer.

a) SQL Server

b) My SQL

c) Oracle

d) SQL Lite
63. A line of PL/SQL text contains groups of characters known as

a) Lexical Units

b) Literals

c) Textual Units

d) Identifiers

64. We use ______________ name PL/SQL program objects and units.

a) Lexical Units

b) Literals

c) Delimiters

d) Identifiers

65. A ___________________ is an explicit numeric, character, string or Boolean value not

represented by an identifier.

a) Comments

b) Literals

c) Delimiters

d) Identifiers.

66. If no header is specified, the block is said to be an _______________ PL/SQL block.

a) Strong

b) Weak

c) Empty

d) Anonymous
67. _________________ is a sequence of zero or more characters enclosed by single quotes.

a) Integers literal

b) String literal

c) String units

d) String label

68. In _______________ the management of the password for the account can be handled outside
of oracle such as operating system.

a) Database Authentication

b) Operating System Authentication

c) Internal Authentication

d) External Authentication

69. In ________________ of Oracle, the database administrator creates a user account in the
database for each user who needs access.

a) Database Authentication

b) Operating System Authentication

c) Internal Authentication

d) External Authentication

70. Consider money is transferred from (1)account-A to account-B and (2) account-B to account-A.
Which of the following form a transaction?

a) Only 1

b) Only 2

c) Both 1 and 2 individually

d) Either 1 or 2
71. A transaction is delimited by statements (or function calls) of the form __________

a) Begin transaction and end transaction

b) Start transaction and stop transaction

c) Get transaction and post transaction

d) Read transaction and write transaction

72. Identify the characteristics of transactions

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

73. Which of the following has “all-or-none” property?

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

74. The database system must take special actions to ensure that transactions operate properly
without interference from concurrently executing database statements. This property is referred to
as

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

75. The property of a transaction that persists all the crashes is

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

76. __________ states that only valid data will be written to the database.

a) Consistency

b) Atomicity

c) Durability

d) Isolation

77. Transaction processing is associated with everything below except

a) Producing detail summary or exception reports

b) Recording a business activity

c) Confirming an action or triggering a response

d) Maintaining a data

78. The Oracle RDBMS uses the ____ statement to declare a new transaction start and its properties.

a) BEGIN

b) SET TRANSACTION

c) BEGIN TRANSACTION

d) COMMIT
79. ____ means that the data used during the execution of a transaction cannot be used by a second
transaction until the first one is completed.

a) Consistency

b) Atomicity

c) Durability

d) Isolation

80. The most widely used structure for recording database modification is called as _______

a) Log

b) List

c) Queue

d) Stack

81. An update log record describes a ________ database write

a) Single

b) Double

c) Triple

d) Quadruple

82. Which of the following fields does the update log record have?

a) Transaction identifier

b) Data-item identifier

c) Old value

d) All of the mentioned

83. The unique identifier of the transaction that performed the write operation is called as _______

a) Transaction identifier

b) Data-item identifier

c) Old value

d) New value

84. The value of the data item prior to the write is called as _________

a) Transaction identifier

b) Data-item identifier

c) Old value

d) New value

85. If a transaction does not modify the database until it has committed it is said to use a _______
modification technique

a) Deferred

b) Immediate

c) More than one of the mentioned

d) None of the mentioned

86. We say that a transaction has been ________ when its commit log record has been output to
stable storage.

a) Locked

b) Completed

c) Committed

d) Released
87. State true or false: Using checkpoints reduces overhead

a) True

b) False

88. A __________ checkpoint is a checkpoint where transactions are allowed to perform updates
even while buffer blocks are being written out.

a) Temporary

b) Fuzzy

c) Permanent

d) Recovery

89. If the database modifications occur while the transaction is still active, the transaction is said to
use the __________ modification technique

a) Deferred

b) Immediate

c) More than one of the mentioned

d) None of the mentioned

90. A collection of data designed to be used by different people is called a/an

a) Organization

b) Database

c) Relationship

d) Schema
91. Which of the following is the oldest database model?

a) Relational

b) Deductive

c) Physical

d) Network

92. Which of the following schemas does define a view or views of the database for particular users?

a) Internal schema

b) Conceptual schema

c) Physical schema

d) External schema

93. Which of the following is an attribute that can uniquely identify a row in a table?

a) Secondary key

b) Candidate key

c) Foreign key

d) Alternate key

94. Which of the following are the process of selecting the data storage and data access
characteristics of the database?

a) Logical database design

b) Physical database design

c) Testing and performance tuning

d) Evaluation and selecting

95. Which of the following terms does refer to the correctness and completeness of the data in a
database?

a) Data security

b) Data constraint

c) Data independence

d) Data integrity

96. The relationship between DEPARTMENT and EMPLOYEE is a

a) One-to-one relationship

b) One-to-many relationship

c) Many-to-many relationship

d) Many-to-one relationship

97. A table can be logically connected to another table by defining a

a) Super key

b) Candidate key

c) Primary key

d) Unique key

98. If the state of the database no longer reflects a real state of the world that the database is
supposed to capture, then such a state is called

a) Consistent state

b) Parallel state

c) Durable state

d) Inconsistent state
99. Ensuring isolation property is the responsibility of the

a) Recovery-management component of the DBMS

b) Concurrency-control component of the DBMS

c) Transaction-management component of the DBMS

d) Buffer management component in DBMS

100. ______________ allow concurrent transactions to read (SELECT) a resource.

A. Update locks

B. Shared locks

C. Exclusive Locks

D. All of the mentioned

DBMS 5th Unit MCQ’s

1) Commit and rollback are related to ..........

A. data integrity

B. data consistency

C. data sharing

D. data security

2) The transaction wants to edit the data item is called as .......

A. Exclusive Mode

B. Shared Mode

C. Inclusive Mode

D. Unshared Mode

3) For committing a transaction, the DBMS might discard all the records.

A. after image

B. before image

C. log

D. redo log

4) A sophisticated locking mechanism known as 2-phase locking which includes Growing phase and .

A. Shrinking Phase

B. Release phase

C. Commit phase

D. Acquire Phase

5) A Transaction ends
A. only when it is Committed.

B. only when it is Rolled-back

C. when it is Committed or Rolled-back

D. only when it is initialized

6) In .........., each transactions there is a first phase during which new lock are acquired.

A. Shrinking Phase

B. Release phase

C. Commit phase

D. Growing Phase

7) A transaction processing system is also called as .......

A. processing monitor

B. transaction monitor

C. TP monitor

D. monitor

8) The transactions are always ......... if it always locks a data item in shared mode before reading it.

A. well formed

B. well distributed

C. well locked

D. well shared

9) .......... servers which is widely used in relational database systems.

A. Data servers

B. Transaction servers

C. Query servers

D. Client servers
10) If a distributed transactions are well-formed and 2-phasedlocked, then ................ is the correct
locking mechanism in distributed transaction as well as in centralized databases.

A. two phase locking

B. three phase locking

C. transaction locking

D. well-formed locking

11) ......... property will check whether all the operation of a transaction completed or none.

A. Atomicity

B. Consistency

C. Isolation

D. Durability

12) The total ordering of operations across groups ensures ...........of transactions.

A. serializability

B. synchronizability

C. atomicity

D. durability

13) In which state, the transaction will wait for the final statement has been executed?

A. Active

B. Failed

C. Aborted

D. partially committed

14) The ORDER concurrency control technique is based on the property.

A. ordering mechanism
B. inherent ordering

C. total ordering

D. partial ordering

15) Transactions per rollback segment is derived from .....

A. Db_Block_Buffers

B. Processes

C. shared_Pool_size

D. buffers

16) The ............is responsible for ensuring correct execution in the presence of failures.

A. Database Manager
B. Transaction Manager

C. Recovery Manager

D. Executive Manager

17) A distributed transaction can be ............. if queries are issued at one or more nodes.

A. fully read-only

B. partially read-only

C. fully read-write

D. partially read-write

18) The distributed transaction can be completely read-only and the transaction is started with a
.......... READ ONLY statement.

A. DISTRIBUTED_TRANSACTIONS

B. TRANSACTION

C. SET TRANSACTION

D. READ TRANSACTION
19) The initialization parameter ................. controls the number of possible distributed transactions
in which a given instance can concurrently participate, both as a client and a server.

A. DISTRIBUTED_TRANSACTIONS

B. TRANSACTION

C. SET TRANSACTION

D. CONTROL TRANSACTION

20) A database administrator can manually force the COMMIT or ROLLBACK of a local ............
distributed transaction.

A. in-force

B. in-doubt

C. in-local

D. in-manual

21) Computer system of a parallel computer is capable of

A. Decentralized computing
B. Parallel computing
C. Centralized computing
D. Decentralized computing

22) Writing parallel programs is referred to as

A. Parallel computation
B. Parallel processes
C. Parallel development
D. Parallel programming

23) Simplifies application’s of three-tier architecture is ____________.

A. Maintenance
B. Initiation
C.Implementation
D. Deployment

24) Dynamic networks of networks, is a dynamic connection that grows is called

A. Multithreading
B. Cyber cycle
C. Internet of things
D. Cyber-physical system

25) In which application system Distributed systems can run well?

A. HPC
D. HTC
C. HRC
D. Both A and B

26) In which systems desire HPC and HTC.

A. Adaptivity
B. Transparency
C. Dependency
D. Secretive

27) No special machines manage the network of architecture in which resources are known as

A. Peer-to-Peer
B. Space based
C. Tightly coupled
D. Loosely coupled

28) Significant characteristics of Distributed systems have of

A. 5 types
B. 2 types
C. 3 types
D. 4 types

29) Built of Peer machines are over

A. Many Server machines

B. 1 Server machine
C. 1 Client machine
D. Many Client machines

30) Data access and storage are elements of Job throughput, of __________.

A. Flexibility
B. Adaptation
C. Efficiency
D. Dependability

31) In Distributed database, ______________ are the transactions for which a <ready T> log is found
in the log file, but neither a <commit T> log nor an <abort T> log is found.

a) In-doubt transactions

b) Serialized transactions

c) Cascadeless transactions

d) Distributed transactions

32) A semijoin is which of the following?

A) Only the joining attributes are sent from one site to another and then all of the rows are returned.

B) All of the attributes are sent from one site to another and then only the required rows are
returned.

C) Only the joining attributes are sent from one site to another and then only the required rows are
returned.

D) All of the attributes are sent from one site to another and then only the required rows are
returned.

33) Which of the following is a disadvantage of replication?

A) Reduced network traffic

B) If the database fails at one site, a copy can be located at another site.

C) Each site must have the same storage capacity.

D) Each transaction may proceed without coordination across the network.

34) A distributed database can use which of the following strategies?

A) Totally centralized at one location and accessed by many sites

B) Partially or totally replicated across sites

C) Partitioned into segments at different sites

D) All of the above

35) Which of the following is not one of the stages in the evolution of distributed DBMS?

A) Unit of work
B) Remote unit of work

C) Distributed unit of Work

D) Distributed request

36) A distributed transaction can be ............. if queries are issued at one or more nodes.

A) fully read-only

B) partially read-only

C) fully read-write

D) partially read-write

37) Depending on the situation each node in the Distributed Database system can act as, _________
.

A) A client

B) A server

C) Both A & B

D) None of the above

38) Which transaction contains statements that access more than one node?

A) A Remote Transaction

B) A Distributed transaction

C) Both A & B

D) None of the above

39) What is the mechanism which guarantees that all database servers participating in a distributed
transaction either all commit or all roll back the statements in the transaction?

A) Commit

B) Commit transaction

C) Two-phase commit

D) Three-phase commit

40) Stored procedures have which of the following advantages?

A) It takes a longer time to write them as compared to writing Visual Basic.

B) Network traffic increases

C) Data integrity improves as multiple applications access the same stored procedure.

D) Result in thicker client and thinner database server.

41) If the transaction is rolled back, all the database changes made inside the transaction are ……
A. made permanent
B. made temporary

C. copied to the log

D. Undone

42) Which of the following is not a property of transactions?

A. Atomicity
B. Concurrency
C. Isolation
D. Durability

43) A ……… ensures that transactions are performed as expected.

A. transaction processing monitor
B. transaction procedure monitor
C. isolation monitor
D. transaction log

44) A transaction that completes its execution successfully is said to be …….

A. committed
B. rolled back
C. partially committed
D. Aborted

45) …….. means that a transaction must execute exactly once completely or not at all.
A. durability
B. consistency
C. atomicity
D. Isolation

46) Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
A. It will result in a deadlock situation
B. It will immediately be rejected

C. It will immediately be granted

D. It will be granted as soon as it is released by A

47) ……….. means that when it ends, a transaction must leave the database in a consistent state.
A. Data isolation
B. Data duration
C. Data consistency
D. Data non-reputability

48) The number of transactions executed in a given amount of time is called ………
A. utilization
B. execution rate
C. throughput
D. atomicity

49) Isolation means ……

A. transaction must not interfere with each other
B. transaction must interfere with each other
C. transaction must be in a consistent state
D. transaction must be executed immediately

50) Which of the following ensures the atomicity of the transaction?

A. Transaction management component of DBMS
B. Application Programmer
C. The concurrency control component of DBMS
D. Recovery management component of DBMS

51) …….. means that a transaction must make its changes permanent to the database ends.
A. isolation
B. locking
C. durability

D. consistency

52) Throughput means

A. number of transactions that are committed in one hour
B. number of operations in a transaction
C. number of transaction that can be aborted in a given amount of time
D. number of transaction that can be executed in a given amount of time
53) …….. deals with individual transactions.
A. isolate transactions
B. transaction recovery
C. system recovery
D. media recovery

54) The part of a database management system which ensures that the data remains in a consistent
state is
A. authorization and integrity manager
B. buffer manager
C. transaction manager
D. file manager

55) ……… protocol is used to perform multiple transactions that execute on a different database.
A. commit
B. two-phase lock
C. two-phase commit
D. locking

56) A transaction can do read and write operation on a data item when it acquires ……
A. read mode
B. exclusive mode
C. shared mode

D. write mode

57) In ………. one transaction overwrites the changes of another transaction.

A. uncommitted read problem
B. lost update problem
C. update lost problem
D. dirty read problem

58) Isolation of the transactions is ensured by

A. Transaction management
B. Application programmer
C. Concurrency control
D. Recovery management

59) In a dirty read problem …….

A. one transaction reads an uncommitted value of another transaction
B. one transaction reads the committed value for another transaction
C. one transaction reads another transaction
D. one transaction commits another transaction.

60) A transaction can do only read operation and not write operation on a data item when it
acquires ……. lock.
A. read mode
B. exclusive mode
C. shared mode
D. write mode

61) In the …………, one transaction inserts a row in the table while the other transaction is halfway
through its browsing of the table.
A. transaction read a problem

B. one way read a problem

C. serial read problem
D. phantom read problem

62) Transaction processing is associated with everything below except.

A. producing detail, summary, or exception reports
B. recording a business activity
C. confirming an action or triggering a response
D. maintaining data

63) ………. helps solve the concurrency problem.

A. locking
B. transaction monitor
C. transaction serializability
D. two-phase commit

64) If a transaction acquires a shared lock, then it can perform ………. operation.
A. read
B. write
C. read and write
D. update

65) If a transaction obtains a shared lock on a row, it means that the transaction wants to ….. that
row.
A. write
B. insert
C. execute
D. read
66) The node where the distributed transaction originates is called the …….
A. local coordinator

B. starting coordinator

C. global coordinator

D. originating node

67) If a transaction obtains an exclusive lock on a row, it means that the transaction wants to …….
that row.
A. select
B. update
C. view
D. read

68) If a transaction acquires an exclusive lock, then it can perform ………. operation.
A. read
B. write
C. read and write
D. update

69) …….. is a specific concurrency problem wherein two transactions depend on each other for
something.
A. phantom read problem
B. transaction read a problem
C. deadlock
D. locking

70) If a database server is referenced in a distributed transaction, the value of its commit point
strength determines which role it plays in the ………
A. two-phase commit
B. two-phase locking
C. transaction locking
D. checkpoints

71) Transaction ………. ensures that the transaction is being executed successfully.
A. concurrency
B. consistency
C. serializability
D. non-serialiasability
72) The situation in which a transaction holds a data item and waits for the release of data item held
by some other transaction, which in turn waits for another transaction, is called …….
A. serializable schedule
B. process waiting
C. concurrency
D. deadlock

73) ………… protocol grantees that a set of transactions becomes serializable.

A. two-phase locking
B. two-phase commit
C. transaction locking
D. checkpoints

74) The global coordinator forgets about the transaction phase is called ………
A. Prepare phase
B. Commit phase
C. Forget phase
D. Global phase

75) In two-phase commit, ………. coordinates the synchronization of the commit or rollback
operations.
A. database manager
B. central coordinator
C. participants
D. concurrency control manager

Ads by optAd360

76) In two-phase locking protocol, a transaction obtains locks in ……..phase.

A. shrinking phase
B. growing phase
C. running phase
D. initial phase

77) A transaction processing system is also called as ……..

A. processing monitor
B. transaction monitor
C. TP monitor
D. monitor

78) After the nodes are prepared, the distributed transaction is said to be ……
A. in-doubt
B. in-prepared
C. prepared transaction
D. in-node

79) In ………., we have many mini transactions within the main transaction.
A. transaction control
B. chained transaction
C. nested transaction
D. calling transaction

80) In a two-phase locking protocol, a transaction release locks in ……… phase.

A. shrinking phase
B. growing phase
C. running phase
D. initial phase

81) A mechanism which ensures that simultaneous execution of more than one transaction does not
lead to any database inconsistencies is called ……………… mechanism.
A. transaction control

B. transaction management

C. concurrency parallelism

D. concurrency control

82) The transaction wants only to read the data item of the mode is called as …….
A. Exclusive Mode
B. Shared Mode
C. Inclusive Mode
D. Unshared Mode

83) Any execution of a set of transactions is called as its ………

A. non-serial schedule
B. serial schedule
C. schedule
D. interleaved schedule

84) ………… is a program or set of program that interacts with the database at some point in its
execution.
A. A database system
B. A database application
C. Both
D. none

85) ………. component of a database is responsible for ensuring atomicity and durability.
A. recovery management
B. concurrency control
C. storage management
D. query evaluation engine

86) The activity of ensuring atomicity in the presence of Transaction aborts is called ……….
A. transaction control

B. transaction management

C. transaction recovery

D. concurrency control

87) A ………….is a set of rules that state when a transaction may lock or unlock each of the data items
in the database
A. concurrency control
B. transaction control
C. validation control
D. locking protocol

88) ……………… is a collection of programs performing all necessary action associated with a database.
A. Database associated
B. Database administrator
C. Database application
D. Database management system

89) Which protocol permits the release of exclusive locks only at the end of the transaction?
A. Graph-based protocol
B. The strict two-phase locking protocol
C. Two-phase locking protocol
D. Rigorous Two-phase locking protocol

90) The activity of providing Durability of the transaction is called …..

A. database control
B. transaction management
C. transaction recovery
D. database recovery
91) Which protocol allows a transaction to lock a new data item only if that transaction has not yet
unlocked data item?

A. Graph-based protocol.

B. The strict two-phase locking protocol

C. Two-phase locking protocol

D. Timestamp ordering scheme

92) ………. is a collection of application programs that interact with the database along with DBMS.
A. A database system
B. A database application
C. Database administration
D. Data system

93) …….. ensures that once the transaction completes successfully, the results of the operations
become permanent.
A. serializability
B. synchronizability
C. atomicity
D. durability

94) A ……. contains information for undoing or redoing all the actions performed by the transactions.
A. save point
B. log
C. node
D. commit_point

95) A …………. is a unit of program execution that accesses and possibly updates various data items.
A. DBMS
B. monitor
C. transaction
D. transistor

96) A transaction is an action used to perform some manipulation on data stored in the ……..
A. Memory
B. Record
C. Database
D. All of these
97) A transaction is terminated if it has ……..
A. aborted
B. committed
C. running state
D. aborted or committed

98) The two possible communication errors are, Lost messages and …….
A. Network Partitions
B. Lost acknowledgment
C. Timeout
D. log error

99) The only way to undo the effects of a committed transaction is to execute a …….
A. committed transaction
B. compensating transaction
C. supplementary transaction
D. update query

100) In ………., one or more users/programs attempt to access the same data at the same time.
A. concurrency
B. transaction control
C. locking
D. two-phase locking

ANSWERS:

1) B. data consistency
2) A. Exclusive Mode
3) B. before image
4) A. Shrinking Phase
5) C. when it is Committed or Rolled-back
6) D. Growing Phase
7) C. TP monitor
8) A. well formed
9) B. Transaction servers
10) A. two phase locking
11) A. Atomicity
12) A. serializability
13) D. partially committed
14) C. total ordering
15) B. Processes
16) A. Database Manager
17) B. partially read-only
18) C. SET TRANSACTION
19) A. DISTRIBUTED_TRANSACTIONS
20) B. in-doubt
21) A.Decentralized computing
22) D. Parallel programming
23) D. Deployment
24) C. Internet of things
25) D. Both A and B
26) B. Transparency
27) A. Peer-to-Peer
28) C. 3 types
29) D. Many Client machines
30)C. Efficiency
31)A. In-doubt transactions
32)C- Only the joining attributes are sent from one site to another and then only the required rows
are returned.
33)C- Each site must have the same storage capacity.
34)D- All of the above
35)A- Unit of work
36)B- partially read-only
37)C-Both A & B
38)B- A Distributed transaction
39)C- Two-phase commit
40)C- Data integrity improves as multiple applications access the same stored procedure.
41) D. undone
42) B. Concurrency
43) A. transaction processing monitor
44) A. committed
45) C. atomicity
46) C. It will immediately be granted
47) C. Data consistency
48) c. throughput
49) A. transaction must not interfere with each other
50) A. Transaction management component of DBMS
51) C. durability
52) D. number of transaction that can be executed in a given amount of time
53) B. transaction recovery
54) C. transaction manager
55) C. two-phase commit
56) B. exclusive mode
57) B. lost update problem
58) C. Concurrency control
59) A. one transaction reads an uncommitted value of another transaction
60) C. shared mode
61) D. phantom read problem
62) C. confirming an action or triggering a response
63) A. locking
64) A. read
65) D. read
66) C. global coordinator
67) B. update
68) C. read and write
69) C. deadlock
70) A. two-phase commit
71) C. serializability
72) D. deadlock
73) A. two-phase locking
74) C. Forget phase
75) B. central coordinator
76) B. growing phase
77) C. TP monitor
78) A. in-doubt
79) B. chained transaction
80) A. shrinking phase
81) D. concurrency control
82) B. Shared Mode
83) C. schedule
84) B. A database application
85) A. recovery management
86) C. transaction recovery
87) D. locking protocol
88) D. Database management system
89) B. Strict two-phase locking protocol
90) D. database recovery
91) C. Two-phase locking protocol
92) A. A database system
93) D. durability
94) B. log
95) C. transaction
96) C. Database
97) C. running state
98) A. Network Partitions
99) B. compensating transaction
100) A. concurrency
DBMS 6th UNIT MCQ’s

1. Which of the following is not a NoSQL database?

a) SQL Server
b) MongoDB
c) Cassandra
d) None of the mentioned

2. Point out the correct statement.

a) Documents can contain many different key-value pairs, or key-array pairs, or even nested
documents
b) MongoDB has official drivers for a variety of popular programming languages and development
environments
c) When compared to relational databases, NoSQL databases are more scalable and provide superior
performance
d) All of the mentioned

3. Which of the following is a NoSQL Database Type?

a) SQL
b) Document databases
c) JSON
d) All of the mentioned

4. Which of the following is a wide-column store?

a) Cassandra
b) Riak
c) MongoDB
d) Redis

5. Point out the wrong statement.

a) Non Relational databases require that schemas be defined before you can add data
b) NoSQL databases are built to allow the insertion of data without a predefined schema
c) NewSQL databases are built to allow the insertion of data without a predefined schema
d) All of the mentioned

6. “Sharding” a database across many server instances can be achieved with _______________
a) LAN
b) SAN
c) MAN
d) All of the mentioned

7. Most NoSQL databases support automatic __________ meaning that you get high availability and
disaster recovery.
a) processing
b) scalability
c) replication
d) all of the mentioned

8. Which of the following are the simplest NoSQL databases?

a) Key-value
b) Wide-column
c) Document
d) All of the mentioned

9. ________ stores are used to store information about networks, such as social connections.
a) Key-value
b) Wide-column
c) Document
d) Graph

10. NoSQL databases is used mainly for handling large volumes of ______________ data.
a) unstructured
b) structured
c) semi-structured
d) all of the mentioned

11. Following represent column in NoSQL __________.

a) Database

b) Field

c) Document

d) Collection

12.What is the aim of NoSQL?

a) NoSQL provides an alternative to SQL databases to store textual data.

b) NoSQL databases allow storing non-structured data.

c) NoSQL is not suitable for storing structured data.

d) NoSQL is a new data format to store large datasets.

13.__________ is a online NoSQL developed by Cloudera.

a) HCatalog

b) Hbase

c) Imphala

d) Oozie

14.Which of the following is not a NoSQL database?

a) SQL Server

b) MongoDB

c) Cassandra

d) None of the mentioned

15.Which of the following is a NoSQL Database Type?

a) SQL

b) Document databases

c) JSON

d) All of the mentioned

16.Which of the following is a wide-column store?

a) Cassandra

b) Riak

c) MongoDB

d) Redis

17.“Sharding” a database across many server instances can be achieved with _______________
a) LAN

b) SAN

c) MAN

d) All of the mentioned

18.Most NoSQL databases support automatic __________ meaning that you get high availability and
disaster recovery.
a) processing

b) scalability

c) replication

d) all of the mentioned

19.Which of the following are the simplest NoSQL databases?

a) Key-value

b) Wide-column

c) Document

d) All of the mentioned

20.________ stores are used to store information about networks, such as social connections.
a) Key-value

b) Wide-column

c) Document

d) Graph

21.NoSQL databases is used mainly for handling large volumes of ______________ data.
a) unstructured

b) structured

c) semi-structured

d) all of the mentioned

22.Which of the following language is MongoDB written in?

a) Javascript

b) C

c) C++

d) All of the mentioned

23.Point out the correct statement.

a) MongoDB is classified as a NoSQL database

b) MongoDB favors XML format more than JSON

c) MongoDB is column-oriented database store

d) All of the mentioned

24.Which of the following format is supported by MongoDB?

a) SQL

b) XML

c) BSON

d) All of the mentioned

25.NoSQL was designed with security in mind, so developers or security teams don't need to worry
about implementing a security layer. Is it true or false?
a) True

b) False

26.Which of the following is not a reason NoSQL has become a popular solution for some
organizations?
a) Better scalability

b) Improved ability to keep data consistent

c) Faster access to data than relational database management systems (RDBMS)

d) More easily allows for data to be held across multiple servers

27.NoSQL prohibits structured query language (SQL). Is it True or False?

a) True

b) False

28.When is it best to use a NoSQL database?

a) When providing confidentiality, integrity, and availability is crucial

b) When the data is predictable

c) When the retrieval of large quantities of data is needed

d) When the retrieval speed of data is not critical

29.Which of the following companies developed NoSQL database Apache Cassandra?

a) LinkedIn

b) Twitter
c) MySpace

d) Facebook

30.NoSQL databases are most often referred to as:

a) Relational

b) Distributed

c) Object-oriented

d) Network

31.SQL databases are:

(A) Horizontally scalable

(B) Vertically scalable

(C) Either horizontally or vertically scalable

(D) They don't scale

32.Which of the following is not an example of a NoSQL database?

(A) CouchDB

(B) MongoDB

(C) HBase

(D) PostgreSQL

33.Which of the following is a reason to use an SQL database?

(A) It can easily store unstructured data.

(B) It's ACID-compliant.

(C) It can enable development in the cloud.

(D) All of the above

34.Which of the following is a characteristic of a NoSQL database?

(A) Uses tables for storage

(B) Needs a schema

(C) Requires JOINs

(D) Uses JSON

35.Which of the following is a primary classification for NoSQL architectures?
(A) Document databases

(B) Graph databases

(C) Key-value databases

(D) All of the above

36.SQL command types include data manipulation language (DML) and data definition language
(DDL).
(A) True

(B) False

37.________ systems are scale-out file-based (HDD) systems moving to more uses of memory in the
nodes.
(A) NoSQL

(B) NewSQL

(C) SQL

(D) All of the mentioned

38.Point out the correct statement.

(A) Hadoop is ideal for the analytical, post-operational, data-warehouse-ish type of workload

(B) HDFS runs on a small cluster of commodity-class nodes

(C) NEWSQL is frequently the collection point for big data

(D) None of the mentioned

39.Which is an advantage of NewSQL ?

(A) Less complex applications, greater consistency.

(B) Convenient standard tooling.

(C) SQL influenced extensions.

(D) All of the mentioned

40.Point out the correct statement.

a) MongoDB is classified as a NoSQL database

b) MongoDB favors XML format more than JSON

c) MongoDB is column-oriented database store

d) All of the mentioned

41. NoSQL was designed with security in mind, so developers or security teams don't need to worry
about implementing a security layer. Is it true or false?

(A) True

(B) False

Answer’s :

1. A- SQL Serve
2. D- All of the mentioned
3. B- Document databases
4. A- Cassandra
5. A- Non Relational databases require that schemas be defined before you can add data
6. B- SAN
7. C- replication
8. A- Key-value
9. D- Graph
10. A- unstructured
11. B- Field
12. D- NoSQL is a new data format to store large datasets
13. B- Hbase
14. A- SQL Server
15. B- Document databases
16. A- Cassandra
17. B- SAN
18. C- replication
19. A- Key-value
20. D- Graph
21. A- unstructured
22. D- All of the mentioned
23. A- MongoDB is classified as a NoSQL database
24. C- BSON
25. B- False
26. B- Improved ability to keep data consistent
27. B- False
28. C- When the retrieval of large quantities of data is needed
29. D- Facebook
30. B- Distributed
31. B- Vertically scalable
32. D- PostgreSQL
33. B- It's ACID-compliant
34. D- Uses JSON
35. D- All of the above
36. A- True
37. A- NoSQL
38. A- Hadoop is ideal for the analytical, post-operational, data-warehouse-ish type of workload
39. D- All of the mentioned
40. A- MongoDB is classified as a NoSQL database
41. B-False

42. According to analysts, for what can traditional IT systems provide a foundation when they’re
integrated with big data technologies like Hadoop?

(A) Big data management and data mining

(B) Data warehousing and business intelligence

(C) Management of Hadoop clusters

(D) Collecting and storing unstructured data

Answer: A

43. What are the main components of Big Data?

(A) MapReduce

(B) HDFS

(C) YARN

(D) All of these

Answer:D

44. What are the different features of Big Data Analytics?

(A) Open-Source

(B) Scalability

(C) Data Recovery

(D) All the above

Answer:D

45. Which one of the following is false about Hadoop?

(A) It is a distributed framework

(B) The main algorithm used in it is Map Reduce

(C) It runs with commodity hardware

(D) All are true

Answer: D

46. What license is Apache Hadoop distributed under?

(A) Apache License 2.0

(B) Shareware

(C) Mozilla Public License

(D) Commercial

Answer:A

47. Which of the following platforms does Apache Hadoop run on ?

(A) Bare metal

(B) Unix-like

(C) Cross-platform

(D) Debian

Answer:C

48. Apache Hadoop achieves reliability by replicating the data across multiple hosts and hence does
not require ________ storage on hosts.

(A) Standard RAID levels

(B) RAID

(C) ZFS

(D) Operating system

Answer:B

49. Hadoop works in

(A) master-worker fashion

(B) master – slave fashion

(C) worker/slave fashion

(D) All of the mentioned

Answer:B

50. The input split used in MapReduce indicates

A - The average size of the data blocks used as input for the program

B - The location details of where the first whole record in a block begins and the last whole record in
the block ends.

C - Splitting the input data to a MapReduce program into a size already configured in the mapred-
site.xml

D - None of these

Answer: B

51.The inter process communication between different nodes in Hadoop uses

A - REST API

B - RPC
C - RMI

D - IP Exchange

Answer: B

52. In HDFS the files cannot be

A - read

B - deleted

C - executed

D - Archived

Answer: C

53.Which technology is used to store data in Hadoop?

A - HBase

B - Avro

C - Sqoop

D - Zookeeper

Answer: A
54. Point out the correct statement.

a) MapReduce tries to place the data and the compute as close as possible

b) Map Task in MapReduce is performed using the Mapper() function

c) Reduce Task in MapReduce is performed using the Map() function

d) All of the mentioned

Answer:A

55. ___________ part of the MapReduce is responsible for processing one or more chunks of data
and producing the output results.

a) Maptask

b) Mapper

c) Task execution

d) All of the mentioned

Answer:A

56.HDFS works in a __________ fashion.

a) master-worker

b) master-slave

c) worker/slave

d) all of the mentioned

Answer:A

57. Which of the following scenario may not be a good fit for HDFS?

a) HDFS is not suitable for scenarios requiring multiple/simultaneous writes to the same file

b) HDFS is suitable for storing data related to applications requiring low latency data access

c) HDFS is suitable for storing data related to applications requiring low latency data access

d) None of the mentioned

Answer:A

58.HDFS provides a command line interface called __________ used to interact with HDFS.

a) “HDFS Shell”
b) “FS Shell”

c) “DFS Shell”

d) None of the mentioned

Answer:B

59. HDFS is implemented in _____________ programming language.

a) C++

b) Java

c) Scala

d) None of the mentioned

Answer: B

60. Hadoop is a framework that works with a variety of related tools. Common cohorts include
____________
a) MapReduce, Hive and HBase
b) MapReduce, MySQL and Google Apps
c) MapReduce, Hummer and Iguana
d) MapReduce, Heron and Trumpet

Answer: A

61. What was Hadoop named after?

a) Creator Doug Cutting’s favorite circus act
b) Cutting’s high school rock band
c) The toy elephant of Cutting’s son
d) A sound Cutting’s laptop made during Hadoop development

Answer: C

62. All of the following accurately describe Hadoop, EXCEPT ____________

a) Open-source
b) Real-time
c) Java-based
d) Distributed computing approach

Answer: B
63. __________ command is used to interact and view Job Queue information in HDFS.
a) queue
b) priority
c) dist
d) all of the mentioned

Answer:A

64. Which of the following command runs the HDFS secondary namenode?
a) secondary namenode
b) secondary namenode
c) secondary namenode
d) none of the mentioned

Answer: B

65. Which of the following is used for the MapReduce job Tracker node?
a) mradmin
b) tasktracker
c) jobtracker
d) none of the mentioned

Answer: C

66. As compared to RDBMS, Apache Hadoop

(A) Has higher data Integrity

(B) Does ACID transactions

(C) Is suitable for read and write many times

(D) Works better on unstructured and semi-structured data.

Answer: D

67. Which of the following are Built-In Counters in Hadoop?

(A) FileSystem Counters

(B) FileInputFormat Counters

(C) FileOutputFormat counters

(D) All of the above

Answer: D

68. Which of the following is not an output format in Hadoop?

(A) TextoutputFormat

(B) ByteoutputFormat

(C) SequenceFileOutputFormat

(D) DBOutputFormat

Answer: B

69. The Hadoop MapReduce framework spawns one map task for each __________ generated by
the InputFormat for the job.

(A) OutputSplit

(B) InputSplit

(C) InputSplitStream

(D) All of the mentioned

Answer: B

70. ___________ part of the MapReduce is responsible for processing one or more chunks of data
and producing the output results.

(A) Maptask

(B) Mapper

(C) Task execution

(D) All of the mentioned

Answer: A
DBMS Chapter 1 MCQ(s)
1) An entity set without sufficient attributes to form a primary key is called
a) Acid entity set
b) Non-primary entity set
c) Weak entity set
d) Strong entity set

2) In the Hierarchical model records are organized in the form of a

a) Linked List
b) Data Tables
c) Tree
d) Graph

3) In an ER diagram attributes are represented using

a) Ellipse
b) Diamond
c) Rectangle
d) Dotted rectangle

4) What are the different types of relationships in RDBMS?

a) One to Many
b) One to One
c) One to Multiple
d) a & b

5) Which of the following are not the disadvantages of a file system to store data?
a) Data redundancy and inconsistency
b) Difficulty in accessing data
c) Data isolation is not present
d) High Cost

6) Which of the following is not a feature provided by DBMS?

a) Maintain accuracy of data
b) Performance analysis and logging
c) Ensure modifications are successful or not done at all
d) Recovery mechanism for data

7) A relational database consists of a collection of

a) Tables
b) Record
c) Fields
d) Attributes
8) The main function of a database is
a) To check all input data
b) To check all spelling
c) To collect and organize input data
d) To output data

9) DBMS provides the following feature:

a) Protect data from a system crash
b) Safety of the information stored
c) Authorized access
d) All of these

10) An advantage of the database management approach is

a) Data is dependent on programs
b) Data redundancy increases
c) Data is integrated and can be accessed by multiple programs
d) None of the above

11) An entity set that does not have sufficient attributes to form a primary key is termed a
a) Strong entity set
b) Variant set
c) Weak entity set
d) Variable set

12) For a weak entity set to be meaningful, it must be associated with another entity set, called
the
a) Identifying set
b) Owner set
c) Neighbour set
d) Strong entity set

13) In an Entity-Relationship Diagram, Rectangles represents

a) Entity
b) Attributes
c) Database
d) Tables

14) The Primary key must be

a) Non-Null
b) Unique
c) Either a or b
d) Both a and b
15) The attribute that can be divided into other attributes is called
a) Simple Attribute
b) Composite Attribute
c) Multi-valued Attribute
d) Derived Attribute

16) In an Entity-Relationship Diagram “Diamonds” represents

a) Attributes
b) Multi-valued attributes
c) Weak entity set
d) Relationship sets

17) An entity in A is associated with at most one entity in B, and an entity in B is associated with
at most one entity in A. This is called
a) One-to-many
b) One-to-one
c) Many-to-many
d) Many-to-one

18) An entity in A is associated with at most one entity in B. An entity in B, however, can be
associated with any number (zero or more) of entities in A.
a) One-to-many
b) One-to-one
c) Many-to-many
d) Many-to-one

19) Which one of the following is a set of one or more attributes taken collectively to uniquely
identify a record?
a) Candidate key
b) Subkey
c) Super key
d) Foreign key

20) Which of the following constraint does not enforce uniqueness?

a) UNIQUE
b) Primary key
c) Foreign key
d) None of the mentioned
21) Constraints can be applied to
a) Column
b) Table
c) Field
d) All of the mentioned

22) The purpose of foreign key constraint in SQL Server is

a) FOREIGN KEY constraints identify and enforce the relationships between tables
b) A foreign key in one table points to a candidate key in another table
c) You cannot insert a row with a foreign key value, except NULL, if there is no candidate key
with that value
d) None of the mentioned

23) The process of designating sub-groupings within the entity set is called as _______
a) Specialization
b) Division
c) Aggregation
d) Finalization

24) The similarities between the entity set can be expressed by which of the following features?
a) Specialization
b) Generalization
c) Uniquation
d) Inheritance

25) Which of the following language is used to specify database Schema?

a) Data Management Language
b) Data Manipulation Language
c) Data Definition Language
d) Data Development Language

26) What are the different view to present a Table ?

a. Datasheet View
b. Design View
c. Pivote TableView
d. All Of Above

27) In one-to-many relationship the table on 'many' side is called _______

a. Parent
b. Child
c. Sister
d. Master
28) In which state one gathers and list all the necessary fields for the database design project.
a. Data Definition
b. Data Refinement
c. Establishing Relationship
d. None Of The Above

29) Which of the following enables us to view data from a table based on a specific criterion
a. Form
b. Query
c. Macro
d. Report

30) In one-to-many relationship the table in 'one' side is called _______

a. Child
b. Owner
c. Parent
d. Sibling

31) It is used to establish an association between related tables.

a. Line
b. Relationship
c. Primary Key
d. Records

32) The third stage of designing a database is when we create___________ between tables
a.Relationship
b.Join
c.Query
d. None of the Above

33) Two tables can be linked with relationship to _____

a. Ensure data entry
b. Ensure data integrity
c. Create Primary Key
d. Ensure Foreign Key
34) Which one is the guideline of Referential integrity in a relationship?
a. Do not enter a value in the primary key field of the child table if that value does not exist in the
primary key of the parent table
b. Do not enter a value in the foreign key field of a parent table if that value doesn’t exist in the
primary key of the child table
c. Do not enter a value in the foreign key field of a child table if that value does not exist in the
primary key of the parent table
d. Do not enter a value in the foreign key field of the child table if that value does not exist in the
foreign key of the parent table

35) Which of the following is not a database model

a. Network Database Model
b. Relational Database Model
c. Object-Oriented Database Model
d. None of the Above

36) The overall description of a database is called______.

a. Data integrity
b. Data manipulation
c. Database schema
d. Data definition

37) The DBMS acts as an interface between what two components of an enterprise-class
database system?
a. Database application and the database
b. Data and the database
c. The user and the database application
d. Database application and SQL

38) The following are components of a database except ________.

a. User data
b. Metadata
c. Reports
d. Indexes

39) An application where only one user accesses the database at a given time is an example of
a ________.
a. Single-user database application
b. Multiuser database application
c. E-commerce database application
d. Data mining database application
40) An on-line commercial site such as Flipkart.com is an example of a ________.
a. Single-user database application
b. Multiuser database application
c. E-commerce database application
d. Data mining database application

41) Which of the following is not a level of data abstraction?

a. Physical Level
b. Critical Level
c. Logical Level
d. View Level

42) Which of the following is not a Schema?

a. Database Schema
b. Physical Schema
c. Critical Schema
d. Logical Schema

43) Which of the following is the structure of the Database?

a. Table
b. Schema
c. Relation
d. None of the Above

44) A logical description of some portion of database that is required by a user to perform task is
called as
a. System View
b. User View
c. Logical View
d. Data View

45) What is a classical approach to database design?

a. Left Right approach
b. Right Left approach
c. Top-Down approach
d. Bottom-Up approach

46) Which of the following is the oldest database model?

a. Relational
b. Hierarchical
c. Physical
d. Network
47) Which of the following indicates the maximum number of entities that can be involved in a
relationship?
a. Minimum cardinality
b. Maximum cardinality
c. ERD
d. Greater Entity Count

48) The view of total database content is

a. Conceptual view
b. Internal view
c. External view
d. Physical view

49) The architecture of the database can be viewed as

a. Two levels
b. Four levels
c. Three levels
d. One level

50) A logical schema

a. Is the entire database
b. Is a standard way of organizing information into accessible parts
c. Describes how data is actually stored on disk
d. Both a and c

51) Conceptual design

a. Is a documentation technique.
b. Needs data volume and processing frequencies to determine the size of the database.
c. Involves modeling independent of the DBMS.
d. Is designing the relational model.

52) The conceptual model is

a. Dependent on hardware
b. Dependent on software
c. Dependent on both hardware and software
d. Independent of both hardware and software

53) Which of the following is the record based, logical model?

a. Network Model
b. Object-oriented model
c. E-R Model
d. None of the Above
54) Entity Relationship model consists of collection of basic objects called _________ and
relationship among these objects.
a. Functions
b. Models
c. Entities
d. None of the Above

55) Association among several entities is called as _____________.

a. Extraction
b. Relationship
c. Combination
d. Association

56) ______________ express the number of entities to which another entity can be associated
via a relationship set.
a. Logical Cardinality
b. Mapping Cardinality
c. Messaging Cardinality
d. None of the Above

57) Collection of tables to represent both data and relationship is described by _____________.
a. Relational Model
b. Entity Relation Model
c. Network Model
d. Entity Model

58) The ability to modify the schema of a database at one level without affecting the schema
definition at a higher level is called as __________.
a. Data Independence
b. Data Isolation
c. Data Migration
d. Data Abstraction

59) There are _________ levels of data independence.

a. 2
b. 1
c. 4
d. 3

60) The first step in database development is which of the following?

a. Enterprise data modeling
b. Logical database design
c. Physical database design and definition
d. Database Implementation
61) Whose role is it to determine the requirements and design for a database?
a. Database analysts
b. Database administrators
c. Both A and B.
d. Neither A or B.

62) User views are included as part of which schema?

a. Internal
b. Conceptual
c. External
d. None of the above.

63) The Enterprise tier of the three-tiered database architecture includes:

a. Managing the data.
b. Managing the User-system interface.
c. Processing HTTP protocol.
d. Processing scripting tasks.

64) A Relation is an
a. A subset of a Cartesian product of a list of attributes
b. A subset of a Cartesian product of a list of domains
c. A Subset of a Cartesian product of a list of tuple
d. A subset of a Cartesian product of a list of relations

65) In mathematical terms Table is referred to as

a. Relation
b. Attribute
c. Tuple
d. Domain

66) In mathematical terms, Row is referred to as

a. Relation
b. Attribute
c. Tuple
d. Domain

67) Minimal Superkeys is called

a. Schema keys
b. Candidate keys
c. Domain keys
d. Attribute keys
68) Who proposed the relational model?
a. Bill Gates
b. E.F. Codd
c. Herman Hollerith
d. Charles Babbage

69) Data Manipulation Language (DML) is not to

a. Create information table in the Database
b. Insertion of new information into the Database
c. Deletion of information in the Database
d. Modification of information in the Database

70) Which of the following is true regarding Referential Integrity?

a. Every primary-key value must match a primary-key value in an associated table
b. Every primary-key value must match a foreign-key value in an associated table
c. Every foreign-key value must match a primary-key value in an associated table
d. Every foreign-key value must match a foreign-key value in an associated table

71) How many types of keys in Database Design?

a. Candidate key
b. Primary key
c. Foreign key
d. All of the Above

72) Row is synonymous with the term:

a. Record
b. Relation
c. Column
d. Field

73) Which of the following is a group of one or more attributes that uniquely identifies a row?
a. Key
b. Determinant
c. Tuple
d. Relation

74) A relation is considered a:

a. Column
b. One-dimensional table
c. Two-dimensional table
d. Three-dimensional table
75) In the relational model, relationships between relations or tables are created by using:
a. Composite keys
b. Determinants
c. Candidate keys
d. Foreign keys

76) The table is synonymous with the term:

a. Record
b. Relation
c. Column
d. Field

77) Which of the following is not a restriction for a table to be a relation?

a. The cells of the table must contain a single value.
b. All of the entries in any column must be of the same kind.
c. The columns must be ordered.
d. No two rows in a table may be identical.

78) A key:
a. Must always be composed of two or more columns.
b. Can only be one column.
c. Identifies a row.
d. Identifies a column.

79) A tuple is a:
a. Column of a table.
b. Two-dimensional table.
c. Row of a table.
d. Key of a table.

80) A foreign key is the one in which the ________ of one relation is referenced in another
relation.
a. Foreign key
b. Primary key
c. References
d. Check constraint

81) Domain constraints, functional dependency and referential integrity are special forms of
_________.
a. Foreign key
b. Primary key
c. Assertion
d. Referential constraint
82) Which one of the following uniquely identifies the elements in the relation?
a. Secondary Key
b. Primary key
c. Composite key
d. Foreign key

83) A _____ is a property of the entire relation, rather than of the individual tuples in which each
tuple is unique.
a. Rows
b. Key
c. Attribute
d. Fields

84) Which one of the following attributes can be taken as a primary key?
a. Name
b. Street
c. Id
d. Department

85) Which one of the following cannot be taken as a primary key ?

a. Id
b. Register number
c. Dept_id
d. Street

86) An attribute in a relation is a foreign key if the _______ key from one relation is used as an
attribute in that relation .
a. Candidate
b. Primary
c. Super
d. Sub

87) The relation with the attribute which is the primary key is referenced in another relation. The
relation which has the attribute as the primary key is called
a. Referential relation
b. Referencing relation
c. Referenced relation
d. Referred relation
88) The ______ is the one in which the primary key of one relation is used as a normal attribute
in another relation.
a. Referential relation
b. Referencing relation
c. Referenced relation
d. Referred relation

89) A _________ integrity constraint requires that the values appearing in specified attributes of
any tuple in the referencing relation also appear in specified attributes of at least one tuple in the
referenced relation.
a. Referential
b. Referencing
c. Specific
d. Primary

90) In a _____ a parent record type can be linked to one or more "child" record types, but a
child record type can have only one parent.
a. Network database
b. Relational database
c. Distributed database
d. Hierarchical database

91) Which of the following is true of a network structure?

a. It is a physical representation of the data
b. It allows a many-to-many relationship
c. It is conceptually simple
d. It will be the dominant database of the future

92) The model for a _____ resembles the hierarchical model in many respects.
a. Network database
b. Relational database
c. Distributed database
d. Hierarchical database

93) Goals for the design of the logical schema include

a. Avoiding data inconsistency
b. Being able to construct queries easily
c. Being able to access data efficiently
d. All of the Above
94) A foreign key is which of the following?
a. Any attribute
b. The same thing as a primary key
c. An attribute that serves as the primary key of another relation
d. None of the Above

95) Relations are:

a. Two-dimensional tables.
b. Three-dimensional tables.
c. Four-dimensional tables.
d. Five-dimensional tables.

96) A relation has which of the following properties?

a. Each row is not unique.
b. Attributes can have the same name within a given table.
c. Each relation has a unique name.
d. The order of the columns is significant.

97) When mapping a multivalued attribute into a relation which of the following is true?
a. One relation is created.
b. Two relations are created.
c. Three relations are created.
d. Four relations are created.

98) When mapping a regular entity into a relation which of the following is true?
a. One relation is created.
b. Two relations are created.
c. Three relations are created.
d. Four relations are created.

99) When mapping a binary many-to-many relationship into a relation which of the following is
true?
a. One relation is created.
b. Two relations are created.
c. Three relations are created.
d. Four relations are created.

100) When mapping a many-to-many unary relationship into a relation which of the following is
true?
a. One relation is created.
b. Two relations are created.*
c. Three relations are created.
d. Four relations are created.
101) Which of the following improves a query's processing time?
a. Write complex queries.
b. Combine a table with itself.
c. Query one query within another.
d. Use compatible data types.
DBMS Chapter 2 MCQ(s)
1) In DBMS the database schemas are written using
a) PPL
b) DML
c) DCL
d) DDL

2) In the architecture of a database system internal level is the view level.

a) True
b) False

3) The language that is used to perform different operations on relational databases is

a) PL/SQL
b) MySQL
c) SQL
d) MSSQL

4) Among the following which are DDL commands?

a) CREATE
b) UPDATE
c) DELETE
d) COMMIT

5) What type of join is equivalent to Cartesian Product in DBMS?

a) Full outer join
b) Cross join
c) Inner join
d) Natural Join

6) In SQL "Truncate" command

a) Deletes the whole database
b) Clears database schema
c) Clears all records present in the table
d) Makes a backup of existing data

7) In SQL you can provide the user the different privileges to a database using the following
command
a) Revoke
b) Allow
c) Grant
d) Assign
8) Following SET operation is not permitted in SQL
a) Union
b) Minus
c) Standard Deviation
d) Intersect

9) In SQL left (outer) join

a) Returns all records when there is a match in either left or the right table.
b) Returns records that have matching values in both tables.
c) Returns all records from the left table, and the matched records from the right table.
d) None of the above

10) PL/SQL is just another form of NoSQL?

a) True
b) False

11) The stored procedures in SQL allows you to use

a) Object-oriented features in SQL
b) Adds NoSQL functionality to existing SQL database
c) Group of statements in SQL
d) None of the above

12) You can join the SQL table to itself using

a) Atomic join
b) Full outer join
c) Full inner join
d) Self-join

13) Views in SQL provides a database with

a) Abstraction
b) Portability
c) Atomicity
d) Durability

14) SQL views can also be identified as

a) User view
b) Virtual tables
c) Design view
d) Front end layer
15) Which of the following is not an aggregate function?
a) Gross
b) Avg
c) Sum
d) Min

16) In SQL exact numeric data type is

a) Bigint
b) Int
c) Smallmoney
d) All of the mentioned

17) Which operator performs pattern matching

a) BETWEEN operator
b) LIKE operator
c) EXISTS operator
d) None of these

18) In SQL, out of the following which is not a data definition command?
a) RENAME
b) REVOKE
c) GRANT
d) UPDATE

19) The FROM clause in SQL statements can be used for

a) Specify what table we are selecting or deleting data FROM
b) Specify range for search condition
c) Specify search condition
d) None of these

20) Out of the following which keyword will return only unique values
a) Distinctive
b) Unique
c) Distinct
d) Different

21) Which of the following statements can be used to terminate a PL/SQL loop?
a) Goto
b) Exit When
c) Continue When
d) Kill
22) Which statements execute a sequence of statements multiple times?
a) LOOP statement
b) NULL statement
c) MERGE statement
d) None of the above

23) A _______________ is a special kind of a store procedure that executes in response to

certain action on the table like insertion, deletion, or updating of data.
a) Procedures
b) Triggers
c) Functions
d) None of the mentioned

24) What are the after triggers?

a) Triggers generated after a particular operation
b) These triggers run after an insert, update or delete on a table
c) These triggers run after an insert, views, update or delete on a table
d) All of the mentioned

25) Subprograms let you extend the PL/SQL language. Which subprogram acts like new
expressions and operators?
a) Procedures
b) Functions
c) Both A & B
d) None of the above

26) Which data type allows alphanumeric characters and special symbols to be entered?
a. Text
b. Memo
c. Auto number
d. Mixed

27) SQL stands for ________.

a. Structured Query Language
b. Sequential Query Language
c. Structured Question Language
d. Sequential Question Language

28) The SQL database language includes statements for:

a. Database definition.
b. Database manipulation.
c. Database control.
d. All of the Above.
29) A command to remove a relation from an SQL database
a. Delete table table name
b. Drop table table name
c. Erase table table name
d. Alter table table name

30) Which SQL Query is use to remove a table and all its data from the database?
a. Create Table
b. Alter Table
c. Drop Table
d. None of these

31) A type of query that is placed within a WHERE or HAVING clause of another query is called
a. Super query
b. Sub query
c. Master query
d. Multi-query

32) Aggregate functions are functions that take a ___________ as input and return a single
value.
a. Collection of values
b. Single value
c. Aggregate value
d. Both a & b

33) The ____ connective tests for set membership, where the set is a collection of values
produced by a select clause. The ____ connective tests for the absence of set membership.
a. Or, in
b. Not in, in
c. In, not in
d. In, or

34) Dates must be specified in the format

a. mm/dd/yy
b. yyyy/mm/dd
c. dd/mm/yy
d. yy/dd/mm
35) An ________ on an attribute of a relation is a data structure that allows the database
system to find those tuples in the relation that have a specified value for that attribute efficiently,
without scanning through all the tuples of the relation.
a. Index
b. Reference
c. Assertion
d. Timestamp

36) Which of the following is used to store movie and image files ?
a. Clob
b. Blob
c. Dlob
d. None of the above

37) Which of the join operations do not preserve non matched tuples.
a. Left outer join
b. Right outer join
c. Inner join
d. None of the above

38) What type of join is needed when you wish to include rows that do not have matching
values?
a. Equi-join
b. Natural join
c. Outer join
d. All of the mentioned

39) How many join types in join condition:

a. 2
b. 3
c. 4
d. 5

40) Which join refers to join records from the right table that have no matching key in the left
table are include in the result set:
a. Left outer join
b. Right outer join
c. Full outer join
d. Half outer join
41) Which join condition contains an equality operator:
a. Equijoins
b. Cartesian
c. Natural
d. Left

42) A __________ is a special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.
a. Procedures
b. Triggers
c. Functions
d. None of the mentioned

43) The CREATE TRIGGER statement is used to create the trigger. The _____ clause specifies
the table name on which the trigger is to be attached. The ______ specifies that this is an
AFTER INSERT trigger.
a. For insert, on
b. On, for insert
c. For, insert
d. Both a and c

44) What are the after triggers ?

a. Triggers generated after a particular operation
b. These triggers run after an insert, update or delete on a table
c. These triggers run after an insert, views, update or delete on a table
d. Both b and c

45) The variables in the triggers are declared using

a. -
b. @
c. /
d. /@

46) Which one of the following sorts rows in SQL?

a. SORTBY
b. ALIGNBY
c. ORDERBY
d. GROUPBY

47) The SQL statement that queries or reads data from a table is
a. QUERY
b. READ
c. SELECT
d. QUERY
48) Which of the following statements is true about implicit cursors?
a. Implicit cursors are used for SQL statements that are not named.
b. Developers should use implicit cursors with great care.
c. Implicit cursors are used in cursor for loops to handle data processing.
d. Implicit cursors are no longer a feature in Oracle.

49) Which of the following is not a feature of a cursor "for" loop?

a. Record type declaration.
b. Opening and parsing of SQL statements.
c. Fetches records from cursor.
d. Requires exit condition to be defined.

50) Which three of the following are implicit cursor attributes?

c. %found
b. %too_many_rows
c. %notfound
d. %rowcount

51) What happens when rows are found using a FETCH statement
a. It causes the cursor to close
b. It causes the cursor to open
c. It loads the current row values into variables
d. It creates the variables to hold the current row values

52) A nested subprogram can be called from the main procedure or from the calling
environment. True or False?
a. True
b. False

53) The SQL WHERE clause:

a. limits the column data that are returned.
b. limits the row data are returned.
c. Both A and B are correct.
d. Neither A nor B are correct.

54) Which of the following is the original purpose of SQL?

a. To specify the syntax and semantics of SQL data definition language
b. To specify the syntax and semantics of SQL manipulation language
c. To define the data structures
d. All of the above.
55) The wildcard in a WHERE clause is useful when?
a. An exact match is necessary in a SELECT statement.
B. An exact match is not possible in a SELECT statement.
C. An exact match is necessary in a CREATE statement.
D. An exact match is not possible in a CREATE statement.

56) A view is which of the following?

a. A virtual table that can be accessed via SQL commands
b. A virtual table that cannot be accessed via SQL commands
c. A base table that can be accessed via SQL commands
d. A base table that cannot be accessed via SQL commands

57) ON UPDATE CASCADE ensures which of the following?

a. Normalization
b. Data Integrity
c. Materialized Views
d. All of the above.

58) Which of the following is valid SQL for an Index?

a. CREATE INDEX ID;
b. CHANGE INDEX ID;
c. ADD INDEX ID;
d. REMOVE INDEX ID;

59) Which of the following is the correct order of keywords for SQL SELECT statements?
a. SELECT, FROM, WHERE
b. FROM, WHERE, SELECT
c. WHERE, FROM, SELECT
d. SELECT, WHERE, FROM

60) A subquery in an SQL SELECT statement is enclosed in:

A. Braces -- {...}
B. CAPITAL LETTERS
C. Parenthesis -- (...)
D. Brackets -- [...]

61) Which of the following are the five built-in functions provided by SQL?
a. COUNT, SUM, AVG, MAX, MIN
b. SUM, AVG, MIN, MAX, MULT
c. SUM, AVG, MULT, DIV, MIN
d. SUM, AVG, MIN, MAX, NAME
62) The HAVING clause does which of the following?
a. Acts like a WHERE clause but is used for groups rather than rows.
b. Acts like a WHERE clause but is used for rows rather than columns.
c. Acts like a WHERE clause but is used for columns rather than groups.
d. Acts EXACTLY like a WHERE clause.

63) To remove duplicate rows from the results of an SQL SELECT statement, the ________
qualifier specified must be included.
a. ONLY
b. UNIQUE
c. DISTINCT
d. SINGLE

64) Which of the following do you need to consider when you make a table in SQL?
a. Data types
b. Primary keys
c. Default values
d. All of the above.

65) When three or more AND and OR conditions are combined, it is easier to use the SQL
keyword(s):
a. LIKE only.
b. IN only.
c. NOT IN only.
d. Both IN and NOT IN.

66) Which one of the following sorts rows in SQL?

a. SORT BY
b. ALIGN BY
c. ORDER BY
d. GROUP BY

67) To sort the results of a query use:

a. SORT BY.
b. GROUP BY.
c. ORDER BY.
d. None of the above is correct.
68) To define what columns should be displayed in an SQL SELECT statement:
a. Use FROM to name the source table(s) and list the columns to be shown after SELECT.
b. Use USING to name the source table(s) and list the columns to be shown after SELECT.
c. Use SELECT to name the source table(s) and list the columns to be shown after USING.
d. Use USING to name the source table(s) and list the columns to be shown after WHERE.

69) The SQL keyword BETWEEN is used:

a. For ranges.
b. To limit the columns displayed.
c. As a wildcard.
d. None of the Above.

70) A subquery in an SQL SELECT statement:

a. Can only be used with two tables.
b. Can always be duplicated by a join.
c. Has a distinct form that cannot be duplicated by a join.
d. Cannot have its results sorted using ORDER BY.

71) ________ was adopted as a national standard by ANSI in 1992.

a. Oracle
b. SQL
c. Microsoft Access
d. DBase

72) SQL is:

a. A programming language.
b. An operating system.
c. A data sublanguage.
d. A DBMS.

73) What type of join is needed when you wish to include rows that do not have matching
values?
a. Equi-join
b. Natural join
c. Outer join
d. All of the above.
74) What type of join is needed when you wish to return rows that do have matching values?
a. Equi-join
b. Natural join
c. Outer join
d. All of the above.

75) Which of the following is true concerning a procedure?

a. You do not create them with SQL.
b. They do not need to have a unique name.
c. They include procedural and SQL statements.
d. They are the same thing as a function.

76) Which of the following statements is true concerning routines and triggers?
a. Both consist of procedural code.
b. Both have to be called to operate.
c. Both run automatically.
d. Both are stored in the database.

77) Which of the following is one of the basic approaches for joining tables?
a. Subqueries
b. Union Join
c. Natural join
d. All of the above

78) Embedded SQL is which of the following?

a. Hard-coded SQL statements in a program language such as Java.
b. The process of making an application capable of generating specific SQL code on the fly.
c. Hard-coded SQL statements in a procedure.
d. Hard-coded SQL statements in a trigger.

79) A UNION query is which of the following?

a. Combines the output from no more than two queries and must include the same number of
columns.
b. Combines the output from no more than two queries and does not include the same number
of columns.
c. Combines the output from multiple queries and must include the same number of columns.
d. Combines the output from multiple queries and does not include the same number of
columns.
80) Which of the following statements is true concerning subqueries?
a. Involves the use of an inner and outer query.
b. Cannot return the same result as a query that is not a subquery.
c. Does not start with the word SELECT.
d. All of the above.

81) How many tables may be included with a join?

a. One
b. Two
c. Three
d. All of the above.

82) Which of the following is a correlated subquery?

a. Uses the result of an inner query to determine the processing of an outer query.
b. Uses the result of an outer query to determine the processing of an inner query.
c. Uses the result of an inner query to determine the processing of an inner query.
d. Uses the result of an outer query to determine the processing of an outer query.

83) Which of the following is true concerning triggers?

a. You do not create them with SQL.
b. They execute against only some applications that access a database.
c. They have an event, condition, and action.
d. They cannot cascade (cause another trigger to fire).

84) Which of the following functions can be used on both numeric as well as non-numeric data?
a. COUNT
b. AVG
c. Stddev
d. Variance

85) Which of the following is not true about the COUNT function?
a. COUNT() returns the number of rows in the table.
b. COUNT(exp) returns the number of rows with non-null values for the exp.
c. COUNT(DISTINCT exp) returns the number of unique, non-null values in the column.
d. All of the Above.

86) In which of the following cases a DML statement is not executed?

a. When existing rows are modified
b. When some rows are deleted
c. When a table is deleted
d. All of the Above
87) Which of the following code will remove all the rows from the table LOCATIONS?
a. DROP TABLE locations;
b. DELETE TABLE locations;
c. TRUNCATE TABLE locations;
d. None of the above.

88) Which of the following is a system privilege?

a. Creating new users
b. Removing users
c. Removing tables
d. All of the Above

89) Which of the following SQL clauses is used to DELETE tuples from a database table?
a. Delete
b. Remove
c. Drop
d. Clear

90) Which of the following is not a DDL command?

a. Update
b. Truncate
c. Alter
d. None of the Above

91) Which of the following are TCL commands?

a. UPDATE and TRUNCATE
b. SELECT and INSERT
c. GRANT and REVOKE
d. ROLLBACK and SAVEPOINT

92) __________is not a category of SQL command.

a. TCL
b. SCL
c. DCL
d. DDL

93) If you don’t specify ASC or DESC after a SQL ORDER BY clause, the following is used by
default____
a. ASC
b. DESC
c. There is no default value
d. None of the Above
94) Which of the following statement is true?
a. DELETE does not free the space containing the table and TRUNCATE free the space
containing the table
b. Both DELETE and TRUNCATE free the space containing the table
c. Both DELETE and TRUNCATE does not free the space containing the table
d. DELETE free the space containing the table and TRUNCATE does not free the space
containing the table

95) DCL provides commands to perform actions like

a. Change the structure of Tables
b. Insert, Update or Delete Records and Values
c. Authorizing Access and other control over Database
d. None of the Above

96) The COUNT function in SQL returns the number of _____

a. Values
b. Distinct values
c. Group By
d. Columns

97) Which data type can store unstructured data in a column?

a. RAW
b. CHAR
c. NUMERIC
d. VARCHAR

98) A SQL query will not work if there are no indexes on the relations - Is it true?
a. No
b. Yes

99) Which of the following command makes the updates performed by the transaction
permanent in the database?
a. ROLLBACK
b. COMMIT
c. TRUNCATE
d. DELETE
100) Which data manipulation command is used to combines the records from one or more
tables?
a. SELECT
b. PROJECT
c. JOIN
d. PRODUCT
Unit II: SQL & PL/SQL

1. PL/SQL is a completely portable, ________________transaction processing language.

a) Low-performance
b) High-performance
c) Both 1 & 2
d) None of the above

2. The SQL statement that reads or queries data from a table is __________.
a) SelectAll
b) Show
c) UpdateOne
d) None of the above

3. Which of the following are SQL data types

a) Binary
b) Numeric
c) String
d) All of the above

4. _______________ is a procedural extension of Oracle – SQL that offers language constructs

similar to those in imperative programming languages.
a) SQL
b) PL/SQL
c) Advanced SQL
d) PQL

5. ___________ combines the data manipulating power of SQL with the data processing power
of Procedural languages.
a) PL/SQL
b) SQL
c) Advanced SQL
d) PQL

6. _______________ has made PL/SQL code run faster without requiring any additional work
on the part of the programmer.
a) SQL Server
b) My SQL
c) Oracle
d) SQL Lite

7. If no header is specified, the block is said to be an _______________ PL/SQL block.

a) Strong
b) Weak
c) Empty
d) Anonymous

8. Out of the following which is SQL DDL commands:

a) Create
b) Drop
c) Both a & b
d) None of the above
9. Out of the following which is SQL DML commands:
a) Create
b) Drop
c) Both a & b
d) None of the above

10. Out of the following which is SQL TCL commands:

a) Commit
b) Rollback
c) Revoke
d) Both a & b

11. What does TCL stand for:

a) Transaction Control Language
b) Ternary Control Language
c) Temporary Computer Language
d) None of the above

12. What aggregation functions are supported by MySQL?

a) AVG
b) MAX
c) Count
d) All of the above

13. Enlist the set operations in SQL.

a) Union
b) Union All
c) Both a & b
d) None of the above

14. What is the correct syntax for UNION operation?

a) SELECT * FROM First UNION SELECT * FROM Second;
b) SELECT * FROM First SELECT UNION * FROM Second;
c) SELECT * FROM First SELECT UNION * FROM Second GROUP BY;
d) SELECT * FROM First SELECT UNION * FROM Second ORDER BY;
15. Enlist the types of Joins:
a) Inner Join
b) Outer Join
c) Full Join
d) All of the above

16. PL/SQL stands for

a) Procedural Language / Structured Query Language
b) Programming Language / Structured Query Language
c) Postgres Learner / Structured Query Language
d) Predefined Language / Structured Query Language

Unit III: Relational Database Design

1. A ________ in a table represents a relationship among a set of values.
a) Column
b) Key
c) Row
d) Entry

2. The term _______ is used to refer to a row.

a) Attribute
b) Tuple
c) Field
d) Instance

3. Database __________ which is the logical design of the database, and the database
_______ which is a snapshot of the data in the database at a given instant in time.
a) Instance, Schema
b) Relation, Schema
c) Relation, Domain
d) Schema, Instance

4. If a multivalued dependency holds and is not implied by the corresponding functional

dependency, it usually arises from one of the following sources.
a) A many-to-many relationship set
b) A multivalued attribute of an entity set
c) A one-to-many relationship set
d) Both A many-to-many relationship set and A multivalued attribute of an entity set

5. In the __________ normal form, a composite attribute is converted to individual attributes.

a) First
b) Second
c) Third
d) Fourth

6. Tables in second normal form (2NF):

a) Eliminate all hidden dependencies
b) Eliminate the possibility of an insertion anomalies
c) Have a composite key
d) Have all non-key fields depend on the whole primary key

7. Functional Dependencies are the types of constraints that are based on______
a) Key
b) Key revisited
c) Superset key
d) None of the mentioned

8. Which is a bottom-up approach to database design that design by examining the relationship
between attributes:
a) Functional dependency
b) Database modeling
c) Normalization
d) Decomposition

9. Which forms are based on the concept of functional dependency:

a) 1NF
b) 2NF
c) 3NF
d) 4NF

10. A domain is ______ if elements of the domain are considered to be indivisible units.
a) Atomic
b) Subatomic
c) Substructure
d) Subset

11. If a relation is in BCNF, then it is also in

a) 1 NF
b) 2 NF
c) 3 NF
d) All of the mentioned

12. If every non-key attribute is the functionally dependent primary key, then the relationship will
be in
a) First normal form
b) Second normal form
c) Third form
d) Fourth normal form
13. If an attribute of a composite key is dependent on an attribute of the other composite key, a
normalization called _____ is needed.
a) Functionally Dependent
b) BCNF
c) Fourth
d) Third

14. A dependency exists between two columns when

a) Together they constitute a composite key for the table
b) Knowing the value in one column determines the value stored in another column
c) The table is in 3NF
d) Together they constitute a foreign key

15. The data that has a time interval associated with them during which they are valid is called
________
a) Timed data
b) Temporal data
c) Model data
d) Clocked data
Seat No -
Total number of questions : 60

PWD10885_DATABASE MANAGEMENT SYSTEMS

Time : 1hr
Max Marks : 50
N.B

1) All questions are Multiple Choice Questions having single correct option.

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

7) Use only black/blue ball point pen to darken the appropriate circle.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 1. A homogeneous distributed database is which of the following?

A : The same DBMS is used at each location and data are not distributed across all
nodes.

B : The same DBMS is used at each location and data are distributed across all nodes.

C : A different DBMS is used at each location and data are not distributed across all
nodes

D : A different DBMS is used at each location and data are distributed across all nodes.

Q.no 2. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential
D : key

Q.no 3. To delete a particular column in a relation the command used is:

A : UPDATE TABLE

B : TRUNCATE COLUMN

C : ALTER , DROP

D : DELETE COLUMN

Q.no 4. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 5. Some of the columns of a relation are at different sites is which of the
following?

A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 6. Which of the following is not the DDL statements

A : Create

B : Drop

C : Alter

D : select

Q.no 7. The core principal of NOSQL is

A : High availability

B : High concurrency

C : High Consistency
D : High Atomicity

Q.no 8. The concept in normalization of relations which is based on the full

functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 9. If a transaction obtains an exclusive lock on a row, it means that the

transaction wants to

A : select

B : update

C : view

D : read

Q.no 10. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 11. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 12. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database
B : Parallel database

C : Client server database

D : standalone systems

Q.no 13. Which statement in SQL allows us to change the definition of a table is

A : ALTER

B : UPDATE

C : CREATE

D : SELECT

Q.no 14. . Each modification done in database transaction are first recorded into
the

A : Hard drive

B : disk

C : Log

D : Datamart

Q.no 15. A distributed database has which of the following advantages over a
centralized database?

A : Software cost

B : Software complexity

C : Slow Response

D : Modular growth

Q.no 16. Which of the following is not a valid NoSQL database?

A : cassandra

B : mongoDB

C : Postgresql

D : Hbase

Q.no 17. Which command allows the removal of all rows from a table but flushes
a table more efficiently since no rollback information is retained:
A : TRUNCATE command

B : Create command

C : Drop table command

D : Alter table command

Q.no 18. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 19. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 20. If the attribute of relation schema R is member of some candidate key
then this type of attributes are classified as

A : atomic attribute

B : candidate attribute

C : nonprime attribute

D : prime attribute

Q.no 21. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive
Q.no 22. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority

C : disc

D : diq

Q.no 23. Which of the following is a disadvantage of replication?

A : Reduced network traffic

B : If the database fails at one site, a copy can be located at another site.

C : Each site must have the same storage capacity.

D : Each transaction may proceed without coordination across the network.

Q.no 24. NoSQL databases is used mainly for handling large volumes of

A : unstructured

B : structured

C : Tabular

D : relational

Q.no 25. The Mapper implementation processes one line at a time via which
method.

A : map

B : reduce

C : mapper

D : reducer

Q.no 26. All tuples in the relation are assigned null as the value for the new
attribute, in the

A : Alter Command

B : Select Command

C : Delete Command
D : Create Command

Q.no 27. Maintaining a log for recovery purposes is a responsiblility of

A : Transaction coordinator

B : Transaction manager

C : system manager

D : Database Administrator

Q.no 28. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 29. which is the process of selecting the most efficient query-evaluation plan
from among the many strategies usually possible for processing a given query,
especially if the query is complex.

A : Permormance tuning

B : Parsing

C : Query optimization

D : compilation

Q.no 30. Which of the following is TRUE?

A : Every relation in 3NF is also in BCNF

B : A relation R is in 3NF if every non-prime attribute of R is fully functionally

dependent on every key of R

C : Every relation in BCNF is also in 3NF

D : No relation can be in both BCNF and 3NF

Q.no 31. Point out the wrong statement

A : Secondary indices is not available in MongoDB

B : MongoDB supports search by field, range queries, regular expression searches

C : MongoDB can store the business subject in the minimal number of documents

D : MongoDB cannot store images

Q.no 32. A command to remove a relation from an SQL database

A : Delete table

B : Drop table

C : . Erase table

D : Alter table

Q.no 33. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond

Q.no 34. Aggregate functions takes a collection of values as input and returns how
many values as output

A:1

B:2

C : more than 1

D:0

Q.no 35. provide a way for your program to select multiple rows of data from the
database and then process each row individually.

A : cursors

B : Triggers

C : process

D : select

Q.no 36. The virtual table that its created by data from the result of an SQL Select
statement is called

A : View
B : Synonym

C : Sequence

D : Transaction

Q.no 37. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 38. The technique that controls the interaction between more than one
executing transactions is known as

A : Multitasking technique

B : Serialization technique

C : Schedule technique

D : Concurrency control technique

Q.no 39. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 40. The data that have assosiated time interval during which they are valid
is called

A : Temporal Data

B : Dynamic data

C : Snap Shot data

D : Static Data

Q.no 41. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.
A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 42. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 43. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 44. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 45. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One
C : Many to One

D : Many to Many

Q.no 46. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 47. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 48. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 49. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 50. Read one, write all available protocol is used to increase
A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 51. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 52. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 53. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 54. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 55. Get(key)
Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 56. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 57. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 58. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 59. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key
B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 60. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 1. A relation is said to be in BCNF when

A : it has overlapping composite keys

B : it has no composite keys

C : it has no multivalued dependencies

D : it has no overlapping composite keys which have related attributes

Q.no 2. Which of the following is used for the MapReduce job Tracker node?

A : mradmin

B : tasktracker

C : jobtracker

D : node tracker

Q.no 3. How many rules in “CODD’S RULES” of Relational Model of database

systems?

A : 11

B : 12

C : 13

D : 14
Q.no 4. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 5. CAP stands for

A : Consistency, Availability and Partition Tolerance

B : Consistency,atomicity, Partition Tolerance

C : concurrency, Availability and Partition Tolerance

D : concurrency, Atomicity and Partition Tolerance

Q.no 6. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 7. A collection and document in mongoDB is equivlent to which concept

respectively.

A : Table and column

B : Table and row

C : column and row

D : database and table

Q.no 8. The Overall design of the database is called

A : Schema

B : Instance

C : table

D : relation
Q.no 9. A transaction may not always complete its execution successfully. Such a
transaction is termed

A : Aborted

B : Terminated

C : Closed

D : partial

Q.no 10. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 11. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 12. The highest level of abstraction that describes only part of the entire
database

A : View Level

B : Physical Level

C : Logical Level

D : Conceptal Level

Q.no 13. which is a specific concurrency problem wherein two transactions

depend on each other for something.

A : phantom read problem

B : transaction read problem

C : deadlock
D : locking

Q.no 14. which of these makes the updates performed by the transaction become
permanent in the database

A : Roll back

B : commit

C : End

D : save

Q.no 15. The set of entities of the same type share the same

A : Properties

B : value

C : instance

D : record

Q.no 16. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 17. Which property of a transaction that protect data from system failure

A : Isolation

B : Durability

C : Atomicity

D : serializability

Q.no 18. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent
C : isolated

D : durable

Q.no 19. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.

C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 20. Which of the following is not valid for NoSQL?

A : High performance

B : cross platform

C : Less scalable

D : Document Oriented

Q.no 21. Which of the following is not one of the stages in the evolution of
distributed DBMS?

A : Unit of work

B : Remote unit of work

C : Distributed unit of Work

D : Distributed request

Q.no 22. In two-tier client ⁄ server architecture, the running of application

programs and the user interface programs is in control of

A : modulation side

B : client side

C : server side

D : host side
Q.no 23. Which of the following parallel database architectures is/are mainly used
by distributed database system?

A : Shared Memory

B : Shared Disk

C : Hierarchical

D : Shared Nothing

Q.no 24. Maximum virtual memory of the launched child-task is specified using

A : mapv

B : mapred

C : mapvim

D : mapr

Q.no 25. If a transaction has obtained a which of these lock, so that it can read but
cannot write on the item.

A : Shared

B : Exclusive

C : Implicit

D : Explicit

Q.no 26. An entity belong to no more than one lower level entity set

A : Disjoint

B : Overlapping

C : Complete

D : Partial

Q.no 27. If a transaction can be granted a lock on an item immediately in spite of

the presence of another type of lock, then the two locks are said to be

A : Concurrent

B : Conflict

C : Equivalent
D : Compatible

Q.no 28. Some highe level entities may not belong to any lower level entity set

A : Partial

B : Complete

C : Overlapping

D : Disjoint

Q.no 29. All of the following accurately describe Hadoop, EXCEPT:

A : Open source

B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 30. The property which says that No transaction will affect the existence of
any other transaction.

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 31. Which one of the following is a set of one or more attributes taken
collectively to uniquely identify a record?

A : entity

B : sub key

C : super key

D : foreign key

Q.no 32. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 33. View used used for displaying current status of database is

A : system.databases

B : current.databases

C : sys.databases

D : status.databases

Q.no 34. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 35. The layer, which provides the interface between the business-logic layer
and the underlying database.

A : Business logic

B : Presentation

C : User interaction

D : Data access

Q.no 36. What do you mean by one to many relationship between Teacher and
Class table?

A : One class may have many teachers

B : One teacher can have many classes

C : Many classes may have many teachers

D : Many teachers may have many classes

Q.no 37. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 38. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 39. Supporting interquery parallelism is more complicated in

A : Shared Memory

B : shared disk

C : shared nothing

D : shared disk and shared nothing

Q.no 40. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema

C : NewSQL databases are built to allow the insertion of data without a predefined
schema

D : Vo SQL can hundle unstructured data

Q.no 41. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism
Q.no 42. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 43. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 44. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many

B : One to One

C : Many to One

D : Many to many

Q.no 45. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 46. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 47. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 48. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 49. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 50. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 51. if queries are issued at one or more nodes.a distributed transaction can
be
A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 52. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 53. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 54. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 55. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 56. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 57. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 58. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 59. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 60. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers
C : Functions

D : None of the mentioned

Q.no 1. Which SQL command is used to insert a row in a table?

A : Select

B : Create

C : Insert

D : Drop

Q.no 2. The lowest level of abstraction that describes how the data are actually
stored is

A : Physical Level

B : Logical Level

C : View Level

D : user Level

Q.no 3. To delete a particular column in a relation the command used is:

A : UPDATE TABLE

B : TRUNCATE COLUMN

C : ALTER , DROP

D : DELETE COLUMN

Q.no 4. A relation is said to be in 1NF if

A : there is no duplication of data

B : there are no composite attributes in the relation

C : there are only a few composite attributes

D : all attributes are of uniform type

Q.no 5. What is the full form of DDL

A : Dynamic Data Language

B : Detailed Data Language

C : Data Definition Language

D : Data Derivation Language

Q.no 6. Minimal Superkeys are called

A : Schema keys

B : Candidate keys

C : Domain keys

D : Attribute keys

Q.no 7. A relationship may also have attributes called

A : Descriptive Attribute

B : Derived Attribute

C : Relational Attribute

D : domain attribute

Q.no 8. What are the issues motivating parallelism?

A : Increased availability

B : Distributed access to data

C : Analysis of distributed data

D : All of the above

Q.no 9. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla

Q.no 10. Which normal form is considered adequate for normal relational
database design?

A : 2NF

B : 3NF
C : 4NF

D : BCNF

Q.no 11. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 12. An Entity set which do not have sufficient attributes to form a primary
key is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 13. Following represent coloumn in No SQL

A : Document

B : Collection

C : Database

D : Field

Q.no 14. Which of the following partitions the key space?

A : Partitioner

B : Compactor

C : Collector

D : collect

Q.no 15. How many versions of two phase locking protocol available

A:1
B:2

C:3

D:4

Q.no 16. The collection of information stored in the database at a particular

moment is called

A : Instance

B : Schema

C : table

D : relation

Q.no 17. Which of the following is not an out of the box feature of NoSQL?

A : Big Data

B : Availability

C : Flexibility

D : Elastic Scaling

Q.no 18. The number of Entities associated with the relationship determine the

A : Cardinality of a relationship

B : Dependency of a relationship

C : Degree of a relationship

D : Participation of a relationship

Q.no 19. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger

D : Cursor

Q.no 20. Which ensures that the database remains in a consistent state despites
system failures
A : Transaction Management

B : Query Processor

C : Storage Manager

D : Buffer Manager

Q.no 21. “Sharding” a database across many server instances can be achieved
with

A : LAN

B : SAN

C : MAN

D : NAN

Q.no 22. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 23. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector

C : InputCollector

D : output

Q.no 24. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager
D : Transaction Manager

Q.no 25. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 26. which one of these may result in inconsistent data

A : Concurrent Access

B : Serial Access

C : Locking

D : constraints

Q.no 27. Given the basic ER and relational models, which of the following is
INCORRECT?

A : An attribute of an entity can have more than one value

B : An attribute of an entity can be composite

C : In a row of a relational table an attribute can have more than one value

D : In a row of a relational table, an attribute can have exactly one value or a NULL
value

Q.no 28. Which of the following command removes database including its related
components?

A : Drop

B : Delete

C : remove

D : Truncate

Q.no 29. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity
B : Relationship

C : Record

D : Super Key

Q.no 30. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 31. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 32. which one of these database user interact with the system without
writing programs,instead they form the request in database query language

A : Sophisticated user

B : Specialized User

C : Application Progrmer

D : Naive User

Q.no 33. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator

D : IS NULL operator

Q.no 34. In SQL, which of these can be test for the absence of set membership
A : in

B : not in

C : yes

D : like

Q.no 35. The real use of the Two-phase commit protocol is

A : Deadlock will not occur

B : Concurrency control can be avoided

C : Atomicity, i.e, all-or-nothing commits at all sites

D : serializability

Q.no 36. The execution sequences in concurrency control is known as

A : Serializability

B : Schedules

C : Organizations

D : Timetable

Q.no 37. which executes the Mapper/ Reducer task as a child process in a separate
jvm.

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : job tasker

Q.no 38. Which statement about triggers is true

A : You use an application trigger to fire when a DELETE statement occurs.

B : You use a database trigger to fire when an INSERT statement occurs.

C : You use a system event trigger to fire when an UPDATE statement occurs.

D : You use INSTEAD OF trigger to fire when a SELECT statement occurs.

Q.no 39. In E-R Diagram derived attribute are represented by

A : Ellipse

B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 40. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond

Q.no 41. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 42. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 43. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3
C:4

D:5

Q.no 44. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 45. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 46. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 47. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 48. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS
B : CMS

C : File system

D : None of the mentioned

Q.no 49. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 50. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 51. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 52. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 53. which serves as the master and there is only one NameNode per cluster.
A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 54. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 55. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer

Q.no 56. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 57. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment
C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 58. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 59. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 60. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 1. Three-tier architecture includes which of the following?

A : Three server layers

B : A client layer and two server layers

C : Two client layers and one server layer

D : Three client layers

Q.no 2. Which one of these are used to express relationship among relationship

A : Aggregation

B : Generalization

C : Specialization

D : Abstraction

Q.no 3. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 4. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 5. A transaction may not always complete its execution successfully. Such a
transaction is termed

A : Aborted

B : Terminated

C : Closed

D : partial

Q.no 6. In two-phase commit (2PC) protocol, who can cause a transaction to abort?

A : Coordinator
B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 7. Point out the correct statement.

A : Hadoop do need specialized hardware to process the data

B : Hadoop 2.0 allows live stream processing of real-time data

C : In Hadoop programming framework output files are divided into lines or records

D : Hadoop cannot handle big data

Q.no 8. In ER diagram ,the primary keys are

A : Underlined

B : Bold

C : Stiked out

D : Italaized

Q.no 9. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 10. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 11. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 12. In SQL, which of the following is not a data Manipulation Language
Commands?

A : Delete

B : Select

C : Update

D : Create

Q.no 13. The relationship associating the weak entity with the identifying entity is
called

A : Identifying Relationship

B : Discriminator

C : specialization

D : Genaralization

Q.no 14. Storing a separate copy of the database at multiple locations is which of
the following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 15. The langusge which enables the users to access or manipulate data

A : DML

B : DDL

C : DCL

D : TCL
Q.no 16. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.

C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 17. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 18. A Transaction ends

A : only when it is Committed.

B : only when it is Rolled-back

C : when it is Committed or Rolled-back

D : only when it is initialized

Q.no 19. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 20. The normalization form which is based on the transitive dependency is
classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 21. The technique that controls the interaction between more than one
executing transactions is known as

A : Multitasking technique

B : Serialization technique

C : Schedule technique

D : Concurrency control technique

Q.no 22. The constraint in which the database user assigns an entity to lower level
entityset rather using an membership constraint is called

A : Condition defined

B : user defined

C : system Defined

D : software defined

Q.no 23. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 24. Which of the following is a comparison operator in SQL?

A : Double equal sign

B : like

C : BETWEEN

D : Single equal sign

Q.no 25. Transaction which ensures that the transaction are being executed
successfully.
A : concurrency

B : consistency

C : serialisability

D : non serialiasability

Q.no 26. The Phenomenon in which a single transaction failure leads to a series of
transaction roll back is called

A : cascading roll back

B : abot

C : redundant failue

D : cascadeless schedule

Q.no 27. A type of query that is placed within a WHERE or HAVING clause of
another query is called

A : Master query

B : Sub query

C : Super query

D : Multi-query

Q.no 28. The size of a lock is known as

A : Implicit Lock

B : Explicit Lock

C : Lock Granularity

D : lock size

Q.no 29. R-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully
Q.no 30. If any failure occurs the data needs to be restored to a consistent state
that existed prior to the failure is called

A : Atomicity

B : Isolation

C : consistency

D : Integrity

Q.no 31. Maintaining a log for recovery purposes is a responsiblility of

A : Transaction coordinator

B : Transaction manager

C : system manager

D : Database Administrator

Q.no 32. which has the world’s largest Hadoop cluster.

A : Project Prism

B : Prism

C : Project Big

D : Project Data

Q.no 33. which NameNode is used when the Primary NameNode goes down.

A : Rack

B : Data

C : Secondary

D : primary

Q.no 34. what does NoSQL databases supportt to get high availability and disaster
recovery.

A : processing

B : scalability

C : replication
D : all of the mentioned

Q.no 35. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 36. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 37. What is the interactive shell for MongoDB called?

A : mongo

B : mongodb

C : dbmong

D : none of the mentioned

Q.no 38. HDFS works in a which fashion.

A : master-MASTER

B : master-slave

C : worker/slave

D : worker/worker

Q.no 39. A command to remove a relation from an SQL database

A : Delete table

B : Drop table

C : . Erase table
D : Alter table

Q.no 40. which cursors are declared and used by the user to process multiple row,
returned by SELECT statement

A : Implicit

B : Explicit

C : External

D : Internal

Q.no 41. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 42. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 43. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 44. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 45. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 46. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 47. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 48. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 49. In the context of timestamp-ordering protocol, which of the following

must be correct?
A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 50. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 51. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 52. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 53. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint
D : Overlapping

Q.no 54. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 55. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 56. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 57. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 58. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 59. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 60. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 1. The all-or-none property is commonly known as

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 2. Which of the following is used for the MapReduce job Tracker node?

A : mradmin

B : tasktracker

C : jobtracker

D : node tracker

Q.no 3. Command that is used to add attributes to an existing relation, is said to

be
A : Alter

B : Modify

C : Tailor

D : Eliminate

Q.no 4. Which of the following is a NoSQL Database Type?

A : SQL

B : Document databases

C : DB2

D : Maria DB

Q.no 5. which stores are used to store information about networks, such as social
connections.

A : Key-value

B : Wide-column

C : Document

D : Graph

Q.no 6. Which of the following is not a NoSQL database?

A : SQL Server

B : MongoDB

C : Cassandra

D : DB2

Q.no 7. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array
Q.no 8. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential

D : key

Q.no 9. A collection of conceptual tool for describing data ,data relation ship
,semantics and consistency is called

A : Data Model

B : Design

C : Package

D : Program

Q.no 10. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 11. In a distributed database application, if we have very many number of

read only queries than update queries then which allocation technique is
advantageous.

A : Hybrid Fragmentation

B : Horizontal Fragmentation

C : Replication

D : Vertical Fragmentation

Q.no 12. Referential integrity constraints is base on the concept of

A : Primary Key

B : Foreign key
C : uniqueness

D : normalization

Q.no 13. Which of the following is a wide-column store?

A : Cassandra

B : Riak

C : MongoDB

D : Redis

Q.no 14. The concept in normalization of relations which is based on the full
functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 15. An Entity set which do not have sufficient attributes to form a primary
key is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 16. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 17. Which of the following is not valid for NoSQL?

A : High performance
B : cross platform

C : Less scalable

D : Document Oriented

Q.no 18. Which of the following helps in implementing inter-operation

parallelism?

A : Interdependent parallelism

B : Intra-query parallelism

C : Inter-query parallelism

D : Pipelined parallelism

Q.no 19. Some of the columns of a relation are at different sites is which of the
following?

A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 20. If the attribute of relation schema R is member of some candidate key
then this type of attributes are classified as

A : atomic attribute

B : candidate attribute

C : nonprime attribute

D : prime attribute

Q.no 21. We can test a given schedule for conflict serializability by constructing a

A : wait for graph

B : precedence graph

C : topological sorting

D : cyclic graph
Q.no 22. Which is a bottom-up approach to database design that design by
examining the relationship between attributes:

A : Functional dependency

B : Database modeling

C : Normalization

D : Decomposition

Q.no 23. which is a classical approach to database design?

A : Left – Right approach

B : Right – Left approach

C : Top – Down approach

D : Bottom – Up approach

Q.no 24. In wich normal form, a composite attribute is converted to individual

attributes

A : 1NF

B : 2NF

C : 3NF

D : BCNF

Q.no 25. In case of any shut down during transaction before commit which of the
following statement is done automatically ?

A : view

B : commit

C : rollback

D : Flashback

Q.no 26. Which of the following can be a multivalued attribute?

A : phone number

B : Date

C : Date of Birth
D : age

Q.no 27. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 28. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 29. The form of dependency in which the set of attributes that are neither a
subset of any of the keys nor the candidate key is classified as

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 30. A logical description of some portion of database that is required by a

user to perform task is called as

A : System View

B : User View

C : Logical View

D : Data View

Q.no 31. which of these clause are used to make the tuples display on an sorted
manner

A : sort by
B : order by

C : arrange by

D : Group by

Q.no 32. The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE
is

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 33. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 34. Application program are said to exhibit which of these behaviour if they
do not need to be rewritten if the physical schema changes

A : Data Independence

B : Data Isolation

C : Abstraction

D : Inheritence

Q.no 35. The procedure of storing higher normal form relations which are in
lower normal form as a base relation is classified as

A : isolation of data

B : de-normalization of data

C : normalization of data

D : denomination of data
Q.no 36. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 37. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 38. Which of the following in true regarding Referential Integrity?

A : Every primary-key value must match a primary-key value in an associated table

B : Every primary-key value must match a foreign-key value in an associated table

C : Every foreign-key value must match a primary-key value in an associated table

D : Every foreign-key value must match a foreign-key value in an associated table

Q.no 39. W-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 40. In 2PL If a transaction may release locks but may not obtain any locks
then transaction is in

A : Initial Phase

B : Growing Phase

C : Shrinking Phase
D : Deadlock phase

Q.no 41. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 42. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 43. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 44. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 45. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many
B : One to One

C : Many to One

D : Many to many

Q.no 46. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 47. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 48. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 49. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence
Q.no 50. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 51. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 52. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 53. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 54. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer
D : data layer

Q.no 55. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 56. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 57. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 58. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 59. for the following two entities which one is the correct relationship
CUTOMER/ORDER
A : one to one

B : one to many

C : many to one

D : many to many

Q.no 60. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 1. A database language used for defining the whole database structure and
schema is called :

A : DCL

B : DML

C : DDL

D : DLL

Q.no 2. A third Normal Form (3 NF) relation should

A : be in 2 NF

B : not have complete key

C : not be 1 NF

D : should not have non-key attributes depend on key attribute

Q.no 3. which is used to recreate if trigger already exists.

A : Cursor

B : Trigger

C : Keywords

D : Replace
Q.no 4. A distributed database has which of the following advantages over a
centralized database?

A : Software cost

B : Software complexity

C : Slow Response

D : Modular growth

Q.no 5. Which of the following is not a parallel database architecture

A : Shared memory

B : Shared processor

C : Shared Disk

D : Shared nothing

Q.no 6. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 7. Which of the following is not an out of the box feature of NoSQL?

A : Big Data

B : Availability

C : Flexibility

D : Elastic Scaling

Q.no 8. A situation where no transaction can proceed with their normal execution
is known as

A : Transaction Abort

B : Transaction Halt

C : Binary Lock
D : Deadlock

Q.no 9. Data Redundancy may lead to

A : Inconsistency

B : Failure

C : isolation

D : consistency

Q.no 10. The lowest level of abstraction that describes how the data are actually
stored is

A : Physical Level

B : Logical Level

C : View Level

D : user Level

Q.no 11. The number of Entities associated with the relationship determine the

A : Cardinality of a relationship

B : Dependency of a relationship

C : Degree of a relationship

D : Participation of a relationship

Q.no 12. If a transaction acquires exclusive lock, then it can perform which
operation.

A : Read

B : Write

C : read and write

D : update

Q.no 13. which wizards look at past history of queries and updates (the workload)
and recommend which indices would be best for the workload

A : Schema tuning

B : Hardware tuning
C : Index tuning

D : schema tuning

Q.no 14. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger

D : Cursor

Q.no 15. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 16. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 17. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 18. which DBMS distributes data processing tasks between the workstation
and a network server.
A : Network

B : Relational

C : Client Server

D : Hierarchical

Q.no 19. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 20. The core principal of NOSQL is

A : High availability

B : High concurrency

C : High Consistency

D : High Atomicity

Q.no 21. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 22. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union
Q.no 23. The attribute name could be structured as an attribute consisting of first
name, middle initial, and last name. This type of attribute is called

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 24. In the three-tier architecture, the intermediate layer between database
and client servers is classified as

A : functional server

B : transaction server

C : application server

D : disk server

Q.no 25. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 26. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond

Q.no 27. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema
C : NewSQL databases are built to allow the insertion of data without a predefined
schema

D : Vo SQL can hundle unstructured data

Q.no 28. Which one of these in ER can be used to represent relationship among
relationship

A : Inheritence

B : Specialization

C : Generalization

D : Aggregation

Q.no 29. Which-one ofthe following statements about normal forms is FALSE?

A : BCNF is stricter than 3 NF

B : Lossless, dependency -preserving decomposition into 3 NF is always possible

C : Loss less, dependency – preserving decomposition into BCNF is always possible

D : Any relation with two attributes is BCNF

Q.no 30. View used used for displaying current status of database is

A : system.databases

B : current.databases

C : sys.databases

D : status.databases

Q.no 31. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 32. Which of the following command removes database including its related
components?

A : Drop
B : Delete

C : remove

D : Truncate

Q.no 33. Point out the wrong statement

A : Secondary indices is not available in MongoDB

B : MongoDB supports search by field, range queries, regular expression searches

C : MongoDB can store the business subject in the minimal number of documents

D : MongoDB cannot store images

Q.no 34. what does NoSQL databases supportt to get high availability and disaster
recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 35. The virtual table that its created by data from the result of an SQL Select
statement is called

A : View

B : Synonym

C : Sequence

D : Transaction

Q.no 36. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture
Q.no 37. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity

B : Relationship

C : Record

D : Super Key

Q.no 38. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority

C : disc

D : diq

Q.no 39. The application program interface in the two tier architecture database
management system is provided by the

A : close module connectivity

B : open module connectivity

C : close database connectivity

D : open database connectivity

Q.no 40. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 41. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment
C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 42. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 43. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 44. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 45. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 46. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 47. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 48. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 49. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 50. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 51. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 52. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 53. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 54. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 55. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?
A:2

B:3

C:4

D:5

Q.no 56. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 57. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 58. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 59. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping
Q.no 60. Normalization of database is essential to i. avoid accidental deletion of
required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 1. The relationship associating the weak entity with the identifying entity is
called

A : Identifying Relationship

B : Discriminator

C : specialization

D : Genaralization

Q.no 2. Entities are described in a database by a set of

A : Attributes

B : relation

C : Entity set

D : Relationship Set

Q.no 3. Every weak entity set can be converted into strong entity set by

A : using generalization

B : adding appropriate attributes

C : using Aggregation

D : Using Specialization

Q.no 4. which is a specific concurrency problem wherein two transactions depend

on each other for something.

A : phantom read problem

B : transaction read problem

C : deadlock

D : locking

Q.no 5. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 6. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 7. Which command allows the removal of all rows from a table but flushes a
table more efficiently since no rollback information is retained:

A : TRUNCATE command

B : Create command

C : Drop table command

D : Alter table command

Q.no 8. A data dictionary is a repository that manages

A : Memory

B : Metadata

C : Spell Checker

D : Data Validator

Q.no 9. What are the issues motivating parallelism?

A : Increased availability

B : Distributed access to data

C : Analysis of distributed data

D : All of the above

Q.no 10. which of these performance is sustained if the number of CPUs and disks
are increased in proportion to the amount of data

A : Linear scale up

B : Linear speed-up

C : Interference

D : None of the above

Q.no 11. The term in Key-Value databases are similar to 'Tables' in RDBMS.is

A : Values

B : Keys

C : Buckets

D : Hashing

Q.no 12. The level of abstraction that describes what data are stored in the
database

A : Logical Level

B : Physical Level

C : View Level

D : user Level

Q.no 13. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 14. Three-tier architecture includes which of the following?

A : Three server layers

B : A client layer and two server layers

C : Two client layers and one server layer

D : Three client layers

Q.no 15. The data present in the database are

A : Interrelated

B : unrelated

C : Complex

D : numerical

Q.no 16. Which of the following are the simplest NoSQL databases?

A : Key-value

B : Wide-column

C : Document

D : column based

Q.no 17. which of these makes the updates performed by the transaction become
permanent in the database

A : Roll back

B : commit

C : End

D : save

Q.no 18. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 19. Which statement in SQL allows us to change the definition of a table is

A : ALTER
B : UPDATE

C : CREATE

D : SELECT

Q.no 20. Some of the columns of a relation are at different sites is which of the
following?

A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 21. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager

D : Transaction Manager

Q.no 22. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 23. Identify the correct mechanism to ensure the isolation property of a set
of transactions.

A : Recovery manager

B : Concurrency control system

C : Security management system

D : Query optimization techniques

Q.no 24. which one of these is not correct

A : ER is an conceptual Data model

B : we cannot create a table without a primary key

C : An attribute of an entity can have more than one value

D : DBMS avoids Data redundancy

Q.no 25. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 26. All of the following accurately describe Hadoop, EXCEPT:

A : Open source

B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 27. The number of queries that can be processed on average per unit of time
is aclled

A : Throughput

B : Response Time

C : turn around time

D : waiting time

Q.no 28. which one of these database user interact with the system without
writing programs,instead they form the request in database query language

A : Sophisticated user

B : Specialized User
C : Application Progrmer

D : Naive User

Q.no 29. Global Wait-for graph is used for

A : Handling concurrency control

B : Handling failures

C : Handling deadlock

D : None of the above

Q.no 30. HDFS is implemented in which programming language.

A : C++

B : java

C : python

D:C

Q.no 31. Which is not DDL operation

A : Renaming a table

B : SQL create table

C : Add a column to an existing table

D : Update data into a table in SQL database

Q.no 32. In case of any shut down during transaction before commit which of the
following statement is done automatically ?

A : view

B : commit

C : rollback

D : Flashback

Q.no 33. provide a way for your program to select multiple rows of data from the
database and then process each row individually.

A : cursors
B : Triggers

C : process

D : select

Q.no 34. Which of the following is a comparison operator in SQL?

A : Double equal sign

B : like

C : BETWEEN

D : Single equal sign

Q.no 35. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 36. which operation sets the values of all data item updated by the
transaction to the old values

A : redo

B : un do

C : restart

D : abort

Q.no 37. When a participating site s1 decides to commit the transaction T upon
receiving the <prepare T> message from the coordinator, it sends which message
to the coordinator site.

A : <prepare T>

B : <commit T>

C : <ready T>

D : <abort T>
Q.no 38. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 39. Which of the following is the default Partitioner for Mapreduce?

A : MergePartitioner

B : HashedPartitioner

C : HashPartitioner

D : Hasher

Q.no 40. which has the world’s largest Hadoop cluster.

A : Project Prism

B : Prism

C : Project Big

D : Project Data

Q.no 41. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 42. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 43. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 44. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 45. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 46. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 47. if queries are issued at one or more nodes.a distributed transaction can
be
A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 48. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 49. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 50. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 51. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 52. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 53. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 54. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 55. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 56. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 57. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 58. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 59. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 60. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp
Q.no 1. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 2. A collection and document in mongoDB is equivlent to which concept

respectively.

A : Table and column

B : Table and row

C : column and row

D : database and table

Q.no 3. Some of the columns of a relation are at different sites is which of the
following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 4. In a distributed database application, if we have very many number of

read only queries than update queries then which allocation technique is
advantageous.

A : Hybrid Fragmentation

B : Horizontal Fragmentation

C : Replication

D : Vertical Fragmentation

Q.no 5. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database
B : Parallel database

C : Client server database

D : standalone systems

Q.no 6. Which normal form is considered adequate for normal relational

database design?

A : 2NF

B : 3NF

C : 4NF

D : BCNF

Q.no 7. A collection of conceptual tool for describing data ,data relation ship
,semantics and consistency is called

A : Data Model

B : Design

C : Package

D : Program

Q.no 8. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 9. A transaction is not allowed to release any lock until it commits is known
as

A : Rigorous Two Phase Locking

B : Strict Two Phase Locking

C : Shrinking Two Phase Locking

D : Binary Lock

Q.no 10. Which of the following is used for the MapReduce job Tracker node?
A : mradmin

B : tasktracker

C : jobtracker

D : node tracker

Q.no 11. Normalization is a process of restructuring a relation to

A : minimize duplication of data in a database

B : maximize duplication of data to ensure reliability

C : make it of uniform size

D : allow addition of data

Q.no 12. The collection of information stored in the database at a particular

moment is called

A : Instance

B : Schema

C : table

D : relation

Q.no 13. In NoSQL databases,mostly data is stored in

A : Central

B : Distributed

C : one server

D : High end server

Q.no 14. The object that exist in the real world and is distinquishable form other
object is

A : Entity

B : Attribute

C : Property

D : Relationship
Q.no 15. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 16. The possible value associated with every attribute is called

A : Domain

B : Assertion

C : instance

D : Schema

Q.no 17. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 18. An Entity set which do not have sufficient attributes to form a primary
key is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 19. Following represent coloumn in No SQL

A : Document

B : Collection

C : Database
D : Field

Q.no 20. In two-phase commit (2PC) protocol, who can cause a transaction to
abort?

A : Coordinator

B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 21. All tuples in the relation are assigned null as the value for the new
attribute, in the

A : Alter Command

B : Select Command

C : Delete Command

D : Create Command

Q.no 22. which is the primary interface for a user to describe a MapReduce job to
the Hadoop framework for execution.

A : JobConfig

B : JobConf

C : JobConfiguration

D : job

Q.no 23. The Phenomenon in which a single transaction failure leads to a series of
transaction roll back is called

A : cascading roll back

B : abot

C : redundant failue

D : cascadeless schedule

Q.no 24. In E-R Diagram derived attribute are represented by

A : Ellipse
B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 25. Which scenario is best suited for NoSQL?

A : When dealing with large data sets.

B : When low level of security is needed.

C : When data retrieval speed can be variable.

D : When providing data integrity.

Q.no 26. In two-tier client ⁄ server architecture, the running of application

programs and the user interface programs is in control of

A : modulation side

B : client side

C : server side

D : host side

Q.no 27. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator

D : IS NULL operator

Q.no 28. Application program are said to exhibit which of these behaviour if they
do not need to be rewritten if the physical schema changes

A : Data Independence

B : Data Isolation

C : Abstraction

D : Inheritence

Q.no 29. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 30. Point out the wrong statement

A : Secondary indices is not available in MongoDB

B : MongoDB supports search by field, range queries, regular expression searches

C : MongoDB can store the business subject in the minimal number of documents

D : MongoDB cannot store images

Q.no 31. which is the process of selecting the most efficient query-evaluation plan
from among the many strategies usually possible for processing a given query,
especially if the query is complex.

A : Permormance tuning

B : Parsing

C : Query optimization

D : compilation

Q.no 32. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 33. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access
D : Uncontrolled Access

Q.no 34. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 35. Which of the following in true regarding Referential Integrity?

A : Every primary-key value must match a primary-key value in an associated table

B : Every primary-key value must match a foreign-key value in an associated table

C : Every foreign-key value must match a primary-key value in an associated table

D : Every foreign-key value must match a foreign-key value in an associated table

Q.no 36. If a transaction can be granted a lock on an item immediately in spite of

the presence of another type of lock, then the two locks are said to be

A : Concurrent

B : Conflict

C : Equivalent

D : Compatible

Q.no 37. What do you mean by one to many relationship between Teacher and
Class table?

A : One class may have many teachers

B : One teacher can have many classes

C : Many classes may have many teachers

D : Many teachers may have many classes

Q.no 38. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector
C : InputCollector

D : output

Q.no 39. which cursors are declared and used by the user to process multiple row,
returned by SELECT statement

A : Implicit

B : Explicit

C : External

D : Internal

Q.no 40. In SQL, which of these can be test for the presence of set membership

A : in

B : not in

C : yes

D : like

Q.no 41. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 42. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 43. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many
B : One to One

C : Many to One

D : Many to many

Q.no 44. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 45. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 46. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 47. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer
Q.no 48. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 49. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 50. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 51. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 52. What are the advantages of Replication of data in Distributed database?
A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 53. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 54. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 55. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 56. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 57. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 58. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 59. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 60. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 1. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed
D : Compensated

Q.no 2. Minimal Superkeys are called

A : Schema keys

B : Candidate keys

C : Domain keys

D : Attribute keys

Q.no 3. which wizards look at past history of queries and updates (the workload)
and recommend which indices would be best for the workload

A : Schema tuning

B : Hardware tuning

C : Index tuning

D : schema tuning

Q.no 4. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 5. When a transaction completes the execution of its final statement, it

enters a state. What is the name of this state?

A : Partially Committed state

B : Committed state

C : Failed state

D : Aborted State

Q.no 6. The concept in normalization of relations which is based on the full

functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 7. Which one of these are used to express relationship among relationship

A : Aggregation

B : Generalization

C : Specialization

D : Abstraction

Q.no 8. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.

C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 9. which of these performance is sustained if the number of CPUs and disks
are increased in proportion to the amount of data

A : Linear scale up

B : Linear speed-up

C : Interference

D : None of the above

Q.no 10. Which of the following is a wide-column store?

A : Cassandra

B : Riak

C : MongoDB

D : Redis

Q.no 11. A relation is said to be in BCNF when

A : it has overlapping composite keys

B : it has no composite keys

C : it has no multivalued dependencies

D : it has no overlapping composite keys which have related attributes

Q.no 12. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 13. . Each modification done in database transaction are first recorded into
the

A : Hard drive

B : disk

C : Log

D : Datamart

Q.no 14. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 15. A database language used for defining the whole database structure and
schema is called :

A : DCL

B : DML

C : DDL
D : DLL

Q.no 16. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 17. A data dictionary is a repository that manages

A : Memory

B : Metadata

C : Spell Checker

D : Data Validator

Q.no 18. Which of the following partitions the key space?

A : Partitioner

B : Compactor

C : Collector

D : collect

Q.no 19. Which of the following is not a valid NoSQL database?

A : cassandra

B : mongoDB

C : Postgresql

D : Hbase

Q.no 20. Which of the following is not the DDL statements

A : Create

B : Drop

C : Alter
D : select

Q.no 21. Which of the following parallel database architectures is/are mainly used
by distributed database system?

A : Shared Memory

B : Shared Disk

C : Hierarchical

D : Shared Nothing

Q.no 22. What is the mechanism which guarantees that all database servers
participating in a distributed transaction either all commit or all roll back the
statements in the transaction?

A : Commit

B : Commit transaction

C : Two-phase commit

D : Three-phase commit

Q.no 23. The COUNT function in SQL returns the number of

A : Values

B : Distinct values

C : Group By

D : Columns

Q.no 24. Transactions T1 and T2 concurrently perform some operations on the

same data item and at least one of them is write operation then these transaction
known as

A : Conflicting

B : Overwriting

C : Non-Conflicting

D : inefficient

Q.no 25. Supporting interquery parallelism is more complicated in

A : Shared Memory
B : shared disk

C : shared nothing

D : shared disk and shared nothing

Q.no 26. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 27. “Sharding” a database across many server instances can be achieved
with

A : LAN

B : SAN

C : MAN

D : NAN

Q.no 28. which one of these may result in inconsistent data

A : Concurrent Access

B : Serial Access

C : Locking

D : constraints

Q.no 29. Given the basic ER and relational models, which of the following is
INCORRECT?

A : An attribute of an entity can have more than one value

B : An attribute of an entity can be composite

C : In a row of a relational table an attribute can have more than one value

D : In a row of a relational table, an attribute can have exactly one value or a NULL
value
Q.no 30. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 31. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 32. The execution sequences in concurrency control is known as

A : Serializability

B : Schedules

C : Organizations

D : Timetable

Q.no 33. which executes the Mapper/ Reducer task as a child process in a separate
jvm.

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : job tasker

Q.no 34. which executes the Mapper/ Reducer task as a child process in a separate
jvm

A : JobTracker

B : TaskTracker
C : TaskScheduler

D : Task jober

Q.no 35. Some highe level entities may not belong to any lower level entity set

A : Partial

B : Complete

C : Overlapping

D : Disjoint

Q.no 36. The property which says that No transaction will affect the existence of
any other transaction.

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 37. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 38. HDFS works in a which fashion.

A : master-MASTER

B : master-slave

C : worker/slave

D : worker/worker

Q.no 39. The number of queries that can be processed on average per unit of time
is aclled

A : Throughput
B : Response Time

C : turn around time

D : waiting time

Q.no 40. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 41. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 42. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 43. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 44. Concurrency control is important for which of the following reasons?
A : To ensure data integrity when updates occur to the database in a multiuser
environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 45. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 46. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 47. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 48. The business logic of the application says what actions to carry out under
what conditions, is embedded in
A : Multiple servers

B : Multiple clients

C : Transaction server

D : Application server

Q.no 49. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 50. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 51. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 52. Temporary stored procedures are stored in which database.

A : Master

B : Model
C : User specific

D : Tempdb

Q.no 53. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 54. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 55. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 56. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 57. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one
B : one to many

C : many to one

D : many to many

Q.no 58. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 59. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 60. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 1. A relationship may also have attributes called

A : Descriptive Attribute

B : Derived Attribute

C : Relational Attribute

D : domain attribute

Q.no 2. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 3. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation

Q.no 4. The number of Entities associated with the relationship determine the

A : Cardinality of a relationship

B : Dependency of a relationship

C : Degree of a relationship

D : Participation of a relationship

Q.no 5. If a transaction acquires exclusive lock, then it can perform which

operation.

A : Read

B : Write

C : read and write

D : update

Q.no 6. In SQL, which of the following is not a data definition language

commands?

A : RENAME

B : REVOKE

C : GRANT

D : CREATE
Q.no 7. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla

Q.no 8. which DBMS distributes data processing tasks between the workstation
and a network server.

A : Network

B : Relational

C : Client Server

D : Hierarchical

Q.no 9. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 10. Which ensures that the database remains in a consistent state despites
system failures

A : Transaction Management

B : Query Processor

C : Storage Manager

D : Buffer Manager

Q.no 11. What is the full form of DDL

A : Dynamic Data Language

B : Detailed Data Language

C : Data Definition Language

D : Data Derivation Language

Q.no 12. which is a specific concurrency problem wherein two transactions

depend on each other for something.

A : phantom read problem

B : transaction read problem

C : deadlock

D : locking

Q.no 13. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 14. Which of the following is not an out of the box feature of NoSQL?

A : Big Data

B : Availability

C : Flexibility

D : Elastic Scaling

Q.no 15. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 16. The langusge which enables the users to access or manipulate data

A : DML

B : DDL
C : DCL

D : TCL

Q.no 17. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 18. A distributed database has which of the following advantages over a
centralized database?

A : Software cost

B : Software complexity

C : Slow Response

D : Modular growth

Q.no 19. How many rules in “CODD’S RULES” of Relational Model of database
systems?

A : 11

B : 12

C : 13

D : 14

Q.no 20. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 21. We can test a given schedule for conflict serializability by constructing a

A : wait for graph

B : precedence graph

C : topological sorting

D : cyclic graph

Q.no 22. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 23. which operation sets the values of all data item updated by the
transaction to the new state

A : redo

B : un do

C : restart

D : abort

Q.no 24. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 25. Domain constraints, functional dependency and referential integrity are
special forms of

A : Foreign key

B : Primary key

C : Assertion

D : Referential constraint

Q.no 26. In E-R Diagram derived attribute are represented by

A : Ellipse

B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 27. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager

D : Transaction Manager

Q.no 28. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 29. R-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 30. Which of the following is a disadvantage of replication?

A : Reduced network traffic

B : If the database fails at one site, a copy can be located at another site.

C : Each site must have the same storage capacity.

D : Each transaction may proceed without coordination across the network.

Q.no 31. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 32. Maintaining a log for recovery purposes is a responsiblility of

A : Transaction coordinator

B : Transaction manager

C : system manager

D : Database Administrator

Q.no 33. Which is a bottom-up approach to database design that design by

examining the relationship between attributes:

A : Functional dependency

B : Database modeling

C : Normalization

D : Decomposition

Q.no 34. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 35. The layer, which provides the interface between the business-logic layer
and the underlying database.

A : Business logic

B : Presentation

C : User interaction
D : Data access

Q.no 36. In 2PL If a transaction may obtain locks but may not release any locks
then Transaction is in

A : Initial Phase

B : Growing Phase

C : Shrinking Phase

D : Deadlock phase

Q.no 37. which of these allow us to identify uniquely a tuple in the relation.

A : Superkey

B : Domain

C : Attribute

D : Schema

Q.no 38. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 39. which of these clause are used to make the tuples display on an sorted
manner

A : sort by

B : order by

C : arrange by

D : Group by

Q.no 40. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity

B : Relationship
C : Record

D : Super Key

Q.no 41. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 42. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 43. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 44. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 45. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 46. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 47. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 48. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 49. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer
Q.no 50. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 51. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 52. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 53. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 54. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 55. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 56. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 57. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 58. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 59. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 60. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many

B : One to One

C : Many to One

D : Many to many

Q.no 1. Which command allows the removal of all rows from a table but flushes a
table more efficiently since no rollback information is retained:

A : TRUNCATE command

B : Create command

C : Drop table command

D : Alter table command

Q.no 2. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 3. The process of decomposing larger table to smaller table to avoid

redundancy is called

A : normalization

B : views

C : encapsulation

D : abstraction
Q.no 4. In a distributed database application, if we have very many number of
read only queries than update queries then which allocation technique is
advantageous.

A : Hybrid Fragmentation

B : Horizontal Fragmentation

C : Replication

D : Vertical Fragmentation

Q.no 5. An Entity set which do not have sufficient attributes to form a primary key
is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 6. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 7. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 8. The normalization form which is based on the transitive dependency is

classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 9. Boye Codd Normal Form (BCNF) is needed when

A : two non-key attributes are dependent

B : there is more then one possible composite key

C : there are two or more possible composite overlapping keys and one attribute of a
composite key is dependent on an attribute of another composite key

D : there are two possible keys and they are dependent on one another

Q.no 10. Storing a separate copy of the database at multiple locations is which of
the following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 11. The core principal of NOSQL is

A : High availability

B : High concurrency

C : High Consistency

D : High Atomicity

Q.no 12. A homogeneous distributed database is which of the following?

A : The same DBMS is used at each location and data are not distributed across all
nodes.

B : The same DBMS is used at each location and data are distributed across all nodes.

C : A different DBMS is used at each location and data are not distributed across all
nodes

D : A different DBMS is used at each location and data are distributed across all nodes.

Q.no 13. When a transaction completes the execution of its final statement, it
enters a state. What is the name of this state?
A : Partially Committed state

B : Committed state

C : Failed state

D : Aborted State

Q.no 14. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 15. Point out the correct statement.

A : Hadoop do need specialized hardware to process the data

B : Hadoop 2.0 allows live stream processing of real-time data

C : In Hadoop programming framework output files are divided into lines or records

D : Hadoop cannot handle big data

Q.no 16. A relation is said to be in 1NF if

A : there is no duplication of data

B : there are no composite attributes in the relation

C : there are only a few composite attributes

D : all attributes are of uniform type

Q.no 17. Which normal form is considered adequate for normal relational
database design?

A : 2NF

B : 3NF

C : 4NF

D : BCNF

Q.no 18. Normalization is a process of restructuring a relation to

A : minimize duplication of data in a database

B : maximize duplication of data to ensure reliability

C : make it of uniform size

D : allow addition of data

Q.no 19. TRUNCATE statement in SQL is a

A : DDL

B : DML

C : DCL

D : TCL

Q.no 20. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 21. In wich normal form, a composite attribute is converted to individual

attributes

A : 1NF

B : 2NF

C : 3NF

D : BCNF

Q.no 22. what does NoSQL databases supportt to get high availability and disaster
recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 23. If a transaction can be granted a lock on an item immediately in spite of
the presence of another type of lock, then the two locks are said to be

A : Concurrent

B : Conflict

C : Equivalent

D : Compatible

Q.no 24. A logical description of some portion of database that is required by a

user to perform task is called as

A : System View

B : User View

C : Logical View

D : Data View

Q.no 25. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 26. The technique that controls the interaction between more than one
executing transactions is known as

A : Multitasking technique

B : Serialization technique

C : Schedule technique

D : Concurrency control technique

Q.no 27. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 28. Transactions T1 and T2 concurrently perform some operations on the

same data item and at least one of them is write operation then these transaction
known as

A : Conflicting

B : Overwriting

C : Non-Conflicting

D : inefficient

Q.no 29. Which is essentially used to search for patterns in target string.

A : Like Predicate

B : Null Predicate

C : In Predicate

D : Out Predicate

Q.no 30. In 2PL If a transaction may release locks but may not obtain any locks
then transaction is in

A : Initial Phase

B : Growing Phase

C : Shrinking Phase

D : Deadlock phase

Q.no 31. The size of a lock is known as

A : Implicit Lock

B : Explicit Lock

C : Lock Granularity

D : lock size

Q.no 32. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 33. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 34. What are the ACID Properties of transaction?

A : Atomicity, Consistency, Inconsistent, Durability

B : Atomicity, Consistency, Isolation, Durability

C : Atomicity, Consistency, Inconsistent, Database

D : Automatically, Consistency, Inconsistent, Durability

Q.no 35. All of the following accurately describe Hadoop, EXCEPT:

A : Open source

B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 36. A type of query that is placed within a WHERE or HAVING clause of
another query is called

A : Master query

B : Sub query

C : Super query

D : Multi-query

Q.no 37. In two-tier client ⁄ server architecture, the running of application

programs and the user interface programs is in control of
A : modulation side

B : client side

C : server side

D : host side

Q.no 38. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 39. which one of these database user interact with the system without
writing programs,instead they form the request in database query language

A : Sophisticated user

B : Specialized User

C : Application Progrmer

D : Naive User

Q.no 40. In SQL, which of these can be test for the presence of set membership

A : in

B : not in

C : yes

D : like

Q.no 41. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 42. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 43. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 44. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 45. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 46. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific
D : Tempdb

Q.no 47. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 48. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 49. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 50. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 51. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 52. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 53. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 54. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 55. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute
D : no table is created

Q.no 56. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 57. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 58. The business logic of the application says what actions to carry out under
what conditions, is embedded in

A : Multiple servers

B : Multiple clients

C : Transaction server

D : Application server

Q.no 59. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 60. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 1. Command that is used to add attributes to an existing relation, is said to

be

A : Alter

B : Modify

C : Tailor

D : Eliminate

Q.no 2. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 3. If a transaction acquires a shared lock, then it can perform which of these
operation.

A : read

B : write

C : read and write

D : update

Q.no 4. The possible value associated with every attribute is called

A : Domain

B : Assertion

C : instance

D : Schema

Q.no 5. In SQL, which of the following is not a data Manipulation Language

Commands?

A : Delete
B : Select

C : Update

D : Create

Q.no 6. To increase the throughput and response time of the system especially
when there are lots of smaller queries, which type of parallelism is most likely to
perform better?

A : Intra-query parallelism

B : Inter-query parallelism

C : Inter-operation parallelism

D : Intra-operation parallelism

Q.no 7. Which of the following is not a NoSQL database?

A : SQL Server

B : MongoDB

C : Cassandra

D : DB2

Q.no 8. Every weak entity set can be converted into strong entity set by

A : using generalization

B : adding appropriate attributes

C : using Aggregation

D : Using Specialization

Q.no 9. A relation is said to be in BCNF when

A : it has overlapping composite keys

B : it has no composite keys

C : it has no multivalued dependencies

D : it has no overlapping composite keys which have related attributes

Q.no 10. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 11. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 12. The level of abstraction that describes what data are stored in the
database

A : Logical Level

B : Physical Level

C : View Level

D : user Level

Q.no 13. How many versions of two phase locking protocol available

A:1

B:2

C:3

D:4

Q.no 14. The Overall design of the database is called

A : Schema

B : Instance

C : table

D : relation

Q.no 15. To delete a particular column in a relation the command used is:
A : UPDATE TABLE

B : TRUNCATE COLUMN

C : ALTER , DROP

D : DELETE COLUMN

Q.no 16. The relationship associating the weak entity with the identifying entity is
called

A : Identifying Relationship

B : Discriminator

C : specialization

D : Genaralization

Q.no 17. . Each modification done in database transaction are first recorded into
the

A : Hard drive

B : disk

C : Log

D : Datamart

Q.no 18. which is used to recreate if trigger already exists.

A : Cursor

B : Trigger

C : Keywords

D : Replace

Q.no 19. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF
Q.no 20. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 21. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 22. Global Wait-for graph is used for

A : Handling concurrency control

B : Handling failures

C : Handling deadlock

D : None of the above

Q.no 23. The type of server in two-tier architectures which provides the data to
client stored on disk pages is called

A : transaction server

B : functional serve

C : disk server

D : data server

Q.no 24. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator

D : IS NULL operator
Q.no 25. E-R model uses this symbol to represent weak entity set ?

A : Dotted rectangle

B : Diamond

C : Doubly outlined rectangle

D : Triangle

Q.no 26. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector

C : InputCollector

D : output

Q.no 27. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond

Q.no 28. The form of dependency in which the set of attributes that are neither a
subset of any of the keys nor the candidate key is classified as

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 29. Which of the following is not one of the stages in the evolution of
distributed DBMS?

A : Unit of work

B : Remote unit of work

C : Distributed unit of Work

D : Distributed request

Q.no 30. The real use of the Two-phase commit protocol is

A : Deadlock will not occur

B : Concurrency control can be avoided

C : Atomicity, i.e, all-or-nothing commits at all sites

D : serializability

Q.no 31. All tuples in the relation are assigned null as the value for the new
attribute, in the

A : Alter Command

B : Select Command

C : Delete Command

D : Create Command

Q.no 32. which executes the Mapper/ Reducer task as a child process in a separate
jvm.

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : job tasker

Q.no 33. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity

B : Relationship

C : Record

D : Super Key

Q.no 34. An entity belong to no more than one lower level entity set

A : Disjoint

B : Overlapping
C : Complete

D : Partial

Q.no 35. NoSQL databases is used mainly for handling large volumes of

A : unstructured

B : structured

C : Tabular

D : relational

Q.no 36. which has the world’s largest Hadoop cluster.

A : Project Prism

B : Prism

C : Project Big

D : Project Data

Q.no 37. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 38. A command to remove a relation from an SQL database

A : Delete table

B : Drop table

C : . Erase table

D : Alter table

Q.no 39. SQl uses which of these values to indicate the absence of information
about the value of an attribute

A:0
B : NA

C : NULL

D : AB

Q.no 40. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 41. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 42. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 43. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3
C:4

D:5

Q.no 44. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 45. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 46. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 47. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 48. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition
B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 49. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 50. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 51. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 52. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 53. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 54. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 55. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 56. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 57. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly
D : Insertion anomaly

Q.no 58. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 59. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 60. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 1. The highest level of abstraction that describes only part of the entire
database

A : View Level

B : Physical Level

C : Logical Level

D : Conceptal Level

Q.no 2. The term in Key-Value databases are similar to 'Tables' in RDBMS.is

A : Values
B : Keys

C : Buckets

D : Hashing

Q.no 3. TRUNCATE statement in SQL is a

A : DDL

B : DML

C : DCL

D : TCL

Q.no 4. The number of Entities associated with the relationship determine the

A : Cardinality of a relationship

B : Dependency of a relationship

C : Degree of a relationship

D : Participation of a relationship

Q.no 5. Some of the columns of a relation are at different sites is which of the
following?

A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 6. If a transaction acquires exclusive lock, then it can perform which

operation.

A : Read

B : Write

C : read and write

D : update

Q.no 7. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint
A : Domain

B : Entity

C : referential

D : key

Q.no 8. A transaction may not always complete its execution successfully. Such a
transaction is termed

A : Aborted

B : Terminated

C : Closed

D : partial

Q.no 9. Entities are described in a database by a set of

A : Attributes

B : relation

C : Entity set

D : Relationship Set

Q.no 10. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 11. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation
Q.no 12. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 13. Data Redundancy may lead to

A : Inconsistency

B : Failure

C : isolation

D : consistency

Q.no 14. which stores are used to store information about networks, such as
social connections.

A : Key-value

B : Wide-column

C : Document

D : Graph

Q.no 15. Which of the following is not the DDL statements

A : Create

B : Drop

C : Alter

D : select

Q.no 16. Some of the columns of a relation are at different sites is which of the
following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning
D : Horizontal and Vertical Partitioning

Q.no 17. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 18. If the attribute of relation schema R is member of some candidate key
then this type of attributes are classified as

A : atomic attribute

B : candidate attribute

C : nonprime attribute

D : prime attribute

Q.no 19. Point out the correct statement.

A : Hadoop do need specialized hardware to process the data

B : Hadoop 2.0 allows live stream processing of real-time data

C : In Hadoop programming framework output files are divided into lines or records

D : Hadoop cannot handle big data

Q.no 20. which of these makes the updates performed by the transaction become
permanent in the database

A : Roll back

B : commit

C : End

D : save

Q.no 21. Which is essentially used to search for patterns in target string.

A : Like Predicate

B : Null Predicate
C : In Predicate

D : Out Predicate

Q.no 22. Aggregate functions takes a collection of values as input and returns how
many values as output

A:1

B:2

C : more than 1

D:0

Q.no 23. The execution sequences in concurrency control is known as

A : Serializability

B : Schedules

C : Organizations

D : Timetable

Q.no 24. Which of the following is a disadvantage of replication?

A : Reduced network traffic

B : If the database fails at one site, a copy can be located at another site.

C : Each site must have the same storage capacity.

D : Each transaction may proceed without coordination across the network.

Q.no 25. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 26. Which of the following can be a multivalued attribute?

A : phone number
B : Date

C : Date of Birth

D : age

Q.no 27. The attribute name could be structured as an attribute consisting of first
name, middle initial, and last name. This type of attribute is called

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 28. The constraint in which the database user assigns an entity to lower level
entityset rather using an membership constraint is called

A : Condition defined

B : user defined

C : system Defined

D : software defined

Q.no 29. Transactions are executed one by one without any interleaved
operations from other transactions is known as

A : Serial Schedule

B : Complete Schedule

C : Concurrent Schedule

D : Non-Complete Schedule

Q.no 30. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema

C : NewSQL databases are built to allow the insertion of data without a predefined
schema

D : Vo SQL can hundle unstructured data

Q.no 31. In 2PL If a transaction may obtain locks but may not release any locks
then Transaction is in

A : Initial Phase

B : Growing Phase

C : Shrinking Phase

D : Deadlock phase

Q.no 32. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 33. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 34. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 35. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 36. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 37. which is the primary interface for a user to describe a MapReduce job to
the Hadoop framework for execution.

A : JobConfig

B : JobConf

C : JobConfiguration

D : job

Q.no 38. What do you mean by one to many relationship between Teacher and
Class table?

A : One class may have many teachers

B : One teacher can have many classes

C : Many classes may have many teachers

D : Many teachers may have many classes

Q.no 39. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture

Q.no 40. Which is a bottom-up approach to database design that design by

examining the relationship between attributes:
A : Functional dependency

B : Database modeling

C : Normalization

D : Decomposition

Q.no 41. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 42. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 43. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 44. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers
C : Functions

D : None of the mentioned

Q.no 45. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 46. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 47. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 48. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 49. A server cannot serve on which of the following levels?

A : Client Layer
B : Business Laye

C : Database Layer

D : data layer

Q.no 50. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 51. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 52. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 53. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key
D : Both A and B

Q.no 54. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 55. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 56. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 57. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 58. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.
A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 59. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 60. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 1. In ER diagram ,the primary keys are

A : Underlined

B : Bold

C : Stiked out

D : Italaized

Q.no 2. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database

B : Parallel database

C : Client server database

D : standalone systems

Q.no 3. Following represent coloumn in No SQL

A : Document

B : Collection

C : Database

D : Field

Q.no 4. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 5. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 6. Minimal Superkeys are called

A : Schema keys

B : Candidate keys

C : Domain keys

D : Attribute keys

Q.no 7. Which of the following is not an out of the box feature of NoSQL?

A : Big Data

B : Availability

C : Flexibility
D : Elastic Scaling

Q.no 8. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 9. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 10. The concept in normalization of relations which is based on the full
functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 11. If a transaction obtains an exclusive lock on a row, it means that the
transaction wants to

A : select

B : update

C : view

D : read

Q.no 12. How many rules in “CODD’S RULES” of Relational Model of database
systems?

A : 11

B : 12
C : 13

D : 14

Q.no 13. Which statement in SQL allows us to change the definition of a table is

A : ALTER

B : UPDATE

C : CREATE

D : SELECT

Q.no 14. A Transaction ends

A : only when it is Committed.

B : only when it is Rolled-back

C : when it is Committed or Rolled-back

D : only when it is initialized

Q.no 15. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 16. Which of the following helps in implementing inter-operation

parallelism?

A : Interdependent parallelism

B : Intra-query parallelism

C : Inter-query parallelism

D : Pipelined parallelism

Q.no 17. In two-phase commit (2PC) protocol, who can cause a transaction to
abort?

A : Coordinator
B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 18. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger

D : Cursor

Q.no 19. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla

Q.no 20. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 21. Which one of these in ER can be used to represent relationship among
relationship

A : Inheritence

B : Specialization

C : Generalization

D : Aggregation
Q.no 22. In two-tier client ⁄ server architecture, the running of application
programs and the user interface programs is in control of

A : modulation side

B : client side

C : server side

D : host side

Q.no 23. Which of the following parallel database architectures is/are mainly used
by distributed database system?

A : Shared Memory

B : Shared Disk

C : Hierarchical

D : Shared Nothing

Q.no 24. The type of server in two-tier architectures which provides the data to
client stored on disk pages is called

A : transaction server

B : functional serve

C : disk server

D : data server

Q.no 25. Application program are said to exhibit which of these behaviour if they
do not need to be rewritten if the physical schema changes

A : Data Independence

B : Data Isolation

C : Abstraction

D : Inheritence

Q.no 26. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 27. The size of a lock is known as

A : Implicit Lock

B : Explicit Lock

C : Lock Granularity

D : lock size

Q.no 28. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority

C : disc

D : diq

Q.no 29. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 30. Each higher level entity must belong to a lwer level entity

A : Total

B : Overlapping

C : Disjoint

D : partial

Q.no 31. HDFS is implemented in which programming language.

A : C++

B : java
C : python

D:C

Q.no 32. The technique that controls the interaction between more than one
executing transactions is known as

A : Multitasking technique

B : Serialization technique

C : Schedule technique

D : Concurrency control technique

Q.no 33. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 34. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 35. What is the mechanism which guarantees that all database servers
participating in a distributed transaction either all commit or all roll back the
statements in the transaction?

A : Commit

B : Commit transaction

C : Two-phase commit

D : Three-phase commit

Q.no 36. When more than one user is accessing same data at the same time then it
is known
A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 37. Which of the following command removes database including its related
components?

A : Drop

B : Delete

C : remove

D : Truncate

Q.no 38. Domain constraints, functional dependency and referential integrity are
special forms of

A : Foreign key

B : Primary key

C : Assertion

D : Referential constraint

Q.no 39. A collection of MongoDB is group of

A : DATABASES

B : Related Doocuments

C : schema

D : rows

Q.no 40. If a transaction can be granted a lock on an item immediately in spite of

the presence of another type of lock, then the two locks are said to be

A : Concurrent

B : Conflict

C : Equivalent

D : Compatible
Q.no 41. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 42. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 43. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 44. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 45. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors
D : transaction

Q.no 46. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 47. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 48. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 49. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 50. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 51. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 52. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 53. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 54. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many

B : One to One

C : Many to One

D : Many to many
Q.no 55. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 56. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 57. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 58. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 59. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL
C : SQL declarations

D : SQL data analysis

Q.no 60. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 1. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 2. The lowest level of abstraction that describes how the data are actually
stored is

A : Physical Level

B : Logical Level

C : View Level

D : user Level

Q.no 3. To increase the throughput and response time of the system especially
when there are lots of smaller queries, which type of parallelism is most likely to
perform better?

A : Intra-query parallelism

B : Inter-query parallelism

C : Inter-operation parallelism

D : Intra-operation parallelism

Q.no 4. Which of the following is a wide-column store?

A : Cassandra

B : Riak

C : MongoDB

D : Redis

Q.no 5. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 6. What are the issues motivating parallelism?

A : Increased availability

B : Distributed access to data

C : Analysis of distributed data

D : All of the above

Q.no 7. The langusge which enables the users to access or manipulate data

A : DML

B : DDL

C : DCL

D : TCL

Q.no 8. Boye Codd Normal Form (BCNF) is needed when

A : two non-key attributes are dependent

B : there is more then one possible composite key

C : there are two or more possible composite overlapping keys and one attribute of a
composite key is dependent on an attribute of another composite key

D : there are two possible keys and they are dependent on one another

Q.no 9. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 10. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 11. Which normal form is considered adequate for normal relational
database design?

A : 2NF

B : 3NF

C : 4NF

D : BCNF

Q.no 12. Storing a separate copy of the database at multiple locations is which of
the following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 13. A transaction is not allowed to release any lock until it commits is known
as

A : Rigorous Two Phase Locking

B : Strict Two Phase Locking

C : Shrinking Two Phase Locking

D : Binary Lock
Q.no 14. A relation is said to be in BCNF when

A : it has overlapping composite keys

B : it has no composite keys

C : it has no multivalued dependencies

D : it has no overlapping composite keys which have related attributes

Q.no 15. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 16. Which of the following is not a parallel database architecture

A : Shared memory

B : Shared processor

C : Shared Disk

D : Shared nothing

Q.no 17. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 18. A homogeneous distributed database is which of the following?

A : The same DBMS is used at each location and data are not distributed across all
nodes.

B : The same DBMS is used at each location and data are distributed across all nodes.

C : A different DBMS is used at each location and data are not distributed across all
nodes
D : A different DBMS is used at each location and data are distributed across all nodes.

Q.no 19. The set of entities of the same type share the same

A : Properties

B : value

C : instance

D : record

Q.no 20. Normalization is a process of restructuring a relation to

A : minimize duplication of data in a database

B : maximize duplication of data to ensure reliability

C : make it of uniform size

D : allow addition of data

Q.no 21. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 22. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 23. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 24. which one of these may result in inconsistent data

A : Concurrent Access

B : Serial Access

C : Locking

D : constraints

Q.no 25. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector

C : InputCollector

D : output

Q.no 26. What are the ACID Properties of transaction?

A : Atomicity, Consistency, Inconsistent, Durability

B : Atomicity, Consistency, Isolation, Durability

C : Atomicity, Consistency, Inconsistent, Database

D : Automatically, Consistency, Inconsistent, Durability

Q.no 27. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 28. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture
C : Three-tier architecture

D : NO-tier architecture

Q.no 29. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 30. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 31. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 32. We can test a given schedule for conflict serializability by constructing a

A : wait for graph

B : precedence graph

C : topological sorting

D : cyclic graph

Q.no 33. In 2PL If a transaction may obtain locks but may not release any locks
then Transaction is in
A : Initial Phase

B : Growing Phase

C : Shrinking Phase

D : Deadlock phase

Q.no 34. W-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 35. Which one of the following is a set of one or more attributes taken
collectively to uniquely identify a record?

A : entity

B : sub key

C : super key

D : foreign key

Q.no 36. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 37. which operation sets the values of all data item updated by the
transaction to the new state

A : redo

B : un do

C : restart

D : abort
Q.no 38. If a transaction has obtained a which of these lock, so that it can read but
cannot write on the item.

A : Shared

B : Exclusive

C : Implicit

D : Explicit

Q.no 39. The COUNT function in SQL returns the number of

A : Values

B : Distinct values

C : Group By

D : Columns

Q.no 40. which executes the Mapper/ Reducer task as a child process in a separate
jvm

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : Task jober

Q.no 41. The business logic of the application says what actions to carry out under
what conditions, is embedded in

A : Multiple servers

B : Multiple clients

C : Transaction server

D : Application server

Q.no 42. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One
C : Many to One

D : Many to Many

Q.no 43. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 44. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 45. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 46. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 47. The attribute that can be divided into other attributes is called

A : Simple Attribute
B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 48. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 49. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 50. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 51. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having
Q.no 52. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 53. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 54. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 55. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 56. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 57. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 58. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 59. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 60. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 1. The normalization form which is based on the transitive dependency is
classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 2. TRUNCATE statement in SQL is a

A : DDL

B : DML

C : DCL

D : TCL

Q.no 3. Which one of these are used to express relationship among relationship

A : Aggregation

B : Generalization

C : Specialization

D : Abstraction

Q.no 4. The all-or-none property is commonly known as

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 5. The concept in normalization of relations which is based on the full

functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 6. How many versions of two phase locking protocol available

A:1

B:2

C:3

D:4

Q.no 7. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 8. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation

Q.no 9. Which of the following is not valid for NoSQL?

A : High performance

B : cross platform

C : Less scalable

D : Document Oriented

Q.no 10. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation
D : Tuple

Q.no 11. Which of the following is not a NoSQL database?

A : SQL Server

B : MongoDB

C : Cassandra

D : DB2

Q.no 12. The collection of information stored in the database at a particular

moment is called

A : Instance

B : Schema

C : table

D : relation

Q.no 13. A relationship may also have attributes called

A : Descriptive Attribute

B : Derived Attribute

C : Relational Attribute

D : domain attribute

Q.no 14. A relation is said to be in 1NF if

A : there is no duplication of data

B : there are no composite attributes in the relation

C : there are only a few composite attributes

D : all attributes are of uniform type

Q.no 15. which of these performance is sustained if the number of CPUs and disks
are increased in proportion to the amount of data

A : Linear scale up

B : Linear speed-up
C : Interference

D : None of the above

Q.no 16. Which of the following partitions the key space?

A : Partitioner

B : Compactor

C : Collector

D : collect

Q.no 17. The possible value associated with every attribute is called

A : Domain

B : Assertion

C : instance

D : Schema

Q.no 18. The relationship associating the weak entity with the identifying entity is
called

A : Identifying Relationship

B : Discriminator

C : specialization

D : Genaralization

Q.no 19. A collection and document in mongoDB is equivlent to which concept

respectively.

A : Table and column

B : Table and row

C : column and row

D : database and table

Q.no 20. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning
B : Query processing

C : Query optimization

D : compilation

Q.no 21. A command to remove a relation from an SQL database

A : Delete table

B : Drop table

C : . Erase table

D : Alter table

Q.no 22. The size of a lock is known as

A : Implicit Lock

B : Explicit Lock

C : Lock Granularity

D : lock size

Q.no 23. Which-one ofthe following statements about normal forms is FALSE?

A : BCNF is stricter than 3 NF

B : Lossless, dependency -preserving decomposition into 3 NF is always possible

C : Loss less, dependency – preserving decomposition into BCNF is always possible

D : Any relation with two attributes is BCNF

Q.no 24. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 25. In case of any shut down during transaction before commit which of the
following statement is done automatically ?
A : view

B : commit

C : rollback

D : Flashback

Q.no 26. When a participating site s1 decides to commit the transaction T upon
receiving the <prepare T> message from the coordinator, it sends which message
to the coordinator site.

A : <prepare T>

B : <commit T>

C : <ready T>

D : <abort T>

Q.no 27. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 28. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 29. which executes the Mapper/ Reducer task as a child process in a separate
jvm.

A : JobTracker

B : TaskTracker

C : TaskScheduler
D : job tasker

Q.no 30. Which of the following in true regarding Referential Integrity?

A : Every primary-key value must match a primary-key value in an associated table

B : Every primary-key value must match a foreign-key value in an associated table

C : Every foreign-key value must match a primary-key value in an associated table

D : Every foreign-key value must match a foreign-key value in an associated table

Q.no 31. Transaction which ensures that the transaction are being executed
successfully.

A : concurrency

B : consistency

C : serialisability

D : non serialiasability

Q.no 32. HDFS works in a which fashion.

A : master-MASTER

B : master-slave

C : worker/slave

D : worker/worker

Q.no 33. which is a classical approach to database design?

A : Left – Right approach

B : Right – Left approach

C : Top – Down approach

D : Bottom – Up approach

Q.no 34. The property which says that No transaction will affect the existence of
any other transaction.

A : Isolation

B : Durability
C : Atomicity

D : seializability

Q.no 35. The attribute name could be structured as an attribute consisting of first
name, middle initial, and last name. This type of attribute is called

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 36. Which of the following is the default Partitioner for Mapreduce?

A : MergePartitioner

B : HashedPartitioner

C : HashPartitioner

D : Hasher

Q.no 37. E-R model uses this symbol to represent weak entity set ?

A : Dotted rectangle

B : Diamond

C : Doubly outlined rectangle

D : Triangle

Q.no 38. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 39. What is the mechanism which guarantees that all database servers
participating in a distributed transaction either all commit or all roll back the
statements in the transaction?

A : Commit
B : Commit transaction

C : Two-phase commit

D : Three-phase commit

Q.no 40. provide a way for your program to select multiple rows of data from the
database and then process each row individually.

A : cursors

B : Triggers

C : process

D : select

Q.no 41. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 42. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 43. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii
D : ii and iv

Q.no 44. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 45. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 46. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 47. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 48. Hadoop is a framework that works with a variety of related tools.
Common cohorts include
A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 49. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 50. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 51. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 52. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 53. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 54. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 55. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 56. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 57. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many
C : many to one

D : Many to many

Q.no 58. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 59. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 60. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 1. A collection of conceptual tool for describing data ,data relation ship
,semantics and consistency is called

A : Data Model

B : Design

C : Package

D : Program

Q.no 2. . Each modification done in database transaction are first recorded into
the
A : Hard drive

B : disk

C : Log

D : Datamart

Q.no 3. In NoSQL databases,mostly data is stored in

A : Central

B : Distributed

C : one server

D : High end server

Q.no 4. A third Normal Form (3 NF) relation should

A : be in 2 NF

B : not have complete key

C : not be 1 NF

D : should not have non-key attributes depend on key attribute

Q.no 5. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 6. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued
Q.no 7. The data present in the database are

A : Interrelated

B : unrelated

C : Complex

D : numerical

Q.no 8. Some of the columns of a relation are at different sites is which of the
following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 9. The process of decomposing larger table to smaller table to avoid

redundancy is called

A : normalization

B : views

C : encapsulation

D : abstraction

Q.no 10. Minimal Superkeys are called

A : Schema keys

B : Candidate keys

C : Domain keys

D : Attribute keys

Q.no 11. A data dictionary is a repository that manages

A : Memory

B : Metadata

C : Spell Checker
D : Data Validator

Q.no 12. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 13. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 14. To delete a particular column in a relation the command used is:

A : UPDATE TABLE

B : TRUNCATE COLUMN

C : ALTER , DROP

D : DELETE COLUMN

Q.no 15. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger

D : Cursor

Q.no 16. If a transaction acquires exclusive lock, then it can perform which
operation.

A : Read

B : Write
C : read and write

D : update

Q.no 17. Which property of a transaction that protect data from system failure

A : Isolation

B : Durability

C : Atomicity

D : serializability

Q.no 18. which of these makes the updates performed by the transaction become
permanent in the database

A : Roll back

B : commit

C : End

D : save

Q.no 19. A database language used for defining the whole database structure and
schema is called :

A : DCL

B : DML

C : DDL

D : DLL

Q.no 20. Which of the following is a NoSQL Database Type?

A : SQL

B : Document databases

C : DB2

D : Maria DB

Q.no 21. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile
B : SequenceFile

C : Putfile

D : sequence

Q.no 22. W-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 23. which of these clause are used to make the tuples display on an sorted
manner

A : sort by

B : order by

C : arrange by

D : Group by

Q.no 24. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager

D : Transaction Manager

Q.no 25. Which of the following is a disadvantage of replication?

A : Reduced network traffic

B : If the database fails at one site, a copy can be located at another site.

C : Each site must have the same storage capacity.

D : Each transaction may proceed without coordination across the network.

Q.no 26. A collection of MongoDB is group of

A : DATABASES

B : Related Doocuments

C : schema

D : rows

Q.no 27. A type of query that is placed within a WHERE or HAVING clause of
another query is called

A : Master query

B : Sub query

C : Super query

D : Multi-query

Q.no 28. In E-R Diagram derived attribute are represented by

A : Ellipse

B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 29. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 30. “Sharding” a database across many server instances can be achieved
with

A : LAN

B : SAN

C : MAN

D : NAN
Q.no 31. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator

D : IS NULL operator

Q.no 32. If any failure occurs the data needs to be restored to a consistent state
that existed prior to the failure is called

A : Atomicity

B : Isolation

C : consistency

D : Integrity

Q.no 33. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 34. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 35. If a transaction has obtained a which of these lock, so that it can read but
cannot write on the item.

A : Shared

B : Exclusive

C : Implicit
D : Explicit

Q.no 36. which executes the Mapper/ Reducer task as a child process in a separate
jvm

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : Task jober

Q.no 37. Maintaining a log for recovery purposes is a responsiblility of

A : Transaction coordinator

B : Transaction manager

C : system manager

D : Database Administrator

Q.no 38. Which is not DDL operation

A : Renaming a table

B : SQL create table

C : Add a column to an existing table

D : Update data into a table in SQL database

Q.no 39. The number of queries that can be processed on average per unit of time
is aclled

A : Throughput

B : Response Time

C : turn around time

D : waiting time

Q.no 40. R-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully
C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 41. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 42. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 43. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 44. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 45. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 46. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 47. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 48. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 49. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition
C : Dependency Preserving

D : Functional Dependency

Q.no 50. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 51. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 52. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 53. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 54. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 55. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 56. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 57. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 58. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One
C : Many to One

D : Many to Many

Q.no 59. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 60. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 1. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 2. The possible value associated with every attribute is called

A : Domain

B : Assertion

C : instance

D : Schema

Q.no 3. The Overall design of the database is called

A : Schema

B : Instance
C : table

D : relation

Q.no 4. How many rules in “CODD’S RULES” of Relational Model of database

systems?

A : 11

B : 12

C : 13

D : 14

Q.no 5. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.

C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 6. A transaction is not allowed to release any lock until it commits is known
as

A : Rigorous Two Phase Locking

B : Strict Two Phase Locking

C : Shrinking Two Phase Locking

D : Binary Lock

Q.no 7. The normalization form which is based on the transitive dependency is

classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 8. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 9. In SQL, which of the following is not a data Manipulation Language

Commands?

A : Delete

B : Select

C : Update

D : Create

Q.no 10. The langusge which enables the users to access or manipulate data

A : DML

B : DDL

C : DCL

D : TCL

Q.no 11. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential

D : key

Q.no 12. Entities are described in a database by a set of

A : Attributes

B : relation

C : Entity set
D : Relationship Set

Q.no 13. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla

Q.no 14. Which one of these are used to express relationship among relationship

A : Aggregation

B : Generalization

C : Specialization

D : Abstraction

Q.no 15. In a distributed database application, if we have very many number of

read only queries than update queries then which allocation technique is
advantageous.

A : Hybrid Fragmentation

B : Horizontal Fragmentation

C : Replication

D : Vertical Fragmentation

Q.no 16. The object that exist in the real world and is distinquishable form other
object is

A : Entity

B : Attribute

C : Property

D : Relationship

Q.no 17. A transaction may not always complete its execution successfully. Such a
transaction is termed

A : Aborted
B : Terminated

C : Closed

D : partial

Q.no 18. Which of the following is not a valid NoSQL database?

A : cassandra

B : mongoDB

C : Postgresql

D : Hbase

Q.no 19. Which statement in SQL allows us to change the definition of a table is

A : ALTER

B : UPDATE

C : CREATE

D : SELECT

Q.no 20. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 21. Which scenario is best suited for NoSQL?

A : When dealing with large data sets.

B : When low level of security is needed.

C : When data retrieval speed can be variable.

D : When providing data integrity.

Q.no 22. All of the following accurately describe Hadoop, EXCEPT:

A : Open source
B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 23. Maximum virtual memory of the launched child-task is specified using

A : mapv

B : mapred

C : mapvim

D : mapr

Q.no 24. Each higher level entity must belong to a lwer level entity

A : Total

B : Overlapping

C : Disjoint

D : partial

Q.no 25. The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE
is

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 26. Transactions are executed one by one without any interleaved
operations from other transactions is known as

A : Serial Schedule

B : Complete Schedule

C : Concurrent Schedule

D : Non-Complete Schedule

Q.no 27. The data that have assosiated time interval during which they are valid
is called
A : Temporal Data

B : Dynamic data

C : Snap Shot data

D : Static Data

Q.no 28. Application program are said to exhibit which of these behaviour if they
do not need to be rewritten if the physical schema changes

A : Data Independence

B : Data Isolation

C : Abstraction

D : Inheritence

Q.no 29. Some highe level entities may not belong to any lower level entity set

A : Partial

B : Complete

C : Overlapping

D : Disjoint

Q.no 30. Which is essentially used to search for patterns in target string.

A : Like Predicate

B : Null Predicate

C : In Predicate

D : Out Predicate

Q.no 31. In case of any shut down during transaction before commit which of the
following statement is done automatically ?

A : view

B : commit

C : rollback

D : Flashback
Q.no 32. The application program interface in the two tier architecture database
management system is provided by the

A : close module connectivity

B : open module connectivity

C : close database connectivity

D : open database connectivity

Q.no 33. An entity belong to no more than one lower level entity set

A : Disjoint

B : Overlapping

C : Complete

D : Partial

Q.no 34. Point out the wrong statement

A : Secondary indices is not available in MongoDB

B : MongoDB supports search by field, range queries, regular expression searches

C : MongoDB can store the business subject in the minimal number of documents

D : MongoDB cannot store images

Q.no 35. which NameNode is used when the Primary NameNode goes down.

A : Rack

B : Data

C : Secondary

D : primary

Q.no 36. In SQL, which of these can be test for the presence of set membership

A : in

B : not in

C : yes

D : like
Q.no 37. Global Wait-for graph is used for

A : Handling concurrency control

B : Handling failures

C : Handling deadlock

D : None of the above

Q.no 38. Which of the following is TRUE?

A : Every relation in 3NF is also in BCNF

B : A relation R is in 3NF if every non-prime attribute of R is fully functionally

dependent on every key of R

C : Every relation in BCNF is also in 3NF

D : No relation can be in both BCNF and 3NF

Q.no 39. which is the process of selecting the most efficient query-evaluation plan
from among the many strategies usually possible for processing a given query,
especially if the query is complex.

A : Permormance tuning

B : Parsing

C : Query optimization

D : compilation

Q.no 40. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 41. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 42. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 43. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer

Q.no 44. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 45. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 46. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 47. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 48. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 49. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 50. which serves as the master and there is only one NameNode per cluster.

A : Data Node
B : NameNode

C : Data block

D : Replication

Q.no 51. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 52. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 53. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 54. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 55. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 56. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many

B : One to One

C : Many to One

D : Many to many

Q.no 57. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 58. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 59. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 60. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 1. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 2. If the attribute of relation schema R is member of some candidate key

then this type of attributes are classified as

A : atomic attribute

B : candidate attribute

C : nonprime attribute

D : prime attribute

Q.no 3. Which ensures that the database remains in a consistent state despites
system failures

A : Transaction Management

B : Query Processor

C : Storage Manager

D : Buffer Manager

Q.no 4. Which SQL command is used to insert a row in a table?

A : Select

B : Create

C : Insert

D : Drop

Q.no 5. A situation where no transaction can proceed with their normal execution
is known as

A : Transaction Abort

B : Transaction Halt

C : Binary Lock

D : Deadlock

Q.no 6. To increase the throughput and response time of the system especially
when there are lots of smaller queries, which type of parallelism is most likely to
perform better?

A : Intra-query parallelism

B : Inter-query parallelism

C : Inter-operation parallelism

D : Intra-operation parallelism

Q.no 7. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 8. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger
D : Cursor

Q.no 9. Which of the following is not the DDL statements

A : Create

B : Drop

C : Alter

D : select

Q.no 10. Every weak entity set can be converted into strong entity set by

A : using generalization

B : adding appropriate attributes

C : using Aggregation

D : Using Specialization

Q.no 11. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 12. which is a specific concurrency problem wherein two transactions

depend on each other for something.

A : phantom read problem

B : transaction read problem

C : deadlock

D : locking

Q.no 13. which stores are used to store information about networks, such as
social connections.

A : Key-value

B : Wide-column
C : Document

D : Graph

Q.no 14. The set of entities of the same type share the same

A : Properties

B : value

C : instance

D : record

Q.no 15. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 16. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database

B : Parallel database

C : Client server database

D : standalone systems

Q.no 17. What is the full form of DDL

A : Dynamic Data Language

B : Detailed Data Language

C : Data Definition Language

D : Data Derivation Language

Q.no 18. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 19. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 20. A relationship may also have attributes called

A : Descriptive Attribute

B : Derived Attribute

C : Relational Attribute

D : domain attribute

Q.no 21. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity

B : Relationship

C : Record

D : Super Key

Q.no 22. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 23. which operation sets the values of all data item updated by the
transaction to the new state
A : redo

B : un do

C : restart

D : abort

Q.no 24. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 25. Which of the following command removes database including its related
components?

A : Drop

B : Delete

C : remove

D : Truncate

Q.no 26. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 27. which cursors are declared and used by the user to process multiple row,
returned by SELECT statement

A : Implicit

B : Explicit

C : External

D : Internal
Q.no 28. The Mapper implementation processes one line at a time via which
method.

A : map

B : reduce

C : mapper

D : reducer

Q.no 29. What is the interactive shell for MongoDB called?

A : mongo

B : mongodb

C : dbmong

D : none of the mentioned

Q.no 30. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 31. E-R model uses this symbol to represent weak entity set ?

A : Dotted rectangle

B : Diamond

C : Doubly outlined rectangle

D : Triangle

Q.no 32. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access
D : Uncontrolled Access

Q.no 33. The real use of the Two-phase commit protocol is

A : Deadlock will not occur

B : Concurrency control can be avoided

C : Atomicity, i.e, all-or-nothing commits at all sites

D : serializability

Q.no 34. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 35. provide a way for your program to select multiple rows of data from the
database and then process each row individually.

A : cursors

B : Triggers

C : process

D : select

Q.no 36. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema

C : NewSQL databases are built to allow the insertion of data without a predefined
schema

D : Vo SQL can hundle unstructured data

Q.no 37. Which of the following is the default Partitioner for Mapreduce?

A : MergePartitioner

B : HashedPartitioner
C : HashPartitioner

D : Hasher

Q.no 38. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 39. which executes the Mapper/ Reducer task as a child process in a separate
jvm.

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : job tasker

Q.no 40. The number of queries that can be processed on average per unit of time
is aclled

A : Throughput

B : Response Time

C : turn around time

D : waiting time

Q.no 41. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 42. which of these constructs in SQL returns the value true if the argument
sub query is non empty
A : exist

B : while

C : where

D : having

Q.no 43. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 44. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 45. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 46. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 47. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 48. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 49. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 50. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 51. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 52. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 53. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 54. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 55. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency
Q.no 56. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 57. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 58. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 59. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 60. The business logic of the application says what actions to carry out under
what conditions, is embedded in

A : Multiple servers

B : Multiple clients
C : Transaction server

D : Application server

Q.no 1. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 2. Some of the columns of a relation are at different sites is which of the
following?

A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 3. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 4. Point out the correct statement.

A : Hadoop do need specialized hardware to process the data

B : Hadoop 2.0 allows live stream processing of real-time data

C : In Hadoop programming framework output files are divided into lines or records

D : Hadoop cannot handle big data

Q.no 5. which of these performance is sustained if the number of CPUs and disks
are increased in proportion to the amount of data

A : Linear scale up
B : Linear speed-up

C : Interference

D : None of the above

Q.no 6. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 7. The concept in normalization of relations which is based on the full

functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 8. Which of the following are the simplest NoSQL databases?

A : Key-value

B : Wide-column

C : Document

D : column based

Q.no 9. A collection of conceptual tool for describing data ,data relation ship
,semantics and consistency is called

A : Data Model

B : Design

C : Package

D : Program

Q.no 10. The term in Key-Value databases are similar to 'Tables' in RDBMS.is
A : Values

B : Keys

C : Buckets

D : Hashing

Q.no 11. Which of the following is not a NoSQL database?

A : SQL Server

B : MongoDB

C : Cassandra

D : DB2

Q.no 12. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 13. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation

Q.no 14. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 15. Which of the following partitions the key space?

A : Partitioner

B : Compactor

C : Collector

D : collect

Q.no 16. The lowest level of abstraction that describes how the data are actually
stored is

A : Physical Level

B : Logical Level

C : View Level

D : user Level

Q.no 17. A Transaction ends

A : only when it is Committed.

B : only when it is Rolled-back

C : when it is Committed or Rolled-back

D : only when it is initialized

Q.no 18. What are the issues motivating parallelism?

A : Increased availability

B : Distributed access to data

C : Analysis of distributed data

D : All of the above

Q.no 19. In two-phase commit (2PC) protocol, who can cause a transaction to
abort?

A : Coordinator

B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 20. Entities are described in a database by a set of

A : Attributes

B : relation

C : Entity set

D : Relationship Set

Q.no 21. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager

D : Transaction Manager

Q.no 22. which operation sets the values of all data item updated by the
transaction to the old values

A : redo

B : un do

C : restart

D : abort

Q.no 23. which is a classical approach to database design?

A : Left – Right approach

B : Right – Left approach

C : Top – Down approach

D : Bottom – Up approach

Q.no 24. The type of server in two-tier architectures which provides the data to
client stored on disk pages is called

A : transaction server

B : functional serve
C : disk server

D : data server

Q.no 25. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 26. View used used for displaying current status of database is

A : system.databases

B : current.databases

C : sys.databases

D : status.databases

Q.no 27. In 2PL If a transaction may obtain locks but may not release any locks
then Transaction is in

A : Initial Phase

B : Growing Phase

C : Shrinking Phase

D : Deadlock phase

Q.no 28. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 29. which one of these database user interact with the system without
writing programs,instead they form the request in database query language

A : Sophisticated user
B : Specialized User

C : Application Progrmer

D : Naive User

Q.no 30. The layer, which provides the interface between the business-logic layer
and the underlying database.

A : Business logic

B : Presentation

C : User interaction

D : Data access

Q.no 31. SQl uses which of these values to indicate the absence of information
about the value of an attribute

A:0

B : NA

C : NULL

D : AB

Q.no 32. What are the ACID Properties of transaction?

A : Atomicity, Consistency, Inconsistent, Durability

B : Atomicity, Consistency, Isolation, Durability

C : Atomicity, Consistency, Inconsistent, Database

D : Automatically, Consistency, Inconsistent, Durability

Q.no 33. Which-one ofthe following statements about normal forms is FALSE?

A : BCNF is stricter than 3 NF

B : Lossless, dependency -preserving decomposition into 3 NF is always possible

C : Loss less, dependency – preserving decomposition into BCNF is always possible

D : Any relation with two attributes is BCNF

Q.no 34. Domain constraints, functional dependency and referential integrity are
special forms of
A : Foreign key

B : Primary key

C : Assertion

D : Referential constraint

Q.no 35. Identify the correct mechanism to ensure the isolation property of a set
of transactions.

A : Recovery manager

B : Concurrency control system

C : Security management system

D : Query optimization techniques

Q.no 36. When a participating site s1 decides to commit the transaction T upon
receiving the <prepare T> message from the coordinator, it sends which message
to the coordinator site.

A : <prepare T>

B : <commit T>

C : <ready T>

D : <abort T>

Q.no 37. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 38. In SQL, which of these can be test for the absence of set membership

A : in

B : not in

C : yes
D : like

Q.no 39. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture

Q.no 40. What is the mechanism which guarantees that all database servers
participating in a distributed transaction either all commit or all roll back the
statements in the transaction?

A : Commit

B : Commit transaction

C : Two-phase commit

D : Three-phase commit

Q.no 41. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 42. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping
Q.no 43. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 44. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 45. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 46. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 47. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 48. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 49. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 50. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 51. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 52. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 53. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 54. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 55. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 56. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one
D : many to many

Q.no 57. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 58. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 59. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 60. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 1. which wizards look at past history of queries and updates (the workload)
and recommend which indices would be best for the workload

A : Schema tuning
B : Hardware tuning

C : Index tuning

D : schema tuning

Q.no 2. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 3. In SQL, which of the following is not a data definition language

commands?

A : RENAME

B : REVOKE

C : GRANT

D : CREATE

Q.no 4. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 5. Three-tier architecture includes which of the following?

A : Three server layers

B : A client layer and two server layers

C : Two client layers and one server layer

D : Three client layers

Q.no 6. A transaction for which all committed changes are permanent is called
A : atomic

B : consistent

C : isolated

D : durable

Q.no 7. Minimal Superkeys are called

A : Schema keys

B : Candidate keys

C : Domain keys

D : Attribute keys

Q.no 8. The process of decomposing larger table to smaller table to avoid

redundancy is called

A : normalization

B : views

C : encapsulation

D : abstraction

Q.no 9. Boye Codd Normal Form (BCNF) is needed when

A : two non-key attributes are dependent

B : there is more then one possible composite key

C : there are two or more possible composite overlapping keys and one attribute of a
composite key is dependent on an attribute of another composite key

D : there are two possible keys and they are dependent on one another

Q.no 10. TRUNCATE statement in SQL is a

A : DDL

B : DML

C : DCL

D : TCL
Q.no 11. Which of the following helps in implementing inter-operation
parallelism?

A : Interdependent parallelism

B : Intra-query parallelism

C : Inter-query parallelism

D : Pipelined parallelism

Q.no 12. Which of the following is used for the MapReduce job Tracker node?

A : mradmin

B : tasktracker

C : jobtracker

D : node tracker

Q.no 13. What is the full form of DDL

A : Dynamic Data Language

B : Detailed Data Language

C : Data Definition Language

D : Data Derivation Language

Q.no 14. In ER diagram ,the primary keys are

A : Underlined

B : Bold

C : Stiked out

D : Italaized

Q.no 15. If a transaction acquires a shared lock, then it can perform which of
these operation.

A : read

B : write

C : read and write

D : update

Q.no 16. Every weak entity set can be converted into strong entity set by

A : using generalization

B : adding appropriate attributes

C : using Aggregation

D : Using Specialization

Q.no 17. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 18. Referential integrity constraints is base on the concept of

A : Primary Key

B : Foreign key

C : uniqueness

D : normalization

Q.no 19. A relation is said to be in 1NF if

A : there is no duplication of data

B : there are no composite attributes in the relation

C : there are only a few composite attributes

D : all attributes are of uniform type

Q.no 20. Which of the following is a NoSQL Database Type?

A : SQL

B : Document databases

C : DB2
D : Maria DB

Q.no 21. Transactions are executed one by one without any interleaved
operations from other transactions is known as

A : Serial Schedule

B : Complete Schedule

C : Concurrent Schedule

D : Non-Complete Schedule

Q.no 22. Which of the following parallel database architectures is/are mainly used
by distributed database system?

A : Shared Memory

B : Shared Disk

C : Hierarchical

D : Shared Nothing

Q.no 23. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 24. which of these clause are used to make the tuples display on an sorted
manner

A : sort by

B : order by

C : arrange by

D : Group by

Q.no 25. Which statement about triggers is true

A : You use an application trigger to fire when a DELETE statement occurs.

B : You use a database trigger to fire when an INSERT statement occurs.

C : You use a system event trigger to fire when an UPDATE statement occurs.

D : You use INSTEAD OF trigger to fire when a SELECT statement occurs.

Q.no 26. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 27. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 28. Application program are said to exhibit which of these behaviour if they
do not need to be rewritten if the physical schema changes

A : Data Independence

B : Data Isolation

C : Abstraction

D : Inheritence

Q.no 29. In SQL, which of these can be test for the presence of set membership

A : in

B : not in

C : yes

D : like

Q.no 30. The size of a lock is known as

A : Implicit Lock
B : Explicit Lock

C : Lock Granularity

D : lock size

Q.no 31. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 32. Which of the following is TRUE?

A : Every relation in 3NF is also in BCNF

B : A relation R is in 3NF if every non-prime attribute of R is fully functionally

dependent on every key of R

C : Every relation in BCNF is also in 3NF

D : No relation can be in both BCNF and 3NF

Q.no 33. In two-tier client ⁄ server architecture, the running of application

programs and the user interface programs is in control of

A : modulation side

B : client side

C : server side

D : host side

Q.no 34. In E-R Diagram derived attribute are represented by

A : Ellipse

B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 35. The number of queries that can be processed on average per unit of time
is aclled
A : Throughput

B : Response Time

C : turn around time

D : waiting time

Q.no 36. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority

C : disc

D : diq

Q.no 37. In the three-tier architecture, the intermediate layer between database
and client servers is classified as

A : functional server

B : transaction server

C : application server

D : disk server

Q.no 38. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 39. A logical description of some portion of database that is required by a

user to perform task is called as

A : System View

B : User View

C : Logical View

D : Data View
Q.no 40. which is the primary interface for a user to describe a MapReduce job to
the Hadoop framework for execution.

A : JobConfig

B : JobConf

C : JobConfiguration

D : job

Q.no 41. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 42. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 43. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 44. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 45. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 46. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 47. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 48. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER
Q.no 49. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 50. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 51. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 52. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 53. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit
C : InputSplitStream

D : All of the mentioned

Q.no 54. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 55. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 56. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 57. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 58. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher
A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 59. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 60. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 1. The normalization form which is based on the transitive dependency is

classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 2. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 3. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 4. which of these makes the updates performed by the transaction become
permanent in the database

A : Roll back

B : commit

C : End

D : save

Q.no 5. If a transaction acquires exclusive lock, then it can perform which

operation.

A : Read

B : Write

C : read and write

D : update

Q.no 6. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.

C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 7. which of these performance is sustained if the number of CPUs and disks
are increased in proportion to the amount of data

A : Linear scale up
B : Linear speed-up

C : Interference

D : None of the above

Q.no 8. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database

B : Parallel database

C : Client server database

D : standalone systems

Q.no 9. Data Redundancy may lead to

A : Inconsistency

B : Failure

C : isolation

D : consistency

Q.no 10. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 11. Following represent coloumn in No SQL

A : Document

B : Collection

C : Database

D : Field

Q.no 12. A distributed database has which of the following advantages over a
centralized database?
A : Software cost

B : Software complexity

C : Slow Response

D : Modular growth

Q.no 13. which stores are used to store information about networks, such as
social connections.

A : Key-value

B : Wide-column

C : Document

D : Graph

Q.no 14. The level of abstraction that describes what data are stored in the
database

A : Logical Level

B : Physical Level

C : View Level

D : user Level

Q.no 15. An Entity set which do not have sufficient attributes to form a primary
key is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 16. Which of the following is not a valid NoSQL database?

A : cassandra

B : mongoDB

C : Postgresql

D : Hbase
Q.no 17. The all-or-none property is commonly known as

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 18. The core principal of NOSQL is

A : High availability

B : High concurrency

C : High Consistency

D : High Atomicity

Q.no 19. Which one of these are used to express relationship among relationship

A : Aggregation

B : Generalization

C : Specialization

D : Abstraction

Q.no 20. A database language used for defining the whole database structure and
schema is called :

A : DCL

B : DML

C : DDL

D : DLL

Q.no 21. All of the following accurately describe Hadoop, EXCEPT:

A : Open source

B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 22. The procedure of storing higher normal form relations which are in
lower normal form as a base relation is classified as

A : isolation of data

B : de-normalization of data

C : normalization of data

D : denomination of data

Q.no 23. Which scenario is best suited for NoSQL?

A : When dealing with large data sets.

B : When low level of security is needed.

C : When data retrieval speed can be variable.

D : When providing data integrity.

Q.no 24. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond

Q.no 25. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 26. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 27. What is the interactive shell for MongoDB called?

A : mongo

B : mongodb

C : dbmong

D : none of the mentioned

Q.no 28. A type of query that is placed within a WHERE or HAVING clause of
another query is called

A : Master query

B : Sub query

C : Super query

D : Multi-query

Q.no 29. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 30. Which of the following can be a multivalued attribute?

A : phone number

B : Date

C : Date of Birth

D : age

Q.no 31. which of these allow us to identify uniquely a tuple in the relation.

A : Superkey

B : Domain
C : Attribute

D : Schema

Q.no 32. Global Wait-for graph is used for

A : Handling concurrency control

B : Handling failures

C : Handling deadlock

D : None of the above

Q.no 33. which executes the Mapper/ Reducer task as a child process in a separate
jvm

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : Task jober

Q.no 34. what does NoSQL databases supportt to get high availability and disaster
recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 35. HDFS is implemented in which programming language.

A : C++

B : java

C : python

D:C

Q.no 36. HDFS works in a which fashion.

A : master-MASTER
B : master-slave

C : worker/slave

D : worker/worker

Q.no 37. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 38. All tuples in the relation are assigned null as the value for the new
attribute, in the

A : Alter Command

B : Select Command

C : Delete Command

D : Create Command

Q.no 39. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema

C : NewSQL databases are built to allow the insertion of data without a predefined
schema

D : Vo SQL can hundle unstructured data

Q.no 40. which one of these may result in inconsistent data

A : Concurrent Access

B : Serial Access

C : Locking

D : constraints
Q.no 41. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 42. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation

A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 43. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 44. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key
Q.no 45. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 46. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 47. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 48. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 49. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 50. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 51. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 52. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 53. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 54. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 55. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 56. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer

Q.no 57. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 58. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 59. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 60. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 1. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 2. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 3. Which of the following is not valid for NoSQL?

A : High performance

B : cross platform
C : Less scalable

D : Document Oriented

Q.no 4. Normalization is a process of restructuring a relation to

A : minimize duplication of data in a database

B : maximize duplication of data to ensure reliability

C : make it of uniform size

D : allow addition of data

Q.no 5. In NoSQL databases,mostly data is stored in

A : Central

B : Distributed

C : one server

D : High end server

Q.no 6. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation

Q.no 7. When a transaction completes the execution of its final statement, it

enters a state. What is the name of this state?

A : Partially Committed state

B : Committed state

C : Failed state

D : Aborted State

Q.no 8. A relationship may also have attributes called

A : Descriptive Attribute
B : Derived Attribute

C : Relational Attribute

D : domain attribute

Q.no 9. Which SQL command is used to insert a row in a table?

A : Select

B : Create

C : Insert

D : Drop

Q.no 10. The object that exist in the real world and is distinquishable form other
object is

A : Entity

B : Attribute

C : Property

D : Relationship

Q.no 11. The term in Key-Value databases are similar to 'Tables' in RDBMS.is

A : Values

B : Keys

C : Buckets

D : Hashing

Q.no 12. Which statement in SQL allows us to change the definition of a table is

A : ALTER

B : UPDATE

C : CREATE

D : SELECT

Q.no 13. To delete a particular column in a relation the command used is:

A : UPDATE TABLE
B : TRUNCATE COLUMN

C : ALTER , DROP

D : DELETE COLUMN

Q.no 14. which is used to recreate if trigger already exists.

A : Cursor

B : Trigger

C : Keywords

D : Replace

Q.no 15. A collection and document in mongoDB is equivlent to which concept

respectively.

A : Table and column

B : Table and row

C : column and row

D : database and table

Q.no 16. Which of the following is a wide-column store?

A : Cassandra

B : Riak

C : MongoDB

D : Redis

Q.no 17. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential

D : key

Q.no 18. which of these attributes can be divided into sub parts
A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 19. In SQL, which of the following is not a data Manipulation Language
Commands?

A : Delete

B : Select

C : Update

D : Create

Q.no 20. which wizards look at past history of queries and updates (the workload)
and recommend which indices would be best for the workload

A : Schema tuning

B : Hardware tuning

C : Index tuning

D : schema tuning

Q.no 21. The Mapper implementation processes one line at a time via which
method.

A : map

B : reduce

C : mapper

D : reducer

Q.no 22. which is the process of selecting the most efficient query-evaluation plan
from among the many strategies usually possible for processing a given query,
especially if the query is complex.

A : Permormance tuning

B : Parsing

C : Query optimization
D : compilation

Q.no 23. which is the primary interface for a user to describe a MapReduce job to
the Hadoop framework for execution.

A : JobConfig

B : JobConf

C : JobConfiguration

D : job

Q.no 24. Transaction which ensures that the transaction are being executed
successfully.

A : concurrency

B : consistency

C : serialisability

D : non serialiasability

Q.no 25. In two-tier client ⁄ server architecture, the running of application

programs and the user interface programs is in control of

A : modulation side

B : client side

C : server side

D : host side

Q.no 26. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 27. The data that have assosiated time interval during which they are valid
is called

A : Temporal Data
B : Dynamic data

C : Snap Shot data

D : Static Data

Q.no 28. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture

Q.no 29. Maximum virtual memory of the launched child-task is specified using

A : mapv

B : mapred

C : mapvim

D : mapr

Q.no 30. We can test a given schedule for conflict serializability by constructing a

A : wait for graph

B : precedence graph

C : topological sorting

D : cyclic graph

Q.no 31. Which is essentially used to search for patterns in target string.

A : Like Predicate

B : Null Predicate

C : In Predicate

D : Out Predicate

Q.no 32. Which is not DDL operation

A : Renaming a table

B : SQL create table

C : Add a column to an existing table

D : Update data into a table in SQL database

Q.no 33. In case of any shut down during transaction before commit which of the
following statement is done automatically ?

A : view

B : commit

C : rollback

D : Flashback

Q.no 34. which NameNode is used when the Primary NameNode goes down.

A : Rack

B : Data

C : Secondary

D : primary

Q.no 35. The application server in a three-tier architecture, communicates with a

database system to access

A : Data

B : Query

C : Compiler

D : Retrieval

Q.no 36. Which one of these in ER can be used to represent relationship among
relationship

A : Inheritence

B : Specialization

C : Generalization

D : Aggregation
Q.no 37. A set of one or more attributes that are taken collectively to identify the
entity in an entity set is called

A : Entity

B : Relationship

C : Record

D : Super Key

Q.no 38. Each higher level entity must belong to a lwer level entity

A : Total

B : Overlapping

C : Disjoint

D : partial

Q.no 39. E-R model uses this symbol to represent weak entity set ?

A : Dotted rectangle

B : Diamond

C : Doubly outlined rectangle

D : Triangle

Q.no 40. Which of the following is a comparison operator in SQL?

A : Double equal sign

B : like

C : BETWEEN

D : Single equal sign

Q.no 41. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl
D : Time stamp

Q.no 42. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation

C : Generalization

D : Inheritence

Q.no 43. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 44. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 45. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 46. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.
A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 47. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 48. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 49. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 50. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 51. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 52. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 53. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 54. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 55. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer

A : One to many

B : One to One
C : Many to One

D : Many to many

Q.no 56. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 57. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 58. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 59. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write
Q.no 60. Normalization of database is essential to i. avoid accidental deletion of
required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 1. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 2. Which normal form is considered adequate for normal relational

database design?

A : 2NF

B : 3NF

C : 4NF

D : BCNF

Q.no 3. What is the full form of DDL

A : Dynamic Data Language

B : Detailed Data Language

C : Data Definition Language

D : Data Derivation Language

Q.no 4. TRUNCATE statement in SQL is a

A : DDL
B : DML

C : DCL

D : TCL

Q.no 5. Some of the columns of a relation are at different sites is which of the
following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 6. The highest level of abstraction that describes only part of the entire
database

A : View Level

B : Physical Level

C : Logical Level

D : Conceptal Level

Q.no 7. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 8. A third Normal Form (3 NF) relation should

A : be in 2 NF

B : not have complete key

C : not be 1 NF

D : should not have non-key attributes depend on key attribute

Q.no 9. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 10. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 11. A homogeneous distributed database is which of the following?

A : The same DBMS is used at each location and data are not distributed across all
nodes.

B : The same DBMS is used at each location and data are distributed across all nodes.

C : A different DBMS is used at each location and data are not distributed across all
nodes

D : A different DBMS is used at each location and data are distributed across all nodes.

Q.no 12. A relation is said to be in BCNF when

A : it has overlapping composite keys

B : it has no composite keys

C : it has no multivalued dependencies

D : it has no overlapping composite keys which have related attributes

Q.no 13. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla
Q.no 14. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 15. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 16. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 17. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 18. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated
Q.no 19. Boye Codd Normal Form (BCNF) is needed when

A : two non-key attributes are dependent

B : there is more then one possible composite key

C : there are two or more possible composite overlapping keys and one attribute of a
composite key is dependent on an attribute of another composite key

D : there are two possible keys and they are dependent on one another

Q.no 20. The Overall design of the database is called

A : Schema

B : Instance

C : table

D : relation

Q.no 21. Aggregate functions takes a collection of values as input and returns how
many values as output

A:1

B:2

C : more than 1

D:0

Q.no 22. W-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 23. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator
D : IS NULL operator

Q.no 24. Which one of these is a program module that provides the interface
between the low level data stored in the database and the application programa
and queries submitted to the system

A : Storage Manager

B : Query Processor

C : Buffer Manager

D : Transaction Manager

Q.no 25. The COUNT function in SQL returns the number of

A : Values

B : Distinct values

C : Group By

D : Columns

Q.no 26. The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE
is

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 27. Which of the following is TRUE?

A : Every relation in 3NF is also in BCNF

B : A relation R is in 3NF if every non-prime attribute of R is fully functionally

dependent on every key of R

C : Every relation in BCNF is also in 3NF

D : No relation can be in both BCNF and 3NF

Q.no 28. which operation sets the values of all data item updated by the
transaction to the new state

A : redo
B : un do

C : restart

D : abort

Q.no 29. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 30. Which is a bottom-up approach to database design that design by

examining the relationship between attributes:

A : Functional dependency

B : Database modeling

C : Normalization

D : Decomposition

Q.no 31. which one of these is not correct

A : ER is an conceptual Data model

B : we cannot create a table without a primary key

C : An attribute of an entity can have more than one value

D : DBMS avoids Data redundancy

Q.no 32. Which of the following is not one of the stages in the evolution of
distributed DBMS?

A : Unit of work

B : Remote unit of work

C : Distributed unit of Work

D : Distributed request
Q.no 33. In the three-tier architecture, the intermediate layer between database
and client servers is classified as

A : functional server

B : transaction server

C : application server

D : disk server

Q.no 34. A collection of MongoDB is group of

A : DATABASES

B : Related Doocuments

C : schema

D : rows

Q.no 35. The Phenomenon in which a single transaction failure leads to a series of
transaction roll back is called

A : cascading roll back

B : abot

C : redundant failue

D : cascadeless schedule

Q.no 36. The constraint in which the database user assigns an entity to lower level
entityset rather using an membership constraint is called

A : Condition defined

B : user defined

C : system Defined

D : software defined

Q.no 37. In wich normal form, a composite attribute is converted to individual

attributes

A : 1NF

B : 2NF
C : 3NF

D : BCNF

Q.no 38. The form of dependency in which the set of attributes that are neither a
subset of any of the keys nor the candidate key is classified as

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 39. If one attribute is determinant of second, which in turn is determinant of

third, then the relation cannot be:

A : well structured

B : 1NF

C : 2NF

D : 3NF

Q.no 40. SQl uses which of these values to indicate the absence of information
about the value of an attribute

A:0

B : NA

C : NULL

D : AB

Q.no 41. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 42. for a binary many to one or one to many relationship set which of these
is true
A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 43. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 44. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 45. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 46. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 47. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 48. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 49. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 50. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 51. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 52. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 53. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 54. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 55. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND
D : REMAINDER

Q.no 56. each book has exactly one publisher but each publisher can publish
many books.What is the relation between Book and Pubisher

A : Many to one

B : One to One

C : Many to One

D : Many to Many

Q.no 57. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 58. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 59. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 60. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation
A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 1. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 2. The normalization form which is based on the transitive dependency is

classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 3. If a transaction obtains an exclusive lock on a row, it means that the

transaction wants to

A : select

B : update

C : view

D : read

Q.no 4. Which SQL command is used to insert a row in a table?

A : Select

B : Create

C : Insert

D : Drop
Q.no 5. Which of the following is used for the MapReduce job Tracker node?

A : mradmin

B : tasktracker

C : jobtracker

D : node tracker

Q.no 6. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 7. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 8. A data dictionary is a repository that manages

A : Memory

B : Metadata

C : Spell Checker

D : Data Validator

Q.no 9. Which of the following is not a NoSQL database?

A : SQL Server

B : MongoDB

C : Cassandra

D : DB2
Q.no 10. which DBMS distributes data processing tasks between the workstation
and a network server.

A : Network

B : Relational

C : Client Server

D : Hierarchical

Q.no 11. Point out the correct statement.

A : Hadoop do need specialized hardware to process the data

B : Hadoop 2.0 allows live stream processing of real-time data

C : In Hadoop programming framework output files are divided into lines or records

D : Hadoop cannot handle big data

Q.no 12. If a transaction acquires a shared lock, then it can perform which of
these operation.

A : read

B : write

C : read and write

D : update

Q.no 13. In NoSQL databases,mostly data is stored in

A : Central

B : Distributed

C : one server

D : High end server

Q.no 14. Which of the following is true concerning a global transaction?

A : The required data are at one local site and the distributed DBMS routes requests as
necessary.

B : The required data are located in at least one nonlocal site and the distributed DBMS
routes requests as necessary.
C : The required data are at one local site and the distributed DBMS passes the request
to only the local DBMS.

D : he required data are located in at least one nonlocal site and the distributed DBMS
passes the request to only the local DBMS.

Q.no 15. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 16. Referential integrity constraints is base on the concept of

A : Primary Key

B : Foreign key

C : uniqueness

D : normalization

Q.no 17. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 18. How many versions of two phase locking protocol available

A:1

B:2

C:3

D:4

Q.no 19. A transaction is not allowed to release any lock until it commits is known
as
A : Rigorous Two Phase Locking

B : Strict Two Phase Locking

C : Shrinking Two Phase Locking

D : Binary Lock

Q.no 20. CAP stands for

A : Consistency, Availability and Partition Tolerance

B : Consistency,atomicity, Partition Tolerance

C : concurrency, Availability and Partition Tolerance

D : concurrency, Atomicity and Partition Tolerance

Q.no 21. In case of any shut down during transaction before commit which of the
following statement is done automatically ?

A : view

B : commit

C : rollback

D : Flashback

Q.no 22. In SQL, which of these can be test for the absence of set membership

A : in

B : not in

C : yes

D : like

Q.no 23. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector

C : InputCollector

D : output
Q.no 24. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 25. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 26. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 27. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 28. What do you mean by one to many relationship between Teacher and
Class table?

A : One class may have many teachers

B : One teacher can have many classes

C : Many classes may have many teachers

D : Many teachers may have many classes

Q.no 29. Which of the following is the default Partitioner for Mapreduce?

A : MergePartitioner

B : HashedPartitioner

C : HashPartitioner

D : Hasher

Q.no 30. A logical description of some portion of database that is required by a

user to perform task is called as

A : System View

B : User View

C : Logical View

D : Data View

Q.no 31. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 32. The property of normalization of relations which guarantees that

functional dependencies are represented in separate relations after
decomposition is classified as

A : nonadditive join property

B : independency reservation property

C : dependency preservation property

D : additive join property

Q.no 33. In SQL, which of these can be test for the presence of set membership

A : in

B : not in
C : yes

D : like

Q.no 34. An entity belong to no more than one lower level entity set

A : Disjoint

B : Overlapping

C : Complete

D : Partial

Q.no 35. R-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 36. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 37. Some highe level entities may not belong to any lower level entity set

A : Partial

B : Complete

C : Overlapping

D : Disjoint

Q.no 38. What are the ACID Properties of transaction?

A : Atomicity, Consistency, Inconsistent, Durability

B : Atomicity, Consistency, Isolation, Durability

C : Atomicity, Consistency, Inconsistent, Database

D : Automatically, Consistency, Inconsistent, Durability

Q.no 39. In E-R Diagram derived attribute are represented by

A : Ellipse

B : Dashed ellipse

C : Rectangle

D : Triangle

Q.no 40. NoSQL databases is used mainly for handling large volumes of

A : unstructured

B : structured

C : Tabular

D : relational

Q.no 41. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many

Q.no 42. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 43. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then
A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 44. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 45. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 46. A 3 NF relation is converted to BCNF by

A : removing composite keys

B : removing multivalued dependencies

C : dependent attributes of overlapping composite keys are put in a separate

relation

D : dependent non-key attributes are put in a separate table

Q.no 47. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one
D : many to many

Q.no 48. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 49. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 50. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer

Q.no 51. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 52. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization
B : Aggregation

C : Generalization

D : Inheritence

Q.no 53. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 54. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 55. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 56. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition

B : Run Situation

C : Concurrent Access

D : invalid

Q.no 57. The situation in which a transaction holds a data item and waits for the
release of data item held by some other transaction, which in turn waits for
another transaction, is called

A : serializable schedule

B : process waiting

C : concurrency

D : deadlock

Q.no 58. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 59. if queries are issued at one or more nodes.a distributed transaction can
be

A : fully read-only

B : partially read-only

C : fully read-write

D : partially read-write

Q.no 60. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 1. Which of the following are the simplest NoSQL databases?

A : Key-value

B : Wide-column

C : Document
D : column based

Q.no 2. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 3. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 4. which stores are used to store information about networks, such as social
connections.

A : Key-value

B : Wide-column

C : Document

D : Graph

Q.no 5. Which of the following is not a parallel database architecture

A : Shared memory

B : Shared processor

C : Shared Disk

D : Shared nothing

Q.no 6. The process of decomposing larger table to smaller table to avoid

redundancy is called

A : normalization

B : views
C : encapsulation

D : abstraction

Q.no 7. A collection and document in mongoDB is equivlent to which concept

respectively.

A : Table and column

B : Table and row

C : column and row

D : database and table

Q.no 8. In SQL, which of the following is not a data definition language

commands?

A : RENAME

B : REVOKE

C : GRANT

D : CREATE

Q.no 9. Command that is used to add attributes to an existing relation, is said to

be

A : Alter

B : Modify

C : Tailor

D : Eliminate

Q.no 10. The lowest level of abstraction that describes how the data are actually
stored is

A : Physical Level

B : Logical Level

C : View Level

D : user Level

Q.no 11. Which one is not a NoSQl data model?

A : Client Server

B : Key Value store

C : Column store

D : Document store

Q.no 12. In two-phase commit (2PC) protocol, who can cause a transaction to
abort?

A : Coordinator

B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 13. The all-or-none property is commonly known as

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 14. Which of the following is not an out of the box feature of NoSQL?

A : Big Data

B : Availability

C : Flexibility

D : Elastic Scaling

Q.no 15. A homogeneous distributed database is which of the following?

A : The same DBMS is used at each location and data are not distributed across all
nodes.

B : The same DBMS is used at each location and data are distributed across all nodes.

C : A different DBMS is used at each location and data are not distributed across all
nodes

D : A different DBMS is used at each location and data are distributed across all nodes.
Q.no 16. Which of the following is not Modification of the Database

A : Deletion

B : Insertion

C : Sorting

D : Updating

Q.no 17. Which of the follow is not the degree of relationship?

A : Single

B : Binary

C : Ternary

D : N-array

Q.no 18. An Entity set which do not have sufficient attributes to form a primary
key is called

A : Weak Entity

B : Identifying Entity

C : strong Entity

D : dependent Entity

Q.no 19. Which command allows the removal of all rows from a table but flushes
a table more efficiently since no rollback information is retained:

A : TRUNCATE command

B : Create command

C : Drop table command

D : Alter table command

Q.no 20. Which of the following helps in implementing inter-operation

parallelism?

A : Interdependent parallelism

B : Intra-query parallelism

C : Inter-query parallelism
D : Pipelined parallelism

Q.no 21. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 22. The real use of the Two-phase commit protocol is

A : Deadlock will not occur

B : Concurrency control can be avoided

C : Atomicity, i.e, all-or-nothing commits at all sites

D : serializability

Q.no 23. The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE
is

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 24. which is a classical approach to database design?

A : Left – Right approach

B : Right – Left approach

C : Top – Down approach

D : Bottom – Up approach

Q.no 25. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority
C : disc

D : diq

Q.no 26. If a transaction has obtained a which of these lock, so that it can read but
cannot write on the item.

A : Shared

B : Exclusive

C : Implicit

D : Explicit

Q.no 27. Which statement about triggers is true

A : You use an application trigger to fire when a DELETE statement occurs.

B : You use a database trigger to fire when an INSERT statement occurs.

C : You use a system event trigger to fire when an UPDATE statement occurs.

D : You use INSTEAD OF trigger to fire when a SELECT statement occurs.

Q.no 28. which cursors are declared and used by the user to process multiple row,
returned by SELECT statement

A : Implicit

B : Explicit

C : External

D : Internal

Q.no 29. The virtual table that its created by data from the result of an SQL Select
statement is called

A : View

B : Synonym

C : Sequence

D : Transaction

Q.no 30. The execution sequences in concurrency control is known as

A : Serializability
B : Schedules

C : Organizations

D : Timetable

Q.no 31. The layer, which provides the interface between the business-logic layer
and the underlying database.

A : Business logic

B : Presentation

C : User interaction

D : Data access

Q.no 32. Supporting interquery parallelism is more complicated in

A : Shared Memory

B : shared disk

C : shared nothing

D : shared disk and shared nothing

Q.no 33. Which of the following command removes database including its related
components?

A : Drop

B : Delete

C : remove

D : Truncate

Q.no 34. The attribute name could be structured as an attribute consisting of first
name, middle initial, and last name. This type of attribute is called

A : Simple Attribute

B : Composite Attribute

C : Multivalued

D : Derived Attribute

Q.no 35. Which is essentially used to search for patterns in target string.
A : Like Predicate

B : Null Predicate

C : In Predicate

D : Out Predicate

Q.no 36. All tuples in the relation are assigned null as the value for the new
attribute, in the

A : Alter Command

B : Select Command

C : Delete Command

D : Create Command

Q.no 37. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 38. which one of these database user interact with the system without
writing programs,instead they form the request in database query language

A : Sophisticated user

B : Specialized User

C : Application Progrmer

D : Naive User

Q.no 39. The application program interface in the two tier architecture database
management system is provided by the

A : close module connectivity

B : open module connectivity

C : close database connectivity

D : open database connectivity

Q.no 40. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 41. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 42. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 43. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 44. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger
Q.no 45. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 46. What is the aim of NoSQL?

A : NoSQL provide alternative to SQL databases to store textual data.

B : NoSQL are not suitable for storing structured data.

C : NoSQL databases allow storing non-structured data.

D : NoSQL is a new data format to store large datasets.

Q.no 47. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 48. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 49. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation
A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 50. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 51. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 52. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 53. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie
D : None of the mentioned

Q.no 54. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 55. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 56. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 57. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 58. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job
A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 59. In which type of the constraint lower -level entity sets, memebership is
evaluated on the basis of whether or not an entity satisfy the explicit condition

A : condition defined

B : user defined

C : disjoint

D : Overlapping

Q.no 60. The business logic of the application says what actions to carry out under
what conditions, is embedded in

A : Multiple servers

B : Multiple clients

C : Transaction server

D : Application server

Q.no 1. . Each modification done in database transaction are first recorded into
the

A : Hard drive

B : disk

C : Log

D : Datamart

Q.no 2. Which statement in SQL allows us to change the definition of a table is

A : ALTER

B : UPDATE

C : CREATE

D : SELECT
Q.no 3. Some of the columns of a relation are at different sites is which of the
following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 4. A transaction is not allowed to release any lock until it commits is known
as

A : Rigorous Two Phase Locking

B : Strict Two Phase Locking

C : Shrinking Two Phase Locking

D : Binary Lock

Q.no 5. Which ensures that the database remains in a consistent state despites
system failures

A : Transaction Management

B : Query Processor

C : Storage Manager

D : Buffer Manager

Q.no 6. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential

D : key

Q.no 7. which is used to recreate if trigger already exists.

A : Cursor

B : Trigger
C : Keywords

D : Replace

Q.no 8. Execution of transaction in isolation preserves the

A : Atomicity

B : Consistency

C : Durability

D : concurrency

Q.no 9. The relationship associating the weak entity with the identifying entity is
called

A : Identifying Relationship

B : Discriminator

C : specialization

D : Genaralization

Q.no 10. How many rules in “CODD’S RULES” of Relational Model of database
systems?

A : 11

B : 12

C : 13

D : 14

Q.no 11. The number of Entities associated with the relationship determine the

A : Cardinality of a relationship

B : Dependency of a relationship

C : Degree of a relationship

D : Participation of a relationship

Q.no 12. If a transaction obtains an exclusive lock on a row, it means that the
transaction wants to

A : select
B : update

C : view

D : read

Q.no 13. Which property of a transaction that protect data from system failure

A : Isolation

B : Durability

C : Atomicity

D : serializability

Q.no 14. Which of the following sorting is not supported by MongoDB ?

A : collation

B : collection

C : heap

D : binary

Q.no 15. Storing a separate copy of the database at multiple locations is which of
the following?

A : Data Replication

B : Horizontal Partitioning

C : Vertical Partitioning

D : Horizontal and Vertical Partitioning

Q.no 16. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 17. The Overall design of the database is called

A : Schema
B : Instance

C : table

D : relation

Q.no 18. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 19. The highest level of abstraction that describes only part of the entire
database

A : View Level

B : Physical Level

C : Logical Level

D : Conceptal Level

Q.no 20. What are the issues motivating parallelism?

A : Increased availability

B : Distributed access to data

C : Analysis of distributed data

D : All of the above

Q.no 21. Given the basic ER and relational models, which of the following is
INCORRECT?

A : An attribute of an entity can have more than one value

B : An attribute of an entity can be composite

C : In a row of a relational table an attribute can have more than one value

D : In a row of a relational table, an attribute can have exactly one value or a NULL
value
Q.no 22. In wich normal form, a composite attribute is converted to individual
attributes

A : 1NF

B : 2NF

C : 3NF

D : BCNF

Q.no 23. The Mapper implementation processes one line at a time via which
method.

A : map

B : reduce

C : mapper

D : reducer

Q.no 24. Which of the following methods requires three phase for control
concurrency

A : Timestamp Method

B : Two Phase Locking Method

C : Binary Locking Method

D : Optimistic Method

Q.no 25. Scheduler ensures that

A : Improve Consistency

B : Durability of Transaction

C : CPU is utilized in efficient way

D : Atomicity of transaction

Q.no 26. Transactions T1 and T2 concurrently perform some operations on the

same data item and at least one of them is write operation then these transaction
known as

A : Conflicting

B : Overwriting
C : Non-Conflicting

D : inefficient

Q.no 27. HDFS is implemented in which programming language.

A : C++

B : java

C : python

D:C

Q.no 28. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 29. The technique that controls the interaction between more than one
executing transactions is known as

A : Multitasking technique

B : Serialization technique

C : Schedule technique

D : Concurrency control technique

Q.no 30. which NameNode is used when the Primary NameNode goes down.

A : Rack

B : Data

C : Secondary

D : primary

Q.no 31. The number of queries that can be processed on average per unit of time
is aclled

A : Throughput
B : Response Time

C : turn around time

D : waiting time

Q.no 32. Maintaining a log for recovery purposes is a responsiblility of

A : Transaction coordinator

B : Transaction manager

C : system manager

D : Database Administrator

Q.no 33. Which one of the following is a set of one or more attributes taken
collectively to uniquely identify a record?

A : entity

B : sub key

C : super key

D : foreign key

Q.no 34. Transactions are executed one by one without any interleaved
operations from other transactions is known as

A : Serial Schedule

B : Complete Schedule

C : Concurrent Schedule

D : Non-Complete Schedule

Q.no 35. which has the world’s largest Hadoop cluster.

A : Project Prism

B : Prism

C : Project Big

D : Project Data

Q.no 36. Which of the following is a comparison operator in SQL?

A : Double equal sign

B : like

C : BETWEEN

D : Single equal sign

Q.no 37. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture

Q.no 38. which constraints define the set of value for the attribute

A : Domain

B : Entity

C : referential

D : key

Q.no 39. Identify the correct mechanism to ensure the isolation property of a set
of transactions.

A : Recovery manager

B : Concurrency control system

C : Security management system

D : Query optimization techniques

Q.no 40. Point out the wrong statement

A : Non Relational databases require that schemas be defined before you can add data

B : NoSQL databases are built to allow the insertion of data without a predefined
schema

C : NewSQL databases are built to allow the insertion of data without a predefined
schema
D : Vo SQL can hundle unstructured data

Q.no 41. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 42. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 43. sa special kind of a store procedure that executes in response to certain
action on the table like insertion, deletion or updation of data.

A : Procedures

B : Triggers

C : Functions

D : None of the mentioned

Q.no 44. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 45. Let us suppose that in a distributed database, during a transaction T1,
one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <commit T> record, what the site S1 has to do?

A : Need not do anything

B : Perform Undo

C : Perform Redo

D : Abort the transaction

Q.no 46. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 47. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 48. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 49. In timestamp ordering protocol, suppose that the transaction Ti issues
read(X) and TS(Ti)>W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 50. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 51. An instance of relational schema R (A, B, C) has distinct values of A

including NULL values. Which one of the following is true?

A : A is a candidate key

B : A is not a candidate key

C : A is a primary Key

D : Both A and B

Q.no 52. A server cannot serve on which of the following levels?

A : Client Layer

B : Business Laye

C : Database Layer

D : data layer

Q.no 53. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 54. In the context of timestamp-ordering protocol, which of the following

must be correct?
A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 55. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 56. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 57. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 58. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 59. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 60. All account entities must either be saving account or a checking account
is an example of

A : Total

B : partial

C : Overlapping

D : aggregation

Q.no 1. which DBMS distributes data processing tasks between the workstation
and a network server.

A : Network

B : Relational

C : Client Server

D : Hierarchical

Q.no 2. Which of the following is NOT an advantage of DBMS?

A : It provides access control

B : It ensures atomicity of transaction

C : Designing database is a complex task

D : It maintains data in non repudant form

Q.no 3. In ER diagram ,the primary keys are

A : Underlined

B : Bold

C : Stiked out
D : Italaized

Q.no 4. The possible value associated with every attribute is called

A : Domain

B : Assertion

C : instance

D : Schema

Q.no 5. which refers to the range of activities involved in extracting data from a
database.

A : Permormance tuning

B : Query processing

C : Query optimization

D : compilation

Q.no 6. How many versions of two phase locking protocol available

A:1

B:2

C:3

D:4

Q.no 7. What implies the ability to change the internal schema without changing
the conceptual schema

A : Physical Data Independance

B : Logical Data Independence

C : internal Schema

D : Relationship Set

Q.no 8. A Transaction ends

A : only when it is Committed.

B : only when it is Rolled-back

C : when it is Committed or Rolled-back

D : only when it is initialized

Q.no 9. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 10. Which of the following is not a valid NoSQL database?

A : cassandra

B : mongoDB

C : Postgresql

D : Hbase

Q.no 11. which of these attributes can be divided into sub parts

A : Composite

B : Simple

C : contained

D : Multi valued

Q.no 12. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 13. The langusge which enables the users to access or manipulate data

A : DML

B : DDL
C : DCL

D : TCL

Q.no 14. Boye Codd Normal Form (BCNF) is needed when

A : two non-key attributes are dependent

B : there is more then one possible composite key

C : there are two or more possible composite overlapping keys and one attribute of a
composite key is dependent on an attribute of another composite key

D : there are two possible keys and they are dependent on one another

Q.no 15. A third Normal Form (3 NF) relation should

A : be in 2 NF

B : not have complete key

C : not be 1 NF

D : should not have non-key attributes depend on key attribute

Q.no 16. The concept in normalization of relations which is based on the full
functional dependency is classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 17. Which of the following is used to define code that is fired when certain
actions or event occur

A : Replace

B : Keyword

C : Trigger

D : Cursor

Q.no 18. The data present in the database are

A : Interrelated
B : unrelated

C : Complex

D : numerical

Q.no 19. In two-phase commit (2PC) protocol, who can cause a transaction to
abort?

A : Coordinator

B : Participating site

C : Both coordinator and participating site

D : Third party site

Q.no 20. If the attribute of relation schema R is member of some candidate key
then this type of attributes are classified as

A : atomic attribute

B : candidate attribute

C : nonprime attribute

D : prime attribute

Q.no 21. W-timestamp(Q) denotes

A : The largest timestamp of any transaction that can execute write(Q) successfully

B : The largest timestamp of any transaction that can execute read(Q) successfully

C : The smallest timestamp of any transaction that can execute write(Q) successfully

D : The smallest timestamp of any transaction that can execute read(Q) successfully

Q.no 22. which is a generalization of the facility provided by the MapReduce

framework to collect data output by the Mapper or the Reducer.

A : OutputCompactor

B : OutputCollector

C : InputCollector

D : output

Q.no 23. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 24. A command to remove a relation from an SQL database

A : Delete table

B : Drop table

C : . Erase table

D : Alter table

Q.no 25. When a participating site s1 decides to commit the transaction T upon
receiving the <prepare T> message from the coordinator, it sends which message
to the coordinator site.

A : <prepare T>

B : <commit T>

C : <ready T>

D : <abort T>

Q.no 26. Point out the wrong statement

A : Secondary indices is not available in MongoDB

B : MongoDB supports search by field, range queries, regular expression searches

C : MongoDB can store the business subject in the minimal number of documents

D : MongoDB cannot store images

Q.no 27. View used used for displaying current status of database is

A : system.databases

B : current.databases

C : sys.databases

D : status.databases
Q.no 28. Which is essentially used to search for patterns in target string.

A : Like Predicate

B : Null Predicate

C : In Predicate

D : Out Predicate

Q.no 29. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 30. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 31. Minimal super key for which no proper subset is a super key is called

A : Candidate Key

B : Sub Key

C : primary key

D : Composite Key

Q.no 32. If one attribute is determinant of second, which in turn is determinant of

third, then the relation cannot be:

A : well structured

B : 1NF

C : 2NF

D : 3NF
Q.no 33. Logical design of database is called

A : Database Instance

B : Database Snapshot

C : Database Schema

D : tables

Q.no 34. A relation which is in a higher normal form

A : implies that it also qualifies to be in lower normal form

B : does not necessarily satisfy the conditions of lower normal form

C : is included in the lower normal form

D : is independent of lower normal forms

Q.no 35. HDFS works in a which fashion.

A : master-MASTER

B : master-slave

C : worker/slave

D : worker/worker

Q.no 36. If a transaction can be granted a lock on an item immediately in spite of

the presence of another type of lock, then the two locks are said to be

A : Concurrent

B : Conflict

C : Equivalent

D : Compatible

Q.no 37. The joining property which guarantees that spurious tuple generation
problem is not created after decomposition is called

A : lossless join property

B : nonadditive join property

C : additive join property

D : both a and b

Q.no 38. What is the interactive shell for MongoDB called?

A : mongo

B : mongodb

C : dbmong

D : none of the mentioned

Q.no 39. In the three-tier architecture, the intermediate layer between database
and client servers is classified as

A : functional server

B : transaction server

C : application server

D : disk server

Q.no 40. A table on the many side of a one to many or many to many relationship
must:

A : be in 1NF

B : Be in Third Normal Form

C : Have a single attribute key

D : Have a composite key

Q.no 41. Which functional dependency types is/are not present in the following
dependencies? i. Empno -> EName, Salary, Deptno, Dname ii. DeptNo -> Dname
iii.EmpNo -> Dname

A : Full functional dependency

B : Partial functional dependency

C : Transitive functional dependency

D : Both B and C

Q.no 42. if two transactions T1 and T2 both read the same data and update it then
effect of first update will be overwritten by the second update is known as

A : Race Condition
B : Run Situation

C : Concurrent Access

D : invalid

Q.no 43. As companies move past the experimental phase with Hadoop, many cite
the need for additional capabilities, including

A : Improved data storage and information retrieval

B : Improved extract, transform and load features for data integration

C : Improved data warehousing functionality

D : Improved security, workload management, and SQL support

Q.no 44. which of these constructs in SQL returns the value true if the argument
sub query is non empty

A : exist

B : while

C : where

D : having

Q.no 45. for taking advantage of load balancing and data replication features over
multiple machines for storing files mogo DB can be used as

A : AMS

B : CMS

C : File system

D : None of the mentioned

Q.no 46. for the following two entities which is appropriate relationship
Zoo/Animal

A : one to one

B : one to many

C : many to one

D : Many to many
Q.no 47. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 48. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 49. The Hadoop MapReduce framework spawns one map task for each what
generated by the InputFormat for the job

A : OutputSplit

B : InputSplit

C : InputSplitStream

D : All of the mentioned

Q.no 50. Considering the functional dependency, the one in which removal from
some attributes must affect dependency is called

A : Transitive dependency

B : Full functional dependency

C : Partial dependency

D : Primary dependency

Q.no 51. While converting ER into tables, what is done for Relationship set linking
a weak entity set to its corressponding strong entity set

A : Relationship set is not represented as a table

B : Relationship is represented as a table

C : descriptive attributes are added to relation ship set

D : Primary keys are added to the relationship set

Q.no 52. Given an attribute x, another attribute y is dependent on it, if for a given
x

A : there are many y values

B : there is only one value of y

C : there is one or more y values

D : there is none or one y value

Q.no 53. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 54. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 55. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many

Q.no 56. A loan can be taken by many customer but each customer can take
exactly one loan.what is the relation between Loan and Customer
A : One to many

B : One to One

C : Many to One

D : Many to many

Q.no 57. Hadoop is a framework that works with a variety of related tools.
Common cohorts include

A : MapReduce, Hive and HBase

B : MapReduce, MySQL and Google Apps

C : MapReduce, Hummer and Iguana

D : MapReduce, Heron and Trumpet

Q.no 58. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 59. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 60. which helps solve concurrency problem.

A : locking

B : transaction monitor
C : transaction serializability

D : two phase commit

Q.no 1. Hiding certain details to simplify the users interaction with the system is
called

A : Abstraction

B : Inheritence

C : Encapsulation

D : overriding

Q.no 2. Which of the following is not a parallel database architecture

A : Shared memory

B : Shared processor

C : Shared Disk

D : Shared nothing

Q.no 3. Normalization is a process of restructuring a relation to

A : minimize duplication of data in a database

B : maximize duplication of data to ensure reliability

C : make it of uniform size

D : allow addition of data

Q.no 4. When a transaction completes the execution of its final statement, it

enters a state. What is the name of this state?

A : Partially Committed state

B : Committed state

C : Failed state

D : Aborted State

Q.no 5. How many rules in “CODD’S RULES” of Relational Model of database

systems?

A : 11
B : 12

C : 13

D : 14

Q.no 6. A transaction may not always complete its execution successfully. Such a
transaction is termed

A : Aborted

B : Terminated

C : Closed

D : partial

Q.no 7. A distributed database is which of the following?

A : A single logical database that is spread to multiple locations and is interconnected

by a network

B : A loose collection of file that is spread to multiple locations and is interconnected by

a network

C : A loose collection of file that is spread to multiple locations and is interconnected by

a networkA single logical database that is limited to one location.

D : A loose collection of file that is limited to one location.

Q.no 8. Which of the following is not a transaction state?

A : Active

B : Partially committed

C : Failed

D : Compensated

Q.no 9. Which of the following is not the DDL statements

A : Create

B : Drop

C : Alter

D : select
Q.no 10. no attribute of primary key must contain a null value in any relation is
specified by which type of constraint

A : Domain

B : Entity

C : referential

D : key

Q.no 11. A fragmentation technique wherein every tuple of a table is assigned to

one or more fragments as a result of fragmentation is called

A : Vertical Fragmentation

B : Horizontal Fragmentation

C : Hybrid Fragmentation

D : full fragmentation

Q.no 12. A relation that has no partial dependencies is in which normal form

A : First

B : Second

C : Third

D : BCNF

Q.no 13. If a transaction acquires exclusive lock, then it can perform which
operation.

A : Read

B : Write

C : read and write

D : update

Q.no 14. Which command allows the removal of all rows from a table but flushes
a table more efficiently since no rollback information is retained:

A : TRUNCATE command

B : Create command
C : Drop table command

D : Alter table command

Q.no 15. A transaction for which all committed changes are permanent is called

A : atomic

B : consistent

C : isolated

D : durable

Q.no 16. Which ensures that the database remains in a consistent state despites
system failures

A : Transaction Management

B : Query Processor

C : Storage Manager

D : Buffer Manager

Q.no 17. Data Redundancy may lead to

A : Inconsistency

B : Failure

C : isolation

D : consistency

Q.no 18. Referential integrity constraints is base on the concept of

A : Primary Key

B : Foreign key

C : uniqueness

D : normalization

Q.no 19. Which of the following is not valid for NoSQL?

A : High performance

B : cross platform
C : Less scalable

D : Document Oriented

Q.no 20. Command that is used to add attributes to an existing relation, is said to
be

A : Alter

B : Modify

C : Tailor

D : Eliminate

Q.no 21. which command is used to interact and view Job Queue information in
HDFS

A : queue

B : priority

C : disc

D : diq

Q.no 22. Domain constraints, functional dependency and referential integrity are
special forms of

A : Foreign key

B : Primary key

C : Assertion

D : Referential constraint

Q.no 23. Global Wait-for graph is used for

A : Handling concurrency control

B : Handling failures

C : Handling deadlock

D : None of the above

Q.no 24. which one of these is not used as a approach for concurrency control

A : Distributed Lock Manager

B : Primary copy

C : Majority protocol

D : semaphores

Q.no 25. Which of the following is not one of the stages in the evolution of
distributed DBMS?

A : Unit of work

B : Remote unit of work

C : Distributed unit of Work

D : Distributed request

Q.no 26. “Sharding” a database across many server instances can be achieved
with

A : LAN

B : SAN

C : MAN

D : NAN

Q.no 27. The COUNT function in SQL returns the number of

A : Values

B : Distinct values

C : Group By

D : Columns

Q.no 28. A transaction that has not been completed successfully is called as

A : Aborted transaction

B : Active transaction

C : Partially committed transaction

D : invalid

Q.no 29. HDFS is implemented in which programming language.

A : C++

B : java

C : python

D:C

Q.no 30. Transaction which ensures that the transaction are being executed
successfully.

A : concurrency

B : consistency

C : serialisability

D : non serialiasability

Q.no 31. which operation sets the values of all data item updated by the
transaction to the old values

A : redo

B : un do

C : restart

D : abort

Q.no 32. Apache Hadoop provides a persistent data structure for binary key-value
pairs using

A : GetFile

B : SequenceFile

C : Putfile

D : sequence

Q.no 33. In ER diagram,specialization is depicted by

A : Triangle component labeled ISA

B : oval

C : rectangle

D : Diamond
Q.no 34. When more than one user is accessing same data at the same time then it
is known

A : Controlled Access

B : Currently Access

C : Concurrent Access

D : Uncontrolled Access

Q.no 35. The layer, which provides the interface between the business-logic layer
and the underlying database.

A : Business logic

B : Presentation

C : User interaction

D : Data access

Q.no 36. Supporting interquery parallelism is more complicated in

A : Shared Memory

B : shared disk

C : shared nothing

D : shared disk and shared nothing

Q.no 37. Which of the following is not Unary operation?

A : Select

B : Project

C : Rename

D : Union

Q.no 38. The procedure of storing higher normal form relations which are in
lower normal form as a base relation is classified as

A : isolation of data

B : de-normalization of data

C : normalization of data
D : denomination of data

Q.no 39. What is the mechanism which guarantees that all database servers
participating in a distributed transaction either all commit or all roll back the
statements in the transaction?

A : Commit

B : Commit transaction

C : Two-phase commit

D : Three-phase commit

Q.no 40. What operator tests column for the missing data?

A : LIKE operator

B : NOT operator

C : ASSIGNMENT operator

D : IS NULL operator

Q.no 41. DCL provides commands to perform actions like

A : Change thes tructureof Tables

B : Insert, Update or Delete Records and Values

C : Authorizing Access and other control over Database

D : inserting records into database

Q.no 42. A benefit of the three-tier architecture is which of the following?

A : New modules can be built to support specific business needs

B : Performance improves for compiled SQL statements

C : Results in a thinner client and database server

D : Pipelined parallelism

Q.no 43. which one of these is an abstraction in which relationship sets are
treated as higher level entity sets and can participate in relationships

A : Specialization

B : Aggregation
C : Generalization

D : Inheritence

Q.no 44. BCNF is needed because

A : otherwise tuples may be duplicated

B : when a data is deleted tuples may be lost

C : updating is otherwise difficult

D : when there is dependent attributes in two possible composite keys one of the
attributes is unnecessarily duplicated in the tuples

Q.no 45. which serves as the master and there is only one NameNode per cluster.

A : Data Node

B : NameNode

C : Data block

D : Replication

Q.no 46. Which one of these is a predicate expressing a condition that we wish the
database always to satisfy

A : Assertions

B : Triggers

C : cursors

D : transaction

Q.no 47. Facebook Tackles Big Data With

A : Project Prism’

B : ‘Prism’

C : Project Big’

D : Project Data’

Q.no 48. NoSQL supports

A : Vertical scaling, simple design, low control availability

B : Vertical scaling, simple design, fine controlled availability

C : Horizontal scaling, complex design, fine controlled availability

D : Horizontal scaling, simple design, fine controlled availability.

Q.no 49. The constraint between two different attributes sets is classified as

A : Modification anomaly

B : Functional dependency

C : Deletion anomaly

D : Insertion anomaly

Q.no 50. What are the advantages of Replication of data in Distributed database?

A : Avaliability, Parallelism, Increased data transfer

B : Availability, Parallelism, Reduced data transfer

C : Availability, Increased parallelism, Cost of updates

D : All of the above

Q.no 51. How are the composite attributes represented in relational data design

A : Separate attributes are created for each of the component attribute

B : Composite attributes are ignored

C : separate tables are created for the each of the component attribute

D : no table is created

Q.no 52. Read one, write all available protocol is used to increase

A : Availability

B : Robustness

C : Both Availability and Robustness

D : Neither Availability nor Robustness

Q.no 53. All account entities must either be saving account or a checking account
is an example of

A : Total
B : partial

C : Overlapping

D : aggregation

Q.no 54. While using commit protocols for handling atomicity issues, the
distributed database system may enter into a situation called Blocking problem.
Which of the following commit protocols can avoid Blocking problem?

A : Two-phase commit protocol

B : Three-phase commit protocol

C : 2pl

D : Time stamp

Q.no 55. Concurrency control is important for which of the following reasons?

A : To ensure data integrity when updates occur to the database in a multiuser

environment

B : To ensure data integrity when updates occur to the database in a single-user

environment

C : To ensure data integrity while reading data occurs to the database in a multiuser
environment

D : To ensure data integrity while reading data occurs to the database in a single-user
environment

Q.no 56. Transaction T1 and T2 are deadlocked, how we can recover from
deadlock

A : By abort both transactions

B : By rollback both transactions

C : By rollback one of transaction involve in deadlock

D : recovery from deadlock is not possible

Q.no 57. In timestamp ordering protocol, suppose that the transaction Ti issues
write(X) and TS(Ti)<W-timestamp(X), then

A : Read operation is executed

B : Read operation is rejected

C : Write operation is rejected

D : Write operation is executed

Q.no 58. In an Entity-Relationship diagram “Double Rectangles” represents

A : Relationship Set

B : Weak Entity Sets

C : Derived Attributes

D : Multi-valued Attributes

Q.no 59. Normalization of database is essential to i. avoid accidental deletion of

required data when some data is deleted ii. eliminate inconsistencies when a data
item is modified in the database iii. allows storage of data in a computer’s disk iv.
use a database management system

A : i and iii

B : i and ii

C : ii and iii

D : ii and iv

Q.no 60. What command is used to removing trigger

A : DROP TRIGGER Trig;

B : ALTER TRIGGER Trig;

C : DELETE TRIGGER Trig;

D : truncate trigger

Q.no 1. A distributed database has which of the following advantages over a

centralized database?

A : Software cost

B : Software complexity

C : Slow Response

D : Modular growth

Q.no 2. Some of the columns of a relation are at different sites is which of the
following?
A : Horizontal Partitioning

B : Vertical Partitioning

C : Horizontal and Vertical Partitioning

D : Data Replication

Q.no 3. The process of normalization

A : is automatic using a computer program

B : requires one to understand dependency between attributes

C : is manual and requires semantic information

D : is finding the key of a relation

Q.no 4. If a transaction acquires a shared lock, then it can perform which of these
operation.

A : read

B : write

C : read and write

D : update

Q.no 5. Which data type can store unstructured data in a column?

A : RAW

B : CHAR

C : NUMERIC

D : VARCHAR

Q.no 6. A relation is said to be in 1NF if

A : there is no duplication of data

B : there are no composite attributes in the relation

C : there are only a few composite attributes

D : all attributes are of uniform type

Q.no 7. The all-or-none property is commonly known as

A : Isolation

B : Durability

C : Atomicity

D : seializability

Q.no 8. Which of these causes the undoes of all updates performed by the SQL
Statement

A : Commit

B : Roll Back

C : End

D : Save

Q.no 9. A relation is in 1NF if domain of all attribute of R are

A : atomic

B : multivalued

C : Transitive

D : text

Q.no 10. The users who use easy-to-use menu are called

A : Sophisticated end users

B : Naïve users.

C : Stand-alone users.

D : Casual end user

Q.no 11. which DBMS distributes data processing tasks between the workstation
and a network server.

A : Network

B : Relational

C : Client Server

D : Hierarchical
Q.no 12. In formal relational model, the set of indivisible values is called

A : Range

B : Domain

C : Relation

D : Tuple

Q.no 13. The object that exist in the real world and is distinquishable form other
object is

A : Entity

B : Attribute

C : Property

D : Relationship

Q.no 14. Which of the following is not a type of SQL statement?

A : Data Manipulation Language

B : Data Definition Language

C : Data Control Language

D : Data Communication Language

Q.no 15. Hadoop is enabled by a technology Google created called

A : MapR

B : MapReduce

C : Cassendra

D : Scylla

Q.no 16. Which of the following is used for the MapReduce job Tracker node?

A : mradmin

B : tasktracker

C : jobtracker

D : node tracker
Q.no 17. The normalization form which is based on the transitive dependency is
classified as

A : Fourth normal form

B : Third normal form

C : First normal form

D : Second normal form

Q.no 18. The system seeks to improve performance through parallelization of

various operations, such as loading data, building indexes and evaluating queries
is

A : Distributed database

B : Parallel database

C : Client server database

D : standalone systems

Q.no 19. which stores are used to store information about networks, such as
social connections.

A : Key-value

B : Wide-column

C : Document

D : Graph

Q.no 20. The collection of information stored in the database at a particular

moment is called

A : Instance

B : Schema

C : table

D : relation

Q.no 21. Which of the following is the default Partitioner for Mapreduce?

A : MergePartitioner

B : HashedPartitioner
C : HashPartitioner

D : Hasher

Q.no 22. E-R model uses this symbol to represent weak entity set ?

A : Dotted rectangle

B : Diamond

C : Doubly outlined rectangle

D : Triangle

Q.no 23. All the values taken by the foreign key must either be available in the
relation of the primary key or be null is specified by

A : Domain

B : Entity

C : referential

D : key

Q.no 24. new relation schemas are created for which of these attributes

A : Composite Attribute

B : Derived Attribute

C : Multivalued

D : Descriptive

Q.no 25. Which statement about triggers is true

A : You use an application trigger to fire when a DELETE statement occurs.

B : You use a database trigger to fire when an INSERT statement occurs.

C : You use a system event trigger to fire when an UPDATE statement occurs.

D : You use INSTEAD OF trigger to fire when a SELECT statement occurs.

Q.no 26. The virtual table that its created by data from the result of an SQL Select
statement is called

A : View
B : Synonym

C : Sequence

D : Transaction

Q.no 27. In SQL, which of these can be test for the absence of set membership

A : in

B : not in

C : yes

D : like

Q.no 28. Transactions are executed one by one without any interleaved
operations from other transactions is known as

A : Serial Schedule

B : Complete Schedule

C : Concurrent Schedule

D : Non-Complete Schedule

Q.no 29. All of the following accurately describe Hadoop, EXCEPT:

A : Open source

B : Real-time

C : Java-based

D : Distributed computing approach

Q.no 30. Which of the following is a comparison operator in SQL?

A : Double equal sign

B : like

C : BETWEEN

D : Single equal sign

Q.no 31. candidate keys are

A : minimal super key

B : same as super key

C : isnot unique

D : superset keys

Q.no 32. which protocol grantees that a set of transactions becomes serialisable.

A : two phase locking

B : two phase commit

C : transaction locking

D : checkpoints

Q.no 33. The data that have assosiated time interval during which they are valid
is called

A : Temporal Data

B : Dynamic data

C : Snap Shot data

D : Static Data

Q.no 34. Application resides at the client machine and invokes database system
functionality at the server machine through query statement, is the type known
as

A : One-tier architecture

B : Two-tier architecture

C : Three-tier architecture

D : NO-tier architecture

Q.no 35. Which one of the following statements if FALSE?

A : Any relation with two attributes is in BCNF

B : A relation in which every key has only one attribute is in 2NF

C : A prime attribute can be transitively dependent on a key in a 3 NF relation

D : A prime attribute can be transitively dependent on a key in a BCNF relation

Q.no 36. Which-one ofthe following statements about normal forms is FALSE?
A : BCNF is stricter than 3 NF

B : Lossless, dependency -preserving decomposition into 3 NF is always possible

C : Loss less, dependency – preserving decomposition into BCNF is always possible

D : Any relation with two attributes is BCNF

Q.no 37. which executes the Mapper/ Reducer task as a child process in a separate
jvm

A : JobTracker

B : TaskTracker

C : TaskScheduler

D : Task jober

Q.no 38. A type of query that is placed within a WHERE or HAVING clause of
another query is called

A : Master query

B : Sub query

C : Super query

D : Multi-query

Q.no 39. which of these clause are used to make the tuples display on an sorted
manner

A : sort by

B : order by

C : arrange by

D : Group by

Q.no 40. What are the ACID Properties of transaction?

A : Atomicity, Consistency, Inconsistent, Durability

B : Atomicity, Consistency, Isolation, Durability

C : Atomicity, Consistency, Inconsistent, Database

D : Automatically, Consistency, Inconsistent, Durability

Q.no 41. Which function is used to divides one numeric expression by another
and get the remainder

A : POWER

B : MOD

C : ROUND

D : REMAINDER

Q.no 42. Trigger is not execute when

A : Select query execute

B : Insert query execute

C : Update query execute

D : Delete query execute

Q.no 43. If we project R into R1 and R2 and compute the natural join of the
projection result we get back exacltly R is called

A : Lossless Decomposition

B : Lossy Decomposition

C : Dependency Preserving

D : Functional Dependency

Q.no 44. While converting ER diagram into table for which one these are not
represented in a relational database design

A : Entity with Composite Attribute

B : Entity without a primary key

C : Relationship set linking a weak entity set to its corressponding strong entity set

D : Relationship set with descriptive attribute

Q.no 45. Consider a directed line from the relationship set advisor to both entity
setsinstructor and student. This indicates which cardinality

A : one to one

B : one to many
C : many to one

D : many to many

Q.no 46. The attribute that can be divided into other attributes is called

A : Simple Attribute

B : Composite Attribute

C : Multi-valued Attribute

D : Derived Attribute

Q.no 47. which can be used for batch processing of data and aggregation
operations.

A : Hive

B : MapReduce

C : Oozie

D : None of the mentioned

Q.no 48. Which of the following is used to access the database server at the time
of executing the program and get the data from the server accordingly?

A : Embedded SQL

B : Dynamic SQL

C : SQL declarations

D : SQL data analysis

Q.no 49. Which of the following statement is false?

A : If any schedule is neither conflict serializable nor view serializable then that
schedule must be inconsistent.

B : Timestamp protocol ensures freedom from deadlock.

C : Strict Two phase locking protocol ensures cascadeless rollback.

D : Lock point of a schedule in two phase locking protocol indicates final lock of the
schedule.

Q.no 50. Get(key)

Put(key, value)
Multi-get(key1, key2, .., keyN)
are fuction of which data model

A : Document Store NoSQL Data model

B : Graph Base NoSQL

C : Key Value store NoSQLData model

D : Column Store NoSQL Data model

Q.no 51. which helps solve concurrency problem.

A : locking

B : transaction monitor

C : transaction serializability

D : two phase commit

Q.no 52. Let E1 and E2 be two entities in an ER diagram with simple single-valued
attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-
many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the
relational model?

A:2

B:3

C:4

D:5

Q.no 53. The business logic of the application says what actions to carry out under
what conditions, is embedded in

A : Multiple servers

B : Multiple clients

C : Transaction server

D : Application server

Q.no 54. The relation EMPDT1 is defined with attributes empcode(unique), name,
street, city, state, and pincode. For any pincode,there is only one city and state.
Also, for any given street, city and state, there is just one pincode. In
normalization terms EMPDT1 is a relation
A : 1NF only

B : 2NF and hence also in 1NF

C : 3NF and hence also in 2NF and 1NF

D : BCNF and hence also in 3NF, 2NF and 1NF

Q.no 55. Most NoSQL databases support automatic which of these meaning that
you get high availability and disaster recovery.

A : processing

B : scalability

C : replication

D : all of the mentioned

Q.no 56. for a binary many to one or one to many relationship set which of these
is true

A : primary key of entity set on the many side of the relationship set serves as a
primary key

B : primary key of entity set on the one side of the relationship set serves as a primary
key

C : there is no primary key

D : The union of the primary key attributes from the participating entity set becomes
the primary key

Q.no 57. Temporary stored procedures are stored in which database.

A : Master

B : Model

C : User specific

D : Tempdb

Q.no 58. Which of the following is not a benefit of a database trigger

A : Enforcing referential integrity

B : Event logging and storing information on table access

C : Allowing invalid transactions

D : Generating some derived column values automatically

Q.no 59. In the context of timestamp-ordering protocol, which of the following

must be correct?

A : If TS(Ti) >= R-timestamp(Q), the operation is rejected.

B : If TS(Ti) > W-timestamp(Q), the operation is rejected and Ti is rolled back.

C : If TS(Ti) < W-timestamp(Q), the operation is rejected and Ti is rolled back.

D : If TS(Ti) < W-timestamp(Q), W-timestamp(Q) is set to TS(Ti).

Q.no 60. for the following two entities which one is the correct relationship
CUTOMER/ORDER

A : one to one

B : one to many

C : many to one

D : many to many