Dbms Highlighted

Seat No -
Total number of questions : 60
1000755_T1 DBMS
Time : 1hr
Max Marks : 50
N.B
1) All questions are Multiple Choice Questions having single correct option.
2) Attempt any 50 questions out of 60.
3) Use of calculator is allowed.
4) Each question carries 1 Mark.
5) Specially abled students are allowed 20 minutes extra for examination.
6) Do not use pencils to darken answer.
7) Use only black/blue ball point pen to darken the appropriate circle.
8) No change will be allowed once the answer is marked on OMR Sheet.
9) Rough work shall not be done on OMR sheet or on question paper.
10) Darken ONLY ONE CIRCLE for each answer.
Q.no 1. The basic data type char(n) is a _____ length character string and
varchar(n) is _____ length character
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
Q.no 2. In SQL ‘relation A contains relation B’ can be written as
A : Not exists B except A
B : exists B except A
C : Not exists A except B
D : exists A except B
Q.no 3. Select * from employee What type of statement is this?
A : DML
B : Integrity constraint
C : DDL
D : View
Q.no 4. The users who use easy-to-use menu are called
A : Sophisticated end users
B : Naïve users
C : Stand-alone users
D : Casual end user
Q.no 5. The ______connective is used to test for absence of set membership.
A : except
B : exists
C : not in
D : in
Q.no 6. For the given set of functional dependency F,it’s closure is denoted as
A : F+
B : F-
C : F*
D : F_
Q.no 7. Data redundancy may lead to:
A : Data integrity
B : Atomicity problem
C : Data inconsistency
D : Data abstraction
Q.no 8. Cross Product is a:
A : Unary Operator
B : Ternary Operator
C : Binary Operator
D : Not an operator
Q.no 9. If B is an attribute and A→B, Then B is said to be ________ by A.
A : Logically implied
B : Functionally implied
C : Logically determined
D : Functionally determined
Q.no 10. A ‘book’ is a_________type of entity.
A : conceptual
B : concrete
C : real
D : abstract
Q.no 11. Which of the following is the structure of the Database?
A : Table
B : . Schema
C : Relation
D : Structure
Q.no 12. 4NF is designed to cope with :
A : Transitive dependency
B : Join dependency
C : Multi valued dependency
D : Functional dependency
Q.no 13. The overall description of a database is called______.
A : Data integrity
B : Data manipulation
C : Database schema
D : Data definition
Q.no 14. Which of the following attribute can be further divided into subparts
A : Simple attribute
B : Multivalued attribute
C : Composite attribute
D : Derived attribute
Q.no 15. In E-R Diagram derived attribute are represented by________.
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
Q.no 16. A data dictionary is a repository that manages _____
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
Q.no 17. To apply the aggregate function, to a group of set of tuples_______clause is

used.
A : Group by
B : having
C : select
D : where
Q.no 18. E-R model uses this symbol to represent weak entity set ?
A : Dotted rectangle
B : Diamond
C : Doubly outlined rectangle
D : Dotted diamond
Q.no 19. A subschema expresses_________.
A : The logical view
B : The physical view
C : The external view
D : The internal view
Q.no 20. Hierarchical model is also called_________.
A : Tree structure
B : Plex Structure
C : Normalize Structure
D : Table Structure
Q.no 21. The conceptual model is_________.
A : Dependent on hardware
B : Dependent on software.
C : Dependent on both hardware and software
D : Independent of both hardware and software
Q.no 22. Key to represent relationship between tables is called
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
Q.no 23. When the changes caused by an aborted transaction have been undone,
the transaction is said to be_________.
A : Failed
B : committed
C : partially committed
D : rolled back.
Q.no 24. What do you mean by one to many relationship between Teacher and
Class table?
A : One class may have many teachers
B : One teacher can have many classes
C : One teacher can have one class
D : Many teachers may have many classes
Q.no 25. The database environment has all of the following components
except________
A : Users.
B : Separate files
C : Database.
D : Database administrator
Q.no 26. The natural join is equal to :
A : Cartesian Product
B : Combination of Union and Cartesian product
C : Combination of selection and Cartesian product
D : Combination of projection and Cartesian product
Q.no 27. A functional dependency is a relationship between or among:
A : Tables
B : Rows
C : Relations
D : Attributes
Q.no 28. Which of the following is not Modification of the Database
A : Deletion
B : Insertion
C : Sorting
D : Updating
Q.no 29. The collection of interrelated data is called as:
A : DBMS
B : RDBMS
C : Database
Q.no 30. The method of access which uses key transformation is known as:
A : Direct
B : Hash
C : Random
D : Sequential
Q.no 31. 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
Q.no 32. Functional Dependencies are the types of constraints that are based
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
Q.no 33. Which normal form is considered adequate for relational database
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
Q.no 34. which of the following is not a database object?
A : Tables
B : Queries
C : Relationships
D : Reports
Q.no 35. In SQL the statement select*from R,S is equivalent to_______.
A : Select * from R natural join S
B : Select * from R cross join S
C : Select * from R union join S
D : Select * from R inner join S
Q.no 36. Customer withdrawing money from ATM is an example of__________
A : Application programmer
B : Naïve user
C : Specialized user
D : Sophisticated user
Q.no 37. 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 : Remove Table
Q.no 38. In one-to-many relationship the table on 'many' side is called as:
A : Parent
B : Master
C : Sister
D : Child
Q.no 39. A function that has no partial functional dependencies is in _______ form :
A : 1NF
B : 2NF
C : 3NF
D : BCNF
Q.no 40. In domain relational calculus we create a variable for every________
A : Row
B : Column
C : Table
D : Attribute
Q.no 41. Which of the following are the properties of entities?
A : Groups
B : Table
C : Attributes
D : Switchboards
Q.no 42. 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
Q.no 43. Relational Algebra is
A : Data Definition Language
B : Meta Language
C : Procedural query Language
D : Data Manipulation Language
Q.no 44. The employee salary should not be greater than Rs. 2000. This is _______
A : integrity constraint
B : referential constraint
C : over-defined constraint
D : feasible constraint
Q.no 45. Which of the following is an unary operation?
A : Selection operation
B : Generalized selection
C : Primitive operation
D : Projection operation
Q.no 46. A table joined with itself is called as________
A : Join
B : Self Join
C : Outer Join
D : Equi Join
Q.no 47. Which name must be unique within a database ?
A : Table
B : Field
C : Record
D : Character
Q.no 48. The term _______ is used to refer to a row.
A : Attribute
B : Tuple
C : Field
D : Instance
Q.no 49. The RDBMS terminology for a row is________.
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
Q.no 50. _______ produces the relation that has attributes of R1 and R2
A : Cartesian product
B : Difference
C : Product
D : Intersection
Q.no 51. _______ allow us to identify uniquely a tuple in the relation.
A : Superkey
B : Domain
C : Attribute
D : Schema
Q.no 52. Does index take space in the disk ?
A : Indexes are never stored on disk
B : It stores memory as and when required

C : Indexes take no space
D : Yes, Indexes are stored on disk
Q.no 53. A table has fields F1, F2 , F3 , F4, F5 with the following functional
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
In terms of normalization, this table is in
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
Q.no 54. Amongst the ACID properties of a transaction, the 'Durability' property
requires. that the changes made to the database by a successful transaction
persist
A : Except in case of an operating system crash
B : Except in case of a disk crash
C : Except in case of a power failure
D : Always, even if there is a failure of any kind
Q.no 55. Which of the following operation is used if we are interested in only
certain columns of a table?
A : PROJECTION
B : SELECTION
C : UNION
D : JOIN
Q.no 56. In the relational model, the number of attributes and number of tuples
iri a relation are termed as __________and ______________respectively
A : Cardinality, domain
B : Degree, cardinality
C : Domain degree
D : Cardinality, degree
Q.no 57. If a relation is in BCNF, then it is also in
A : 1NF
B : 2NF
C : 3NF
D : 5NF
Q.no 58. Which of the following is not true for Normalization?
A : Removes redundancy
B : Removes insertion anomaly
C : Decomposes the relation
D : Query execution becomes faster
Q.no 59. Which of the following is not a property of a transaction?
A : Atomicity
B : Consistency
C : Integrity
D : Durability
Q.no 60. Which are the two ways in which entities can participate in a
relationship?
A : Passive and active
B : Total and partial
C : Simple and Complex
D : simple and partial
Q.no 1. This key that uniquely identifies each record is called
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
Q.no 2. Which of the following should be used to find the mean of the salary ?
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
Q.no 3. 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
Q.no 4. Cartesian product in relational algebra is:
A : a Unary operator
B : a Binary operator
C : a Ternary operator
D : not defined
Q.no 5. E-R modeling technique is:
A : Top-down method
B : Bottom-up method
C : Right-left approach
D : Tree structure
Q.no 6. In which state one gathers and list all the necessary fields for the database
design project.
A : Data Definition
B : Data Refinement
C : Establishing Relationship
D : Data deletion
Q.no 7. Which one of the following uniquely identifies the elements in the
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
Q.no 8. In E-R diagram generalization is represented by
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
Q.no 9. All aggregate functions except _____ ignore null values in their input
collection.
A : Count(attribute)
B : Count(*)
C : Avg
D : Sum
Q.no 10. Who is more concerned about the conceptual level of the DBMS
A : The Systems programmer
B : The end user
C : Client
D : DBA
Q.no 11. In an Entity-Relationship Diagram “Diamonds”

