Exam Details

Subject dbms
Paper
Exam / Course m.sc. computer science
Department
Organization solapur university
Position
Exam Date November, 2016
City, State maharashtra, solapur


Question Paper

Master of Science II (Computer Science)
Examination: Oct/Nov 2016 Semester II (Old CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR SC
315
Thursday
24/11/2016
10:00 A.M
to
01:30 P.M
DBMS
C
VIII
Instructions: Q.No.1 and 2 are compulsory.
Answer any three questions from Q.No.3 to Q.No.7.
All questions carry equal marks.
Marks:70
Q.1 Select correct alternatives: 10
Data independence means
Data is defined separately and not included in programs.
Programs are not dependent on the physical attributes of data.
Programs are not dependent on the logical attributes of data.
Both and
If a relation is in 2NF, then
Every candidate key is a primary key.
Every non-prime attribute is fully functionally dependent or each relation
key.
Every attribute is functionally independent.
Every relation key is a primary key.
E-R model uses this symbol to represent weak entity set.
Dotted rectangle Diamond
Doubly outlined rectangle None of these
Which data management language component enabled the DBA to define the
schema components?
DML Subschema DLL
Subschema DLL All of the above
A function that has no partial functional dependencies are in form.
3NF 2NF
4NF BCNF
It is possible to define a schema completely by using
VDL and DDL DDL and DML
SDL and DDL VDL and DML
In SQL, which command is used to select data in rows and column from one
or more tables?
Choose Select
List Browse
A database management system
Allows simultaneous access to multiple files.
Can do more than a record management system.
Is a collection of programs for managing data in a single file.
Both and
Page 1 of 2
The hierarchical database is implemented as
Table Array
List Tree
10) The defines the way of connecting a relating two or more entities
together.
Relationship Connectivity
Robustness None of these
State True or false: 04
In a distributed database storage devices are not all attached to a common
CPU.
A concurrency control algorithm ensures that transactions execute
atomically.
An entity is said to be weak entity when its existence is dependent on other
entity.
The physical storage determines how the data is appeared to the user.
Q.2 Write short notes on the following: 08
Indexes in SQL
ii) Serialization

Answer the following: 06
Explain in brief the structure of relational database.
ii) Explain the use of primary key and foreign key in brief.
0
Q.3 Answer the following:
What is meant by data model? Explain object based logical model. 07
Explain in brief the concept of distributed database. 07
Q.4 Answer the following:
Explain the various techniques used for database recovery. 07
Explain the steps involved in Query processing with suitable diagrams. 07
Q.5 Answer the following:
Define relational calculus? Explain tuple and domain relational calculus. 07
Explain Aggregate functions and character functions used in SQL. 07
Q.6 Answer the following:
Define DBMS. Explain various types of users of DBMS. 07
Explain the concept of specialization and generalization used in database
modeling.
07
Q.7 Answer the following:
Explain Concurrency control techniques with suitable example. 07
Explain the concept of data replication Fragmentation with example. 07


Subjects

  • .net technology
  • artifical intelligence
  • computer communication network
  • data mining and warehouse
  • data structures
  • dbms
  • digital image processing
  • distributed operating system
  • finite automata
  • internet of things
  • java programming
  • linux operating system (oet)
  • mobile computing
  • network security
  • numerical analysis
  • object oriented programming using c++
  • office automation (oet)
  • operating system
  • operations research
  • soft computing
  • software engineering
  • software testing
  • uml