Exam Details

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


Question Paper

M.Sc. (Semester (CBCS) Examination Mar/Apr-2018
Computer Science
DBMS
Time: 2½ Hours
Max. Marks: 70
Instructions: Question No. 1 and 2 are compulsory. Attempt any 3 questions from Q. no. 3 to Q. no. 7 Figures to the right indicate full marks.
Q.1

Choose correct alternatives.
10
The defines the way of connecting or relating two or more entities together.
Relationship
Connectivity
Robustness
None of these
The Entity Relationship model comes under.
Objet based logical model
Record based logical model
Physical data model
Semantic data model
A ensures that transactions execute atomically?
Integrity control algorithm
Local applications
Concurrency control algorithm
None of the above
Relational calculus is
Procedural language
Non-procedural language
Data definition language
High level language
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
A locked file can be
Accessed by only our user
Modified by users with the correct password
Is used to hind sensitive information
Both and
Which normal form is considered adequate for relational database design?
2 NF
3 NF
4 NF
BCNF
The functions and
Supported only by SQL
Supported only by QBE
Supported by both SQL and QBE
Supported by none
An entity set that does not have sufficient attributes to form a primary key is a
Strong entity set
Weak entity set
Simple entity set
Primary entity set
Page 2 of 2
SLR-UG-271
10) An index file is an example of
Sequential file
Main memory data block
Application of indices
None of the above

State following statements are True or False
04
The external view determines how the data are actually stored in some physical storage unit in the computer system.
Collection of related records is known as tuple
In a distributed database storage devices are not all attached to a common CPU.
A concurrency control algorithm ensures that transactions execute atomically.
Q.2

Write short notes on the following
08
Data Independence
Serialization

Explain the following terms?
06
Explain Log based recovery in brief.
Explain in brief advantages of Views in SQL?
Q.3
Answer the following

Explain the concept of distributed database.
07

Define DBMS. Explain advantages and disadvantages of DBMS.
07
Q.4
Answer the following

What is meant by Normalization? Explain 1 NF and 2 NF with suitable example.
07

Explain the concept of shadowing in database recovery.
07
Q.5
Answer the following.
07

Define Relational algebra. Explain fundamental relational algebraic operations.
07

Explain ACID properties of transaction with suitable example.
Q.6
Answer the following.

What is meant by entity sets? Explain the difference between strong entity sets and weak entity sets.
07

What is meant by database recovery? Explain the need for recovery.
07
Q.7
Answer the following.

Explain two ways of data fragmentation with example?
07

Explain aggregate functions and character functions used in SQL?
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