Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged file-system
0
votes
0
answers
121
Galvin Edition 9 Exercise 12 Question 7 (Page No. 582)
Why is it advantageous to the user for an operating system to dynamically allocate its internal tables? What are the penalties to the operating system for doing so?
Why is it advantageous to the user for an operating system to dynamicallyallocate its internal tables? What are the penalties to the operatingsystem for doing so?
ajaysoni1924
124
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
122
Galvin Edition 9 Exercise 12 Question 6 (Page No. 582)
How do caches help improve performance? Why do systems not use more or larger caches if they are so useful?
How do caches help improve performance? Why do systems not usemore or larger caches if they are so useful?
ajaysoni1924
117
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
123
Galvin Edition 9 Exercise 12 Question 5 (Page No. 581)
One problem with contiguous allocation is that the user must preallocate enough space for each file. If the file grows to be larger than the space allocated for it, special actions must be taken. One solution ... another overflow area is allocated. Compare this implementation of a file with the standard contiguous and linked implementations.
One problem with contiguous allocation is that the user must preallocateenough space for each file. If the file grows to be larger than thespace allocated for it, special...
ajaysoni1924
305
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
file-system
+
–
0
votes
0
answers
124
Galvin Edition 9 Exercise 12 Question 4 (Page No. 581)
Consider a system that supports the strategies of contiguous, linked, and indexed allocation. What criteria should be used in deciding which strategy is best utilized for a particular file?
Consider a system that supports the strategies of contiguous, linked,and indexed allocation. What criteria should be used in deciding whichstrategy is best utilized for a...
ajaysoni1924
253
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
galvin
operating-system
file-system
+
–
0
votes
0
answers
125
Galvin Edition 9 Exercise 12 Question 3 (Page No. 581)
Why must the bit map for file allocation be kept on mass storage, rather than in main memory?
Why must the bit map for file allocation be kept on mass storage, ratherthan in main memory?
ajaysoni1924
149
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
galvin
operating-system
file-system
+
–
0
votes
0
answers
126
Galvin Edition 9 Exercise 12 Question 2 (Page No. 581)
What problems could occur if a system allowed a file system to be mounted simultaneously at more than one location?
What problems could occur if a system allowed a file system to bemounted simultaneously at more than one location?
ajaysoni1924
212
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
file-system
+
–
1
votes
0
answers
127
Galvin Edition 9 Exercise 12 Question 1 (Page No. 581)
Consider a file currently consisting of 100 blocks. Assume that the filecontrol block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, ... from the beginning. e. The block is removed from the middle. f. The block is removed from the end.
Consider a file currently consisting of 100 blocks. Assume that the filecontrolblock (and the index block, in the case of indexed allocation)is already in memory. Calcula...
ajaysoni1924
490
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
file-system
+
–
18
votes
4
answers
128
GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk bloc...
Arjun
22.7k
views
Arjun
asked
Feb 7, 2019
Operating System
gatecse-2019
numerical-answers
operating-system
file-system
2-marks
+
–
1
votes
1
answer
129
Testbook Test Series: Operating System - File System
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 256 Bytes and the size of each disk block address is 16 Bytes. The maximum possible file size in this file system is? The answer given was 70KB. Thanks!
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is...
Abhipsa
551
views
Abhipsa
asked
Jan 28, 2019
Operating System
operating-system
file-system
testbook-test-series
+
–
1
votes
0
answers
130
self_doubt
I am confused about indexing being densed or sparse, Read a lot of answer but can't figure out Primary Index is always sparse : since indexing is done of key attribute and records(files) are ordered so we create index only for anchor of the block(group of records) ... record and is only for some records. Please correct me If I am wrong at some point and If I am right then please comment.
I am confused about indexing being densed or sparse, Read a lot of answer but can’t figure outPrimary Index is always sparse : since indexing is done of key attribute a...
Shivam Kasat
384
views
Shivam Kasat
asked
Jan 20, 2019
Databases
databases
indexing
file-system
+
–
1
votes
0
answers
131
Ace Test Series: Operating System - File System FAT
Na462
626
views
Na462
asked
Jan 19, 2019
Operating System
operating-system
file-system
ace-test-series
+
–
0
votes
0
answers
132
UPPCL AE 2018:37
A file is organized so that the ordering of data records is the same as, or close to the ordering of data entries in some index. Such an index is commonly known as: Dense None of the above Clustered Sparse
A file is organized so that the ordering of data records is the same as, or close to the ordering of data entries in some index. Such an index is commonly known as:DenseN...
admin
166
views
admin
asked
Jan 5, 2019
Operating System
uppcl2018
operating-system
file-system
file-organization
+
–
1
votes
1
answer
133
MadeEasy Subject Test 2019: Operating System - File System
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
Chetan28kumar
955
views
Chetan28kumar
asked
Dec 12, 2018
Operating System
made-easy-test-series
operating-system
file-system
+
–
1
votes
1
answer
134
Operating System - File System
Consider a file system with 4096 byte blocks and 32-bit disk and file block pointers. Each file has 13 direct pointers, 4 singly-indirect pointers, a doubly-indirect pointer, and a triply-indirect pointer. The maximum disk size and the number of i-nodes that can fit in single block are........... and ........... respectively.
Consider a file system with 4096 byte blocks and 32-bit disk and file block pointers. Each file has 13 direct pointers, 4 singly-indirect pointers, a doubly-indirect poin...
Satbir
3.2k
views
Satbir
asked
Dec 4, 2018
Operating System
operating-system
file-system
+
–
0
votes
2
answers
135
Ace book-FILESYSTEM
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the maximum file size supported will be: a) 2.0 G b)2.01 M c)2.018 M d) 2.018 G
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the ma...
abhishek1995_cse
428
views
abhishek1995_cse
asked
Oct 9, 2018
Operating System
operating-system
file-system
+
–
0
votes
1
answer
136
Open file table
When a process opens a file that is already being read by another process, the file descriptors in both process will point to the same open file table entry.[True / False]. (open file table ?)
When a process opens a file that is already being read by another process, the file descriptors in both process will point to the same open file table entry.[True / False...
dd
733
views
dd
asked
Sep 15, 2018
Operating System
operating-system
file-system
+
–
1
votes
1
answer
137
File handling in C
I'm trying to use the fseek() and ftell() function to find the length of the file 'test.txt' which is present in the same directory as the file 'file.c'. file.c #include <stdio.h> int main() { FILE *fp; ... run it, I'm getting the 'Segmentation fault (core dumped)' error abd the execution terminates. What's going wrong in here?
I'm trying to use the fseek() and ftell() function to find the length of the file 'test.txt' which is present in the same directory as the file 'file.c'.file.c#include <s...
Mizuki
1.2k
views
Mizuki
asked
Aug 30, 2018
Programming in C
programming-in-c
file-system
programming
+
–
1
votes
2
answers
138
Made easy workbook operating system
Consider the organisation of a UNIX file as represented by the inode. Assume that there are 12 block pointers and a singly,doubly and triply indirect pointer in each inode. Further assume that the system block size and the disk sector are both 8 KB. The disk ... accesses are required to access the byte position 13423826 of the file? (A) 1 (B) 2 (C) 4 (D) 8
Consider the organisation of a UNIX file as represented by the inode. Assume that there are 12 block pointers and a singly,doubly and triply indirect pointer in each inod...
Sammohan Ganguly
1.1k
views
Sammohan Ganguly
asked
Aug 10, 2018
Operating System
file-system
+
–
1
votes
1
answer
139
Made easy workbook
Each I-node in file system has 5-direct pointers to disk blocks, 3 single indirect pointers to disk blocks, 2 double indirect pointers to disk blocks and nothing else. A disk block is 400 bytes . A pointer to a disk block is 10 byte. The entire disk contains ... What is the total size of the entire file system. (A) 1325250 bytes (B) 1325000 bytes (C) 1330000 bytes (D) None.
Each I-node in file system has 5-direct pointers to disk blocks, 3 single indirect pointers to disk blocks, 2 double indirect pointers to disk blocks and nothing else. A ...
Sammohan Ganguly
691
views
Sammohan Ganguly
asked
Aug 10, 2018
Operating System
file-system
+
–
0
votes
0
answers
140
File System Directory Structure
Consider a disk block having B blocks, F of which are free. Disk address is D bits. The maximum possible and given disk size respectively,assuming Block Size of S Bytes? 1. B,D 2. BS,DS 3. 2^D * S , BS 4. BS,2DS
Consider a disk block having B blocks, F of which are free. Disk address is D bits. The maximum possible and given disk size respectively,assuming Block Size of S Bytes?1...
Na462
339
views
Na462
asked
Jul 9, 2018
Operating System
file-system
operating-system
+
–
0
votes
2
answers
141
File allocation
1) Search time for file in linked allocation is more than in contiguous allocation. 2)Contiguous allocation scheme efficiently implement fixed size file. Plz explain which one true and which one false? (In answer they considered in linked allocation external fragmentation not exist but contiguous allocation it exists)
1) Search time for file in linked allocation is more than in contiguous allocation.2)Contiguous allocation scheme efficiently implement fixed size file. Plz explain which...
srestha
2.0k
views
srestha
asked
Jul 7, 2018
DS
operating-system
file-system
+
–
1
votes
2
answers
142
Ace Test Series: Operating System - File System
Na462
719
views
Na462
asked
Jul 3, 2018
Operating System
operating-system
file-system
ace-test-series
+
–
2
votes
1
answer
143
Ace Test Series: DBMS - Indexing And File Organization
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
Na462
643
views
Na462
asked
Jun 29, 2018
Databases
ace-test-series
databases
file-system
indexing
+
–
0
votes
0
answers
144
Logical structure of directory
Are the logical level of directory I.e. Single,two level,tree structure directory ... in GATE SYLLABUS 2019
Are the logical level of directory I.e. Single,two level,tree structure directory ... in GATE SYLLABUS 2019
Na462
264
views
Na462
asked
Jun 23, 2018
Operating System
file-system
+
–
0
votes
0
answers
145
Gatesyllabus
which topics cover under file system?
which topics cover under file system?
pranavpr9
122
views
pranavpr9
asked
Jun 15, 2018
Operating System
file-system
operating-system
+
–
3
votes
1
answer
146
ISRO2018-53
Immunity of the external schemas (or application programs) to changes in the conceptual scheme is referred to as: Physical Data Independence Logical Data Independence Both (a) and (b) None of the above
Immunity of the external schemas (or application programs) to changes in the conceptual scheme is referred to as:Physical Data IndependenceLogical Data IndependenceBoth (...
Arjun
4.9k
views
Arjun
asked
Apr 22, 2018
Databases
isro2018
databases
file-system
+
–
1
votes
0
answers
147
I node
how 3 could be ans?
how 3 could be ans?
srestha
498
views
srestha
asked
Jan 17, 2018
Operating System
operating-system
file-system
unix
inode
+
–
1
votes
1
answer
148
File System OS
Given disk size is 40 MB.Block Size is 8KB .The size of the bit map is ..... bits. Plz describe the answer with a proper diagram so that I could visualize the things as I faces problem when it comes to disks and blocks and hence it went wrong.
Given disk size is 40 MB.Block Size is 8KB .The size of the bit map is ..... bits.Plz describe the answer with a proper diagram so that I could visualize the things as I ...
dragonball
604
views
dragonball
asked
Jan 10, 2018
Operating System
operating-system
file-system
+
–
1
votes
0
answers
149
File Structure
Whether to count disk head movement during JUMP In CSCAN and CLOOK or not. I found 2 pdf's both are saying different things? http://www.cpp.edu/~kanluezhang/cs537/presentation/CS537-DiskScheduling-Rev.051915.pdf http://www4.comp.polyu.edu.hk/~csajaykr/myhome/teaching/eel358/ds.pdf
Whether to count disk head movement during JUMP In CSCAN and CLOOK or not. I found 2 pdf's both are saying different things?http://www.cpp.edu/~kanluezhang/cs537/presenta...
abhijeet pandey
309
views
abhijeet pandey
asked
Jan 5, 2018
Operating System
file-system
operating-system
c-look
c-scan
+
–
1
votes
1
answer
150
Acyclic graph directory structure is more flexible than simple tree structure.
Any resource on that topic will be helpful. :)
Any resource on that topic will be helpful. :)
Hemant Parihar
921
views
Hemant Parihar
asked
Dec 29, 2017
Operating System
file-system
+
–
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register