NOVEMBER 2012 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)
Answer ALL questions.
All questions carry equal marks.
Each answer should not exceed 50 words.

1. What do you meant by Tuple?

2. Expand SQL.

3. What is a week entity set?

4. Mention the functions of relational design.

5. What do you mean by Index?

6. What is join operation?

7. How to store data?

8. What is a Query?

9. Mention the various types of networks.

10. What is a directory?

 PART B — (5 × 5 = 25 marks)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.

11. Discuss the functions of domain calculus.

12. Write notes on Table inheritance.

13. Explain the various relational model.

14. Describe briefly about static organisation.

15. Write short notes on Query optimization.

16. How to implement atomicity property?

17. Write short notes on Hetrogeneous database.

PART C — (4 × 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.

18. Write an overview about introduction to database

system.

19. Explain various normalization levels in detail.

2 56715/PSC4N
20. Give detailed description about RAID
organisation.

21. Write detailed notes on Transaction management.

22. Discuss on database system architecture.

23. Write notes on MSSQL server.

————————

3 56715/PSC4N
 Ws18

NOVEMBER 2014 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10  1 = 10 marks)

Answer ALL questions.

1. Define schema.
2. What is candidate key?
3. Define atomic domain.
4. What is meant by nesting?
5. Define the term file.
6. What is skew?
7. Mention the states of transaction.
8. Write the phases in two phase locking protocol.
9. What is fine granularity parallelism?
10. What are the different forms of data
transparency?

PART B — (5  5 = 25 marks)

Answer any FIVE questions.

11. Write notes on set operations.
12. What are the different types of join? Explain.
 Ws18

13. Give a brief note on B tree index files.

14. Discuss on choice of evaluation plans.

15. How do you implement atomicity and durability?

16. Briefly describe about buffer management.

17. Write short notes on recovery and availability of

MSSQL server.

PART C — (4  10 = 40 marks)

Answer any FOUR questions.

18. Write an overview about relational model.

19. Explain decomposition using functional

dependencies in detail.

20. Explain briefly about file organization.

21. Describe in detail about query processing.

22. How to handle deadlock? Explain.

23. Write detailed notes on distributed databases.

———————

2 56715/PSC4N
NOVEMBER 2015 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10  1 = 10 marks)

Answer ALL questions.

1. Define query processor.

2. What is super key?

3. Define atomic domain.

4. What is the use of denormalization?

5. Define hash index.

6. What is meant by recursive partitioning?

7. Mention the states of transaction.

8. Expand ACID.

9. What is fine granularity parallelism?

10. What are the different forms of data transparency?

 PART B — (5  5 = 25 marks)

Answer any FIVE questions.

11. Write notes on views of data.

12. Discuss the features of domain relational calculus.

13. Describe multivalued dependencies.

14. Give a brief note on table inheritance.

15. Explain about dynamic hashing.

16. Discuss on buffer management.

17. Write short notes on directory systems.

PART C — (4  10 = 40 marks)

Answer any FOUR questions.

18. Explain the following :

(a) Nested queries
(b) Complex queries.

19. Give detailed description about Entity Relationship

design issues.

20. Explain decomposition using functional

dependencies in detail.

2 56715/PSC4N
21. Describe about query optimization.

22. Describe in detail about concurrency control.

23. Write notes on functions of Oracle.

——————

3 56715/PSC4N
APRIL 2012 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.

1. Define database.

2. What do you meant by schema?

3. What is an entity?

4. What is meant by inheritance?

5. Define file.

6. Expand RAID.

7. Mention the properties of transaction.

8. What is a transaction?

9. Define homogeneous database.

10. What do you meant by client server system?

 PART B — (5 × 5 = 25 marks)

Answer any FIVE questions.

11. Write notes on operations onset.

12. Discuss the features of tuple calculus.

13. Describe about multivalued dependencies.

14. Explain in brief object based databases.

15. Write short notes on query optimization.

16. Compare and contrast the functions and features

of hashing techniques.

17. Discuss on buffer management.

PART C — (4 × 10 = 40 marks)
Answer any FOUR questions.

18. Write an overview about relational model.

19. Explain the features of E-R model.

20. Give detailed description about storage and file

structure.

21. How to handle deadlock? Explain.

22. Illustrate on functions of oracle.

23. Write notes on distributed databases.

———————
56715/PSC4N 2
 WK 3

APRIL 2013 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.
All questions carry equal marks.

1. Define primary key.

2. What is meant by join dependency?

3. Define the term referential integrity.

4. Define Boyce codd Form in normalization.

5. What is hashing in file organization?

6. What do you meant by weak entity set?

7. Define atomicity.

8. What is transaction?

9. What are the different types of network available?

10. Define data anomalies.

 WK 3

PART B — (5 × 5 = 25 marks)
Answer any FIVE questions.
All questions carry equal marks.

11. Write short note on recursive queries.

12. Draw ER-diagram for Library Management
System.
13. Explain multi valued dependency in 4th NF.
14. What are the different types of relational calculus?
15. Write the application of database management
system.
16. Write short notes on dynamic hashing.
17. Explain relational data model with neat label
sketch.

