This book, designed to meet the course on UNIX and SHELL Programming for graduate and undergraduate engineering students, presents an illuminative and objective exploration of algorithms and programming skills on UNIX and SHELL. The authors discuss all the concepts such as operating system services, file system, buffer cache, reading and writing disk blocks, inode assignment to a new file, system calls, structure and control of a process, inter-process communication, and sockets with the help of illustrations, tables, block diagrams, and industry based practical examples. This volume also examines the detail of UNIX command, SHELL, AWK, and PERL programming with a large number of practical examples supported by their algorithm.
Additional Info
  • Publisher: Laxmi Publications
  • Language: English
  • ISBN : 978-93-81159-05-7
  • Chapter 1

    INTRODUCTION TO UNIX Price 2.99  |  2.99 Rewards Points

  • Chapter 2

    OPERATING SYSTEM SERVICES Price 2.99  |  2.99 Rewards Points

    The Kernel performs various primitive operations on behalf of user process to support the user interface
  • Chapter 3

    FILE SYSTEM Price 2.99  |  2.99 Rewards Points

    After the disk has been partitioned its still not ready for use. A file system has to be created in each partition. There usually are multiple file systems in one m/c each one having its own directory tree headed by root.
  • Chapter 4

    BUFFER CACHE Price 2.99  |  2.99 Rewards Points

    When a process want to access data from a file, the Kernel brings the data into main memory where the process can examine it alter it and request that the data be saved in the file system again. The super block of a file system describes the free space available on the file system. The Kernel reads the super block into memory to access its data and writes it back to the file system when it wishes to save its data. Similarly the inode describes the layout of file. The Kernel reads an inode into memory when it want to update the file layout.
  • Chapter 5

    READING AND WRITING DISK BLOCKS Price 2.99  |  2.99 Rewards Points

    To read a disk block a process uses an algorithm to get a Block search for it in the buffer cache. If its in the cache, the Kernel can return it immediately without physically reading the block from disk. If its not in cache, the Kernel calls the disk driver to schedule a request and goes to sleep awaiting the event that the I/O completes. The disk drivers notifies the disk controller h/w that it want to read data and the disk controller later transmits the data to buffer. Finally the disk controller interrupts the processor when the I/O is complete and the disk interrupt handler awakens the sleeping process: the contents of the disk block now in the buffer.
  • Chapter 6

    INODE ASSIGNMENT TO A NEW FILE Price 2.99  |  2.99 Rewards Points

    The file system contains a linear list of inodes. An inode is free if its type field is zero. When a process needs a new inode, the Kernel could theoretically search the inode list for a free node. However, such a search would be expensive, requiring atleast one read operation for every inode. To improve performance, the file system super block contains an array to cache the numbers of free inodes in the file system.
  • Chapter 7

    SYSTEM CALLS Price 2.99  |  2.99 Rewards Points

    System calls are standard function which instruct the kernel to do some specific task.
  • Chapter 8

    STRUCTURE OF A PROCESS Price 2.99  |  2.99 Rewards Points

    The Kernel contains a process table with an entry that describes the state of every active process in the system. The u-area contains additional information that controls the operation of a process. The process table entry and the u-area are part of the context of a process. The aspect of the process context that most visibly distinguishes it from the context of another process is of course, the contents of its address space.
  • Chapter 9

    PROCESS CONTROL Price 2.99  |  2.99 Rewards Points

    The fork system call creates a new process, the exit call terminates process, execution and the wait call allows a parent process to synchronize its execution with the exit of a child process. Signals inform processes of a synchronous events. Because the Kernel synchronizes execution of exit and wait via signals.
  • Chapter 10

    INTER-PROCESS COMMUNICATION Price 2.99  |  2.99 Rewards Points

    We have already considered several forms of interprocess communication, such as pipes, named pipes and signals. Pipes suffer from the drawback that they are known only to processes which are descendants of the process that invoke the pipe system call: unrelated process cannot communicate via pipes. Although named pipe allow unrelated process to communicate, they cannot generally be used across a network nor do they readily lend themselves to setting up multiple communications paths for different sets of communicating process: its impossible to multiplex a named pipe to provide private channels for pairs of communicating process. Arbitrary process can also communicate by sending signals via the kill system call, but the message consist only of the signal number.
  • Chapter 11

    SOCKETS Price 2.99  |  2.99 Rewards Points

    Furthermore, the methods may not allow processes to communicate with other processes on the same m/c because they assume existence of a server process that sleeps in a driver open or read system call. To provide common methods for IPC and to allow use of sophisticated n/w protocols, the BSD system provides a mechanism known as sockets.
  • Chapter 12

    UNIX COMMAND Price 2.99  |  2.99 Rewards Points

  • Chapter 13

    AWK AND PERL PROGRAMMING Price 2.99  |  2.99 Rewards Points