Tags

Jan 24, 2010

Systems Programming

Teaching Scheme Lectures: 3 Hrs/Week
Examination Scheme Theory: 100 Marks
Objectives:
• To understand the concepts and components of Systems Programming
• To Learn and understand the fundamentals of Compilers
• To Learn and understand the fundamentals of Operating systems
Prerequisites:
• Data Structures
• Computer Organization
Unit I (6 Hrs)
Introduction: Components of System Software, Language Processing Activities,
Fundamentals of Language Processing, Development tools
Assemblers: Structure of an assembler, Design of Two pass assembler, Single Pass
Assembler, Cross Assembler
Macro Processors: Macro Definition and call, Macro expansion, Nested Macro Calls,
Advanced Macro Facilities, Design of a macro-processor, Case study of MASM
Unit II (6 Hrs)
Linkers and Loaders: Loader Schemes: Compile and go, General Loader Scheme, Absolute loaders, subroutine linkages, relocating loaders, direct linking loader, dynamic linking loader, overlay structure, Design of an Absolute loader, Case study of MS-DOS Linker and Debug Dynamic Linking: Dynamic Link Libraries-their need, conventional dynamic linking libraries, the class library, dynamic linking, DLL's, use of call back functions, Dynamic linking with and without import
Unit III (6 Hrs)
Compilers and Interpreters: Overview of Compilation process, Concepts of Pass, Phases, front-end and back-end, Concepts of Bootstrap compiler, cross compiler, incremental compiler and compiler- compiler (Only definitions), Interpreters, comparison of Compilers and Interpreters
Lexical Analysis and Parsing: Why and what is lexical analysis, design issues, Introduction to parsing, concept of top-down recursive-descendent parsers
Unit IV (6 Hrs)
Operating Systems: Introduction, Evolution of OS, Functions of an OS, Batch Processing Systems, Multi-programming Systems, Time sharing systems, Multitasking systems, Real Time Operating Systems, OS Structure, System Calls, Process, Process Control and Process Scheduling (Job Scheduling, scheduling criteria, scheduling algorithms)
Unit V (6 Hrs)
Memory management: Contiguous and non-contiguous, Swapping, Paging, Segmentation
and demand Paging, Virtual Memory, Management of Virtual memory: allocation, fetch and
replacement
Unit VI (6 Hrs)
I/O Management: I/O programming, I/O organization, I/O scheduling algorithms, I/O
buffering
Fife Management: Concept, Access methods, Directory Structure, Protection, File System
implementation, Directory Implementation, Allocation methods, Free Space management,
efficiency and performance



Textbooks
1. Dhamdhere D., "Systems Programming and Operating Systems", 2nd Edition, ' McGraw Hill, 1999, ISBN 0 - 07 - 463579 - 4
2. Silberschatz, Galvin, Gagne, "Operating System Concepts", 6th Edition, John W and Sons, ISBN 9812 - 53 - 055 - X
Reference Books
1. Stallings W., "Operating Systems", 4th Edition, Prentice Hall, 81 - 7808 - 503 - 8
2. Beck L., "System Software: An Introduction to Systems Programming", 3rd Edit Pearson Education, 1997, ISBN 0-201-43581-0
3. Aho A., Sethi R., Ullman J., "Compilers", Pearson Education, 81 - 7808 - 046 - X
4. Petzold C., "Programming Windows", 5th Edition, Microsoft Press, 81-7853- 007-4

No comments:

Post a Comment