PART C — (4 × 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.

18. Explain about query processing with example.

19. Explain the terms, with example

(a) Serializability
(b) Persistent.

20. Discuss about buffer management in database.

2 56715/PSC4N
 WK 3

21. Explain MS SQL Server.

22. Explain homogenous database with neat label

sketch.

23. Explain tuple relational calculus with necessary

example.

–—————————

3 56715/PSC4N
 Ws3

APRIL 2014 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.

1. What is surrogate key and foreign key?

2. Define composition attribute.

3. What is deadlock?

4. Define redundant data.

5. Define partial dependency.

6. What is heterogeneous distributed database?

7. What do you mean by recovery schema?

8. Define RAID

9. What is an entity set?

10. Define the term speed up and scale up.

 Ws3

PART B — (5 × 5 = 25 marks)

Answer any FIVE questions.

11. Write short notes on Serializability.

12. Illustrate how the recovery system is achieved in

database.

13. Distinguish between static and dynamic hashing.

14. With example discuss the query optimization.

15. Draw ER-diagram for bank management system

16. Discuss the types of inheritance in SQL.

17. Write the features of relational database design.

PART C — (4 × 10 = 40 marks)

Answer any FOUR questions.

18. Explain the architecture of parallel system in

database.

19. Explain the file organization in detail.

20. Discuss the different RAID levels.

2 56715/PSC4N
 Ws3

21. Explain various types of functional dependencies

with example.

22. With example discuss on relational calculus.

23. Discuss the following

(a) Persistent
(b) Strong entity set.

———————————

3 56715/PSC4N
 wk ser

APRIL 2015 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10  1 = 10 marks)

Answer ALL questions.

1. What is database instance?

2. What is embedded SQL?

3. State the features of entity set.

4. List out the functions of object–oriented database

systems.

5. Mention the various levels of RAID.

6. Define transaction.

7. What do you mean by recovery scheme?

8. Define the term speed up.

9. How to distribute database?

10. Mention the functions of oracle.

 wk ser

PART B — (5  5 = 25 marks)

Answer any FIVE questions.

11. Discuss on data abstraction.

12. Describe about various kinds of views.

13. With an illustration explain the entity relationship

model.

14. What do you mean by functional dependencies?

Discuss.

15. Write notes on B-tree index files.

16. Write notes on conflict serializability.

17. Describe on data servers.

PART C — (4  10 = 40 marks)

Answer any FOUR questions.

18. Give detailed description about tuple relational

calculus.

19. Write an overview on the following :

(a) Lossless decomposition

(b) Table inheritance.

2 56715/PSC4N
 wk ser

20. Write detailed notes on multivalued dependencies.

21. Describe about file organization.

22. Write notes on MSSQL server.

23. Discuss about deadlock detection and prevention.

———————

3 56715/PSC4N
 WK 14

APRIL 2016 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.

1. Define the term database.
2. What is meant by data independence?
3. Define the term Entity.
4. What is called redundant storage?
5. Expand RAID.
6. List any two types of storage device.
7. List out two operations in database transaction.
8. What are ACID properties?
9. What is called homogeneous data?
10. Expand RPC.

PART B — (5 × 5 = 25 marks)

Answer any FIVE questions.

11. Write short notes on tuple relational calculus.
12. Explain types of mapping cardinalities with
examples.
 WK 14

13. What is an embedded SQL? Explain with an

example.

14. Explain query processing.

15. Write short notes on dynamic hash indexing.

16. Explain about serializability.

17. Write short notes on distributed database.

PART C — (4 × 10 = 40 marks)

Answer any FOUR questions.

18. What are the aggregate functions that SQL offers?

Explain them with suitable examples.

19. Describe multivalued dependencies.

20. Explain in detail about ER diagram with example.

21. Describe static hashing and dynamic hashing.

22. Explain in detail about ACID properties.

23. Briefly explain about buffer management.

———————

2 56715/PSC4N
 Ws 17

NOVEMBER 2013 56715/PSC4N

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.

1. Define database instance.

2. What is candidate key?

3. Define atomic domain.

4. What is meant by unnesting?

5. Define hash index.

6. What is average latency time?

7. Mention the states of transaction.

8. Write the phases in two phase locking protocol.

9. What is fine granularity parallelism?

10. What are the different forms of data

transparency?
 Ws 17

PART B — (5 × 5 = 25 marks)

Answer any FIVE questions.

11. Describe the structure of relational databases.

12. What are the different types of join? Explain.

13. Discuss the features of relational design.

14. Give a brief note on B tree index files.

15. How do you implement atomicity and durability?

16. Discuss on deadlock handling.

17. Write short notes on recovery and availability of

MSSQL server.

PART C — (4 × 10 = 40 marks)

Answer any FOUR questions.

18. Give a brief note on tuple relational calculus.

19. Explain decomposition using functional

dependencies in detail.

2 56715/PSC4N
 Ws 17

20. Explain briefly about file organization.

21. Briefly describe about query processing.

22. Describe in detail about serializability.

23. Write detailed notes on distributed databases.

———————————

3 56715/PSC4N