

McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Computer Science SY (BSc CS) , Bachelor of Science in Information Technology SY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
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 |
325. |
Which of the following is not Unary operation? |
A. | select |
B. | project |
C. | rename |
D. | union |
Answer» D. union |
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 |
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 |
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 |
350. |
A functional dependency between two or more non-key attributes is called |
A. | transitive dependency |
B. | partial transitive dependency |
C. | functional dependency |
D. | partial functional dependency |
Answer» A. transitive dependency |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.