Showing posts with label RELATIONAL DATABASE MANAGEMENT SYSTEM - RDBMS Papers. Show all posts
Showing posts with label RELATIONAL DATABASE MANAGEMENT SYSTEM - RDBMS Papers. Show all posts

Saturday, March 22, 2008

Oracle All Interview Questions and Answers

Free Latest and previous Oracle Interview Questions Resources:

Typical Oracle Questions - 7

Oracle PL, SQL, mysql interview questions - 6

Oracle Database Latest Interview Questions - 5

Oracle SQL Technical Interview Recent Questions - 4

Oracle DBA / DBMS post Interview Questions with Detailed Solutions - 3

Oracle Recent Database DBMS Interview 2008 Questions - 2

Oracle Interview Questions

Also See all Oracle All Recent and Previous Papers

Keep watching out for more Oracle Latest Interview Question Placement Papers for year 2007 and 2008 all months for leading companies infosys, wipro, ibm, microsoft, cisco, dell, ebay, sap, oracle, peoplesoft, hcl, quark, ramco, l.t, satyam computers, accenture, cognizant, T-Systems, IFlex, KPO, BPO companies, IT, ITES companies in India, uk, usa, us - phillipines, china, hungary Freshers Graduates Placement Jobs. See Previouspapers.blogspot.com

Monday, February 11, 2008

RELATIONAL DATABASE MANAGEMENT SYSTEM - RDMS Paper 2

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.

RELATIONAL DATABASE MANAGEMENT SYSTEM - RDMS Paper 1

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 RELATIONAL DATABASE MANAGEMENT SYSTEM

RELATIONAL DATABASE MANAGEMENT SYSTEM
(B.Tech 5th Semester,2052)
Time : 3 Hours Maximum Marks : 60
NOTE:- This paper consist of Three Sections. Section A is compulsory. Do any Four questions from
Section B and any two questions from Section C

Section-A Marks : 20
1(a) What are the major differences between a file processing system and a DBMS ?
(b) Explain the difference between Physical and Logical Data Independence.
(c) Wha tare the main functions of a data base administrator ?
(d) Explain the difference between a weak and strong entity set.
(e) Define the concept of Aggegation with the help of example.
(f) Describe the difference between Relation nad Relation scheme.
(g) What are the main advantages of Distributed database ?
(h) What are the various types of locks available to Control Concurrency ?
(i) What do you understand by Serializable Schedule ?
(j) Why are three types of data Decription needed?
Section-B Marks:5 Each
2. Explain why 4 NF as a normal form more desirable than BCNF with the help of example.
3. Explain the term DML with the help of suitable example.
4. Discuss the Secuirty Model to provide Authorization to various Authenticated Users.
5. What are triggers ? How can they help in bulding Robust Database?
6. Discuss various Data Recovery Techniques in brief.
Section-C Marks : 10 Each
7. Explain Merge-Join Algrothim with the help of suitable example.
8. Consider the following Relational Database:
Empolee (EMP_Name, Street, City)
Works(EMP_Name, Company_Name, Salary)
Company(Comapny_Name, City)
Manages (EMP_Name,Manager_Name)
For each of the following quires, give an expression in the Relational Algebra, Tuple Realtional Calculus.
(a) Find the names of all Employees who work for Satyam.
(b) Find the names and cities of Residence who work for Satyam.
(c) Find the names of all Employees who live in the same city as the company for which they work.
(d) Find the names of all Employees who do not work for Satyam.
(e) Find the names of all Employees who live in the same city and on the same street as do their Managers.
9. Writ short note on the following:
(a) 4 GL's forms Management and Report Writers.
(b) Object Oriented Databases.
(c) E-R Model.