MCQOPTIONS
Saved Bookmarks
This section includes 1294 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 201. |
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» D. fundamental | |
| 202. |
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» B. Derived | |
| 203. |
If no header is specified, the block is said to be an PL/SQL block. |
| A. | strong |
| B. | weak |
| C. | empty |
| D. | anonymous |
| Answer» E. | |
| 204. |
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» E. | |
| 205. |
DCL stands for |
| A. | Data Control Language |
| B. | Data Console Language |
| C. | Data Console Level |
| D. | Data Control Level |
| Answer» B. Data Console Language | |
| 206. |
A super key is a set of one or more attributes that, taken collectively, allow us |
| A. | to identify uniquely an entity in the entity set |
| B. | to make the key most powerful for faster retrieval |
| C. | to increase effectiveness of database access |
| D. | none of the above |
| Answer» B. to make the key most powerful for faster retrieval | |
| 207. |
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» D. Attributes of distinct | |
| 208. |
Which is the transformation of requests and results between different levels of abstraction: |
| A. | Evaluation |
| B. | Mapping |
| C. | Compiler |
| D. | Precompiler |
| Answer» C. Compiler | |
| 209. |
Who interact with the system without writing a program: |
| A. | Naïve users |
| B. | Casual users |
| C. | Sophisticated user |
| D. | All of these |
| Answer» D. All of these | |
| 210. |
Which of the following company now known as the Oracle Corporation? |
| A. | Stepware Inc. |
| B. | Relational Software Inc. |
| C. | Rational Inc. |
| D. | Oracle Software Inc. |
| Answer» C. Rational Inc. | |
| 211. |
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» C. Tuple, Relation | |
| 212. |
Minimal data redundancy means improved _________: |
| A. | Data independence |
| B. | Data consistency |
| C. | Data integration |
| D. | Data sharing |
| Answer» C. Data integration | |
| 213. |
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» C. tablespace | |
| 214. |
Choose the option that correctly explains in words, the function of the following relationalalgebra 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» C. Selects all the tuples from the natural join of book and student wherever the year is greater than or equal to 2009 | |
| 215. |
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» E. | |
| 216. |
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» C. slowly, eagerly | |
| 217. |
The is essentially used to search for patterns in target string. |
| A. | like predicate |
| B. | null predicate |
| C. | in predicate |
| D. | out predicate |
| Answer» B. null predicate | |
| 218. |
The log is a sequence of recording all the update activities in the database. |
| A. | log records |
| B. | records |
| C. | entries |
| D. | redo |
| Answer» B. records | |
| 219. |
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» C. update log records | |
| 220. |
Consider a directed line(->) from the relationship set advisor to both entity sets instructorand student. This indicates _________ cardinality |
| A. | One to many |
| B. | One to one |
| C. | Many to many |
| D. | Many to one |
| Answer» C. Many to many | |
| 221. |
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» E. | |
| 222. |
A data dictionary is a repository that manages _____: |
| A. | Database |
| B. | Memory |
| C. | Metadata |
| D. | All of these |
| Answer» D. All of these | |
| 223. |
The database design that consists of multiple tables that are linked together throughmatching data stored in each table is called |
| A. | Hierarchical database |
| B. | Network database |
| C. | Object oriented database |
| D. | Relational database |
| Answer» E. | |
| 224. |
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» B. index hash | |
| 225. |
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» B. bitmap | |
| 226. |
A ____ database state is one in which all data integrity constraints are satisfied. |
| A. | fixed |
| B. | complete |
| C. | consistent |
| D. | Secure |
| Answer» D. Secure | |
| 227. |
ODBC stands for |
| A. | Object Database Connectivity. |
| B. | Oral Database Connectivity. |
| C. | Oracle Database Connectivity. |
| D. | Open Database Connectivity |
| Answer» E. | |
| 228. |
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» D. none of the mentioned | |
| 229. |
The ___________ operation, denoted by −, allows us to find tuples that are in one relationbut are not in another. |
| A. | Union |
| B. | Set-difference |
| C. | Difference |
| D. | Intersection |
| Answer» C. Difference | |
| 230. |
In a ____ lock, the DBMS will lock an entire disk page. |
| A. | database-level |
| B. | table-level |
| C. | page-level |
| D. | row-level |
| Answer» D. row-level | |
| 231. |
In RDBMS, Data is presented as a collection of............ |
| A. | Table |
| B. | Attributes |
| C. | Relations |
| D. | Entities |
| Answer» D. Entities | |
| 232. |
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» B. attribute set | |
| 233. |
Assigning a value to a collection element can cause exceptions, such as |
| A. | If the subscript is NULL or is not convertible to the right datatype, PL/SQL raises the predefined exception VALUE_ERROR. Usually, the subscript must be an integer. Associative arrays can also be declared to have VARCHAR2 subscripts. |
| B. | If the subscript refers to an uninitialized element, PL/SQL raises SUBSCRIPT_BEYOND_COUNT. |
| C. | If the collection is atomically null, PL/SQL raises COLLECTION_IS_NULL. |
| D. | All mentioned above |
| Answer» E. | |
| 234. |
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» E. | |
| 235. |
When the values in one or more attributes being used as a foreign key must exist inanother set of one or more attributes in another table, we have created a(n): |
| A. | transitive dependency. |
| B. | insertion anomaly. |
| C. | referential integrity constraint. |
| D. | normal form. |
| Answer» D. normal form. | |
| 236. |
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» B. intention-shared-exclusive mode | |
| 237. |
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» D. Variable set | |
| 238. |
The traditional storage of data that is organized by customer, stored in separate foldersin filing cabinets is an example of what type of ‘database’ system? |
| A. | Hierarchical |
| B. | Network |
| C. | Object oriented |
| D. | Relational |
| Answer» B. Network | |
| 239. |
Which of the following is not a key? |
| A. | A |
| B. | E |
| C. | B, C |
| D. | D |
| Answer» D. D | |
| 240. |
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» C. advanced sql | |
| 241. |
____ is a translates into low-level instruction that a query processor understands: |
| A. | DBA |
| B. | DBMS |
| C. | DBS |
| D. | DDL compiler |
| Answer» E. | |
| 242. |
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» B. Outputs pairs of rows from the two input relations that have the same value on all attributes that have the same name | |
| 243. |
Updates that violate are disallowed. |
| A. | integrity constraints |
| B. | transaction control |
| C. | authorization |
| D. | ddl constraints |
| Answer» B. transaction control | |
| 244. |
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» B. object oriented | |
| 245. |
In 1NF, the value of the attribute must be |
| A. | Atomic |
| B. | Single |
| C. | Multivalued |
| D. | Null |
| Answer» E. | |
| 246. |
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» C. demand pipeline | |
| 247. |
Where performance and reliability are both important, RAID level is used. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 0+1 |
| Answer» E. | |
| 248. |
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» C. steal | |
| 249. |
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» B. operating system authentication | |
| 250. |
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» C. Table | |