Identify advantage and disadvantage of Sparse Index.Occupies less space than dense indexSlower than dense index for locating the recordsLow overhead during insertion and deletion

1 List four significant differences between a file-processing system and a DBMS. 2 Differentiate between the dense index and sparse index. 3 Explain DDL and DML commands with suitable examples. 4 Consider a relation schema R(X Y Z W P) is decomposed into R1(X Y) and R2 (Z W). Determine, whether the above R1 and R2 are Lossless or Lossy? 5Explain ACID properties of a transaction. .6 i. In order to perform a sequential search on ordered and unordered records the average number of blocks that require searching is b/2 where b is the total number of blocks. Justify with suitable example. On ordered records the search operation can be made efficient by using a different algorithm. Discuss the algorithm and justify why is this a better approach? ii. Construct B+ tree for the following elements with order=3 5, 15, 25, 30, 45, 60, 18, 28 7 A. Write Relational Algebra queries for the following schema: Instructor (ID, name, dept_name, salary) Teaches (ID, course_id, sec_id, semester, year) Course (course_id, Title, Fee, credits) I. II. III. Find the names of all instructors together with the course id of all courses they taught. Find the names of all instructors in the Physics department together with the course id of all courses they taught. Find the names of all instructors in the Comp. Sci. department together with the course titles of all the courses that the instructors teach. B. Convert following SQL in to relational algebra: i. SELECT movieTitle FROM StarsIn, MovieStar WHERE starName = name AND birthdate = 1960 ii. (SELECT name, address from MovieStar) EXCEPT (SELECT name, address from MovieExec) 8 i. Explain different types of anomalies with suitable example. ii. Given a relation R ( A, B, C, D) and Functional Dependency set FD = {AB → CD, B → C}, determine whether the given R is in 2NF? 9 i. Illustrate the structure of distributed database and discuss the various types of data fragmentation schemes. ii. Discuss the various type constructors used in Object Oriented database. Explain what primary characteristics an OID should possess. 10 i. Explain, what is a schedule? Define the concepts of recoverable, cascade less, and strict schedules, and compare them in terms of their recoverability. 11 i. 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. ii. If, no attribute has the capability to become a primary key in a relation, how you will ensure entity integrity constraint? Explain with suitable example and write SQL query for ensuring it. iii. a. 12 Compare Following (with suitable example): Primary key and Unique key b. iv. Describe three–schema architecture and explain the role of physical Multivalued attribute and Composite attribute data independence and logical data independence.

A single-level ordered index where the index points to  individual records  rather than  blocks of data    is known as:  *1 pointA. Dense indexB. Sparse indexC. Primary indexD. Secondary index

Consider the following scenario: • A table is sorted on indexed column and has 10,000,000 rows. • Each row is 200 bytes. • Table and index blocks are 4 kilobytes. • Assume 1 kilobyte is approximately 1,000 bytes.Assuming the index is sparse, how many entries are in the index?

A significant benefit to using an index to hold and sort keys to a file is:Question 10Select one:a.Smaller keys require less I/Ob.The entire sort can always be completed in memoryc.The head of the disk drive does not need to moved.There is no seek time added to the latency of I/O operations

Identify advantage and disadvantage of Multilevel Index.Breaking down index into smaller indices can lead us to accommodate the index anywhere in the main memoryImplementation cost may be highIncreases the speed of search