represents__________________
A : Attributes
B : Multi-valued attributes
C : Weak entity set
D : Relationship sets
Q.no 12. Which one of the following is not true for a view:
A : View is derived from other tables
B : View is a virtual table.
C : A view definition is permanently stored as part of the database.
D : View never contains derived columns.
Q.no 13. 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
Q.no 14. Aggregate functions are functions that take a ___________ as input and
return a single value.
A : Collection of values
B : Single value
C : Aggregate value
D : Tables
Q.no 15. Relational calculus is a:
A : Procedural language
B : Non-Procedural language
C : Data definition language
D : High level language
Q.no 16. To remove a relation from an SQL database, we use the ______ command.
A : Delete
B : Purge
C : Remove
D : Drop table
A : DML
C : DDL
D : View
A : Table
B : . Schema
C : Relation
D : Structure
Class table?
A : Tree structure
B : Plex Structure
D : Table Structure
A : Data integrity
C : Database schema
A : Failed
B : committed
D : rolled back.
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
B : Diamond
D : Dotted diamond
Q.no 26. Which of the following is not a level of data abstraction?
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
Q.no 27. Which of the following enables us to view data from a table based on a
specific criterion
A : Form
B : Query
C : Macro
D : Report
Q.no 28. Which of the following is Not a Relation-algebra Operation
A : Select
B : Union
C : Rename
D : Drop table
Q.no 29. A file manipulation command that extracts some of the records from a
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
Q.no 30. A ________ in a table represents a relationship among a set of values.
A : Column
B : Key
C : Row
D : Entry
Q.no 31. In the __________ normal form, a composite attribute is converted to

individual attributes.
A : First
B : Second
C : Third
D : Fourth
Q.no 32. Minimal Superkeys are called
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
Q.no 33. NULL is__________.
A : The same as 0 for integer
B : The same as blank for character
C : The same as 0 for integer and blank for character
D : Not a value
Q.no 34. What is a relationship called when it is maintained between two entities?
A : Unary
B : Binary
C : Ternary
D : Quaternary
Q.no 35. The ______of a database keeps on changing.
A : Instance
B : Schema
C : Structure
D : Primary key
Q.no 36. Which of the following fields has width of 8 bytes?
A : Memo
B : Number
C : Date/time
D : Hyperlink
A : Groups
B : Table
C : Attributes
D : Switchboards
B : Meta Language

A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : 1NF
B : 2NF
C : 3NF
D : BCNF
A : DBMS
B : RDBMS
C : Database
B : Naïve user
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
Q.no 51. Duplication of data at several places is known as____

A : Concurrent access anomalies
B : Data isolation
D : Data redundancy
Q.no 52. Consider the following
S1: Foreign key allows null values.
S2: Every binary tables is in BCNF
Which of the following is true?
A : Both S1 and S2 are true
B : S1 is true
C : S2 is true
D : Both S1 and S2 are false
Q.no 53. Create table employee (name varchar ,id integer) What type of statement
is this ?
A : DML
B : DDL
C : View
D : Integrity constraint
Q.no 54. The result of the UNION operation between R1 and R2 is a relation that
includes
A : All the tuples of R1
B : All the tuples of R2
C : All the tuples of R1 and R2
D : All the tuples of R1 and R2 which have common columns
Q.no 55. A primary key is combined with a foreign key creates______
A : Parent-Child relationship between the tables that connect them

B : Many to many relationship between the tables that connect them.
C : Network model between the tables that connect them.
D : Many to one relationship between the tables that connect them.
Q.no 56. A table on the many side of a one to many or many to many relationship
must:
A : Be in Second Normal Form (2NF)
B : Be in Third Normal Form (3NF)
C : Have a single attribute key
D : Have a composite key
Q.no 57. If every non-key attribute is functionally depedent primary key, then the
relation will be in_____________.
A : First normal form
B : Second normal form
C : Third Normal form
D : Fourth normal form

individual attributes
A : First
B : Second
C : Third
D : Fourth
Q.no 59. The _________protocol ensures freedom from deadlock.
A : Two-phase locking protocol
B : Strict two-phase locking protocol
C : Rigorous two-phase locking protocol
D : Timestamp ordering protocol

Q.no 60. After the final statement of a transaction has been executed, a
transaction enters in a _________ state._______.
A : Active
B : aborted
C : Committed
D : Partially committed
B : Join dependency
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
A : except
B : exists
C : not in
D : in
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
A : conceptual
B : concrete
C : real
D : abstract

used.
A : Group by
B : having
C : select
D : where
A : F+
B : F-
C : F*
D : F_
B : Naïve users
D : Casual end user
except________
A : Users.
B : Separate files
C : Database.

A : Unary Operator
C : Binary Operator
D : Not an operator
A : Data integrity
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
A : Delete
B : Purge
C : Remove
D : Drop table
A : Table
B : . Schema
C : Relation
D : Structure
B : Diamond
D : Dotted diamond
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
B : Single value
C : Aggregate value
D : Tables
A : Tree structure
B : Plex Structure
D : Table Structure
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : Join
B : Self Join
C : Outer Join
D : Equi Join
specific criterion
A : Form
B : Query
C : Macro
D : Report
A : Row
B : Column
C : Table
D : Attribute

A : First
B : Second
C : Third
D : Fourth
A : Direct
B : Hash
C : Random
D : Sequential
A : Attribute
B : Tuple
C : Field
D : Instance
A : Table
B : Field
C : Record
D : Character
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
A : Tables
B : Rows
C : Relations
D : Attributes
B : Difference
C : Product
D : Intersection
A : Select
B : Union
C : Rename
D : Drop table
A : Column
B : Key
C : Row
D : Entry
A : Parent
B : Master
C : Sister
D : Child
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Tables
B : Queries
C : Relationships
D : Reports
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Memo
B : Number
C : Date/time
D : Hyperlink
B : Meta Language
A : 1NF
B : 2NF
C : 3NF
D : BCNF
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Superkey
B : Domain
C : Attribute
D : Schema
C : Domain degree

