Professional Documents
Culture Documents
Dbms PDF
Dbms PDF
1
DBMS
2
DBMS
18. A tool that can help designers understand the dependencies of database structures
is a:
a. dependency graph.
b. data model
c. graphical display
d. None of the above is correct.
19. Data is a
a. Raw fact and figure
b. Metadata
c. Information only
d. None of the above.
20. A repository of information about a database is known as a
a. Data Dictionary
b. Distributed database
c. File
d. None of the above
21. The overall description of the database is known as
a. Instance
b. Schema
c. Snapshot
d. None of the above
22. Schema is same as an
a. Extension of the database
b. Intension of the database
c. Subschema
d. None of the above
23. The physical storage structures of devices could be changed without affecting
conceptual schema. This is known as
a. Physical data independence
b. Logical data independence
c. External data independence
d. None of the above
24. Create, Alter and Drop are the examples of
a. DDL
b. DML
c. VDL
d. SDL
25. The term ‘relation’ was chosen by
a. Dr. Berry Boehm
b. Dr. E.F. Codd.
c. Dr. Jacobson
d. None of the above
26. Each row of data is known as a
a. Tuple
b. Cardinality
c. Degree
3
DBMS
4
DBMS
a. Candidate key
b. Alternate key
c. Artificial key
d. None of the above
36. A rule that states that in a base relation, the value of attribute of a primary key
cannot be null is called as
a. Entity integrity rule
b. Referential integrity rule
c. Security integrity rule
d. None of the above
37. A virtual relation is also known as a
a. View
b. Table
c. Snapshot
d. None of the above
38. When we want to display records with attributes from many relations then we use
a. SELECT operation
b. PROJECT operation
c. JOIN operation
d. None of the above
39. What is the cardinality of a table with 50 rows and 5 columns?
a. 50
b. 5
c. 250
d. None of the above
40. What is the degree of a table with 50 rows and 5 columns?
a. 50
b. 5
c. 250
d. None of the above
41. To sort records we use
a. ORDER BY clause
b. HAVING clause
c. GROUP clause
d. None of the above
42. The logical tables of data extracted from existing tables are known as
a. Records
b. Views
c. Queries
d. None of the above
43. Oracle provides a special table that can be used to test any function. This table is
a. DUAL table
b. VIEW table
c. CALCULATION table
d. None of the above
44. ROLLBACK, COMMIT and SAVEPOINT are
5
DBMS
a. DMLs
b. DDLs
c. VDLs
d. TCLs
45. Primary indexing is also known as
a. Clustering index
b. Non-clustering index
c. Pinned indexing
d. None of the above
46. A buffer use to store results of the recent query
a. Cursor
b. Triggers
c. Packages
d. Exceptions
47. The process of decomposition of a table is known as
a. Specialization
b. Generalization
c. Normalization
d. None of the above
48. The process of Normalization was proposed by
a. Dr. E.F. Codd
b. Dr. Berry Boehm
c. Jacobson
d. None of the above
49. An association between two attributes of the same table is known as
a. Functional Dependency
b. Multi Valued Dependency
c. Join Dependency
d. None of the above
50. After normalization the original table can be obtained by
a. Delete operation
b. Cascade operation
c. Join operation
d. None of the above
51. Every BCNF is in
a. 1NF
b. 2NF
c. 3NF
d. 4NF
52. Shadow paging was introduced by
a. Boehm
b. Dr. E.F. Codd
c. Lorie
d. None of the above
53. Shadowing maintains
a. 2 tables
6
DBMS
b. 3 tables
c. 4 tables
d. None of the above
54. The page size in shadowing technique is of the order
a. 210 to 215 bytes
b. 211 to 215 bytes
c. 212 to 216 bytes
d. 213 to 217 bytes
55. Shadowing may result in
a. Page loss
b. Data scattering
c. Page swap
d. None of the above
56. A checkpoint where transactions are allowed to perform updates even while
buffer blocks are being written out is called as a
a. Buffer
b. Fuzzy checkpoint
c. Shadow paging
d. None of the above
57. The point of synchronization between the database and the transaction log file is
called as a
a. Checkpoint
b. Fuzzy checkpoint
c. UNDO and REDO
d. None of the above
58. Shadow paging is used for
a. Writing same item at same location
b. Writing same item at different location
c. Creating shadow
d. None of the above
59. The process of choosing a suitable execution strategy for processing a query is
known as
a. Query optimization
b. Query evaluation
c. Query execution plan
d. None of the above
60. The process of sending the result of one operator to another operator without
creating a temporary relation to hold the intermediate results is known as
a. Query
b. Relation
c. Pipelining
d. None of the above
61. The syntax of the query is checked by
a. Parser
b. Compiler
c. Assembler
7
DBMS
8
DBMS
1. a
2. c
3. c
4. c
5. d
6. c
7. d
8. a
9. b
10. d
11. a
12. a
13. b
14. d
15. c
16. c
17. d
18. a
19. a
20. a
21. b
22. b
23. a
24. a
25. b
26. a
27. a
28. b
29. a
30. b
31. c
32. b
33. d
34. c
35. c
36. a
37. a
38. c
39. a
40. 5
41. a
42. b
43. a
44. d
45. a
46. a
9
DBMS
47. c
48. a
49. a
50. c
51. c
52. c
53. a
54. a
55. b
56. b
57. a
58. b
59. a
60. c
61. a
62. a
63. a
64. a
10