Database Management System Set 35
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 35
Q1 | An attribute is a(n):
- two dimensional table
- row of a table
- key of a table
- column of a table
Q2 | The method of access which uses key transformation is known as
- Direct
- Hashing
- Random
- Sequential
Q3 | The statement in SQL which allows to change the definition of a table is
- Create
- Alter
- Select
- Update
Q4 | This is not a date type in SQL Server 2000
- Char
- String
- Bigint
- Decimal
Q5 | Which of the following is NOT a basic element of all versions of the E-R model?
- Entities
- Relationships
- Attributes
- Primary key
Q6 | The SQL command to creating a table is:
- Make table
- Alter table
- Create table
- Define table
Q7 | ----------- is a virtual table
- Stored procedure
- View
- Table
- Rules
Q8 | The DROP TABLE statement:
- Deletes the table structure only
- Deletes the table structure along with the table data
- works whether or not referential integrity constraints would be violated
- is not an SQL statement
Q9 | The SQL statement to create a view is:
- CREATE VIEW
- MAKE VIEW
- SELECT VIEW
- INSERT VIEW
Q10 | Which of the following is NOT a type of SQL constraint?
- PRIMARY KEY
- FOREIGN KEY
- ALTERNATE KEY
- UNIQUE
Q11 | The following are functions of a DBMS except ________
- creating and processing forms
- processing data
- creating databases
- administrating databases
Q12 | What SQL structure is used to limit column values of a table?
- The LIMIT constraint
- The CHECK constraint
- The VALUE constraint
- None of the above is correct.
Q13 | Every time attribute A appears, it is matched with the same value of attribute B, but not the samevalue of attribute C. Therefore, it is true that:
- A → B
- A → C
- A → (B, C).
- (B,C) → A.
Q14 | The different classes of relations created by the technique for preventing modification anomaliesare called:
- Normal forms.
- Referential integrity constraints.
- Functional dependencies.
- None of the above
Q15 | A relation is in this form if it is in BCNF and has no multivalued dependencies:
- Second normal form.
- Third normal form
- Fourth normal form.
- Domain/key normal form.
Q16 | Row is synonymous with the term:
- Record
- Column
- Field
- Relation
Q17 | The primary key is selected from the:
- Composite keys
- Candidate keys
- Foreign keys
- Determinants
Q18 | Which of the following is a group of one or more attributes that uniquely identifies a row?
- Key
- Tuple
- Determinant
- Relation
Q19 | When the values in one or more attributes being used as a foreign key must exist in another set ofone or more attributes in another table, we have created a(n):
- Transitive dependency
- Insertion anomaly.
- Referential integrity constraint.
- Normal form
Q20 | A relation is considered a:
- Column
- One dimensional table
- Two dimensional table
- Three dimensional table
Q21 | In the relational model, relationships between relations or tables are created by using:
- Candidate keys
- Foreign keys
- Composite Keys
- Determinants
Q22 | A functional dependency is a relationship between or among:
- Tables
- Rows
- Relations
- Attributes
Q23 | Table is synonymous with the term:
- Record
- Column
- Field
- Relation
Q24 | Which of the following is not a restriction for a table to be a relation?
- The cells of the table must contain a single value.
- All of the entries in any column must be of the same kind.
- The columns must be ordered.
- No two rows in a table may be identical.
Q25 | For some relations, changing the data can have undesirable consequences called:
- Referential integrity constraints.
- Modification anomalies.
- Normal forms.
- Transitive dependencies.