Zion Technology and Business college

Department of computer science

Model exam targeted for exit exam preparations on Database systems course,

time allowed 1:10 hr

Name id sign

Read the following questions carefully and then choose the most appropriate answer from the
given alternatives.

1. What is a database?
a. Organized collection of information that cannot be accessed, updated, and managed
b. Collection of data or information without organizing
c. Organized collection of data or information that can be accessed, updated,
and managed
d. Organized collection of data that cannot be updated
2. Which of the following is not an example of DBMS?
a. MySQL c. IBM DB2
b. Microsoft Access d. Bing
3. What is information about data called?
a. Hyper data c. Meta data
b. Tera data d. Relations
4. One is not a Characteristics of Database Approach
a. Support of multiple views of the data
b. Dependency between programs and data
c. Self-describing nature of a database system
d. Data Abstraction
5. A set of concepts to describe the structure of a database, and certain constraints that
the database should obey
a. Data model c. data instance
b. Data operation d. data state
6. which one is correct about the two-tier Client-Server Architecture?
a. User Interface Programs and Application Programs run on the client side
b. Common for Web applications
c. encrypt the data at the server before transmission
d. database is another layer
7. The traditional storage of data organized by the customer, stored in separate folders in
filing cabinets is an example of type of ‘database’ management system.
a. Object-oriented database management system
b. Relational database management system
c. Network database management system
d. Hierarchical database management system

Page 1 of 4
 8. After groups have been established, SQL applies predicates in the clause,
allowing aggregate functions to be used.
a. Where b. Having c. Group by d. With
9. Each entity has the particular properties that describe it.
a. Values b. attributes c. records d. tuples
10. What does a foreign key combined with a primary key
create?
a. Network model between the tables that connect them
b. Parent-Child relationship between the tables that connects them
c. One to many relationships between the tables that connects them
d. All of the mentioned
11. A technique for producing a set of relations with desirable properties, given the
data requirements of an enterprise.
a. Functional dependency c. enterprise
b. Normalization d. none
12. Attributes whose values are based on the values of other attributes are known as
a. Composite c. Complex
b. Atomic d. Derived
13. The database design which shows the process of producing a description of
the implementation of the database on secondary storage.
a. Physical database design c. logical database design
b. Conceptual database design d. none
14. SELECT branchNo, AVG(salary) FROM Staff GROUP BY branchNo;
a. to find the average staff salary at one branch
b. to find the average staff salary at each branch
c. to find the all-staff salary at each branch
d. to sum up the average staff salary at each branch
15. SELECT * FROM PropertyForRent WHERE (type = ‘Flat’ OR rent > 500 OR rooms > 5);
which one is not true on this query?
a. the rooms attribute is not indexed
b. rent attribute is indexed
c. the WHERE clause were AND’ed together
d. projection is applied
16. Which of the following gives a logical structure of the database graphically?
a. Entity-relationship diagram
b. Entity diagram
c. Database diagram
d. Architectural representation
17. Which of the following is not a function of the database?
a. Managing stored data
b. Manipulating data
c. Security for stored data
d. Analysing code

Page 2 of 4
 18. Which of the following is not a fundamental operation in relational algebra?
a. Select b. project c. Assignment d. set difference
19. the relational model constraints are
a. Key integrity constraints
b. Domain constraints
c. Referential integrity constraints
d. All of them
20. INSERT operation may violate any of the constraints
a. Domain constraint c. referential integrity
b. Key constraint d. all
21. Which of the following is used to denote the selection operation in relational algebra?
a. σ b. π c. ∞ d. ∑
22. Which operation has not a direct impact to the changes of any transaction.
a. Insert c. Update
b. Retrieve d. Delete
23. In the phase,the system replays updates of all transactions by scanning the
log forward from the last checkpoint.
a. Repeating c. Replay
b. Redo d. Undo
24. During simultaneous execution, each operation should be performed
interleaved with the others, this maintains a database .
a. Consistency c. Concurrency
b. Atomicity d. Isolation
25. Rollback of transactions is normally used
to: c. Retrieve old records
a. Recover from d. Repeat a transaction
transaction failure
b. Update the transaction
26. The Dirty read problem is also known as: c. R-R Conflict
a. W-W Conflict d. None
b. W-R Conflict
27. A direct graph which represents the deadlock is c. Wait-for graph
called: d. Query graph
a. Cycle graph
b. Deadlock graph
28. Which transaction fail can consider the operation fail such as an integer division by zero
a. System crash c. Catastrophes
b. System error d. Disk error
29. A transaction state that corresponds to the transaction leaving the system is known as:
a. Active state c. Failed state
b. Committed state d. Terminated state
30. Checkpoints are a part of:
a. Recovery measure c. Concurrency measure
b. Security measure d. Authorization measure
31. One of the following is Not considered as the basic concurrency control techniques
a. Locking c. Deadlock prevention
b. Time stamping d. Optimistic method

Page 3 of 4
 32. Which of the following locks the item from changes but not from read?
a. Implicit lock c. Exclusive lock
b. Explicit lock d. Shared lock
33. Which ACID property assures that a transaction should not make its updates visible to
other transactions until it is committed
a. Atomicity c. Isolation
b. Consistency d. Durability
34. Among the schedules one is a schedule in which a transaction can neither read or write
an item X until the last transaction that wrote X has committed.
a. Cascadeless schedule c. Recoverable schedule
b. Strict schedule d. Serial schedule

Table 1:Answer sheet table

2. 9. 16. 23. 30.

3. 10. 17. 24. 31.

4. 11. 18. 25. 32.

5. 12. 19. 26. 33.

6. 13. 20. 27. 34.

7. 14. 21. 28.

Page 4 of 4