Semester 5 Syllabus, S5 Syllabus, Syllabus Of Computer Science Engineering, MG University

ENGINEERING MATHEMATICS - IV

RT 501 3+1+0

Module 1

QUEUEING THEORY: General Concepts - Arrival pattern - service pattern - Queue disciplines - The Markovian model M/M/1/$, M/M/1/N - steady state solutions – Little’s formula.

Module 2

NUMERICAL METHODS: Introduction - solution of algebraic and transcendental equations - Bisection method - Method of false position - Newton’s method - Approximate solution of equations – Horner’s method solutions of linear simultaneous equations - Iterative methods of solution-Jacobi’s method - Gauss Seidal method.

Module 3

FINITE DIFFERENCES: Meaning of operators – Δ, , μ ,δ ,E - interpolation using Newton’s forward and backward formula - Langrange’s and Newton’s divided difference interpolation formula - numerical differenciation - first and second order derivatives using forward and backward formula - numerical integration - trapizoidal rule - Simpson’s 1/3 and 3/8 rules.

Module 4

LINEAR PROGRAMMING PROBLEM : graphical solution of LPP- general problem - solution of LPP using simplex method - Big M method – duality in LPP.

Module 5

TRANSPORTATION AND ASSIGNMENT PROBLEM: Balanced transportation problem - initial basic feasible solution -Vogel’s approximation method - optimum solution by Modi method - Assignment problem - Hungerian techniques

References

1. Operations Research - P.K. Gupta & D.S. Hira, S.Chand & Co. Ltd

2. Advanced Engg Mathematics - Ervin Kreyszig, Wiley Eastern Ltd.

3. Higher Engg. Mathematics - Dr. B.S. Grewal, Khanna Publishers.

4. Operations research - Richard Bronson, Schaum’s Outline Series

5. Operations research - Panneer Selvam,PHI

6. Numerical Methods in Science & Engg - M.K. Venkataraman, National Publishing Co.

OPERATING SYSTEMS

R502 3+1+0

Module 1 Introduction

OS Concepts – Evolution of OS, OS Structures- Kernel, Shell, General Structure of MSDOS, Windows 2000, Linux.

Module 2 Process Management

Process & Threads – Process States - Process Control Block – Process Scheduling – Operations on Processes, Threads, CPU Scheduler – Preemptive and Non-Preemptive; Dispatcher, Scheduling Criteria, Scheduling Algorithms – Process Management in UNIX.

Module 3 Process Synchronization & Interprocess Communication

Concurrent Processes, Co-operating Processes, Precedence Graph, Hierarchy of Processes, Critical Section Problem – Two process solution, Synchronization Hardware, Semaphores – Deadlock- detection, handling, prevention, avoidance, recovery, Starvation, Critical Regions, Monitors, Interprocess communication.

Module 4 Memory Management

Objectives and functions, Simple Resident Monitor Program (No design), Overlays – Swapping; Schemes – Paging – Simple, Multi-level Paging; Internal and External Fragmentation; Virtual Memory Concept, Demand Paging - Page Interrupt Fault, Page Replacement Algorithms; Segmentation – Simple, Multi-level, Segmentation with Paging, Memory Management in UNIX.

Module 5 Information Management

Files and Directories – Directory Structure –Directory Implementation – Linear List - Hash Table.

Device Management: Dedicated, Shared and Virtual Devices - Serial Access Devices, Direct Access Devices, Direct Access Storage Devices - Channels and Control Units – Disk Scheduling methods.

Text Book

1. Operating Systems Concepts – Silberschatz, Galvin, Wiley Publications

References

1. Operating Systems – William Stallings, Pearson Education Asia

2. Operating Systems: Design & implementation - Andrew S. Tenenbaum, PHI

3. Modern Operating Systems - Andrew S. Tenenbaum, Pearson Education Asia / PHI

4. Operating Systems - Nutt, Pearson Education Asia

5. Operating Systems - Deitel & Deitel, Pearson Education Asia

DATA BASE MANAGEMENT SYSTEMS

RT503 3+1+0

Module 1

Basic Concepts - Purpose of database systems-Components of DBMS – DBMS Architecture and Data Independence- Data modeling - Entity Relationship Model,

Relational – Network- Hierarchical and object oriented models-Data Modeling using the Entity Relationship Model.

Module 2

Structure of relational databases – relational databases – relational algebra- tuple relational calculus. Data definition with SQL, insert, delete and update statements in SQL – views – data manipulation with SQL

Module 3

Introduction to Transaction Processing- Transaction and System Concepts- Desirable properties of Transactions- Schedules and Recoverability- Serializability of Schedules-Query processing and Optimization- Concurrency Control- -assertions – triggers.

Oracle case study: The basic structure of the oracle system – database structure and its manipulation in oracle- storage organization in oracle - Programming in PL/SQL- Cursor in PL/SQL

Module 4

Database Design– Design guidelines– Relational database design – Integrity Constraints – Domain Constraints- Referential integrity – Functional Dependency- Normalization using Functional Dependencies, Normal forms based on primary keys- general definitions of Second and Third Normal Forms. Boyce Codd Normal Form– Multivalued Dependencies and Forth Normal Form – Join Dependencies and Fifth Normal Form – Pitfalls in Relational Database Design.

Module 5

Distributed databases: Distributed Database Concepts- Data Fragmentation, Replication and Allocation Techniques- Different Types- Query Processing – semijoin -Concurrency Control and Recovery.

Text Book

1. Fundamentals of Database System Elmasri and Navathe (3^rd Edition), Pearson Education Asia

References

1. Database System Concepts - Henry F Korth, Abraham Silbershatz, Mc Graw Hill 2^nd edition.

2. An Introduction to Database Systems - C.J.Date (7^th Edition) Pearson Education Asia

3. Database Principles, Programming and Performance – Patrick O’Neil, Elizabeth O’Neil

4. An Introduction to Database Systems - Bibin C. Desai

FILE STRUCTURES AND ALGORITHMS

R504 2+1+0

Module1

File Organization: - Operations on Files – Heap Files - Sequential Files – Indexed sequential files – Direct files – Secondary key retrieval.

Module 2

Index Structures for Files: - Single level Ordered Index-Multilevel Indexes-Indexes on multiple Keys. Searching - Sequential search, Binary search, Interpolation search.

Module 3

Hashing: - Static Hashing-Hash Tables-Different Hash Functions-Mid Square-Division-Folding-Digit Analysis, Dynamic Hashing. Collision-Collision Resolution Techniques-Extendible Hashing.

Module 4

Search trees: -AVL Trees, height balanced trees, weight balanced trees, Threaded Binary Trees, Multiway search Trees- B Trees-B+ Trees.

Module 5

Storage management: - Dynamic storage management- storage allocation & liberation – First fit, best fit – Buddy system- Garbage Collection & Compaction.

References

1. Fundamentals of Data Structures in C++: Horowitz, Sahni & Mehta, Galgotia publications

2. Fundamentals of Database Systems: Elmasri & Navathe, Pearson Education Asia

3. File Structures an Object-Oriented Approach with C++: Folk, Zoellick, Riccardi, Pearson Education Asia.

4. Data Structures using C & C++: Langsam,Augenstein & Tanenbaum, Pearson Education Asia

5. Data Structures, Algorithms and Applications in C++: Sahni Galgotia publications

6. Data structures & Program design in C: Robert Kruse Pearson Education Asia

LANGUAGE PROCESSORS

RT 505 3+1+0

Module 1 Assembler

Overview of the assembly process - Design of two pass assembler- Single pass assembler- Macros – Macro definition and usage- schematics for Macro expansion – Design of a Macro pre-processor - Macro Assembler.

Module 2 Introduction to Compilers

Compilers and Translators – Structure of a compiler – lexical analysis – syntax analysis – context free grammars – basic parsing techniques- top down and bottom up parsing (brief idea only)- Recursive Decent parser – Shift reduce parser.

Module 3 Storage allocation

Data descriptors- Static and Dynamic storage allocation – Storage allocation and access in block structured programming languages – Array allocation and access- Compilation of expressions – Handling operator priorities – Intermediate code forms for expressions –code generator.

Module 4 Compilation of Control Structures

Control transfer- Conditional and Iterative constructs- Procedure calls – Code optimization – Optimization transformations – Local optimization and global optimization – Compiler writing tools – Incremental Compilers

Module 5 Loaders and Linkers

Loading – Program relocatability – linking – various loading schemes – linkage editing – Design of linkage editor – dynamic loading – overlays – dynamic linking.

Text Book

1. System Programming and Operating Systems - Dhamdhere Mc Graw Hill

2. Principles of Compiler Design - Aho A.V., Ullman Narosa Publications.

References

1. Systems programming - Donovan, Mc. Graw Hill.

2. System Software - An Introduction to Systems Programming- Leland L. Beck, Addison Wesley.

3. Compilers Principles Techniques And Tools Aho, Sethi, Ullman, Pearson Education Asia

DATA COMMUNICATION

RT 506 2+1+0

Module 1

Communication concepts – Analog modulation – Various schemes – AM, PM, FM –Sampling theorem - Analog pulse modulation – PAM, PWM, PPM – Generation of various modulated waves (Block diagram only) –Digital Pulse modulation (PCM).

Module 2

Multiplexing - Frequency Division Multiplexing (FDM) – Time Division Multiplexing (TDM), Synchronous Time Division Multiplexing –Statistical time Division multiplexing – Key Techniques - ASK, FSK, PSK, DPSK - Channel capacity - Shannon`s Theorem.

Module 3

Digital data transmission – Serial, Parallel, Synchronous, Asynchronous and Isochronous transmission. Transmission mode- Simplex - Half duplex – Full duplex, Noise- different types of noise – Basic Principles of Switching (circuit, packet, message switching)

Module 4

Error detection and Correcting codes: Hamming code – Block codes and convolution codes – ARQ techniques – Transmission codes – Baudot – EBCDIC and ASCII codes – Barcodes.

Module 5

Terminal handling – Point to point, Multidrop lines. Components of computer communication – Concentrators - Front end Processor – Transmission media – Guided media – Twisted pair cable, coaxial cable, fibre optic cable. GSM service and GSM system architecture.

References

1. Electronic communication system - Kennedy, Mc Graw Hill.

2. Principles of Communication System - Taub & Schilling Mc Graw Hill.

3. Introduction to Data Communications & Networking - Behurouz & Forozan Mc Graw Hill.

4. Data Communication, Computer Networks & Open Systems - Fred Halsall Pearson Education Asia

5. Principles & Application of GSM. - Vijay K. Garg Pearson Education Asia

6. Modern Digital & Analog Communication Systems – B.P Lathi Prism Books Pvt. Ltd.

7. Computer Networks - A.S. Tanenbaum, PHI

8. Data and Computer Communication - William Stallings, Pearson Education Asia

9. Communication Engineering - A. Kumar, Umesh Publications

MICROPROCESSOR LAB

R507 0+0+4

1. Familiarization of training kits.

2. Simple programs for Arithmetic and Data Transfer.

3. Study of MASM Programming.

4. Programming Peripheral Controllers.

5. Interfacing the Trainer Kit.

6. Any experiment according to the syllabus R302 can be substituted

DATABASE LAB

R508 0+0+4

Experiments for performing the following:

1. Creation, insertion, updation, deletion of tables, indexes, views
2. Simple queries, nested queries, use of arithmetic and string functions.
3. Simple PL/SQL programs, use of exceptions, savepoints, cursor, procedure, function, trigger, sequence generator.
4. Importing and Exporting data.
5. Database Administration
6. ODBC/JDBC Interface.
7. Implementation of File Structures

Any experiment according to the syllabus of RT503 can be substituted.

Semester 4 Syllabus, S4 Syllabus, Syllabus Of Computer Science Engineering, MG University

ENGINEERING MATHEMATICS - III

CMELRPTA 401 3+1+0

Module 1

Ordinary Differential Equations: Linear Differential equations with constant coefficents - Finding P.I. by the method of variation of parameters – Cauchys equations- Linear Simultaneous eqns- simple applications in engineering problems.

Module 2

Partial Differential Equations - formation by eliminating arbitary constants and arbitary Functions - solution of Lagrange Linear Equations – Charpits Method – solution of homogeneous linear partial differential equation with constant coefficients – solution of one dimensional wave equation and heat equation using method of separation of variables – Fourier solution of one dimensional wave equation.

Module 3

Fourier Transforms: - Statement of Fourier Integral Theorems – Fourier Transforms – Fourier Sine & Cosine transforms - inverse transforms - transforms of derivatives – Convolution Theorem (no proof) – Parsevals Identity - simple problems.

Module 4

Probability and statistics: Binomial law of probability - The binomial distribution, its mean and variance - poisson distribution as a limiting case of binomial distribution - its mean and variance - fitting of binomial & poisson distributions - normal distribution - properties of normal curve - standard normal curve - simple problems in binomial, poisson and normal distributions.

Module 5

Population & Samples: Sampling distribution of mean (s known) –Sampling distribution of variance, F and Chi square test – Level of significance - Type 1 and Type 2 errors – Test of hypothesis – Test of significance for large samples – Test of significance for single proportion, difference proportion, single mean and difference of mean (proof of theorems not expected)

References

1. Higher Engineering Mathematics - B.S. Grewal, Khanna Publishers

2. Engineering Mathematics Vol. II -3rd year Part A & B - M.K. Venkataraman, National Publishing Company

3. Elements of Partial Differential Equations - Ian N.Sneddon.,McGrawhill International Edn.

4. Miller and Fread’s Probability and statistics for engineers – Richard A Johnson, Pearson Education Asia / PHI

5. A text book of Engineering Mathematics (Volume II) – Bali and Iyengar, Laxmi Publications Ltd.

6. Advanced Engg. Mathematics - Erwin Kreyszig, Wiley Eastern Ltd.

7. Probability and statistical inferences – Hogg and Tanis, Pearson Education Asia

COMPUTER ORGANIZATION

R 402 2+1+0

Module 1

Introduction: Organization and Architecture – Review of basic operational concepts – CPU- single bus and two bus organization, Execution of a complete instruction – interconnection structures – layered view of a computer system.

Module 2

CPU - Arithmetic: Signed addition and subtraction – serial and parallel adder – BCD adder – Carry look ahead adder, Multiplication – Array multiplier – Booth’s Algorithm, Division – Restoring and non-restoring division, floating point arithmetic - ALU Design.

Module 3

Control Unit Organization: Processor Logic Design – Processor Organization – Control Logic Design – Control Organization – Hardwared control – Microprogram control – PLA control – Microprogram sequencer, Horizontal and vertical micro instructions – Nano instructions.

Module 4

Memory: Memory hierarchy – RAM and ROM – Memory system considerations – Associative memory, Virtual memory – Cache memory – Memory interleaving.

Module 5

Input – Output: Printers, Plotters, Displays, Keyboard, Mouse, OMR and OCR, Device interface – I/O processor – Standard I/O interfaces – RS 232 C, IEEE 488.2 (GPIB).

References

1. Computer Organization - Hamacher, Vranesic and Zaky, Mc Graw Hill

2. Digital Logic and Computer Design - Morris Mano, PHI

3. Computer Organization and Architecture -William Stallings, Pearson Education Asia.

4. Computer Organization and Design - Pal Chaudhuri, PHI

5. Computer Organization and Architecture -M Morris Mano, PHI

6. Computer Architecture and Organization - John P Hayes, Mc Graw Hill

OBJECT ORIENTED PROGRAMMING

R403 2+1+0

Module 1

Introduction to OOP - Evolution of object oriented languages - Need of Objects - Definition of Object-Oriented Language – Classes and Objects – Creating and Using Classes and objects – Member functions and variables – Constructors and Destructors.

Module 2

Inheritance and Access Control - Member access control in classes – Friend functions and classes – Extending classes - Public Private and Protected Inheritance – Classification of Inheritance – Single – Multiple – Multilevel – Hierarchical – Hybrid.

Module 3

Polymorphism – Runtime and compile time polymorphism – overloading functions and operators – selecting friend member function for operator overloading - Virtual methods – pure virtual methods – Abstract classes - Defining and using of virtual methods, pure virtual methods and abstract classes – applications of abstract classes.

Module 4

Advanced Concepts- Virtual Destructors – Virtual Base Classes - Template classes – Creating and using templates – Namespaces

Module 5

Dynamic Objects - Dynamic object allocation - Inline functions.

Other Object oriented languages – Java – Object oriented features in Java – Comparison with C++

References

1. Object Oriented Programming in C ++ - Robert Lafore, Galgotia Pub.

2. Object Oriented Programming in C++ - Nabajyoti Barkakati, PHI

3. Structured and Object Oriented Problem Solving using C++ - Andrew C Staugaard Jr., PHI

4. Object oriented Programming with C++ - E. Balaguruswamy, TMH

5. Java 2 Complete Reference - Herbert, Schildt, TMH

6. The Java Programming Language 3^rd Edition - Arnold, Gosling, Holmes, Pearson Education Asia

7. Object-oriented programming using C++ - Ira Pohl, Pearson Education Asia

8. C++ How to program - Dietel & Dietel, Pearson Education Asia

9. An Introduction to Object-oriented programming – Timothy Budd

10. Problem Solving with C++ - Walter Savitch, Pearson Education Asia

11. C++ Primer - Stanley B Lippman, Josee Zajoie, Pearson Education Asia

INTEGRATED CIRCUITS

R404 3+1+0

Module 1

Logic Families - DTL - TTL - ECL - I²L & CMOS. Comparison of circuits. Tristate logic - Propagation delay - power dissipation - Noise margin window profile - comparison - Fan in - Fan out.

Module 2

Storage elements - Flip flops - Latches - Registers, Decoders, Multiplexers- Buffers - Memory systems - ROM types - RAM - BJT RAM cells - MOS RAMs, RAM organization - flash memories - PLA - PAL - PGA - FPGA - PLD - CPLD - CDROM - Magneto optic storage.

Module 3

D/A Converters - Binary weighted resistor type - Ladder type A/D converters – counting type - Successive approximation type - Parallel comparator type dual slope type.

Module 4

Opamps: Characteristics - Basic principles - definitions - parameters - Input, Offset, Voltage, Input bias current, CMRR, slew rate - Ideal Opamp - inverting and non inverting opamps.

Module 5

Opamp Applications: Summing, Comparator, Differentiator - Integrator - Square wave generator - Triangular wave generator using opamps.

References

1. Digital Integrated Electronics - Taub & Shilling, McGraw Hill

2. Pulse Digital & Switching Wave forms - Millman & Taub. , McGraw Hill

3. Digital design with standard MSI & LSI by T.R. Blakesley & John Willey.

4. Integrated Circuits - Botkar, Khanna Publishers

DATA STRUCTURES & PROGRAMMING METHODOLOGIES

R 405 3+1+0

Module 1

Principles of programming – System Life Cycle - Algorithm Specification-Recursive Algorithms- Documentation- Performance Analysis and Measurements- Time and Space complexity-Complexity calculation of simple algorithms.

Module 2

Study of basic data structures – Arrays- Structures-Sparse matrix – Stacks – Queues- Circular queues- Priority queues - Dqueues. Evaluation of expressions – Polynomial representation using arrays.

Module 3

Linked Lists - Linked stacks and queues - Doubly linked lists - Polynomial representation using linked lists, Strings – Data representation – Pattern matching.

Module 4

Trees - Binary Trees – Tree Traversal – Inorder - Preorder and Postorder, Graphs – Depth first and breadth first search.

Module 5

Sorting methods: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods (basic idea only).

References

1. Fundamentals of Data Structures in C++: Horowitz, Sahni & Mehta, Galgottia Pub.
2. Classic Data Structures: Samanta, PHI
3. Data Structures and program design in C: Robert Kruse, Pearson Education Asia
4. Data Structures using C & C++: Langsam, Augenstein & Tanenbaum
5. Fundamental Algorithms: Knuth.
6. Algorithms + Data Structures = Programs: N.Wirth, PHI
7. An introduction to Data Structures with applications: Trembley & Sorenson, McGraw Hill
8. Data structures in Java: Thomas Standish, Pearson Education Asia

ADVANCED MICROPROCESSORS & PERIPHERALS

R 406 3+1+0

Module1

Study of Interfacing ICs - 8255, 8252, 8251, 8279 (functions and internal block diagram only)

Module 2

Interfacing with 8085 - Interfacing keyboard – Hardware and Software approach – Interfacing seven segment displays - Interfacing D/A and A/D converters - Micro controllers (brief idea only)

Module 3

8086/88 Architecture, Block diagram – Addressing modes – memory addressing modes – Program memory addressing modes – stack memory addressing modes.

Module 4

Instructions format of 8086 – data transfer- arithmetic –branch – loop- flag manipulation- shift & rotate – string- REP instruction – writing simple program in 8086 – Additional features of 80286 – protected mode memory addressing.

Module 5

Additional features of 80386 – Paging mechanism – Interfacing coprocessors in 80386 – Additional features of Pentium Processors. Brief study of latest processors of Intel & AMD (Architecture not required) – Introduction to RISC processors

References

1. Microprocessor Architecture, Programming and Applications with the 8085 - Gaonkar, New Age International

2. The Intel Microprocessors 8086/8088, 80186/80188, 80286, 80386, 80486, Pentium and Pentium Pro processors. Architecture, Programming and Interfacing – Barry B Bray, Pearson Education Asia

3. The 80X86 family - John Uffenbeck, PHI

4. Introduction to the Intel Family of Microprocessors - James L.Antonakos, Pearson Education Asia

5. Intel Microprocessors - A.K.Ray

6. Microprocessors and Interfacing - Douglas V. Hall, TMH

7. Advanced Microprocessors and Peripherals - A. K. Ray and K. M.Bhurchandi, TMH

8. The Intel 8086/88 Microprocessor Architecture, Programming Design and Interfacing – Bhupendra Singh Chhabra, Dhanpat Rai Publishing Company (P) Ltd

9. IBM PC and Clones - Govindarajalu, TMH

INTEGRATED CIRCUITS LAB

R407 0+0+4

1. OP-amp Characteristics

2. Inverting and Non-inverting amplifier using Op-amp - frequency response.

3. Differentiating and Integrating Circuits - frequency response.

4. Astable multivibrator using Op-amp.

5. A/D Converter.

6. D/A Converter.

7. Transfer Characteristics and specifications of TTL and MOS gates.

8. Study of flip flops

9. Synchronous and Asynchronous Counters

10. Astable and Monostable multivibrators using gates.

11. Study of shift registers and their applications.

12. Study of decoders and Multiplexers.

DATA STRUCTURES LAB

R408 0+0+4

Experiments based on the following:

1. Array and Linked list implementation of Stacks, Queues, Dqueues, Graphs, Binary Trees, Polynomials, Sparse matrix.

2. Infix, Postfix and Prefix conversions.

3. Sorting and Searching methods.

4. String representation and pattern matching

Any experiment according to the syllabus of R405 can be substituted.