InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
The space overhead in dynamic hashing is ________ than that of static hashing(a) More(b) Less(c) Equal(d) None of the mentioned |
|
Answer» Correct answer is (b) Less To explain: The space overhead in dynamic hashing is less than that of static hashing. This is because the hash function is chosen based on the size of the file at some anticipated point in the future. |
|
| 52. |
Which of the following methods is used to reduce overhead?(a) Connection pooling(b) Parallel Processing(c) Caching Query Results at the server(d) All of the mentioned |
|
Answer» Right choice is (d) All of the mentioned For explanation: To reduce overhead, any of the following methods can be used. Connection pooling, Parallel processing or caching query results at the server. Caching query results at the server enables to reduce the number of database accesses every time a similar request is sent. |
|
| 53. |
The complement operation in bitmaps is done by using(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NOR |
|
Answer» Right answer is (c) Logical NOT The explanation: The complement operation in bitmaps is done by using the logical not operator. This is similar to the binary complement operation. |
|
| 54. |
Intersection of the bitmaps is done by(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NOR |
|
Answer» Correct answer is (a) Logical AND The explanation: The intersection of the bitmaps is done by the logical AND operation. This is similar to the binary set intersection operation which is done by the logical AND operation. |
|
| 55. |
Which of the following operations is used for the union of bitmaps?(a) Logical AND(b) Logical OR(c) Logical NOT(d) Logical NOR |
|
Answer» Correct option is (b) Logical OR Easiest explanation: The logical OR operation is used for the computation of the union of bitmaps. This is similar to the binary set union operation. |
|
| 56. |
Which of the following are steps in query processing?(a) Parsing and translation(b) Optimization(c) Evaluation(d) All of the mentioned |
|
Answer» The correct option is (d) All of the mentioned Easiest explanation: Parsing and translation, optimization, evaluation are all the basic steps to process a query. |
|
| 57. |
________ is an abstraction through which relationships are treated as higher level entities(a) Creation(b) Superseding(c) Attribute separation(d) Aggregation |
|
Answer» The correct choice is (d) Aggregation The best I can explain: One limitation of E-R model is that it cannot express relationships among relationships. Thus for this purpose, aggregation is used. Aggregation is an abstraction through which relationships are treated as higher level entities. |
|
| 58. |
Let E be an entity set in a relationship set R. If only some entities in E participate in relationships in R, Then the participation of E in R is __________(a) Partial(b) Total(c) Complete(d) Incomplete |
|
Answer» Correct choice is (b) Total Explanation: Let E be an entity set in a relationship set R. If only some entities in E participate in relationships in R, Then the participation of E in R is partial. |
|
| 59. |
A ___________ is an association among several entities.(a) Relationship(b) Association(c) Set(d) Combination |
|
Answer» Correct choice is (a) Relationship The explanation is: A relationship is an association among several entities. A relationship specifies how two entities are related. |
|
| 60. |
Let E be an entity set in a relationship set R. If every entity in E participates in at least one relationships in R, Then the participation of E in R is __________(a) Partial(b) Total(c) Complete(d) Incomplete |
|
Answer» The correct choice is (b) Total Easiest explanation: Let E be an entity set in a relationship set R. If every entity in E participates in at least one relation in R, Then the participation of E in R is total. |
|
| 61. |
The attributes of a relationship are called as _________ attributes(a) Relational(b) Conjunctive(c) Descriptive(d) None of the mentioned |
|
Answer» The correct answer is (c) Descriptive To elaborate: A relationship may also have attributes. These attributes are called as descriptive attributes. |
|
| 62. |
Which of the following is the specialization that permits multiple sets(a) Superclass specialization(b) Disjoint specialization(c) Overlapping specialization(d) None of the mentioned |
|
Answer» Right answer is (c) Overlapping specialization Explanation: Overlapping specialization is the type of specialization that permits multiple sets. But disjoint specialization does not permit multiple sets. Disjoint specialization permits at most one set. |
|
| 63. |
The similarities between the entity set can be expressed by which of the following features?(a) Specialization(b) Generalization(c) Uniquation(d) Inheritance |
|
Answer» Correct choice is (b) Generalization Explanation: The similarities between the entity set can be expressed by the generalization feature. It is a containment o the relationship that exists between a higher level entity set and one or more lower level entity sets. |
|
| 64. |
Which of the following can affect the placement of the relationship attributes?(a) Alphabetical order(b) The data in the attribute(c) Cardinality ratio(d) None of the mentioned |
|
Answer» Right answer is (c) Cardinality ratio Explanation: The cardinality ratio of a relationship can affect the placement of relationship attributes. The placement of the relationship attributes are not dependent on the alphabetical orderor the data in the attribute. |
|
| 65. |
The process of designating sub groupings within the entity set is called as _______(a) Specialization(b) Division(c) Aggregation(d) Finalization |
|
Answer» Correct answer is (a) Specialization The best explanation: The process of designating sub-groupings within the entity set is called as specialization. Specialization allows us to distinguish among entities. |
|
| 66. |
The part of SQL that deals with the SQL supports constructs is called as _______(a) Persistent construct dealer(b) Persistent storage module(c) Persistent supports center(d) Primary storage medium |
|
Answer» Right answer is (b) Persistent storage module To explain I would say: The part of SQL that deals with the SQL supports constructs is called as Persistent Storage Module (PSM). The SQL supports construct give it almost all the power of a general purpose programming language. |
|
| 67. |
Which of the following are not a part of PL/SQL(a) Triggers(b) Packages(c) Functions(d) None of the mentioned |
|
Answer» Right option is (d) None of the mentioned Best explanation: All the three mentioned features i.e. triggers, functions, packages are a part of PL/SQL. |
|
| 68. |
Using the _______ clause retains only one copy of identical tuples(a) distinct(b) is not null(c) no repeat(d) from |
|
Answer» The correct answer is (a) distinct Easiest explanation: Specifying the distinct clause beside the select clause retains only one copy of identical tuples resulting from the query. |
|
| 69. |
When does the predicate is null succeed?(a) If the value on which it is applied is finite(b) If the value on which it is applied is invalid(c) If the value on which it is applied is blank(d) If the value on which it is applied is more than the allowed limit |
|
Answer» The correct choice is (c) If the value on which it is applied is blank Explanation: The is null predicate succeeds when the value on which it is applied is blank/null. |
|
| 70. |
The slotted page structure is used for _________(a) Organizing records in a block(b) Organizing blocks in a database(c) Deleting records from a block(d) None of the mentioned |
|
Answer» Correct option is (a) Organizing records in a block Best explanation: The slotted page structure is used for organizing records in a block. The slotted page structure contains a header at the beginning of each block. |
|
| 71. |
What is a timestamp?(a) A combination of date and time with date first(b) A combination of date and time with time first(c) A combination of time and place with time first(d) A combination of time and place with place first |
|
Answer» Right answer is (a) A combination of date and time with date first For explanation I would say: A timestamp is a combination of date and time with date first. Eg: ‘2002-04-25 10:20:04.43’. |
|
| 72. |
What is the format of entering date into a database while inserting data into it?(a) YYYY-MM-DD(b) “YYYY-MM-DD”(c) ‘YYYY-MM-DD’(d) “DD-MM-YYYY” |
|
Answer» Correct answer is (c) ‘YYYY-MM-DD’ For explanation I would say: The correct format for entering date into the database while inserting data is ‘YYYY-MM-DD’. |
|
| 73. |
What does a null bitmap indicate?(a) The database does not exist(b) The record does not exist(c) The attributes of a record do not have a value(d) The attributes are missing from record |
|
Answer» Right answer is (c) The attributes of a record do not have a value The best I can explain: A null-bitmap indicates that the attributes of a particular record have null values. |
|
| 74. |
The linked list formed by the deleted records is called as ______(a) Delete list(b) Free list(c) Null list(d) Non-existent list |
|
Answer» The correct choice is (b) Free list Easy explanation: As the addresses can be thought of as pointers, the deleted records thus form a linked list. The linked list formed by the deleted records is called as a free list. |
|
| 75. |
Which of the following is not a valid Date and Time data type?(a) date(b) time(c) datestamp(d) timestamp |
|
Answer» Right option is (c) datestamp Explanation: datestamp is not a valid Date and Time data type. Timestamp exists but datestamp does not exist in SQL. |
|
| 76. |
Which of the following is a valid encryption technique?(a) Parallel key encryption(b) Public key encryption(c) Systematic key encryption(d) All of the mentioned |
|
Answer» The correct option is (b) Public key encryption Explanation: Out of the given options, only public key encryption is a valid approach to an encryption technique. In this, there are two different keys to encrypt the data. |
|
| 77. |
The data that have a time interval associated with them during which they are valid are called as ________(a) Timed data(b) Temporal data(c) Model data(d) Clocked data |
|
Answer» Correct answer is (b) Temporal data Explanation: The data that have a time interval associated with them during which they are valid are called as Temporal data. We use the term snapshot to mean the value of the data at a particular point in time. |
|
| 78. |
The time it takes to find a particular data item is called as ___________(a) Insertion time(b) Deletion time(c) Time overhead(d) Access time |
|
Answer» Correct option is (d) Access time For explanation: The time it takes to find a particular data item or a set of data items using the technique in question is called as access time. |
|
| 79. |
A particular sort order is said to be _________ sort order if it could be useful for a later operation.(a) Interesting(b) Reusable(c) Efficient(d) Good |
|
Answer» Correct option is (a) Interesting For explanation: A particular sort order is said to be interesting-sort order if it could be useful for a later operation. |
|
| 80. |
The value of the data at a particular time is called as?(a) Instance(b) Picture(c) Snapshot(d) None of the mentioned |
|
Answer» Correct option is (c) Snapshot Easiest explanation: The value of the data at a particular time is called as a snapshot. This is used in temporal data. |
|
| 81. |
Functional dependencies that have a time associated with them during which they are valid are called as________(a) Timed functional dependencies(b) Clocked functional dependencies(c) Temporal functional dependencies(d) Modeled functional dependencies |
|
Answer» Right answer is (c) Temporal functional dependencies To explain: Functional dependencies that have a time associated with them during which they are valid are called as temporal functional dependencies. All snapshots of the relation should satisfy the functional dependency for it to be a temporal functional dependency. |
|
| 82. |
Functional dependencies are sometimes referred to as ________(a) Equality generating dependencies(b) Tuple generating dependencies(c) Multi-purpose dependencies(d) None of the mentioned |
|
Answer» Correct option is (a) Equality generating dependencies For explanation I would say: Functional dependencies are sometimes referred to as equality generating dependencies because they require other tuples of a certain form to be present in the relation. |
|
| 83. |
The _______ is a set of all functional and multi values dependencies implied by a set of functional dependencies(a) Star(b) Closure(c) Derivation(d) Evolution |
|
Answer» Correct option is (b) Closure To explain: The closure is a set of all functional and multi values dependencies implied by a set of functional dependencies on a given relation. It is denoted by giving a “+” superscript. |
|
| 84. |
If A→B, A→ C then which of the following is true?(a) A→BC(b) A→B(c) A→C(d) All of the mentioned |
|
Answer» Correct option is (d) All of the mentioned Best explanation: Applying the union rule to the given question, we get, A→BC is true. The other two options are specified in the question itself. |
|
| 85. |
Armstrong axioms are called sound because?(a) They are expensive(b) They cannot generate correct functional dependencies(c) They allow us to generate the complete closure(d) They cannot generate incorrect functional dependencies |
|
Answer» Correct option is (d) They cannot generate incorrect functional dependencies Explanation: Armstrong’s axioms are called as sound axioms because they do not generate incorrect functional dependencies. |
|
| 86. |
Which package comprises of the core JDBC API?(a) java.sql(b) java.database(c) sql.java(d) java.relation |
|
Answer» Right choice is (a) java.sql For explanation: The java.sql package comprises of the core JDBC API. JDBC is an application program interface which contains all the functions to link and execute database functions in Java. |
|
| 87. |
Which of the following is not a transaction state?(a) Active(b) Partially committed(c) Failed(d) Compensated |
|
Answer» The correct option is (d) Compensated To explain: Compensated is not a transaction state. But active, partially committed and failed are different states of a transaction. |
|
| 88. |
If a transaction has obtained a ________ lock, it can both read and write on the item(a) Shared mode(b) Exclusive mode(c) Read only mode(d) Write only mode |
|
Answer» Right choice is (b) Exclusive mode The explanation is: If a transaction has obtained an exclusive mode lock, then it can both read and write on the item on which it in operating. |
|
| 89. |
If a transaction has obtained a __________ lock, it can read but cannot write on the item(a) Shared mode(b) Exclusive mode(c) Read only mode(d) Write only mode |
|
Answer» Correct answer is (a) Shared mode Explanation: If a transaction Ti has obtained a shared-mode lock (denoted by S) on item Q, then Ti can read, but cannot write, Q. |
|
| 90. |
An attack on a website that stores and displays text to a user is known as ______ attack(a) SQL attack(b) XSS attack(c) XRP attack(d) None of the mentioned |
|
Answer» Right choice is (b) XSS attack The explanation is: An attack on a website that stores and displays text to a user is known as XSS attack. It is called as cross site scripting attack. |
|
| 91. |
If K → R then K is said to be the _______ of R(a) Candidate key(b) Foreign key(c) Super key(d) Domain |
|
Answer» The correct choice is (c) Super key For explanation I would say: If K → R then k is said to be the superkey of R i.e. K uniquely identifies every tuple in the relation R. |
|
| 92. |
Which of the following is used to express database consistency?(a) Primary keys(b) Functional dependencies(c) Check clause(d) All of the mentioned |
|
Answer» Right choice is (d) All of the mentioned For explanation: Primary keys, Functional dependencies, Check clause are all used to express database consistency. |
|
| 93. |
X → Y holds on a schema k(K) if?(a) At least one legal instance satisfies the functional dependency(b) No legal instance satisfies the functional dependency(c) Each and every legal instance satisfies the functional dependency(d) None of the mentioned |
|
Answer» The correct answer is (c) Each and every legal instance satisfies the functional dependency Explanation: X → Y holds on a schema k(K) if each and every legal instance satisfies the functional dependency. Even if one instance does not satisfy the functional dependency X→ Y does not hold on a schema. |
|
| 94. |
Which of the following is not a condition for X→ Y in Boyce codd normal form?(a) X → Y is trivial(b) X is the superkey for the relational schema R(c) Y is the superkey for the relational schema R(d) All of the mentioned |
|
Answer» Right option is (c) Y is the superkey for the relational schema R Easiest explanation: Y does not need to be a superkey of the relation for the given functional dependency to satisfy BCNF. X→ Y must be trivial and X must be the superkey of the relation R. |
|
| 95. |
Which of the following symbols represent entity sets in an ER diagram?(a) Divided rectangles(b) Diamonds(c) Lines(d) Undivided rectangles |
|
Answer» Correct choice is (a) Divided rectangles Easy explanation: Rectangles divided into two parts represent entity sets in an ER diagram. The upper rectangle contains the name of the entity sets. And the lower rectangle contains the attributes. |
|
| 96. |
What do double diamonds represent in an ER diagram(a) They link entity sets to relationship sets(b) Total participation of an entity in a relationship set(c) Relationship sets linked to weak entity sets(d) None of the mentioned |
|
Answer» The correct answer is (c) Relationship sets linked to weak entity sets Explanation: The double diamonds represent the relationship sets linked to weak entity sets. Weak entity sets are the sets that do not have a primary key. |
|
| 97. |
Which of the following symbols represent relationship sets in an ER diagram(a) Divided rectangles(b) Diamonds(c) Lines(d) Undivided rectangles |
|
Answer» Right option is (b) Diamonds Explanation: Diamonds represent relationship sets in an ER diagram. Relationship sets define how two entity sets are related in a database. |
|
| 98. |
A domain whose elements are indivisible is called as ______(a) Unique domain(b) Proxy domain(c) Atomic domain(d) Multiple domain |
|
Answer» Correct option is (c) Atomic domain Explanation: A domain is said to be atomic if all of its elements are considered to be indivisible. If the domains are atomic, then the relational schema is in the first normal form. |
|
| 99. |
If the decomposition is able to represent all the facts about the relation then such a decomposition is called as?(a) Lossless decomposition(b) Lossy decomposition(c) Insecure decomposition(d) Secure decomposition |
|
Answer» Correct choice is (a) Lossless decomposition Best explanation: If the decomposition is able to represent all the facts about the relation then such a decomposition is called as a lossless decomposition. Lossless decompositions are generally preferred. |
|
| 100. |
A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F.(a) Canonical cover(b) Complete cover(c) Canonical dependency(d) Canonical clause |
|
Answer» The correct choice is (a) Canonical cover Explanation: A Canonical cover Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F. In Fc, no functional dependency should contain an extraneous attribute and each left side of functional dependency should be unique. |
|