A : 1NF
B : 2NF
C : 3NF
D : 5NF
persist
A : Atomicity
B : Consistency
C : Integrity
D : Durability
Q.no 58. A functional dependency of the form x —> y is trival if
A:y⊆x
B:y⊂x
C:x⊂y
D : x ⊂y and y⊂ x
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
must:
Q.no 2. In an Entity-Relationship Diagram “Diamonds” represents__________________
A : Attributes
C : Weak entity set
A : DML
C : DDL
D : View
A : Data integrity
C : Database schema
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
B : Join dependency
D : not defined

relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
Q.no 13. In which state one gathers and list all the necessary fields for the
database design project.
D : Data deletion
Class table?
collection.
B : Count(*)
C : Avg
D : Sum
A : Top-down method
D : Tree structure
B : The end user
C : Client
D : DBA
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
A : Failed
B : committed
D : rolled back.
except________
A : Users.
B : Separate files
C : Database.

used.
A : Group by
B : having
C : select
D : where
A : Data integrity
B : Single value
C : Aggregate value
D : Tables
A : Direct
B : Hash
C : Random
D : Sequential
A : Row
B : Column
C : Table
D : Attribute
A : Instance
B : Schema
C : Structure
D : Primary key
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Column
B : Key
C : Row
D : Entry

A : First
B : Second
C : Third
D : Fourth
Q.no 34. NULL is__________.
D : Not a value
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
B : Naïve user
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Select
B : Union
C : Rename
D : Drop table
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
B : Difference
C : Product
D : Intersection
A : Attribute
B : Tuple
C : Field
D : Instance
A : Join
B : Self Join
C : Outer Join
D : Equi Join
specific criterion
A : Form
B : Query
C : Macro
D : Report
A : Parent
B : Master
C : Sister
D : Child
A : Tables
B : Rows
C : Relations
D : Attributes
A : DBMS
B : RDBMS
C : Database
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple


A : First
B : Second
C : Third
D : Fourth
relationship?
A : PROJECTION
B : SELECTION
C : UNION
D : JOIN
includes

B : Data isolation
D : Data redundancy
A : Superkey
B : Domain
C : Attribute
D : Schema
B : S1 is true
C : S2 is true

A : except
B : exists
C : not in
D : in
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
B : Join dependency
A : Table
B : . Schema
C : Relation
D : Structure
A : Unary Operator
C : Binary Operator
D : Not an operator

A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
A : Delete
B : Purge
C : Remove
D : Drop table
A : DML
C : DDL
D : View
B : Diamond
D : Dotted diamond

represents__________________
A : Attributes
C : Weak entity set
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Data integrity
C : Database schema
A : F+
B : F-
C : F*
D : F_

A : Tree structure
B : Plex Structure
D : Table Structure
B : Naïve users
D : Casual end user
A : conceptual
B : concrete
C : real
D : abstract
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
A : Failed
B : committed
D : rolled back.
B : The end user
C : Client
D : DBA

A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
B : Meta Language

A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Tables
B : Queries
C : Relationships
D : Reports
A : Table
B : Field
C : Record
D : Character
A : 1NF
B : 2NF
C : 3NF
D : BCNF

A : Select
B : Union
C : Rename
D : Drop table

A : First
B : Second
C : Third
D : Fourth
A : Join
B : Self Join
C : Outer Join
D : Equi Join
specific criterion
A : Form
B : Query
C : Macro
D : Report

A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Memo
B : Number
C : Date/time
D : Hyperlink
A : Instance
B : Schema
C : Structure
D : Primary key
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Parent
B : Master
C : Sister
D : Child
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
B : Naïve user
A:y⊆x
B:y⊂x
C:x⊂y
is this ?
A : DML
B : DDL
C : View
A : 1NF
B : 2NF
C : 3NF
D : 5NF
A : Active
B : aborted
C : Committed
must:
A : Atomicity
B : Consistency
C : Integrity
D : Durability
C : Domain degree

B : Data isolation
D : Data redundancy
D : not defined

used.
A : Group by
B : having
C : select
D : where
Class table?
design project.
D : Data deletion

A : except
B : exists
C : not in
D : in
B : Single value
C : Aggregate value
D : Tables
A : Unary Operator
C : Binary Operator
D : Not an operator
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator

A : Data integrity
except________
A : Users.
B : Separate files
C : Database.
collection.
B : Count(*)
C : Avg
D : Sum
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
B : Join dependency
A : Table
B : . Schema
C : Relation
D : Structure
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Top-down method
D : Tree structure
A : Failed
B : committed
D : rolled back.
A : F+
B : F-
C : F*
D : F_
B : Naïve users
D : Casual end user
A : Row
B : Column
C : Table
D : Attribute
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Attribute
B : Tuple
C : Field
D : Instance
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : Deletion
B : Insertion
C : Sorting
D : Updating
B : Meta Language
A : DBMS
B : RDBMS
C : Database
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
Q.no 36. NULL is__________.
D : Not a value
A : Column
B : Key
C : Row
D : Entry
A : Direct
B : Hash
C : Random
D : Sequential

