FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download JNTUA MCA 2019 May Reg-Supply 3rd Sem 17F00301 Database Management Systems Question Paper

Download JNTU Anantapur (JNTU Anantapur) Master of Computer Applications (MCA) 2019 May Reg-Supply 3rd Sem 17F00301 Database Management Systems Previous Question Paper

This post was last modified on 28 July 2020

JNTUA MCA 3rd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)


FirstRanker.com

Firstranker's choice

Code: 17F00301

--- Content provided by⁠ FirstRanker.com ---

FirstRanker.com

MCA II Semester Supplementary Examinations May 2019

DATABASE MANAGEMENT SYSTEMS

(For 2017 admitted batches only)

Time: 3 hours Max. Marks: 60

--- Content provided by⁠ FirstRanker.com ---

Answer all the questions

  1. (a) With help of a neat block diagram, explain the basic architecture of a database management system.
  2. (b) What are the functions of database administrator?

OR

  1. Construct an ER diagram for a car insurance company whose customers own one or more cars each. Each car has associated with it zero to any number of recorded accidents. Each insurance policy covers one or more cars, and has one or more premium payments associated with it. Each payment is for a particular period of time, and has an associated due date, and the date when the payments was received.
  2. --- Content provided by‌ FirstRanker.com ---

  1. Discuss the correspondence between the ER model construct and the relational model constructs.
  1. Explain selection, projection and Cartesian product operations in relational algebra with example.
  1. Exemplify the ideas of Domain Relational Calculus with different kind of examples.

OR

  1. Assume the following table:

    --- Content provided by‍ FirstRanker.com ---

    Degree (degcode, name, subject)
    Candidate (seatno, degcode, name, semester, month, year, result)
    Marks(seatno, degcode, semester, month, year, papcode, marks)
    Degcode-degree code, name- name of the degree (MSc, MCom)
    subject- subject of the course (eg.Physics), papcode- paper code (eg.A1)

    --- Content provided by‌ FirstRanker.com ---

    Solve the following queries using SQL:
    1. Write a SELECT statement to display all the degree codes which are there in the candidate table but not present in degree table in the order of degcode.
    2. Write a SELECT statement to display the names of all the candidates who have got less than 40 marks in exactly 2 subjects.
    3. Write a SELECT statement to display the names of all the candidates who have got highest total marks in MSc (Maths).
  1. Define a functional dependency. List and discuss any three inference rules for functional dependencies. Give relevant examples.
  2. --- Content provided by⁠ FirstRanker.com ---

OR

  1. Consider a relation R that has three attribute ABC. It is decomposed into relations R1 with attributes AB and R2 with attributes BC. State the definition of lossless-join decomposition with respect to this example. Answer this question concisely by writing a relational algebra equation involving R, R1 and R2.
  1. Describe about the multi-valued dependencies with suitable examples.

Contd. in page 2

FirstRanker.com

--- Content provided by FirstRanker.com ---

FirstRanker.com

  1. (a) Draw transaction state diagram and describe each state that a transaction goes through during its execution.
  2. (b) What is 2-phase locking protocol? How does it guarantee serializability?

OR

  1. (a) How does the system recovers from failure? Exemplify the steps involved in a recovery process with neat sketch?
  2. --- Content provided by⁠ FirstRanker.com ---

  3. (b) Write short notes on buffer management
  1. Define a B+ tree. Construct B+ tree to insert the following numbers (order of the tree is 3) 3, 2, 5, 7, 6, 23, 24, 35, 67, 44, 43, 42, 17, 18, 19. Show the tree at each insertion.

OR

  1. (a) What are Clustering Indexes? Discuss with example.
  2. (b) Compare extendible hashing and linear hashing with suitable examples.
  3. --- Content provided by‌ FirstRanker.com ---



This download link is referred from the post: JNTUA MCA 3rd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)

--- Content provided by​ FirstRanker.com ---