Subscribe

RSS Feed (xml)

Powered By

Skin Design:
Free Blogger Skins

Powered by Blogger

search topic

Tuesday, June 3, 2008

RELATIONAL DATABASE MANAGEMENT SYSTEM - RDMS Paper 2 interview-questions

Download FREE Computer Science Engineering (CSE Engg. Branch) Previous 5 Years solved Regular and Reappear Question Papers B.tech PTU Semester 5th(2007, 2006, 2005, 2004, 2003) and related Placement HR - Technical Interview Questions for subject DATABASE MANAGEMENT SYSTEMS - RDBMS

DATABASE MANAGEMENT SYSTEMS (CSE- 305) (New)
Time: 03 Hours
Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Four' questions from Section - B.
3) Attempt any Two questions from Section - C.
Maximum Marks: 60

Section - A

Q1)
a) Define the-term candidate key.
b) What is public key encryption?
c) What are heterogeneous databases?
d) What are weak entity sets?
e) What is data inconsistency?
f) Define the term atomic domain.
g) What is B- Tree indexing?
h) define the term relational algebra.
i) List any two non procedural programming' languages?
j) What are row triggers?

Sectfon - B

Q2) Explain how daugling types may arise and what problems they may cause?
Q3) Explain the difference between physical and logical data independence?
Q4) Suppose that we decompose the schema R = (A, B, C, D, E) into
(A, B, C) (A, D, E) .
show that this decomposition is a loss less -join decomposition' if the following set F of functional dependencies holds
A~BC,
CD~E,.
B~D,
E~A.
Q5) Construct an E.R 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.
Q6) Explain the concept of concurrency control based on Time stamp ordering.

Section - C

Q7) What is normalization? Explain various normal forms with the help of suitable examples.
Q8) Consider the following relational data.
employee (person-name, street, city)
works (person-name, company - name, salary)
company (company-name, city) .
manager' (person-name, manager-name)
Give an expression in relational algebra and SQE for the following queries. (a) Find the names of all employees who work for First Bank Corporation. (b) Find the company that has the most employees
(c) Find. the names of all employees who work for First Bank Corporation and earn more than $10000. .
(d) Find the company that has the smallest payroll
(e) Find names and cities of residences of all employees who work for First Bank Corporation.

Q9) Write short notes on the following:
(a) Nested Transactions.
(b) Granularity of data items.
(c) Cost base optimization.

No comments: