DBMS MCQ Solved Paper for IIFT

1. Which of the following statement on the view concept in SQL is invalid?
A. All views are not updateable
B. The views may be referenced in an SQL statement whenever tables are referenced.
C. The views are instantiated at the time they are referenced and not when they are defined.
D. The definition of a view should not have GROUP BY clause in it.
Answer : D

2. The set of all values that can be taken by the attribute is called as _______ of the attribute.
A. Tuple
B. Cardinality
C. Degree
D. Domain
Answer : D

3. In a relational schema, each tuple is divided into fields called
A. Relations
B. Queries
C. Domains
D. All of the above
Answer : A

4. Which of the following is not a logical database structure?
A. Chain
B. Network
C. Tree
D. Relational
Answer : A

5. Relationships among relationships can be represented in an-E-R model using
A. Aggregation
B. Association
C. Weak entity sets
D. Weak relationship sets
Answer : A

6. If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
A. left outer join
B. right outer join
C. full outer join
D. inner join
Answer : D

7. The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces a result of degree
A. m - 1
B. m + 1
C. m * m
D. m
Answer : D

8. The data models defined by ANSI/SPARC architecture are
A. Conceptual, physical and internal
B. Conceptual, view and external
C. Logical, physical and internal
D. Logical, physical and view
Answer : D

9. A logical schema
A. is the entire database
B. Describes how data is actually stored on disk.
C. is a standard way of organizing information into accessible parts.
D. All of the above
Answer : C

10. 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

11. Which of the following is not a property of transactions?
A. Atomicity
B. Concurrency
C. Isolation
D. Durability
Answer : B

12. What will be the number of columns and rows respectively obtained for the operation, A- B, if A B are Base union compatible and all the rows of a are common to B? Assume A has 4 columns and 10 rows; and B has 4 columns and 15 rows
A. 4,0
B. 0,0
C. 4,5
D. 8,5
Answer : A

13. Which of the following addressing modes permits relocation without any change over in the code?
A. Indirect addressing
B. Indexed addressing
C. PC relative addressing
D. Base register addressing
Answer : B

14. operator is used to compare a value to a list of literals values that have been specified.
A. Like
B. COMPARE
C. BETWEEN
D. IN
Answer : A

15. What are the desirable properties of a decomposition
A. Partition constraint.
B. Dependency preservation.
C. Redundancy.
D. Security.
Answer : B

16. The concept of mapping of ______ entity types is the concept in which the for each strong entity type E in the ER schema, create a relation R that includes all the simple attributes of E.
A. Regular
B. Irregular
C. None
D. Weak
Answer : A

17. The normal form that is not necessarily dependency preserving is
A. 2NF
B. 3NF
C. BCNF
D. 4NF
Answer : A

18. A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation R can have the same value for super key.
A. Sub
B. Parent
C. Candidate
D. Super
Answer : D

19. In a multi-user database, if two users wish to update the same record at the same time, they are prevented from doing so by
A. jamming
B. password
C. documentation
D. record lock
Answer : D

20. Between DRAM and magnetic disk storage another form of memory, called ______ memory is becoming common because it is non volatile.
A. RAM
B. Flash
C. Hard Disk
D. Secondary
Answer : B

21. Which of the following ensures the atomicity of the transaction?
A. Transaction management component of DBMS
B. Application Programmer
C. Concurrency control component of DBMS
D. Recovery management component of DBMS
Answer : A

22. When an E-R diagram is mapped to tables, the representation is redundant for
A. weak entity sets
B. weak relationship sets
C. strong entity sets
D. strong relationship sets br>Answer : B

23. The fact that information in the data warehouse changes far less often and may be regarded as non-real-time with periodic updating; This implies that data warehouses are _______
A. Volatile
B. Non - Volatile
C. Logical
D. Physical
Answer : B

