Relational Database Management System (RDBMS) Solved MCQs (Multiple Choice Questions)

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

Unit 1: Introduction to RDBMS

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

a) Parsing and translation

b) Optimization

c) Evaluation

d) All of the mentioned

2. A relational algebra operation annotated with instructions on how to evaluate it is called _______

a) Evaluation algebra

b) Evaluation plan

c) Evaluation primitive

d) Evaluation engine

3. 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

4. The lowest level operator to access data in query processing is _______

a) File scan

b) File manipulation

c) File handling

d) File organization

5. Search algorithms that use an index are referred to as _________

a) Index scans

b) Search scans

c) Primary scans

d) Equality scans

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

a) Internal sorting

b) External sorting

c) Overflow sorting

d) Overload sorting

7. A selection of the form satisfying the intersection of all records satisfying individual simple conditions

is

a) Conjunctive selection

b) Disjunctive selection

c) Negation

Page 1

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

d) None of the mentioned

8. A selection of the form satisfying the union of all records satisfying individual simple conditions is

a) Conjunctive selection

b) Disjunctive selection

c) Negation

d) None of the mentioned

9. A selection of the form giving all the records not satisfying simple individual conditions is ______

a) Conjunctive selection

b) Disjunctive selection

c) Negation

d) None of the mentioned

10. Which of the following can be implemented?

a) Conjunctive selection using one index

b) Conjunctive selection using composite index

c) Conjunctive selection by intersection of identifiers

d) All of the mentioned

11. A join of the form r ⨝r.A=s.B s is called as

a) Equi join

b) Left outer join

c) Right outer join

d) Full outer join

12. for each tuple tr in r do begin

FOR each tuple ts IN s do BEGIN

test pair (tr , ts ) TO see IF they satisfy the JOIN condition _

IF they do, ADD tr • ts TO the RESULT;

END

13. What type of join is this?

a) Equi join

b) Hash join

c) Nested loop join

d) Block nested loop join

14. If nested loop join is done on a per block basis rather than on a per tuple basis, it is called as

a) Equi join

b) Hash join

c) Nested loop join

Page 2

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

d) Block nested loop join

15. The merge join can be used to compute

a) Natural joins

b) Equi joins

c) Both the mentioned

d) None of the mentioned

16. The ___________ merges the sorted relation with leaf entries of the secondary B+ tree index.

a) Merge join algorithm

b) Hybrid merge join algorithm

c) Hash join algorithm

d) Hybrid Hash join algorithm

17. The splitting of input until each partition of the build input fits the memory is called as ______

a) Temporary partitioning

b) Block partitioning

c) Recursive partitioning

d) Byte partitioning

18. Overflow resolution is performed when,

a) A hash index overflow is detected

b) Extra hash indices are to be added

c) When the number of partitions are to be increased

d) None of the mentioned

19. Which of the following is not a set operation

a) Union

b) Intersection

c) And operation

d) Set difference

20. Which of the following joins preserves the tuples of the relation on the left side of the operator?

a) Left outer join

b) Natural join

c) Right outer join

d) None of the mentioned

21. State true or false: The aggregation functions can be implemented in the same way as that of duplicate

elimination.

a) True

b) False

Page 3

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

22. If the results of one operation are passed on to the other, it is called as ________

a) Chain

b) Pipeline

c) Materialized

d) Tree

23. The result of each intermediate operation are created and then are used for valuation of the next level

operations, this evaluation is called as ________

a) Chain evaluation

b) Pipeline evaluation

c) Materialized evaluation

d) Demand driven evaluation

24. If the system makes repeated requests for tuples from the operation at the top of the table, it is called as

_________

a) Demand driven pipeline

b) Producer driven pipeline

c) Query driven pipeline

d) None of the mentioned

25. If the operations do not wait to produce tuples, then it is called as _________

a) Demand driven pipeline

b) Producer driven pipeline

c) Query driven pipeline

d) None of the mentioned

26. State true or false: Sorting is an inherently blocking operation

a) True

b) False

27. State true or false: Join is an inherently blocking operation

a) True

b) False

28. 7. Which of the following techniques does not exist?

a) Pipelined join technique

b) Left pipelined join technique

c) Right pipelined join technique

d) None of the mentioned

29. State true or false: Hybrid hash join is partially pipelined on the probe relation

a) True

b) False

Page 4

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

30. The usage of two buffers, with one continuing execution of the algorithm while the other is written is

called as __________

a) Double execution

b) Multi tasking

