Systems Programming.
Published on 12. May 2011
Book
Paperback/Softback
688 pages
978-0-19-807088-7 (ISBN)
Description
The book is divided into five parts. The first chapters explore the scope of the subject and the first part of the book deals with the systems programming backgrounds providing an overview of system software. It then delves into machine structures and library structures. The second part of the book deals with low level translators describing in detail topics such machine and mnemonic languages, assembly languages, macro languages, macro programming, assemblers linkers, loaders, and object code
translators. The third and fourth parts of the book deal with compilers and operating systems respectively. The last part of this book deals with different system development tools. Components such as editors and debuggers are discussed in detail in this section along with a chapter on system
administration.
Programming examples and algorithms have been included in the chapters wherever applicable. Conceptual and analytical chapter-end exercises have been included which judges the students' understanding of the concepts learnt in the chapter. Appendices at the end of the book comprise important instruction sets and conversion tables for ready reference.
translators. The third and fourth parts of the book deal with compilers and operating systems respectively. The last part of this book deals with different system development tools. Components such as editors and debuggers are discussed in detail in this section along with a chapter on system
administration.
Programming examples and algorithms have been included in the chapters wherever applicable. Conceptual and analytical chapter-end exercises have been included which judges the students' understanding of the concepts learnt in the chapter. Appendices at the end of the book comprise important instruction sets and conversion tables for ready reference.
More details
Language
English
Place of publication
New Delhi
India
Target group
Professional and scholarly
Illustrations
50 illustrations
Dimensions
Height: 240 mm
Width: 184 mm
Thickness: 31 mm
Weight
996 gr
ISBN-13
978-0-19-807088-7 (9780198070887)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Srimanta Pal is currently Associate Professor, Indian Statistical Institute, Calcutta. A Ph D from IIT Kharagpur, he obtained an MBA from Jadavpur University after completing his M Tech from ISI Calcutta. He has a teaching experience of close to two decades in prestigious institutions such as Indian Institute of Management, Calcutta & Jadavpur University. He is the author of Numerical Methods and Mathematical Methods published by Oxford
University Press in 2009. He has been a reviewer for a variety of international journals and has contributed numerous papers to national and international journals of repute.
University Press in 2009. He has been a reviewer for a variety of international journals and has contributed numerous papers to national and international journals of repute.
Content
1.1 INTRODUCTION; 1.2 COMPUTERS AND HUMAN BEINGS; 1.3 CONCEPT OF HARDWARE; 1.3.1 HUMAN ANALOGY; 1.3.2 HUMAN BODY VS COMPUTER HARDWARE; 1.4 MACHINE STRUCTURE; 1.5 SOME SYSTEM SOFTWARE CONCEPTS; 1.5.1 LANGUAGES; 1.5.2 HIGH-LEVEL AND LOW-LEVEL LANGUAGES; 1.5.3 MACHINE-LEVEL AND ASSEMBLY-LEVEL LANGUAGES; 1.5.4 LOADER AND LINKER; 1.5.5 TRANSLATOR; 1.6 OPERATING SYSTEMS; 1.6.1 RESOURCE MANAGEMENT; 1.6.2 DEVICE MANAGEMENT; 1.6.3 CONCEPT OF MEMORY MANAGEMENT; 1.6.4 SCHEDULER; 1.6.5 CONCURRENT PROGRAMMING; 1.7 SYSTEM REPAIRING AND DEBUGGING TOOLS; 2.1 INTRODUCTION; 2.2 SYSTEMSIFICATION OF SYSTEMS; 2.2.1 CLASSIFICATION OF SYSTEMS; 2.2.2 SYSTEM DESIGNTEM DESIGN; 2.2.3 METHOD OF SYSTEM DESIGND STRUCTURED SYSTEM; 2.2.4 PROPERTIES OF A GOOD AND STRUCTURED SYSTEM; 2.3 POPULAR TERMS AND CONCEPTSLS, AND TECHNIQUES; 2.3.1 ALGORITHMS, METHODS, TOOLS, AND TECHNIQUESGE; 2.3.2 CONCEPTS OF DATA, INFORMATION, AND KNOWLEDGE; 2.4 NUMBER SYSTEMS AND THEIR REPRESENTATION; 2.4.1 NUMBER SYSTEMER SYSTEMS; 2.4.2 STANDARD NUMBER SYSTEMS; 2.4.3 BCD (BINARY CODED DECIMAL) NUMBER SYSTEM; 2.4.4 PACKED BCDY CODED DECIMAL) NUMBER SYSTEM; 2.4.5 FIXED-POINT REPRESENTATION; 2.4.6 CONVERSIONS REPRESENTATION; 2.4.7 GENERAL CONVERSION METHODOLOGY; 2.4.8 COMPLEMENT NUMBER SYSTEMSOLOGY; 2.4.9 ALPHANUMERIC CODE SYSTEMS; 2.4.10 BOOLEAN OPERATIONS; 2.5 COMPONENTS OF A COMPUTER PROGRAM; 2.6 PROGRAMMING TECHNIQUES; 2.7 DATA STRUCTURES; 2.7.1 CLASSIFICATION OF DATA STRUCTURES; 2.7.2 POPULAR DATA STRUCTURES; ARRAY; STRINGS; LINKED LIST; STACK; QUEUE; TREES; 2.7.3 SEARCHING; SEQUENTIAL SEARCH; BINARY SEARCH; HASHING; AVERAGE SEARCH PERFORMANCE; 2.7.4 SORTING; 2.8 DESIGN OF ALGORITHMS; 2.9 ANALYSIS OF ALGORITHMS; 2.9.1 TIME COMPLEXITY; 2.9.2 SPACE COMPLEXITY; 2.9.3 AMORTIZED ANALYSIS; 3.1 INTRODUCTION; 3.2 SOFTWARE; 3.3 SOFTWARE HIERARCHY; 3.4 SYSTEMS PROGRAMMINGOGRAMMING; 3.5 EMBEDDED SYSTEMS PROGRAMMING; 3.6 MACHINE STRUCTURE; 3.7 INTERFACES; 3.7.1 USER'S INTERFACE; 3.7.2 SYSTEM'S INTERFACE; 3.8 ADDRESS SPACE; 3.8.1 ADDRESSING SCHEME; 3.8.2 MEMORY MAP; 3.9 COMPUTER LANGUAGES; 3.9.1 MACHINE-LEVEL LANGUAGE; 3.9.2 MNEMONIC-LEVEL LANGUAGE; 3.9.3 ASSEMBLY-LEVEL LANGUAGE; 3.9.4 HIGH-LEVEL LANGUAGE; 3.10 LANGUAGE TRANSLATORS; 3.10.1 COMPILER; 3.10.2 COMPILER-COMPILER; 3.10.3 CROSS COMPILER; 3.10.4 ASSEMBLER; 3.10.5 CROSS ASSEMBLER; 3.10.6 INTERPRETER; 3.10.7 EMULATOR; 3.10.8 PREPROCESSOR; 3.10.9 MACROPROCESSOR; 3.11 OPERATING SYSTEMS; 3.11.1 MEMORY MANAGEMENT; 3.11.2 DEVICE MANAGEMENT; 3.11.3 PROCESSOR MANAGEMENT; 3.11.4 I/O PROGRAMS; 3.11.5 FILE SYSTEMS; 3.11.6 SEARCHING/SORTING; 3.11.7 SCHEDULER; 3.11.8 LIBRARIES; 3.12 DISTRIBUTED SYSTEM; 3.12.1 DISTRIBUTED OPERATING SYSTEM; 3.12.2 NETWORK OPERATING SYSTEM; 3.13 TOOLS; 3.14 DATABASE SYSTEM; 3.14.1 DATABASE; 3.14.2 DATABASE MANAGEMENT SYSTEM; 3.15 LIFE CYCLE OF A SOURCE PROGRAM; 3.16 DIFFERENT VIEWS ON THE MEANING OF A PROGRAM; 3.17 SYSTEM SOFTWARE DEVELOPMENT; 3.17.1 COST OF SYSTEM SOFTWARE; 3.18 RECENT TRENDS IN SOFTWARE DEVELOPMENT; 3.19 LEVELS OF SYSTEM SOFTWARE; 4.1 INTRODUCTION; 4.2 JOHN VON NEUMANN MACHINE STRUCTURE; 4.2.1 MACHINE STRUCTURE; 4.2.2 WORKING PRINCIPLE; 4.3 A GENERAL APPROACH TO MACHINES; 4.4 NUMBERED REGISTER-BASED MACHINE; 4.4.1 MEMORY; 4.4.2 REGISTERS; 4.4.3 DATA FORMATS; 4.4.4 INSTRUCTIONS; 4.5 INSTRUCTIONAL COMPUTERS; 4.5.1 SIMPLIFIED INSTRUCTIONAL COMPUTER (SIC); SIC MACHINE STRUCTURE; SIC/XE MACHINE STRUCTURE; 4.6 ACCUMULATOR-BASED COMPUTERS; 4.7 CLASSIFICATION OF COMPUTERS; 4.7.1 INSTRUCTION-BASED CLASSIFICATION; 4.7.2 ORGANIZATION-BASED CLASSIFICATION; 4.7.3 COMPUTING-BASED CLASSIFICATION; 4.8 MICROPROCESSOR EVOLUTION; 4.9 THE ARCHITECTURE OF A MICROCOMPUTER; 4.10 CISC ARCHITECTURE-BASED COMPUTERS; 4.10.1 STRUCTURE OF THE INTEL 8086/88-BASED MICROCOMPUTER; MEMORY; REGISTERS; ADDRESSING MODES; INSTRUCTION FORMATS; 4.10.2 PENTIUM PROCESSOR-BASED MICROCOMPUTERS; MEMORY; REGISTERS; DATA; ADDRESSING MODES; INSTRUCTION FORMATS; 4.11 RISC ARCHITECTURE-BASED COMPUTER; 4.11.1 STRUCTURE OF AN MIPS COMPUTER; MEMORY; REGISTERS; DATARY; ADDRESSING MODES; DATA; ADDRESSING MODES; INSTRUCTION FORMATS; 5.1 INTRODUCTION; 5.2 LIBRARY AND FILE ORGANIZATION; 5.3 DESIGN OF A RECORD; 5.3.1 MAPPINGS RECORDS TO STORAGE; 5.3.2 REALIZATION IN STORAGE; 5.3.3 RECORD PROCESSING; 5.3.4 RECORD LENGTH; FIXED-LENGTH AND VARIABLE-LENGTH RECORDS; 5.3.5 ITEM REPRESENTATION; LOGICALLY ENCODED ITEMS; BINARY ENCODED ITEMS; FIXED ITEMS; 5.4 SOURCE PROGRAM/DATA FILE STRUCTURE; 5.4.1 SOURCE ODE RECORD FORMATS; 5.5 OBJECT CODE; 5.5.1 OBJECTCODE RECORD FORMATS; TEXTUAL RECORD FORMAT IN OBJECT FILE; RECORD FORMAT OF BINARY OBJECT CODE FILE; 5.5.2 EFFICIENT OBJECT CODE RECORD FORMAT; BLOCKED OBJECT CODE; TAGGED OBJECT CODE FORMAT; 5.6 OBJECT FILES; 5.6.1 CLASSIFICATION OF OBJECT FILES; 5.6.2 SIMPLEST OBJECT FILE FORMATS; 5.6.3 OBJECT FILE STRUCTURES; OBJECT MODULE FORMAT; A TYPICAL OBJECT FILE FORMAT; ABSOLUTE OBJECT FILE FORMATS; RELOCATABLE OBJECT FILE FORMATS; 5.6.4 OBJECT FILE STRUCTURE FOR UNIX SYSTEMS; 5.7 STANDARD OBJECT FILE STRUCTURES; 5.7.1 MS-DOS.COM FILE STRUCTURE; 5.7.2 IBM 360 OBJECT FILE FORMAT; ESD RECORD STRUCTURE; TXT RECORDS STRUCTURE; RLD RECORD STRUCTURE; END RECORD STRUCTURE; ESD RECORD STRUCTURE; 5.7.3 OMF FILE FORMATS; OMF RECORD FORMAT; TYPES OF OMF RECORDS; DIFFERENCE BETWEEN 16-BIT AND 32-BIT OMF RECORD FORMAT; OMF FILE STRUCTURE; 5.7.4 UNIX A.OUT OBJECT FILE STRUCTURE; A.OUT HEADER RECORD; RELOCATABLE A.OUT FILE FORMAT; RELOCATION ENTRIES; SYMBOLS AND STRINGS; 5.7.5 COMMON OBJECT FILE FORMAT; 5.7.6 EXECUTABLE AND LINKING FORMAT; CLASSIFICATION OF UNIX ELFS; HEADER RECORD STRUCTURE; UNIX ELF RELOCATABLE OBJECT FILE FORMAT; ELF SYMBOL TABLE; 5.8 EXECUTABLE FILE; THE STRUCTURE OF AN EXECUTABLE FILE; 5.9 STANDARD EXECUTABLE FILE STRUCTURES; UNIX A.OUT EXECUTABLE FILE STRUCTURE; DOS EXE FILE STRUCTURE; WINDOWS NE FORMAT; PORTABLE EXECUTABLE (PE) FILE STRUCTURE; SPECIAL SECTIONS FOR PE FILE STRUCTURE; ELF EXECUTABLE FILE STRUCTURE; COMPARISON BETWEEN COFF, PE, AND ELF; 5.10 LIBRARIES; 5.10.1 PURPOSE OF LIBRARIES; BASIC PRINCIPLE; 5.10.2 LIBRARY STRUCTURES; 5.10.3 STATIC LIBRARIES; 5.10.4 SHARED/DYNAMIC LINK LIBRARY (DLL); COMPARISON BETWEEN LIBRARIES; 5.11 IMAGE FILE STRUCTURES; IMAGE FILE FORMAT; 6.1 INTRODUCTION; 6.2 MACHINE LANGUAGES; MACHINE INSTRUCTIONS; MACHINE LANGUAGE PROGRAM; 6.3 MNEMONIC LANGUAGES; MNEMONIC INSTRUCTIONS; MNEMONIC LANGUAGE PROGRAM; 6.4 MACHINE LANGUAGE VS MNEMONIC LANGUAGE; 6.5 MACHINE OPERATIONS IN MACHINE LANGUAGES; 6.5.1 IBM 360 (HYPOTHETICAL) MACHINE; 6.5.2 SIC MACHINE; 6.5.3 CISC ARCHITECTURE-BASED MACHINE; 6.5.4 RISC ARCHITECTURE-BASED MACHINE; 6.6 PROGRAMMING TECHNIQUES IN MACHINE LANGUAGES; 6.6.1 HYPOTHETICAL MACHINE; ASSUMPTION 6.1; BASIC OPERATIONS; APPROACH 1 STRAIGHT FORWARD METHOD; APPROACH 2 ADDRESS MODIFICATION USING INSTRUCTION AS DATA; ASSUMPTION 6.2; APPROACH 3 ADDRESS MODIFICATION USING INDEX REGISTER; ASSUMPTION 6.3; APPROACH 4 CONTROL USING LOOP; ASSUMPTION 6.4; 5.6.2 SIC MACHINE; ASSUMPTION 6.5; BASIC OPERATIONS; APPROACH 1 STRAIGHT FORWARD METHOD; APPROACH 2 ADDRESS MODIFICATION USING INSTRUCTION AS DATA; ASSUMPTION 6.6; APPROACH 3 ADDRESS MODIFICATION USING INDEX REGISTER; ASSUMPTION 6.7; APPROACH 4 CONTROL USING LOOPING; ASSUMPTION 6.8; 6.6.3 INTEL 8086 BASED MACHINE; ASSUMPTIONS; ASSUMPTION 6.9; BASIC OPERATIONS; APPROACH 1 STRAIGHT FORWARD METHOD; APPROACH 2 ADDRESS MODIFICATION USING INSTRUCTION AS DATA; ASSUMPTION 6.10; APPROACH 3 ADDRESS MODIFICATION USING INDEX REGISTER; APPROACH 4 CONTROL USING LOOPING; ASSUMPTION 6.11; 6.6.4 RISC ARCHITECTURE-BASED MACHINE; BASIC OPERATIONS; APPROACH 1 STRAIGHT FORWARD METHOD; 6.7 OBJECT CODE; 6.8 ADVANCED CONCEPTS; 6.8.1 VIRTUAL MACHINE (VM); 6.8.2 VIRTUAL MACHINE LANGUAGE (VML); 7.1 INTRODUCTION; 7.2 ROLES OF ASSEMBLY LANGUAGE; 7.3 BASIS OF ASSEMBLY LANGUAGES; 7.4 DISADVANTAGES; 7.5 WHY LEARN ASSEMBLY LANGUAGES?; 7.6 COMPARISONS; 7.6.1 ASSEMBLY LANGUAGES VS MACHINE LANGUAGES; 7.6.2 ASSEMBLY-LEVEL LANGUAGES VS HIGH-LEVEL LANGUAGES; 7.7 ASSEMBLY LANGUAGE APPLICATIONS; 7.8 MULTI-PLATFORM ASSEMBLY PROGRAMMING; 7.9 ASSEMBLY LANGUAGE FORMATS; 7.10 ASSEMBLY STATEMENTS; DIRECTIVES VS INSTRUCTIONS; 7.11 BASIC OPERATIONS; 7.11.1 DATA MOVEMENT OPERATIONS; 7.11.2 FIXED-POINT ARITHMETIC OPERATIONS; 7.11.3 LOGICAL OPERATION; 7.11.4 SHIFT-AND-ROTATE OPERATIONS; 7.11.5 DECIMAL ARITHMETIC OPERATIONS; 7.11.6 SINGLE-OPERAND OPERATIONS; 7.11.7 NO-OPERAND OPERATIONS; 7.11.8 PROGRAM CONTROL OPERATIONS; 7.11.9 SUPERVISORY OPERATIONS; 7.12 IMPORTANCE OF REGISTERS; 7.13 MACROS; 7.14 STRUCTURED ASSEMBLY LANGUAGE; 7.15 ELEMENTS OF ASSEMBLY PROGRAMS; 7.16 PROGRAMMING TECHNIQUES; 7.16.1 HYPOTHETICAL MACHINE; CONSTANT REPRESENTATION; MACHINE INSTRUCTIONS; PSEUDO-INSTRUCTIONS; USING SYMBOLS; USING LITERALS; OTHER VARIANTS; 7.16.2 SIC MACHINE; SOME CONVENTIONS; FIXED TABLES; ASSEMBLY LANGUAGE PROGRAM; 7.16.3 CISC MACHINE; 7.16.4 RISC-BASED MACHINE; SOME CONVENTIONS; ASSEMBLY LANGUAGE PROGRAM; 7.17 ASSEMBLY LANGUAGE SUBROUTINES; 7.17.1 USE OF PARAMETERS; 7.17.2 TYPE OF PARAMETERS; 7.17.3 SUBROUTINE CALLING METHODS; 7.17.4 STORAGE ALLOCATION FOR PARAMETERS; 7.17.5 RECURSION; 7.17.6 CO-ROUTINES; 7.17.7 INTERRUPT PROCESSING ROUTINE; 8.1 INTRODUCTION; 8.2 FEATURES; 8.3 THE INTEL 8086 INSTRUCTION SET; 8.4 INTERRUPTS; 8.4.1 INTERRUPT INSTRUCTIONS; 8.4.2 COMMON SOFTWARE INTERRUPTS; 8.4.3 WORKING PROCEDURE FOR THE INT INTERRUPT; 8.5 HOUSEKEEPING OF INTERRUPT CALLS; 8.6 PROGRAMMING TECHNIQUES; 8.6.1 HIGH-LEVEL LANGUAGE PROGRAM; 8.6.2 ASSEMBLY LANGUAGE PROGRAM; 8.6.3 ASSEMBLY PROGRAM VS FORTRAN PROGRAM; 8.6.4 EXECUTION; INITIAL MEMORY MAP; ASSEMBLY PROGRAM EXECUTION; FINAL MEMORY MAP; 8.7 ASSEMBLY LANGUAGE PROGRAMMING STYLES; 8.7.1 CHOICE OF VARIABLE NAMES; 8.7.2 SECTION COMMENTS; 8.7.3 SINGLE INSTRUCTION COMMENTS; 8.8 LANGUAGE CONSTRUCTS; 8.8.1 HIGH-LEVEL LANGUAGE CONSTRUCTS; 8.8.2 ASSEMBLY-LEVEL LANGUAGE CONSTRUCTS; 8.9 HOW TO RUN ASSEMBLY PROGRAMS; 8.10 STANDARD ASSEMBLERS; 8.11 MICROSOFT ASSEMBLER (MASM); 8.11.1 ASSEMBLY AND LINKING SYNTAX; 8.11.2 LIBRARY INCLUSION; 8.12 BORLAND TURBO ASSEMBLER (TASM); 8.12.1 ASSEMBLY SYNTAX; 8.12.2 LINKING SYNTAX; 8.13 MICROASM; 8.13.1 WORKING PROCEDURE; 8.13.2 COMPATIBILITY; 8.14 NETWIDE ASSEMBLER (NASM); 8.14.1 COMMANDS; 8.15 DOS BATCH FILES FOR TASM AND MASM; 8.16 MEMORY MODELS; 8.17 PROGRAM ILLUSTRATIONS; 8.17.1 MESSAGE PRINTING; 8.17.2 CHARACTER/STRING OPERATIONS; 8.17.3 ARITHMETIC OPERATIONS; 8.17.4 CURSOR AND SCREEN MANIPULATIONS; 8.17.5 CONVERSION; 8.17.6 DATA STRUCTURE; SORTING; SEARCHING; 8.17.7 PROCEDURE AND RECURSIVE PROGRAMMING; 8.17.8 FILE PROCESSING; 8.17.9 SYSTEMS PROGRAMMING; PROGRAM FILES; PROGRAM; PROGRAM; PROGRAM; 8.17.10 LIBRARY CREATION; LIBRARY PROGRAMMING TECHNIQUES; CREATING LIBRARY MODULES; 8.18 CREATE A LINK LIBRARY; 9.1 INTRODUCTION; 9.2 BASIC TASKS; 9.3 CLASSIFICATION OF ASSEMBLERS; SELF-ASSEMBLERS OR RESIDENT ASSEMBLERS; NON-RESIDENT ASSEMBLERS; 9.4 WORKING PRINCIPLES; 9.5 PROBLEMS IN MANUAL ASSEMBLY; 9.6 GENERAL PROBLEMS IN ASSEMBLER; 9.7 GENERAL PROCEDURE FOR ASSEMBLER DESIGN; 9.8 A SIMPLE ASSEMBLY PROCESS; 9.8.1 ALGORITHM; 9.9 ASSEMBLY PROCESS; 9.9.1 BASIC FORMAT; 9.9.2 FEASIBILITY STUDY OF AN ASSEMBLY PROCESS; HYPOTHETICAL MACHINE; SIC MACHINE; CISC MACHINE; 9.10 DESIGN ISSUES; 9.10.1 MNEMONIC MACHINE INSTRUCTIONS; 9.10.2 PSEUDO-INSTRUCTIONS; 9.10.3 LOCATION COUNTER AND LOCATION ASSIGNMENT; 9.10.4 CONTROL SECTION AND SYMBOL TABLE; ADVANTAGES; COMMUNICATION; FACILITIES; 9.10.5 DATA DEFINITION AND GENERATION; 9.10.6 PROGRAM AND PROGRAM LISTING CONTROL; SYMBOL DEFINITION; RULES FOR CLASSIFYING SYMBOL/SYMBOLIC EXPRESSIONS; 9.11?ASSEMBLER FEATURES; 9.12?ASSEMBLER DESIGN CRITERIA; CRITERIA; IMPLEMENTATION; 9.13 TYPES OF ASSEMBLERS; 9.14 TWO-PASS ASSEMBLERS; 9.14.1 WORKING PRINCIPLES; 9.14.2 BASIC FUNCTIONS; PASS I; INITIALIZATION; 9.14.3 DESIGN CRITERIA OF TWO-PASS ASSEMBLERS; 9.14.4 A SIMPLE TWO-PASS ALGORITHM; 9.14.5 MODIFIED TWO-PASS ASSEMBLER; 9.15 ONE-AND-A-HALF-PASS ASSEMBLERS; 9.15.1. A 11/2 PASS ALGORITHM; ASSUMPTIONS; 9.16 ONE-PASS ASSEMBLERS; FORWARD REFERENCES; DISADVANTAGES; ADVANTAGES; 9.16.1 GENERAL APPROACH TO A ONE-PASS ASSEMBLER; 9.16.2 PRACTICAL ONE-PASS ASSEMBLERS; 9.17 MULTI-PASS ASSEMBLERS; 9.17.1. THREE-PASS ALGORITHM; 9.18 ADVANCED ASSEMBLY PROCESS; 9.18.1 GRAMMAR OF AN ASSEMBLY LANGUAGE; 9.18.2 LEXICAL ANALYSIS; 9.18.3 SYNTAX ANALYSIS; 9.18.4 SEMANTIC ANALYSIS; 9.19 VARIANTS OF ASSEMBLERS; 9.19.1 RELOCATING ASSEMBLERS; 9.19.2 META-ASSEMBLERS; 9.19.3 MACRO-ASSEMBLERS; 9.19.4 CROSS-ASSEMBLERS; 9.19.5 DISASSEMBLERSERS; 9.19.6 SOME PRACTICAL ASSEMBLERS; 9.19.7 OBJECT-ORIENTED ASSEMBLER; 10.1 INTRODUCTION; 10.2 DEFINITIONS; 10.3 ADVANTAGES OF USING A MACRO; 10.4 MACRO VS PROCEDURE; 10.5 DEVELOPMENT OF MACRO LANGUAGES; 10.5.1 STRUCTURE OF A MACRO DEFINITION; 10.5.2 FORMAT OF A MACRO DEFINITION; TYPE 1 FORMAT; TYPE 2 FORMAT; 10.5.3 NOTATIONS; 10.6 LOCAL VARIABLES IN A MACRO; 10.7 MACROS WITHOUT PARAMETERS; 10.8 CONCEPT OF PARAMETERS IN MACROS; 10.9 FORMAL VS ACTUAL PARAMETERS IN MACROS; 10.10 CONCATENATION OF MACRO PARAMETERS; 10.11 PARAMETER-PASSING MECHANISM IN MACROS; 10.11.1 POSITIONAL PARAMETER PASSING; 10.11.2 KEYWORD PARAMETER PASSING; 10.11.3 POSITIONAL VS KEYWORD PARAMETER PASSING; 10.12 CONDITIONS IN MACRO DEFINITIONS; 10.13 MACRO CALLS WITHIN MACRO DEFINITIONS; 10.13.1 RECURSIVE MACROS; 10.14 MACRO INSTRUCTIONS DEFINING MACROS; 10.15 CASE STUDIESMACROS; 10.14 MACRO INSTRUCTIONS DEFINING MACROS; 10.15 CASE STUDIES; 10.15.1 C MACRO LANGUAGE; FEATURES; 10.15.2 MASM MACRO LANGUAGE; MACRO DEFINITION FORMAT; MACRO OPERATORS; LOCAL VARIABLE DECLARATION FORMAT; CONDITIONAL STATEMENTS IN MACROS; THE REPEAT FORMAT IN MACRO; THE WHILE FORMAT IN MACROWHILE; RELATIONAL OPERATORS; THE FOR FORMAT IN MACRO; 11.1 INTRODUCTION; 11.2 FEATURES; 11.3 MACRO PROGRAMMING TECHNIQUES; 11.3.1. PROPERTIES; FORMAT OF MACRO DEFINITION; 11.3.2 DIRECTIVES; 11.3.3 MACRO OPERATORS; 11.3.4 MACRO LIBRARY; 11.4 PROGRAM ILLUSTRATIONS; 12.1 INTRODUCTION; 12.2 FUNCTIONS OF A MACRO PROCESSOR; 12.3 BASIC TASKS OF A MACRO PROCESSOR; 12.4 DESIGN ISSUES OF MACRO PROCESSORS; 12.4.1 DESIGNER'S DECISIONS; 12.5 FEATURES; 12.5.1 MACHINE-INDEPENDENT FEATURES; 12.6 MACRO PROCESSOR DESIGN OPTIONS; 12.6.1 FORMULATIONEPENDENT FEATURES; 12.6.2 PASS STRUCTUREDESIGN OPTIONS; 12.7 TWO-PASS MACRO PROCESSORS; 12.7.1 ALGORITHMCTURE; 12.7.2 OUTLINE OF THE ALGORITHM; PASS I CREATE DATABASE; PASS II PROCESS MACRO CALLS; 12.7.3 DETAILED ALGORITHM; IMPLEMENTATION ISSUES; 12.8 ONE-PASS MACRO PROCESSORS; 12.8.1 SIMPLE ONE-PASS MACRO PROCESSOR; AN OUTLINE OF A SIMPLE ONE-PASS ALGORITHM; IMPLEMENTATION ISSUES; 12.8.2 ONE-PASS NESTED MACRO PROCESSOR; ONE-PASS NESTED MACRO PROCESSOR ALGORITHM; 12.9 GENERALIZED ONE-PASS MACRO PROCESSORS; 12.9.1 DETAILED ALGORITHM; EXPANDED OUTPUT; IMPLEMENTATION ISSUES; 12.10 APPLICATIONS OF MACRO PROCESSORS; 12.11 MACRO COMMAND INTERPRETER; 13.1 INTRODUCTION; 13.2 PRINCIPLES OF LINKING; 13.2.1 THE LINKING OPERATION; 13.2.2 THE LINKING PROCESS; 13.2.3 LIBRARY LINKING; 13.3 A SIMPLE LINKING PROCESS; 13.3.1 DIFFERENT LINKING FUNCTIONS; SUBROUTINE INKAGES; 13.3.2 SIMPLE LINKING OPERATIONS; ADVANTAGES; 13.4 BASIC LINKING TASKS AND PROCEDURE; 13.5 MEMORY MANAGEMENT DURING LINKING; 13.5.1 COMPUTATION OF MEMORY LOCATIONS; 13.5.2 MEMORY ALLOCATION TECHNIQUE; 13.6 SYMBOLS AND SYMBOL RESOLUTION; 13.6.1 SYMBOL RESOLUTION USING STATIC LIBRARIES; 13.7 BINDING; 13.7.1 WORKING PRINCIPLE OF LAZY BINDING; 13.8 RESOLVING EXTERNAL REFERENCES; 13.9 RELOCATION AND CODE MODIFICATION; 13.9.1 TYPES OF RELOCATION; 13.9.2 RELOCATABILITY OF PROGRAMS; 13.9.3 RELOCATION MECHANISM; 13.9.4 RELOCATION PROCEDURE; 13.9.5 RELOCATING RELATIVE ADDRESSES; 13.10 LINKING METHODS; 13.11 STATIC LINKING; 13.12 DYNAMIC LINKING; 13.12.1 OUTLINE; 13.12.2 PRINCIPLES OF DYNAMIC LINKING; 13.12.3 METHODS OF DYNAMIC LINKING; IMPLICIT DYNAMIC LINKING; EXPLICIT DYNAMIC LINKING; IMPLICIT VS EXPLICIT DYNAMIC LINKING; STATIC VS. DYNAMIC LINKING; TASK OF AN ADDRESS EXCEPTION HANDLER ROUTINE; DYNAMIC LINKING OF SHARED LIBRARIES; DYNAMIC LINKING IN WINDOWS; 13.13 LIBRARY LINKING; 13.13.1 STATIC LIBRARY LINKING; 13.13.2 DYNAMIC LIBRARY LINKING; LOAD-TIME LINKING; RUN-TIME LINKING; 13.13.3 SHARED/DYNAMIC LINK LIBRARY (DLL) LINKING; SHARED LIBRARY LINKING PROCEDURE; 13.14 OBJECT LINKING AND EMBEDDING (OLE); 13.15 MODULE LINKING; MODULE SCANNING; MODULE TYPES; EXE MODULES VS DLL MODULES; 13.16 DESIGN OF LINKERS; 13.16.1 TWO-PASS LINKERS; BASIC PHILOSOPHY; WORKING PRINCIPLES; CONTENT OF INPUT FILES; OUTLINE OF A TWO-PASS LINKER; 13.16.2 ONE-PASS LINKERS; PHILOSOPHY; OUTLINE; 13.16.3 THREE-PASS LINKING; 13.16.4 COMPLEXITY; 13.17 LINKER COMMAND LANGUAGES; 13.18 AUTOMATIC LIBRARY SEARCHING; LIBRARY SEARCHING IN STATIC LINKING; LIBRARY SEARCHING IN DYNAMIC LINKING; REMOTE LIBRARY SEARCHING; 13.19 SOME POPULAR LINKERS; 13.19.1 MS-DOS LINKER; WORKING PRINCIPLE; 13.19.2 LINKING FOR OVERLAYS; WORKING PROCEDURE; 13.19.3 SUNOS LINKERS; SUNOS LINK EDITOR; RESOLVE SYMBOLIC REFERENCES; 14.1 INTRODUCTION; 14.2 PROGRAMS IN MEMORY; 14.3 PRINCIPLES OF LOADING OPERATION; 14.3.1 LOADING OPERATIONS; 14.3.2 BASIC LOADING TASKS; 14.3.3 LOADER PROCEDURE; 14.3.4 LOADER FEATURES; 14.4 LINKERS VS LOADERS; 14.5 LOADING SHARED LIBRARIES FROM APPLICATIONS; 14.6 DIFFERENT LOADING SCHEMES; 14.6.1 LOADER DESIGN OPTIONS; 14.7 SEQUENTIAL AND DIRECT LOADERS; 14.8 COMPILE-AND-GO LOADERS; 14.9 GENERAL LOADER SCHEMES; 14.10 ABSOLUTE LOADERS; BASIC PHILOSOPHY; WORKING PRINCIPLES; 14.10.1 SOME ABSOLUTE LOADERS; LOAD-AND-GO COMPILERS; BOOTSTRAP LOADERS; BOOT LOADERS; 14.11 RELOCATING LOADERS; BASIC PHILOSOPHY; WORKING PRINCIPLES; ALGORITHMS; 14.12 PRACTICAL RELOCATING LOADERS; BINARY SYMBOLIC SUBROUTINE (BSS) LOADER; RELOCATING LOADERS FOR MODERN COMPUTERS; 14.13 LINKING LOADERS; 14.13.1 TWO-PASS LINKING LOADER; WORKING PRINCIPLE; OUTLINE OF ALGORITHM; DESIGN OF ALGORITHM; 14.13.2 ONE-PASS LINKING LOADER; WORKING PRINCIPLE; OUTLINE OF ALGORITHM; 14.14 RELOCATING LINKING LOADERS; 14.14.1 LINKAGE EDITORS; STATIC LINKAGE EDITOR; DYNAMIC LINKAGE EDITOR; COMPARISONS; 14.15 OVERLAY; WORKING PRINCIPLE; STATIC OVERLAY GENERATOR; 14.15.1 LINKING A PROGRAM CONTAINING OVERLAYS; 14.15.2 LOADING A PROGRAM CONTAINING OVERLAYS; 14.16 BINDER; WORKING PRINCIPLE; CLASSIFICATION; CORE IMAGE BINDER; LINKAGE EDITOR; COMPARISON; 14.17 DYNAMIC LOADER; RELOCATION DURING BINDING; DYNAMIC LINKING; WORKING PRINCIPLE; 14.18 AUTOMATIC LIBRARY SEARCH; 14.19 COMPLEXITY; TIME COMPLEXITY; SPACE COMPLEXITY; 14.20 SOME POPULAR LOADERS; 14.20.1 BOOT LOADERS; BASIC CONCEPT OF BOOT LOADER; THE BOOT SEQUENCE ON A STANDARD PC; THE BOOT SEQUENCE ON LINUX; MODES OF OPERATION; DUAL MODE; 14.20.2 UNIX LOADERS; USING EARLY A.OUT FORMAT; USING NMAGIC FORMAT; USING ZMAGIC FORMAT; QMAGIC FORMAT; 14.20.3 UNIX LINK EDITOR LD(L); 14.20.4 LOADERS: RUNNING A PE EXECUTABLE; 14.20.5 BINARY IMAGE LOADER; LOADING PRINCIPLE; 14.21 GRAPHICS LOADERS; 15.1 INTRODUCTION; 15.2 BINARY CODE TRANSLATORS; 15.2.1 TRANSLATED BINARY PROGRAM; 15.2.2 CLASSIFICATION; 15.2.3 MODEL FOR BINARY TRANSLATION; 15.2.4 TYPES OF BINARY TRANSLATION; TRANSLATION OF APPLICATIONS BY SOFTWARE; TRANSLATION OF OPERATING SYSTEMS BY SOFTWARE; TRANSLATION OF OPERATING SYSTEMS BY HARDWARE; 15.2.5 USES OF BINARY CODE TRANSLATORS; 15.2.6 EXTENDED BINARY TRANSLATION; 15.3 OBJECT CODE TRANSLATORS; 15.4 TRANSLATION PROCESS; 15.4.1 TRANSLATION METHODS; 15.4.2 PASSES; 15.4.3 COMPLETENESS; 15.4.4 DRAWBACKS; 15.4.5 OPERATING SYSTEM INFLUENCES; 15.5 HYBRID METHOD; 15.5.1 STATIC-TRANSLATION BASED TRANSLATOR; 15.5.2 EMULATOR-BASED TRANSLATOR; WORKING PRINCIPLE; 15.6 APPLICATIONS; CONTENTS; 16.1 INTRODUCTION; 16.2 PROGRAMMING LANGUAGES; 16.2.1 GRAMMAR; 16.3 COMPILERS; 16.3.1 PHASES OF A COMPILER; 16.3.2 IMPLEMENTATION; 16.4 VARIANT OF COMPILERSER; 17.1 INTRODUCTION; 17.2 NATURE; 17.3 NEEDS; 17.4 STRUCTURED LANGUAGE; 17.5 FEATURES; 17.6 REGULAR EXPRESSIONS; 17.7 FINITE AUTOMATA; 17.7.1 NON-DETERMINISTIC FINITE AUTOMATA; 17.7.2 DETERMINISTIC FINITE AUTOMATA; 17.8 GRAMMARS; 17.9 CONTEXT-FREE GRAMMARS; 17.9.1 DERIVATIONS; 17.9.2 PARSE TREES; 17.9.3 NOTATIONS; 17.9.4 ABBREVIATIONS; 17.10 AMBIGUOUS AND UNAMBIGUOUS GRAMMARS; 17.11 LEFT-RECURSIVE GRAMMAR; 17.12 GRAMMAR CLASSES; 17.12.1 VENN DIAGRAM FOR CLASSES OF GRAMMARS; 17.13 BNF TO PARSING TABLE; 17.13.1 NULLABLE; 17.13.2 FIRST SET; 17.13.3 FIRST(X) COMPUTATION; 17.13.4 FOLLOW SET; 17.13.5 FOLLOW(X) COMPUTATION; 17.13.6 ITEM; 17.13.7 CLOSURE SET; 17.13.8 GOTO FUNCTION; 17.13.9 FIRST AND LAST TERMINALS; 17.13.10 RECURSION; 17.13.11 LEFT FACTORING; 17.14 SOME TERMINOLOGY USED IN PARSING; 17.15 PARSING TABLE CONSTRUCTION; 17.16 PREDICTIVE PARSING TABLE CONSTRUCTION; 17.16.1 CONSTRUCTION PRINCIPLE; 17.17 LR PARSING TABLE CONSTRUCTION; 17.17.1 STRUCTURE OF AN LR PARSING TABLE; 17.17.2 CONSTRUCTION OF LR PARSING TABLE; 17.18 OPERATOR PRECEDENCE GRAMMARS; 17.18.1 COMPUTATION OF PRECEDENCE RELATIONS; 17.18.2 OPERATOR PRECEDENCE TABLE CONSTRUCTION; 17.18.3 DESIGN OF OPERATOR PRECEDENCE FUNCTIONS; 17.18.4 COMPUTATION OF PRECEDENCE FUNCTION; DIRECTED GRAPH METHOD; BOOLEAN MATRIX METHODS; 17.19 OBJECT-ORIENTED PROGRAMMING LANGUAGES; 17.19.1 OBJECT-ORIENTED VS STRUCTURED PROGRAMMING; 17.19.2 BASIC CONCEPTS OF OBJECT-ORIENTED PROGRAMMING; 17.19.3 OOP; 17.20 FUNCTIONAL PROGRAMMING LANGUAGES; 17.20.1 TYPES OF FUNCTIONAL PROGRAMMING LANGUAGES; 18.1 INTRODUCTION; 18.2 COMPILATION PROCESS; 18.2.1 SCANNER; 18.2.2 SYNTAX AND SEMANTIC ANALYSERS; 18.2.3 INTERNAL REPRESENTATION SOURCE PROGRAM; 18.3 OTHER PROGRAMS WITH COMPILERS; 18.4 TRANSLATION OF A STATEMENT; 18.5 COMPILER CONSTRUCTION TOOLS; 18.6 LEXICAL ANALYSIS; 18.6.1 WORKING PRINCIPLE; 18.6.2 LEXICAL AMBIGUITY; 18.6.3 PROBLEMS OF LEXICAL AMBIGUITY; 18.6.4 COMPLEXITY OF PROBLEM IN LEXICAL AMBIGUITY; 18.6.5 STANDARD LEXICAL GENERATOR TOOLS; 18.7 SYNTAX ANALYSIS; 18.7.1 PARSERS; 18.7.2 CLASSIFICATION OF PARSING TECHNIQUES; 18.8 BASIC PARSING TECHNIQUES; 18.8.1 TOP-DOWN PARSING; SOME PROBLEMS WITH TOP-DOWN PARSING; IMPLEMENTATION ISSUES; 18.8.2 BOTTOM-UP PARSING; 18.8.3 SHIFT-REDUCE PARSING; IMPLEMENTATION ISSUES; INITIALIZATION; OPERATING PRINCIPLE; ACTIONS; 18.8.4 OPERATOR PRECEDENCE PARSING; OPERATOR PRECEDENCE PARSING ALGORITHMS; ERROR DETECTION AND RECOVERY; ERROR HANDLING; IMPLEMENTATION; 18.8.5 RECURSIVE DESCENT PARSING; 18.8.6 PREDICTIVE PARSING; RECURSIVE PREDICTIVE PARSER; NONRECURSIVE PREDICTIVE PARSER; 18.8.7 LL(1) PARSING; LL(1) GRAMMAR; 18.8.8 LR PARSING; MODEL; DRIVER ROUTINE; PROPERTIES; 18.8.9 COMPARATIVE STUDY OF PARSERS; 18.9 SEMANTIC ANALYSIS; 18.9.1 TYPE CHECKING; WORKING PRINCIPLE; 18.9.2 SYNTAX VERSUS SEMANTIC ANALYSIS; 18.9.3 SYNTAX-DIRECTED TRANSLATION; 18.10 PARAMETER PASSING; 18.10.1 PARAMETER PASSING TECHNIQUES; CALL-BY-VALUE; CALL-BY-REFERENCE; CALL-BY-REFERENCE USING POINTERS; CALL-BY-COPY-RESTORE (ALSO CALLED CALL-BY-VALUE-RESULT); CALL-BY-NAME; 18.11 INTERMEDIATE CODE GENERATION; 18.11.1 IMPORTANCE OF INTERMEDIATE CODE; 18.11.2 INTERMEDIATE REPRESENTATION; 18.11.3 TRANSLATION PROCESS; 18.11.4 INTERMEDIATE REPRESENTATION LANGUAGES; 18.12 CODE GENERATION; 18.12.1 SIMPLE CODE GENERATOR; WORKING PROCEDURE; 18.13 CODE OPTIMIZATION; 18.13.1 CODE OPTIMIZATION TECHNIQUES; 18.14 OPTIMIZING COMPILERS; 18.14.1 ORGANIZATION; 18.15 SOME POPULAR COMPILERS; 19.1 INTRODUCTION; 19.2 DESIGN OF COMPILER GENERATORS; 19.2.1 ATTRIBUTED GRAMMAR; PROPERTIES; SYNTHESIZED AND INHERITED ATTRIBUTES; WELL-DEFINED ATTRIBUTED GRAMMAR; 19.2.2 WORKING PRINCIPLE; 19.3 POPULAR COMPILER GENERATORS; 19.3.1 SCANNER GENERATORS; COMPARISON OF SCANNER GENERATORS; 19.3.2 PARSER GENERATORS; COMPARISON OF PARSER GENERATORS; 19.3.3 COMPILER SPECIFICATION LANGUAGE; 19.4 LEX; 19.4.1 WORKING PRINCIPLE; INPUT FILE CONSTRUCTION FOR LEX; 19.5 YACC; 19.5.1 WORKING PRINCIPLE; INPUT FILE CONSTRUCTION FOR YACC; SEMANTIC ACTIONS; FUNCTIONS; 19.6 INSIDE OF LEX AND YACC; 19.7 COMPILER DESIGN TOOLBOX; 19.7.1 DESIGN OF COMPILER USING TOOLBOX; 19.7.2 PRINCIPLES OF COMPILER MODEL; 19.7.3 COMPILER DESIGN USING LEX AND YACC; 19.8 UNIVERSAL COMPILER-COMPILERS; 19.8.1 LEXICAL ANALYSIS; 19.8.2 SYNTAX ANALYSIS; 19.8.3 SEMANTIC ANALYSIS; 19.8.4 INTERMEDIATE CODE GENERATION; 19.8.5 CODE GENERATION; 19.8.6 DESIGN AND IMPLEMENTATION; LEXICAL ANALYSIS; SYNTAX ANALYSIS; SEMANTIC ANALYSIS; CODE GENERATION; 20.1 INTRODUCTION; 20.2 THE SCOPE OF OPERATING SYSTEMS; 20.3 THE FUNCTIONS OF OPERATING SYSTEMS; 20.3.1 MEMORY MANAGEMENT; 20.3.2 PROCESS MANAGEMENT; 20.3.3 DEVICE MANAGEMENT; 20.3.4 INFORMATION MANAGEMENT; 20.4 MEMORY MANAGEMENT SCHEMES; 20.4.1 SINGLE CONTIGUOUS ALLOCATION; 20.4.2 PARTITIONED ALLOCATION; MULTIPROGRAMMING; 20.4.3 RELOCATABLE PARTITIONED ALLOCATION; 20.4.4 PAGED ALLOCATION; 20.4.5 DEMAND-PAGED ALLOCATION; 20.4.6 SEGMENTED ALLOCATION; DIFFERENT COMPONENTS OF A SEGMENTED ALLOCATION; 20.4.7 SEGMENTED PAGED ALLOCATION; 20.5 INTERRUPTS; 20.5.1 INTERRUPT PROCESSING MECHANISM; 20.5.2 INTERRUPT SYSTEM STRUCTURE OF IBM 360; CHANNEL; PROGRAM STATUS WORD (PSW); CLASSES OF INTERRUPT; I/O PROGRAMMING; 20.5.3 INTERRUPT SYSTEM STRUCTURE OF M6809; HARDWARE INTERRUPTS; SOFTWARE INTERRUPTS; 20.6 STRUCTURAL OVERVIEW OF OPERATING SYSTEMS; 20.6.1 MONOLITHIC MONITOR-BASED OPERATING SYSTEMS; 20.6.2 PROCESS-BASED OPERATING SYSTEMS; 20.6.3 THE CHARACTERISTICS OF A KERNEL; 20.7 STATE TRANSITION OF CONCURRENT PROCESSES; 20.7.1 FORK/QUIT/JOIN; 20.7.2 SHARED MEMORY MODEL FOR INTERPROCESS COMMUNICATION; 20.8 HIGHER-LEVEL SYNCHRONIZING TOOLS; 20.8.1 HOARE'S MONITOR; 20.8.2 CO-ROUTINES; A SIMPLE MODEL FOR THE SIMULATION OF CONCURRENT PROCESSES USING CO-ROUTINES; 20.9 DEADLOCKS; 20.10 HANDLING DEADLOCKS; 20.10.1 IGNORE - THE OSTRICH METHOD; 20.10.2 DETECTION AND RECOVERY; GRAPH REDUCTION METHOD; 20.10.3 DEADLOCK PREVENTION; 20.10.4 HIERARCHICAL RESOURCE ALLOCATION; RESTRICTIONS; 20.10.5 DEADLOCK AVOIDANCE; 20.10.6 PREVENTION OF DEADLOCKS; REALIZABLE STATUS; FULL SEQUENCE; STATE TRANSITION; SOLUTION TO THE PERMANENT BLOCKING PROBLEM; 20.11 SCHEDULING; 20.11.1 FORMAL QUEUING SYSTEMS; 20.11.2 JOB SCHEDULER; 20.11.3 POLICIES; 20.11.4 PROCESS SCHEDULING; FUNCTIONS; PROCESS CONTROL BLOCK; POLICIES; 20.11.5 SCHEDULING ALGORITHMS; 20.12 DEVICE MANAGEMENT; 20.12.1 DISK; ESTIMATING DISK CAPACITY; TRACK ORGANIZATION; ORGANIZING TRACKS BY BLOCK; 20.12.2 DISK ACCESS; PERFORMANCE OF DISK ACCESS; ANALYSIS OF SINGLE USER MODEL; MULTIUSER MODEL; ROTATIONAL LATENCY AND BLOCK TRANSFER TIME; 20.12.3 DEVICES; 20.12.4 DEVICE MANAGEMENT PRINCIPLES; I/O TRAFFIC CONTROLLER; I/O SCHEDULER; I/O DEVICE HANDLERS; 20.13?BUFFER ALLOCATION ALGORITHM; 20.14?CASE STUDIES; 20.14.1?MS-DOS; MS-DOS COMMANDS; 20.14.2 WINDOWS; THE TASKBAR; TOOLBARS; SHORTCUTS; CREATE A SHORTCUT; WORKING WITH MULTIPLE WINDOWS; MANAGING DOCUMENTS AND FOLDERS; OPENING THE WINDOWS EXPLORER; SYSTEM TOOLS; 20.14.3 UNIX; 20.14.4 LINUX; 21.1 INTRODUCTION; 21.2 DOCUMENT EDITOR; 21.2.1 DOCUMENT EDITING; 21.2.2 THE STRUCTURE OF AN EDITOR; 21.2.3 CONSTRAINTS; 21.3 THE DESIGN OF A TEXT EDITOR; 21.3.1 BASIC TEXT OPERATION ALGORITHMS; 21.4 SOUND EDITOR; 21.4.1 THE WORKING PRINCIPLE OF A SOUND EDITOR; 21.5 CASE STUDIES; 21.5.1 DOS BUILT-IN EDITOR; 21.5.2 EDLIN; 21.5.3 UNIX EDITOR VI; CHANGE MODES; COMMAHNND MODE TO INSERT MODE; 22.1 INTRODUCTION; 22.2 TYPES OF ERRORS; 22.3 DEBUGGING PROCEDURES; 22.4 CLASSIFICATION OF DEBUGGERS; 22.5 DYNAMIC/INTERACTIVE DEBUGGER; 22.5.1 FEATURES OF BREAKPOINT DEBUGGERS; 22.5.2 WORKING PROCEDURE OF A DYNAMIC DEBUGGER; 22.5.3 IMPLEMENTATION OF BREAKPOINT SETTINGS; 22.6 DEBUGGING USING HARDWARE; 22.7 USE OF DEBUGGER IN UNIX C; 23.1 INTRODUCTION; 23.2 SYSTEM ADMINISTRATORS; 23.2.1 CLASSIFICATION; 23.2.2 TASKS; 23.3 SYSTEM INSTALLATION; 23.3.1 HARDWARE INSTALLATION; 23.3.2 SOFTWARE INSTALLATION; PREPARATION; INSTALLATION OF OPERATING SYSTEM; 23.4 SYSTEM CONFIGURATION; 23.5 ON-GOING PROCESS; 23.6 SYSTEM ADMINISTRATION FOR DOS; 23.7 SYSTEM ADMINISTRATION FOR WINDOWS; CREATE A NEW USER ACCOUNT IN WINDOWS XP; CHANGES USER'S ACCOUNT; 23.8 SYSTEM ADMINISTRATION FOR UNIX