A : Tables
B : Rows
C : Relations
D : Attributes
B : Difference
C : Product
D : Intersection
A : Join
B : Self Join
C : Outer Join
D : Equi Join
A : Tables
B : Queries
C : Relationships
D : Reports
A : Memo
B : Number
C : Date/time
D : Hyperlink
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : 1NF
B : 2NF
C : 3NF
D : BCNF
B : Naïve user

specific criterion
A : Form
B : Query
C : Macro
D : Report
A:y⊆x
B:y⊂x
C:x⊂y
A : PROJECTION
B : SELECTION
C : UNION
D : JOIN

relationship?
B : S1 is true
C : S2 is true
persist

includes
A : Superkey
B : Domain
C : Attribute
D : Schema
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)

D : not defined
A : Data integrity
C : Database schema
A : Delete
B : Purge
C : Remove
D : Drop table
A : Attributes
C : Weak entity set

A : conceptual
B : concrete
C : real
D : abstract
A : DML
C : DDL
D : View

used.
A : Group by
B : having
C : select
D : where
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
Class table?
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
B : Diamond
D : Dotted diamond
A : Tree structure
B : Plex Structure
D : Table Structure
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
B : The end user
C : Client
D : DBA
A : Top-down method
D : Tree structure
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : Data integrity
B : Single value
C : Aggregate value
D : Tables
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Attribute
B : Tuple
C : Field
D : Instance

A : First
B : Second
C : Third
D : Fourth
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Instance
B : Schema
C : Structure
D : Primary key
A : Deletion
B : Insertion
C : Sorting
D : Updating
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
A : Row
B : Column
C : Table
D : Attribute
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : Table
B : Field
C : Record
D : Character
A : Select
B : Union
C : Rename
D : Drop table
A : DBMS
B : RDBMS
C : Database
A : Groups
B : Table
C : Attributes
D : Switchboards

B : Meta Language
A : Parent
B : Master
C : Sister
D : Child
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Memo
B : Number
C : Date/time
D : Hyperlink
Q.no 47. NULL is__________.
D : Not a value
A : Direct
B : Hash
C : Random
D : Sequential
A : Join
B : Self Join
C : Outer Join
D : Equi Join
B : Naïve user
A : Atomicity
B : Consistency
C : Integrity
D : Durability

A : First
B : Second
C : Third
D : Fourth
must:
A : 1NF
B : 2NF
C : 3NF
D : 5NF
B : Data isolation
D : Data redundancy
A : Active
B : aborted
C : Committed
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
is this ?
A : DML
B : DDL
C : View
C : Domain degree
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
collection.
B : Count(*)
C : Avg
D : Sum
A : Failed
B : committed
D : rolled back.
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
B : Naïve users
D : Casual end user

design project.
D : Data deletion

except________
A : Users.
B : Separate files
C : Database.

B : Join dependency
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Table
B : . Schema
C : Relation
D : Structure
A : F+
B : F-
C : F*
D : F_
A : Unary Operator
C : Binary Operator
D : Not an operator
A : except
B : exists
C : not in
D : in
A : Data integrity
B : The end user
C : Client
D : DBA
A : conceptual
B : concrete
C : real
D : abstract
D : not defined
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name

represents__________________
A : Attributes
C : Weak entity set
A : Tables
B : Rows
C : Relations
D : Attributes

A : First
B : Second
C : Third
D : Fourth
A : 1NF
B : 2NF
C : 3NF
D : BCNF
A : Instance
B : Schema
C : Structure
D : Primary key
A : Attribute
B : Tuple
C : Field
D : Instance
B : Difference
C : Product
D : Intersection
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
A : Column
B : Key
C : Row
D : Entry
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
specific criterion
A : Form
B : Query
C : Macro
D : Report
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Tables
B : Queries
C : Relationships
D : Reports
A : Unary
B : Binary
C : Ternary
D : Quaternary
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
A : Row
B : Column
C : Table
D : Attribute
A : Memo
B : Number
C : Date/time
D : Hyperlink
Q.no 49. NULL is__________.
D : Not a value
A : Direct
B : Hash
C : Random
D : Sequential

includes
A:y⊆x
B:y⊂x
C:x⊂y
persist

A : PROJECTION
B : SELECTION
C : UNION
D : JOIN
A : Superkey
B : Domain
C : Attribute
D : Schema

B : S1 is true
C : S2 is true
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
A : Data integrity
C : Database schema

used.
A : Group by
B : having
C : select
D : where
A : Failed
B : committed
D : rolled back.
collection.
B : Count(*)
C : Avg
D : Sum
A : DML
C : DDL
D : View

A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Tree structure
B : Plex Structure
D : Table Structure
Class table?
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle

A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
A : Top-down method
D : Tree structure
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
A : Delete
B : Purge
C : Remove
D : Drop table
B : Diamond
D : Dotted diamond
B : Single value
C : Aggregate value
D : Tables
A : Table
B : . Schema
C : Relation
D : Structure

A : Unary Operator
C : Binary Operator
D : Not an operator
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table

