Back to the 2025 paper
Similar questions
DATABASE MANAGEMENT SYSTEMIllustrate the database characteristics, How they are different from File systems.20247mDATABASE MANAGEMENT SYSTEMIllustrate disadvantages of file processing systems.20247mDatabase Management SystemCompare the traditional file-based systems and relational database management system approaches.20197mDATABASE MANAGEMENT SYSTEMDraw and explain three level architecture of database system.20247m
PreviousConsider a system with five processes P0 through P4 and four resources type A, B, C and D. Using the Banker's algorithm answer that the system is in a safe state? | Process | Allocation (A B C D) | Max (A B C D) | Available (A B C D) | | :--- | :---: | :---: | :---: | | P0 | 0 0 1 2 | 0 0 1 2 | 1 5 2 0 | | P1 | 1 0 0 0 | 1 7 5 0 | | | P2 | 1 3 5 4 | 2 3 5 6 | | | P3 | 0 6 3 2 | 0 6 5 2 | | | P4 | 0 0 1 4 | 0 6 5 6 | |NextSuppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, applying Shortest-seek-time-first (SSTF) algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.