DBMS

1

1. The first generation of DBMS is represented by systemsa. Hierarchical and CODASYL systems. b. Relational modelc. Network modeld. None of the above

2. Which of the following SQL statements are helpful in database redesign?a. Correlated subqueries onlyb. EXISTS/NOT EXISTS expressions onlyc. Both of the above are helpfuld. None of the above are helpful.

3. What SQL command can be used to delete columns from a table?a. MODIFY TABLE TableName DROP COLUMN ColumnNameb. MODIFY TABLE TableName DROP ColumnNamec. ALTER TABLE TableName DROP COLUMN ColumnNamed. ALTER TABLE TableName DROP ColumnName

4. Database redesign is not terribly difficult if the:a. database is structuredb. database is well-designed.c. database has no datad. database is relatively small

5. Which SQL-92 standard SQL command can be used to change a table name?a. RENAME TABLEb. CHANGE TABLEc. ALTER TABLEd. None of the above is correct

6. The process of reading a database schema and producing a data model from that schema is known as:

a. data modelingb. database designc. reverse engineeringd. None of the above is correct

7. Before any changes to database structure are attempted one should first:a. clearly understand the current structure and contents of the database onlyb. test any changes on a test database only.c. create a complete backup of the operational database onlyd. All of the above should be done

8. Which of the following modifications may not succeed?a. Changing a column data type from char to dateb. Changing a column data type from numeric to charc. Both of the above actions should succeedd. Neither of the above actions will succeed

9. A regular subquery can be processed:a. from the top downb. from the bottom upc. by nestingd. None of the above is correct

DBMS

2

10. What SQL command can be used to add columns to a table?a. MODIFY TABLE TableName ADD COLUMN ColumnNameb. MODIFY TABLE TableName ADD ColumnNamec. ALTER TABLE TableName ADD COLUMN ColumnNamed. ALTER TABLE TableName ADD ColumnName

11. The EXISTS keyword will be true if:a. any row in the subquery meets the condition onlyb. all rows in the subquery fail the condition only.c. both of these two conditions are met.d. neither of these two conditions is met.

12. Changing cardinalities in a database is:a. a common database design taskb. a rare database design task, but does occur.c. a database design task that never occurs.d. is impossible to do, so a new database must be constructed and the data

moved into it.13. The NOT EXISTS keyword will be true if:

a. any row in the subquery meets the condition.b. all rows in the subquery fail the condition.c. both of these two conditions are met.d. neither of these two conditions is met

14. The data model that is produced from reverse engineering is:a. a conceptual model.b. an internal model.c. a logical model.d. None of the above is correct

15. To drop a column that is used as a foreign key, first:a. drop the primary key.b. drop the table containing the foreign keyc. drop the foreign key constraintd. All of the above must be done

16. What SQL command will allow you to change the table STUDENT to add the constraint named GradeCheck that states that the values of the Grade column must be greater than 0?

a. ALTER TABLE STUDENT ALTER CONSTRAINT GradeCheck (Grade > 0);

b. ALTER TABLE STUDENT ADD CONSTRAINT GradeCheck (Grade > 0);

c. ALTER TABLE STUDENT ADD CONSTRAINT GradeCheck CHECK (Grade > 0);

d. None of the above is correct.17. Which is not true of a correlated subquery?

a. EXISTS/NOT EXISTS is a form of a correlated subquery.b. The processing of the SELECT statements is nested.c. They can be used to verify functional dependencies.d. They are very similar to a regular subquery

DBMS

3

18. A tool that can help designers understand the dependencies of database structures is a:

a. dependency graph.b. data modelc. graphical displayd. None of the above is correct.

19. Data is a a. Raw fact and figureb. Metadatac. Information onlyd. None of the above.

20. A repository of information about a database is known as aa. Data Dictionaryb. Distributed databasec. Filed. None of the above

21. The overall description of the database is known asa. Instanceb. Schemac. Snapshotd. None of the above

22. Schema is same as an a. Extension of the databaseb. Intension of the databasec. Subschemad. 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 independenceb. Logical data independencec. External data independenced. None of the above

24. Create, Alter and Drop are the examples of a. DDLb. DMLc. VDLd. SDL

25. The term relation was chosen bya. Dr. Berry Boehmb. Dr. E.F. Codd.c. Dr. Jacobsond. None of the above

26. Each row of data is known as a a. Tupleb. Cardinalityc. Degree

DBMS

4

d. None of the above27. The number of tuples in a relation is known as

a. Cardinalityb. Degreec. Modalityd. None of the above

28. ER-model was introduced bya. E.F. Coddb. P.P. Chenc. Constantined. None of the above

