CS 1005-UNIX INTERNAL Two Marks Questions With Answers 2014

Anna University, Chennai

Anna_University,_Chennai_logo

SRINIVASAN ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CS 1005-UNIX INTERNAL

1. Define shell?

UNIT-1

A shell is a program that provides the traditional, text-only user interface for Linux and other Unix-like operating systems. Its primary function is to read commands that are typed into a console.

2. Mention the properties of UNIX OS?

· It has a simple user interface that has the power to provide the services that

users want.

· It provides primitives that permit complex programs to be built from simpler

programs.

· It uses a hierarchical file system that allows easy maintenance and efficient

implementation.

· It uses a consistent format for files, the byte stream, making application

programs easier to write.

· It provides a simple, consistent interface to peripheral devices.

· It is a multi-user, multiprocess system; each user can execute several processes

simultaneously.

· It hides the machine architecture from the user, making it easier to write

programs that run on different hardware implementations.

3. Mention the use of the fork System call?

The 'fork()' call is used to create a new process from an existing process. The new process is called the child process, and the existing process is called the parent. We can tell which is which by checking the return value from 'fork()'

.4. Mention the use of command “Passwd”?

The passwd command sets and changes passwords for users. Use this command to change your own password .

5. Define Exceptions?

An exception is a runtime error or warning condition, which can be predefined or user- defined. Predefined exceptions are raised implicitly (automatically) by the runtime system.

6. Define interrupt?

Interrupt is a signal sent or given to the processor in order to interrupt or to stop the current process/execution and transfer the control to the specified process in order to perform particular task.

7. List the building block primitives of UNIX with Examples?

Unix enables to write small modular program that can be used as building block to build more complex programs. There two primitives:

I/O redirection Pipe(|)

Eg: cat1 test1 > test2

8. Define Swapping?

Swapping is a useful technique that enables a computer to execute programs and manipulate data files larger than main memory.

9. Define paging?

paging is one of the memory-management schemes by which a computer can store and retrieve data from secondary storage for use in main memory. In the paging memory-management scheme, the operating system retrieves data from secondary storage in same-size blocks called pages. The main advantage of paging over memory segmentation is that it allows the physical address space of a process to be noncontiguous.

10. Characterization of unix file system?

· Hierarchical structure

· Consistent treatment of file data.

· Ability to create and delete files.

· Dynamic growth of files.

11. Define user mode?

It is a non-privileged mode in which each process starts out. It is non-privileged in that it is forbidden for processes in this mode to access those portions of memory that have been allocated to the kernel or to other programs.

12. Define kernel mode?

When the CPU is in kernel mode, it is assumed to be executing trusted software, and

thus it can execute any instructions and reference any memory addresses.

13. Define buffer?

A buffer is a region of a physical memory storage used to temporarily hold data while

it is being moved from one place to another.

14. Define system call?

A system call is the mechanism used by an application program to request service from the operating system. Operating systems contain sets of routines for performing various low-level operations.

15. What are the important fields in u area?

· Pointer to the process table

· Parameters of the current system call

· File descriptors for all open file

· Internal I/O parameters

16. Define various lifetime of a process?

ü

The process is currently executing in user mode.

ü The process is currently executing in kernel mode.

ü

The process is not executing, but it is ready to run as soon as the scheduler chooses it.

ü The process is sleeping.

17. Define sleep?

Process are said to sleep on a event, meaning that they are in the sleep state until the event occurs.

18.Define the fields in process table?

ü

A process table.

ü

Identifiers indicating the user who owns the process.

ü

An event descriptor set when a process is suspended.

1. Define pipes?


UNIT – II

A pipe is a technique for passing information from one program process to another. Unlike other forms of interprocess communication (IPC), a pipe is one-way communication.

2. Define major & minor number?

Major and minor numbers are associated with the device special files in the /dev directory and are used by the operating system to determine the actual driver and device to be accessed by the user-level request for the special device file.

3. Define buffer catch?

When a process wants to access data from a file, the kernel brings the data into main memory, alters it and then request to save in the file system.

4. Mention the use of LSEEK System cal?

lseek is a system call that is used to change the location of the read/write pointer of a file descriptor.

5. Define Inode Cache?

Inode cache cache stores logical metadata information about files (size, access time, etc). It is a linked list that stores the inodes and pointers to all pages that are part of that file and are currently in memory.

6. Define inode?

An inode is a data structure on a file system in UNIX that stores all the information about a file except its name and its actual data.

7. Define various fields in disk inode?

ü File owner identifier.

ü File type.

ü

File access permissions.

ü

File access time.

ü

File size.

8. Write the formula to compute the byte offset?

Byte offset = ((inode number-1) modulo (number of inodes per block))* size of disk inode.

9. Write the formula to compute the block number?

Block number = ((inode number-1)/number of inodes per block)+start block of inode list.

10. What are the fields in super block?

ü

Size of file system

ü

The number of free blocks in file system.

ü

A list of free blocks.

ü

The index of next free block.

ü

The size of inode list.

ü

The number of free inodes.

11. Write the syntax of open system call?

Fd = open(pathname, flags, modes);

Pathname is a file name, flags indicates the type of open, modes gives the permissions.

12. Define directories?

A directory is a file whose data is a sequence of entries, each consisting of an inode number

and the name of a file contained in the directory.

13. What is the use of iput algorithm?

The iput algorithm is used to releasing the inode. A process is waiting for the inode to become unlocked

14. What is the status of the in-core inode?

ü Indicates weather

ü The inode is locked

ü

A process is waiting for the inode to become unlocked

ü

The in-core representation of the inode.

ü

The file mounts point.

15.What is the output of bmap algorithm?

ü

Block number in file system.

ü

Byte offset into block.

ü

Bytes of I/O in block.

ü

Read ahead block number.

16. What is the use of namei algorithm?

The namei algorithm is used to convert path name to inode.

17. Define super block?

A superblock is a record of the characteristics of a filesystem, including its size, the block size, the empty and the filled blocks and their respective counts, the size and location of the inode tables, the disk block map and usage information, and the size of the block groups.

18. What are the inputs of bmap algorithm?

ü

Inode

ü

Byte offset

19. What are the algorithms present in buffer allocation process?

ü Getblk

ü Brelse

ü Bread

ü

Breada

ü

Bwrite

20. What’s the use of file owner identifier?

The file owner identifier is used to identify the owner type. Inode cache cache stores logical metadata information about files.


UNIT-III

1. Write the syntax of read system call?

Number = read(fd, buffer, count)

Where fd is file descriptor, buffer is the address of data structure, count is the number of bytes that the user wants to read.

2. What are the inputs of read algorithm?

ð

User file descriptor

ð

Address of buffer in user process

ð

Number of bytes to read

3. What are the I/O parameters saved in U area?

ð

Mode

ð Count

ð Offset

ð Address

 
ð Flag

4. Write the syntax for write system call?

Number = write(fd, buffer, count)

Where fd is file descriptor, buffer is the address of data structure, count is the number of bytes that the user wants to read.

5. Write the syntax for lseek algorithm?

Position = lseek(fd, offset, reference);

6. Write the syntax for file creation?

Fd = create(pathname, modes);

7. What are the iinputs for making the new node?

ð Node

ð File type

ð

Permissions

ð

Major, minor device number

8. Write the syntax for change owner and change mode?

ð

Chown(pathname, owner, group);

ð

Chmod(pathname, mode);

9. What are the types of pipe?

ð

Named pipe

ð

Unnamed pipe

10. Write the syntax for mounting a file system?

Mount(special pathname, directory pathname, options);

Where special pathname is the name of device, directory path name is the directory in the existing hierarchy.

11. What are the fields in mount table entry?

ð

A device number

ð

A pointer to a buffer

ð

A pointer to the inode

ð

A pointer to root inode

12. What are the inputs of mount algorithm?

ð

File name of block special file

ð

Directory name of mount point

ð

Options(read only)

13. Write syntax for pipe system call?

ð Pipe(fdptr)

ð

Where fdptr is the pointer to an integer array.

ð

14. What’s the use of dup system call?

The dup system call copies a file descriptor in to the first slot of the user file descriptor table.

15. Write the syntax for dup system call?

newfd = dup(fd) CS605

16. What is the use of fiag register?

The flag register indicates if address is in user or kernel memory.

17. What are the flags present in open system call?

ð

O_CREAT

ð

O_TRUNC

18. What the use of algorithm chdir?

The algorithm chdir changes the current directory of a process. The syntax is Chdir(pathname);

19. Write the syntax for STAT and FSTAT?

ð Stat(pathname, statbuffer);

ð

Fstat(fd, statbuffer);

ð

20. What are the inputs of link algorithm?

ð Existing file name

ð

New file name

1.Define signal?


UNIT – IV

A signal is an asynchronous event which is delivered to a process.

2. Define context of the process?

A context switch (also sometimes referred to as a process switch or a task switch) is the switching of the CPU (central processing unit) from one process or thread to another.

3. Define system boot?

When the computer is switched on, it activates the memory-resident code which resides on the CPU board. The normal facilities of the operating system are not available at this stage and the computer must 'pull itself up by its own boot- straps' so to speak. This procedure therefore is often referred to as bootstrapping, also known as cold boot.

4. Define init process?

The init process is otherwise known as zombie process. In which the process will be in the main memory even the exit() system call occur.

5. What are the fields of process table?

ð

The process state

ð

Several user identifier

ð

Process identifier

6. Define context switch?

A context switch (also sometimes referred to as a process switch or a task switch) is the switching of the CPU (central processing unit) from one process or thread to another.

7. What is page fault?

An invalid page fault or page fault error occurs when the operating system cannot find the data in virtual memory. This usually happens when the virtual memory area, or the table that maps virtual addresses to real addresses, becomes corrupt.

What are the various process state?

Process is executing in user mode.

Process is executing in kernel mode

The process is not executing but is ready to run as soon the kernel schedules it.

The process is sleeping and resides in main memory.

The process is ready to run, but the swapper must swapped the process in to main

memory before kernel schedules it for execution.

9. What are the logical sections present in unix?

A process on the UNIX system consists of 3 logical sections.

ð Data

ð Text

ð

Stack

10. Define region?

A region is a contiguous area of the virtual address space of a process that can be treated as a

distinct object to be shared or protected. Eg: text, data, stack.

11. What are the components present in register context?

ð

The program counter- specifies the address of next instruction.

ð

The processor status register- specifies the H/W status of the register.

ð

Stack pointer- current address of the next entry in the kernel.

ð

The general purpose registers – contain data generated by the process

during its execution.

12. What are the components present in system- level context?

ð

The process table entry- define the state of a process.

ð

Pregion entries, region tables and page tables – define mapping from virtual area.

ð

The kernel stack – contain the stack frames of kernel procedures.

13. Under what circumstances the kernel provide context switch?

ð When a process puts itself to sleep.

ð

When it exits

ð

Whe n it returns from a system call user mode but not a eligible process to

run

ð

When it returns to user mode after completes handling an interrupt but it

is not eligible process to run.

14. What are the steps for a context switch?

ð

Decide whether to do a context switch, and permissible now.

ð

Save the context of old process

ð

Find the best process to schedule.

ð

Restore its context.

15. What are the entries present in region table?

ð A pointer to the inode of the file.

ð

The region type (text, shared memory, private data).

ð

The size of region.

ð

The location of the region in physical memory

ð

The status of register

ð

The reference count.

16. What are the operation that manipulate region ?

ð Lock a region

ð

Unlock a region

ð

Allocate a region

ð

Attach a region to the memory space of process

ð

Free a region

ð

Load a region from a file into memory space of process.

ð

Detect a region from the memory space of a process

17. Write the operations that perform using fork system call?

ð

Allocates a slot in the process table for the new process.

ð

Assigns a unique ID number to a child process.

ð

It makes a logical copy of the context of the parent process.

ð

Increments file and inode table .

18. What are the input for exec system call?

ð

File name

ð

Parameter list

ð

Environment variable list.

19. Write the syntax for signal system call?

Oldfunction = signal(signum, function)

Where signum is the signal number the process is specifying the action, function is the address of the user function.

20. What is the use of signal and wait system call?

Wait system call allows a parent to synchronize its execution with the exit of a child process.

Signal system call informs processes of synchronous events.

1. Define swapping?


UNIT – V

Unix systems transferred entire processes between primary memory and the swap device, but did not transfer parts of a process independently, except for shared text. Such a memory management policy is called swapping.

2. What are the types of devices in unix system?

· Block devices

· Raw or character devices.

3. What are the 3 stages at which device configuration can be specified?

i. Administrators can hard-core configuration data into files that are compiled and linked when building the kernel.

ii. Administrator can supply configuration information after the system is already running.

iii. Self-identifying devices permit the kernel to recognize which device is installed.

4. What are the operations specifies for device close?

a. Search file table and make sure that no other processes still have the device open.

b. For character device, the kernel invokes the device close procedure and return to user mode.

c. For block device the kernel search the mount table to make sure that the device does not contain a mount file system

5. What are the functions of a line discipline?

· To parse input string in to lines

