Reference no: EM133005319
CSCE 5430 Software Engineering - University of North Texas
1. You need to build a B+ tree by inserting these values (71, 59, 92, 85, 37, 94, 33, 79, 19, 40 and 60) in this order. Each node has 4 pointers (n = 4). Show a result tree after each value is inserted, and a final tree.
2. Delete 19 from the tree resulted from 1, and show the result as a tree, and explain how you get the result tree.
3. Delete 71 from the tree resulted from 1, and show the result as a tree, and explain how you get the result tree.
4. Consider the instructor relation shown below
ID
|
Name
|
Dept_name
|
Salary
|
10101
|
Srinivasan
|
Comp. Sci.
|
70,000
|
12121
|
Wu
|
Finance
|
95,000
|
15151
|
Mozart
|
Music
|
45,000
|
22222
|
Einstein
|
Physics
|
95,000
|
32343
|
El Said
|
History
|
65,000
|
33456
|
Gold
|
Physics
|
92,000
|
45565
|
Kats
|
Comp. Sci.
|
80,000
|
58583
|
Califieri
|
History
|
67,000
|
76543
|
Singh
|
Finance
|
85,000
|
76766
|
Crick
|
Biology
|
77,000
|
83821
|
Brandt
|
Comp. Sci.
|
97,000
|
98345
|
Kim
|
Elec. Eng.
|
85,000
|
Dept_name
|
h(Dept_name)
|
Biology
|
1101
|
Comp. Sci.
|
0011
|
Elec. Eng.
|
0111
|
Finance
|
0110
|
History
|
1111
|
Music
|
1001
|
Physics
|
1100
|
You need to build an extendable hash structure for this relation by using the above hash function results. You need to insert the rows in the order of top to bottom. Each bucket can hold upto 3 records. You need to show a new extendable hash structure each time the size of the bucket address table is doubled. You need to provide bucket address table, all buckets, all pointers, and hash prefix for bucket address table and each bucket in your drawing
5. Consider the instructor relation shown in 4.
1) Construct bitmaps for the following 4 salary levels:
L1: below 70000, L2: 70000 to below 80000, L3: 80000 to below 90000, and L4: 90000 and above.
2) Construct bitmaps for the following 7 dept_names:
Biology, Comp. Sci., Elec. Eng., Finance, History, Music, and Physics.
3) Consider a query that requests all instructors in the Comp. Sci. department with salary of 80000 or more. Show how to answer this query using bitmaps, the final bitmap, and ID(s) in the final answer.
Attachment:- Assignment No 2.rar