Reference no: EM132230588
Question: 1. Compare RAID level 1 and RAID level 5 on the basis of following parameters.
a. Fault Tolerance
b. Performance in terms of read and write operations
c. Suitable application types
2. A file has 40,000 Student records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is 8 bytes long and a record pointer is 7 bytes long. Each record has the following fields:
|
Attributes
|
Size (in bytes)
|
|
StudentID
|
9
|
|
Name
|
30
|
|
Sex
|
1
|
|
CourseMajor
|
10
|
|
Phone
|
9
|
|
Address
|
30
|
|
DoB
|
8
|
|
Status
|
3
|
a. Calculate the record size R in bytes.
b. Calculate the blocking factor bft and the number of files blocks b assuming an unspanned organization.
c. Suppose the file is ordered by the key field StudentID and we want to construct a primary index on it. Calculate the index blocking factor bft_i.
3. Consider following relational database schema and translate the queries ‘a' and ‘b' into relational algebra expressions
Teacher(ID, Name, Designation, Phone, Address)
Course(CourseCode, CourseName, CreditHour)
Taught(TeacherID, CourseCode, Semester)
a. SELECT Name, Address FROM Teacher, Taught WHERE Teacher.ID=Taught.TeacherID and CourseCode='IT344'
b. SELECT CourseName FROM Course, Taught WHERE Course.CourseCode=Taught.CourseCode and TeacherID=200
4. Draw a query tree for the following relational algebra query.
πsid, sname((σage="25"(σbid=bid(B x σsid=sid)S x R)))) where:
S represents Students (sid, sname, age, email)
B represents Books (bid, bname, auther, edition)
R represents Reserves (sid, bid, start day, end day)