2. is the smallest unit of allocation in an Oracle database.
Correct : D. database block
3. An Oracle is a set of tables and views that are used as a read-only reference about the database.
Correct : C. data dictionary
4. The is that part of main memory available for storage of copies of disk blocks.
Correct : A. buffer
5. A major goal of the database system is to minimize the number of block transfers between the disk and memory. This is achieved by
Correct : A. buffer
6. The subsystem responsible for the allocation of buffer space is called the
Correct : B. buffer manager
7. In the buffer where there is no space for another block, the block can be inserted using
Correct : C. buffer replacement strategy
8. A block that is not allowed to be written back to disk is said to be
Correct : A. pinned
9. In case the buffer manager do not write the blocks properly then the buffer manager uses
Correct : C. crash recovery system
10. The technique where the blocks which have been used are replaced is called
Correct : D. most recently used
11. frees the space occupied by a block as soon as the final tuple of that block has been processed.
Correct : C. toss immediate strategy
12. Indices whose search key specifies an order different from the sequential order of the file are called indices.
Correct : C. all of the mentioned
13. An consists of a search-key value and pointers to one or more records with that value as their search-key value.
Correct : A. index entry
14. In a clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
Correct : A. dense
15. In a index, an index entry appears for only some of the search-key values.
Correct : A. dense
16. A search key containing more than one attribute is referred to as a search key.
Correct : B. composite
17. In B+ tree the node which points to another node is called
Correct : D. internal node
18. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
Correct : A. less than 1
19. A technique for direct search is
Correct : D. hashing
20. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
Correct : B. 1, 8, 10, _, _, _, 3
21. Key value pairs is usually seen in
Correct : A. hash tables
22. What is the best definition of a collision in a hash table?
Correct : A. two entries are identical except for their keys
23. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
Correct : A. all keys hash to same index
24. Breadth First Search is used in
Correct : C. graphs
25. A(n) can be used to preserve the integrity of a document or a message.
Correct : C. encrypted message
26. The property (or set of properties) that uniquely defines each row in a table is called the:
Correct : C. primary key
27. The separation of the data definition from the program is known as:
Correct : B. data independence
28. In the client / server model, the database:
Correct : D. resides on the server side
29. The database design that consists of multiple tables that are linked together through matching data stored in each table is called
Correct : D. relational database
30. The association role defines:
Correct : A. how tables are related in the database
31. A on the attribute A of relation r consists of one bitmap for each value that A can take.
Correct : A. bitmap index
32. To identify the deleted records we use the
Correct : A. existence bitmap
33. Bitmaps can be combined with regular B+- tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.
Correct : B. bitmap, b+tree
34. What is the purpose of the index in sql server?
Correct : D. all of the mentioned
35. How many types of indexes are there in sql server?
Correct : B. 2
36. How non clustered index point to the data?
Correct : C. it is used for pointing data rows containing key values
37. Which one is true about clustered index?
Correct : B. clustered index is built by default on unique key columns
38. What is true about indexes?
Correct : B. it makes harder for sql server engines to work to work on index which have large keys
39. Does index take space in the disk?
Correct : B. yes, indexes are stored on disk
40. If an index is the metadata and statistics continue to exists
Correct : A. disabling
41. In index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
Correct : B. column store
42. A index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
Correct : C. covering
43. Which of the following schemas does define a view or views of the database for particular users?
Correct : D. external schema
44. Which of the following is an attribute that can uniquely identify a row in a table?
Correct : B. candidate key
45. Which of the following terms does refer to the correctness and completeness of the data in a database?
Correct : D. data integrity
46. The relationship between DEPARTMENT and EMPLOYEE is a
Correct : B. one-to-many relationship
47. 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
Correct : D. inconsistent state
48. Ensuring isolation property is the responsibility of the
Correct : B. concurrency-control component of the dbms
49. In query processing, the is the lowest-level operator to access data.
Correct : C. file scan
50. In a the system scans each file block and tests all records to see whether they satisfy the selection condition.
Correct : B. linear search
51. Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.
Correct : A. a2
52. The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is
Correct : B. a4
53. The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is
Correct : D. a6
54. The algorithm scans each index for pointers to tuples that satisfy an individual condition.
Correct : C. a9
55. If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by
Correct : A. a10
56. The space factor when determining the efficiency of an algorithm is measured by
Correct : A. counting the maximum memory needed by the algorithm
57. Which of the following case does not exist in complexity theory
Correct : D. null case
58. The Average case occur in linear search algorithm
Correct : A. when item is somewhere in the middle of the array
59. The complexity of the average case of an algorithm is
Correct : A. much more complicated to analyze than that of worst case
60. The complexity of a linear search algorithm is
Correct : A. o(n)
61. The complexity of Bubble sort algorithm is
Correct : C. o(n2)
62. A is a query that retrieves rows from more than one table or view:
Correct : C. join
63. A condition is referred to as
Correct : B. join condition
64. Which oracle is the join condition is specified using the WHERE clause:
Correct : C. pre-oracle 9i
65. Which is a join condition contains an equality operator:
Correct : A. equijoins
66. Which join refers to join records from the write table that have no matching key in the left table are include in the result set:
Correct : B. right outer join
67. Which operation are allowed in a join view:
Correct : D. all of the mentioned
68. Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
Correct : C. updatable join view
69. The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called
Correct : A. materialized evaluation
70. allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
Correct : A. buffering
71. Pipelines can be executed in
Correct : C. 2
72. In a the system makes repeated requests for tuples from the operation at the top of the pipeline.
Correct : A. demand-driven pipeline
73. In a operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
Correct : B. producer-driven pipeline
74. Each operation in a demand-driven pipeline can be implemented as an that provides the following functions: open(), next(), and close().
Correct : C. iterator
75. The iterator maintains the of its execution in between calls so that successive next() requests receive successive result tuples.
Correct : A. state
76. Tuples are generated in producer-driven pipelining, they are generated on demand, in demand- driven pipelining.
Correct : B. eagerly, lazily
77. When two inputs that we desire to pipeline into the join are not already sorted it is the technique.
Correct : D. double-pipelined join
78. Which of the following is/are false for RAW mode of FOR XML?
Correct : B. binary base32 returns the binary data in base32-encoded format
79. refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.
Correct : D. durability
80. You have a column that will only contain values from 0 to 256. What is the most economical data type to use for the column?
Correct : B. smallint
81. Problems occurs if we don’t implement a proper locking strategy
Correct : B. phantom reads
82. Which of the following fixed database roles can add or remove user IDs?
Correct : A. db_accessadmin
83. Which of the following pair of regular
Correct : C. (ab)* and a*b*
84. Which feature converts row data to a column for better analytical view?
Correct : C. pivot
85. What is the default “SORT” order for a SQL?
Correct : A. ascending
86. How inserting data through stored procedure do reduces network traffic and increase database performance?
Correct : C. the execution plan is stored in the cache after it was executed the first time
87. Stored procedures are safe from SQL injection attacks
Correct : A. true
88. Which of the following connection type supports application role permissions and password encryption?
Correct : D. ole db and odbc
89. Cursor that reflects the changes made to the database table even after the result set is returned
Correct : B. dynamic
90. Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
Correct : D. not dependency preserving and not lossless join
91. Which one of the following statements about normal forms is FALSE?
Correct : C. lossless, dependency-preserving decomposition into bcnf is always possible
92. Which of the following is TRUE?
Correct : C. every relation in bcnf is also in 3nf
93. 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 in
Correct : B. 2nf and hence also in 1nf
94. is a procedural extension of Oracle – SQL that offers language constructs similar to those in imperative programming languages.
Correct : B. pl/sql
95. combines the data manipulating power of SQL with the data processing power of Procedural languages.
Correct : A. pl/sql
96. has made PL/SQL code run faster without requiring any additional work on the part of the programmer.
Correct : C. oracle
97. A line of PL/SQL text contains groups of characters known as
Correct : A. lexical units
98. We use name PL/SQL program objects and units.
Correct : D. identifiers
99. A is an explicit numeric, character, string or Boolean value not represented by an identifier.
Correct : B. literals
100. If no header is specified, the block is said to be an PL/SQL block.