Scribd
Upload
44 views2 pages

UNIX Internals Assessment Guide

The document is an exam for a course on Information Technology and UNIX Internals. It contains: 1) Questions in Part A about UNIX commands, system calls, kernel modes, process data structures, buffer cache algorithms. 2) Questions in Part B about the getblk and bread algorithms, buffer cache advantages and disadvantages, pathname to inode conversion, inode allocation. 3) Questions in Part C about algorithms for assigning inodes when the free list is empty, assigning blocks when the free list is full, and converting a byte offset to a block number and offset.

Uploaded by

jon higk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views2 pages

UNIX Internals Assessment Guide

The document is an exam for a course on Information Technology and UNIX Internals. It contains: 1) Questions in Part A about UNIX commands, system calls, kernel modes, process data structures, buffer cache algorithms. 2) Questions in Part B about the getblk and bread algorithms, buffer cache advantages and disadvantages, pathname to inode conversion, inode allocation. 3) Questions in Part C about algorithms for assigning inodes when the free list is empty, assigning blocks when the free list is full, and converting a byte offset to a block number and offset.

Uploaded by

jon higk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Roll No.

DEPARTMENT OF INFORMATION SCIENCE ANO TECHNOLOGY


ANNA UNIVERSITY, CHENNAI

INTERNAL ASSESSMENT TEST l, 19thsep 2023


INFORMATION TECHNOLOGY
Semester - V
IT 5002 & UNIX INTERNALS

(Regulation 2019)
T 'me: 1 1/2 hrs [Link]: 50

UnderstandUNIXarchitecture and describe the componentof operating system.


, C02 Explain howthey interact with computer hardware.
Gain a deeper understanding of system calls in Unix operating system.
C04 ; Apply the concepts of operating systems design to practical problems.
Design and implementthe subsystemsof an operating system.
Critically ;trvilyzedifferent data structures and algori thinsused in the building

EL —Bloom's Taxonomy Levels


Remembering, L2 - Understanding, L3 - Applying, L4 - Analysing, L5 - Evaluating, L6 - Creating)

PART- A (7 x 2 = 14 Marks)
(Answer all Questions)

O. No Questions Marks co
Write the unil cornrnand in both symbolic mode and octal mode to set 2 co 1
perrni%ion where the owner can write, read and execute a file, group
and other can only read and execute a file.
2 Vlhat does the following systern calls do) What does it return if it is 2 cog 12
successful or failure>
i) fork()
ii) exit()
3 Differentiate between synchronous write, asynchronous write and 2 C02 L4
delayed-write.
4 What is kernel> State the differences between privilege mode and user 2 co 1 12
rnode.
5 Draw the layout of the data structures for processes. Why an extra level 2 cos
of indirection i' used)
a In which situation, buffer i' added at the head of free list) 2 cos
7 É How kernel maintains free 113tof data block) Why it cannot be 2 C06 15
j maintained like free list of inode>
Marks)
(Restrict to a of 2
co
Questions coz
vet(ievai 12
Write the getblk algoritht» and explain the following
scenarios with diagrann:
a. The kernel finds buffer on a hash queue.
b, The kernel cannot find buffer on a hash queue.
9
What is the purpose of breada algorithm? Write the algorithm and
explain the steps.

(ii) What are the advantages and disadvantages of the buffer cache,

9 (a) (t) Write the algorithm for conversion of a pathname to an inode, 9 coo

(n) How does the kernel computes the logical disk block and the byte 3
offset of the inode no 10 within the block, assuming bock is the
beginning of the inode list and there are 6 inodes per block and each
disk inode occupies 64 bytes.

9 (b) (i) Write the algorithm for allocation of in-core inodes. 9 [2


coo
(li) Mention the additional fields in the in-core copy
What is the most striking difference of the disk inode. 3 coa
between an in-core inode and a
buffer header. State the reason.

PART- C (1 x 12 = 12 Marks)
(Q No. 10 is compulsory)

Q. No Questions Marks co
10 (i) Write the appropriate algorithms and explain what happens 8 coco
a. if kernel tries to assign free inode to newly created file and free
inodes list in superblock is empty.
b. if kernel free a block and assigning it to free block list and free
block list in super block is full.

(ii) Draw the block layout of a sample file and its inode and show in steps 4 coa
the conversion of byte offset to block number and offset in
file system.

You might also like