Database Management System Set 9
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),
Bachelor of Business Administration in Computer Applications (BBA [CA]),
Bachelor of Science in Information Technology (BSc IT),
On This Page
This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 9
Q1 | The EXISTS keyword will be true if:
- any row in the subquery meets the condition only
- all rows in the subquery fail the condition only
- both of these two conditions are met
- neither of these two conditions is met
Q2 | How can you find rows that do not match some specified condition?
- exists
- double use of not exists
- not exists
- none of the mentioned
Q3 | Which one of the following deletes all the entries but keeps the structure of the relation.
- delete from r where p;
- delete from instructor where dept name= ’finance’;
- delete from instructor where salary between 13000 and 15000;
- delete from instructor;
Q4 | The problem of ordering the update in multiple updates is avoided using
- set
- where
- case
- when
Q5 | The condition allows a general predicate over the relations being joined.
- on
- using
- set
- where
Q6 | Which of the join operations do not preserve non matched tuples?
- left outer join
- right outer join
- inner join
- natural join
Q7 | What type of join is needed when you wish to include rows that do not have matching values?
- equi-join
- natural join
- outer join
- all of the mentioned
Q8 | The operation which is not considered a basic operation of relational algebra is
- join
- selection
- union
- cross product
Q9 | In SQL the statement select * from R, S is equivalent to
- select * from r natural join s
- select * from r cross join s
- select * from r union join s
- select * from r inner join s
Q10 | Which of the following creates a virtual relation for storing the query?
- function
- view
- procedure
- none of the mentioned
Q11 | Materialised views make sure that
- view definition is kept stable
- view definition is kept up-to-date
- view definition is verified for error
- view is deleted after specified time
Q12 | Updating the value of the view
- will affect the relation from which it is defined
- will not change the view definition
- will not affect the relation from which it is defined
- cannot determine
Q13 | 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?
- with
- check
- with check
- all of the mentioned
Q14 | A consists of a sequence of query and/or update statements.
- transaction
- commit
- rollback
- flashback
Q15 | In order to undo the work of transaction after last commit which one should be used?
- view
- commit
- rollback
- flashback
Q16 | In case of any shut down during transaction before commit which of the following statement is done automatically?
- view
- commit
- rollback
- flashback
Q17 | In order to maintain the consistency during transactions, database provides
- commit
- atomic
- flashback
- retain
Q18 | A transaction completes its execution is said to be
- committed
- aborted
- rolled back
- failed
Q19 | Which of the following is used to get back all the transactions back after rollback?
- commit
- rollback
- flashback
- redo
Q20 | will undo all statements up to commit?
- transaction
- flashback
- rollback
- abort
Q21 | Which of the following is not an integrity constraint?
- not null
- positive
- unique
- check ‘predicate’
Q22 | Domain constraints, functional dependency and referential integrity are special forms of
- foreign key
- primary key
- assertion
- referential constraint
Q23 | How many tables may be included with a join?
- one
- two
- three
- all of the mentioned
Q24 | Which are the join types in join condition:
- cross join
- natural join
- join with using clause
- all of the mentioned
Q25 | How many join types in join condition:
- 2
- 3
- 4
- 5