45. The definition of 4NF is identical to that of BCNF, except that FD is replac

Question

45. The definition of 4NF is identical to that of BCNF, except that FD is replaced with a. JD. d. MVD.- 46. Blocks form in the hard disk duringd a. disk assembly. b. disk formatting. c. computer booting. d. disk manufacturing. 47. A primary index is used toe a. reduce the number of blocks accessed. b. order an unordered file. c. implement the B-tree. d. avoid binary search.* 48. Which schedule is recoverable? 49. With block size 4096 bytes and record size 100 bytes, how many disk blocks are needed for 20,000 records, when ynspanned blocking is used?4 a. about 100 b. about 1000 c. about 10 d. about 500 50. B+ trees differs from B trees in that a. B+ trees are more balanced. b. B+ trees are shallower. c. search values are stored only at internal nodes. d. data pointers are stored only at leaf nodes.

Explanation / Answer

Answer is as follows :

45) Correct option is MVD(d) i.e. Multivalued Dependency.

All is same as BCNF but difference is Multivalued Dependency is there in 4NF.

46) Correct Option is Disk Formatting (b)

Blocks form during Disk Formatting

47) The correct option is b i.e. Order an Unordered file.

Physical Index is used to sort the files.

48) correct Option is A.

i.e. only the recoverable scedule in given options.

49) Correct Optinon is d i.e. 500

Here records per Block are = 4096 / 100 = 40 (approximate)

So number of blocks of data file are = 20000 / 40 = 500

50) Correct Option is D.

i.e. data pointers in B+ tree are stored in leaf nodes.

if there is any query please ask in comments...

Related Questions

Navigate

• Browse (All)
• Browse 4
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.