Data Base Management System | Week 5
Session: JAN-APR 2024
Course Name: Data Base Management System
Course Link: Click Here
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q1. Choose the INCORRECT statement from the following.
a) Data Dictionary stores the information about schema definition.
b) Data Dictionary stores the information about Integrity constraints on a relation.
c) Data Dictionary does not store user and accounting information of a database.
d) Data Dictionary stores the information about file organization.
Answer: c) Data Dictionary does not store user and accounting information of a database.
Q2. The different Uniform Resources used to identify and locate Web resources in the Web are Uniform Resource Identifier(URI), Uniform Resource Locator (URL) and Uniform Resource Name(URN). Find the INCORRECT statement from the following regarding URI, URL and URN.
a) URI can either be a URN or URL or both.
b) URN identifies a Web resource by its name given in the namespace.
c) URL provides the functionality of pointer to locate a Web resource in the Web.
d) URL defines something’s identity, while URN provides a location.
Answer: d) URL defines something’s identity, while URN provides a location.
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q3. Consider a table which contains the salary of employees. A new salary of 15200 is inserted into this table after which the pointers are rearranged as shown in the figure. Which of the following file organizations is used to represent this?
a) Sequential File Organization.
b) Heap File Organization.
c) Multitable Clustering File Organization.
d) Hash File Organization.
Answer: a) Sequential File Organization.
Q4. If a disk system contains 1,600 disk drives, and each has a 4, 00, 000 hour MTBF (Mean time between failure), how often a drive failure will occur in that disk system?
a) 6400000 hours
b) 400000 hours
c) 400 hours
d) 250 hours
Answer: d) 250 hours
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q5. Consider a disk pack with the following specifications: 16 double-sided platters, 256 tracks per surface, 512 sectors per track and 1024 bytes per sector. Which of the following is the correct capacity of disk (approximately)?
a) 512 MB
b) 2 GB
c) 4 GB
d) 8 GB
Answer: c) 4 GB
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q6. If you want to design a secure database applications with large amounts of data and low update rate. Which of the following RAID level will you select?
a) RAID level 5
b) RAID level 3
c) RAID level 1
d) RAID level 0
Answer: a) RAID level 5
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q7. In a Cafe Shop, several types of food items are there. A customer places his/her order. A serviceman can serve multiple orders but an order will be serviced by only one serviceman. A customer can place more than one order. Which of the following statement(s) is (are) true?
a) There will be minimum three entities in the E-R diagram.
b) There will be minimum four entities in the E-R diagram.
c) Minimum two relationships will be required in the E-R diagram to modeled the scenario.
d) Minimum three relationships will be required in the E-R diagram to modeled the scenario.
Answer: b, c
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q8. Consider there is a sequential file for the relation Customer. The record size is fixed and the size of one record is 46 bytes. If the records do not cross block boundaries, and the disk block is 512 bytes with the block pointer size 10 bytes long, what is the maximum number of records can be stored in one block?
a) 9
b) 10
c) 11
d) 12
Answer: b) 10
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q9. An operating system uses the Least Recently Used (LRU) strategy for replacing its buffer. Suppose, the system allocates 3 free main memory buffer blocks for the execution of a query. If the query requires the following disk blocks to access to complete its execution:
2, 5, 3, 5, 4, 5, 3, 2, 9, 3, 5, 3, 1, 2
What will be the image of those 3 buffer blocks after servicing the disk block ‘9’?
a) 4 2 9
b) 9 5 3
c) 2 5 9
d) 2 9 3
Answer: d) 2 9 3
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
Q10. Which of the following statements are false about the Buffer Manager?
a) Programs call the buffer manager when they only need to transfer a block to disk.
b) If the block is already in the buffer, buffer manager will do nothing.
c) If the block is not in the buffer, the buffer manager allocates space in the buffer for the block.
d) For allocating the space, sometimes the buffer manager replace some other block also.
Answer: a, b
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 5 Assignment Answers
More Solutions of Data Base Management System: Click Here
More NPTEL Solutions: Click Here
Course Name: Data Base Management System
Course Link: Click Here
These are Data Base Management System Week 5 Assignment Answers
Q1. Which of the following can be the solution(s) for Password Leakage Problem in Database Servers?
a) Two-factor authentication (password plus one-time password sent by SMS).
b) Storing encrypted passwords in database and in scripts.
c) Using the same password across different sites.
d) Single-factor authentication using usernames and passwords.
Answer: a, b
These are Data Base Management System Week 5 Assignment Answers
Q2. In a file structure of Variable-Length Records, which of the following does a slotted page header contain?
a) block pointer
b) number of record entries
c) end of free space in the block
d) size of the next record
Answer: b, c
These are Data Base Management System Week 5 Assignment Answers
Q3. A file organization is sequential and unspanned (one block can store only whole records). The disk block size is 512 bytes. Each record of the file is 32 bytes long and the block pointer size is 12 bytes. How many records can be stored in one block?
a) 17
b) 16
c) 15
d) 14
Answer: c) 15
These are Data Base Management System Week 5 Assignment Answers
Q4. Suppose that the record of a book in a library is 300 bytes long. The details of the disk storage is as follows. The disk unit rotates at 7200 rpm (revolutions per minute). The data transfer rate of the disk is 75000 bytes per second whereas seek time is 20 milliseconds. One block contains 5 such records of the book. If a student asks to know the details of a given book, how much time will be required to know that?
a) Approx. 441 milliseconds
b) Approx. 44 milliseconds
c) Approx. 24 milliseconds.
d) Approx. 4 milliseconds
Answer: b) Approx. 44 milliseconds
These are Data Base Management System Week 5 Assignment Answers
Q5. What is the availability of a Database Management System having the following reliability parameters? Mean Time Between Failure (MTBF) = 36 days Mean Time to Repair (MTTR) = 18 hours
a) 20.01%
b) 64.25%
c) 97.95%
d) 99.02%
Answer: c) 97.95%
Q6. Suppose that a disk drive has 200 tracks, numbered 0 to 199. The queue of pending requests
in FIFO order is: 75, 142, 93, 177, 48, 150, 102, 171, 136.
The read-write head initially is on track 45. What is the total distance that the disk head will move to satisfy all pending requests following first cum first serve(FCFS) scheduling algo-rithms?
a) 563
b) 613
c) 633
d) 823
Answer: b) 613
These are Data Base Management System Week 5 Assignment Answers
Q7. Suppose that a Database Management System uses the Most Recently Used (MRU) strategy as its buffer replacement policy. Further, suppose that the system allocates 4 free buffer blocks for execution of a query to be used as a buffer. Assume that a query requires to access the following disk blocks in that order to complete its execution:
9,5,1,2,5,3,5,4,2,3,5,3,2,1,2,5,1,9,5,1
Calculate the number of block replacements (when all blocks are full, a residing block is replaced with a required block) required to complete the query.
a) 7
b) 8
c) 9
d) 10
Answer: a) 7
These are Data Base Management System Week 5 Assignment Answers
Q8. Consider the following statements:
1: Copy the required block from the disk to the main memory buffer.
2: The program calls the buffer manager for the required block.
3: Buffer manager returns the address of the block residing in main memory to the pro-gram.
4: Replace some other block, if the buffer blocks in main memory are not free.
There are a few statements written above. Arrange them in order to resolve what happens, when a program identifies that a required block is not available in the main memory buffer.
a) 2,3,1,4
b) 2,3,4,1
c) 24,31
d) 2,4,1,3
Answer: d) 2,4,1,3
These are Data Base Management System Week 5 Assignment Answers
Q9. Consider the following schema:
Member (Mid, Fname, Lname, Domain, Gender, Mobile_no, DOI)
Journal publication(DOI, J name, J_type, No_of publication, Mid) with the following functional dependencies:
Mid — Fname, Lname, Domain, Cender, Mobile_no
Mid — DOI
DOI — Mid
DOI—+ Jname, J_type, Noof publication
‘Which will be the refined optimal schema from the followings?
a) Member(Mid, Fname, Lname, Domain, Gender, Mobile.no, DOI)
Journal _publication(DOI, J.name, J_type, No_of publication, Mid)
Jounal 1ist(DOI, Mid)
b) Member(Mid, Fname, Lname, Domain, Gender, Mobile no)
Journal publication(DOI, J.name, J_type, No_of publication, Mid)
c) Member (Mid, Fname, Lname, Domain, Gender, Mobile no, DOI)
Journal publication(DOI, J.name, J_type, No_of publication)
Jounal 1list(DOI, Mid)
d) Member(Mid, Fname, Lname, Domain, Gender, Mobile no)
Journal publication(DOI, J.name, J_type, No_of publication)
Answer: d) Member(Mid, Fname, Lname, Domain, Gender, Mobile no)
Journal publication(DOI, J.name, J_type, No_of publication)
These are Data Base Management System Week 5 Assignment Answers
Q10. Suppose you have a 128-gigabyte flash storage system with a 2048-byte page size. How big would the flash translation table be, assuming each page has a 32-bit address, and the table is stored as an array?
a) 256 megabytes
b) 32 megabytes
c) 64 bytes
d) 32 bytes
Answer: b) 32 megabytes
These are Data Base Management System Week 5 Assignment Answers
More Solutions of Data Base Management System: Click Here
More NPTEL Solutions: https://progiez.com/nptel-assignment-answers/
| The content uploaded on this website is for reference purposes only. Please do it yourself first. |
