Important MCQs of Microsoft Access as mentioned below as related to the Computer Subject for all competition exams:
Q.1. Which of the following relation algebra operation do not require the participation tables to be union-compatible? - Join
Q.2. Which of the following is not a property of transactions? - Concurrency
Q.3. Relational Algebra does not have - Projection operator
Q.4. Checkpoints are a part of - Concurrency measures
Q.5. Tree structures are used to store data in - Network model
Q.6.The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is - Non-Procedural DML.
Q.7. Precedence graphs help to find an AC14/AT11 Database Management System - Serializable schedule
Q.8. The rule that a value of a foreign key must appear as a value of some specific table is called a - Referential constraint
Q.9. The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is - Order by
Q.10. What is disjoint less constraint? - It requires that an entity belongs to no more than one level entity set.
Q.11. Full form of DBMS - Database Management System
Q.12. It is an abstraction through which relationships are treated as higher-level entities - Aggregation
Q.13. A relation is in ………..if an attribute of a composite key is dependent on an attribute of other composite keys. - 3NF
Q.14.What is data integrity? - It is the data contained in the database that is accurate and consistent
Q.15. What are the desirable properties of a decomposition - Dependency preservation
Q.16. In an E-R diagram double lines indicate - Total participation
Q.17. The operation which is not considered a basic operation of relational algebra is - Join
Q.18. Fifth Normal form is concerned with - Join dependency
Q.19. Block-interleaved distributed parity is RAID level - 5
Q.20. Immediate database modification technique uses - Both undo and redo.
Q.21. In SQL the statement select*from R, S is equivalent to - Select * from R natural join S
Q.22. Which of the following is not a consequence of concurrent operations? - Update anomaly
Q.23.As per equivalence rules for query transformation, the selection operation distributes over. – Union, Intersection, and Set difference
Q.24. The metadata is created by the - DDL interpreter
Q.25. When an E-R diagram is mapped to tables, the representation is redundant for - Weak relationship
Q.26. When R CS = f, then the cost of computing R><S is - the same as R × S
Q.27. In SQL the word ‘natural’ can be used with - inner join
Q.28. The default level of consistency in SQL is - serializable
Q.29. if a transaction T has obtained an exclusive lock on item Q, then T can - both read and write Q
Q.30. Shadow paging has - no redo
No comments:
Post a Comment
Share your feedback with us.