SRM University 2007 B.Tech Information Technology IT202-Data Base Management Systems - Question Paper

employee(person-name,street,city)
works(person-name,company-name,salary)
company(company-name,city)
manages(person-name,manager-name)
provide an expression in the relational algebra to express every of the subsequent queries:
a. Find the names of all employees who work for 1st Bank Corporation.
b. Find the names and cities of residence of all employees who work for 1st Bank Corporation.
c. Find the names of all employees who live in the identical city as the company for which they work.
d. Find the names of all employees who earn more than every employee of Small Bank Corporation.
e. Assume that the companies may be located in several cities.Find all companies located in every city in which Small Bank Corporation.


UNIT IV

Part-A

1. Define 1st normal form.
2. Give the pitfalls in relational database design.
3. Define superkey.
4. Define functional dependency.
5. list the two ways of using functional dependencies.
6. Define trivial functional dependencies.
7. What is meant by closure of a set of functional dependencies.
8. Define axioms or rules of inference.
9. What is meant by extraneous attribute?
10. Define 4 rules of Armstrong’s axioms.
11. What is meant Armstrong’s axioms?
12. Define canonical cover& provide its properties.
13. Define Decomposition. & provide its kinds.
14. Define lossy -join& lossless -join decomposition.
15. What is meant by dependency preservation?
16. What is meant by restriction of F to Ri?
17. What is meant by redundancy?
18. Define Boyce codd normal form (BCNF).
19. What is the time taken by BCNF decomposition algorithm?
20. Define 3rd normal form.
21. What is meant by 3NF synthesis algorithm?
22. Compare BCNF and 3NF.
23. Define 4NF.
24. Define multi valued dependency / tuple -generating dependencies.
25. Give the two ways of using multi valued dependencies.
26. Define join dependencies.
27. Define 5NF / Project-Join Normal form (PJNF).
28. Define domain-key normal form.
29. Define normalization.
30. Define universal relation.
31. Define unique-role assumption.
32. Define de-normalization.
33. Define cross tabs.
34. Give the restrictions of a multi valued dependency.
35. Define partial dependency.

Part-B

1. Explain what is meant by repetition of info and inability to represent info. discuss why every of these properties may indicate a bad relational-database design.
(or)
discuss pitfalls in Relational-database design.
2. List the three design goals for relational databases and discuss why every is desirable.
3. Explain why 4NF is more desirable than BCNF.
4. Define normal form. List the kinds of normal forms. discuss one NF.
5. Explain how to differentiate a good database design from a bad database design.
(or)
discuss Functional Dependencies.
6. Explain closure of attribute sets with algorithm. provide its uses.
7. Explain canonical cover with an example.
8. Discuss in detail the desirable properties of decompositon.
9. Explain BCNF in detail.
10. Explain 3NF in detail.
11. Explain 4NF with an algorithm in detail.


UNIT V

Part-A

1. Define flash memory.
2. Define log disk.
3. What is meant by log-based file system?
4. Define mirroring.
5. Define striping data. provide its kinds.
6. List the factors to be considered while choosing a RAID Level.
7. What is meant by hardware and software RAID systems?
8. Define hot swapping.
9. Define data dictionary or system catalog.
10. Define pointer swizzling. provide its kinds.
11. Define balanced tree.
12. Define a transaction.
13. List the needed properties of a transaction to ensure integrity of the data.
14. What is meant by cascading rollback?
15. Define concurrency control.
16. Write short notes on phantom phenomenon.
17. Briefly discuss crabbing protocol.
18. List the kinds of failure that may occur in a system.
19. Define locking protocol.
20. Define fuzzy checkpoint.
21. What is meant by Write-ahead-logging (WAL) rule?
22. Define swap space.
23. Define logical and physical logging.
24. What is a repeating history?
25. Write short notes on ARIES recovery algorithm.
26. Define data transparency.
27. Define distributed database.
28. Define Parallel database.
29. Define interquery parallelism.
30. Define intraquery parallelism.
31. Define cache coherency.
32. Define parallel aggregation.
33. Define query optimization.
34. What is meant by online index construction?
35. Define data parallelism.

Part-B

1. What is hashing? discuss the various Hashing techniques in detail.
2. Explain in detail the kinds of single-level ordered indexes.
3. Explain locking techniques for concurrency control.
4. Explain concurrency control based on Timestamp ordering and Multiversion concurrency techniques.
5. Explain B+-tree index file organization.
6. Compare ordered indexing and hashing.
7. Explain the distinction ranging from closed and open hashing. explain the relative merits of every technique in database applications.
8. Explain the distinction ranging from the terms serial schedule and serializable schedule.
9. List the ACID properties. discuss the usefulness of every.
10. Explain any 2 principal methods for dealing methods for dealing with the deadlock issue.
11. Explain in detail ARIES recovery method.
12. Discuss the shadow-paging recovery scheme.
13. Explain the difference ranging from the three storage kinds – volatile, nonvolatile and stable – in terms of I/O cost.
14. Discuss the relative advantages of centralized and distributed databases.
15. Describe how LDAP can be used to give multiple hierarchial views of data, without replicating the base level data.

Earning:   Approval pending.