c) Double buffering

d) Double algorithm

31. Which of the following functions does an iterator not provide

a) Open()

b) Next()

c) Close()

d) Wait()

Unit 2 : Transaction Management

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

a) Views

b) Networks

c) Units

d) Transactions

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

a) Isolation

b) Durability

c) Atomicity

d) None of the mentioned

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

a) Atomicity

b) Durability

c) Isolation

d) All of the mentioned

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

a) Atomicity

b) Consistency

c) Durability

d) All of the mentioned

36. Which of the following is not a property of a transaction?

a) Atomicity

b) Simplicity

c) Isolation

Page 5

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

d) Durability

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

a) Recovery system

b) Atomic system

c) Concurrency control system

d) Compiler system

38. Which of the following systems is responsible for ensuring isolation?

a) Recovery system

b) Atomic system

c) Concurrency control system

d) Compiler system

39. State true or false: Information residing in the volatile storage does not usually survive system crashes

a) True

b) False

40. A transaction that has not been completed successfully is called as _______

a) Compensating transaction

b) Aborted transaction

c) Active transaction

d) Partially committed transaction

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

a) Active

b) Partially committed

c) Failed

d) Compensated

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

a) Serials

b) Schedules

c) Organizations

d) Time tables

43. 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

Page 6

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

44. 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.

a) Conflicting

b) Overwriting

c) Isolated

d) Durable

45. 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

46. 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

47. 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

48. A ___________of the transactions can be obtained by finding a linear order consistent with the partial

order of the precedence graph.

a) Serializability order

b) Direction graph

c) Precedence graph

d) Scheduling scheme

49. State true or false: If I = read(Q) and J = read(Q) then the order of I and J does not matter.

a) True

b) False

50. State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.

a) True

b) False

51. Which of the following is the most expensive method?

a) Timestamping

b) Plain locking

Page 7

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

c) Predicate locking

d) Snapshot isolation

52. A transaction that performs only one operation is called as a _________

a) Partial schedule

b) Complete schedule

c) Dependent schedule

d) Independent schedule

53. 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

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

a) True

b) False

55. A ___________ is one where, for each pair of transactions Ti and Tj such that Tj reads a data item

previously written by Ti , the commit operation of Ti appears before the commit operation of Tj

a) Partial schedule

b) Dependent schedule

c) Recoverable schedule

d) None of the mentioned

56. State true or false: Transactions can only run serially

a) True

b) False

57. 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

58. The average time for a transaction to be completed after it has been submitted is called as __________

a) Minimum response time

b) Average response time

c) Average reaction time

d) Minimum reaction time

Page 8

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

59. 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

60. 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

61. Which of the following is a transaction isolation level as specified by SQL standard?

a) Serializable

b) Repeatable read

c) Read committed

d) All of the mentioned

62. 2. State true or false: Serializable level may allow both serializable and non-serializable executions

a) True

b) False

63. ________ allows only committed data to be read and further requires that no other transaction is

allowed to update it between two reads of a data item by a transaction.

a) Read uncommitted

b) Serializable

c) Repeatable read

d) Read committed

64. ________ allows only committed data to be read, but does not require repeatable reads

a) Read uncommitted

b) Serializable

c) Repeatable read

d) Read committed

65. ___________ allows uncommitted data to be read

a) Read uncommitted

b) Serializable

c) Repeatable read

d) Read committed

66. State true or false: All the isolation levels disallow dirty writes

a) True

Page 9

DNYANSAGAR ARTS AND COMMERCE COLLEGE, BALEWADI, PUNE – 45

Subject : Relational Database Management System (RDBMS) Class : S.Y. BBA(CA)

Prof . S. B. Potadar www.dacc.edu.in

b) False

67. 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

68. In ___________ isolation each transaction is given its own version of the database

a) Timestamp

b) Snapshot

c) Lock based

d) All of the mentioned

69. What is the disadvantage of locking?

a) Does not control concurrency

b) Is not atomic

c) Is not durable

d) Has a poor degree of concurrency

70. 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

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

a) Deadlock prevention

b) Deadlock detection

c) Deadlock recovery

d) Deadlock distribution

72. Deadlocks can be prevented using

a) Preemption and transaction rollbacks

b) Wait and die scheme

c) Wound-wait scheme

d) All of the mentioned

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

a) True

b) False

Page 10

Relational Database Management System (RDBMS) Solved MCQs

Relational Database Management System (RDBMS) Solved MCQs

Download this file to view remaining 21 pages