24. _____ First proposed the process of normalization.
A. Edgar. W
B. Edward Stephen
C. Edgar F. Codd
D. Edward Codd
Answer : C

25. Tree structures are used to store data in
A. Network model.
B. Relational model.
C. Hierarchical model.
D. File based system.
Answer : C

26. ………………… approach reduces time and effort required for design and lesser risk in database management.
A. Single global database
B. Multiple databases
C. Top-down approach
D. None of the above
Answer : B

27. Which of the following relational algebra operations do not require the participating tables to be union-compatible?
A. Union
B. Intersection
C. Difference
D. Join
Answer : D

28. Which of the following is not a consequence of non-normalized database?
A. Update Anomaly
B. Insertion Anomaly
C. Redundancy
D. Lost update problem
Answer : D

29. ____ table store information about database or about the system.
A. SQL
B. System
C. Nested
D. None of these
Answer : B

30. In an ER diagram the ___shape specifies the Attibute and a ____ shape specifies the primary key attribute.
A. Oval; An oval with an underlined attribute
B. Circle; A circle with bolded attribute inside it
C. Diamond; A bolded attribute
D. Square; An attribute within the square
Answer : A

31. Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
A. UPDATE S CITY = KANPUR WHERE SNO=S1
B. UPDATE S SET CITY = KANPUR FOR SNO=S1
C. UPDATE S SET CITY = KANPUR WHERE SNO=S1
D. UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
Answer : C

32. A list consists of last names, first names, addresses and pin codes. If all people in the list have the same last name and same pin code a useful key would be
A. the pin code
B. the last name
C. the compound key first name and last name
D. Tr from next page
Answer : C

33. In E-R Diagram total participation is represented by
A. Double lines
B. Single line
C. Dashed lines
D. Triangle
Answer : A

34. If the closure of an attribute set is the entire relation then the attribute set is a
A. superkey
B. candidate key
C. primary key
D. not a key
Answer : A

35. Union operator is a :
A. Unary Operator
B. Ternary Operator
C. Binary Operator
D. Not an operator
Answer : C

36. In SQL, testing whether a subquery is empty is done using
A. DISTINCT
B. UNIQUE
C. NULL
D. EXISTS
Answer : D

37. According to the levels of abstraction, the schema at the intermediate level is called
A. Logical schema.
B. Physical schema.
C. Subschema.
D. None of the above.
Answer : D

38. 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

39. Which of the following is not a recovery technique?
A. Deferred update
B. Immediate update
C. Two-phase commit
D. Shadow paging
Answer : C

40. Key to represent relationship between tables is called
A. primary key
B. secondary key
C. foreign key
D. none of the above
Answer : C

41. Which of the syntax is correct for insert statement?
i) insert into values
ii) insert into (column list) values
A. i-only
B. ii-only
C. Both of them
D. None of them
Answer : C

42. The full form of GUI is _________
A. Government Union Internet
B. Graphical Unit Interface
C. Graphical User Interface
D. Graphical University Interface
Answer : C

43. A _____ is a logical unit of database processing that includes one or more data access operations that can include insertion, deletion, modification or retrieval operations.
A. Database
B. Data
C. Transaction
D. Record
Answer : C

44. The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
A. OR
B. AND
C. NOT
D. ALL
Answer : B

45. If both the functional dependencies : X�Y and Y�X hold or two attributes X and Y then the relationship between X and Y is
A. M:N
B. M:1
C.
D. 1:M
Answer : C

46. ______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
A. Instance
B. Program
C. Schema
D. Super Key
Answer : C

47. The clause alter table in SQL can be used to
A. add an attribute
B. delete an attribute
C. alter the default values of an attribute
D. all of the above
Answer : D

48. ______ keyword is used to find the number of values in a column.
A. TOTAL
B. ADD
C. COUNT
D. SUM
Answer : C

49. ____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

50. An advantage of views is
A. Data security
B. Derived columns
C. Hiding of complex queries
D. All of the above
Answer : A