MI0034 – DATABASE MANAGEMENT SYSTEM

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  help.mbaassignments@gmail.com

or

call us at : 08263069601

 

 

 

ASSIGNMENT

 

DRIVE SUMMER 2015
PROGRAM MBADS (SEM 3/SEM 5)MBAFLEX/ MBA (SEM 3)PGDISMN (SEM 1)
SUBJECT CODE & NAME MI0034 – DATABASE MANAGEMENT SYSTEM
BK ID B1966
CREDITS 4
MARKS 60

 

 

Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.

 

 

  1. 1. a. Database management system acts as intermediary agent between programs and the data. Explain various procedures carried on in a DBMS with example.

 

Answer:A Database Management System (DBMS) is basically a collection of programs that enables users to store, modify, and extract information from a database as per the requirements. DBMS is an intermediate layer

 

 

 

 

  1. List and explain the properties of DBMS

 

Answer: There are a lot of database software manufacturers out there and a wide range of prices, sizes, speeds and functionalities. At the lower end of the scale are personal database software products like Microsoft Access, which is designed to be used by individuals or small companies relatively little data. User friendliness and

 

 

 

 

 

  1. 2. Explain the following terminology with an example

 

  1. Domain

 

Answer:Domain knowledge is valid knowledge used to refer to an area of human endeavour, an autonomous computer activity, or other specialized discipline.  Specialists and experts use and develop their own domain knowledge. If the concept domain knowledge or domain expert is used, we emphasize a specific domain which is an object of the discourse/interest/problem.

 

 

 

 

  1. Degree of relation

 

Answer: The degree of relationship (also known as cardinality) is the number of occurrences in one entity which are associated (or linked) to the number of occurrences in another.

 

There are three degrees of relationship, known as:

 

one-to-one (1:1)

one-to-many (1:M)

 

 

 

 

  1. Entity set

 

Answer: Entities and Entity Sets

 

  • An entity is an object that exists and is distinguishable from other objects. For instance, John Harris with S.I.N. 890-12-3456 is an entity, as he can be uniquely identified as one particular person in the universe.

 

  • An entity may be concrete

 

 

 

 

  1. Primary key

 

Answer: A primary key is a field in a table which uniquely identifies each row/record in a database table. Primary keys must contain unique values. A primary key column cannot have NULL values.

 

A table can have only one primary key, which may consist of single or multiple fields. When multiple fields are used as a primary key, they are called a composite key.

 

 

 

 

  1. tuple

 

Answer: A tuple is a finite ordered list of elements. In mathematics, an n-tuple is a sequence (or ordered list) of n elements, where n is a non-negative integer. There is only one 0-tuple, an empty sequence. An n-tuple is defined inductively using the construction of an ordered pair. Tuples are usually written by listing the elements within parentheses “(\text{ })” and separated by commas; for example, (2, 7, 4, 1, 7)

 

 

 

 

  1. 3. Write short notes on :

 

  1. cardinality ratio

 

Answer: In database design, the cardinality or fundamental principle of one data table with respect to another is a critical aspect. The relationship of one to the other must be precise and exact between each other in order to explain how each table links together.

 

 

 

  1. participation constraints

 

Answer:In game theory, and particularly mechanism design, participation constraints or rational participation constraints are said to be satisfied if a mechanism leaves all participants at least as well off as they would have been if they hadn’t participated.  Unfortunately, it can frequently be shown that participation constraints are incompatible with other desirable properties of mechanisms for many purposes.  One kind

 

 

 

  1. 4. a. A WFF is constructed from one or more atoms connected via Boolean operators (AND, OR, NOT) and quantifiers. List the rules for WFF for all quantifiers.

 

Answer: The formation rules define the terms and formulas of first order logic. When terms and formulas are represented as strings of symbols, these rules can be used to write a formal grammar for terms and formulas. These rules are generally context-free (each production has a single symbol on the left side), except that the set of symbols may be allowed to be infinite and there may be many start symbols, for example the variables in the case of terms.

 

 

 

 

 

  1. What are free and bound variables?

 

Answer: In mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a free variable is a notation that specifies places in an expression where substitution may take place. Some older books use the terms real variable and apparent variable for free variable and bound variable. The idea is related to a placeholder (a symbol that will later be replaced by some literal string), or a wildcard

 

 

 

 

  1. 5. a. Describe two phase locking. Elaborate the terminologies used in two phase locking.

 

Answer: In databases and transaction processing, two-phase locking (2PL) is a concurrency control method that guarantees serializability.[1][2] It is also the name of the resulting set of database transaction schedules (histories). The protocol utilizes

 

 

 

 

 

  1. Elaborate advantages of Distributed database management systems

 

 

Answer: A distributed database is a database in which storage devices are not all attached to a common processing unit such as the CPU, controlled by a distributed database management system (together sometimes called a distributed database system). It may be stored in multiple computers, located in the same physical location; or may be dispersed over a network of interconnected computers. Unlike parallel systems, in which the processors are tightly coupled and constitute a single database system, a distributed database

 

 

 

  1. 6. a. What are the advantages in using object oriented database management systems (ODBMS) over relational database management systems.

 

Answer: An object database (also object-oriented database management system) is a database management system in which information is represented in the form of objects as used in object-oriented programming. Object databases are different from relational databases which are table-oriented. Object-relational databases are a hybrid of both approaches.

 

 

 

 

 

  1. What are the disadvantages of ODBMS

 

 

Answer:Schema Changes: In an OODBMS based application modifying the schema by creating, updating or modifying a persistent class typically means that changes have to be made to the other classes in the application that interact with instances of that class. This typically means that all schema changes in an OODBMS will involve a system wide recompile. Also updating all the instance objects within the database can take an extended period of time depending on the size of the database.

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  help.mbaassignments@gmail.com

or

call us at : 08263069601

 

Leave a Reply