X

RA210506 Data Base Management Systems B.Tech Question Paper : djriet.edu.in

Name of the College : Dasari Jhansi Rani Institute Of Engineering And Technology
University : JNTUK
Department : Computer Science And Engineering
Subject Code/Name : RA210506 – Data Base Management Systems
Year : 2008
Degree : B.Tech
Year/Sem : II/II
Website : djriet.edu.in
Document Type : Model Question Paper

Data Base Management Systems : https://www.pdfquestion.in/uploads/djriet.edu.in/2946-RA210506-DATA-BASE-MANAGEMENT-SYSTEMS-set1.pdf

DJRIET Data Base Management Systems Model Question Paper

II B.Tech II Semester Regular Examinations, Apr/May 2008 :
DATA BASE MANAGEMENT SYSTEMS :
( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering)
Time: 3 hours
Max Marks: 80

Related :  Dasari Jhansi Rani Institute Of Engineering & Technology Advanced Computer Architecture B.Tech Question Paper : www.pdfquestion.in/2934.html

Set – I

Answer any FIVE Questions :
All Questions carry equal marks :
1. (a) Define the concept of aggregation. Give an example of where this concept is useful.
(b) Explain the difference between a weak and a strong entity-set. [8+8]
2. (a) What is a relational database query? Explain with an example.
(b) Explain the following fundamental operations of relational algebra. select project set rename. [8+8]
3. (a) Explain the following.
i. Query Processing
ii. Pipelined evaluation
(b) For the following relational database, give the expressions in SQL. [8+4+4]
student (stuno, stuname, major,level,age)
Class(Classname, meets at, Room, fid)
Faculty(fid,fname,deptid)
i. Find the age of the oldest student who is either a history major or is enrolled in a course taught by I.Teach?


ii. Find the names of all classes that either meet in room R128 or have five or more students enrolled?
iii. Find the names of all students who are enrolled in two classes that meet at the same time?
iv. Find the names of faculty members who teach in every room in which some class in taught?
4. Explain the 4NF. Why is it useful? Explain with example [16]
5. (a) Define the concept of schedule for a set of concurrent transaction. Give a suitable example. [8]
(b) Explain read-only, write-only & read-before-write protocols in serialazability. [8]
6. (a) Explain how the index locking works in transaction taking sailor record. [8]
(b) With an example illustrate B+ tree locking scheme [8]
7. Define the term dangling pointer. Describe how the unique-id scheme helps in detecting dangling pointers in an object-oriented database. [16]
8. What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflows? [16]

Set – II

III B.Tech Supplimentary Examinations, Aug/Sep 2008
Management Science
( Common to Mechanical Engineering, Computer Science & Engineering, Chemical Engineering, Information Technology, Metallurgy & Material Technology, Electronics & Computer Engineering and Production Engineering)
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. (a) What is the need for designing an organization?
(b) Is there any link between ‘management’ and ‘organization’? Explain. [6+10]
2. (a) What is organizational chart?
(b) What is importance in Preparing organisation chart
(c) Give any Three different examples [6+5+6]
3. (a) What do you understand by plant layout.
(b) What is its importance? [8+8]
4. (a) What are the factors that determine the choice of channels of distribution?
(b) Why do manufacturers favour intermediaries. [8+8]
5. Discuss in detail the objectives and functions of Human Resource Management? [16]

6. Explain the following concepts with appropriate examples.
(a) Job description
(b) Job specification
(c) Job enrichment
(d) Job requirement. [4×4]

7. Identify the factors that are to be diagnosed in external and internal environment of a business organization. [16]
8. Define the terms slack, float, EST, EFT, LFT, LST. Explain with an example of your choice. [16]

Anusha:
www.pdfquestion.in © 2022 Contact Us   Privacy Policy   Site Map