Calculate the record size r in bytes, Database Management System

Assignment Help:

An employee record has the following structure
struct employee {
int eno;
char name[22];
float salary;
char dept[10];};
(i) Calculate the record size R in bytes.
(ii) If the file has 500 records, calculate the blocking factor bfr and the number of blocks b, assuming an unspanned organization with block size B = 512 bytes.
(iii) Describe the unused space in each block and in the last block?

Ans: (i) 2 + 22+ 4 + 10 =38 bytes
(ii) bfr = floor( B/R) = [512/38] =13
Number of blocks b = ceiling (500/13) =39
(iii) Unused space in each block
= 512 - 38 *13 = 512 - 494= 18 bytes
Unused space in the last block
= ( 39 *13 - 500) * 38 bytes = (507 -500) * 38 bytes
= 7 * 38 =266 bytes


Related Discussions:- Calculate the record size r in bytes

Databases and data warehouses , Databases and data warehouses both are data...

Databases and data warehouses both are databases and both contains number of rows and columns of tables containing data. Data warehouse is really different from databases because d

What are data models, What are data models? Explain it detail? Entity ...

What are data models? Explain it detail? Entity relationship model Rectangles Ellipse Diamonds Lines Relational model Relational model use a collection

Time stamp ordering, explain in detail about time stamp orderting/

explain in detail about time stamp orderting/

Microeconomic, anyone have a textbook solutions case fair, 8 edition of vo...

anyone have a textbook solutions case fair, 8 edition of vol 1 ?, please give me

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

What is an index, What is an index? An index is a structure that helps ...

What is an index? An index is a structure that helps to place desired records of a relation quickly, without probing all records.

Relational algebraic operators, Problem Explain at least five relationa...

Problem Explain at least five relational algebraic operators with a suitable example. Note: All the above descriptions should be done by taking at least two examples from ou

What is a super key, What is a super key? A super key is a set of one o...

What is a super key? A super key is a set of one or more attributes that collectively permits us to recognize uniquely an entity in the entity set.

Write short notes on extension and intension, Write short notes on extensio...

Write short notes on extension and intension? In any data model, it is significant to distinguish among the description of the database and the database itself the description

Assignment, how does Btree differ from a B+ - tree?

how does Btree differ from a B+ - tree?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd