Unix

VELS UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

IV YEAR CSE (VII SEMESTER) 09TBCE5B - UNIX INTERNALS
QUESTION BANK
UNIT I GENERAL OVERVIEW OF THE SYSTEM
PART A ( 2 MARKS)
1. What is Kernel and mention the properties of UNIX OS.
2. Differentiate between Exceptions & interrupts.
3. List the building block primitives of UNIX.
4. What are the important fields of U area?
5. What are the services provided by the kernel?
6. Define Swapping & Paging
7. Differentiate user mode & kernel mode
8. Draw a diagram of process Execution levels.
9. Write the use of super block and boot block fields in the structure of the file system.
10. Define Sleep and Wakeup.
11. Mention the use of the fork System call and passwd.
12. List the Advantages and disadvantages of kernel data Structure

PART B- 16 MARKS
1. a) Explain the System Structure of the Unix OS. (8)
b) Discuss the User Perspective of UNIX Operating System. (8)
2. a) What are the hardware assumptions of Unix OS (8)
b) List the Unix Operating System services. (8)
3. Explain the UNIX System Architecture with a neat block diagram. (16)
4. a) Discuss the file subsystem concept of Unix Operating System. (8)
b) Explain the process states & state Transition with a suitable diagram. (8)
5. What are the data structures of a running process in UNIX system? Explain with a neat diagram.
(16)

UNIT II BUFFER CACHE

PART A ( 2 MARKS)
1. Define Buffer Cache.
2. What are the various fields in the buffer header.
3. List out the various status of the buffer.
4. How the buffer is inserted and deleted in the buffer pool?
5. State any two advantages and disadvantages of buffer cache.
6. What is an inode?
7. What are the 2 versions of the inode? Differentiate them.
8. Write the contents of disk copy of an inode.
9. What does the reference count field denotes in incore copy of inode?
10. Write the formula to compute the block number and byte offset of an inode.
11. Define directory. List their access permissions.
12. Write the fields of super block.

PART B ( 16 MARKS)
1. a) Explain the concept of buffer cache. (8)
b) Discuss the advantages and disadvantages of buffer cache. (8)
2. a) Write about the internal representation of files. (8)
b) Explain in detail the structure of a regular file. (8)
3. a) Describe the structure of a buffer pool (8)
b) Explain accessing and releasing inodes with an algorithm. (8)
4. a) Explain the algorithm for converting a pathname to an inode (11)
b) Write short notes on Super block. (5)

UNIT III SYSTEM CALLS FOR FILE SYSTEM

PART A ( 2 MARKS)
1. Define open system call and write its syntax.
2. Write the syntax for read system call.
3. What is the use of write system call? Write its syntax.
4. Give the functionality of lseek.
5. Define pipe.
6. What is record locking?
7. List any 2 system calls with their syntax.
8. Write the use of dup system call.
9. Differentiate mount and unmount system calls.
10. List the I/O parameters saved in U area.

PART B ( 16 MARKS)
1. Discuss open and close system calls with an appropriate algorithm. (16)
2. a) Write short notes on file creation concepts. (8)
b) Explain file locking and record locking. (8)
3. Discuss the read and write system call with algorithm. (16)
4. Explain the concepts pipe and dup system call. (16)

UNIT IV THE STRUCTURE OF PROCESSES

PART A ( 2 MARKS)
1. List the steps involved in process state and transition.
2. Define U area.
3. Draw the state transition diagram.
4. Define Memory Management unit.
5. What is Region in system memory?
6. Define page. What is the purpose of paged memory?
7. Define the context of a process. Write its contents.
8. What are the components of register context?
9. What are signals? List any four types of signals.
10. Define init process.

PART B ( 16 MARKS)
1. Explain in detail about the manipulation of process address space. (16)
2. a) Discuss the context of a process. (10)
b) Write short notes on interrupts and exceptions. (6)
3. a) How fork ( ) system call influenced on a process creation. (8)
b) Discuss in detail about awaiting process termination. (8)
4. Write and explain the algorithm for booting the system. (16)

UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT POLICIES

PART A ( 2 MARKS)
1. Define process scheduling.
2. What is demand paging policy?
3. Write the steps involved in swapping algorithm
4. Define fork swap.
5. Write the principle of locality.
6. List the data structures that support low level memory management functions and demand paging.
7. What is a device driver? Give an example.
8. What is a page stealer process?
9. What are the steps involved in opening a device?
10. Define clists.
11. What is a stream in I/O subsystem? Give an example.
PART B ( 16 MARKS)
1. What is meant by process scheduling? Explain with its algorithm. (16)
2. Describe in detail about the allocation of swap space and swapping processes out of main memory (16)
3. a) What is a page fault? Explain any one method of page fault handling. (8)
b) Discuss the operations on the clists and cblock with examples. (8)
4. a) Explain briefly the concepts involved in driver interface (8)
b) Write short notes on terminal drivers (8)

Unix

Uploaded by

Copyright:

Available Formats

Unix

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unix

Uploaded by

Copyright:

Available Formats

VELS UNIVERSITY

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

You might also like