| 1. | Which of the following is a Data Model? |
| A. | entity-relationship model |
| B. | relational data model |
| C. | object-based data model |
| D. | all of the above |
| Answer» D. all of the above | |
| 2. | A collection of related data. |
| A. | Information |
| B. | Valuable information |
| C. | Database |
| D. | Metadata |
| Answer» C. Database | |
| Explanation: A database is a collection of related data that is organized and structured in a way that allows for easy access and manipulation. It typically includes data tables, indices, and other components that are used to store, manage, and retrieve data. A database is a useful tool for storing and managing large amounts of structured data, and it is commonly used in a wide range of applications, including business, finance, healthcare, and more. | |
| 3. | DBMS is software. |
| A. | True |
| B. | False |
| C. | none |
| D. | all |
| Answer» A. True | |
| 4. | DBMS manages the interaction between __________ and database. |
| A. | Users |
| B. | Clients |
| C. | End Users |
| D. | Stake Holders |
| Answer» C. End Users | |
| 5. | Which of the following is not involved in DBMS? |
| A. | End Users |
| B. | Data |
| C. | Application Request |
| D. | HTML |
| Answer» D. HTML | |
| 6. | Database is generally __________ |
| A. | System-centered |
| B. | User-centered |
| C. | Company-centered |
| D. | Data-centered |
| Answer» B. User-centered | |
| 7. | A characteristic of an entity. |
| A. | Relation |
| B. | Attribute |
| C. | Parameter |
| D. | Constraint |
| Answer» B. Attribute | |
| 8. | The restrictions placed on the data. |
| A. | Relation |
| B. | Attribute |
| C. | Parameter |
| D. | Constraint |
| Answer» D. Constraint | |
| 9. | IMS stands for? |
| A. | Information Mastering System |
| B. | Instruction Management System |
| C. | Instruction Manipulating System |
| D. | Information Management System |
| Answer» D. Information Management System | |
| 10. | A model developed by Hammer and Mc Leod in 1981. |
| A. | SDM |
| B. | OODBM |
| C. | DDM |
| D. | RDM |
| Answer» A. SDM | |
| 11. | Object=_________+relationships. |
| A. | data |
| B. | attributes |
| C. | entity |
| D. | constraints |
| Answer» C. entity | |
| 12. | Duplication of data at several places is called as _______________. |
| A. | Data Inconsistency |
| B. | Data Isolation |
| C. | Atomicity Problem |
| D. | Data Redundance |
| Answer» D. Data Redundance | |
| 13. | Data Redundancy increases the cost of storing and retrieving data. |
| A. | False |
| B. | True |
| C. | none |
| D. | all |
| Answer» B. True | |
| 14. | Which of the information is not redundant. |
| A. | name |
| B. | mobile |
| C. | account-no |
| D. | address |
| Answer» C. account-no | |
| 15. | If in redundant file common fields are not matching then it results in _____________. |
| A. | Data Inconsistency |
| B. | Data Integrity Problem |
| C. | Data Isolation |
| D. | Data Redundancy |
| Answer» A. Data Inconsistency | |
| 16. | It is difficult to access conventional file system than Database System. |
| A. | True |
| B. | False |
| C. | none |
| D. | all |
| Answer» A. True | |
| 17. | An ________ is a set of entities of the same type that share the same properties, or attributes. |
| A. | Entity set |
| B. | Attribute set |
| C. | Relation set |
| D. | Entity model |
| Answer» A. Entity set | |
| 18. | Entity is a _________ |
| A. | Object of relation |
| B. | Present working model |
| C. | Thing in real world |
| D. | Model of relation |
| Answer» C. Thing in real world | |
| 19. | The descriptive property possessed by each entity set is _________ |
| A. | Entity |
| B. | Attribute |
| C. | Relation |
| D. | Model |
| Answer» B. Attribute | |
| 20. | The function that an entity plays in a relationship is called that entity’s _____________ |
| A. | Participation |
| B. | Position |
| C. | Role |
| D. | Instance |
| Answer» C. Role | |
| 21. | The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called |
| A. | Simple attribute |
| B. | Composite attribute |
| C. | Multivalued attribute |
| D. | Derived attribute |
| Answer» B. Composite attribute | |
| 22. | In a relation between the entities the type and condition of the relation should be specified. That is called as______attribute. |
| A. | Desciptive |
| B. | Derived |
| C. | Recursive |
| D. | Relative |
| Answer» A. Desciptive | |
| 23. | _____________ can help us detect poor E-R design. |
| A. | Database Design Process |
| B. | E-R Design Process |
| C. | Relational scheme |
| D. | Functional dependencies |
| Answer» D. Functional dependencies | |
| 24. | If a multivalued dependency holds and is not implied by the corresponding functional dependency, it usually arises from one of the following sources. |
| A. | A many-to-many relationship set |
| B. | A multivalued attribute of an entity set |
| C. | A one-to-many relationship set |
| D. | Both A many-to-many relationship set and A multivalued attribute of an entity set |
| Answer» D. Both A many-to-many relationship set and A multivalued attribute of an entity set | |
| 26. | In which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set. |
| A. | A many-to-many relationship set |
| B. | A multivalued attribute of an entity set |
| C. | A one-to-many relationship set |
| D. | All of the mentioned |
| Answer» B. A multivalued attribute of an entity set | |
| 27. | Suppose the user finds the usage of room number and phone number in a relational schema there is confusion.This is reduced by |
| A. | Unique-role assumption |
| B. | Unique-key assignment |
| C. | Role intergral assignment |
| D. | None of the mentioned |
| Answer» A. Unique-role assumption | |
| 28. | Designers use which of the following to tune the performance of systems to support timecritical operations? |
| A. | Denormalization |
| B. | Redundant optimization |
| C. | Optimization |
| D. | Realization |
| Answer» A. Denormalization | |
| 29. | In the schema (dept name, size) we have relations total inst 2007, total inst 200Q:8) Which dependency have lead to this relation ? |
| A. | Dept name, year->size |
| B. | Year->size |
| C. | Dept name->size |
| D. | Size->year |
| Answer» A. Dept name, year->size | |
| 30. | Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in |
| A. | Fourth NF |
| B. | BCNF |
| C. | Third NF |
| D. | Second NF |
| Answer» B. BCNF | |
| 31. | Thus a _______ of course data gives the values of all attributes, such as title and department, of all courses at a particular point in time. |
| A. | Instance |
| B. | Snapshot |
| C. | Both Instance and Snapshot |
| D. | All of the mentioned |
| Answer» B. Snapshot | |
| 32. | Representations such as the in the dept year relation, with one column for each value of an attribute, are called _______ they are widely used in spreadsheets and reports and in data analysis tools. |
| A. | Cross-tabs |
| B. | Snapshot |
| C. | Both Cross-tabs and Snapshot |
| D. | All of the mentioned |
| Answer» A. Cross-tabs | |
| 33. | Data Model is collection of conceptual tools for describing – |
| A. | Data |
| B. | All of these |
| C. | Data Schema |
| D. | Consistency Constaints |
| Answer» B. All of these | |
| 34. | Data Models in DBMS are classified into ______ categories. |
| A. | 3 |
| B. | 2 |
| C. | 5 |
| D. | 4 |
| Answer» C. 5 | |
| 35. | Object based logical model(s) are used to describe data at – [Select Appropriate Option(s)] |
| A. | View Level |
| B. | Logical Level |
| C. | Physical Level |
| D. | None of these |
| Answer» C. Physical Level | |
| 36. | Which of the following is example of Object based logical model ? |
| A. | Relational Model |
| B. | Hierarchical Model |
| C. | Network Model |
| D. | Entity Relationship Model |
| Answer» D. Entity Relationship Model | |
| 37. | Entity Relationship model consists of collection of basic objects called _________ and relationship among these objects. |
| A. | functions |
| B. | models |
| C. | None of these |
| D. | entities |
| Answer» D. entities | |
| 38. | Which of the following gives a logical structure of the database graphically? |
| A. | Entity-relationship diagram |
| B. | Entity diagram |
| C. | Database diagram |
| D. | Architectural representation |
| Answer» A. Entity-relationship diagram | |
| 39. | Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This indicates _________ cardinality |
| A. | One to many |
| B. | One to one |
| C. | Many to many |
| D. | Many to one |
| Answer» B. One to one | |
| 40. | We indicate roles in E-R diagrams by labeling the lines that connect ___________ to __________ |
| A. | Diamond , diamond |
| B. | Rectangle, diamond |
| C. | Rectangle, rectangle |
| D. | Diamond, rectangle |
| Answer» D. Diamond, rectangle | |
| 41. | An entity set that does not have sufficient attributes to form a primary key is termed a __________ |
| A. | Strong entity set |
| B. | Variant set |
| C. | Weak entity set |
| D. | Variable set |
| Answer» C. Weak entity set | |
| 42. | For a weak entity set to be meaningful, it must be associated with another entity set, called the |
| A. | Identifying set |
| B. | Owner set |
| C. | Neighbour set |
| D. | Strong entity set |
| Answer» A. Identifying set | |
| 43. | If you were collecting and storing information about your music collection, an album would be considered a(n) _____ |
| A. | Relation |
| B. | Entity |
| C. | Instance |
| D. | Attribute |
| Answer» B. Entity | |
| 44. | What term is used to refer to a specific record in your music database; for instance; information stored about a specific album? |
| A. | Relation |
| B. | Instance |
| C. | Table |
| D. | Column |
| Answer» B. Instance | |
Chapter: FIle Structure and Organization
| 45. | If a piece of data is stored in two places in the database, then |
| A. | Storage space is wasted |
| B. | Changing the data in one spot will cause data inconsistency |
| C. | In can be more easily accessed |
| D. | Storage space is wasted & Changing the data in one spot will cause data inconsistency |
| Answer» D. Storage space is wasted & Changing the data in one spot will cause data inconsistency | |
| 46. | An audit trail ___________ |
| A. | Is used to make backup copies |
| B. | Is the recorded history of operations performed on a file |
| C. | Can be used to restore lost information |
| D. | None of the mentioned |
| Answer» B. Is the recorded history of operations performed on a file | |
| 47. | Large collection of files are called ____________ |
| A. | Fields |
| B. | Records |
| C. | Database |
| D. | Sectors |
| Answer» C. Database | |
| 48. | Which of the following hardware component is the most important to the operation of a database management system? |
| A. | High resolution video display |
| B. | Printer |
| C. | High speed, large capacity disk |
| D. | Mouse |
| Answer» C. High speed, large capacity disk | |
| 49. | Which of the following is not true of the traditional approach to information processing |
| A. | There is common sharing of data among the various applications |
| B. | It is file oriented |
| C. | Programs are dependent on the file |
| D. | It is inflexible |
| Answer» A. There is common sharing of data among the various applications | |
| 51. | A data dictionary is a special file that contains? |
| A. | The names of all fields in all files |
| B. | The data types of all fields in all files |
| C. | The widths of all fields in all files |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 52. | A relational database system needs to maintain data about the relations, such as the schema of the relations. This is called |
| A. | Metadata |
| B. | Catalog |
| C. | Log |
| D. | Dictionary |
| Answer» A. Metadata | |
| 53. | Relational schemas and other metadata about relations are stored in a structure called the ____________ |
| A. | Metadata |
| B. | Catalog |
| C. | Log |
| D. | Data Dictionary |
| Answer» D. Data Dictionary | |
| 54. | ___________ is the collection of memory structures and Oracle background processes that operates against an Oracle database. |
| A. | Database |
| B. | Instance |
| C. | Tablespace |
| D. | Segment |
| Answer» B. Instance | |
| 55. | A ________ is a logical grouping of database objects, usually to facilitate security, performance, or the availability of database objects such as tables and indexes. |
| A. | Tablespace |
| B. | Segments |
| C. | Extents |
| D. | Blocks |
| Answer» A. Tablespace | |
| 56. | A tablespace is further broken down into ________ |
| A. | Tablespace |
| B. | Segments |
| C. | Extents |
| D. | Blocks |
| Answer» B. Segments | |
| 57. | __________ is a contiguous group of blocks allocated for use as part of a table, index, and so forth. |
| A. | Tablespace |
| B. | Segment |
| C. | Extent |
| D. | Block |
| Answer» C. Extent | |
| 58. | ________ is the smallest unit of allocation in an Oracle database. |
| A. | Database |
| B. | Instance |
| C. | Tablespace |
| D. | Database Block |
| Answer» D. Database Block | |
| 59. | An Oracle __________ is a set of tables and views that are used as a read-only reference about the database. |
| A. | Database dictionary |
| B. | Dictionary table |
| C. | Data dictionary |
| D. | Dictionary |
| Answer» C. Data dictionary | |
| 60. | A data dictionary is created when a __________ created. |
| A. | Instance |
| B. | Segment |
| C. | Database |
| D. | Dictionary |
| Answer» C. Database | |
| 61. | An Oracle object type has two parts the _________ and__________ |
| A. | Instance and body |
| B. | Segment and blocks |
| C. | Specification and body |
| D. | Body and segment |
| Answer» C. Specification and body | |
| 62. | A(n) _________ can be used to preserve the integrity of a document or a message. |
| A. | Message digest |
| B. | Message summary |
| C. | Encrypted message |
| D. | None of the mentioned |
| Answer» A. Message digest | |
| 63. | A hash function must meet ________ criteriA:) |
| A. | Two |
| B. | Three |
| C. | Four |
| D. | None of the mentioned |
| Answer» B. Three | |
| 64. | What is the main limitation of Hierarchical Databases? |
| A. | Limited capacity (unable to hold much datA:) |
| B. | Limited flexibility in accessing data |
| C. | Overhead associated with maintaining indexes |
| D. | The performance of the database is poor |
| Answer» B. Limited flexibility in accessing data | |
| 65. | The property (or set of properties) that uniquely defines each row in a table is called the: |
| A. | Identifier |
| B. | Index |
| C. | Primary key |
| D. | Symmetric key |
| Answer» C. Primary key | |
| 66. | The separation of the data definition from the program is known as: |
| A. | Data dictionary |
| B. | Data independence |
| C. | Data integrity |
| D. | Referential integrity |
| Answer» B. Data independence | |
| 67. | The traditional storage of data that is organized by customer, stored in separate folders in filing cabinets is an example of what type of ‘database’ system? |
| A. | Hierarchical |
| B. | Network |
| C. | Object oriented |
| D. | Relational |
| Answer» A. Hierarchical | |
| 68. | The database design that consists of multiple tables that are linked together through matching data stored in each table is called |
| A. | Hierarchical database |
| B. | Network database |
| C. | Object oriented database |
| D. | Relational database |
| Answer» D. Relational database | |
| 69. | The association role defines: |
| A. | How tables are related in the database |
| B. | The relationship between the class diagram and the tables in the database |
| C. | The tables that each attribute is contained |
| D. | Which attribute is the table’s primary key |
| Answer» A. How tables are related in the database | |
| 70. | The purpose of an N-Ary association is: |
| A. | To capture a parent-child relationship |
| B. | To deal with one to many relationships |
| C. | To deal with relationships that involve more than two tables |
| D. | To represent an inheritance relationship |
| Answer» C. To deal with relationships that involve more than two tables | |
| 71. | In ordered indices the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file. |
| A. | Clustered index |
| B. | Structured index |
| C. | Unstructured index |
| D. | Nonclustered index |
| Answer» A. Clustered index | |
| 72. | Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices. |
| A. | Nonclustered |
| B. | Secondary |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» C. All of the mentioned | |
| 73. | An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value. |
| A. | Index entry |
| B. | Index hash |
| C. | Index cluster |
| D. | Index map |
| Answer» A. Index entry | |
| 74. | 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. |
| A. | Dense |
| B. | Sparse |
| C. | Straight |
| D. | Continuous |
| Answer» A. Dense | |
| 76. | Incase the indices values are larger, index is created for these values of the index. This is called |
| A. | Pointed index |
| B. | Sequential index |
| C. | Multilevel index |
| D. | Multiple index |
| Answer» C. Multilevel index | |
| 77. | A search key containing more than one attribute is referred to as a _________ search key. |
| A. | Simple |
| B. | Composite |
| C. | Compound |
| D. | Secondary |
| Answer» B. Composite | |
| 78. | Insertion of a large number of entries at a time into an index is referred to as __________ of the index. |
| A. | Loading |
| B. | Bulk insertion |
| C. | Bulk loading |
| D. | Increase insertion |
| Answer» C. Bulk loading | |
| 79. | While inserting the record into the index, if the search-key value does not appear in the index. |
| A. | The system adds a pointer to the new record in the index entry |
| B. | The system places the record being inserted after the other records with the same searchkey values |
| C. | The system inserts an index entry with the search-key value in the index at the appropriate position |
| D. | None of the mentioned |
| Answer» C. The system inserts an index entry with the search-key value in the index at the appropriate position | |
| 80. | A collection of data designed to be used by different people is called a/an |
| A. | Organization |
| B. | Database |
| C. | Relationship |
| D. | Schema |
| Answer» B. Database | |
| 81. | Which of the following is the oldest database model? |
| A. | Relational |
| B. | Deductive |
| C. | Physical |
| D. | Network |
| Answer» D. Network | |
| 82. | Which of the following schemas does define a view or views of the database for particular users? |
| A. | Internal schema |
| B. | Conceptual schema |
| C. | Physical schema |
| D. | External schema |
| Answer» D. External schema | |
| 83. | Which of the following are the process of selecting the data storage and data access characteristics of the database? |
| A. | Logical database design |
| B. | Physical database design |
| C. | Testing and performance tuning |
| D. | Evaluation and selecting |
| Answer» B. Physical database design | |
| 84. | Which of the following terms does refer to the correctness and completeness of the data in a database? |
| A. | Data security |
| B. | Data constraint |
| C. | Data independence |
| D. | Data integrity |
| Answer» D. Data integrity | |
| 85. | A table can be logically connected to another table by defining a |
| A. | Super key |
| B. | Candidate key |
| C. | Primary key |
| D. | Unique key |
| Answer» C. Primary key | |
| 86. | 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 |
| A. | Consistent state |
| B. | Parallel state |
| C. | Durable state |
| D. | Inconsistent state |
| Answer» D. Inconsistent state | |
| 87. | Ensuring isolation property is the responsibility of the |
| A. | Recovery-management component of the DBMS |
| B. | Concurrency-control component of the DBMS |
| C. | Transaction-management component of the DBMS |
| D. | Buffer management component in DBMS |
| Answer» B. Concurrency-control component of the DBMS | |
Chapter: Relational Modal
| 88. | Relational Algebra is a __________ query language that takes two relations as input and produces another relation as an output of the query. |
| A. | Relational |
| B. | Structural |
| C. | Procedural |
| D. | Fundamental |
| Answer» C. Procedural | |
| 89. | For select operation the ________ appear in the subscript and the ___________ argument appears in the paranthesis after the sigmA:) |
| A. | Predicates, relation |
| B. | Relation, Predicates |
| C. | Operation, Predicates |
| D. | Relation, Operation |
| Answer» A. Predicates, relation | |
| 90. | The ___________ operation, denoted by −, allows us to find tuples that are in one relation but are not in another. |
| A. | Union |
| B. | Set-difference |
| C. | Difference |
| D. | Intersection |
| Answer» B. Set-difference | |
| 91. | In precedence of set operators, the expression is evaluated from |
| A. | Left to left |
| B. | Left to right |
| C. | Right to left |
| D. | From user specification |
| Answer» B. Left to right | |
| 92. | Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record? |
| A. | Candidate key |
| B. | Sub key |
| C. | Super key |
| D. | Foreign key |
| Answer» C. Super key | |
| 93. | Consider attributes ID, CITY and NAME. Which one of this can be considered as a super key? |
| A. | NAME |
| B. | ID |
| C. | CITY |
| D. | CITY, ID |
| Answer» B. ID | |
| 94. | A _____ is a property of the entire relation, rather than of the individual tuples in which each tuple is unique. |
| A. | Rows |
| B. | Key |
| C. | Attribute |
| D. | Fields |
| Answer» B. Key | |
| 95. | An attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation. |
| A. | Candidate |
| B. | Primary |
| C. | Super |
| D. | Sub |
| Answer» B. Primary | |
| 96. | The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called ______________ |
| A. | Referential relation |
| B. | Referencing relation |
| C. | Referenced relation |
| D. | Referred relation |
| Answer» C. Referenced relation | |
| 97. | The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation. |
| A. | Referential relation |
| B. | Referencing relation |
| C. | Referenced relation |
| D. | Referred relation |
| Answer» C. Referenced relation | |
| 98. | A _________ integrity constraint requires that the values appearing in specified attributes of any tuple in the referencing relation also appear in specified attributes of at least one tuple in the referenced relation. |
| A. | Referential |
| B. | Referencing |
| C. | Specific |
| D. | Primary |
| Answer» A. Referential | |
| 99. | A relational database consists of a collection of |
| A. | Tables |
| B. | Fields |
| C. | Records |
| D. | Keys |
| Answer» A. Tables | |
| 101. | The term _______ is used to refer to a row. | |
| A. | Attribute | |
| B. | Tuple | |
| C. | Field | |
| D. | Instance | |
| Answer» B. Tuple | ||
| 102. | The term attribute refers to a ___________ of a table. |
| A. | Record |
| B. | Column |
| C. | Tuple |
| D. | Key |
| Answer» B. Column | |
| 103. | For each attribute of a relation, there is a set of permitted values, called the ________ of that attribute. |
| A. | Domain |
| B. | Relation |
| C. | Set |
| D. | Schema |
| Answer» A. Domain | |
| 104. | Database __________ which is the logical design of the database, and the database _______ which is a snapshot of the data in the database at a given instant in time. |
| A. | Instance, Schema |
| B. | Relation, Schema |
| C. | Relation, Domain |
| D. | Schema, Instance |
| Answer» D. Schema, Instance | |
| 105. | Course(course_id,sec_id,semester) Here the course_id,sec_id and semester are __________ and course is a _________ |
| A. | Relations, Attribute |
| B. | Attributes, Relation |
| C. | Tuple, Relation |
| D. | Tuple, Attributes |
| Answer» B. Attributes, Relation | |
| 106. | Department (dept name, building, budget) and Employee (employee_id, name, dept name, salary) Here the dept_name attribute appears in both the relations. Here using common attributes in relation schema is one way of relating ___________ relations. |
| A. | Attributes of common |
| B. | Tuple of common |
| C. | Tuple of distinct |
| D. | Attributes of distinct |
| Answer» C. Tuple of distinct | |
| 107. | A domain is atomic if elements of the domain are considered to be ____________ units. |
| A. | Different |
| B. | Indivisbile |
| C. | Constant |
| D. | Divisible |
| Answer» B. Indivisbile | |
| 108. | The tuples of the relations can be of ________ order. |
| A. | Any |
| B. | Same |
| C. | Sorted |
| D. | Constant |
| Answer» A. Any | |
| 109. | Choose the correct statement regarding superkeys |
| A. | A superkey is an attribute or a group of multiple attributes that can uniquely identify a tuple |
| B. | A superkey is a tuple or a set of multiple tuples that can uniquely identify an attribute |
| C. | Every superkey is a candidate key |
| D. | A superkey is an attribute or a set of attributes that distinguish the relation from other relations |
| Answer» A. A superkey is an attribute or a group of multiple attributes that can uniquely identify a tuple | |
| 110. | What is an Instance of a Database? |
| A. | The logical design of the database system |
| B. | The entire set of attributes of the Database put together in a single relation |
| C. | The state of the database system at any given point of time |
| D. | The initial values inserted into the Database immediately after its creation |
| Answer» C. The state of the database system at any given point of time | |
| 111. | What is a foreign key? |
| A. | A foreign key is a primary key of a relation which is an attribute in another relation |
| B. | A foreign key is a superkey of a relation which is an attribute in more than one other relations |
| C. | A foreign key is an attribute of a relation that is a primary key of another relation |
| D. | A foreign key is the primary key of a relation that does not occur anywhere else in the schema |
| Answer» C. A foreign key is an attribute of a relation that is a primary key of another relation | |
| 112. | What action does ⋈ operator perform in relational algebra |
| A. | Output specified attributes from all rows of the input relation and remove duplicate tuples from the output |
| B. | Outputs pairs of rows from the two input relations that have the same value on all attributes that have the same name |
| C. | Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes) |
| D. | Return rows of the input relation that satisfy the predicate |
| Answer» A. Output specified attributes from all rows of the input relation and remove duplicate tuples from the output | |
| 113. | What does the “x” operator do in relational algebra? |
| A. | Output specified attributes from all rows of the input relation. Remove duplicate tuples from the output |
| B. | Output pairs of rows from the two input relations that have the same value on all attributes that have the same name |
| C. | Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes) |
| D. | Returns the rows of the input relation that satisfy the predicate |
| Answer» C. Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes) | |
| 114. | An attribute is a __________ in a relation. |
| A. | Row |
| B. | Column |
| C. | Value |
| D. | Tuple |
| Answer» B. Column | |
| 115. | What is the method of specifying a primary key in a schema description? |
| A. | By writing it in bold letters |
| B. | By underlining it using a dashed line |
| C. | By writing it in capital letters |
| D. | By underlining it using a bold line |
| Answer» D. By underlining it using a bold line | |
| 116. | Statement 1: A tuple is a row in a relation Statement 2: Existence of multiple foreign keys in a same relation is possible |
| A. | Both the statements are true |
| B. | Statement 1 is correct but Statement 2 is false |
| C. | Statement 1 is false but Statement 2 is correct |
| D. | Both the statements are false |
| Answer» A. Both the statements are true | |
| 117. | Choose the option that correctly explains in words, the function of the following relational algebra expression σyear≥2009 (book ⋈ borrow) |
| A. | Selects all tuples from the Cartesian product of book and borrow |
| B. | Selects all the tuples from the natural join of book and borrow wherever the year is lesser than 2009 |
| C. | Selects all the tuples from the natural join of book and student wherever the year is greater than or equal to 2009 |
| D. | Selects all tuples from the Cartesian product of book and borrow wherever the year is greater than or equal to 2009 |
| Answer» B. Selects all the tuples from the natural join of book and borrow wherever the year is lesser than 2009 | |
| 118. | State true or false: If a relation consists of a foreign key, then it is called a referenced relation of the foreign key dependency. |
| A. | True |
| B. | False |
| C. | none |
| D. | all |
| Answer» B. False | |
| 119. | Which of the following information does an SQL DDL not specify? |
| A. | The schema for each relation |
| B. | The integrity constraints |
| C. | The operations on the tuples |
| D. | The security and authorization information for each relation |
| Answer» C. The operations on the tuples | |
| 120. | Which of the following data types does the SQL standard not support? |
| A. | char(n) |
| B. | String(n) |
| C. | varchar(n) |
| D. | float(n) |
| Answer» B. String(n) | |
| 121. | Which command is used to create a new relation in SQL |
| A. | create table( , …) |
| B. | create relation( , …) |
| C. | new table( , …) |
| D. | new relation( , …) |
| Answer» A. create table( , …) | |
| 122. | If a1, a2, a3 are attributes in a relation and S is another relation, which of the following is an incorrect specification of an integrity constraint? |
| A. | primary key(a1, a2, a3) |
| B. | primary key(a1) |
| C. | foreign key(a1, a2) references S |
| D. | foreign key(a1, a2) |
| Answer» D. foreign key(a1, a2) | |
| 123. | What is the syntax to load data into the database? (Consider D as the database and a, b, c as datA:) |
| A. | enter into D (a, b, C:); |
| B. | insert into D values (a, b, C:); |
| C. | insert into D (a, b, C:); |
| D. | insert (a, b, C:) values into D; |
| Answer» B. insert into D values (a, b, C:); | |
| 124. | Which of the following commands do we use to delete a relation (R) from a database? |
| A. | drop table R |
| B. | drop relation R |
| C. | delete table R |
| D. | delete from R |
| Answer» A. drop table R | |
| 126. | Choose the correct command to delete an attribute A from a relation R | |
| A. | alter table R delete A | |
| B. | alter table R drop A | |
| C. | alter table drop A from R | |
| D. | delete A from R | |
| Answer» B. alter table R drop A | ||
| 127. | create table apartment(ownerID varchar (5), ownername varchar(25), floor numeric(4,0), primary key (ownerID:)); Choose the correct option regarding the above statement |
| A. | The statement is syntactically wrong |
| B. | It creates a relation with three attributes ownerID, ownername, floor in which floor cannot be null. |
| C. | It creates a relation with three attributes ownerID, ownername, floor in which ownerID cannot be null. |
| D. | It creates a relation with three attributes ownerID, ownername, floor in which ownername must consist of at least 25 characters. |
| Answer» C. It creates a relation with three attributes ownerID, ownername, floor in which ownerID cannot be null. | |
| 128. | What does the notnull integrity constraint do? |
| A. | It ensures that at least one tuple is present in the relation |
| B. | It ensures that at least one foreign key is present in the relation |
| C. | It ensures that all tuples have a finite value on a specified attribute |
| D. | It ensures that all tuples have finite attributes on all the relations |
| Answer» C. It ensures that all tuples have a finite value on a specified attribute | |
Chapter: SQL
| 129. | Which SQL function is used to count the number of rows in a SQL query? |
| A. | COUNT() |
| B. | NUMBER() |
| C. | SUM() |
| D. | COUNT(*) |
| Answer» D. COUNT(*) | |
| 130. | Which SQL keyword is used to retrieve a maximum value? |
| A. | MOST |
| B. | TOP |
| C. | MAX |
| D. | UPPER |
| Answer» C. MAX | |
| 131. | Which of the following SQL clauses is used to DELETE tuples from a database table? |
| A. | DELETE |
| B. | REMOVE |
| C. | DROP |
| D. | CLEAR |
| Answer» A. DELETE | |
| 132. | ___________removes all rows from a table without logging the individual row deletions. |
| A. | DELETE |
| B. | REMOVE |
| C. | DROP |
| D. | TRUNCATE |
| Answer» D. TRUNCATE | |
| 133. | Which of the following is not a DDL command? |
| A. | UPDATE |
| B. | TRUNCATE |
| C. | ALTER |
| D. | None of the Mentioned |
| Answer» A. UPDATE | |
| 134. | Which of the following are TCL commands? |
| A. | UPDATE and TRUNCATE |
| B. | SELECT and INSERT |
| C. | GRANT and REVOKE |
| D. | ROLLBACK and SAVEPOINT |
| Answer» D. ROLLBACK and SAVEPOINT | |
| 135. | ________________ is not a category of SQL command. |
| A. | TCL |
| B. | SCL |
| C. | DCL |
| D. | DDL |
| Answer» B. SCL | |
| 136. | If you don’t specify ASC or DESC after a SQL ORDER BY clause, the following is used by default ______________ |
| A. | ASC |
| B. | DESC |
| C. | There is no default value |
| D. | None of the mentioned |
| Answer» A. ASC | |
| 137. | Which of the following statement is true? |
| A. | DELETE does not free the space containing the table and TRUNCATE free the space containing the table |
| B. | Both DELETE and TRUNCATE free the space containing the table |
| C. | Both DELETE and TRUNCATE does not free the space containing the table |
| D. | DELETE free the space containing the table and TRUNCATE does not free the space containing the table |
| Answer» A. DELETE does not free the space containing the table and TRUNCATE free the space containing the table | |
| 138. | What is the purpose of the SQL AS clause? |
| A. | The AS SQL clause is used to change the name of a column in the result set or to assign a name to a derived column |
| B. | The AS clause is used with the JOIN clause only |
| C. | The AS clause defines a search condition |
| D. | All of the mentioned |
| Answer» A. The AS SQL clause is used to change the name of a column in the result set or to assign a name to a derived column | |
| 139. | What does DML stand for? |
| A. | Different Mode Level |
| B. | Data Model Language |
| C. | Data Mode Lane |
| D. | Data Manipulation language |
| Answer» D. Data Manipulation language | |
| 140. | With SQL, how do you select all the records from a table named “Persons” where the value of the column “FirstName” ends with an “a”? |
| A. | SELECT * FROM Persons WHERE FirstName=’a’ |
| B. | SELECT * FROM Persons WHERE FirstName LIKE ‘a%’ |
| C. | SELECT * FROM Persons WHERE FirstName LIKE ‘%a’ |
| D. | SELECT * FROM Persons WHERE FirstName=’%a%’ |
| Answer» C. SELECT * FROM Persons WHERE FirstName LIKE ‘%a’ | |
| 141. | With SQL, how can you return all the records from a table named “Persons” sorted descending by “FirstName”? |
| A. | SELECT * FROM Persons SORT BY ‘FirstName’ DESC |
| B. | SELECT * FROM Persons ORDER FirstName DESC |
| C. | SELECT * FROM Persons SORT ‘FirstName’ DESC |
| D. | SELECT * FROM Persons ORDER BY FirstName DESC |
| Answer» D. SELECT * FROM Persons ORDER BY FirstName DESC | |
| 142. | With SQL, how can you return the number of not null records in the “Persons” table? |
| A. | SELECT COUNT() FROM Persons |
| B. | SELECT COLUMNS() FROM Persons |
| C. | SELECT COLUMNS(*) FROM Persons |
| D. | SELECT COUNT(*) FROM Persons |
| Answer» A. SELECT COUNT() FROM Persons | |
| 143. | What does the ALTER TABLE clause do? |
| A. | The SQL ALTER TABLE clause modifies a table definition by altering, adding, or deleting table columns and/or constraints |
| B. | The SQL ALTER TABLE clause is used to insert data into database table |
| C. | THE SQL ALTER TABLE deletes data from database table |
| D. | The SQL ALTER TABLE clause is used to delete a database table |
| Answer» A. The SQL ALTER TABLE clause modifies a table definition by altering, adding, or deleting table columns and/or constraints | |
| 144. | The UPDATE SQL clause can _____________ |
| A. | update only one row at a time |
| B. | update more than one row at a time |
| C. | delete more than one row at a time |
| D. | delete only one row at a time |
| Answer» B. update more than one row at a time | |
| 145. | The UNION SQL clause can be used with _____________ |
| A. | SELECT clause only |
| B. | DELETE and UPDATE clauses |
| C. | UPDATE clause only |
| D. | All of the mentioned |
| Answer» A. SELECT clause only | |
| 146. | Which SQL statement is used to return only different values? |
| A. | SELECT DIFFERENT |
| B. | SELECT UNIQUE |
| C. | SELECT DISTINCT |
| D. | SELECT ALL |
| Answer» C. SELECT DISTINCT | |
| 147. | Which SQL keyword is used to sort the result-set? |
| A. | ORDER BY |
| B. | SORT |
| C. | ORDER |
| D. | SORT BY |
| Answer» A. ORDER BY | |
| 148. | How can you change “Hansen” into “Nilsen” in the “LastName” column in the Persons table? |
| A. | UPDATE Persons SET LastName=’Hansen’ INTO LastName=’Nilsen’ |
| B. | MODIFY Persons SET LastName=’Nilsen’ WHERE LastName=’Hansen’ |
| C. | MODIFY Persons SET LastName=’Hansen’ INTO LastName=’Nilsen’ |
| D. | UPDATE Persons SET LastName=’Nilsen’ WHERE LastName=’Hansen’ |
| Answer» D. UPDATE Persons SET LastName=’Nilsen’ WHERE LastName=’Hansen’ | |
| 149. | Which of the following command makes the updates performed by the transaction permanent in the database? |
| A. | ROLLBACK |
| B. | COMMIT |
| C. | TRUNCATE |
| D. | DELETE |
| Answer» B. COMMIT | |
| 151. | SQL query to find all the cities whose humidity is 95. |
| A. | SELECT city WHERE humidity = 95 |
| B. | SELECT city FROM weather WHERE humidity = 95 |
| C. | SELECT humidity = 89 FROM weather |
| D. | SELECT city FROM weather |
| Answer» B. SELECT city FROM weather WHERE humidity = 95 | |
| 152. | SQL query to find the temperature in increasing order of all cities. |
| A. | SELECT city FROM weather ORDER BY temperature |
| B. | SELECT city, temperature FROM weather |
| C. | SELECT city, temperature FROM weather ORDER BY temperature |
| D. | SELECT city, temperature FROM weather ORDER BY city |
| Answer» D. SELECT city, temperature FROM weather ORDER BY city | |
| 153. | What is the meaning of LIKE ‘%0%0%’? |
| A. | Feature begins with two 0’s |
| B. | Feature ends with two 0’s |
| C. | Feature has more than two 0’s |
| D. | Feature has two 0’s in it, at any position |
| Answer» D. Feature has two 0’s in it, at any position | |
| 154. | Find the names of these cities with temperature and condition whose condition is neither sunny nor cloudy. |
| A. | SELECT city, temperature, condition FROM weather WHERE condition NOT IN (‘sunny’, ‘cloudy’) |
| B. | SELECT city, temperature, condition FROM weather WHERE condition NOT BETWEEN (‘sunny’, ‘cloudy’) |
| C. | SELECT city, temperature, condition FROM weather WHERE condition IN (‘sunny’, ‘cloudy’) |
| D. | SELECT city, temperature, condition FROM weather WHERE condition BETWEEN (‘sunny’, ‘cloudy’); |
| Answer» A. SELECT city, temperature, condition FROM weather WHERE condition NOT IN (‘sunny’, ‘cloudy’) | |
| 155. | Find the name of those cities with temperature and condition whose condition is either sunny or cloudy but temperature must be greater than 70. |
| A. | SELECT city, temperature, condition FROM weather WHERE condition = ‘sunny’ AND condition = ‘cloudy’ OR temperature > 70 |
| B. | SELECT city, temperature, condition FROM weather WHERE condition = ‘sunny’ OR condition = ‘cloudy’ OR temperature > 70 |
| C. | SELECT city, temperature, condition FROM weather WHERE condition = ‘sunny’ OR condition = ‘cloudy’ AND temperature > 70 |
| D. | SELECT city, temperature, condition FROM weather WHERE condition = ‘sunny’ AND condition = ‘cloudy’ AND temperature > 70 |
| Answer» C. SELECT city, temperature, condition FROM weather WHERE condition = ‘sunny’ OR condition = ‘cloudy’ AND temperature > 70 | |
| 156. | Find all the tuples having a temperature greater than ‘Paris’. |
| A. | SELECT * FROM weather WHERE temperature > (SELECT temperature FROM weather WHERE city = ‘Paris’ |
| B. | SELECT * FROM weather WHERE temperature > (SELECT * FROM weather WHERE city = ‘Paris’) |
| C. | SELECT * FROM weather WHERE temperature > (SELECT city FROM weather WHERE city = ‘Paris’) |
| D. | SELECT * FROM weather WHERE temperature > ‘Paris’ temperature |
| Answer» A. SELECT * FROM weather WHERE temperature > (SELECT temperature FROM weather WHERE city = ‘Paris’ | |
| 157. | Find all the cities with temperature, condition and humidity whose humidity is in the range of 63 to 79. |
| A. | SELECT * FROM weather WHERE humidity IN (63 to 79) |
| B. | SELECT * FROM weather WHERE humidity NOT IN (63 AND 79) |
| C. | SELECT * FROM weather WHERE humidity BETWEEN 63 AND 79 |
| D. | SELECT * FROM weather WHERE humidity NOT BETWEEN 63 AND 79 |
| Answer» C. SELECT * FROM weather WHERE humidity BETWEEN 63 AND 79 | |
| 158. | The command to remove rows from a table ‘CUSTOMER’ is __________________ |
| A. | DROP FROM CUSTOMER |
| B. | UPDATE FROM CUSTOMER |
| C. | REMOVE FROM CUSTOMER |
| D. | DELETE FROM CUSTOMER WHERE |
| Answer» D. DELETE FROM CUSTOMER WHERE | |
| 159. | What type of join is needed when you wish to include rows that do not have matching values? |
| A. | Equi-join |
| B. | Natural join |
| C. | Outer join |
| D. | All of the Mentioned |
| Answer» C. Outer join | |
| 160. | What type of join is needed when you wish to return rows that do have matching values? |
| A. | Equi-join |
| B. | Natural join |
| C. | Outer join |
| D. | All of the Mentioned |
| Answer» D. All of the Mentioned | |
| 161. | Which of the following is one of the basic approaches for joining tables? |
| A. | Subqueries |
| B. | Union Join |
| C. | Natural join |
| D. | All of the Mentioned |
| Answer» D. All of the Mentioned | |
| 162. | The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T WHERE CUSTOMER_T. CUSTOMER_ID = ORDER_T. CUSTOMER_ID? |
| A. | Equi-join |
| B. | Natural join |
| C. | Outer join |
| D. | Cartesian join |
| Answer» A. Equi-join | |
| 163. | A UNION query is which of the following? |
| A. | Combines the output from no more than two queries and must include the same number of columns |
| B. | Combines the output from no more than two queries and does not include the same number of columns |
| C. | Combines the output from multiple queries and must include the same number of columns |
| D. | Combines the output from multiple queries and does not include the same number of columns |
| Answer» C. Combines the output from multiple queries and must include the same number of columns | |
| 164. | Which of the following statements is true concerning subqueries? |
| A. | Involves the use of an inner and outer query |
| B. | Cannot return the same result as a query that is not a subquery |
| C. | Does not start with the word SELECT |
| D. | All of the mentioned |
| Answer» A. Involves the use of an inner and outer query | |
| 165. | Which of the following is a correlated subquery? |
| A. | Uses the result of an inner query to determine the processing of an outer query |
| B. | Uses the result of an outer query to determine the processing of an inner query |
| C. | Uses the result of an inner query to determine the processing of an inner query |
| D. | Uses the result of an outer query to determine the processing of an outer query |
| Answer» A. Uses the result of an inner query to determine the processing of an outer query | |
| 166. | The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T? |
| A. | Equi-join |
| B. | Natural join |
| C. | Outer join |
| D. | Cartesian join |
| Answer» D. Cartesian join | |
| 167. | Which is not a type of join in T-SQL? |
| A. | Equi-join |
| B. | Natural join |
| C. | Outer join |
| D. | Cartesian join |
| Answer» B. Natural join | |
| 168. | What is a view? |
| A. | A view is a special stored procedure executed when certain event occurs |
| B. | A view is a virtual table which results of executing a pre-compiled query |
| C. | A view is a database diagram |
| D. | None of the Mentioned |
| Answer» B. A view is a virtual table which results of executing a pre-compiled query | |
| 169. | Which of the following is not a limitation of view? |
| A. | ORDER BY Does Not Work |
| B. | Index Created on View Used Often |
| C. | Cross Database Queries Not Allowed in Indexed View |
| D. | Adding Column is Expensive by Joining Table Outside View |
| Answer» B. Index Created on View Used Often | |
| 170. | Which of the following statement is true? |
| A. | Views could be looked as an additional layer on the table which enables us to protect intricate or sensitive data based upon our needs |
| B. | Views are virtual tables that are compiled at run time |
| C. | Creating views can improve query response time |
| D. | All of the Mentioned |
| Answer» D. All of the Mentioned | |
| 171. | SQL Server has mainly how many types of views? |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» B. two | |
| 172. | Dynamic Management View is a type of ___________ |
| A. | System Defined Views |
| B. | User Defined View |
| C. | Simple View |
| D. | Complex View |
| Answer» A. System Defined Views | |
| 173. | Syntax for creating views is __________ |
| A. | CREATE VIEW AS SELECT |
| B. | CREATE VIEW AS UPDATE |
| C. | DROP VIEW AS SELECT |
| D. | CREATE VIEW AS UPDATE |
| Answer» A. CREATE VIEW AS SELECT | |
| 174. | You can delete a view with ___________ command. |
| A. | DROP VIEW |
| B. | DELETE VIEW |
| C. | REMOVE VIEW |
| D. | TRUNCATE VIEW |
| Answer» A. DROP VIEW | |
| 176. | Which of the following is not a SQL Server INFORMATION_SCHEMA view? |
| A. | INFORMATION_SCHEMA.CONSTRAINT_TABLE_USAGE |
| B. | INFORMATION_SCHEMA.DOMAIN_CONSTRAINTS |
| C. | INFORMATION_SCHEMA.KEY_COLUMN_USAGE |
| D. | sys.dm_exec_connections |
| Answer» D. sys.dm_exec_connections | |
| 177. | ___________ is stored only in the Master database. |
| A. | Database-scoped Dynamic Management View |
| B. | Complex View |
| C. | Catalog View |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
Chapter: Relational Database Design
| 178. | In the __________ normal form, a composite attribute is converted to individual attributes. |
| A. | First |
| B. | Second |
| C. | Third |
| D. | Fourth |
| Answer» A. First | |
| 179. | Tables in second normal form (2NF): |
| A. | Eliminate all hidden dependencies |
| B. | Eliminate the possibility of a insertion anomalies |
| C. | Have a composite key |
| D. | Have all non key fields depend on the whole primary key |
| Answer» A. Eliminate all hidden dependencies | |
| 180. | Which-one ofthe following statements about normal forms is FALSE? |
| A. | BCNF is stricter than 3 NF |
| B. | Lossless, dependency -preserving decomposition into 3 NF is always possible |
| C. | Loss less, dependency – preserving decomposition into BCNF is always possible |
| D. | Any relation with two attributes is BCNF |
| Answer» C. Loss less, dependency – preserving decomposition into BCNF is always possible | |
| 181. | Functional Dependencies are the types of constraints that are based on______ |
| A. | Key |
| B. | Key revisited |
| C. | Superset key |
| D. | None of the mentioned |
| Answer» A. Key | |
| 182. | Which is a bottom-up approach to database design that design by examining the relationship between attributes: |
| A. | Functional dependency |
| B. | Database modeling |
| C. | Normalization |
| D. | Decomposition |
| Answer» C. Normalization | |
| 183. | Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups: |
| A. | 1NF |
| B. | 2NF |
| C. | 3NF |
| D. | All of the mentioned |
| Answer» C. 3NF | |
| 184. | Which forms has a relation that possesses data about an individual entity: |
| A. | 2NF |
| B. | 3NF |
| C. | 4NF |
| D. | 5NF |
| Answer» C. 4NF | |
| 185. | Which forms are based on the concept of functional dependency: |
| A. | 1NF |
| B. | 2NF |
| C. | 3NF |
| D. | 4NF |
| Answer» C. 3NF | |
| 186. | Empdt1(empcode, name, street, city, state, pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in |
| A. | 1 NF only |
| B. | 2 NF and hence also in 1 NF |
| C. | 3NF and hence also in 2NF and 1NF |
| D. | BCNF and hence also in 3NF, 2NF and 1NF |
| Answer» B. 2 NF and hence also in 1 NF | |
| 187. | We can use the following three rules to find logically implied functional dependencies. This collection of rules is called |
| A. | Axioms |
| B. | Armstrong’s axioms |
| C. | Armstrong |
| D. | Closure |
| Answer» B. Armstrong’s axioms | |
| 188. | Which of the following is not Armstrong’s Axiom? |
| A. | Reflexivity rule |
| B. | Transitivity rule |
| C. | Pseudotransitivity rule |
| D. | Augmentation rule |
| Answer» C. Pseudotransitivity rule | |
| 189. | The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is called |
| A. | Lossless decomposition |
| B. | Lossless-join decomposition |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 190. | Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under |
| A. | Lossy-join decomposition |
| B. | Lossy decomposition |
| C. | Lossless-join decomposition |
| D. | Both Lossy and Lossy-join decomposition |
| Answer» D. Both Lossy and Lossy-join decomposition | |
| 191. | There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as |
| A. | A->BC |
| B. | A->B |
| C. | B->C |
| D. | None of the mentioned |
| Answer» A. A->BC | |
| 192. | Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is: |
| A. | 2 |
| B. | 7 |
| C. | 10 |
| D. | 12 |
| Answer» C. 10 | |
| 193. | Which, if any, of the two queries above will correctly (in SQL2) get the desired set of employee ID’s? |
| A. | Both I and II |
| B. | I only |
| C. | II only |
| D. | Neither I nor I |
| Answer» A. Both I and II | |
| 194. | Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m? |
| A. | m = min(r,s) |
| B. | 0 <= m <= r + s |
| C. | min(r,s) <= m <= max(r,s) |
| D. | 0 <= m <= min(r,s) |
| Answer» D. 0 <= m <= min(r,s) | |
| 195. | Which of the following is not a key? |
| A. | A |
| B. | E |
| C. | B, C |
| D. | D |
| Answer» C. B, C | |
| 196. | If a relation is in BCNF, then it is also in |
| A. | 1 NF |
| B. | 2 NF |
| C. | 3 NF |
| D. | All of the above |
| Answer» D. All of the above | |
| 197. | What action does ⋈ operator perform in relational algebra |
| A. | Output specified attributes from all rows of the input relation and remove duplicate tuples from the output |
| B. | Outputs pairs of rows from the two input relations that have the same value on all attributes that have the same name |
| C. | Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes) |
| D. | Return rows of the input relation that satisfy the predicate |
| Answer» A. Output specified attributes from all rows of the input relation and remove duplicate tuples from the output | |
| 198. | Statement 1: A tuple is a row in a relation Statement 2: Existence of multiple foreign keys in a same relation is possible |
| A. | Both the statements are true |
| B. | Statement 1 is correct but Statement 2 is false |
| C. | Statement 1 is false but Statement 2 is correct |
| D. | Both the statements are false |
| Answer» A. Both the statements are true | |
| 199. | The____condition allows a general predicate over the relations being joined. |
| A. | On |
| B. | Using |
| C. | Set |
| D. | Where |
| Answer» A. On | |
| 201. | The normal form which satisfies multivalued dependencies and which is in BCNF is |
| A. | 4 NF |
| B. | 3 NF |
| C. | 2 NF |
| D. | All of the mentioned |
| Answer» A. 4 NF | |
| 202. | Which of the following is a tuple-generating dependencies? |
| A. | Functional dependency |
| B. | Equality-generating dependencies |
| C. | Multivalued dependencies |
| D. | Non-functional dependency |
| Answer» B. Equality-generating dependencies | |
| 203. | The main task carried out in the __________ is to remove repeating attributes to separate tables. |
| A. | First Normal Form |
| B. | Second Normal Form |
| C. | Third Normal Form |
| D. | Fourth Normal Form |
| Answer» A. First Normal Form | |
| 204. | Which forms has a relation that possesses data about an individual entity? |
| A. | 2NF |
| B. | 3NF |
| C. | 4NF |
| D. | 5NF |
| Answer» B. 3NF | |
| 205. | Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set? |
| A. | A many-to-many relationship set |
| B. | A multivalued attribute of an entity set |
| C. | A one-to-many relationship set |
| D. | None of the mentioned |
| Answer» A. A many-to-many relationship set | |
| 206. | Fifth Normal form is concerned with |
| A. | Functional dependency |
| B. | Multivalued dependency |
| C. | Join dependency |
| D. | Domain-key |
| Answer» B. Multivalued dependency | |
| 207. | n which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set. |
| A. | A many-to-many relationship set |
| B. | A multivalued attribute of an entity set |
| C. | A one-to-many relationship set |
| D. | None of the mentioned |
| Answer» B. A multivalued attribute of an entity set | |
| 208. | In 2NF |
| A. | No functional dependencies (FDs) exist |
| B. | No multivalued dependencies (MVDs) exist |
| C. | No partial FDs exist |
| D. | No partial MVDs exist |
| Answer» B. No multivalued dependencies (MVDs) exist | |
More MCQs
| 209. | Where is metadata stored in MySQL? |
| A. | in the mysql database meta |
| B. | in the mysql database metasql |
| C. | in the mysql database metadata |
| D. | in the mysql database mysql |
| Answer» D. in the mysql database mysql | |
| 210. | What MySQL property is used to create a surrogate key in MySQL? |
| A. | identical |
| B. | unique |
| C. | auto_increment |
| D. | sequence |
| Answer» C. auto_increment | |
| 211. | A relational database consists of a collection of |
| A. | keys |
| B. | records |
| C. | tables |
| D. | fields |
| Answer» C. tables | |
| 212. | A Database Management System (DBMS) is: |
| A. | collection of data describing one particular enterprise |
| B. | collection of programs to access data |
| C. | all options are correct |
| D. | collection of interrelated data |
| Answer» C. all options are correct | |
| 213. | Which of the following is not a level of data abstraction? |
| A. | view level |
| B. | physical level |
| C. | logical level |
| D. | critical level |
| Answer» D. critical level | |
| 214. | Disadvantages of File systems to store data is: |
| A. | data isolation |
| B. | data redundancy and inconsistency |
| C. | difficulty in accessing data |
| D. | all options are correct |
| Answer» D. all options are correct | |
| 215. | In an Entity Relationship Diagram Rectangles represents |
| A. | tables |
| B. | attributes |
| C. | database |
| D. | entity sets |
| Answer» D. entity sets | |
| 216. | Which of the following is not a Storage Manager Component? |
| A. | transaction manager |
| B. | logical manager |
| C. | file manager |
| D. | buffer manager |
| Answer» B. logical manager | |
| 217. | Data Manipulation Language enables users to |
| A. | retrieval of information stored in database |
| B. | insertion of new information into the database |
| C. | deletion of information from the database |
| D. | all the options are correct |
| Answer» D. all the options are correct | |
| 218. | Which of the following is not an Schema? |
| A. | logical schema |
| B. | physical schema |
| C. | database schema |
| D. | critical schema |
| Answer» D. critical schema | |
| 219. | Which of the following is Database Language? |
| A. | data definition language |
| B. | data manipulation language |
| C. | data query language |
| D. | all of the options |
| Answer» D. all of the options | |
| 220. | Which of the following in not a function of DBA? |
| A. | network maintenance |
| B. | schema definition |
| C. | authorization for data access |
| D. | routine maintenance |
| Answer» A. network maintenance | |
| 221. | Which of the following is a Data Model? |
| A. | entity relationship model |
| B. | object based data model |
| C. | all of the options are correct |
| D. | relational data model |
| Answer» C. all of the options are correct | |
| 222. | A Database Management System (DBMS) is |
| A. | collection of interrelated data |
| B. | collection of data describing one particular enterprise |
| C. | all of the options |
| D. | collection of programs to access data |
| Answer» C. all of the options | |
| 223. | Which of the following is not a level of data abstraction? |
| A. | physical level |
| B. | view level |
| C. | critical level |
| D. | logical level |
| Answer» C. critical level | |
| 224. | Disadvantages of File systems to store data is: |
| A. | data redundancy and inconsistency |
| B. | data isolation |
| C. | all of the options |
| D. | difficulty in accessing data |
| Answer» C. all of the options | |
| 226. | Data Manipulation Language enables users to |
| A. | retrieval of information stored in database |
| B. | deletion of information from the database |
| C. | all of the above |
| D. | insertion of new information into the database |
| Answer» C. all of the above | |
| 227. | Which of the following is not an Schema? |
| A. | logical schema |
| B. | critical schema |
| C. | database schema |
| D. | physical schema |
| Answer» B. critical schema | |
| 228. | Which of the following is Database Language? |
| A. | all of the options |
| B. | query language |
| C. | data definition language |
| D. | data manipulation language |
| Answer» A. all of the options | |
| 229. | Which of the following in not a function of DBA? |
| A. | authorization for data access |
| B. | network maintenance |
| C. | routine maintenance |
| D. | schema definition |
| Answer» B. network maintenance | |
| 230. | Which of the following is a Data Model? |
| A. | object-based data model |
| B. | all of the options |
| C. | entity-relationship model |
| D. | relational data model |
| Answer» B. all of the options | |
| 231. | Column header is refer as |
| A. | table |
| B. | domain |
| C. | attributes |
| D. | relation |
| Answer» C. attributes | |
| 232. | _______ allow us to identify uniquely a tuple in the relation. |
| A. | schema |
| B. | superkey |
| C. | domain |
| D. | attribute |
| Answer» B. superkey | |
| 233. | Minimal Superkeys are called |
| A. | schema keys |
| B. | attribute keys |
| C. | candidate keys |
| D. | domain keys |
| Answer» C. candidate keys | |
| 234. | Which of the following is not Modification of the Database |
| A. | updating |
| B. | sorting |
| C. | deletion |
| D. | insertion |
| Answer» B. sorting | |
| 235. | Which of the following in not Outer join? |
| A. | left outer join |
| B. | full outer join |
| C. | all of the options |
| D. | right outer join |
| Answer» C. all of the options | |
| 236. | Set of premitted values of each attribute is called |
| A. | tuple |
| B. | schema |
| C. | domain |
| D. | relation |
| Answer» C. domain | |
| 237. | Which of the following is true regarding Null Value? |
| A. | null<0 |
| B. | null=0 |
| C. | null<>0 |
| D. | null>0 |
| Answer» C. null<>0 | |
| 238. | Logical design of database is called |
| A. | all of the options |
| B. | database schema |
| C. | database instance |
| D. | database snapshot |
| Answer» B. database schema | |
| 239. | Snapshot of the data in the database at a given instant of time is called |
| A. | database instance |
| B. | all of the options |
| C. | database schema |
| D. | database snapshot |
| Answer» A. database instance | |
| 240. | Which of the following is not Unary operation? |
| A. | rename |
| B. | union |
| C. | select |
| D. | project |
| Answer» B. union | |
| 241. | Which of the following is not binary operation? |
| A. | union |
| B. | set difference |
| C. | cartesian product |
| D. | project |
| Answer» D. project | |
| 242. | Which of the following is correct regarding Aggregate functions? |
| A. | it takes a single value and returns a single value as result |
| B. | it takes a list of values and return a single values as result |
| C. | it takes a list of values and return a list of values as result |
| D. | it takes a single value and returns a list of values as result |
| Answer» B. it takes a list of values and return a single values as result | |
| 243. | The Primary key must be |
| A. | non null |
| B. | unique |
| C. | option a or b |
| D. | option a and b |
| Answer» D. option a and b | |
| 244. | A command to remove a relation from an SQL database |
| A. | delete table |
| B. | erase table |
| C. | alter table |
| D. | drop table |
| Answer» D. drop table | |
| 245. | which of the following is not an Aggregate function? |
| A. | select |
| B. | avg |
| C. | min |
| D. | max |
| Answer» A. select | |
| 246. | The attribute that can be divided into other attributes is called |
| A. | composite attribute |
| B. | derived attribute |
| C. | simple attribute |
| D. | multi-valued attribute |
| Answer» A. composite attribute | |
| 247. | What is ACID properties of Transactions? |
| A. | atomicity, consistency, isolation, database |
| B. | automatically, concurrency, isolation, durability |
| C. | atomicity, consistency, isolation, durability |
| D. | atomicity, consistency, inconsistent, durability |
| Answer» C. atomicity, consistency, isolation, durability | |
| 248. | If every non-key attribute is functionally dependent on the primary key, the relation will be in |
| A. | fourth formal form |
| B. | third normal form |
| C. | first normal form |
| D. | second normal form |
| Answer» B. third normal form | |
| 249. | Database locking concept is used to solve the problem of |
| A. | inconsistent data |
| B. | all of the options |
| C. | lost update |
| D. | uncommitted dependency |
| Answer» B. all of the options | |
| 251. | Data Manipulation Language (DML) is not to | |
| A. | insertion of new information into the database | |
| B. | modification of information in the database | |
| C. | create information table in the database | |
| D. | deletion of information in the database | |
| Answer» C. create information table in the database | ||
| 252. | Which of the following in true regarding Referential Integrity? |
| A. | every primary-key value must match a primary-key value in an associated table |
| B. | every primary-key value must match a foreign-key value in an associated table |
| C. | every foreign-key value must match a foreign-key value in an associated table |
| D. | every foreign-key value must match a primary-key value in an associated table |
| Answer» D. every foreign-key value must match a primary-key value in an associated table | |
| 253. | Which of the following option is use to retrieval of data? |
| A. | stack |
| B. | data structure |
| C. | linked list |
| D. | query |
| Answer» D. query | |
| 254. | ODBC stands for ______ |
| A. | none of above |
| B. | open database connection |
| C. | offline database connection |
| D. | oriented database connection |
| Answer» B. open database connection view more info and meaning of ODBC | |
| 255. | Which of the following is an unary operation? |
| A. | selection operation |
| B. | primitive operation |
| C. | projection operation |
| D. | generalized selection |
| Answer» D. generalized selection | |
| 256. | Which SQL Query is use to remove a table and all its data from the database? |
| A. | none of these |
| B. | drop table |
| C. | create table |
| D. | alter table |
| Answer» B. drop table | |
| 257. | In precedence of set operators the expression is evaluated from: |
| A. | left to right |
| B. | right to left |
| C. | left to left |
| D. | right to right |
| Answer» A. left to right | |
| 258. | In DBMS, FD stands for _______ |
| A. | facilitate data |
| B. | functional data |
| C. | facilitate dependency |
| D. | functional dependency |
| Answer» D. functional dependency view more info and meaning of FD | |
| 259. | How many types of keys in Database Design? |
| A. | foreign key |
| B. | all of the options |
| C. | candidate key |
| D. | primary key |
| Answer» B. all of the options | |
| 260. | Which of the following is based on Multi Valued Dependency? |
| A. | third |
| B. | fourth |
| C. | first |
| D. | second |
| Answer» B. fourth | |
| 261. | Which of the following is the structure of the Database? |
| A. | table |
| B. | none of these |
| C. | schema |
| D. | relation |
| Answer» C. schema | |
| 262. | The minimal set of super key is called |
| A. | primary key |
| B. | secondary key |
| C. | foreign key |
| D. | candidate key |
| Answer» D. candidate key | |
| 263. | ______________ is a classical approach to database design? |
| A. | bottom – up approach |
| B. | top – down approach |
| C. | left – right approach |
| D. | right – left approach |
| Answer» B. top – down approach | |
| 264. | _____________ refers to the correctness and completeness of the data in a database? |
| A. | data independence |
| B. | data integrity |
| C. | data security |
| D. | data constraint |
| Answer» B. data integrity | |
| 265. | A table that displays data redundancies yields ____________ anomalies |
| A. | insertion |
| B. | deletion |
| C. | update |
| D. | all of the options |
| Answer» D. all of the options | |
| 266. | A lock that allows concurrent transactions to access different rows of the same table is known as a |
| A. | row-level lock |
| B. | database-level lock |
| C. | field-level lock |
| D. | table-level lock |
| Answer» C. field-level lock | |
| 267. | A type of query that is placed within a WHERE or HAVING clause of another query is called |
| A. | multi-query |
| B. | sub query |
| C. | super query |
| D. | master query |
| Answer» B. sub query | |
| 268. | A form defined |
| A. | none of the options |
| B. | where data is placed on the screen |
| C. | the width of each field |
| D. | both where data is placed on the screen and the width of each field |
| Answer» B. where data is placed on the screen | |
| 269. | If a piece of data is stored in two places in the database, then |
| A. | in can be more easily accessed |
| B. | both storage space is wasted and changing the data in one spot will cause data inconsistency |
| C. | storage space is wasted |
| D. | changing the data in one spot will cause data inconsistency |
| Answer» B. both storage space is wasted and changing the data in one spot will cause data inconsistency | |
| 270. | Which of the following is a problem of file management system? |
| A. | data redundancy and program dependence |
| B. | all of the options |
| C. | difficult to update |
| D. | lack of data independence |
| Answer» B. all of the options | |
| 271. | Which of the following is not an advantage of the database approach |
| A. | elimination of data redundancy |
| B. | ability of associate deleted data |
| C. | increased security and program/data independence |
| D. | all of the above |
| Answer» D. all of the above | |
| 272. | An audit trail |
| A. | none of the options |
| B. | is the recorded history of operations performed on a file |
| C. | is used to make backup copies |
| D. | can be used to restore lost information |
| Answer» B. is the recorded history of operations performed on a file | |
| 273. | One approach to standardization storing of data? |
| A. | codasyl specification |
| B. | none of the options |
| C. | mis |
| D. | structured programming |
| Answer» A. codasyl specification | |
| 274. | Report generators are used to |
| A. | store data input by a user |
| B. | answer queries |
| C. | both retrieve information from files and answer queries |
| D. | retrieve information from files |
| Answer» C. both retrieve information from files and answer queries | |
| 276. | A record management system |
| A. | can handle many files of information at a time |
| B. | always uses a list as its model |
| C. | both can handle many files of information at a time and always uses a list as its model |
| D. | can be used to extract information stored in a computer file |
| Answer» D. can be used to extract information stored in a computer file | |
| 277. | One data dictionery software package is called |
| A. | db/dc dictionary |
| B. | datapac |
| C. | total |
| D. | access |
| Answer» A. db/dc dictionary | |
| 278. | The function of a database is … |
| A. | to check all input data |
| B. | to output data |
| C. | to collect and organize input data |
| D. | to check all spelling |
| Answer» C. to collect and organize input data | |
| 279. | A command that lets you change one or more fields in a record is |
| A. | none of the options |
| B. | modify |
| C. | insert |
| D. | lookup |
| Answer» B. modify | |
| 280. | What is the language used by most of the DBMSs for helping their users to access data? |
| A. | high level language |
| B. | 4gl |
| C. | query language |
| D. | sql |
| Answer» C. query language | |
| 281. | Information can be transferred between the DBMS and a |
| A. | spreadsheet program |
| B. | word processor program |
| C. | graphics program |
| D. | all of the options |
| Answer» D. all of the options | |
| 282. | The relational database environment has all of the following components except |
| A. | users |
| B. | database |
| C. | query languages |
| D. | separate files |
| Answer» D. separate files | |
| 283. | The ascending order of a data hirerchy is: |
| A. | bit-byte-file-record-field-database |
| B. | bit-byte-field-record-file-database |
| C. | bit-byte-record-field-file-database |
| D. | byte-bit-field-record-file-database |
| Answer» B. bit-byte-field-record-file-database | |
| 284. | Primitive operations common to all record management system include |
| A. | look-up |
| B. | all of the options |
| C. | |
| D. | sort |
| Answer» A. look-up | |
| 285. | Which of the following is not a relational database? |
| A. | dbase iv |
| B. | foxpro |
| C. | reflex |
| D. | 4th dimension |
| Answer» C. reflex | |
| 286. | A top-to-bottom relationship among the items in a database is established by a |
| A. | hierarchical schema |
| B. | all of the options |
| C. | network schema |
| D. | relational schema |
| Answer» A. hierarchical schema | |
| 287. | Choose the RDBMS which supports full fledged client server application development |
| A. | dbase v |
| B. | ingress |
| C. | oracle 7.1 |
| D. | foxpro 2.1 |
| Answer» C. oracle 7.1 | |
| 288. | The highest level in the hierarchy of data organization is called |
| A. | data base |
| B. | data record |
| C. | data bank |
| D. | data file |
| Answer» A. data base | |
| 289. | The management information system (MIS) structure with one main computer system is called a |
| A. | decentralized mis structure |
| B. | centralized mis structure |
| C. | hierarchical mis structure |
| D. | distributed mis structure |
| Answer» B. centralized mis structure | |
| 290. | In the DBMS approach, application programs perform the |
| A. | storage function |
| B. | access control |
| C. | all of the options |
| D. | processing functions |
| Answer» D. processing functions | |
| 291. | Which of the following is not true of the traditional approach to information processing |
| A. | it is file oriented |
| B. | it is inflexible |
| C. | there is common sharing of data among the various applications |
| D. | programs are dependent on the file |
| Answer» C. there is common sharing of data among the various applications | |
| 292. | Batch processing is appropriate if |
| A. | only a few transactions are involved |
| B. | none of the options |
| C. | large computer system is available |
| D. | only a small computer system is avilbale |
| Answer» B. none of the options | |
| 293. | Large collection of files are called |
| A. | sectors |
| B. | database |
| C. | fields |
| D. | records |
| Answer» B. database | |
| 294. | A transparent DBMS |
| A. | both can not hide sensitive information from users and keeps its logical structure hidden from users |
| B. | keeps its physical structure hidden from users |
| C. | can not hide sensitive information from users |
| D. | keeps its logical structure hidden from users |
| Answer» B. keeps its physical structure hidden from users | |
| 295. | A file produced by a spreadsheet |
| A. | none of the options |
| B. | is generally stored on disk in an ascii text fromat |
| C. | can be used as is by the dbms |
| D. | both is generally stored on disk in an ascii text fromat and can be used as is by the dbms |
| Answer» B. is generally stored on disk in an ascii text fromat | |
| 296. | The model for a record management system might be |
| A. | all of the options |
| B. | a business form |
| C. | handwritten list |
| D. | a rolodex card file |
| Answer» A. all of the options | |
| 297. | Database management systems are intended to |
| A. | eliminate data redundancy |
| B. | establish relationship among records in different files |
| C. | manage file access and maintain data integrity |
| D. | all of the options |
| Answer» D. all of the options | |
| 298. | The language used application programs to request data from the DBMS is referred to as the |
| A. | ddl |
| B. | all of the options |
| C. | dml |
| D. | query language |
| Answer» C. dml | |
| 299. | A set of programs that handle a firm’s database responsibilities is called |
| A. | database management system (dbms) |
| B. | data management system (dms) |
| C. | all of the options |
| D. | database processing system (dbps) |
| Answer» C. all of the options | |
| 301. | In a large DBMS |
| A. | none of the options |
| B. | each user can “see” only a small part of the entire database |
| C. | each subschema contains every field in the logical schema |
| D. | each user can access every subschema |
| Answer» B. each user can “see” only a small part of the entire database | |
| 302. | A Database Management System (DBMS) is |
| A. | collection of interrelated data |
| B. | collection of programs to access data |
| C. | collection of data describing one particular enterprise |
| D. | all of the above |
| Answer» B. collection of programs to access data | |
| 303. | Which of the following is not a level of data abstraction? |
| A. | physical level |
| B. | critical level |
| C. | logical level |
| D. | view level |
| Answer» B. critical level | |
| 304. | Disadvantages of File systems to store data is: |
| A. | data redundancy and inconsistency |
| B. | difficulty in accessing data |
| C. | data isolation |
| D. | all of the above |
| Answer» D. all of the above | |
| 305. | In an Entity-Relationship Diagram Rectangles represents |
| A. | entity sets |
| B. | attributes |
| C. | database |
| D. | tables |
| Answer» A. entity sets | |
| 306. | Which of the following is not a Storage Manager Component? |
| A. | transaction manager |
| B. | logical manager |
| C. | buffer manager |
| D. | file manager |
| Answer» B. logical manager | |
| 307. | Data Manipulation Language enables users to |
| A. | retrieval of information stored in database |
| B. | insertion of new information into the database |
| C. | deletion of information from the database |
| D. | all of the above |
| Answer» D. all of the above | |
| 308. | Which of the following is not an Schema? |
| A. | database schema |
| B. | physical schema |
| C. | critical schema |
| D. | logical schema |
| Answer» C. critical schema | |
| 309. | Which of the following is Database Language? |
| A. | data definition language |
| B. | data manipulation language |
| C. | query language |
| D. | all of the above |
| Answer» D. all of the above | |
| 310. | Which of the following in not a function of DBA? |
| A. | network maintenance |
| B. | routine maintenance |
| C. | schema definition |
| D. | authorization for data access |
| Answer» A. network maintenance | |
| 311. | Which of the following represents a relationship among a set of values. |
| A. | a row |
| B. | a table |
| C. | a field |
| D. | a column |
| Answer» A. a row | |
| 312. | Column header is refer as |
| A. | table |
| B. | relation |
| C. | attributes |
| D. | domain |
| Answer» C. attributes | |
| 313. | A Relation is a |
| A. | subset of a cartesian product of a list of attributes |
| B. | subset of a cartesian product of a list of domains |
| C. | subset of a cartesian product of a list of tuple |
| D. | subset of a cartesian product of a list of relations |
| Answer» B. subset of a cartesian product of a list of domains | |
| 314. | In mathematical term Table is referred as |
| A. | relation |
| B. | attribute |
| C. | tuple |
| D. | domain |
| Answer» A. relation | |
| 315. | In mathematical term Row is referred as |
| A. | relation |
| B. | attribute |
| C. | tuple |
| D. | domain |
| Answer» C. tuple | |
| 316. | _______ allow us to identify uniquely a tuple in the relation. |
| A. | superkey |
| B. | domain |
| C. | attribute |
| D. | schema |
| Answer» A. superkey | |
| 317. | Minimal Superkeys are called |
| A. | schema keys |
| B. | candidate keys |
| C. | domain keys |
| D. | attribute keys |
| Answer» B. candidate keys | |
| 318. | Which of the following is not Modification of the Database |
| A. | deletion |
| B. | insertion |
| C. | sorting |
| D. | updating |
| Answer» C. sorting | |
| 319. | Which of the following is Relation-algebra Operation |
| A. | select |
| B. | union |
| C. | rename |
| D. | all of the above |
| Answer» D. all of the above | |
| 320. | Which of the following in not Outer join? |
| A. | left outer join |
| B. | right outer join |
| C. | full outer join |
| D. | all of the above |
| Answer» D. all of the above | |
| 321. | Who proposed the relational model? |
| A. | bill gates |
| B. | e.f. codd |
| C. | herman hollerith |
| D. | charles babbage |
| Answer» B. e.f. codd | |
| 322. | Set of premitted values of each attribute is called |
| A. | domain |
| B. | tuple |
| C. | relation |
| D. | schema |
| Answer» A. domain | |
| 323. | Logical design of database is called |
| A. | database instance |
| B. | database snapshot |
| C. | database schema |
| D. | all of the above |
| Answer» C. database schema | |
| 324. | Snapshot of the dta in the database at a given instant of time is called |
| A. | database schema |
| B. | database instance |
| C. | database snapshot |
| D. | all of the above |
| Answer» B. database instance | |
| 326. | Which of the following is not binary operation? |
| A. | union |
| B. | project |
| C. | set difference |
| D. | cartesian product |
| Answer» B. project | |
| 327. | Which of the following is correct regarding Aggregate functions? |
| A. | it takes a list of values and return a single values as result |
| B. | it takes a list of values and return a list of values as result |
| C. | it takes a single value and returns a list of values as result |
| D. | it takes a single value and returns a single value as result |
| Answer» A. it takes a list of values and return a single values as result | |
| 328. | A command to remove a relation from an SQL database |
| A. | delete table |
| B. | drop table |
| C. | erase table |
| D. | alter table |
| Answer» B. drop table | |
| 329. | which of the following is not an Aggregate function? |
| A. | min |
| B. | max |
| C. | select |
| D. | avg |
| Answer» C. select | |
| 330. | The attribute that can be divided into other attributes is called |
| A. | simple attribute |
| B. | composite attribute |
| C. | multi-valued attribute |
| D. | derived attribute |
| Answer» B. composite attribute | |
| 331. | In an Entity-Relationship Diagram “Ellipses” represents |
| A. | attributes |
| B. | weak entity set |
| C. | relationship sets |
| D. | multi-valued attributes |
| Answer» A. attributes | |
| 332. | In an Entity-Relationship Diagram “Diamonds” represents |
| A. | attributes |
| B. | multi-valued attributes |
| C. | weak entity set |
| D. | relationship sets |
| Answer» D. relationship sets | |
| 333. | What is ACID properties of Transactions? |
| A. | atomicity, consistency, isolation, database |
| B. | atomicity, consistency, isolation, durability |
| C. | atomicity, consistency, inconsistent, durability |
| D. | automatically, concurrency, isolation, durability |
| Answer» B. atomicity, consistency, isolation, durability | |
| 334. | If every non-key attribute is functionally dependent on the primary key, the relation will be in |
| A. | first normal form |
| B. | second normal form |
| C. | third normal form |
| D. | fourth formal form |
| Answer» C. third normal form | |
| 335. | Database locking concept is used to solve the problem of |
| A. | lost update |
| B. | uncommitted dependency |
| C. | inconsistent data |
| D. | all of the above |
| Answer» D. all of the above | |
| 336. | UML is stands for |
| A. | universal modeling language |
| B. | unified modeling language |
| C. | united modeling language |
| D. | uni modeling language |
| Answer» B. unified modeling language view more info and meaning of UML | |
| 337. | Data Manipulation Language (DML) is not to |
| A. | create information table in the database |
| B. | insertion of new information into the database |
| C. | deletion of information in the database |
| D. | modification of information in the database |
| Answer» A. create information table in the database | |
| 338. | Which of the following in true regarding Referential Integrity? |
| A. | every primary-key value must match a primary-key value in an associated table |
| B. | every primary-key value must match a foreign-key value in an associated table |
| C. | every foreign-key value must match a primary-key value in an associated table |
| D. | every foreign-key value must match a foreign-key value in an associated table |
| Answer» C. every foreign-key value must match a primary-key value in an associated table | |
| 339. | ODBC stands for ______ |
| A. | offline database connection |
| B. | oriented database connection |
| C. | open database connection |
| D. | none of above |
| Answer» C. open database connection view more info and meaning of ODBC | |
| 340. | Which algebra is widely used in DBMS? |
| A. | relational algebra |
| B. | arithmetic algebra |
| C. | both |
| D. | none |
| Answer» A. relational algebra | |
| 341. | Which of the following is an unary operation? |
| A. | selection operation |
| B. | generalized selection |
| C. | primitive operation |
| D. | projection operation |
| Answer» A. selection operation | |
| 342. | Which SQL Query is use to remove a table and all its data from the database? |
| A. | create table |
| B. | alter table |
| C. | drop table |
| D. | none of these |
| Answer» C. drop table | |
| 343. | In precedence of set operators the expression is evaluated from: |
| A. | left to left |
| B. | left to right |
| C. | right to right |
| D. | right to left |
| Answer» B. left to right | |
| 344. | In DBMS FD stands for _______ |
| A. | facilitate data |
| B. | functional data |
| C. | facilitate dependency |
| D. | functional dependency |
| Answer» D. functional dependency | |
| 345. | How many types of keys in Database Design? |
| A. | candidate key |
| B. | primary key |
| C. | foreign key |
| D. | all of these |
| Answer» D. all of these | |
| 346. | Which of the following is based on Multi Valued Dependency? |
| A. | first |
| B. | second |
| C. | third |
| D. | fourth |
| Answer» D. fourth | |
| 347. | Which of the following is the structure of the Database? |
| A. | table |
| B. | schema |
| C. | relation |
| D. | none of these |
| Answer» B. schema | |
| 348. | The minimal set of super key is called |
| A. | primary key |
| B. | secondary key |
| C. | candidate key |
| D. | foreign key |
| Answer» C. candidate key | |
| 349. | A relation that has no partial dependencies is in which normal form |
| A. | first |
| B. | second |
| C. | third |
| D. | bcnf |
| Answer» B. second | |
| 351. | A logical description of some portion of database that is required by a user to perform task is called as | |
| A. | system view | |
| B. | user view | |
| C. | logical view | |
| D. | data view | |
| Answer» B. user view | ||
| 352. | ______________ is a classical approach to database design? |
| A. | left – right approach |
| B. | right – left approach |
| C. | top – down approach |
| D. | bottom – up approach |
| Answer» C. top – down approach | |
| 353. | _____________ refers to the correctness and completeness of the data in a database? |
| A. | data security |
| B. | data integrity |
| C. | data constraint |
| D. | data independence |
| Answer» B. data integrity | |
| 354. | A table that displays data redundancies yields ____________ anomalies |
| A. | insertion |
| B. | deletion |
| C. | update |
| D. | all of the above |
| Answer» D. all of the above | |
| 355. | A lock that allows concurrent transactions to access different rows of the same table is known as a |
| A. | field-level lock |
| B. | row-level lock |
| C. | table-level lock |
| D. | database-level lock |
| Answer» A. field-level lock | |
| 356. | A type of query that is placed within a WHERE or HAVING clause of another query is called |
| A. | super query |
| B. | sub query |
| C. | master query |
| D. | multi-query |
| Answer» B. sub query | |
| 357. | A transaction completes its execution is said to be |
| A. | saved |
| B. | loaded |
| C. | rolled |
| D. | committed |
| Answer» D. committed | |
| 358. | A in a table represents a relationship among a set of values. |
| A. | column |
| B. | key |
| C. | row |
| D. | entry |
| Answer» C. row | |
| 359. | The term is used to refer to a row. |
| A. | attribute |
| B. | tuple |
| C. | field |
| D. | instance |
| Answer» B. tuple | |
| 360. | For each attribute of a relation, there is a set of permitted values, called the of that attribute. |
| A. | domain |
| B. | relation |
| C. | set |
| D. | schema |
| Answer» A. domain | |
| 361. | A domain is atomic if elements of the domain are considered to be units. |
| A. | different |
| B. | indivisbile |
| C. | constant |
| D. | divisible |
| Answer» B. indivisbile | |
| 362. | Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record? |
| A. | candidate key |
| B. | sub key |
| C. | super key |
| D. | foreign key |
| Answer» C. super key | |
| 363. | Consider attributes ID, CITY and NAME. Which one of this can be considered as a super key? |
| A. | name |
| B. | id |
| C. | city |
| D. | city, id |
| Answer» B. id | |
| 364. | The subset of a super key is a candidate key under what condition? |
| A. | no proper subset is a super key |
| B. | all subsets are super keys |
| C. | subset is a super key |
| D. | each subset is a super key |
| Answer» A. no proper subset is a super key | |
| 365. | A is a property of the entire relation, rather than of the individual tuples in which each tuple is unique. |
| A. | rows |
| B. | key |
| C. | attribute |
| D. | fields |
| Answer» B. key | |
| 366. | Which one of the following attribute can be taken as a primary key? |
| A. | name |
| B. | street |
| C. | id |
| D. | department |
| Answer» C. id | |
| 367. | Which one of the following cannot be taken as a primary key? |
| A. | id |
| B. | register number |
| C. | dept_id |
| D. | street |
| Answer» D. street | |
| 368. | An attribute in a relation is a foreign key if the key from one relation is used as an attribute in that relation. |
| A. | candidate |
| B. | primary |
| C. | super |
| D. | sub |
| Answer» B. primary | |
| 369. | The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called |
| A. | referential relation |
| B. | referencing relation |
| C. | referenced relation |
| D. | referred relation |
| Answer» C. referenced relation | |
| 370. | The is the one in which the primary key of one relation is used as a normal attribute in another relation. |
| A. | referential relation |
| B. | referencing relation |
| C. | referenced relation |
| D. | referred relation |
| Answer» C. referenced relation | |
| 371. | A integrity constraint requires that the values appearing in specified attributes of any tuple in the referencing relation also appear in specified attributes of at least one tuple in the referenced relation. |
| A. | referential |
| B. | referencing |
| C. | specific |
| D. | primary |
| Answer» A. referential | |
| 372. | The operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple. |
| A. | select |
| B. | join |
| C. | union |
| D. | intersection |
| Answer» B. join | |
| 373. | The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match. |
| A. | join |
| B. | cartesian product |
| C. | intersection |
| D. | set difference |
| Answer» B. cartesian product | |
| 374. | The operation performs a set union of two “similarly structured” tables |
| A. | union |
| B. | join |
| C. | product |
| D. | intersect |
| Answer» A. union | |
| 376. | The operator takes the results of two queries and returns only rows that appear in both result sets. |
| A. | union |
| B. | intersect |
| C. | difference |
| D. | projection |
| Answer» B. intersect | |
| 377. | A is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys. |
| A. | schema diagram |
| B. | relational algebra |
| C. | database diagram |
| D. | schema flow |
| Answer» A. schema diagram | |
| 378. | The provides a set of operations that take one or more relations as input and return a relation as an output. |
| A. | schematic representation |
| B. | relational algebra |
| C. | scheme diagram |
| D. | relation flow |
| Answer» B. relational algebra | |
| 379. | Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database? |
| A. | dml(data manipulation langauge) |
| B. | ddl(data definition langauge) |
| C. | query |
| D. | relational schema |
| Answer» A. dml(data manipulation langauge) | |
| 380. | To remove a relation from an SQL database, we use the command. |
| A. | delete |
| B. | purge |
| C. | remove |
| D. | drop table |
| Answer» D. drop table | |
| 381. | Updates that violate are disallowed. |
| A. | integrity constraints |
| B. | transaction control |
| C. | authorization |
| D. | ddl constraints |
| Answer» A. integrity constraints | |
| 382. | The clause allows us to select only those rows in the result relation of the clause that satisfy a specified predicate. |
| A. | where, from |
| B. | from, select |
| C. | select, from |
| D. | from, where |
| Answer» A. where, from | |
| 383. | The clause is used to list the attributes desired in the result of a query. |
| A. | where |
| B. | select |
| C. | from |
| D. | distinct |
| Answer» B. select | |
| 384. | Which of the following statements contains an error? |
| A. | select * from emp where empid = 10003; |
| B. | select empid from emp where empid = 10006; |
| C. | select empid from emp; |
| D. | select empid where empid = 1009 and lastname = ‘geller’; |
| Answer» D. select empid where empid = 1009 and lastname = ‘geller’; | |
| 385. | In SQL the spaces at the end of the string are removed by function. |
| A. | upper |
| B. | string |
| C. | trim |
| D. | lower |
| Answer» C. trim | |
| 386. | The union operation is represented by |
| A. | ∩ |
| B. | u |
| C. | – |
| D. | * |
| Answer» B. u | |
| 387. | The intersection operator is used to get the tuples. |
| A. | different |
| B. | common |
| C. | all |
| D. | repeating |
| Answer» B. common | |
| 388. | If we want to retain all duplicates, we must write in place of union. |
| A. | union all |
| B. | union some |
| C. | intersect all |
| D. | intersect some |
| Answer» A. union all | |
| 389. | The number of attributes in relation is called as its |
| A. | cardinality |
| B. | degree |
| C. | tuples |
| D. | entity |
| Answer» B. degree | |
| 390. | clause is an additional filter that is applied to the result. |
| A. | select |
| B. | group-by |
| C. | having |
| D. | order by |
| Answer» C. having | |
| 391. | joins are SQL server default |
| A. | outer |
| B. | inner |
| C. | equi |
| D. | none of the mentioned |
| Answer» B. inner | |
| 392. | The is essentially used to search for patterns in target string. |
| A. | like predicate |
| B. | null predicate |
| C. | in predicate |
| D. | out predicate |
| Answer» A. like predicate | |
| 393. | A indicates an absent value that may exist but be unknown or that may not exist at all. |
| A. | empty tuple |
| B. | new value |
| C. | null value |
| D. | old value |
| Answer» C. null value | |
| 394. | If the attribute phone number is included in the relation all the values need not be entered into the phone number column. This type of entry is given as |
| A. | 0 |
| B. | – |
| C. | null |
| D. | empty space |
| Answer» C. null | |
| 395. | The predicate in a where clause can involve Boolean operations such as and. The result of true and unknown is false and unknown is while unknown and unknown is |
| A. | unknown, unknown, false |
| B. | true, false, unknown |
| C. | true, unknown, unknown |
| D. | unknown, false, unknown |
| Answer» D. unknown, false, unknown | |
| 396. | Using the clause retains only one copy of such identical tuples. |
| A. | null |
| B. | unique |
| C. | not null |
| D. | distinct |
| Answer» D. distinct | |
| 397. | The primary key must be |
| A. | unique |
| B. | not null |
| C. | both unique and not null |
| D. | either unique or not null |
| Answer» C. both unique and not null | |
| 398. | The result of unknown is unknown. |
| A. | xor |
| B. | or |
| C. | and |
| D. | not |
| Answer» D. not | |
| 399. | Aggregate functions are functions that take a as input and return a single value. |
| A. | collection of values |
| B. | single value |
| C. | aggregate value |
| D. | both collection of values & single value |
| Answer» A. collection of values | |
| 401. | The connective tests for set membership, where the set is a collection of values produced by a select clause. The connective tests for the absence of set membership. |
| A. | or, in |
| B. | not in, in |
| C. | in, not in |
| D. | in, or |
| Answer» C. in, not in | |
| 402. | The phrase “greater than at least one” is represented in SQL by |
| A. | < all |
| B. | < some |
| C. | > all |
| D. | > some |
| Answer» D. > some | |
| 403. | SQL applies predicates in the clause after groups have been formed, so aggregate functions may be used. |
| A. | group by |
| B. | with |
| C. | where |
| D. | having |
| Answer» B. with | |
| 404. | The keyword is used to access attributes of preceding tables or subqueries in the from clause. |
| A. | in |
| B. | lateral |
| C. | having |
| D. | with |
| Answer» B. lateral | |
| 405. | Which of the following creates a temporary relation for the query on which it is defined? |
| A. | with |
| B. | from |
| C. | where |
| D. | select |
| Answer» A. with | |
| 406. | Subqueries cannot: |
| A. | use group by or group functions |
| B. | retrieve data from a table different from the one in the outer query |
| C. | join tables |
| D. | appear in select, update, delete, insert statements. |
| Answer» C. join tables | |
| 407. | Which of the following is not an aggregate function? |
| A. | avg |
| B. | sum |
| C. | with |
| D. | min |
| Answer» C. with | |
| 408. | The EXISTS keyword will be true if: |
| A. | any row in the subquery meets the condition only |
| B. | 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 |
| Answer» A. any row in the subquery meets the condition only | |
| 409. | How can you find rows that do not match some specified condition? |
| A. | exists |
| B. | double use of not exists |
| C. | not exists |
| D. | none of the mentioned |
| Answer» B. double use of not exists | |
| 410. | Which one of the following deletes all the entries but keeps the structure of the relation. |
| A. | delete from r where p; |
| B. | delete from instructor where dept name= ’finance’; |
| C. | delete from instructor where salary between 13000 and 15000; |
| D. | delete from instructor; |
| Answer» D. delete from instructor; | |
| 411. | The problem of ordering the update in multiple updates is avoided using |
| A. | set |
| B. | where |
| C. | case |
| D. | when |
| Answer» C. case | |
| 412. | The condition allows a general predicate over the relations being joined. |
| A. | on |
| B. | using |
| C. | set |
| D. | where |
| Answer» A. on | |
| 413. | Which of the join operations do not preserve non matched tuples? |
| A. | left outer join |
| B. | right outer join |
| C. | inner join |
| D. | natural join |
| Answer» C. inner join | |
| 414. | What type of join is needed when you wish to include rows that do not have matching values? |
| A. | equi-join |
| B. | natural join |
| C. | outer join |
| D. | all of the mentioned |
| Answer» C. outer join | |
| 415. | How many tables may be included with a join? |
| A. | one |
| B. | two |
| C. | three |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 416. | Which are the join types in join condition: |
| A. | cross join |
| B. | natural join |
| C. | join with using clause |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 417. | How many join types in join condition: |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» D. 5 | |
| 418. | The operation which is not considered a basic operation of relational algebra is |
| A. | join |
| B. | selection |
| C. | union |
| D. | cross product |
| Answer» A. join | |
| 419. | In SQL the statement select * from R, S is equivalent to |
| A. | select * from r natural join s |
| B. | select * from r cross join s |
| C. | select * from r union join s |
| D. | select * from r inner join s |
| Answer» B. select * from r cross join s | |
| 420. | Which of the following creates a virtual relation for storing the query? |
| A. | function |
| B. | view |
| C. | procedure |
| D. | none of the mentioned |
| Answer» B. view | |
| 421. | Materialised views make sure that |
| A. | view definition is kept stable |
| B. | view definition is kept up-to-date |
| C. | view definition is verified for error |
| D. | view is deleted after specified time |
| Answer» B. view definition is kept up-to-date | |
| 422. | Updating the value of the view |
| A. | will affect the relation from which it is defined |
| B. | will not change the view definition |
| C. | will not affect the relation from which it is defined |
| D. | cannot determine |
| Answer» A. will affect the relation from which it is defined | |
| 423. | Which of the following is used at the end of the view to reject the tuples which do not satisfy the condition in where clause? |
| A. | with |
| B. | check |
| C. | with check |
| D. | all of the mentioned |
| Answer» C. with check | |
| 424. | A consists of a sequence of query and/or update statements. |
| A. | transaction |
| B. | commit |
| C. | rollback |
| D. | flashback |
| Answer» A. transaction | |
| 426. | In case of any shut down during transaction before commit which of the following statement is done automatically? |
| A. | view |
| B. | commit |
| C. | rollback |
| D. | flashback |
| Answer» C. rollback | |
| 427. | In order to maintain the consistency during transactions, database provides |
| A. | commit |
| B. | atomic |
| C. | flashback |
| D. | retain |
| Answer» B. atomic | |
| 428. | A transaction completes its execution is said to be |
| A. | committed |
| B. | aborted |
| C. | rolled back |
| D. | failed |
| Answer» A. committed | |
| 429. | Which of the following is used to get back all the transactions back after rollback? |
| A. | commit |
| B. | rollback |
| C. | flashback |
| D. | redo |
| Answer» C. flashback | |
| 430. | will undo all statements up to commit? |
| A. | transaction |
| B. | flashback |
| C. | rollback |
| D. | abort |
| Answer» C. rollback | |
| 431. | Which of the following is not an integrity constraint? |
| A. | not null |
| B. | positive |
| C. | unique |
| D. | check ‘predicate’ |
| Answer» B. positive | |
| 432. | Domain constraints, functional dependency and referential integrity are special forms of |
| A. | foreign key |
| B. | primary key |
| C. | assertion |
| D. | referential constraint |
| Answer» C. assertion | |
| 433. | Which of the following is the right syntax for the assertion? |
| A. | create assertion ‘assertion-name’ check ‘predicate’; |
| B. | create assertion check ‘predicate’ ‘assertion-name’; |
| C. | create assertions ‘predicates’; |
| D. | all of the mentioned |
| Answer» A. create assertion ‘assertion-name’ check ‘predicate’; | |
| 434. | Data integrity constraints are used to: |
| A. | control who is allowed access to the data |
| B. | ensure that duplicate records are not entered into the table |
| C. | improve the quality of data entered for a specific property (i.e., table column) |
| D. | prevent users from changing the values stored in the table |
| Answer» C. improve the quality of data entered for a specific property (i.e., table column) | |
| 435. | Dates must be specified in the format |
| A. | mm/dd/yy |
| B. | yyyy/mm/dd |
| C. | dd/mm/yy |
| D. | yy/dd/mm |
| Answer» B. yyyy/mm/dd | |
| 436. | A on an attribute of a relation is a data structure that allows the database system to find those tuples in the relation that have a specified value for that attribute efficiently, without scanning through all the tuples of the relation. |
| A. | index |
| B. | reference |
| C. | assertion |
| D. | timestamp |
| Answer» A. index | |
| 437. | Which of the following is used to store movie and image files? |
| A. | clob |
| B. | blob |
| C. | binary |
| D. | image |
| Answer» B. blob | |
| 438. | The user defined data type can be created using |
| A. | create datatype |
| B. | create data |
| C. | create definetype |
| D. | create type |
| Answer» D. create type | |
| 439. | Values of one type can be converted to another domain using which of the following? |
| A. | cast |
| B. | drop type |
| C. | alter type |
| D. | convert |
| Answer» A. cast | |
| 440. | Which of the following closely resembles Create view? |
| A. | create table . . .like |
| B. | create table . . . as |
| C. | with data |
| D. | create view as |
| Answer» B. create table . . . as | |
| 441. | In contemporary databases, the top level of the hierarchy consists of each of which can contain |
| A. | catalogs, schemas |
| B. | schemas, catalogs |
| C. | environment, schemas |
| D. | schemas, environment |
| Answer» A. catalogs, schemas | |
| 442. | The database administrator who authorizes all the new users, modifies the database and takes grants privilege is |
| A. | super user |
| B. | administrator |
| C. | operator of operating system |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 443. | Which of the following is used to provide privilege to only a particular attribute? |
| A. | grant select on employee to amit |
| B. | grant update(budget) on department to raj |
| C. | grant update(budget,salary,rate) on department to raj |
| D. | grant delete to amit |
| Answer» B. grant update(budget) on department to raj | |
| 444. | Which of the following is true regarding views? |
| A. | the user who creates a view cannot be given update authorization on a view without having update authorization on the relations used to define the view |
| B. | the user who creates a view cannot be given update authorization on a view without having update authorization on the relations used to define the view |
| C. | if a user creates a view on which no authorization can be granted, the system will allow the view creation request |
| D. | a user who creates a view receives all privileges on that view |
| Answer» C. if a user creates a view on which no authorization can be granted, the system will allow the view creation request | |
| 445. | If we wish to grant a privilege and to allow the recipient to pass the privilege on to other users, we append the clause to the appropriate grant command. |
| A. | with grant |
| B. | grant user |
| C. | grant pass privelege |
| D. | with grant option |
| Answer» D. with grant option | |
| 446. | Which of the following is used to avoid cascading of authorizations from the user? |
| A. | granted by current role |
| B. | revoke select on department from amit, satoshi restrict; |
| C. | revoke grant option for select on department from amit; |
| D. | revoke select on department from amit, satoshi cascade; |
| Answer» B. revoke select on department from amit, satoshi restrict; | |
| 447. | The granting and revoking of roles by the user may cause some confusions when that user role is revoked. To overcome the above situation |
| A. | the privilege must be granted only by roles |
| B. | the privilege is granted by roles and users |
| C. | the user role cannot be removed once given |
| D. | by restricting the user access to the roles |
| Answer» A. the privilege must be granted only by roles | |
| 448. | Which of the following is used to access the database server at the time of executing the program and get the data from the server accordingly? |
| A. | embedded sql |
| B. | dynamic sql |
| C. | sql declarations |
| D. | sql data analysis |
| Answer» B. dynamic sql | |
| 449. | Which of the following header must be included in java program to establish database connectivity using JDBC ? |
| A. | import java.sql.*; |
| B. | import java.sql.odbc.jdbc.*; |
| C. | import java.jdbc.*; |
| D. | import java.sql.jdbc.*; |
| Answer» A. import java.sql.*; | |
| 451. | Which of the following function is used to find the column count of the particular resultset? |
| A. | getmetadata() |
| B. | metadata() |
| C. | getcolumn() |
| D. | get count() |
| Answer» A. getmetadata() | |
| 452. | Which of the following is used as the embedded SQL in COBOL? |
| A. | exec sql <embedded sql statement >; |
| B. | exec sql <embedded sql statement > end-exec |
| C. | exec sql <embedded sql statement > |
| D. | exec sql <embedded sql statement > end exec; |
| Answer» B. exec sql <embedded sql statement > end-exec | |
| 453. | Which of the following is used to distinguish the variables in SQL from the host language variables? |
| A. | . |
| B. | – |
| C. | : |
| D. | , |
| Answer» B. – | |
| 454. | Which of the following is used to access large objects from a database ? |
| A. | setblob() |
| B. | getblob() |
| C. | getclob() |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 455. | A is a special kind of a store procedure that executes in response to certain action on the table like insertion, deletion or updation of data. |
| A. | procedures |
| B. | triggers |
| C. | functions |
| D. | none of the mentioned |
| Answer» B. triggers | |
| 456. | Triggers are supported in |
| A. | delete |
| B. | update |
| C. | views |
| D. | all of the mentioned |
| Answer» C. views | |
| 457. | What are the after triggers? |
| A. | triggers generated after a particular operation |
| B. | these triggers run after an insert, update or delete on a table |
| C. | these triggers run after an insert, views, update or delete on a table |
| D. | all of the mentioned |
| Answer» B. these triggers run after an insert, update or delete on a table | |
| 458. | The variables in the triggers are declared using |
| A. | – |
| B. | @ |
| C. | / |
| D. | /@ |
| Answer» B. @ | |
| 459. | The default extension for an Oracle SQL*Plus file is: |
| A. | .txt |
| B. | .pls |
| C. | .ora |
| D. | .sql |
| Answer» D. .sql | |
| 460. | Which of the following is NOT an Oracle- supported trigger? |
| A. | before |
| B. | during |
| C. | after |
| D. | instead of |
| Answer» B. during | |
| 461. | What are the different in triggers? |
| A. | define, create |
| B. | drop, comment |
| C. | insert, update, delete |
| D. | all of the mentioned |
| Answer» C. insert, update, delete | |
| 462. | Triggers enabled or disabled |
| A. | can be |
| B. | cannot be |
| C. | ought to be |
| D. | always |
| Answer» A. can be | |
| 463. | Which prefixes are available to Oracle triggers? |
| A. | : new only |
| B. | : old only |
| C. | both :new and : old |
| D. | neither :new nor : old |
| Answer» C. both :new and : old | |
| 464. | Any recursive view must be defined as the union of two subqueries: a query that is nonrecursive and a query. |
| A. | base, recursive |
| B. | recursive, base |
| C. | base, redundant |
| D. | view, base |
| Answer» A. base, recursive | |
| 465. | Ranking of queries is done by which of the following? |
| A. | group by |
| B. | order by |
| C. | having |
| D. | both group by and order by |
| Answer» B. order by | |
| 466. | In rank() function if one value is shared by two tuples then |
| A. | the rank order continues as counting numbers |
| B. | the rank order continues by leaving one rank in the middle |
| C. | the user specifies the order |
| D. | the order does not change |
| Answer» B. the rank order continues by leaving one rank in the middle | |
| 467. | The function that does not create gaps in the ordering. |
| A. | intense_rank() |
| B. | continue_rank() |
| C. | default_rank() |
| D. | dense_rank() |
| Answer» D. dense_rank() | |
| 468. | If there are n tuples in the partition and the rank of the tuple is r, then its is defined as (r −1)/(n−1). |
| A. | ntil() |
| B. | cum_rank |
| C. | percent_rank |
| D. | rank() |
| Answer» C. percent_rank | |
| 469. | Inorder to simplify the null value confusion in the rank function we can specify |
| A. | not null |
| B. | nulls last |
| C. | nulls first |
| D. | either nulls last or first |
| Answer» D. either nulls last or first | |
| 470. | The command such tables are available only within the transaction executing the query and are dropped when the transaction finishes. |
| A. | create table |
| B. | create temporary table |
| C. | create view |
| D. | create label view |
| Answer» B. create temporary table | |
| 471. | OLAP stands for |
| A. | online analytical processing |
| B. | online analysis processing |
| C. | online transaction processing |
| D. | online aggregate processing |
| Answer» A. online analytical processing | |
| 472. | The process of viewing the cross-tab (Single dimensional) with a fixed value of one attribute is |
| A. | slicing |
| B. | dicing |
| C. | pivoting |
| D. | both slicing and dicing |
| Answer» A. slicing | |
| 473. | The operation of moving from finer- granularity data to a coarser granularity (by means of aggregation) is called a |
| A. | rollup |
| B. | drill down |
| C. | dicing |
| D. | pivoting |
| Answer» A. rollup | |
| 474. | In SQL the cross-tabs are created using |
| A. | slice |
| B. | dice |
| C. | pivot |
| D. | all of the mentioned |
| Answer» A. slice | |
| 476. | Which one of the following is the right syntax for DECODE? | |
| A. | decode (search, expression, result [, search, result]… [, default]) | |
| B. | decode (expression, result [, search, result]… [, default], search) | |
| C. | decode (search, result [, search, result]… [, default], expression) | |
| D. | decode (expression, search, result [, search, result]… [, default]) | |
| Answer» D. decode (expression, search, result [, search, result]… [, default]) | ||
| 477. | Relational Algebra is a query language that takes two relations as input and produces another relation as an output of the query. |
| A. | relational |
| B. | structural |
| C. | procedural |
| D. | fundamental |
| Answer» C. procedural | |
| 478. | Which of the following is a fundamental operation in relational algebra? |
| A. | set intersection |
| B. | natural join |
| C. | assignment |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 479. | Which of the following is used to denote the selection operation in relational algebra? |
| A. | pi (greek) |
| B. | sigma (greek) |
| C. | lambda (greek) |
| D. | omega (greek) |
| Answer» B. sigma (greek) | |
| 480. | For select operation the appear in the subscript and the argument appears in the paranthesis after the sigma. |
| A. | predicates, relation |
| B. | relation, predicates |
| C. | operation, predicates |
| D. | relation, operation |
| Answer» A. predicates, relation | |
| 481. | The operation, denoted by −, allows us to find tuples that are in one relation but are not in another. |
| A. | union |
| B. | set-difference |
| C. | difference |
| D. | intersection |
| Answer» B. set-difference | |
| 482. | Which is a unary operation: |
| A. | selection operation |
| B. | primitive operation |
| C. | projection operation |
| D. | generalized selection |
| Answer» D. generalized selection | |
| 483. | Which is a join condition contains an equality operator: |
| A. | equijoins |
| B. | cartesian |
| C. | natural |
| D. | left |
| Answer» A. equijoins | |
| 484. | Which of the following is not outer join? |
| A. | left outer join |
| B. | right outer join |
| C. | full outer join |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 485. | The assignment operator is denoted by |
| A. | -> |
| B. | <- |
| C. | = |
| D. | == |
| Answer» B. <- | |
| 486. | Which of the following symbol is used in the place of except? |
| A. | ^ |
| B. | v |
| C. | ¬ |
| D. | ~ |
| Answer» C. ¬ | |
| 487. | Which of the following is the comparison operator in tuple relational calculus |
| A. | ⇒ |
| B. | = |
| C. | ε |
| D. | all of the mentioned |
| Answer» B. = | |
| 488. | In domain relaional calculus “there exist” |
| A. | (p1(x)) |
| B. | (p1(x)) Э x |
| C. | v x (p1(x)) |
| D. | Э x (p1(x)) |
| Answer» D. Э x (p1(x)) | |
| 489. | A set of possible data values is called |
| A. | attribute |
| B. | degree |
| C. | tuple |
| D. | domain |
| Answer» D. domain | |
| 490. | An is a set of entities of the same type that share the same properties, or attributes. |
| A. | entity set |
| B. | attribute set |
| C. | relation set |
| D. | entity model |
| Answer» A. entity set | |
| 491. | Entity is a |
| A. | object of relation |
| B. | present working model |
| C. | thing in real world |
| D. | model of relation |
| Answer» C. thing in real world | |
| 492. | The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called |
| A. | simple attribute |
| B. | composite attribute |
| C. | multivalued attribute |
| D. | derived attribute |
| Answer» B. composite attribute | |
| 493. | The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE is |
| A. | single valued |
| B. | multi valued |
| C. | composite |
| D. | derived |
| Answer» D. derived | |
| 494. | Not applicable condition can be represented in relation entry as |
| A. | na |
| B. | 0 |
| C. | null |
| D. | blank space |
| Answer» C. null | |
| 495. | Which of the following can be a multivalued attribute? |
| A. | phone_number |
| B. | name |
| C. | date_of_birth |
| D. | all of the mentioned |
| Answer» A. phone_number | |
| 496. | Which of the following is a single valued attribute |
| A. | register_number |
| B. | address |
| C. | subject_taken |
| D. | reference |
| Answer» A. register_number | |
| 497. | In a relation between the entities the type and condition of the relation should be specified. That is called as attribute. |
| A. | desciptive |
| B. | derived |
| C. | recursive |
| D. | relative |
| Answer» A. desciptive | |
| 498. | express the number of entities to which another entity can be associated via a relationship set. |
| A. | mapping cardinality |
| B. | relational cardinality |
| C. | participation constraints |
| D. | none of the mentioned |
| Answer» A. mapping cardinality | |
| 499. | An entity in A is associated with at most one entity in B, and an entity in B is associated with at most one entity in A.This is called as |
| A. | one-to-many |
| B. | one-to-one |
| C. | many-to-many |
| D. | many-to-one |
| Answer» B. one-to-one | |
| 501. | Data integrity constraints are used to: |
| A. | control who is allowed access to the data |
| B. | ensure that duplicate records are not entered into the table |
| C. | improve the quality of data entered for a specific property |
| D. | prevent users from changing the values stored in the table |
| Answer» C. improve the quality of data entered for a specific property | |
| 502. | Establishing limits on allowable property values, and specifying a set of acceptable, predefined options that can be assigned to a property are examples of: |
| A. | attributes |
| B. | data integrity constraints |
| C. | method constraints |
| D. | referential integrity constraints |
| Answer» B. data integrity constraints | |
| 503. | Which of the following can be addressed by enforcing a referential integrity constraint? |
| A. | all phone numbers must include the area code |
| B. | certain fields are required (such as the email address, or phone number) before the record is accepted |
| C. | information on the customer must be known before anything can be sold to that customer |
| D. | then entering an order quantity, the user must input a number and not some text (i.e., 12 rather than ‘a dozen’) |
| Answer» C. information on the customer must be known before anything can be sold to that customer | |
| 504. | is a special type of integrity constraint that relates two relations & maintains consistency across the relations. |
| A. | entity integrity constraints |
| B. | referential integrity constraints |
| C. | domain integrity constraints |
| D. | domain constraints |
| Answer» B. referential integrity constraints | |
| 505. | Which one of the following uniquely identifies the elements in the relation? |
| A. | secondary key |
| B. | primary key |
| C. | foreign key |
| D. | composite key |
| Answer» B. primary key | |
| 506. | Drop Table cannot be used to drop a table referenced by a constraint. |
| A. | local key |
| B. | primary key |
| C. | composite key |
| D. | foreign key |
| Answer» D. foreign key | |
| 507. | is preferred method for enforcing data integrity |
| A. | constraints |
| B. | stored procedure |
| C. | triggers |
| D. | cursors |
| Answer» A. constraints | |
| 508. | The entity relationship set is represented in E-R diagram as |
| A. | double diamonds |
| B. | undivided rectangles |
| C. | dashed lines |
| D. | diamond |
| Answer» D. diamond | |
| 509. | The Rectangles divided into two parts represents |
| A. | entity set |
| B. | relationship set |
| C. | attributes of a relationship set |
| D. | primary key |
| Answer» A. entity set | |
| 510. | We indicate roles in E-R diagrams by labeling the lines that connect to |
| A. | diamond , diamond |
| B. | rectangle, diamond |
| C. | rectangle, rectangle |
| D. | diamond, rectangle |
| Answer» D. diamond, rectangle | |
| 511. | An entity set that does not have sufficient attributes to form a primary key is termed a |
| A. | strong entity set |
| B. | variant set |
| C. | weak entity set |
| D. | variable set |
| Answer» C. weak entity set | |
| 512. | For a weak entity set to be meaningful, it must be associated with another entity set, called the |
| A. | identifying set |
| B. | owner set |
| C. | neighbour set |
| D. | strong entity set |
| Answer» A. identifying set | |
| 513. | Weak entity set is represented as |
| A. | underline |
| B. | double line |
| C. | double diamond |
| D. | double rectangle |
| Answer» C. double diamond | |
| 514. | If you were collecting and storing information about your music collection, an album would be considered a(n) |
| A. | relation |
| B. | entity |
| C. | instance |
| D. | attribute |
| Answer» B. entity | |
| 515. | What term is used to refer to a specific record in your music database; for instance; information stored about a specific album? |
| A. | relation |
| B. | instance |
| C. | table |
| D. | column |
| Answer» B. instance | |
| 516. | Which one of the following can be treated as a primary key in teaches relation? |
| A. | id |
| B. | semester |
| C. | sec_id |
| D. | year |
| Answer» A. id | |
| 517. | The primary key in the section relation is |
| A. | course_id |
| B. | sec_id |
| C. | both course_id and sec_id |
| D. | all the attributes |
| Answer» C. both course_id and sec_id | |
| 518. | The relation with primary key can be created using |
| A. | create table instructor (id, name) |
| B. | create table instructor (id, name, primary key(name)) |
| C. | create table instructor (id, name, primary key (id)) |
| D. | create table instructor ( id unique, name ) |
| Answer» C. create table instructor (id, name, primary key (id)) | |
| 519. | How can the values in the relation teaches be deleted? |
| A. | drop table teaches; |
| B. | delete from teaches; |
| C. | purge table teaches; |
| D. | delete from teaches where id =’null’; |
| Answer» B. delete from teaches; | |
| 520. | In the above teaches relation ” Select * from teaches where Year = ‘2010’” displays how many rows? |
| A. | 2 |
| B. | 4 |
| C. | 5 |
| D. | 1 |
| Answer» A. 2 | |
| 521. | The relation changes can be got back using command |
| A. | flashback |
| B. | purge |
| C. | delete |
| D. | getback |
| Answer» A. flashback | |
| 522. | Let us consider phone_number ,which can take single or several values . Treating phone_numberas an permits instructors to have several phone numbers (including zero) associated with them. |
| A. | entity |
| B. | attribute |
| C. | relation |
| D. | value |
| Answer» A. entity | |
| 523. | The total participation by entities is represented in E-R diagram as |
| A. | dashed line |
| B. | double line |
| C. | double rectangle |
| D. | circle |
| Answer» B. double line | |
| 524. | Given the basic ER and relational models, which of the following is INCORRECT? |
| A. | an attribute of an entity can have more than one value |
| B. | an attribute of an entity can be composite |
| C. | in a row of a relational table, an attribute can have more than one value |
| D. | in a row of a relational table, an attribute can have exactly one value or a null value |
| Answer» C. in a row of a relational table, an attribute can have more than one value | |
| 526. | In E-R diagram generalization is represented by | |
| A. | ellipse | |
| B. | dashed ellipse | |
| C. | rectangle | |
| D. | triangle | |
| Answer» D. triangle | ||
| 527. | What is a relationship called when it is maintained between two entities? |
| A. | unary |
| B. | binary |
| C. | ternary |
| D. | quaternary |
| Answer» B. binary | |
| 528. | Which of the following is a low level operator? |
| A. | insert |
| B. | update |
| C. | delete |
| D. | directory |
| Answer» D. directory | |
| 529. | Key to represent relationship between tables is called |
| A. | primary key |
| B. | secondary key |
| C. | foreign key |
| D. | none of the mentioned |
| Answer» C. foreign key | |
| 530. | A window into a portion of a database is |
| A. | schema |
| B. | view |
| C. | query |
| D. | data dictionary |
| Answer» B. view | |
| 531. | A primary key is combined with a foreign key creates |
| A. | parent-child relation ship between the tables that connect them |
| B. | many to many relationship between the tables that connect them |
| C. | network model between the tables that connect them |
| D. | none of the mentioned |
| Answer» A. parent-child relation ship between the tables that connect them | |
| 532. | The entity set person is classified as student and employee. This process is called |
| A. | generalization |
| B. | specialization |
| C. | inheritance |
| D. | constraint generalization |
| Answer» B. specialization | |
| 533. | Which relationship is used to represent a specialization entity? |
| A. | isa |
| B. | ais |
| C. | onis |
| D. | whois |
| Answer» A. isa | |
| 534. | The refinement from an initial entity set into successive levels of entity subgroupings represents a design process in which distinctions are made explicit. |
| A. | hierarchy |
| B. | bottom-up |
| C. | top-down |
| D. | radical |
| Answer» C. top-down | |
| 535. | There are similarities between the instructor entity set and the secretary entity set in the sense that they have several attributes that are conceptually the same across the two entity sets: namely, the identifier, name, and salary attributes. This process is called |
| A. | commonality |
| B. | specialization |
| C. | generalization |
| D. | similarity |
| Answer» C. generalization | |
| 536. | If an entity set is a lower-level entity set in more than one ISA relationship, then the entity set has |
| A. | hierarchy |
| B. | multilevel inheritance |
| C. | single inheritance |
| D. | multiple inheritance |
| Answer» D. multiple inheritance | |
| 537. | A constraint requires that an entity belong to no more than one lower- level entity set. |
| A. | disjointness |
| B. | uniqueness |
| C. | special |
| D. | relational |
| Answer» A. disjointness | |
| 538. | Consider the employee work-team example, and assume that certain employees participate in more than one work team. A given employee may therefore appear in more than one of the team entity sets that are lower level entity sets of employee. Thus, the generalization is |
| A. | overlapping |
| B. | disjointness |
| C. | uniqueness |
| D. | relational |
| Answer» A. overlapping | |
| 539. | The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default? |
| A. | total |
| B. | partial |
| C. | should be specified |
| D. | cannot be determined |
| Answer» B. partial | |
| 540. | Functional dependencies are a generalization of |
| A. | key dependencies |
| B. | relation dependencies |
| C. | database dependencies |
| D. | none of the mentioned |
| Answer» A. key dependencies | |
| 541. | Which of the following is another name for a weak entity? |
| A. | child |
| B. | owner |
| C. | dominant |
| D. | all of the mentioned |
| Answer» A. child | |
| 542. | Which is the main relation which is used in the university database which is referenced by all other relation of the university? |
| A. | teaches |
| B. | course |
| C. | department |
| D. | section |
| Answer» C. department | |
| 543. | The department relation has the an entry budget whose type has to be replaced by |
| A. | varchar (20) |
| B. | varchar2 (20) |
| C. | numeric (12,2) |
| D. | numeric |
| Answer» C. numeric (12,2) | |
| 544. | In the above DDL command the foreign key entries are got by using the keyword |
| A. | references |
| B. | key reference |
| C. | relating |
| D. | none of the mentioned |
| Answer» A. references | |
| 545. | Identify the error in the section relation |
| A. | no error |
| B. | year numeric (4,0) |
| C. | building varchar (15) |
| D. | sec_id varchar (8) |
| Answer» A. no error | |
| 546. | Which of the following can be used as a primary key entry of the instructor relation. |
| A. | dept_name |
| B. | name |
| C. | id |
| D. | all of the mentioned |
| Answer» C. id | |
| 547. | In the section relation which of the following is used as a foreign key? |
| A. | course_id |
| B. | course_id,sec_id |
| C. | room_number |
| D. | course_id,sec_id,room_number |
| Answer» A. course_id | |
| 548. | To replace the relation section with some other relation the initial step to be carried out is |
| A. | delete section; |
| B. | drop section; |
| C. | delete from section; |
| D. | replace section new_table ; |
| Answer» B. drop section; | |
| 549. | Select distinct Dept_name from instructor ; How many row(s) are displayed ? |
| A. | 4 |
| B. | 3 |
| C. | 5 |
| D. | error |
| Answer» A. 4 | |
| 551. | Which function is used to identify the title with Least scope? |
| A. | min(credits) |
| B. | max(credits) |
| C. | min(title) |
| D. | min(salary) |
| Answer» A. min(credits) | |
| 552. | A domain is if elements of the domain are considered to be indivisible units. |
| A. | atomic |
| B. | subatomic |
| C. | substructure |
| D. | subset |
| Answer» A. atomic | |
| 553. | Identify the composite attributes |
| A. | salary |
| B. | credits |
| C. | section_id |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 554. | Which one is based on multi-valued dependency: |
| A. | first |
| B. | second |
| C. | third |
| D. | fourth |
| Answer» D. fourth | |
| 555. | If a relation is in BCNF, then it is also in |
| A. | 1 nf |
| B. | 2 nf |
| C. | 3 nf |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 556. | If every non-key attribute is functionally dependent primary key, then the relation will be in |
| A. | first normal form |
| B. | second normal form |
| C. | third form |
| D. | fourth normal form |
| Answer» B. second normal form | |
| 557. | The term for information that describes what type of data is available in a database is: |
| A. | data dictionary |
| B. | data repository |
| C. | index data |
| D. | metadata |
| Answer» D. metadata | |
| 558. | A data type that creates unique numbers for key columns in Microsoft Access is: |
| A. | autonumber |
| B. | boolean |
| C. | sequential key |
| D. | sequential number |
| Answer» A. autonumber | |
| 559. | A dependency exist between two columns when |
| A. | together they constitute a composite key for the table |
| B. | knowing the value in one column determines the value stored in another column |
| C. | the table is in 3nf |
| D. | together they constitute a foreign key |
| Answer» A. together they constitute a composite key for the table | |
| 560. | In the normal form, a composite attribute is converted to individual attributes. |
| A. | first |
| B. | second |
| C. | third |
| D. | fourth |
| Answer» A. first | |
| 561. | A table on the many side of a one to many or many to many relationship must: |
| A. | be in second normal form (2nf) |
| B. | be in third normal form (3nf) |
| C. | have a single attribute key |
| D. | have a composite key |
| Answer» D. have a composite key | |
| 562. | Tables in second normal form (2NF): |
| A. | eliminate all hidden dependencies |
| B. | eliminate the possibility of a insertion anomalies |
| C. | have a composite key |
| D. | have all non key fields depend on the whole primary key |
| Answer» A. eliminate all hidden dependencies | |
| 563. | Functional Dependencies are the types of constraints that are based on |
| A. | key |
| B. | key revisited |
| C. | superset key |
| D. | none of the mentioned |
| Answer» A. key | |
| 564. | Which is a bottom-up approach to database design that design by examining the relationship between attributes: |
| A. | functional dependency |
| B. | database modeling |
| C. | normalization |
| D. | decomposition |
| Answer» C. normalization | |
| 565. | A relation is in if an attribute of a composite key is dependent on an attribute of other composite key. |
| A. | 2nf |
| B. | 3nf |
| C. | bcnf |
| D. | 1nf |
| Answer» B. 3nf | |
| 566. | What are the desirable properties of a decomposition |
| A. | partition constraint |
| B. | dependency preservation |
| C. | redundancy |
| D. | security |
| Answer» B. dependency preservation | |
| 567. | R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition? |
| A. | a->b, b->cd |
| B. | a->b, b->c, c->d |
| C. | ab->c, c->ad |
| D. | a->bcd |
| Answer» D. a->bcd | |
| 568. | The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is |
| A. | bcnf algorithm |
| B. | 2nf algorithm |
| C. | 3nf synthesis algorithm |
| D. | 1nf algorithm |
| Answer» C. 3nf synthesis algorithm | |
| 569. | Which normal form is considered adequate for normal relational database design? |
| A. | 2nf |
| B. | 5nf |
| C. | 4nf |
| D. | 3nf |
| Answer» D. 3nf | |
| 570. | Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is |
| A. | zero |
| B. | more than zero but less than that of an equivalent 3nf decomposition |
| C. | proportional to the size of f+ |
| D. | indeterminate |
| Answer» B. more than zero but less than that of an equivalent 3nf decomposition | |
| 571. | Which of the normal form is based on multivalued dependencies? |
| A. | first |
| B. | second |
| C. | third |
| D. | fourth |
| Answer» D. fourth | |
| 572. | Which forms has a relation that possesses data about an individual entity? |
| A. | 2nf |
| B. | 3nf |
| C. | 4nf |
| D. | 5nf |
| Answer» C. 4nf | |
| 573. | If a multivalued dependency holds and is not implied by the corresponding functional dependency, it usually arises from one of the following sources. |
| A. | a many-to-many relationship set |
| B. | a multivalued attribute of an entity set |
| C. | a one-to-many relationship set |
| D. | both a many-to-many relationship set and a multivalued attribute of an entity set |
| Answer» D. both a many-to-many relationship set and a multivalued attribute of an entity set | |
| 574. | Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set? |
| A. | a many-to-many relationship set |
| B. | a multivalued attribute of an entity set |
| C. | a one-to-many relationship set |
| D. | none of the mentioned |
| Answer» A. a many-to-many relationship set | |
| 576. | In 2NF | |
| A. | no functional dependencies (fds) exist | |
| B. | no multivalued dependencies (mvds) exist | |
| C. | no partial fds exist | |
| D. | no partial mvds exist | |
| Answer» C. no partial fds exist | ||
| 577. | can help us detect poor E- R design. |
| A. | database design process |
| B. | e-r design process |
| C. | relational scheme |
| D. | functional dependencies |
| Answer» D. functional dependencies | |
| 578. | Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set. |
| A. | a many-to-many relationship set |
| B. | a multivalued attribute of an entity set |
| C. | a one-to-many relationship set |
| D. | all of the mentioned |
| Answer» A. a many-to-many relationship set | |
| 579. | In which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set. |
| A. | a many-to-many relationship set |
| B. | a multivalued attribute of an entity set |
| C. | a one-to-many relationship set |
| D. | all of the mentioned |
| Answer» B. a multivalued attribute of an entity set | |
| 580. | What is the best way to represent the attributes in a large database? |
| A. | relational-and |
| B. | concatenation |
| C. | dot representation |
| D. | all of the mentioned |
| Answer» B. concatenation | |
| 581. | Designers use which of the following to tune the performance of systems to support time-critical operations? |
| A. | denormalization |
| B. | redundant optimization |
| C. | optimization |
| D. | realization |
| Answer» A. denormalization | |
| 582. | Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here the only functional dependencies are from dept name to the other attributes. This relation is in |
| A. | fourth nf |
| B. | bcnf |
| C. | third nf |
| D. | second nf |
| Answer» B. bcnf | |
| 583. | Thus a of course data gives the values of all attributes, such as title and department, of all courses at a particular point in time. |
| A. | instance |
| B. | snapshot |
| C. | both instance and snapshot |
| D. | all of the mentioned |
| Answer» B. snapshot | |
| 584. | Representations such as the in the dept year relation, with one column for each value of an attribute, are called they are widely used in spreadsheets and reports and in data analysis tools. |
| A. | cross-tabs |
| B. | snapshot |
| C. | both cross-tabs and snapshot |
| D. | all of the mentioned |
| Answer» A. cross-tabs | |
| 585. | An approach to website design with the emphasis on converting visitors to outcomes required by the owner is referred to as: |
| A. | web usability |
| B. | persuasion |
| C. | web accessibility |
| D. | none of the mentioned |
| Answer» B. persuasion | |
| 586. | A method of modelling and describing user tasks for an interactive application is referred to as: |
| A. | customer journey |
| B. | primary persona |
| C. | use case |
| D. | web design persona |
| Answer» C. use case | |
| 587. | Information architecture influences: |
| A. | answer choice |
| B. | site structure |
| C. | labeling |
| D. | navigation design |
| Answer» B. site structure | |
| 588. | Also known as schematics, a way of illustrating the layout of an individual webpage is a: |
| A. | wireframe |
| B. | sitemap |
| C. | card sorting |
| D. | blueprint |
| Answer» A. wireframe | |
| 589. | A graphical or text depiction of the relationship between different groups of content on a website is referred to as a: |
| A. | wireframe |
| B. | blueprint |
| C. | sitemap |
| D. | card sorting |
| Answer» C. sitemap | |
| 590. | Blueprints are intended to: |
| A. | prototype of the screen layout showing navigation and main design elements |
| B. | show the grouping of pages and user journeys |
| C. | indicate the structure of a site during site design and as a user feature |
| D. | prototype typical customer journeys or clickstreams through a website |
| Answer» C. indicate the structure of a site during site design and as a user feature | |
| 591. | Storyboards are intended to: |
| A. | indicate the structure of a site during site design and as a user feature |
| B. | prototype of the screen layout showing navigation and main design elements |
| C. | integrate consistently available components on the webpage (e.g. navigation, search boxes) |
| D. | prototype typical customer journeys or click streams through a website |
| Answer» D. prototype typical customer journeys or click streams through a website | |
| 592. | Which of the following occupies boot record of hard and floppy disks and activated during computer startup? |
| A. | worm |
| B. | boot sector virus |
| C. | macro virus |
| D. | virus |
| Answer» B. boot sector virus | |
| 593. | A graphical or text depiction of the relationship between different groups of content on a website is a: |
| A. | page template |
| B. | wireframe |
| C. | site map |
| D. | cascading style sheet (css) |
| Answer» C. site map | |
| 594. | Which of the following is a valid uniform resource locator? |
| A. | http://www.acm.org/sigmod |
| B. | http://www.google.com |
| C. | http://www.ann.in |
| D. | http:/www.acm.org/sigmod/ |
| Answer» A. http://www.acm.org/sigmod | |
| 595. | HTTP defines two ways in which values entered by a user at the browser can be sent to the Web server. The method encodes the values as part of the URL. |
| A. | post |
| B. | get |
| C. | read |
| D. | argument |
| Answer» B. get | |
| 596. | A is a program running on the server machine, which accepts requests from a Web browser and sends back results in the form of HTML documents. |
| A. | html |
| B. | http |
| C. | web server |
| D. | web browser |
| Answer» C. web server | |
| 597. | The application program typically communicates with a database server, through or other protocols, in order to get or store data. |
| A. | jdbc |
| B. | odbc |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 598. | This extra information is usually maintained in the form of a at the client. |
| A. | cookie |
| B. | history |
| C. | remainder |
| D. | none of the mentioned |
| Answer» A. cookie | |
| 599. | Which of the following is not true about HTML ? |
| A. | <meta>…</meta> |
| B. | <meta…./> |
| C. | <metadata>…</metadata> |
| D. | <metadata name=”” /> |
| Answer» B. <meta…./> | |
| 601. | Html document must always be saved with: | |
| A. | .html | |
| B. | .htm | |
| C. | .doc | |
| D. | both .html & .htm | |
| Answer» D. both .html & .htm | ||
| 602. | How many levels of headings are in html: |
| A. | 2 |
| B. | 7 |
| C. | 6 |
| D. | 4 |
| Answer» C. 6 | |
| 603. | The Java specification defines an application programming interface for communication between the Web server and the application program. |
| A. | servlet |
| B. | server |
| C. | program |
| D. | randomize |
| Answer» A. servlet | |
| 604. | How many JDBC driver types does Sun define? |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» D. four | |
| 605. | Which JDBC driver Type(s) can be used in either applet or servlet code? |
| A. | both type 1 and type 2 |
| B. | both type 1 and type 3 |
| C. | both type 3 and type 4 |
| D. | type 4 only |
| Answer» C. both type 3 and type 4 | |
| 606. | What MySQL property is used to create a surrogate key in MySQL? |
| A. | unique |
| B. | sequence |
| C. | auto_increment |
| D. | none of the mentioned |
| Answer» C. auto_increment | |
| 607. | A JSP is transformed into a(n): |
| A. | java applet |
| B. | java servlet |
| C. | either 1 or 2 above |
| D. | neither 1 nor 2 above |
| Answer» B. java servlet | |
| 608. | What is bytecode? |
| A. | machine-specific code |
| B. | java code |
| C. | machine-independent code |
| D. | none of the mentioned |
| Answer» C. machine-independent code | |
| 609. | Where is metadata stored in MySQL? |
| A. | in the mysql database metadata |
| B. | in the mysql database metasql |
| C. | in the mysql database mysql |
| D. | none of the mentioned |
| Answer» C. in the mysql database mysql | |
| 610. | Which of the following is true for Seeheim model? |
| A. | presentation is abstracted from dialogue and application |
| B. | presentation and dialogue is abstracted from application |
| C. | presentation and application is abstracted from dialogue |
| D. | none of the mentioned |
| Answer» A. presentation is abstracted from dialogue and application | |
| 611. | Which of the unit operation is used in Model view controller? |
| A. | is a decomposition |
| B. | part whole decomposition |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. part whole decomposition | |
| 612. | Memory address refers to the successive memory words and the machine is called as |
| A. | word addressable |
| B. | byte addressable |
| C. | bit addressable |
| D. | terra byte addressable |
| Answer» A. word addressable | |
| 613. | The layer, which provides a high-level view of data and actions on data. |
| A. | business logic |
| B. | presentation |
| C. | user interaction |
| D. | data access |
| Answer» A. business logic | |
| 614. | The layer, which provides the interface between the business-logic layer and the underlying database. |
| A. | business logic |
| B. | presentation |
| C. | user interaction |
| D. | data access |
| Answer» D. data access | |
| 615. | The system is widely used for mapping from Java objects to relations. |
| A. | hibernate |
| B. | object oriented |
| C. | objective |
| D. | none of the mentioned |
| Answer» A. hibernate | |
| 616. | Which among the following are the functions that any system with a user interface must provide? |
| A. | presentation |
| B. | dialogue |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» A. presentation | |
| 617. | Which of the following is the main task accomplished by the user? |
| A. | compose a document |
| B. | create a spread sheet |
| C. | send mail |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 618. | What are the portability concerns founded in Seeheim model? |
| A. | replacing the presentation toolkit |
| B. | replacing the application toolkit |
| C. | replacing the dialogue toolkit |
| D. | replacing the presentation & application toolkit |
| Answer» D. replacing the presentation & application toolkit | |
| 619. | Which schema object instructs Oracle to connect to a remotely access an object of a database? |
| A. | sequence |
| B. | remote link |
| C. | database link |
| D. | data link |
| Answer» D. data link | |
| 620. | DML changes are |
| A. | insert |
| B. | update |
| C. | create |
| D. | both insert and update |
| Answer» D. both insert and update | |
| 621. | Which of the following object types below cannot be replicated? |
| A. | data |
| B. | trigger |
| C. | view |
| D. | sequence |
| Answer» D. sequence | |
| 622. | How to force a log switch? |
| A. | by using alter system log |
| B. | by using alter system switch logfile |
| C. | by using alter system switch logs |
| D. | by using alter sys logfiles |
| Answer» B. by using alter system switch logfile | |
| 623. | The ORDER BY clause can only be used in |
| A. | select queries |
| B. | insert queries |
| C. | group by queries |
| D. | having queries |
| Answer» A. select queries | |
| 624. | Which of the following rule below are categories of an index? |
| A. | column and functional |
| B. | multiple column and functional |
| C. | column, multiple column and functional |
| D. | none of the mentioned |
| Answer» A. column and functional | |
| 626. | Which of the following queries displays the sum of all employee salaries for those employees not making commission, for each job, including only those sums greater than 2500? |
| A. | select job, sum(sal) from emp where sum(sal) > 2500 and comm is null; |
| B. | select job, sum(sal) from emp where comm is null group by job having sum(sal) > 2500; |
| C. | select job, sum(sal) from emp where sum(sal) > 2500 and comm is null group by job; |
| D. | select job, sum(sal) from emp group by job having sum(sal) > 2500 and comm is not null; |
| Answer» B. select job, sum(sal) from emp where comm is null group by job having sum(sal) > 2500; | |
| 627. | Which of the following data structure is not linear data structure? |
| A. | arrays |
| B. | linked lists |
| C. | arrays & linked lists |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 628. | Which of the following data structure is linear data structure? |
| A. | trees |
| B. | graphs |
| C. | arrays |
| D. | none of the mentioned |
| Answer» C. arrays | |
| 629. | The operation of processing each element in the list is known as |
| A. | sorting |
| B. | merging |
| C. | inserting |
| D. | traversal |
| Answer» D. traversal | |
| 630. | Finding the location of the element with a given value is: |
| A. | traversal |
| B. | search |
| C. | sort |
| D. | none of the mentioned |
| Answer» B. search | |
| 631. | Arrays are best data structures |
| A. | for relatively permanent collections of data |
| B. | for the size of the structure and the data in the structure are constantly changing |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» A. for relatively permanent collections of data | |
| 632. | Linked lists are best suited |
| A. | for relatively permanent collections of data |
| B. | for the size of the structure and the data in the structure are constantly changing |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. for the size of the structure and the data in the structure are constantly changing | |
| 633. | Each array declaration need not give, implicitly or explicitly, the information about |
| A. | the name of array |
| B. | the data type of array |
| C. | the first data from the set to be stored |
| D. | the index set of the array |
| Answer» C. the first data from the set to be stored | |
| 634. | In attacks, the attacker manages to get an application to execute an SQL query created by the attacker. |
| A. | sql injection |
| B. | sql |
| C. | direct |
| D. | application |
| Answer» A. sql injection | |
| 635. | A Web site that allows users to enter text, such as a comment or a name, and then stores it and later display it to other users, is potentially vulnerable to a kind of attack called a attack. |
| A. | two-factor authentication |
| B. | cross-site request forgery |
| C. | cross-site scripting |
| D. | cross-site scoring scripting |
| Answer» C. cross-site scripting | |
| 636. | is an attack which forces an end user to execute unwanted actions on a web application in which he/she is currently authenticated. |
| A. | two-factor authentication |
| B. | cross-site request forgery |
| C. | cross-site scripting |
| D. | cross-site scoring scripting |
| Answer» B. cross-site request forgery | |
| 637. | A single further allows the user to be authenticated once, and multiple applications can then verify the user’s identity through an authentication service without requiring reauthentication. |
| A. | openid |
| B. | sign-on system |
| C. | security assertion markup language (saml) |
| D. | virtual private database (vpd) |
| Answer» B. sign-on system | |
| 638. | The is a standard for exchanging authentication and authorization information between different security domains, to provide cross- organization single sign-on. |
| A. | openid |
| B. | sign-on system |
| C. | security assertion markup language (saml) |
| D. | virtual private database (vpd) |
| Answer» C. security assertion markup language (saml) | |
| 639. | allows a system administrator to associate a function with a relation; the function returns a predicate that must be added to any query that uses the relation. |
| A. | openid |
| B. | single-site system |
| C. | security assertion markup language (saml) |
| D. | virtual private database (vpd) |
| Answer» D. virtual private database (vpd) | |
| 640. | VPD provides authorization at the level of specific tuples, or rows, of a relation, and is therefore said to be a mechanism. |
| A. | row-level authorization |
| B. | column-level authentication |
| C. | row-type authentication |
| D. | authorization security |
| Answer» A. row-level authorization | |
| 641. | is widely used today for protecting data in transit in a variety of applications such as data transfer on the Internet, and on cellular phone networks. |
| A. | encryption |
| B. | data mining |
| C. | internet security |
| D. | architectural security |
| Answer» A. encryption | |
| 642. | In a database where the encryption is applied the data is cannot be handled by the unauthorised user without |
| A. | encryption key |
| B. | decryption key |
| C. | primary key |
| D. | authorised key |
| Answer» B. decryption key | |
| 643. | Which of the following is not a property of good encryption technique? |
| A. | relatively simple for authorized users to encrypt and decrypt data |
| B. | decryption key is extremely difficult for an intruder to determine |
| C. | encryption depends on a parameter of the algorithm called the encryption key |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 644. | In which of the following encryption key is used to encrypt and decrypt the data? |
| A. | public key |
| B. | private key |
| C. | symmetric key |
| D. | asymmetric key |
| Answer» C. symmetric key | |
| 645. | Encryption of small values, such as identifiers or names, is made complicated by the possibility of |
| A. | dictionary attacks |
| B. | database attacks |
| C. | minor attacks |
| D. | random attacks |
| Answer» A. dictionary attacks | |
| 646. | Which one of the following uses a 128bit round key to encrypt the data using XOR and use it in reverse to decrypt it? |
| A. | round key algorithm |
| B. | public key algorithm |
| C. | advanced encryption standard |
| D. | asymmetric key algorithm |
| Answer» C. advanced encryption standard | |
| 647. | Which of the following requires no password travel across the internet? |
| A. | readable system |
| B. | manipulation system |
| C. | challenge–response system |
| D. | response system |
| Answer» C. challenge–response system | |
| 648. | The is the fastest and most costly form of storage, which is relatively small; its use is managed by the computer system hardware. |
| A. | cache |
| B. | disk |
| C. | main memory |
| D. | flash memory |
| Answer» A. cache | |
| 649. | Which of the following stores several gigabytes of data but usually lost when power failure? |
| A. | flash memory |
| B. | disk |
| C. | main memory |
| D. | secondary memory |
| Answer» C. main memory | |
| 651. | is increasingly being used in server systems to improve performance by caching frequently used data, since it provides faster access than disk, with larger storage capacity than main memory. |
| A. | flash memory |
| B. | disk |
| C. | main memory |
| D. | secondary memory |
| Answer» A. flash memory | |
| 652. | The primary medium for the long-term online storage of data is the where the entire database is stored on magnetic disk. |
| A. | semiconductor memory |
| B. | magnetic disks |
| C. | compact disks |
| D. | magnetic tapes |
| Answer» B. magnetic disks | |
| 653. | Optical disk systems contain a few drives and numerous disks that can be loaded into one of the drives automatically (by a robot arm) on demand. |
| A. | tape storage |
| B. | jukebox |
| C. | flash memory |
| D. | all of the mentioned |
| Answer» B. jukebox | |
| 654. | There are “record-once” versions of the compact disk and digital video disk, which can be written only once; such disks are also called disks. |
| A. | write-once, read-many (worm) |
| B. | cd-r |
| C. | dvd-w |
| D. | cd-rom |
| Answer» A. write-once, read-many (worm) | |
| 655. | In magnetic disk stores information on a sector magnetically as reversals of the direction of magnetization of the magnetic material. |
| A. | read–write head |
| B. | read-assemble head |
| C. | head–disk assemblies |
| D. | disk arm |
| Answer» D. disk arm | |
| 656. | A is the smallest unit of information that can be read from or written to the disk. |
| A. | track |
| B. | spindle |
| C. | sector |
| D. | platter |
| Answer» C. sector | |
| 657. | The disk controller uses at each sector to ensure that the data is not corrupted on data retrieval. |
| A. | checksum |
| B. | unit drive |
| C. | read disk |
| D. | readsum |
| Answer» A. checksum | |
| 658. | is the time from when a read or write request is issued to when data transfer begins. |
| A. | access time |
| B. | average seek time |
| C. | seek time |
| D. | rotational latency time |
| Answer» A. access time | |
| 659. | The time for repositioning the arm is called the and it increases with the distance that the arm must move. |
| A. | access time |
| B. | average seek time |
| C. | seek time |
| D. | rotational latency time |
| Answer» C. seek time | |
| 660. | is around one-half of the maximum seek time. |
| A. | access time |
| B. | average seek time |
| C. | seek time |
| D. | rotational latency time |
| Answer» B. average seek time | |
| 661. | Hybrid disk drives are hard-disk systems that combine magnetic storage with a smaller amount of flash memory, which is used as a cache for frequently accessed data. |
| A. | hybrid drivers |
| B. | disk drivers |
| C. | hybrid disk drivers |
| D. | all of the mentioned |
| Answer» B. disk drivers | |
| 662. | Optical disk technology uses |
| A. | helical scanning |
| B. | dat |
| C. | a laser beam |
| D. | raid |
| Answer» D. raid | |
| 663. | With multiple disks, we can improve the transfer rate as well by data across multiple disks. |
| A. | striping |
| B. | dividing |
| C. | mirroring |
| D. | dividing |
| Answer» A. striping | |
| 664. | partitions data and parity among all N+1 disks, instead of storing data in N-disks and parity in one disk. |
| A. | block interleaved parity |
| B. | block interleaved distributed parity |
| C. | bit parity |
| D. | bit interleaved parity |
| Answer» B. block interleaved distributed parity | |
| 665. | The RAID level which mirroring is done along with stripping is |
| A. | raid 1+0 |
| B. | raid 0 |
| C. | raid 2 |
| D. | both raid 1+0 and raid 0 |
| Answer» D. both raid 1+0 and raid 0 | |
| 666. | Where performance and reliability are both important, RAID level is used. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 0+1 |
| Answer» D. 0+1 | |
| 667. | is popular for applications such as storage of log files in a database system since it offers the best write performance. |
| A. | raid level 1 |
| B. | raid level 2 |
| C. | raid level 0 |
| D. | raid level 3 |
| Answer» A. raid level 1 | |
| 668. | which increases the number of I/O operations needed to write a single logical block, pays a significant time penalty in terms of write performance. |
| A. | raid level 1 |
| B. | raid level 2 |
| C. | raid level 5 |
| D. | raid level 3 |
| Answer» A. raid level 1 | |
| 669. | Tertiary storage is built with : |
| A. | a lot of money |
| B. | unremovable media |
| C. | removable media |
| D. | secondary storage |
| Answer» C. removable media | |
| 670. | Operating system is responsible for |
| A. | disk initialization |
| B. | booting from disk |
| C. | bad-bock recovery |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 671. | A typical tape drive is a typical disk drive. |
| A. | more expensive than |
| B. | cheaper than |
| C. | of the same cost as |
| D. | none of the mentioned |
| Answer» A. more expensive than | |
| 672. | During recovery from a failure |
| A. | each pair of physical block is examined |
| B. | specified pair of physical block is examined |
| C. | first pair of physical block is examined |
| D. | none of the mentioned |
| Answer» A. each pair of physical block is examined | |
| 673. | A magneto-optic disk is : |
| A. | primary storage |
| B. | secondary storage |
| C. | tertiary storage |
| D. | none of the mentioned |
| Answer» C. tertiary storage | |
| 674. | Which of the following are the process of selecting the data storage and data access characteristics of the database? |
| A. | logical database design |
| B. | physical database design |
| C. | testing and performance tuning |
| D. | evaluation and selecting |
| Answer» B. physical database design | |
| 676. | Which of the following is the oldest database model? |
| A. | relational |
| B. | hierarchical |
| C. | physical |
| D. | network |
| Answer» D. network | |
| 677. | The surface area of a tape is the surface area of a disk. |
| A. | much lesser than |
| B. | much larger than |
| C. | equal to |
| D. | none of the mentioned |
| Answer» B. much larger than | |
| 678. | Which one of the following is not a secondary storage? |
| A. | magnetic disks |
| B. | magnetic tapes |
| C. | ram |
| D. | none of the mentioned |
| Answer» C. ram | |
| 679. | Which level of RAID refers to disk mirroring with block striping? |
| A. | raid level 1 |
| B. | raid level 2 |
| C. | raid level 0 |
| D. | raid level 3 |
| Answer» A. raid level 1 | |
| 680. | A unit of storage that can store one or more records in a hash file organization is denoted as |
| A. | buckets |
| B. | disk pages |
| C. | blocks |
| D. | nodes |
| Answer» A. buckets | |
| 681. | The file organization which allows us to read records that would satisfy the join condition by using one block read is |
| A. | heap file organization |
| B. | sequential file organization |
| C. | clustering file organization |
| D. | hash file organization |
| Answer» C. clustering file organization | |
| 682. | What are the correct features of a distributed database? |
| A. | is always connected to the internet |
| B. | always requires more than three machines |
| C. | users see the data in one global schema. |
| D. | have to specify the physical location of the data when an update is done |
| Answer» C. users see the data in one global schema. | |
| 683. | Each tablespace in an Oracle database consists of one or more files called |
| A. | files |
| B. | name space |
| C. | datafiles |
| D. | pfile |
| Answer» C. datafiles | |
| 684. | The management information system (MIS) structure with one main computer system is called a |
| A. | hierarchical mis structure |
| B. | distributed mis structure |
| C. | centralized mis structure |
| D. | decentralized mis structure |
| Answer» C. centralized mis structure | |
| 685. | Choose the RDBMS which supports full fledged client server application development |
| A. | dbase v |
| B. | oracle 7.1 |
| C. | foxpro 2.1 |
| D. | ingress |
| Answer» B. oracle 7.1 | |
| 686. | One approach to standardization storing of data? |
| A. | mis |
| B. | structured programming |
| C. | codasyl specification |
| D. | none of the mentioned |
| Answer» C. codasyl specification | |
| 687. | The highest level in the hierarchy of data organization is called |
| A. | data bank |
| B. | data base |
| C. | data file |
| D. | data record |
| Answer» B. data base | |
| 688. | An audit trail |
| A. | is used to make backup copies |
| B. | is the recorded history of operations performed on a file |
| C. | can be used to restore lost information |
| D. | none of the mentioned |
| Answer» B. is the recorded history of operations performed on a file | |
| 689. | Large collection of files are called |
| A. | fields |
| B. | records |
| C. | database |
| D. | sectors |
| Answer» C. database | |
| 690. | Which of the following is not true of the traditional approach to information processing |
| A. | there is common sharing of data among the various applications |
| B. | it is file oriented |
| C. | programs are dependent on the file |
| D. | it is inflexible |
| Answer» A. there is common sharing of data among the various applications | |
| 691. | Which of these is not a feature of Hierarchical model? |
| A. | organizes the data in tree-like structure |
| B. | parent node can have any number of child nodes |
| C. | root node does not have any parent |
| D. | child node can have any number of parent nodes |
| Answer» D. child node can have any number of parent nodes | |
| 692. | Which of these data models is an extension of the relational data model? |
| A. | object-oriented data model |
| B. | object-relational data model |
| C. | semi structured data model |
| D. | none of the mentioned |
| Answer» B. object-relational data model | |
| 693. | The information about data in a database is called |
| A. | metadata |
| B. | hyper data |
| C. | tera data |
| D. | none of the mentioned |
| Answer» A. metadata | |
| 694. | A data dictionary is a special file that contains? |
| A. | the names of all fields in all files |
| B. | the data types of all fields in all files |
| C. | the widths of all fields in all files |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 695. | The DBMS acts as an interface between what two components of an enterprise-class database system? |
| A. | database application and the database |
| B. | data and the database |
| C. | the user and the database application |
| D. | database application and sql |
| Answer» A. database application and the database | |
| 696. | A relational database system needs to maintain data about the relations, such as the schema of the relations. This is called |
| A. | metadata |
| B. | catalog |
| C. | log |
| D. | dictionary |
| Answer» A. metadata | |
| 697. | Relational schemas and other metadata about relations are stored in a structure called the |
| A. | metadata |
| B. | catalog |
| C. | log |
| D. | data dictionary |
| Answer» D. data dictionary | |
| 698. | is the collection of memory structures and Oracle background processes that operates against an Oracle database. |
| A. | database |
| B. | instance |
| C. | tablespace |
| D. | segment |
| Answer» B. instance | |
| 699. | A is a logical grouping of database objects, usually to facilitate security, performance, or the availability of database objects such as tables and indexes. |
| A. | tablespace |
| B. | segments |
| C. | extents |
| D. | blocks |
| Answer» A. tablespace | |
| 701. | is a contiguous group of |
| A. | instance |
| B. | segment |
| C. | database |
| D. | dictionary |
| Answer» C. database | |
| 702. | is the smallest unit of allocation in an Oracle database. |
| A. | database |
| B. | instance |
| C. | tablespace |
| D. | database block |
| Answer» D. database block | |
| 703. | An Oracle is a set of tables and views that are used as a read-only reference about the database. |
| A. | database dictionary |
| B. | dictionary table |
| C. | data dictionary |
| D. | dictionary |
| Answer» C. data dictionary | |
| 704. | The is that part of main memory available for storage of copies of disk blocks. |
| A. | buffer |
| B. | catalog |
| C. | storage |
| D. | secondary storage |
| Answer» A. buffer | |
| 705. | A major goal of the database system is to minimize the number of block transfers between the disk and memory. This is achieved by |
| A. | buffer |
| B. | catalog |
| C. | storage |
| D. | secondary storage |
| Answer» A. buffer | |
| 706. | The subsystem responsible for the allocation of buffer space is called the |
| A. | buffer |
| B. | buffer manager |
| C. | storage |
| D. | secondary storage |
| Answer» B. buffer manager | |
| 707. | In the buffer where there is no space for another block, the block can be inserted using |
| A. | pinned block strategy |
| B. | forced output block |
| C. | buffer replacement strategy |
| D. | all of the mentioned |
| Answer» C. buffer replacement strategy | |
| 708. | A block that is not allowed to be written back to disk is said to be |
| A. | pinned |
| B. | forced |
| C. | buffer |
| D. | all of the mentioned |
| Answer» A. pinned | |
| 709. | In case the buffer manager do not write the blocks properly then the buffer manager uses |
| A. | replacement strategy |
| B. | forced strategy |
| C. | crash recovery system |
| D. | both replacement and forced strategy |
| Answer» C. crash recovery system | |
| 710. | The technique where the blocks which have been used are replaced is called |
| A. | replacement strategy |
| B. | forced strategy |
| C. | crash recovery system |
| D. | most recently used |
| Answer» D. most recently used | |
| 711. | frees the space occupied by a block as soon as the final tuple of that block has been processed. |
| A. | replacement strategy |
| B. | forced strategy |
| C. | toss immediate strategy |
| D. | most recently used |
| Answer» C. toss immediate strategy | |
| 712. | Indices whose search key specifies an order different from the sequential order of the file are called indices. |
| A. | nonclustered |
| B. | secondary |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 713. | An consists of a search-key value and pointers to one or more records with that value as their search-key value. |
| A. | index entry |
| B. | index hash |
| C. | index cluster |
| D. | index map |
| Answer» A. index entry | |
| 714. | 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. |
| A. | dense |
| B. | sparse |
| C. | straight |
| D. | continuous |
| Answer» A. dense | |
| 715. | In a index, an index entry appears for only some of the search-key values. |
| A. | dense |
| B. | sparse |
| C. | straight |
| D. | continuous |
| Answer» A. dense | |
| 716. | A search key containing more than one attribute is referred to as a search key. |
| A. | simple |
| B. | composite |
| C. | compound |
| D. | secondary |
| Answer» B. composite | |
| 717. | In B+ tree the node which points to another node is called |
| A. | leaf node |
| B. | external node |
| C. | final node |
| D. | internal node |
| Answer» D. internal node | |
| 718. | 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 : |
| A. | less than 1 |
| B. | less than n |
| C. | less than m |
| D. | less than n/2 |
| Answer» A. less than 1 | |
| 719. | A technique for direct search is |
| A. | binary search |
| B. | linear search |
| C. | tree search |
| D. | hashing |
| Answer» D. hashing | |
| 720. | 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. |
| A. | 8, _, _, _, _, _, 10 |
| B. | 1, 8, 10, _, _, _, 3 |
| C. | 1, _, _, _, _, _,3 |
| D. | 1, 10, 8, _, _, _, 3 |
| Answer» B. 1, 8, 10, _, _, _, 3 | |
| 721. | Key value pairs is usually seen in |
| A. | hash tables |
| B. | heaps |
| C. | both hash tables and heaps |
| D. | skip list |
| Answer» A. hash tables | |
| 722. | What is the best definition of a collision in a hash table? |
| A. | two entries are identical except for their keys |
| B. | two entries with different data have the exact same key |
| C. | two entries with different keys have the same exact hash value |
| D. | two entries with the exact same key have different hash values |
| Answer» A. two entries are identical except for their keys | |
| 723. | Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table? |
| A. | all keys hash to same index |
| B. | all keys hash to different indices |
| C. | all keys hash to an even-numbered index |
| D. | all keys hash to different even-numbered indices |
| Answer» A. all keys hash to same index | |
| 724. | Breadth First Search is used in |
| A. | binary trees |
| B. | stacks |
| C. | graphs |
| D. | all of the mentioned |
| Answer» C. graphs | |
| 726. | The property (or set of properties) that uniquely defines each row in a table is called the: |
| A. | identifier |
| B. | index |
| C. | primary key |
| D. | symmetric key |
| Answer» C. primary key | |
| 727. | The separation of the data definition from the program is known as: |
| A. | data dictionary |
| B. | data independence |
| C. | data integrity |
| D. | referential integrity |
| Answer» B. data independence | |
| 728. | In the client / server model, the database: |
| A. | is downloaded to the client upon request |
| B. | is shared by both the client and server |
| C. | resides on the client side |
| D. | resides on the server side |
| Answer» D. resides on the server side | |
| 729. | The database design that consists of multiple tables that are linked together through matching data stored in each table is called |
| A. | hierarchical database |
| B. | network database |
| C. | object oriented database |
| D. | relational database |
| Answer» D. relational database | |
| 730. | The association role defines: |
| A. | how tables are related in the database |
| B. | the relationship between the class diagram and the tables in the database |
| C. | the tables that each attribute is contained |
| D. | which attribute is the table’s primary key |
| Answer» A. how tables are related in the database | |
| 731. | A on the attribute A of relation r consists of one bitmap for each value that A can take. |
| A. | bitmap index |
| B. | bitmap |
| C. | index |
| D. | array |
| Answer» A. bitmap index | |
| 732. | To identify the deleted records we use the |
| A. | existence bitmap |
| B. | current bitmap |
| C. | final bitmap |
| D. | deleted bitmap |
| Answer» A. existence bitmap | |
| 733. | 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. |
| A. | bitmap, b-tree |
| B. | bitmap, b+tree |
| C. | b-tree, bitmap |
| D. | b+tree, bitmap |
| Answer» B. bitmap, b+tree | |
| 734. | What is the purpose of the index in sql server? |
| A. | to enhance the query performance |
| B. | to provide an index to a record |
| C. | to perform fast searches |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 735. | How many types of indexes are there in sql server? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 736. | How non clustered index point to the data? |
| A. | it never points to anything |
| B. | it points to a data row |
| C. | it is used for pointing data rows containing key values |
| D. | none of the mentioned |
| Answer» C. it is used for pointing data rows containing key values | |
| 737. | Which one is true about clustered index? |
| A. | clustered index is not associated with table |
| B. | clustered index is built by default on unique key columns |
| C. | clustered index is not built on unique key columns |
| D. | none of the mentioned |
| Answer» B. clustered index is built by default on unique key columns | |
| 738. | What is true about indexes? |
| A. | indexes enhance the performance even if the table is updated frequently |
| B. | it makes harder for sql server engines to work to work on index which have large keys |
| C. | it doesn’t make harder for sql server engines to work to work on index which have large keys |
| D. | none of the mentioned |
| Answer» B. it makes harder for sql server engines to work to work on index which have large keys | |
| 739. | Does index take space in the disk? |
| A. | it stores memory as and when required |
| B. | yes, indexes are stored on disk |
| C. | indexes are never stored on disk |
| D. | indexes take no space |
| Answer» B. yes, indexes are stored on disk | |
| 740. | If an index is the metadata and statistics continue to exists |
| A. | disabling |
| B. | dropping |
| C. | altering |
| D. | both disabling and dropping |
| Answer» A. disabling | |
| 741. | In index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index. |
| A. | clustered |
| B. | column store |
| C. | non clustered |
| D. | row store |
| Answer» B. column store | |
| 742. | A index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index. |
| A. | clustered |
| B. | non clustered |
| C. | covering |
| D. | b-tree |
| Answer» C. covering | |
| 743. | Which of the following schemas does define a view or views of the database for particular users? |
| A. | internal schema |
| B. | conceptual schema |
| C. | physical schema |
| D. | external schema |
| Answer» D. external schema | |
| 744. | Which of the following is an attribute that can uniquely identify a row in a table? |
| A. | secondary key |
| B. | candidate key |
| C. | foreign key |
| D. | alternate key |
| Answer» B. candidate key | |
| 745. | Which of the following terms does refer to the correctness and completeness of the data in a database? |
| A. | data security |
| B. | data constraint |
| C. | data independence |
| D. | data integrity |
| Answer» D. data integrity | |
| 746. | The relationship between DEPARTMENT and EMPLOYEE is a |
| A. | one-to-one relationship |
| B. | one-to-many relationship |
| C. | many-to-many relationship |
| D. | many-to-one relationship |
| Answer» B. one-to-many relationship | |
| 747. | 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 |
| A. | consistent state |
| B. | parallel state |
| C. | durable state |
| D. | inconsistent state |
| Answer» D. inconsistent state | |
| 748. | Ensuring isolation property is the responsibility of the |
| A. | recovery-management component of the dbms |
| B. | concurrency-control component of the dbms |
| C. | transaction-management component of the dbms |
| D. | buffer management component in dbms |
| Answer» B. concurrency-control component of the dbms | |
| 749. | In query processing, the is the lowest-level operator to access data. |
| A. | index search |
| B. | linear search |
| C. | file scan |
| D. | access paths |
| Answer» C. file scan | |
| 751. | Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition. | |
| A. | a2 | |
| B. | a4 | |
| C. | a5 | |
| D. | a6 | |
| Answer» A. a2 | ||
| 752. | 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 |
| A. | a2 |
| B. | a4 |
| C. | a5 |
| D. | a6 |
| Answer» B. a4 | |
| 753. | The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is |
| A. | a2 |
| B. | a4 |
| C. | a5 |
| D. | a6 |
| Answer» D. a6 | |
| 754. | The algorithm scans each index for pointers to tuples that satisfy an individual condition. |
| A. | a2 |
| B. | a4 |
| C. | a9 |
| D. | a6 |
| Answer» C. a9 | |
| 755. | 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 |
| A. | a10 |
| B. | a7 |
| C. | a9 |
| D. | a6 |
| Answer» A. a10 | |
| 756. | The space factor when determining the efficiency of an algorithm is measured by |
| A. | counting the maximum memory needed by the algorithm |
| B. | counting the minimum memory needed by the algorithm |
| C. | counting the average memory needed by the algorithm |
| D. | counting the maximum disk space needed by the algorithm |
| Answer» A. counting the maximum memory needed by the algorithm | |
| 757. | Which of the following case does not exist in complexity theory |
| A. | best case |
| B. | worst case |
| C. | average case |
| D. | null case |
| Answer» D. null case | |
| 758. | The Average case occur in linear search algorithm |
| A. | when item is somewhere in the middle of the array |
| B. | when item is not in the array at all |
| C. | when item is the last element in the array |
| D. | when item is the last element in the array or is not there at all |
| Answer» A. when item is somewhere in the middle of the array | |
| 759. | The complexity of the average case of an algorithm is |
| A. | much more complicated to analyze than that of worst case |
| B. | much more simpler to analyze than that of worst case |
| C. | sometimes more complicated and some other times simpler than that of worst case |
| D. | none of the mentioned |
| Answer» A. much more complicated to analyze than that of worst case | |
| 760. | The complexity of a linear search algorithm is |
| A. | o(n) |
| B. | o(log n) |
| C. | o(n2) |
| D. | o(n log n) |
| Answer» A. o(n) | |
| 761. | The complexity of Bubble sort algorithm is |
| A. | o(n) |
| B. | o(log n) |
| C. | o(n2) |
| D. | o(n log n) |
| Answer» C. o(n2) | |
| 762. | A is a query that retrieves rows from more than one table or view: |
| A. | start |
| B. | end |
| C. | join |
| D. | all of the mentioned |
| Answer» C. join | |
| 763. | A condition is referred to as |
| A. | join in sql |
| B. | join condition |
| C. | join in sql & condition |
| D. | none of the mentioned |
| Answer» B. join condition | |
| 764. | Which oracle is the join condition is specified using the WHERE clause: |
| A. | oracle 9i |
| B. | oracle 8i |
| C. | pre-oracle 9i |
| D. | pre-oracle 8i |
| Answer» C. pre-oracle 9i | |
| 765. | Which is a join condition contains an equality operator: |
| A. | equijoins |
| B. | cartesian |
| C. | both equijoins and cartesian |
| D. | none of the mentioned |
| Answer» A. equijoins | |
| 766. | 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: |
| A. | left outer join |
| B. | right outer join |
| C. | full outer join |
| D. | half outer join |
| Answer» B. right outer join | |
| 767. | Which operation are allowed in a join view: |
| A. | update |
| B. | insert |
| C. | delete |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 768. | Which view that contains more than one table in the top-level FROM clause of the SELECT statement: |
| A. | join view |
| B. | datable join view |
| C. | updatable join view |
| D. | all of the mentioned |
| Answer» C. updatable join view | |
| 769. | The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called |
| A. | materialized evaluation |
| B. | expression evaluation |
| C. | tree evaluation |
| D. | tree materialization |
| Answer» A. materialized evaluation | |
| 770. | allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity. |
| A. | buffering |
| B. | double buffering |
| C. | multiple buffering |
| D. | double reading |
| Answer» A. buffering | |
| 771. | Pipelines can be executed in |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 5 |
| Answer» C. 2 | |
| 772. | In a the system makes repeated requests for tuples from the operation at the top of the pipeline. |
| A. | demand-driven pipeline |
| B. | producer-driven pipeline |
| C. | demand pipeline |
| D. | all of the mentioned |
| Answer» A. demand-driven pipeline | |
| 773. | In a operations do not wait for requests to produce tuples, but instead generate the tuples eagerly. |
| A. | demand-driven pipeline |
| B. | producer-driven pipeline |
| C. | demand pipeline |
| D. | all of the mentioned |
| Answer» B. producer-driven pipeline | |
| 774. | Each operation in a demand-driven pipeline can be implemented as an that provides the following functions: open(), next(), and close(). |
| A. | demand |
| B. | pipeline |
| C. | iterator |
| D. | all of the mentioned |
| Answer» C. iterator | |
| 776. | Tuples are generated in producer-driven pipelining, they are generated on demand, in demand- driven pipelining. |
| A. | lazily, eagerly |
| B. | eagerly, lazily |
| C. | slowly, eagerly |
| D. | eagerly, slowly |
| Answer» B. eagerly, lazily | |
| 777. | When two inputs that we desire to pipeline into the join are not already sorted it is the technique. |
| A. | hash join |
| B. | buffer join |
| C. | double-pipelined hash join |
| D. | double-pipelined join |
| Answer» D. double-pipelined join | |
| 778. | Which of the following is/are false for RAW mode of FOR XML? |
| A. | xmlschema option does not returns an in-line xsd schema |
| B. | binary base32 returns the binary data in base32-encoded format |
| C. | each row in the query result is transformed into an xml element |
| D. | none of the mentioned |
| Answer» B. binary base32 returns the binary data in base32-encoded format | |
| 779. | refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails. |
| A. | isolation |
| B. | atomicity |
| C. | consistency |
| D. | durability |
| Answer» D. durability | |
| 780. | 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? |
| A. | tinyint |
| B. | smallint |
| C. | int |
| D. | decimal(1) |
| Answer» B. smallint | |
| 781. | Problems occurs if we don’t implement a proper locking strategy |
| A. | dirty reads |
| B. | phantom reads |
| C. | lost updates |
| D. | unrepeatable reads |
| Answer» B. phantom reads | |
| 782. | Which of the following fixed database roles can add or remove user IDs? |
| A. | db_accessadmin |
| B. | db_securityadmin |
| C. | db_setupadmin |
| D. | db_sysadmin |
| Answer» A. db_accessadmin | |
| 783. | Which of the following pair of regular |
| A. | 1(01)* and (10)*1 |
| B. | x(xx)* and (xx)*x |
| C. | (ab)* and a*b* |
| D. | x+ and x*x+ |
| Answer» C. (ab)* and a*b* | |
| 784. | Which feature converts row data to a column for better analytical view? |
| A. | views |
| B. | join |
| C. | pivot |
| D. | trigger |
| Answer» C. pivot | |
| 785. | What is the default “SORT” order for a SQL? |
| A. | ascending |
| B. | descending |
| C. | as specified by the user |
| D. | none of the mentioned |
| Answer» A. ascending | |
| 786. | How inserting data through stored procedure do reduces network traffic and increase database performance? |
| A. | stored procedure can accept parameter |
| B. | permission check is not required |
| C. | the execution plan is stored in the cache after it was executed the first time |
| D. | none of the mentioned |
| Answer» C. the execution plan is stored in the cache after it was executed the first time | |
| 787. | Stored procedures are safe from SQL injection attacks |
| A. | true |
| B. | false |
| C. | depends on the result |
| D. | always safe |
| Answer» A. true | |
| 788. | Which of the following connection type supports application role permissions and password encryption? |
| A. | ole db |
| B. | dblib |
| C. | odbc |
| D. | ole db and odbc |
| Answer» D. ole db and odbc | |
| 789. | Cursor that reflects the changes made to the database table even after the result set is returned |
| A. | static |
| B. | dynamic |
| C. | forward_only |
| D. | keyset |
| Answer» B. dynamic | |
| 790. | 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 |
| A. | dependency preserving and lossless join |
| B. | lossless join but not dependency preserving |
| C. | dependency preserving but not lossless join |
| D. | not dependency preserving and not lossless join |
| Answer» D. not dependency preserving and not lossless join | |
| 791. | Which one of the following statements about normal forms is FALSE? |
| A. | bcnf is stricter than 3nf |
| B. | lossless, dependency-preserving decomposition into 3nf is always possible |
| C. | lossless, dependency-preserving decomposition into bcnf is always possible |
| D. | any relation with two attributes is in bcnf |
| Answer» C. lossless, dependency-preserving decomposition into bcnf is always possible | |
| 792. | Which of the following is TRUE? |
| A. | every relation in 2nf is also in bcnf |
| B. | a relation r is in 3nf if every non-prime attribute of r is fully functionally dependent on every key of r |
| C. | every relation in bcnf is also in 3nf |
| D. | no relation can be in both bcnf and 3nf |
| Answer» C. every relation in bcnf is also in 3nf | |
| 793. | 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 |
| A. | 1nf only |
| B. | 2nf and hence also in 1nf |
| C. | 3nf and hence also in 2nf and 1nf |
| D. | bcnf and hence also in 3nf, 2nf and 1nf |
| Answer» B. 2nf and hence also in 1nf | |
| 794. | is a procedural extension of Oracle – SQL that offers language constructs similar to those in imperative programming languages. |
| A. | sql |
| B. | pl/sql |
| C. | advanced sql |
| D. | pql |
| Answer» B. pl/sql | |
| 795. | combines the data manipulating power of SQL with the data processing power of Procedural languages. |
| A. | pl/sql |
| B. | sql |
| C. | advanced sql |
| D. | pql |
| Answer» A. pl/sql | |
| 796. | has made PL/SQL code run faster without requiring any additional work on the part of the programmer. |
| A. | sql server |
| B. | my sql |
| C. | oracle |
| D. | sql lite |
| Answer» C. oracle | |
| 797. | A line of PL/SQL text contains groups of characters known as |
| A. | lexical units |
| B. | literals |
| C. | textual units |
| D. | identifiers |
| Answer» A. lexical units | |
| 798. | We use name PL/SQL program objects and units. |
| A. | lexical units |
| B. | literals |
| C. | delimiters |
| D. | identifiers |
| Answer» D. identifiers | |
| 799. | A is an explicit numeric, character, string or Boolean value not represented by an identifier. |
| A. | comments |
| B. | literals |
| C. | delimiters |
| D. | identifiers |
| Answer» B. literals | |
| 801. | is a sequence of zero or more characters enclosed by single quotes. |
| A. | integers literal |
| B. | string literal |
| C. | string units |
| D. | string label |
| Answer» B. string literal | |
| 802. | In the management of the password for the account can be handled outside of oracle such as operating system. |
| A. | database authentication |
| B. | operating system authentication |
| C. | internal authentication |
| D. | external authentication |
| Answer» B. operating system authentication | |
| 803. | In of Oracle, the database administrator creates a user account in the database for each user who needs access. |
| A. | database authentication |
| B. | operating system authentication |
| C. | internal authentication |
| D. | external authentication |
| Answer» A. database authentication | |
| 804. | Consider money is transferred from (1)account-A to account-B and (2) account-B to account-A. Which of the following form a transaction? |
| A. | only 1 |
| B. | only 2 |
| C. | both 1 and 2 individually |
| D. | either 1 or 2 |
| Answer» C. both 1 and 2 individually | |
| 805. | A transaction is delimited by statements (or function calls) of the form |
| A. | begin transaction and end transaction |
| B. | start transaction and stop transaction |
| C. | get transaction and post transaction |
| D. | read transaction and write transaction |
| Answer» A. begin transaction and end transaction | |
| 806. | Identify the characteristics of transactions |
| A. | atomicity |
| B. | durability |
| C. | isolation |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 807. | Which of the following has “all-or-none” property? |
| A. | atomicity |
| B. | durability |
| C. | isolation |
| D. | all of the mentioned |
| Answer» A. atomicity | |
| 808. | The property of a transaction that persists all the crashes is |
| A. | atomicity |
| B. | durability |
| C. | isolation |
| D. | all of the mentioned |
| Answer» B. durability | |
| 809. | states that only valid data will be written to the database. |
| A. | consistency |
| B. | atomicity |
| C. | durability |
| D. | isolation |
| Answer» A. consistency | |
| 810. | Transaction processing is associated with everything below except |
| A. | producing detail summary or exception reports |
| B. | recording a business activity |
| C. | confirming an action or triggering a response |
| D. | maintaining a data |
| Answer» C. confirming an action or triggering a response | |
| 811. | The Oracle RDBMS uses the statement to declare a new transaction start and its properties. |
| A. | begin |
| B. | set transaction |
| C. | begin transaction |
| D. | commit |
| Answer» B. set transaction | |
| 812. | means that the data used during the execution of a transaction cannot be used by a second transaction until the first one is completed. |
| A. | consistency |
| B. | atomicity |
| C. | durability |
| D. | isolation |
| Answer» D. isolation | |
| 813. | In SQL, which command is used to issue multiple CREATE TABLE, CREATE VIEW and GRANT statements in a single transaction? |
| A. | create package |
| B. | create schema |
| C. | create cluster |
| D. | all of the mentioned |
| Answer» B. create schema | |
| 814. | In SQL, the CREATE TABLESPACE is used |
| A. | to create a place in the database for storage of scheme objects, rollback segments, and naming the data files to comprise the tablespace |
| B. | to create a database trigger |
| C. | to add/rename data files, to change storage |
| D. | all of the mentioned |
| Answer» A. to create a place in the database for storage of scheme objects, rollback segments, and naming the data files to comprise the tablespace | |
| 815. | Which character function can be used to return a specified portion of a character string? |
| A. | instr |
| B. | substring |
| C. | substr |
| D. | pos |
| Answer» C. substr | |
| 816. | Which of the following is TRUE for the System Variable $date$? |
| A. | can be assigned to a global variable |
| B. | can be assigned to any field only during design time |
| C. | can be assigned to any variable or field during run time |
| D. | can be assigned to a local variable |
| Answer» B. can be assigned to any field only during design time | |
| 817. | What are the different events in Triggers? |
| A. | define, create |
| B. | drop, comment |
| C. | insert, update, delete |
| D. | select, commit |
| Answer» C. insert, update, delete | |
| 818. | Which is the subset of SQL commands used to manipulate Oracle Database Structures, including tables? |
| A. | data definition language |
| B. | data manipulation language |
| C. | data described language |
| D. | data retrieval language |
| Answer» A. data definition language | |
| 819. | The SQL statement SELECT SUBSTR(‘123456789’, INSTR(‘abcabcabc’,’b’), |
| A. | 6789 |
| B. | 2345 |
| C. | 1234 |
| D. | 456789 |
| Answer» B. 2345 | |
| 820. | Which of the following SQL command can be used to modify existing data in a database table? |
| A. | modify |
| B. | update |
| C. | change |
| D. | new |
| Answer» B. update | |
| 821. | provides option for entering SQL queries as execution time, rather than at the development stage. |
| A. | pl/sql |
| B. | sql*plus |
| C. | sql |
| D. | dynamic sql |
| Answer» D. dynamic sql | |
| 822. | The storage structure which do not survive system crashes are |
| A. | volatile storage |
| B. | non-volatile storage |
| C. | stable storage |
| D. | dynamic storage |
| Answer» A. volatile storage | |
| 823. | For a transaction to be durable, its changes need to be written to storage. |
| A. | volatile storage |
| B. | non-volatile storage |
| C. | stable storage |
| D. | dynamic storage |
| Answer» C. stable storage | |
| 824. | The unit of storage that can store one are more records in a hash file organization are |
| A. | buckets |
| B. | disk pages |
| C. | blocks |
| D. | nodes |
| Answer» A. buckets | |
| 826. | A file produced by a spreadsheet | |
| A. | is generally stored on disk in an ascii text format | |
| B. | can be used as is by the dbms | |
| C. | all of the mentioned | |
| D. | none of the mentioned | |
| Answer» A. is generally stored on disk in an ascii text format | ||
| 827. | SDL means |
| A. | storage discrete language |
| B. | storage definition language |
| C. | storage definition localisation |
| D. | storage discrete localisation |
| Answer» B. storage definition language | |
| 828. | The process of saving information onto secondary storage devices is referred to as |
| A. | backing up |
| B. | restoring |
| C. | writing |
| D. | reading |
| Answer» C. writing | |
| 829. | If an transaction is performed in a database and committed, the changes are taken to the previous state of transaction by |
| A. | flashback |
| B. | rollback |
| C. | both flashback and rollback |
| D. | cannot be done |
| Answer» D. cannot be done | |
| 830. | Each modification done in database transaction are first recorded into the |
| A. | harddrive |
| B. | log |
| C. | disk |
| D. | datamart |
| Answer» B. log | |
| 831. | When the transaction finishes the final statement the transaction enters into |
| A. | active state |
| B. | committed state |
| C. | partially committed state |
| D. | abort state |
| Answer» C. partially committed state | |
| 832. | The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called |
| A. | batch. exe |
| B. | trans. exe |
| C. | opt. exe |
| D. | edit.exe |
| Answer» C. opt. exe | |
| 833. | Which of the following is an atomic sequence of database actions? |
| A. | transaction |
| B. | concurrency |
| C. | relations |
| D. | all of the mentioned |
| Answer» A. transaction | |
| 834. | 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 |
| A. | consistent state |
| B. | parallel state |
| C. | atomic state |
| D. | inconsistent state |
| Answer» D. inconsistent state | |
| 835. | means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed. |
| A. | serializability |
| B. | atomicity |
| C. | isolation |
| D. | time stamping |
| Answer» C. isolation | |
| 836. | Which of the following is not a state in transaction? |
| A. | active |
| B. | terminated |
| C. | aborted |
| D. | partially committed |
| Answer» B. terminated | |
| 837. | joins are SQL server default |
| A. | outer |
| B. | inner |
| C. | equi |
| D. | none of the mentioned |
| Answer» B. inner | |
| 838. | The is essentially used to search for patterns in target string. |
| A. | like predicate |
| B. | null predicate |
| C. | in predicate |
| D. | out predicate |
| Answer» A. like predicate | |
| 839. | is a combination of two of more attributes used as a primary key |
| A. | composite key |
| B. | alternate key |
| C. | candidate key |
| D. | foreign key |
| Answer» A. composite key | |
| 840. | Which of the following is not the function of client? |
| A. | compile queries |
| B. | query optimization |
| C. | receive queries |
| D. | result formatting and presentation |
| Answer» B. query optimization | |
| 841. | is a special type of stored procedure that is automatically invoked whenever the data in the table is modified. |
| A. | procedure |
| B. | trigger |
| C. | curser |
| D. | none of the mentioned |
| Answer» B. trigger | |
| 842. | requires that data should be made available to only authorized users. |
| A. | data integrity |
| B. | privacy |
| C. | security |
| D. | none of the mentioned |
| Answer» C. security | |
| 843. | allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. |
| A. | procedure |
| B. | trigger |
| C. | curser |
| D. | none of the mentioned |
| Answer» C. curser | |
| 844. | Which s essential a business problem not a data problem: |
| A. | data |
| B. | database |
| C. | database design |
| D. | all of the mentioned |
| Answer» C. database design | |
| 845. | McFadden has defined normalization in his which book |
| A. | database modern management |
| B. | management database of modern |
| C. | modern database management |
| D. | database management |
| Answer» C. modern database management | |
| 846. | The database design prevents some data from being represented due to |
| A. | deletion anomalies |
| B. | insertion anomalies |
| C. | update anomaly |
| D. | none of the mentioned |
| Answer» B. insertion anomalies | |
| 847. | How many types of insertion anomalies: |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 848. | Who developed the normalization process: |
| A. | e.f. codd |
| B. | f.f. codd |
| C. | e.e. codd |
| D. | none of the mentioned |
| Answer» A. e.f. codd | |
| 849. | E.F.Codd developed the normalization process in the which early: |
| A. | 1969 |
| B. | 1970 |
| C. | 1971 |
| D. | 1972 |
| Answer» B. 1970 | |
| 851. | Which is refers to a stalemate situation due to which no further progress is possible as computer await response of each other: |
| A. | concurrency |
| B. | deadlock |
| C. | backup |
| D. | recovery |
| Answer» B. deadlock | |
| 852. | Which is a duplicate copy of a file program that is stored on a different storage media than the original location: |
| A. | concurrency |
| B. | deadlock |
| C. | backup |
| D. | recovery |
| Answer» C. backup | |
| 853. | Which is the duplication of computer operations and routine backups to combat any unforeseen problems: |
| A. | concurrency |
| B. | deadlock |
| C. | backup |
| D. | recovery |
| Answer» D. recovery | |
| 854. | Optimization basically related to the Rewrite module is termed as |
| A. | semantic query optimization |
| B. | global query optimization |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» A. semantic query optimization | |
| 855. | Database security helps organizations to protect data from |
| A. | internal users |
| B. | external users |
| C. | non-external users |
| D. | non internal users |
| Answer» B. external users | |
| 856. | Copying files to secondary or specific devices is known as |
| A. | retrieve |
| B. | backup |
| C. | recovery |
| D. | deadlock |
| Answer» B. backup | |
| 857. | Which are types of recovery control techniques: |
| A. | deferred update |
| B. | immediate update |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 858. | Which server can join the indexes when only multiple indexes combined can cover the query: |
| A. | sql |
| B. | dbms |
| C. | rdbms |
| D. | all of the mentioned |
| Answer» A. sql | |
| 859. | In concurrency control policy the lock is obtained on |
| A. | entire database |
| B. | a particular transaction alone |
| C. | all the new elements |
| D. | all of the mentioned |
| Answer» A. entire database | |
| 860. | A concurrency-control policy such as this one leads to performance since it forces transactions to wait for preceding transactions to finish before they can start. |
| A. | good |
| B. | average |
| C. | poor |
| D. | unstable |
| Answer» C. poor | |
| 861. | are used to ensure that transactions access each data item in order of the transactions’ if their accesses conflict. |
| A. | zone |
| B. | relay |
| C. | line |
| D. | timestamps |
| Answer» D. timestamps | |
| 862. | In which scenario would you use the ROLLUP operator for expression or columns within a GROUP BY clause? |
| A. | to find the groups forming the subtotal in a row |
| B. | to create group-wise grand totals for the groups specified within a group by clause |
| C. | to create a grouping for expressions or columns specified within a group by clause in one direction, from right to left for calculating the subtotals |
| D. | to create a grouping for expressions or columns specified within a group by clause in all possible directions, which is cross- tabular report for calculating the subtotals |
| Answer» C. to create a grouping for expressions or columns specified within a group by clause in one direction, from right to left for calculating the subtotals | |
| 863. | Which statement is true regarding external tables? |
| A. | the default reject limit for external tables is unlimited |
| B. | the data and metadata for an external table are stored outside the database |
| C. | oracle_loader and oracle_datapump have exactly the same functionality when used with an external table |
| D. | the create table as select statement can be used to unload data into regular table in the database from an external table |
| Answer» D. the create table as select statement can be used to unload data into regular table in the database from an external table | |
| 864. | SNAPSHOT is used for (DBA) |
| A. | synonym |
| B. | tablespace |
| C. | system server |
| D. | dynamic data replication |
| Answer» D. dynamic data replication | |
| 865. | Isolation of the transactions is ensured by |
| A. | transaction management |
| B. | application programmer |
| C. | concurrency control |
| D. | recovery management |
| Answer» C. concurrency control | |
| 866. | Which of the following statements is/are not true for SQL profiler? |
| A. | enables you to monitor events |
| B. | check if rows are being inserted properly |
| C. | check the performance of a stored procedure |
| D. | all of the mentioned |
| Answer» C. check the performance of a stored procedure | |
| 867. | Which of the following is the original purpose of SQL? |
| A. | to specify the syntax and semantics of sql data definition language |
| B. | to specify the syntax and semantics of sql manipulation language |
| C. | to define the data structures |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 868. | SQL can be used to: |
| A. | create database structures only |
| B. | query database data only |
| C. | modify database data only |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 869. | A lock that allows concurrent transactions to access different rows of the same table is known as a |
| A. | database-level lock |
| B. | table-level lock |
| C. | page-level lock |
| D. | row-level lock |
| Answer» D. row-level lock | |
| 870. | Which of the following are introduced to reduce the overheads caused by the log- based recovery? |
| A. | checkpoints |
| B. | indices |
| C. | deadlocks |
| D. | locks |
| Answer» A. checkpoints | |
| 871. | Which of the following protocols ensures conflict serializability and safety from deadlocks? |
| A. | two-phase locking protocol |
| B. | time-stamp ordering protocol |
| C. | graph based protocol |
| D. | none of the mentioned |
| Answer» B. time-stamp ordering protocol | |
| 872. | Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other |
| A. | concurrency |
| B. | deadlock |
| C. | backup |
| D. | recovery |
| Answer» A. concurrency | |
| 873. | The lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row. |
| A. | table-level |
| B. | page-level |
| C. | row-level |
| D. | field-level |
| Answer» D. field-level | |
| 874. | Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released? |
| A. | record controller |
| B. | exclusive lock |
| C. | authorization rule |
| D. | two phase lock |
| Answer» D. two phase lock | |
| 876. | The deadlock state can be changed back to stable state by using statement. |
| A. | commit |
| B. | rollback |
| C. | savepoint |
| D. | deadlock |
| Answer» B. rollback | |
| 877. | What are the ways of dealing with deadlock? |
| A. | deadlock prevention |
| B. | deadlock recovery |
| C. | deadlock detection |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 878. | When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is |
| A. | wait-die |
| B. | wait-wound |
| C. | wound-wait |
| D. | wait |
| Answer» A. wait-die | |
| 879. | When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is |
| A. | wait-die |
| B. | wait-wound |
| C. | wound-wait |
| D. | wait |
| Answer» C. wound-wait | |
| 880. | The situation where the lock waits only for a specified amount of time for another lock to be released is |
| A. | lock timeout |
| B. | wait-wound |
| C. | timeout |
| D. | wait |
| Answer» A. lock timeout | |
| 881. | The deadlock in a set of a transaction can be determined by |
| A. | read-only graph |
| B. | wait graph |
| C. | wait-for graph |
| D. | all of the mentioned |
| Answer» A. read-only graph | |
| 882. | A deadlock exists in the system if and only if the wait-for graph contains a |
| A. | cycle |
| B. | direction |
| C. | bi-direction |
| D. | rotation |
| Answer» A. cycle | |
| 883. | rollback requires the system to maintain additional information about the state of all the running transactions. |
| A. | total |
| B. | partial |
| C. | time |
| D. | commit |
| Answer» B. partial | |
| 884. | If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called |
| A. | intention lock modes |
| B. | explicit lock |
| C. | implicit lock |
| D. | exclusive lock |
| Answer» A. intention lock modes | |
| 885. | If a node is locked in explicit locking is being done at a lower level of the tree, but with only shared-mode locks. |
| A. | intention lock modes |
| B. | intention-shared-exclusive mode |
| C. | intention-exclusive (ix) mode |
| D. | intention-shared (is) mode |
| Answer» A. intention lock modes | |
| 886. | If a node is locked in then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks. |
| A. | intention lock modes |
| B. | intention-shared-exclusive mode |
| C. | intention-exclusive (ix) mode |
| D. | intention-shared (is) mode |
| Answer» C. intention-exclusive (ix) mode | |
| 887. | If a node is locked in the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks. |
| A. | intention lock modes |
| B. | shared and intention-exclusive (six) mode |
| C. | intention-exclusive (ix) mode |
| D. | intention-shared (is) mode |
| Answer» B. shared and intention-exclusive (six) mode | |
| 888. | The requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a read-only or an update transaction. |
| A. | validation protocol |
| B. | validation-based protocol |
| C. | timestamp protocol |
| D. | timestamp-ordering protocol |
| Answer» A. validation protocol | |
| 889. | denotes the largest timestamp of any transaction that executed write(Q) successfully. |
| A. | w-timestamp(q) |
| B. | r-timestamp(q) |
| C. | rw-timestamp(q) |
| D. | wr-timestamp(q) |
| Answer» A. w-timestamp(q) | |
| 890. | The most recent version of standard SQL prescribed by the American National Standards Institute is |
| A. | sql 2016 |
| B. | sql 2002 |
| C. | sql – 4 |
| D. | sql2 |
| Answer» A. sql 2016 | |
| 891. | ANSI-standard SQL allows the use of special operators in conjunction with the WHERE clause. A special operator used to check whether an attribute value is null is |
| A. | between |
| B. | is null |
| C. | like |
| D. | in |
| Answer» B. is null | |
| 892. | A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a |
| A. | database-level lock |
| B. | table-level lock |
| C. | page-level lock |
| D. | row-level lock |
| Answer» A. database-level lock | |
| 893. | A condition that occurs when two transactions wait for each other to unlock data is known as a(n) |
| A. | shared lock |
| B. | exclusive lock |
| C. | binary lock |
| D. | deadlock |
| Answer» D. deadlock | |
| 894. | The file organization which allows us to read records that would satisfy the join condition by using one block read is |
| A. | heap file organization |
| B. | sequential file organization |
| C. | clustering file organization |
| D. | hash files organization |
| Answer» C. clustering file organization | |
| 895. | The extent of the database resource that is included with each lock is called the level of |
| A. | impact |
| B. | granularity |
| C. | management |
| D. | dbms control |
| Answer» B. granularity | |
| 896. | DBMS periodically suspends all processing and synchronizes its files and journals through the use of |
| A. | checkpoint facility |
| B. | backup facility |
| C. | recovery manager |
| D. | database change log |
| Answer» A. checkpoint facility | |
| 897. | Snapshot isolation is used to give |
| A. | transaction a snapshot of the database |
| B. | database a snapshot of the transaction |
| C. | database a snapshot of committed values in the transaction |
| D. | transaction a snapshot of the database and database a snapshot of committed values in the transaction |
| Answer» D. transaction a snapshot of the database and database a snapshot of committed values in the transaction | |
| 898. | Lost update problem is |
| A. | second update overwrites the first |
| B. | first update overwrites the second |
| C. | the updates are lost due to conflicting problem |
| D. | none of the mentioned |
| Answer» A. second update overwrites the first | |
| 899. | Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as |
| A. | read skew |
| B. | update skew |
| C. | write lock |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 901. | A non-correlated subquery can be defined as | |
| A. | a set of sequential queries, all of which must always return a single value | |
| B. | a set of sequential queries, all of which must return values from the same table | |
| C. | a select statement that can be embedded in a clause of another select statement only | |
| D. | a set of one or more sequential queries in which generally the result of the inner query is used as the search value in the outer query | |
| Answer» D. a set of one or more sequential queries in which generally the result of the inner query is used as the search value in the outer query | ||
| 902. | Which statement is true regarding synonyms? |
| A. | synonyms can be created for tables but not views |
| B. | synonyms are used to reference only those tables that are owned by another user |
| C. | a public synonym and a private synonym can exist with the same name for the same table |
| D. | the drop synonym statement removes the synonym, and the status of the table on which the synonym has been created becomes invalid |
| Answer» C. a public synonym and a private synonym can exist with the same name for the same table | |
| 903. | The method of access that uses key transformation is called as |
| A. | direct |
| B. | hash |
| C. | random |
| D. | sequential |
| Answer» B. hash | |
| 904. | Why do we need concurrency control on B+ trees ? |
| A. | to remove the unwanted data |
| B. | to easily add the index elements |
| C. | to maintain accuracy of index |
| D. | all of the mentioned |
| Answer» C. to maintain accuracy of index | |
| 905. | How many techniques are available to control concurrency on B+ trees? |
| A. | one |
| B. | three |
| C. | four |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 906. | In crabbing protocol locking |
| A. | goes down the tree and back up |
| B. | goes up the tree and back down |
| C. | goes down the tree and releases |
| D. | goes up the tree and releases |
| Answer» A. goes down the tree and back up | |
| 907. | The deadlock can be handled by |
| A. | removing the nodes that are deadlocked |
| B. | restarting the search after releasing the lock |
| C. | restarting the search without releasing the lock |
| D. | resuming the search |
| Answer» B. restarting the search after releasing the lock | |
| 908. | In crabbing protocol, the lock obtained on the root node is in mode. |
| A. | shared |
| B. | exclusive |
| C. | read only |
| D. | none of the mentioned |
| Answer» A. shared | |
| 909. | If needed to split a node or coalesce it with its siblings, or redistribute key values between siblings, the crabbing protocol locks the parent of the node in mode. |
| A. | shared |
| B. | exclusive |
| C. | read only |
| D. | none of the mentioned |
| Answer» B. exclusive | |
| 910. | Instead of locking index leaf nodes in a two-phase manner, some index concurrency- control schemes use on individual key values, allowing other key values to be inserted or deleted from the same leaf. |
| A. | b+ tree locking |
| B. | link level locking |
| C. | key-value locking |
| D. | next value locking |
| Answer» C. key-value locking | |
| 911. | The recovery scheme must also provide |
| A. | high availability |
| B. | low availability |
| C. | high reliability |
| D. | high durability |
| Answer» A. high availability | |
| 912. | Which one of the following is a failure to a system |
| A. | boot crash |
| B. | read failure |
| C. | transaction failure |
| D. | all of the mentioned |
| Answer» C. transaction failure | |
| 913. | The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is |
| A. | read error |
| B. | boot error |
| C. | logical error |
| D. | system error |
| Answer» C. logical error | |
| 914. | The transaction can no longer continue with its normal execution because of some internal condition, such as bad input, data not found, overflow, or resource limit exceeded. This is |
| A. | read error |
| B. | boot error |
| C. | logical error |
| D. | system error |
| Answer» C. logical error | |
| 915. | The assumption that hardware errors and bugs in the software bring the system to a halt, but do not corrupt the nonvolatile storage contents, is known as the |
| A. | stop assumption |
| B. | fail assumption |
| C. | halt assumption |
| D. | fail-stop assumption |
| Answer» D. fail-stop assumption | |
| 916. | The database is partitioned into fixed- length storage units called |
| A. | parts |
| B. | blocks |
| C. | reads |
| D. | build |
| Answer» B. blocks | |
| 917. | The log is a sequence of recording all the update activities in the database. |
| A. | log records |
| B. | records |
| C. | entries |
| D. | redo |
| Answer» A. log records | |
| 918. | In the scheme, a transaction that wants to update the database first creates a complete copy of the database. |
| A. | shadow copy |
| B. | shadow paging |
| C. | update log records |
| D. | all of the mentioned |
| Answer» A. shadow copy | |
| 919. | The scheme uses a page table containing pointers to all pages; the page table itself and all updated pages are copied to a new location. |
| A. | shadow copy |
| B. | shadow paging |
| C. | update log records |
| D. | all of the mentioned |
| Answer» B. shadow paging | |
| 920. | If a transaction does not modify the database until it has committed, it is said to use the technique. |
| A. | deferred-modification |
| B. | late-modification |
| C. | immediate-modification |
| D. | undo |
| Answer» A. deferred-modification | |
| 921. | using a log record sets the data item specified in the log record to the old value. |
| A. | deferred-modification |
| B. | late-modification |
| C. | immediate-modification |
| D. | undo |
| Answer» D. undo | |
| 922. | In the phase, the system replays updates of all transactions by scanning the log forward from the last checkpoint. |
| A. | repeating |
| B. | redo |
| C. | replay |
| D. | undo |
| Answer» B. redo | |
| 923. | The actions which are played in the order while recording it is called history. |
| A. | repeating |
| B. | redo |
| C. | replay |
| D. | undo |
| Answer» A. repeating | |
| 924. | A special redo-only log record < Ti, Xj, V1> is written to the log, where V1 is the value being restored to data item Xj during the rollback. These log records are sometimes called |
| A. | log records |
| B. | records |
| C. | compensation log records |
| D. | compensation redo records |
| Answer» C. compensation log records | |
| 926. | Writing the buffered log to is sometimes referred to as a log force. | |
| A. | memory | |
| B. | backup | |
| C. | redo memory | |
| D. | disk | |
| Answer» D. disk | ||
| 927. | The policy, allows a transaction to commit even if it has modified some blocks that have not yet been written back to disk. |
| A. | force |
| B. | no-force |
| C. | steal |
| D. | no-steal |
| Answer» B. no-force | |
| 928. | policy allows multiple updates to accumulate on a block before it is output to stable storage, which can reduce the number of output operations greatly for frequently updated blocks. |
| A. | force |
| B. | no-force |
| C. | steal |
| D. | no-steal |
| Answer» B. no-force | |
| 929. | The policy, allows the system to write modified blocks to disk even if the transactions that made those modifications have not all committed. |
| A. | force |
| B. | no-force |
| C. | steal |
| D. | no-steal |
| Answer» C. steal | |
| 930. | The contains a list of blocks that have been updated in the database buffer. |
| A. | latches |
| B. | swap space |
| C. | dirty block |
| D. | none of the mentioned |
| Answer» C. dirty block | |
| 931. | The silicon chips used for data processing are called |
| A. | ram chips |
| B. | rom chips |
| C. | micro processors |
| D. | prom chips |
| Answer» D. prom chips | |
| 932. | Which of the following is used for manufacturing chips? |
| A. | control bus |
| B. | control unit |
| C. | parity unit |
| D. | semiconductor |
| Answer» D. semiconductor | |
| 933. | What was the name of the first commercially available microprocessor chip? |
| A. | intel 308 |
| B. | intel 33 |
| C. | intel 4004 |
| D. | motorola 639 |
| Answer» C. intel 4004 | |
| 934. | The magnetic storage chip used to provide non-volatile direct access storage of data and that have no moving parts are known as |
| A. | magnetic core memory |
| B. | magnetic tape memory |
| C. | magnetic disk memory |
| D. | magnetic bubble memory |
| Answer» D. magnetic bubble memory | |
| 935. | The ALU of a computer normally contains a number of high speed storage element called |
| A. | semiconductor memory |
| B. | registers |
| C. | hard disks |
| D. | magnetic disk |
| Answer» B. registers | |
| 936. | A dump of the database contents is also referred to as an dump. |
| A. | archival |
| B. | fuzzy |
| C. | sql |
| D. | all of the mentioned |
| Answer» A. archival | |
| 937. | dump, writes out SQL DDL statements and SQL insert statements to a file, which can then be reexecuted to re- create the database. |
| A. | archival |
| B. | fuzzy |
| C. | sql |
| D. | all of the mentioned |
| Answer» C. sql | |
| 938. | dump schemes have been developed that allow transactions to be active while the dump is in progress. |
| A. | archival |
| B. | fuzzy |
| C. | sql |
| D. | all of the mentioned |
| Answer» B. fuzzy | |
| 939. | ARIES uses a to identify log records, and stores it in database pages. |
| A. | log sequence number |
| B. | log number |
| C. | lock number |
| D. | sequence |
| Answer» B. log number | |
| 940. | ARIES supports operations, which are physical in that the affected page is physically identified, but can be logical within the page. |
| A. | physiological redo |
| B. | physiological undo |
| C. | logical redo |
| D. | logical undo |
| Answer» A. physiological redo | |
| 941. | is used to minimize unnecessary redos during recovery. |
| A. | dirty page table |
| B. | page table |
| C. | dirty redo |
| D. | all of the mentioned |
| Answer» A. dirty page table | |
| 942. | scheme that records only information about dirty pages and associated information and does not even require of writing dirty pages to disk. |
| A. | fuzzy logic |
| B. | checkpoints |
| C. | fuzzy-checkpoint |
| D. | logical checkpoint |
| Answer» C. fuzzy-checkpoint | |
| 943. | Whenever an update operation occurs on a page, the operation stores the LSN of its log record in the field of the page. |
| A. | lsn |
| B. | readlsn |
| C. | pagelsn |
| D. | redolsn |
| Answer» C. pagelsn | |
| 944. | The contains a list of pages that have been updated in the database buffer. |
| A. | dirty page table |
| B. | page table |
| C. | dirty redo |
| D. | all of the mentioned |
| Answer» A. dirty page table | |
| 945. | determines which transactions to undo, which pages were dirty at the time of the crash, and the LSN from which the redo pass should start. |
| A. | analysis pass |
| B. | redo pass |
| C. | undo pass |
| D. | none of the mentioned |
| Answer» A. analysis pass | |
| 946. | starts from a position determined during analysis, and performs a redo, repeating history, to bring the database to a state it was in before the crash. |
| A. | analysis pass |
| B. | redo pass |
| C. | undo pass |
| D. | none of the mentioned |
| Answer» B. redo pass | |
| 947. | rolls back all transactions that were incomplete at the time of crash. |
| A. | analysis pass |
| B. | redo pass |
| C. | undo pass |
| D. | none of the mentioned |
| Answer» C. undo pass | |
| 948. | Which lock should be obtained to prevent a concurrent transaction from executing a conflicting read, insert or delete operation on the same key value. |
| A. | higher-level lock |
| B. | lower-level lock |
| C. | read only lock |
| D. | read write |
| Answer» A. higher-level lock | |
| 949. | Once the lower-level lock is released, the operation cannot be undone by using the old values of updated data items, and must instead be undone by executing a compensating operation; such an operation is called |
| A. | logical operation |
| B. | redo operation |
| C. | logical undo operation |
| D. | undo operation |
| Answer» A. logical operation | |
| 951. | Redo operations are performed exclusively using | |
| A. | logical logging | |
| B. | physical logging | |
| C. | physical log records | |
| D. | both physical logging and physical log records | |
| Answer» D. both physical logging and physical log records | ||
| 952. | An operation is said to be if executing it several times in a row gives the same result as executing it once. |
| A. | idempotent |
| B. | changed |
| C. | repetitive |
| D. | all of the above |
| Answer» A. idempotent | |
| 953. | Immediate database modification technique uses |
| A. | both undo and redo |
| B. | undo but no redo |
| C. | redo but no undo |
| D. | neither undo nor redo |
| Answer» A. both undo and redo | |
| 954. | Shadow paging has |
| A. | no redo |
| B. | no undo |
| C. | redo but no undo |
| D. | neither redo nor undo |
| Answer» A. no redo | |
| 955. | For correct behaviour during recovery, undo and redo operation must be |
| A. | commutative |
| B. | associative |
| C. | idempotent |
| D. | distributive |
| Answer» C. idempotent | |
| 956. | If are not obtained in undo operation it will cause problem in undo- phase. |
| A. | higher-level lock |
| B. | lower-level lock |
| C. | read only lock |
| D. | read write |
| Answer» B. lower-level lock | |
| 957. | The remote backup site is sometimes also called the |
| A. | primary site |
| B. | secondary site |
| C. | tertiary site |
| D. | none of the mentioned |
| Answer» B. secondary site | |
| 958. | The backup is taken by |
| A. | erasing all previous records |
| B. | entering the new records |
| C. | sending all log records from primary site to the remote backup site |
| D. | sending selected records from primary site to the remote backup site |
| Answer» C. sending all log records from primary site to the remote backup site | |
| 959. | When the the backup site takes over processing and becomes the primary. |
| A. | secondary fails |
| B. | backup recovers |
| C. | primary fails |
| D. | none of the mentioned |
| Answer» C. primary fails | |
| 960. | The simplest way of transferring control is for the old primary to receive from the old backup site. |
| A. | undo logs |
| B. | redo logs |
| C. | primary logs |
| D. | all of the mentioned |
| Answer» C. primary logs | |
| 961. | The time to process the remote backup can be reduced by |
| A. | flags |
| B. | breakpoints |
| C. | redo points |
| D. | checkpoints |
| Answer» D. checkpoints | |
| 962. | A configuration can make takeover by the backup site almost instantaneous. |
| A. | hot-spare |
| B. | remote |
| C. | direct |
| D. | spare |
| Answer» D. spare | |
| 963. | A transaction commits as soon as its commit log record is written to stable storage at the primary site. This is |
| A. | one safe |
| B. | two safe |
| C. | two-very safe |
| D. | very safe |
| Answer» A. one safe | |
| 964. | A transaction commits as soon as its commit log record is written to stable storage at the primary and the backup site. This is |
| A. | one safe |
| B. | two safe |
| C. | two-very safe |
| D. | very safe |
| Answer» C. two-very safe | |
| 965. | If only the primary is active, the transaction is allowed to commit as soon as its commit log record is written to stable storage at the primary site. This is |
| A. | one safe |
| B. | two safe |
| C. | two-very safe |
| D. | very safe |
| Answer» B. two safe | |
| 966. | A Database Management System (DBMS) is |
| A. | Collection of interrelated data |
| B. | Collection of programs to access data |
| C. | Collection of data describing one particular enterprise |
| D. | All of the above |
| Answer» D. All of the above | |
| 967. | Which of the following is not a Schema? |
| A. | Database Schema |
| B. | Physical Schema |
| C. | Critical Schema |
| D. | Logical Schema |
| Answer» C. Critical Schema | |
| 968. | The number of entities associated in relationship is called as it’s………………… |
| A. | Cardinality |
| B. | Degree |
| C. | Tuples |
| D. | Entity |
| Answer» B. Degree | |
| 969. | The DBMS utility…………………. allows reconstructing the correct state of database from the backup and history of transactions. |
| A. | Backup |
| B. | Recovery |
| C. | Monitoring |
| D. | Data loading |
| Answer» B. Recovery | |
| 970. | In the……….. Normal form, a composite attribute is converted to individual attributes. |
| A. | First |
| B. | Second |
| C. | Third |
| D. | Fourth |
| Answer» A. First | |
| 971. | In RDBMS, Data is presented as a collection of………… |
| A. | Table |
| B. | Attributes |
| C. | Relations |
| D. | Entities |
| Answer» C. Relations | |
| 972. | A ……………… normal form, normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. |
| A. | First |
| B. | Second |
| C. | Third |
| D. | Fourth |
| Answer» C. Third | |
| 973. | To select all columns from the table the syntax is: |
| A. | Select all from table_name |
| B. | Select * from table_name |
| C. | Select from table_name |
| D. | Non of the above |
| Answer» B. Select * from table_name | |
| 974. | If an attribute of a composite key is dependent on an attribute of the other composite key, normalization called ……………. is needed. |
| A. | DKNF |
| B. | BCNF |
| C. | Fourth |
| D. | Third |
| Answer» B. BCNF | |
| 976. | The ………… operator preserves unmatched rows of the relations being joined. |
| A. | Inner join |
| B. | Outer join |
| C. | Union |
| D. | Union join |
| Answer» B. Outer join | |
| 977. | Which are the not user in End-user: |
| A. | Naïve users |
| B. | Casual users |
| C. | Sophisticated user |
| D. | All of these |
| Answer» D. All of these | |
| 978. | DBMS is a collection of ………….. that enables user to create and maintain a database. |
| A. | Keys |
| B. | Translators |
| C. | Programs |
| D. | Language Activity |
| Answer» C. Programs | |
| 979. | In a relational schema, each tuple is divided into fields called |
| A. | Relations |
| B. | Domains |
| C. | Queries |
| D. | All of the above |
| Answer» B. Domains | |
| 980. | In an ER model, ……………. is described in the database by storing its data. |
| A. | Entity |
| B. | Attribute |
| C. | Relationship |
| D. | Notation |
| Answer» A. Entity | |
| 981. | DFD stands for |
| A. | Data Flow Document |
| B. | Data File Diagram |
| C. | Data Flow Diagram |
| D. | Non of the above |
| Answer» C. Data Flow Diagram | |
| 982. | A top-to-bottom relationship among the items in a database is established by a |
| A. | Hierarchical schema |
| B. | Network schema |
| C. | Relational Schema |
| D. | All of the above |
| Answer» A. Hierarchical schema | |
| 983. | ……………… table store information about database or about the system. |
| A. | SQL |
| B. | Nested |
| C. | System |
| D. | None of these |
| Answer» C. System | |
| 984. | …………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. |
| A. | Instance |
| B. | Schema |
| C. | Program |
| D. | Super Key |
| Answer» B. Schema | |
| 985. | ……………… clause is an additional filter that is applied to the result. |
| A. | Select |
| B. | Group-by |
| C. | Having |
| D. | Order by |
| Answer» C. Having | |
| 986. | A logical schema |
| A. | is the entire database |
| B. | is a standard way of organizing information into accessible parts. |
| C. | describes how data is actually stored on disk. |
| D. | All of the above |
| Answer» B. is a standard way of organizing information into accessible parts. | |
| 987. | ………………… is a full form of SQL. |
| A. | Standard query language |
| B. | Sequential query language |
| C. | Structured query language |
| D. | Server side query language |
| Answer» C. Structured query language | |
| 988. | The candidate key is that you choose to identify each row uniquely is called …………….. |
| A. | Alternate Key |
| B. | Primary Key |
| C. | Foreign Key |
| D. | None of the above |
| Answer» B. Primary Key | |
| 989. | …………….. is used to determine whether of a table contains duplicate rows. |
| A. | Unique predicate |
| B. | Like Predicate |
| C. | Null predicate |
| D. | In predicate |
| Answer» A. Unique predicate | |
| 990. | To eliminate duplicate rows ……………… is used |
| A. | NODUPLICATE |
| B. | ELIMINATE |
| C. | DISTINCT |
| D. | None of these |
| Answer» C. DISTINCT | |
| 991. | State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. |
| A. | i-true, ii-false |
| B. | i-false, ii-true |
| C. | i-true, ii-true |
| D. | i-false, ii-false |
| Answer» C. i-true, ii-true | |
| 992. | DCL stands for |
| A. | Data Control Language |
| B. | Data Console Language |
| C. | Data Console Level |
| D. | Data Control Level |
| Answer» A. Data Control Language | |
| 993. | …………………… is the process of organizing data into related tables. |
| A. | Normalization |
| B. | Generalization |
| C. | Specialization |
| D. | None of the above |
| Answer» A. Normalization | |
| 994. | A ………………. does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity. |
| A. | Weak entity |
| B. | Strong entity |
| C. | Non attributes entity |
| D. | Dependent entity |
| Answer» A. Weak entity | |
| 995. | …………….. is the complex search criteria in the where clause. |
| A. | Substring |
| B. | Drop Table |
| C. | Predict |
| D. | Predicate |
| Answer» D. Predicate | |
| 996. | ………………… is preferred method for enforcing data integrity |
| A. | Constraints |
| B. | Stored Procedure |
| C. | Triggers |
| D. | Cursors |
| Answer» A. Constraints | |
| 997. | The number of tuples in a relation is called it’s …………. While the number of attributes in a relation is called it’s ……………….. |
| A. | Degree, Cardinality |
| B. | Cardinality, Degree |
| C. | Rows, Columns |
| D. | Columns, Rows |
| Answer» B. Cardinality, Degree | |
| 998. | State true or false. i) Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. |
| A. | i-True, ii-False |
| B. | i-True, ii-True |
| C. | i-False, ii-True |
| D. | i-False, ii-False |
| Answer» C. i-False, ii-True | |
| 999. | …………… database is used as template for all databases created. |
| A. | Master |
| B. | Model |
| C. | Tempdb |
| D. | None of the above |
| Answer» B. Model | |
| 1001. | ………………….. operator is basically a join followed by a project on the attributes of first relation. |
| A. | Join |
| B. | Semi-Join |
| C. | Full Join |
| D. | Inner Join |
| Answer» B. Semi-Join | |
| 1002. | Which of the following is not a binary operator in relational algebra? |
| A. | Join |
| B. | Semi-Join |
| C. | Assignment |
| D. | Project |
| Answer» D. Project | |
| 1003. | Centralizing the integrity checking directly under the DBMS ………….. duplication and ensures the consistency and validity of the database. |
| A. | Increases |
| B. | Skips |
| C. | Does not reduce |
| D. | Reduces |
| Answer» D. Reduces | |
| 1004. | Which of the following is/are the DDL statements? |
| A. | Create |
| B. | Drop |
| C. | Alter |
| D. | All of the above |
| Answer» D. All of the above | |
| 1005. | —————- is used to retrieve tuples from the relation. |
| A. | Create |
| B. | Drop |
| C. | Select |
| D. | All of the above |
| Answer» C. Select | |
| 1006. | ……………… defines rules regarding the values allowed in columns and is the standard mechanism for enforcing database integrity. |
| A. | Column |
| B. | Constraint |
| C. | Index |
| D. | Trigger |
| Answer» B. Constraint | |
| 1007. | For like predicate which of the following is true. i) % matches zero of more characters. ii) _ matches exactly one character. |
| A. | i-only |
| B. | ii-only |
| C. | Both of them |
| D. | None of them |
| Answer» C. Both of them | |
| 1008. | The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………. |
| A. | Fields |
| B. | Records |
| C. | Relations |
| D. | Keys |
| Answer» C. Relations | |
| 1009. | ……………….. contains information that defines valid values that are stored in a column or data type. |
| A. | View |
| B. | Rule |
| C. | Index |
| D. | Default |
| Answer» C. Index | |
| 1010. | Which of the syntax is correct for insert statement? i) insert into <table_name> values <list of values> ii) insert into <table_name> (column list) values <list of values> |
| A. | i-only |
| B. | ii-only |
| C. | Both of them |
| D. | None of them |
| Answer» C. Both of them | |
| 1011. | ………………. first proposed the process of normalization. |
| A. | Edgar. W |
| B. | Edgar F. Codd |
| C. | Edward Stephen |
| D. | Edward Codd |
| Answer» B. Edgar F. Codd | |
| 1012. | For using a specific database …………… command is used. |
| A. | Use database |
| B. | <Database name> use |
| C. | Both A &B |
| D. | None of them |
| Answer» A. Use database | |
| 1013. | Which of the following is not comparison operator? |
| A. | <> |
| B. | < |
| C. | =< |
| D. | >= |
| Answer» C. =< | |
| 1014. | An outstanding functionality of SQL is its support for automatic ………… to the target data. |
| A. | Programming |
| B. | Functioning |
| C. | Navigation |
| D. | Notification |
| Answer» C. Navigation | |
| 1015. | ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. |
| A. | Entity Integrity Constraints |
| B. | Referential Integrity Constraints |
| C. | Domain Integrity Constraints |
| D. | Key Constraints |
| Answer» B. Referential Integrity Constraints | |
| 1016. | ……………..specifies a search condition for a group or an aggregate. |
| A. | GROUP BY Clause |
| B. | HAVING Clause |
| C. | FROM Clause |
| D. | WHERE Clause |
| Answer» B. HAVING Clause | |
| 1017. | Drop Table cannot be used to drop a table referenced by a …………… constraint. |
| A. | Local Key |
| B. | Primary Key |
| C. | Composite Key |
| D. | Foreign Key |
| Answer» D. Foreign Key | |
| 1018. | Which are the not features of a DBMS which provide a number of advantages for data management: |
| A. | DML |
| B. | DDL |
| C. | SDL |
| D. | None of these |
| Answer» D. None of these | |
| 1019. | Minimal data redundancy means improved _________: |
| A. | Data independence |
| B. | Data consistency |
| C. | Data integration |
| D. | Data sharing |
| Answer» B. Data consistency | |
| 1020. | Who access the database occasionally and have different needs each time: |
| A. | Naïve users |
| B. | Casual users |
| C. | Sophisticated user |
| D. | All of these |
| Answer» B. Casual users | |
| 1021. | System analyst and application programmers are commonly referred to as ……………………. |
| A. | Naïve users |
| B. | Casual users |
| C. | Software engineers |
| D. | Programmers |
| Answer» C. Software engineers | |
| 1022. | Who interact with the system without writing a program: |
| A. | Naïve users |
| B. | Casual users |
| C. | Sophisticated user |
| D. | All of these |
| Answer» C. Sophisticated user | |
| 1023. | Who interact with the system by invoking one of the permanent application program: |
| A. | Naïve users |
| B. | Casual users |
| C. | Sophisticated user |
| D. | All of these |
| Answer» A. Naïve users | |
| 1024. | The main interface that a naive user uses is a form interface using___: |
| A. | DDL |
| B. | GUI |
| C. | OLAP |
| D. | DML |
| Answer» B. GUI | |
| 1026. | ____ is a translates into low-level instruction that a query processor understands: | |
| A. | DBA | |
| B. | DBMS | |
| C. | DBS | |
| D. | DDL compiler | |
| Answer» D. DDL compiler | ||
| 1027. | Retrieval of data is done by using a ____: |
| A. | Stack |
| B. | Query |
| C. | Linked list |
| D. | All of these |
| Answer» B. Query | |
| 1028. | DML is a language by which user accesses or manipulates the ________: |
| A. | Data model |
| B. | Data consistency |
| C. | Data integration |
| D. | Data sharing |
| Answer» A. Data model | |
| 1029. | Which is the central component of the DBMS software that can also be termed as the database control system? |
| A. | Data consistency |
| B. | Data integration |
| C. | Data sharing |
| D. | Data manager |
| Answer» D. Data manager | |
| 1030. | Which is stored information about description of data in the database: |
| A. | Data files |
| B. | Data dictionary |
| C. | Database |
| D. | Data administrator |
| Answer» B. Data dictionary | |
| 1031. | After conversion of high level queries into low level commands |