29. The primary key of a weak entity needs to be formed. It is known as the a. Discriminator or partial keyb. Foreign keyc. Weak keyd. None of the above

30. The process of minimizing the difference between entities by identifying their common characteristics is known as

a. Specializationb. Generalizationc. Multiplicityd. None of the above

31. The process of compiling information on an object, there by abstracting a higher level object is known as

a. Specializationb. Generalizationc. Aggregationd. None of the above

32. The relationship between a weak entity-set is called as the a. Weak relationshipb. Identifying relationship c. Connecting relationshipd. Associative relationship

33. An ER-diagram that shows the concepts of Specialization and Generalization are known as

a. Extended ER-diagramsb. Effective ER-diagramsc. Expanded ER-diagramsd. Enhanced ER-diagrams

34. Those candidate keys which are not currently selected as the primary key are called as

a. Super keysb. Candidate keyc. Alternate keyd. None of the above

35. A key that has no meaning to the business or organization is

DBMS

5

a. Candidate keyb. Alternate keyc. Artificial keyd. 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 ruleb. Referential integrity rulec. Security integrity ruled. None of the above

37. A virtual relation is also known as aa. Viewb. Tablec. Snapshotd. None of the above

38. When we want to display records with attributes from many relations then we usea. SELECT operationb. PROJECT operationc. JOIN operationd. None of the above

39. What is the cardinality of a table with 50 rows and 5 columns?a. 50b. 5c. 250d. None of the above

40. What is the degree of a table with 50 rows and 5 columns?a. 50b. 5c. 250d. None of the above

41. To sort records we usea. ORDER BY clauseb. HAVING clausec. GROUP claused. None of the above

42. The logical tables of data extracted from existing tables are known asa. Recordsb. Viewsc. Queriesd. None of the above

43. Oracle provides a special table that can be used to test any function. This table isa. DUAL tableb. VIEW tablec. CALCULATION tabled. None of the above

44. ROLLBACK, COMMIT and SAVEPOINT are

DBMS

6

a. DMLsb. DDLsc. VDLsd. TCLs

45. Primary indexing is also known asa. Clustering indexb. Non-clustering indexc. Pinned indexingd. None of the above

46. A buffer use to store results of the recent querya. Cursorb. Triggersc. Packagesd. Exceptions

47. The process of decomposition of a table is known as a. Specializationb. Generalizationc. Normalizationd. None of the above

48. The process of Normalization was proposed by a. Dr. E.F. Coddb. Dr. Berry Boehmc. Jacobsond. None of the above

49. An association between two attributes of the same table is known asa. Functional Dependencyb. Multi Valued Dependencyc. Join Dependencyd. None of the above

50. After normalization the original table can be obtained bya. Delete operationb. Cascade operationc. Join operationd. None of the above

51. Every BCNF is ina. 1NFb. 2NFc. 3NFd. 4NF

52. Shadow paging was introduced bya. Boehmb. Dr. E.F. Coddc. Loried. None of the above

53. Shadowing maintainsa. 2 tables

DBMS

7

b. 3 tablesc. 4 tablesd. None of the above

54. The page size in shadowing technique is of the ordera. 210 to 215 bytesb. 211 to 215 bytesc. 212 to 216 bytesd. 213 to 217 bytes

55. Shadowing may result in a. Page lossb. Data scatteringc. Page swapd. 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. Bufferb. Fuzzy checkpointc. Shadow pagingd. 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 checkpointc. UNDO and REDOd. None of the above

58. Shadow paging is used fora. Writing same item at same locationb. Writing same item at different locationc. Creating shadowd. None of the above

59. The process of choosing a suitable execution strategy for processing a query is known as

a. Query optimizationb. Query evaluationc. Query execution pland. 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. Queryb. Relationc. Pipeliningd. None of the above

61. The syntax of the query is checked bya. Parserb. Compilerc. Assembler

DBMS

8

d. None of the above62. The first phase of query processing is

a. Decompositionb. Restructuringc. Analysisd. None of the above

63. The result of a query, in a query tree is represented bya. Root nodeb. Leaf nodec. Intermediary noded. None of the above

64. Which of the following query processing method is more efficient:a. Pipelining b. Materializationc. Tunnellingd. None of the above

DBMS

9

1. a2. c3. c4. c5. d6. c7. d8. a9. b10. d11. a12. a13. b14. d15. c16. c17. d18. a19. a20. a21. b22. b23. a24. a25. b26. a27. a28. b29. a30. b31. c32. b33. d34. c35. c36. a37. a38. c39. a40. 541. a42. b43. a44. d45. a46. a

DBMS

10

47. c48. a49. a50. c51. c52. c53. a54. a55. b56. b57. a58. b59. a60. c61. a62. a63. a64. a