Computer science students can study extra from here. Database Management Systems Mcqs are given below with answers. Students can be prepared for the upcoming test and will be able to learn some extra knowledge about computer.
At the end, answers to these questions are given.
1.Which normal form is considered adequate for relational database design?
(a) 2 NF
(b) 3 NF
(e) 4 NF
(d) BCNF
2. The concept of locking can be used to solve the problem of
(a) lost update
(b) uncommitted dependency
(c) inconsistent data
(d) deadlock
3.Given relations R(w,x) and S(y,z), the result of
SELECT DISTINCT w, x
FROM R, S
is guaranteed to be same as R, if
(a) R has no duplicates and S is non-empty
(b) R and S have no duplicates
(c) S has no duplicates and R is non-empty
(d) R and S have the same number of tuples
4.A functional dependency of the form X → Y is trivial if
(a) Y ⊆ X
(b) Y ⊂ X
(c) X ⊆ Y
(d) X ⊂ Y and Y ⊂ X
5.If every non-key attribute is functionally dependent on the primary key, then the relation will be in
(a) first normal form
(b) second normal form
(c) third normal form
(d) fourth normal form
6.The column of a table is referred to as the
(a) tuple
(b) attribute
(c) entity
(d) degree
7.Using relational algebra, the query that finds customers who have a balance of over 1000 is
(a) πcustomer_name (σBalance > 1000 (Deposit))
(b) σCustomer_name (πBalane. > 1000 (Deposit))
(c) πcustomer_name (σBalance > 1000 (Borrow))
(d) σcustomer_name (πBalance > 1000 (Borrow))
8.Which of the following queries finds the clients of banker Agassi and the city they live in?
(a) πclient.Customer_name. Customer-city (σClient.Customer-name-Customer.Customer-name(σBanker-name=*Agassi*(Client X Customer))
(b) πCustomer_name.Customer_city (σBanker-name=*Agassi*(Client X Customer))
(c) πClient.Customer_name.Customer_city (σBanker-name=*Agassi* (Client.Customer_name=Customer.Customer_name(Client X Customer))
(d) πCustomer_name.Cuscomer_City (σBanker_name=’Agassi* (Client x Customer))
9.Which of the following tuple relational calculus finds all customers who have a loan amount of more than 1200?
(a) ( t (Customer_name) | t ∈ borrow ∆ t(amount) > 1200)
(b) (t | t (Customer_name) ∈ borrow ∆ t(amount) > 1200)
(c) (t I З s ∈ borrow ( t (Customer_name) = s(Customer_name) ∆ s(amount) > 1200))
(d) None of the above
10.Which of the following Domain relational calculus finds all customers who have a loan amount of over 1200?
(a) (<c>| 3 b, 1, a (<b, 1, c, a> ∈ borrow V a > 12001)
(b) (<c>| 3 b, 1, a (<b, 1, c, a> ∈ borrow ∆ a > 1200))
(c) (<c>| 3 <b, 1, c, a> ∈ borrow ∆ a > 1200 ) )
(d) (<c>| <b, 1, c, a> ∈ borrow ∆ a > 1200))
11.Given the functional dependencies
X → W; X → Y; Y → Z and z → PQ which of the following does not hold good?
(a) X → z
(b) w → z
(c) x → WY
(d) None of the above
12.What are the potential problems when a DBMS executes multiple transactions concurrently?
(a) The lost update problem
(b) The dirty read problem
(c) The unrepeatable read problem
(d) Tbc phantom problem
13.The data flow model of an application mainly shows
(a) the underlying data and the relationships among them
(b) processing requirements and the flow of data
(c) decision and control information
(d) communication network structure
14.Consider the set of relations given below and the SQL query that follow,:
Students: (Roll_number. Name. Date_of_birth)
Courses: (Course_number, Coune_name, Instructor)
Grades: (Roll_number. Course_number. Grade)
SELECT DISTINCT Name
FROM Students, Courses, Grades
WHERE Students.Roll_number = Grades.Roll_number
AND Courses instructor = Korth
AND Courses.Course_number = Grades.Course_number
AND Grades.Grade = A
Which of the following sets is computed by the above query?
(a) Names of students who have got an A grade in all courses taught by Korth
(b) Names of students who have got an A grade in all courses
(c) Names of students who have got an A grade in at least one of the courses taught by Korth
(d) None of the above
15. Which of the following desired features are beyond the capability of relational algebra?
(a) Aggregate computation
(b) Multiplication
(c) Finding transitive closure
(d) None of the above
16. In airline reservation system, the entities are date, flight number, place of departure. destine-don, type of plane and seats available. The primary key is
(a) flight number
(b) flight number + place of departure
(c) flight number + date (d) flight number + destination
17. For a database relation R(a,b,c,d) where the domains of a,b,c, and d include only atomic values, only the following functional dependencies and those that can be inferred from them hold.
a → c
b → d The relation is in
(a) first normal form but not in second normal form
(b) second normal form but not in third normal form
(c) third normal form
(d) none of the above
50.Assume transaction A holds a shared lock R. if transaction 8 also requests for a shared lock on R. it will
(a) result in a deadlock situation
(b) immediately be granted
(c) immediately be rejected
(d) be granted as soon as it is released by A
Source link : https://books.google.com.pk/books?id=5tatBaRplIgC&pg