A : First
B : Second
C : Third
D : Fourth
A : DBMS
B : RDBMS
C : Database
A : Select
B : Union
C : Rename
D : Drop table
A : Parent
B : Master
C : Sister
D : Child
A : Groups
B : Table
C : Attributes
D : Switchboards
B : Meta Language
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys

A : Tables
B : Rows
C : Relations
D : Attributes
A : Join
B : Self Join
C : Outer Join
D : Equi Join
B : Naïve user
A : Table
B : Field
C : Record
D : Character

A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
B : Difference
C : Product
D : Intersection
A : Tables
B : Queries
C : Relationships
D : Reports
A : Direct
B : Hash
C : Random
D : Sequential
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
specific criterion
A : Form
B : Query
C : Macro
D : Report
A : Instance
B : Schema
C : Structure
D : Primary key
A : Attribute
B : Tuple
C : Field
D : Instance
C : Domain degree
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF

A : First
B : Second
C : Third
D : Fourth
must:
B : Data isolation
D : Data redundancy
A : Active
B : aborted
C : Committed
relationship?
A : Atomicity
B : Consistency
C : Integrity
D : Durability
A : 1NF
B : 2NF
C : 3NF
D : 5NF
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : conceptual
B : concrete
C : real
D : abstract
design project.
D : Data deletion
A : Attributes
C : Weak entity set
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
D : not defined
B : The end user
C : Client
D : DBA
A : F+
B : F-
C : F*
D : F_
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
except________
A : Users.
B : Separate files
C : Database.
A : except
B : exists
C : not in
D : in
B : Join dependency
B : Naïve users
D : Casual end user
A : Data integrity
A : Failed
B : committed
D : rolled back.
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
collection.
B : Count(*)
C : Avg
D : Sum
A : Top-down method
D : Tree structure
B : Meta Language

A : First
B : Second
C : Third
D : Fourth
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
A : Select
B : Union
C : Rename
D : Drop table
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : 1NF
B : 2NF
C : 3NF
D : BCNF

A : Row
B : Column
C : Table
D : Attribute
A : DBMS
B : RDBMS
C : Database
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Deletion
B : Insertion
C : Sorting
D : Updating
Q.no 38. NULL is__________.

D : Not a value
A : Parent
B : Master
C : Sister
D : Child
A : Column
B : Key
C : Row
D : Entry
A : Memo
B : Number
C : Date/time
D : Hyperlink
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
B : Naïve user
A : Join
B : Self Join
C : Outer Join
D : Equi Join

A : Tables
B : Rows
C : Relations
D : Attributes
A : Instance
B : Schema
C : Structure
D : Primary key
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
B : S1 is true
C : S2 is true
is this ?
A : DML
B : DDL
C : View
A:y⊆x
B:y⊂x
C:x⊂y
A : PROJECTION
B : SELECTION
C : UNION
D : JOIN
persist
A : Superkey
B : Domain
C : Attribute
D : Schema
C : Domain degree
includes
A : Delete
B : Purge
C : Remove
D : Drop table
Class table?
A : Table
B : . Schema
C : Relation
D : Structure
A : Tree structure
B : Plex Structure
D : Table Structure
A : Data integrity
C : Database schema
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
A : DML
C : DDL
D : View
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
B : Single value
C : Aggregate value
D : Tables

used.
A : Group by
B : having
C : select
D : where
A : Unary Operator
C : Binary Operator
D : Not an operator
B : Diamond
D : Dotted diamond
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Top-down method
D : Tree structure
collection.
B : Count(*)
C : Avg
D : Sum
A : Failed
B : committed
D : rolled back.
A : except
B : exists
C : not in
D : in
except________
A : Users.
B : Separate files
C : Database.

A : Table
B : Field
C : Record
D : Character
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Select
B : Union
C : Rename
D : Drop table
A : Attribute
B : Tuple
C : Field
D : Instance
A : Direct
B : Hash
C : Random
D : Sequential
B : Difference
C : Product
D : Intersection
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
specific criterion
A : Form
B : Query
C : Macro
D : Report
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
A : 1NF
B : 2NF
C : 3NF
D : BCNF

A : First
B : Second
C : Third
D : Fourth
A : Tables
B : Queries
C : Relationships
D : Reports
B : Meta Language
A : Row
B : Column
C : Table
D : Attribute
A : Join
B : Self Join
C : Outer Join
D : Equi Join
A : Instance
B : Schema
C : Structure
D : Primary key
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Column
B : Key
C : Row
D : Entry

relationship?
B : Data isolation
D : Data redundancy
must:

A : Active
B : aborted
C : Committed
A : 1NF
B : 2NF
C : 3NF
D : 5NF
A : Atomicity
B : Consistency
C : Integrity
D : Durability

B : The end user
C : Client
D : DBA
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name

B : Naïve users
D : Casual end user
A : Delete
B : Purge
C : Remove
D : Drop table
A : Tree structure
B : Plex Structure
D : Table Structure
B : Join dependency
A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
A : F+
B : F-
C : F*
D : F_
Class table?
A : Data integrity
C : Database schema
D : Data deletion

A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
A : Table
B : . Schema
C : Relation
D : Structure

