0% found this document useful (0 votes)
25 views6 pages

2019 (C) Comp 232

Uploaded by

didow36570
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views6 pages

2019 (C) Comp 232

Uploaded by

didow36570
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

KATHMANDU I.

JNIVERSITY Marks Scored:


End Semester Examination [C]
January,2019
Level : B.E. Course : COMP 232
Year : tI Semester: II
Exam Roll No. Time: 30 mins. F.M. : 10

Registration No. : Date JAN 0 1 201$


SECTION "A"
[20 Q.x 0.5
: l0 marks]
Pick the appropriate answer(s).

l. Double lines in a relationship set indicates


[ ] identifuing entity set linked to weak entity set
[ ] total participation of an entity in an relationship set
[ ] simply the relationship set
t I link attribute of relationship set to relationship set

2 In a system where automatic lock based protocol mechanism is implemented ,when a


transaction Ti issues a
_ operation, the system issues a lock-S(Q) instruction
followed by the instruction.
[ ] Read(Q) and Read(Q) [
] Read(Q) and Write(Q)
[ ] Write(Q) and Read(Q) [
] Write(Q) and Write(Q)

3. The function that an entity plays in a relationship is called that entity's


[ ]participation [ ]role [ ]activities [ ]association

4 A failed transaction can transit to the abort state will accept the following operation
except
[ ]restart [ ]kill
[ ]rollback [ ]partiallycommitted
5 We say that I and J conflict iff
t ] They are operation by different transactions on the same data item and one of them
instruction is write operation.
t ] They are operation by same transactions on the same data item and one of them
instruction is write operation.
I ] They are operation by different transactions on the different data item and one of
them instruction is write operation.
t ] They are operation by same transactions on the same data item and one of them
instruction is read operation.

6. In_ index an index entry appears for every search-key value in the file.
[ ]sparse [ ]dense [ ]multilevel [ ]btree
7. A relation schema is in the third Normal form with respect to the set F of functional
dependencies ilfor all dependencies in F+ of the form o,) p where
scR and FcR and at
least one of the following holds except
[ ] o)F is a trival functional dependency
[ ] o is also a super key for R
[ ] Each attribute A in p-o is contained in a candidate key for R
[ ] Single candidate key must contain all the attribute in p-o

8 To include integrity constraint in a existing relation use :


[ ] Create table [ ] Modifi, table [ ] Alter table [ ] Drop table
9 Locks placed by command are called
[ ]Implicit [ ]Explicit t tshared [ ] Exclusive
10. For each attribute of a relation, there is a set of permitted values, called the of
that attribute.
[ ]Domain [ ]Relation [ ]Set [ ]Schema
11 The number of attributes in relation is called as it's........
[ ]Cardinality [ ]Degree [ ]Tuple [ ]Entity
t2 Data integrity constraints are used to:
[ ] Control who is allowed access to the data
[ ] Ensure that duplicate records are not entered into the table
[ ] Improve the quality of data entered for a specific property (i.e., table column)
[ ] Prevent users from changing the values stored in the table

13. ODBC stand for


[ ] Object database Connectivity [ ] Oral database Connectivity
[ ] Oracle Database Connectivity [ ] Open database Connectivity
14. In ordered indices the file containing the records is sequentially ordered, a
is an index whose search key also defines the sequential order of the file.
[ ] Clustered index [ ] Structured index
[ ] Unstructured index [ ] Nonclustered index
15. A index, an index entry appears for only some of the search-key values.
[ ] Dense [ ]Sparse [ ]Straight [
]Continuous

t6. For every pair of transactions Ti and !, !


it appears to Ti that finished execution before
Ti started or ! started execution after Tt finished. This property is held by the term

[ ]Atomicity [ ]Consistency [ ]Isolation [ ]Durability


17. The operation allows us to find tuples that are in one relation but are not in
another.
[ ] Union [ ]Difference [ ]Rename [ ]Intersection
JAN 0 1 2013
18. In a growing two phase locking protocol one of the following statements is always true.
t ] A transaction may release locks but may not obtain any new locks.
t ] A transaction may obtain locks but may not release any locks.
t ] A transaction may obtain many locks and releases any locks.
t ] A transaction may not obtain any new locks and may not release any locks.
19. The assignment operator is denoted by
[ ]-> [ ]<- [ ]: [ ]::
20- The primary key for the binary relationship set can be chosen as the primary key of
either entity set in
[ ] one to one relationship [ ] many to one relationship
[ ] one to many relationship [ ] many to many relationship

-
KATHMANDU UNIVERSITY
End Semester Examination [C]
January,2019
iAN 0 1 2oi3
Level : B.E. Course : COMP 232
Year :II Semester: II
Time : 2 hrs. 30 mins. F.M. :40
SECTION "B"
[2Q.r8:16marks]
Answer ANY TWO questions

I Describe the term data model. Represent the following scenario with a suitable data
model.
An airline company wants to keep the track of the customers and their reservations,
flights, and their status, seat assignments on the individual flights, and the schedule and
routing of the future flights. For internal reporting it should reflect the tickets sale, year
and the destination and also the employee information that does the best sale. Your model
should include a complete description.

2. With the help of the relational schema below explain how the normalization of database
tables reduces the redundancy.

Grade_report(StudNo,StudName,(Major,Adviser, (CourseNo,Ctitle,InstrucName,
InstructLocn,Grade)))
Functional dependencies
StudNo -> StudName
CourseNo -> Ctitle,InstrucName
InstrucName -> Instruclocn
StudNo,CourseNo,Maj or -> Grade
StudNo,Major -> Advisor
Advisor -> Major

J Explain the working mechanism of database system internals with the neat and clear
diagrams.

SECTION "C"
I6Q. 4:24 marksl
'
Answer ANY SIX questions

4 What is the significance of the Cartesian product operation? Explain its anomalous result
with examples.

5 What is a Null value? Explain with example how do Null values are treated by
aggregation function in SQL.

6. Explain the anomalies and its solution that arise with the concurrent access of the
database systemwith examples.
7 Define integrity problem in maintaining record in file system? Explain how DBMS
resolves this issue.

8. What are the different parameters upon which the indexing mechanism can be judged?
Explain the significance of one parameter versus another.

9 What do you mean by serial schedule? Explain the importance of serialization in the
concurrent database system.

10. With the help of the schema describe below express the query(a,b) in SQL form.

Instructor(IDrname.dept_namersalary)
Section(course-idrsection_idrsemesterryearrbuildingrroom numrtime_slot_in)

a. Give a 5 percent salary raise to the instructors whose salary is less than average
salary.
b. Find all the courses taught in the fall2012 semester but not in spring 2013 semester

You might also like