35021C04 - DATABASE MANAGEMENT SYSTEMS (Print Taken) Solved - Answer
35021C04 - DATABASE MANAGEMENT SYSTEMS (Print Taken) Solved - Answer
What is a database?
a) Organized collection of information that cannot be accessed, updated, and
managed
1 1 2 b) Collection of data or information without organizing
c) Organized collection of data or information that can be accessed, updated, and
managed
d) Organized collection of data that cannot be updated
What is DBMS?
a) DBMS is a collection of queries
1 1 3 b) DBMS is a high-level language
c) DBMS is a programming language
d) DBMS stores, modifies and retrieves data
In which of the following formats data is stored in the database management system?
a) Image
1 1 6 b) Text
c) Table
d) Graph
Page 1
Which of the following is not a feature of DBMS?
a) Minimum Duplication and Redundancy of Data
1 1 9 b) High Level of Security
c) Single-user Access only
d) Support ACID Property
Page 2
Which of the following is not the utility of DBMS?
i) Backup ii) Loading iii) Process Organization iv) File organization
a) i, ii, and iv only
1 1 18
b) i, ii and iii only
c) i, iii and iv only
d) All i, ii, iii, and iv
The ability to query data, as well as insert, delete, and alter tuples, is offered by
____________
a) TCL (Transaction Control Language)
1 1 20
b) DCL (Data Control Language)
c) DDL (Data Definition Language)
d) DML (Data Manipulation Language)
Which of the following is the best way to represent the attributes in a large db?
a) Dot representation
2 1 22 b) Concatenation
c) Relational-and
d) All of the mentioned
Which of the following is the subset of SQL commands used to manipulate Oracle
Structures, including tables?
a) Data Described Language
2 1 23
b) Data Retrieval Language
c) Data Manipulation Language
d) Data Definition Language
Page 3
A relational database consists of a collection of
a) Tables
2 1 26 b) Fields
c) Records
d) Keys
For each attribute of a relation, there is a set of permitted values, called the ________
of that attribute.
a) Domain
2 1 30
b) Relation
c) Set
d) Schema
Course(course_id,sec_id,semester)
Here the course_id,sec_id and semester are __________ and course is a _________
a) Relations, Attribute
2 1 31
b) Attributes, Relation
c) Tuple, Relation
d) Tuple, Attributes
Which one of the following is used to define the structure of the relation, deleting
relations and relating schemas?
a) DML(Data Manipulation Langauge)
2 1 33
b) DDL(Data Definition Langauge)
c) Query
d) Relational Schema
Page 4
The union operation is represented by
a) ∩
2 1 34 b) U
c) –
d) *
In order to undo the work of transaction after last commit which one should be used?
a) View
2 1 38 b) Commit
c) Rollback
d) Flashback
In case of any shut down during transaction before commit which of the following
statement is done automatically?
a) View
2 1 39
b) Commit
c) Rollback
d) Flashback
Designers use which of the following to tune the performance of systems to support
time-critical operations?
a) Denormalization
3 1 42
b) Redundant optimization
c) Optimization
d) Realization
Page 5
Relational Algebra is a __________ query language that takes two relations as input
and produces another relation as an output of the query.
a) Relational
3 1 43
b) Structural
c) Procedural
d) Fundamental
______ is a special type of integrity constraint that relates two relations & maintains
consistency across the relations.
a) Entity Integrity Constraints
3 1 47
b) Referential Integrity Constraints
c) Domain Integrity Constraints
d) Domain Constraints
A table on the many side of a one to many or many to many relationship must:
a) Be in Second Normal Form (2NF)
3 1 50 b) Be in Third Normal Form (3NF)
c) Have a single attribute key
d) Have a composite key
Page 6
Tables in second normal form (2NF):
a) Eliminate all hidden dependencies
3 1 51 b) Eliminate the possibility of a insertion anomalies
c) Have a composite key
d) Have all non key fields depend on the whole primary key
Functional Dependencies are the types of constraints that are based on______
a) Key
3 1 52 b) Key revisited
c) Superset key
d) None of the mentioned
Which of the following refers to the level of data abstraction that describes exactly
how the data actually stored?
a) Conceptual Level
3 1 59
b) Physical Level
c) File Level
d) Logical Level
Page 7
Which of the following refers collection of the information stored in a database at a
specific time?
a) Independence
3 1 60
b) Instance of the database
c) Schema
d) Data domain
The concurrent execution of the database in a ____-user system refers to the fact that
multiple users are able to access and use it at the same time.
a) Single
4 1 63
b) Two
c) Three
d) Multiple
When dealing with database transactions, there is often a need for multiple users to
use a database to perform different operations. In this case, ___ of the database
occurs.
4 1 64 a) Concurrent Connection
b) Concurrent Reduction
c) Concurrent Execution
d) Concurrent Revolution
Page 8
Which property of database transaction creates an illusion then only 1 transaction is
executed in the system in spite of more than one transaction being executed in a
parallel manner?
4 1 68 a) Atomicity
b) Consistency
c) Isolation
d) Durability
In a transaction, a ...................... operation will read data from the table and write on
the buffer.
(A).Write
4 1 70
(B).Read
(C).Execute
(D).None of these
Collections of operations that form a single logical unit of work are called
__________
a) Views
4 1 74
b) Networks
c) Units
d) Transactions
Page 9
Which of the following systems is responsible for ensuring isolation?
a) Recovery system
4 1 76 b) Atomic system
c) Concurrency control system
d) Compiler system
The scheme that controls the interaction between executing transactions is called as
_____
a) Concurrency control scheme
4 1 79
b) Multiprogramming scheme
c) Serialization scheme
d) Schedule scheme
A unit of storage that can store one or more records in a hash file organization is
denoted as
5 1 81 a) Buckets
b) Disk pages
c) Blocks d) Nodes
The file organization which allows us to read records that would satisfy the join
condition by using one block read is
a) Heap file organization
5 1 82
b) Sequential file organization
c) Clustering file organization
d) Hash file organization
Page 10
Which one of the following is a Stripping technique?
a) Byte level stripping
5 1 85 b) Raid level stripping
c) Disk level stripping
d) Block level stripping
Hardware RAID implementations permit _________ that is, faulty disks can be
removed and replaced by new ones without turning power off.
a) Scrapping
5 1 86
b) Swapping
c) Hot swapping
d) None of the mentioned
The _________ is the fastest and most costly form of storage, which is relatively
small; its use is managed by the computer system hardware.
a) Cache
5 1 88
b) Disk
c) Main memory
d) Flash memory
Which of the following stores several gigabytes of data but usually lost when power
failure?
a) Flash memory
5 1 89
b) Disk
c) Main memory
d) Secondary memory
Page 11
The storage structure which do not survive system crashes are ______
a) Volatile storage
5 1 93 b) Non-volatile storage
c) Stable storage
d) Dynamic storage
A ______ file system is software that enables multiple computers to share file
storage while maintaining consistent space allocation and file content.
a) Storage
5 1 94
b) Tertiary
c) Secondary
d) Cluster
Data that is accessible via the storage medium is processed by the ___.
a) Cache
5 1 97 b) Main memory
c) Both A and B
d) None of the above
Flash memory files are stored on ___- keys, which are connected to a computer
through ___ ports.
a) USB
5 1 100
b) UBS
c) BUS
d) SUB
Page 12
Answer
b) Database
Management
System
c) Organized
collection of data
or information
that can be
accessed,
updated, and
managed
d) DBMS stores,
modifies and
retrieves data
c) Relational
algebra
d) All of the
above
c) Table
d) Decentralized
d) Google
Page 13
c) Single-user
Access only
b) User interface
provided
d) Analysing code
d) All of the
above
d) All of the
above
d) both a and b
c) Meta data
c) Collection of
Tables
a) Drop table
Page 14
a) i, ii, and iv only
c) Database
application and
the database
d) DML (Data
Manipulation
Language)
c) Deletes
particular tuple
from relation
b) Concatenation
d) Data Definition
Language
c) CREATE
SCHEMA
a) Network
Page 15
a) Tables
c) Row
b) Tuple
b) Column
a) Domain
b) Attributes,
Relation
a) Any
b) DDL(Data
Definition
Langauge)
Page 16
b) U
a) Union all
a) Transaction
b) Commit
c) Rollback
c) Rollback
b) Atomic
d) Functional
dependencies
a)
Denormalization
Page 17
c) Procedural
d) None of the
mentioned
a) Mapping
Cardinality
c) Improve the
quality of data
entered for a
specific property
b) Referential
Integrity
Constraints
a) Constraints
a) First
d) Have a
composite key
Page 18
a) Eliminate all
hidden
dependencies
a) Key
b) yyyy/mm/dd
a) Index
b) Blob
c) 3NF
b) Dependency
preservation
a) New
Technology File
System
b) Physical Level
Page 19
b) Instance of the
database
b) Order by
c) Concurrency
d) Multiple
c) Concurrent
Execution
c) Both A and B
c) Control
Protocols
d) All of the
above
Page 20
c) Isolation
a) All the
exclusive locks
held by the
transaction are
released when
the transaction is
completed
(A).Write
(C).Both A & B
(A).Two-phase
locking protocol
(C).Ensure that
deadlocks will
never occur
d) Transactions
a) Recovery
system
Page 21
c) Concurrency
control system
b) Aborted
transaction
b) Schedules
a) Concurrency
control scheme
(C) Aggregation.
a) Buckets
c) Clustering file
organization
c) datafiles
a) RAID level 1
Page 22
d) Block level
stripping
c) Hot swapping
d) All of the
mentioned
a) Cache
c) Main memory
a) Flash memory
c) Compact disks
c) Sequential-
access
Page 23
a) Volatile
storage
d) Cluster
c) Both A and B
a) Primary
Storage
b) Main memory
a) Main memory
b) Expensive
a) USB
Page 24
Par Qn. Blooms COs
P 35021C04 - Database Management Systems
t No Level Level
What is a database?
a) Organized collection of information that cannot be accessed, updated, and
managed
1 1 2 b) Collection of data or information without organizing 1 CO1
c) Organized collection of data or information that can be accessed, updated, and
managed
d) Organized collection of data that cannot be updated
What is DBMS?
a) DBMS is a collection of queries
1 1 3 b) DBMS is a high-level language 1 CO1
c) DBMS is a programming language
d) DBMS stores, modifies and retrieves data
In which of the following formats data is stored in the database management system?
a) Image
1 1 6 b) Text 1 CO1
c) Table
d) Graph
Page 25
Which of the following is not a feature of DBMS?
a) Minimum Duplication and Redundancy of Data
1 1 9 b) High Level of Security 1 CO1
c) Single-user Access only
d) Support ACID Property
Page 26
Which of the following is not the utility of DBMS?
i) Backup ii) Loading iii) Process Organization iv) File organization
a) i, ii, and iv only CO1
1 1 18 1
b) i, ii and iii only
c) i, iii and iv only
d) All i, ii, iii, and iv
The ability to query data, as well as insert, delete, and alter tuples, is offered by
____________
a) TCL (Transaction Control Language) CO1
1 1 20 2
b) DCL (Data Control Language)
c) DDL (Data Definition Language)
d) DML (Data Manipulation Language)
Which of the following is the best way to represent the attributes in a large db?
a) Dot representation
2 1 22 b) Concatenation 1 CO2
c) Relational-and
d) All of the mentioned
Which of the following is the subset of SQL commands used to manipulate Oracle
Structures, including tables?
a) Data Described Language CO2
2 1 23 1
b) Data Retrieval Language
c) Data Manipulation Language
d) Data Definition Language
Page 27
A relational database consists of a collection of
a) Tables
2 1 26 b) Fields 1 CO2
c) Records
d) Keys
For each attribute of a relation, there is a set of permitted values, called the ________
of that attribute.
a) Domain CO2
2 1 30 2
b) Relation
c) Set
d) Schema
Course(course_id,sec_id,semester)
Here the course_id,sec_id and semester are __________ and course is a _________
a) Relations, Attribute CO2
2 1 31 2
b) Attributes, Relation
c) Tuple, Relation
d) Tuple, Attributes
Which one of the following is used to define the structure of the relation, deleting
relations and relating schemas?
a) DML(Data Manipulation Langauge) CO2
2 1 33 1
b) DDL(Data Definition Langauge)
c) Query
d) Relational Schema
Page 28
The union operation is represented by
a) ∩
2 1 34 b) U 1 CO2
c) –
d) *
In order to undo the work of transaction after last commit which one should be used?
a) View
2 1 38 b) Commit 1 CO2
c) Rollback
d) Flashback
In case of any shut down during transaction before commit which of the following
statement is done automatically?
a) View CO2
2 1 39 2
b) Commit
c) Rollback
d) Flashback
Designers use which of the following to tune the performance of systems to support
time-critical operations?
a) Denormalization CO3
3 1 42 2
b) Redundant optimization
c) Optimization
d) Realization
Page 29
Relational Algebra is a __________ query language that takes two relations as input
and produces another relation as an output of the query.
a) Relational CO3
3 1 43 2
b) Structural
c) Procedural
d) Fundamental
______ is a special type of integrity constraint that relates two relations & maintains
consistency across the relations.
a) Entity Integrity Constraints CO3
3 1 47 2
b) Referential Integrity Constraints
c) Domain Integrity Constraints
d) Domain Constraints
A table on the many side of a one to many or many to many relationship must:
a) Be in Second Normal Form (2NF)
3 1 50 b) Be in Third Normal Form (3NF) 1 CO3
c) Have a single attribute key
d) Have a composite key
Page 30
Tables in second normal form (2NF):
a) Eliminate all hidden dependencies
3 1 51 b) Eliminate the possibility of a insertion anomalies 2 CO3
c) Have a composite key
d) Have all non key fields depend on the whole primary key
Functional Dependencies are the types of constraints that are based on______
a) Key
3 1 52 b) Key revisited 2 CO3
c) Superset key
d) None of the mentioned
Which of the following refers to the level of data abstraction that describes exactly
how the data actually stored?
a) Conceptual Level CO3
3 1 59 1
b) Physical Level
c) File Level
d) Logical Level
Page 31
Which of the following refers collection of the information stored in a database at a
specific time?
a) Independence CO3
3 1 60 1
b) Instance of the database
c) Schema
d) Data domain
The concurrent execution of the database in a ____-user system refers to the fact that
multiple users are able to access and use it at the same time.
a) Single CO4
4 1 63 2
b) Two
c) Three
d) Multiple
When dealing with database transactions, there is often a need for multiple users to
use a database to perform different operations. In this case, ___ of the database
occurs.
4 1 64 a) Concurrent Connection 1 CO4
b) Concurrent Reduction
c) Concurrent Execution
d) Concurrent Revolution
Page 32
Which property of database transaction creates an illusion then only 1 transaction is
executed in the system in spite of more than one transaction being executed in a
parallel manner?
4 1 68 a) Atomicity 1 CO4
b) Consistency
c) Isolation
d) Durability
In a transaction, a ...................... operation will read data from the table and write on
the buffer.
(A).Write CO4
4 1 70 2
(B).Read
(C).Execute
(D).None of these
Collections of operations that form a single logical unit of work are called
__________
a) Views CO4
4 1 74 1
b) Networks
c) Units
d) Transactions
Page 33
Which of the following systems is responsible for ensuring isolation?
a) Recovery system
4 1 76 b) Atomic system 1 CO4
c) Concurrency control system
d) Compiler system
The scheme that controls the interaction between executing transactions is called as
_____
a) Concurrency control scheme CO4
4 1 79 2
b) Multiprogramming scheme
c) Serialization scheme
d) Schedule scheme
A unit of storage that can store one or more records in a hash file organization is
denoted as
5 1 81 a) Buckets 2 CO5
b) Disk pages
c) Blocks d) Nodes
The file organization which allows us to read records that would satisfy the join
condition by using one block read is
a) Heap file organization CO5
5 1 82 2
b) Sequential file organization
c) Clustering file organization
d) Hash file organization
Page 34
Which one of the following is a Stripping technique?
a) Byte level stripping
5 1 85 b) Raid level stripping 1 CO5
c) Disk level stripping
d) Block level stripping
Hardware RAID implementations permit _________ that is, faulty disks can be
removed and replaced by new ones without turning power off.
a) Scrapping CO5
5 1 86 2
b) Swapping
c) Hot swapping
d) None of the mentioned
The _________ is the fastest and most costly form of storage, which is relatively
small; its use is managed by the computer system hardware.
a) Cache CO5
5 1 88 2
b) Disk
c) Main memory
d) Flash memory
Which of the following stores several gigabytes of data but usually lost when power
failure?
a) Flash memory CO5
5 1 89 1
b) Disk
c) Main memory
d) Secondary memory
Page 35
The storage structure which do not survive system crashes are ______
a) Volatile storage
5 1 93 b) Non-volatile storage 2 CO5
c) Stable storage
d) Dynamic storage
A ______ file system is software that enables multiple computers to share file
storage while maintaining consistent space allocation and file content.
a) Storage CO5
5 1 94 2
b) Tertiary
c) Secondary
d) Cluster
Data that is accessible via the storage medium is processed by the ___.
a) Cache
5 1 97 b) Main memory 2 CO5
c) Both A and B
d) None of the above
Flash memory files are stored on ___- keys, which are connected to a computer
through ___ ports.
a) USB CO5
5 1 100 2
b) UBS
c) BUS
d) SUB
1 2 1 List out DBMS applications with example. 2 CO1
1 2 2 Explain the concept of DML with example. 2 CO1
1 2 3 Describe the Database design in detail 2 CO1
1 2 4 Illustrate the View of Data and quote its types 2 CO1
1 2 5 Explain about Data Abstraction 2 CO1
1 2 6 Describe about Data Independence 2 CO2
1 2 7 Illustrate the concepts of Instance and Schema 2 CO2
Page 36
1 2 8 Explain the concepts of DDL. 2 CO2
1 2 9 Discuss the concepts of DCL & TCL. 2 CO2
1 2 10 Describe the concepts of Database Administrator. 2 CO2
2 2 11 Explain the concept of null value in DBMS relation 2 CO2
2 2 12 Summarise SQL fundamentals 2 CO2
2 2 13 Describe the Triggers with example. 2 CO2
2 2 14 Explain Security of databases. 2 CO2
2 2 15 Illustrate the Embedded SQL and Dynamic SQL 2 CO2
2 2 16 Describe Client/server database. 2 CO1
2 2 17 Discuss the concepts of Distributed DBMS. 2 CO1
2 2 18 Differentiate Client/Server and Distributed DBMS 2 CO1
2 2 19 Summarise the concepts of Integrity constraints. 1 CO3
2 2 20 Brief the concepts of SQL Data Types and Schemas 2 CO2
3 2 21 Brief then concept of Relational database design. 2 CO3
3 2 22 State the four stages of Relational database design 1 CO3
3 2 23 Describe functional dependencies and its rules in brief. 2 CO3
3 2 24 List out the Types of Functional Dependencies in DBMS 1 CO3
3 2 25 State the concept of Normalization and its needs. 2 CO3
3 2 26 Brief the types of Normalization. 2 CO3
3 2 27 List the advantages and disadvantages of Normalization 1 CO3
3 2 28 Describe the concept of Dependency Preserving 2 CO3
3 2 29 Explain the concept of Entity Sets and its Types in DBMS. 2 CO3
3 2 30 Describe Weak Entity and strong entity. 2 CO3
4 2 31 Brief the concepts of transaction states and transaction recovery 2 CO4
4 2 32 Explain the ACID Properties 2 CO4
4 2 33 Explain system Recovery and media recovery. 2 CO4
4 2 34 State the concepts of two phase commit protocol. 2 CO4
4 2 35 Summarise the concept of buffer management in DBMS 2 CO4
4 2 36 Illustrate the concept of concurrency and its need. 2 CO4
4 2 37 Explain the concept of locking protocols in DBMS. 2 CO4
4 2 38 Describe the deadlock handling concept in DBMS. 2 CO4
4 2 39 Brief the concepts of Serializability 2 CO4
4 2 40 Illustrate the concept of SQL Facilities for Concurrency. 2 CO4
5 2 41 Describe about the Overview of Physical Storage Media in short. 2 CO5
5 2 42 Illustrate Primary storage and secondary storage 2 CO5
5 2 43 Describe the concepts of Magnetic Disks 2 CO5
5 2 44 Brief the concepts of Tertiary storage 2 CO5
5 2 45 Explain the concepts of Organization of Records in Files 2 CO5
5 2 46 Describe about Ordered Indices 2 CO5
5 2 47 Explain the concept of Sorting in DBMS 2 CO5
5 2 48 Illustrate about the Catalogue Information for Cost Estimation in short 2 CO5
5 2 49 Explain about the Query optimization 2 CO5
5 2 50 Describe about Database Data Analysis 2 CO5
1 3 1 Explain the various Views of Data in DBMS. 2 CO1
1 3 2 Describe Data Abstraction, Data Independence and Instance and Schema in detail 2 CO1
1 3 3 Describe the various types of Database Languages. 2 CO1
1 3 4 Explain Data Definition Language, Data Manipulation Language with example querie 2 CO1
1 3 5 State Database Application Architecture and explain it in detail. 2 CO1
Page 37
1 3 6 Explain 1-Tier Architecture, 2-Tier Architecture and 3-Tier Architecture 2 CO1
2 3 7 Explain the Relational Model in DBMS with example. 2 CO2
2 3 8 Describe various types of keys used in DBMS. 2 CO2
2 3 9 Describe the concept of Relational algebra with example. 2 CO2
2 3 10 Explain Domain relational calculus, Tuple relational calculus with examples. 2 CO2
2 3 11 State and explain various Fundamental operations in relational algebra. 2 CO2
2 3 12 Explain Distributed Databases and Client/Server Databases. 2 CO2
3 3 13 Explain the Overview of the Relational Database Design Process 2 CO3
3 3 14 Explain the concepts of functional dependencies and its types 2 CO3
3 3 15 Explain the concepts of Normalization in detail. 2 CO3
3 3 16 Describe the conversion of 2nd normal form to Boyce Codd normal form 2 CO3
3 3 17 Explain the conversion of fourth normal form to fifth normal form,. 2 CO3
3 3 18 Describe in detail about Entity Sets and its Types in DBMS 2 CO3
Explain in detail about Transaction Concepts, Transaction States and Transaction CO4
4 3 19 2
Recovery.
4 3 20 Describe the concepts of Locking Protocols and Two Phase Locking 2 CO4
4 3 21 Explain the Deadlock Handling and Serializability 2 CO4
4 3 22 Summarise 2 CO4
Describe inthedetail
concept of Buffer
about management
the SQL Facilitiesand
forRemote Backup
recovery SystemsRecovery
Advanced
4 3 23 Techniques 2 CO4
4 3 24 Explain Two Phase Commit and Recovery Isolation Levels in detail 2 CO4
5 3 25 Describe in detail about the Redundant Array of Independent Disk 2 CO5
5 3 26 Explain in detail about Indexing and Hashing in DBMS 2 CO5
5 3 27 Describe in detail about B+ tree Index Files and B- tree Index Files 2 CO5
5 3 28 Explain Static Hashing and Dynamic Hashing 2 CO5
5 3 29 Explain Query Processing in DBMS 2 CO5
5 3 30 Explain the various types of Join Operation with example. 2 CO5
Page 38