represents__________________
A : Attributes
C : Weak entity set
A : conceptual
B : concrete
C : real
D : abstract
A : DML
C : DDL
D : View
A : Data integrity

A : Tables
B : Rows
C : Relations
D : Attributes
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Parent
B : Master
C : Sister
D : Child
Q.no 29. NULL is__________.
D : Not a value

A : Memo
B : Number
C : Date/time
D : Hyperlink
B : Naïve user
A : DBMS
B : RDBMS
C : Database
A : Select
B : Union
C : Rename
D : Drop table
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Table
B : Field
C : Record
D : Character
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys

A : Attribute
B : Tuple
C : Field
D : Instance
specific criterion
A : Form
B : Query
C : Macro
D : Report
B : Meta Language
A : Direct
B : Hash
C : Random
D : Sequential
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Row
B : Column
C : Table
D : Attribute
A : Join
B : Self Join
C : Outer Join
D : Equi Join
A : Column
B : Key
C : Row
D : Entry

A:y⊆x
B:y⊂x
C:x⊂y
is this ?
A : DML
B : DDL
C : View
includes

A : PROJECTION
B : SELECTION
C : UNION
D : JOIN

A : First
B : Second
C : Third
D : Fourth
C : Domain degree
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF

A : Superkey
B : Domain
C : Attribute
D : Schema
persist
A : except
B : exists
C : not in
D : in
collection.
B : Count(*)
C : Avg
D : Sum

relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Failed
B : committed
D : rolled back.
D : not defined
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle

used.
A : Group by
B : having
C : select
D : where
A : Top-down method
D : Tree structure
B : Single value
C : Aggregate value
D : Tables
B : Diamond
D : Dotted diamond
A : Unary Operator
C : Binary Operator
D : Not an operator
A : F+
B : F-
C : F*
D : F_
A : Data integrity
C : Database schema
A : Delete
B : Purge
C : Remove
D : Drop table
except________
A : Users.
B : Separate files
C : Database.
B : Naïve users
D : Casual end user
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name

A : Data integrity
A : Memo
B : Number
C : Date/time
D : Hyperlink
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : Instance
B : Schema
C : Structure
D : Primary key
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
B : Naïve user
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
B : Difference
C : Product
D : Intersection

A : First
B : Second
C : Third
D : Fourth
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Tables
B : Rows
C : Relations
D : Attributes
A : Parent
B : Master
C : Sister
D : Child
A : Tables
B : Queries
C : Relationships
D : Reports
Q.no 42. NULL is__________.
D : Not a value
A : 1NF
B : 2NF
C : 3NF
D : BCNF
A : DBMS
B : RDBMS
C : Database
A : Row
B : Column
C : Table
D : Attribute
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Groups
B : Table
C : Attributes
D : Switchboards
A : Attribute
B : Tuple
C : Field
D : Instance
A : Active
B : aborted
C : Committed

B : Data isolation
D : Data redundancy
relationship?
A : 1NF
B : 2NF
C : 3NF
D : 5NF

B : S1 is true
C : S2 is true
A : Atomicity
B : Consistency
C : Integrity
D : Durability
persist
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle

A : except
B : exists
C : not in
D : in
Class table?
A : Table
B : . Schema
C : Relation
D : Structure
A : Tree structure
B : Plex Structure
D : Table Structure
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
B : The end user
C : Client
D : DBA
D : Data deletion
A : DML
C : DDL
D : View

A : Fixed, equal
B : Equal, variable
C : Fixed, variable
D : Variable, equal
A : conceptual
B : concrete
C : real
D : abstract
B : Join dependency
collection.
B : Count(*)
C : Avg
D : Sum

represents__________________
A : Attributes
C : Weak entity set
A : Mean(salary)
B : Avg(salary)
C : Sum(salary)
D : Count(salary)
D : not defined
A : Delete
B : Purge
C : Remove
D : Drop table
A : F+
B : F-
C : F*
D : F_
B : Naïve users
D : Casual end user
A : Top-down method
D : Tree structure
A : Failed
B : committed
D : rolled back.
B : Single value
C : Aggregate value
D : Tables
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Instance
B : Schema
C : Structure
D : Primary key
B : Meta Language
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
specific criterion
A : Form
B : Query
C : Macro
D : Report
design?
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF
A : Memo
B : Number
C : Date/time
D : Hyperlink
A : Direct
B : Hash
C : Random
D : Sequential
A : Select
B : Union
C : Rename
D : Drop table
file is called
A : SELECT
B : PROJECT
C : JOIN
D : PRODUCT
A : Join
B : Self Join
C : Outer Join
D : Equi Join
A : Column
B : Key
C : Row
D : Entry
B : Naïve user
database?
A : Create Table
B : Alter Table
C : Drop Table
D : Remove Table
A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Table
B : Field
C : Record
D : Character
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
A : DBMS
B : RDBMS
C : Database
B : Difference
C : Product
D : Intersection
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Tables
B : Queries
C : Relationships
D : Reports