· To process erase characters

· To process a kill character that invalidates all characters typed so far on the

current line.

· To echo (write)received characters to the terminal

· To expand output such as tab characters

· To generate signals to processes.

6. What are the data structures for terminal drivers associated with clists?

i. A clist to store data for output to the terminal.

ii. A clist to store “raw” input data provided by the terminal interrupt

handler as the user type it in.

iii. A clist to store “cooked” input data.

7. Define scheduling?

When more than one process is runable, the operating system must decide which one

first. The part of the operating system concerned with this decision is called the scheduler,

and algorithm it uses is called the scheduling algorithm.

8. Define demand paging?

Demand paging is an application of virtual memory. In a system that uses demand paging, the operating system copies a diskpage into physical memory only if an attempt is made to access it.

9. Explain real time processing?

In a real time processing, there is a continual input, process and output of data. Data has to be processed in a small stipulated time period (real time), otherwise it will create problems for the system.

example: assembly line robots and radar system.

10. What’s the use of clock handler?

The clock handler runs with the processor execution level set high, preventing other events from happening while handler is active.

11. What are the functions of the clock interrupt handler?

· The functions of the clock interrupt handler are

· Restart the clock

· Gather system and process accounting statistics

· Keep track of time.

· Control process scheduling

· Sent signals to processes on request.

12. What all the bit fields that are used to support demand paging?

· Valid

· Reference

· Modify

· Copy on write

· Age

13. What are the types of page fault?

i. Validity fault

ii. Protection fault

14. Write the states for the cause of page fault?

i. Page is on a swap device and not in memory ii. Page is on the free page list in memory

iii. Page in an executable file. iv. Marked “demand zero”

v. Marked “demand fill”

15. What are the types of devices?

· Block device

· Character device

16. Write the system call for terminal polling?

Select(nfds, rfds, wfds, efds, timeout) Where,

nfds gives the number of file descriptor rfds, wfds, efds points to bit mask

17. Write the syntax for ptrace system call?

ptrace(cmd, pid, addr, data) Where

cmd specifies various commands, pid is the process ID, addr is the virtual address,

data is an integer value to be written.

18. Write the syntax for msgsnd system call?

msgsnd(msgqid, msg, count, flag); where,

msgqid is the descriptor, count gives the size of data array, flag specifies the action.

19. What are the inputs for msgsnd algorithm?

· Message queue descriptor

· Address of message structure

· Size of message

· Flags

20. Write the syntax for shmget system call?

Shmid = shmget(key, size, flag);

Where, size is number of bytes in the region.

16 MARKS UNIT I

1. (a)Explain the details about UNIX System Architecture. (b)Briefly details about System Structure .

2. Explain the details Operating System service.

3. Explain the details about process states & state Transition.

4. Explain the details about system concepts

5. Explain Assumption about Hardware

6. Explain the details about the User perspective

1. Explain in detail about the structure of regular file

2. a) Explain the algorithm for converting the path name to inode b) Explain the system call used for creating the special files

3. Write notes on a) Directories

b) Super blocks

4. a) Explain the details about buffer headers . b) Explain the structure of buffer pool

UNIT III

1. Discuss the concepts of pipes and DUP system call

2. Explain how a file is mounted and unmounted from the file structure

3. (a) Discuss the open system call and algorithm

(b)Discuss the close system call and algorithm

4. (a) Discuss the read system call and algorithm

(b) Discuss the write system call and algorithm

5. (a) Briefly explain file creation concepts

(b) Short notes on File locking & Record Locking

UNIT IV

1. What is region? state any 3 region system calls that are invoked by a process, one when getting hold a region, one during execution and one while relinquishing it back

2. Describe the state transition that a process undergoes during its lifetime

3. (a) Every process maintains a private U area. Describe how the U area is maintained with the help of register triples.

(b)Write short notes on Signals

4. Discuss the context of a process in detail

5. Write the algorithm involved in creating a new process and explain it

6. Write and explain the algorithm for booting the system

1. Explain process scheduling

2. What is the function of a clock interrupt handler? Details any 3 function along with the system calls and their data structures

3. What are the data structures related to paging

4. What is page fault? Discuss the page fault related to validity fault and details all the cases

When the page is faulted.

5. Write short notes on

a. Allocations of swap space b. Swapping processes out

6.(a) Explain briefly the concepts involved in driver interface

(b) Write short notes on terminal drivers

7. Write detail notes on disk drivers

No comments:

Post a Comment