A : First
B : Second
C : Third
D : Fourth
must:
A : Superkey
B : Domain
C : Attribute
D : Schema
includes
A : PROJECTION
B : SELECTION
C : UNION
D : JOIN
A : Active
B : aborted
C : Committed
C : Domain degree
dependencies
Fi —> F3,
F2 —> F4
(FI,F2) —> F5
A : 1 NF
B : 2 NF
C : 3 NF
D : BCNF

used.
A : Group by
B : having
C : select
D : where
design project.
D : Data deletion
B : Diamond
D : Dotted diamond
A : Tree structure
B : Plex Structure
D : Table Structure

except________
A : Users.
B : Separate files
C : Database.
A : DML
C : DDL
D : View
B : The end user

C : Client
D : DBA
A : except
B : exists
C : not in
D : in
A : Primary key
B : Secondary Key
C : Foreign Key
D : Candidate Key
A : Memory
B : Metadata
C : Spell Checker
D : Data Validator
A : Primary Key
B : Key Record
C : Unique Key
D : Field Name
Class table?
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
A : Unary Operator
C : Binary Operator
D : Not an operator
A : Data integrity
A : Data integrity
C : Database schema
A : Ellipse
B : Dashed ellipse
C : Rectangle
D : Triangle
relation?
A : Primary key
B : Secondary Key
C : Foreign key
D : Composite key
A : Groups
B : Table
C : Attributes
D : Switchboards

A : First
B : Second
C : Third
D : Fourth
A : Tuple.
B : Relation.
C : Attribute.
D : Degree.
A : Attribute
B : Tuple
C : Field
D : Instance
Q.no 31. NULL is__________.
D : Not a value
A : Tables
B : Rows
C : Relations
D : Attributes
B : Meta Language
A : Parent
B : Master
C : Sister
D : Child
A : 1NF
B : 2NF
C : 3NF
D : BCNF
A : Instance
B : Schema
C : Structure
D : Primary key
A : Unary
B : Binary
C : Ternary
D : Quaternary
A : Row
B : Column
C : Table
D : Attribute

A : Schema keys
B : Candidate keys
C : Domain keys
D : Attribute keys
A : Deletion
B : Insertion
C : Sorting
D : Updating
A : Tables
B : Queries
C : Relationships
D : Reports
A : Physical Level
B : Critical Level
C : Logical Level
D : View Level
specific criterion
A : Form
B : Query
C : Macro
D : Report
A : Memo
B : Number
C : Date/time
D : Hyperlink
on______
A : Key
B : Key revisited
C : Superset key
D : Tuple
B : Naïve user
A : Join
B : Self Join
C : Outer Join
D : Equi Join
A:y⊆x
B:y⊂x
C:x⊂y
is this ?
A : DML
B : DDL
C : View
A : 1NF
B : 2NF
C : 3NF
D : 5NF
persist
B : Data isolation
D : Data redundancy
includes
A : Active
B : aborted
C : Committed

Answer for Question No 1. is c
Answer for Question No 2. is a
Answer for Question No 4. is b
Answer for Question No 9. is d

























































Dbms Highlighted

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Dbms Highlighted

Uploaded by

Copyright:

Available Formats

Seat No -

Total number of questions : 60

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 2. In SQL ‘relation A contains relation B’ can be written as

A : Not exists B except A

C : Not exists A except B

Q.no 4. The users who use easy-to-use menu are called

A : Sophisticated end users

D : Casual end user

Q.no 5. The ______connective is used to test for absence of set membership.

Q.no 7. Data redundancy may lead to:

Q.no 9. If B is an attribute and A→B, Then B is said to be ________ by A.

Q.no 10. A ‘book’ is a_________type of entity.

Q.no 11. Which of the following is the structure of the Database?

Q.no 12. 4NF is designed to cope with :

C : Multi valued dependency

Q.no 15. In E-R Diagram derived attribute are represented by________.

Q.no 16. A data dictionary is a repository that manages _____

Q.no 17. To apply the aggregate function, to a group of set of tuples_______clause is

C : Doubly outlined rectangle

Q.no 19. A subschema expresses_________.

A : The logical view

B : The physical view

C : The external view

D : The internal view

Q.no 20. Hierarchical model is also called_________.

Q.no 21. The conceptual model is_________.

C : Dependent on both hardware and software

D : Independent of both hardware and software

Q.no 22. Key to represent relationship between tables is called

A : One class may have many teachers

B : One teacher can have many classes

C : One teacher can have one class

D : Many teachers may have many classes

Q.no 26. The natural join is equal to :

B : Combination of Union and Cartesian product

C : Combination of selection and Cartesian product

D : Combination of projection and Cartesian product

Q.no 27. A functional dependency is a relationship between or among:

Q.no 28. Which of the following is not Modiﬁcation of the Database

Q.no 29. The collection of interrelated data is called as:

Q.no 31. 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

Q.no 34. which of the following is not a database object?

Q.no 35. In SQL the statement select*from R,S is equivalent to_______.

A : Select * from R natural join S

B : Select * from R cross join S

C : Select * from R union join S

D : Select * from R inner join S

Q.no 36. Customer withdrawing money from ATM is an example of__________

Q.no 40. In domain relational calculus we create a variable for every________

Q.no 41. Which of the following are the properties of entities?

A : First Normal Form