Computer Science Engineering

Semester 6 Syllabus, S6 Syllabus, Syllabus Of Computer Science Engineering, MG University

2008-05-31T23:08:00.000-07:00

PC & PC BASED SYSTEMS

R601 3+1+0

Module 1 Introduction to PC

Hardware components – study of motherboards ––Different types of ports, slots and connectors-Add-on cards-Power supply– SMPS- function & operations.

Module 2 Storage Devices

Floppy – Floppy Disk Controller - Disk Physical specification & operations – Disk magnetic properties – Cylinders – Clusters – Hard disks – Hard disk drive operation – Magnetic data storage - Sectors – Disk formatting – partitioning - Hard disk features – Hard disk data transfer modes –Programmed I/O – Direct memory access – Ultra DMA – Data addressing – Standard CHS addressing – Extended CHS addressing – Logical Block Addressing.

Module 3 Optical Storage

CD ROM, CD Technology, Sector layout, CD-R, CD-RW, CDROM, drive specifications- data transfer rate – Access time – Constant linear velocity – constant angular velocity - Buffers – Interface – Magneto optical drives – WORM devices –DVD- RAID – Holographic storage.

Module 4 Memory Management in PC

Parity – ECC – Static & Dynamic RAM – Memory Addressing – Segmented addressing - 64 KB Limits – 640 KB barrier – Logical, segmented, virtual, linear and physical memory addresses – Extended and Expanded memory – Cache memory – Video memory – HMA - Flat memory model – Advanced memory technologies.

Module 5 Bus Structures

ISA, PCI, PCMCIA, AGP, USB, Hard Disk Interfaces – IDE, EIDE, ATA – Communication ports – Serial – Parallel port – Keyboard / Mouse Interface connectors.

References

1. PC Hardware Complete Reference - Craig Zacker & John Rourke, Tata McGraw Hill

2. Inside the PC (8^th Edition) - Peter Norton,BPB

3. The Indispensable PC Hardware Book - Messmer, Pearson Education

4. Troubleshooting and Repairing Your PC - Corey Candler, Wiley

5. Upgrading and repairing PC’s (4^th edition) - Scott Mueller, Pearson Education

6. IBM PC Assembly Language Programming - Abel, PHI

7. PC Upgrading Maintenance & Trouble shooting guide - Dr. S. K. Chauhan, Kataria

SOFTWARE ENGINEERING

RT 602 2+1+0

Module 1 Introduction to Software engineering

Introduction – Software and software Engg.- Phases in software development-Software development process models-Role of Management in software development –Role of Matrics and measurement –Software requirement specification(SRS) - Problem Analysis - validation .

Module 2 Project Planning

Cost Estimation – Uncertainties – models – COCOMO model – Project scheduling – average duration estimation – Project scheduling and milestones – staffing and personal plan – Rayleigh curve – personnel plan – team structure – software configuration – management plans – quality assurance plans – verification and validation – inspections and reviews - project monitoring plans - time sheets – reviews – cost schedule – milestone graph – risk management.

Module 3 System Design

Design Principles – Problem partitioning and hierarchy – abstraction – modularity – top down and bottom_up – strategies – module level concepts - coupling - cohesion – structured design methodology - verification - matrics.

Module 4 Coding

Top-down and Bottom-up - Structured Programming - Information Hiding - Programming style - Internal Documentation – Verification - Code Reading - Static Analysis - Symbolic execution - Proving Correctness - Code inspections – Unit testing.

Module 5 Testing

Testing fundamentals - Functional and Structured Testing - Testing Process - Comparison of Verification and Validation Techniques - Reliability assessment - Programmer Productivity - Error removal efficiency.

Text Book

1. An integrated approach to Software Engineering - Pankaj Jalote, Narosa Publication

References

1. Software Engineering - Roger S. Pressman, Tata McGraw Hill

2. Software Engineering - Ian Sommervilla, Pearson Education

3. Software Engineering Theory and Practice - Shari Lawrence, Pearson Education Asia

4. Fundamentals of Software Engineering –Rajib Mall, PHI

5. Fundamentals of Software Engineering – Carlo Ghezzi, Mehdi Jazayeri, PHI

PROJECT MANAGEMENT AND QUALITY ASSURANCE

R603 2+1+0

Module 1 PROJECT PLANNING

Overview – Capital expenditure - Phases of capital budgeting – Project development cycle – 7-s of project management – Requirements of a project manager – Forms of project organization.

Module 2 PROJECT ANALYSIS

Market Analysis – Technical Analysis - Financial Analysis – Risk Analysis – Social cost Benefit Analysis.

Module 3 CONTROL OF PROJECT

Control Systems – Control of major constraints – Project management software & information systems.

REVIEW: Performance of Evaluation – Abaudonment Analysis – Behavioral issues in Project Management

Module 4 TOTAL QUALITY MANAGEMENT

Quality systems – ISO 9000 series – ISI – Benchmarking – Quality Function development (QFD) – Total Productive Maintenance (TPM) – ISO 14000.

Module 5 CONCEPTS IN SAMPLING

Sampling designs and schemes – Errors in sampling – Simple random sample – stratified random sample – Cluster sample.

Sample size destination – Estimating population mean – Estimating population proportion.

References

1. Projects preparation, Apprisal, Budgeting & Implementation – Prasanna Chandra – Tata McGraw Hill

2. Projects – Planning, Analysis, Selection, Implementation & Review - Prasanna Chandra – Tata McGraw Hill

3. Project Management - Harvey Maylor - Pearson Education

4. Total Quality Management – Dale H. Besterfield – Pearson Education

5. Quality control and Improvement – Amitava Mitra – Pearson Education

6. Quality assurance and TQM – Jain & Chitale – Khanna Publishers

COMPUTER NETWORKS

RT 604 3+1+0

Module 1

Introduction: ISO-OSI Reference Model – TCP/IP Reference Model – Comparison Network hardware-Repeaters, Routers, Bridges, Gateways, Hub, Cable Modem.

Physical Layer: Transmission Media– ISDN system Architecture – Communication Satellites – geostationary satellites - Medium Earth Orbit Satellites- Low earth orbit satellites– Satellite v/s Fiber

Module 2

Data Link Layer: Design issues-Error Detection and correction – Elementary Data link protocols- Sliding window protocols. .

LAN Protocols: Static & Dynamic channel allocation in LAN’s and WAN’s, Multiple access protocols – ALOHA – Pure ALOHA – Slotted ALOHA – Carrier Sense Multiple Access protocols – persistent and non-persistent CSMA – CSMA with collision detection – IEEE 802.3 standards for LAN

Module 3

Network layer: Virtual Circuits, Datagrams, Routing Algorithm – Optimality principle - Flooding - Flow Based Routing - Link state routing – Distance vector routing – Multicasting – Link state multicasting – Distance vector multicasting - Congestion Control Algorithms – General principles – Packet discarding – Choke packets - Congestion prevention policies – Traffic shaping – Leaky bucket algorithm – Flow specifications – jitter control

Module 4

Transport Layer: - Transport Service - Elements of transport protocols – Internet Transfer Protocols UDP and TCP – ATM – Principle characteristics.

Module 5

Application Layer: Domain name system – DNS name space – Resource records – Name servers – operation of DNS - Electronic Mail – MIME

Mobile networks: Mobile telephone systems, Bluetooth - Components – Error correction – Network topology – Piconet and scatternet – L2CAP layers – Communication in Bluetooth networks

References

1. Computer Networks (Fourth Edition): Andrew S.Tanenbaum, Pearson Education Asia/ PHI

2. An Introduction to computer networking: Kenneth C. Mansfield Jr., James L. Antonakos, Prentice-Hall India

3. Communication Network: Leon, Garcia, Widjaja Tata McGraw Hill.

4. Computer Networks (Second Edition): Larry L Peterson & Bruce S Davie, (Harcourt India)

5. Computer Networking: James F Kurose & Keith W Ross, Pearson Education

6. Introduction to Data Communications and Networking: Behrouz, Forouzan, McGraw Hill

NETWORK COMPUTING

RT 605 3+1+0

Module 1

HTML Documents Basic Tags for Font & Paragraph Formatting Lists, Tables, Frames, image Maps

Cascading Style Sheets Style Element, Inline style sheets, Embedded style sheets, External Style sheets, CLASS Attribute, Absolute and relative positioning of elements, DIV & SPAN Tags.

Module 2

Dynamic HTML Pages Client side scripting - Java Script – variables, Arithmetic operations – message boxes, Arrays, control statements, functions, event handling, document object model.

Dynamic updating of pages with JAVA Script.

Embedding ActiveX controls - using the structured graphics – ActiveX Control.

Module 3

Java programming – Features of Java, Creating & using classes in Java – Static classes – Inheritance – Final methods, variables and classes – Interfaces - Nested classes – Inner classes – Anonymous Inner classes – Exception handling – Creating & using exceptions, Multithreaded programs and thread synchronization, creating and using packages. Creating GUI with AWT and Swing – -JDK1.1 event model

Module 4

Network Programming with Java - Features of Java – Applets & Application – Life cycle of applets - Security features for applets - Inter applet communication – Threads & Thread synchronization – TCP/IP Programming with Java – Iterative & Concurrent servers. Datagrams, IP multicasting, RMI (Structure and Working of a simple RMI Program only)

Module 5

HTTP Protocol working – HTTP methods, GET, PUT, DELETE, POST, HEAD

Server side scripting – HTML Forms & CGI – GET & POST, Basic working of a CGI supported web server – Simple CGI program in C to validate user name & Password. Email: Working of SMTP and POP protocols (Overview only).

References

Module 1,2,5

1. Internet and World Wide Web How to program - Deitel,Deitel & Nieto, Pearson Education Asia

2. HTML, DHTML, Java Script, Perl, CGI - Evan Bayross, BPB

Module 3,4,5

3. Java 2 Complete reference - Herbert, Schildt, Tata McGraw Hill

4. Java 2, AWT, Swing, XML and JavaBeans Programming Black Book – Steven Holzner, Wiley Dreamtech

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

6. Using Java 2 Platform - Joseph Weber, PHI

7. Computer Networks - Tenanbaum, PHI/ Pearson Education Asia

Additional References

8. Unix Network Programming - Stevens W Richard, PHI

9. TCP/IP Protocol suite, 2/e -Behrouz A. Forouzan, TMH

ALGORITHM ANALYSIS AND DESIGN

R606 3+1+0

Module 1 Introduction and Complexity

What is an algorithm – Properties of an Algorithm, Difference between Algorithm, Computational Procedure and Program, Study of Algorithms; Pseudo-code Conventions; Recursive Algorithms –Space and Time Complexity –Asymptotic Notations – ‘Oh’, ‘Omega’, ‘Theta’, Common Complexity Functions; Recurrence Relations and Recurrence Trees for Complexity Calculations; Profiling. –Deterministic and non - deterministic algorithms.

Module 2 Divide and Conquer

Control Abstraction, Finding Maximum and Minimum, Binary Search, Divide and Conquer Matrix Multiplication, Stressen’s Matrix Multiplication, Merge Sort, Quick Sort.

Module 3 Greedy Strategy

Control Abstraction, General Knapsack Problem, Optimal Storage on Tapes, Minimum Cost Spanning Trees – Prim’s Algorithm, Kruskal’s Algorithm – Job sequencing with deadlines.

Module 4 Dynamic Programming

Principle of Optimality, Multi-stage Graph, All-Pairs Shortest Paths, Travelling Salesman Problem.

Lower Bound Theory - Comparison Trees for Searching and Sorting, Oracles and Adversary Arguments – Merging, Insertion & Selection Sort; Selection of ‘k’^th Smallest Element.

Module 5 Backtracking

Control Abstraction - Bounding Functions, Control Abstraction, N-Queens Problem, Sum of Subsets, Knapsack problem.

Branch and Bound Techniques – FIFO, LIFO, and LC Control Abstractions, 15-puzzle, Travelling Salesman Problem.

Text Book

1. Fundamentals of Computer Algorithms - Horowitz and Sahni, Galgotia

References

1. Computer Algorithms – Introduction to Design and Analysis - Sara Baase & Allen Van Gelder, Pearson Education

2. Data Structures algorithms and applications - Sahni, Tata McGrHill

3. Foundations of Algorithms - Richard Neapolitan, Kumarss N., DC Hearth & Company

4. Introduction to algorithm- Thomas Coremen, Charles, Ronald Rivest -PHI

SYSTEM SOFTWARE LAB

R607 0+0+4

Symbol table construction
Single pass and two pass assembler.
Macro processor module binder (with limited Instruction set)
Lexical analyzer.
Bottom Up and Top Down Parser.
Code generation.
Generation of code for linkers & loaders. Working of device drivers, process scheduling methods.

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

MINI PROJECT

R608 0+0+4

The aim of the mini project is to prepare the students for the final year project. The topic for the mini project should be simple as compared to the main project, but should cover all the aspects of a complete project.

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

2008-05-31T23:03:00.000-07:00

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

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

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:

Creation, insertion, updation, deletion of tables, indexes, views
Simple queries, nested queries, use of arithmetic and string functions.
Simple PL/SQL programs, use of exceptions, savepoints, cursor, procedure, function, trigger, sequence generator.
Importing and Exporting data.
Database Administration
ODBC/JDBC Interface.
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

2008-05-31T22:59:00.001-07:00

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

Fundamentals of Data Structures in C++: Horowitz, Sahni & Mehta, Galgottia Pub.
Classic Data Structures: Samanta, PHI
Data Structures and program design in C: Robert Kruse, Pearson Education Asia
Data Structures using C & C++: Langsam, Augenstein & Tanenbaum
Fundamental Algorithms: Knuth.
Algorithms + Data Structures = Programs: N.Wirth, PHI
An introduction to Data Structures with applications: Trembley & Sorenson, McGraw Hill
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.

Semester 3 Syllabus, S3 Syllabus, Syllabus Of Computer Science Engineering, MG University

2008-05-31T22:52:00.000-07:00

ENGINEERING MATHEMATICS - II

RT301 3+1+0

Module1

Mathematical Logic - Statements, connectives - Well formed formulas – Tautologoies - Equivalance of formulas - Duality law Tautological implications - Normal forms - the theory of inference for the statement - Calculus - validity, Consistency, Theorem proving - the predicate calculus - Inference Theory of the predicate calculus.

Module 2

Number Theory: Prime and Relatively prime numbers – Modular arithmetic – Fermat’s and Euler’s Theorems – Testing for Primability – Euclids Algorithm – Discrete Logarithms

Relations & Functions - Properties of binary relations - Equivalance relations and partitions - Functions and pigeon hole principle.

Module 3

Algebraic systems - general properties - Lattices as a partially ordered set - some properties of lattices - lattices as algebraic systems - sub lattices - direct product - homomorphism - some special lattices.

Module 4

Discrete Numeric Functions & generating Functions, Recurrence relations - Manipulations of Numeric functions - generating functions - Recurrence relations - Linear recurrence relations with constant coefficients - Homogeneous solutions - Particular solutions - Total solutions - solutions by the method of generating functions.

Module 5

Graph Theory: Basic concept of graphs, subgraphs, connected graphs, Paths, Cycles, Multigraph and Weighted graph - Trees - spanning trees.

References

1. Elements of Discrete Mathematics - C.L.Lieu, McGraw Hill.

2. Discrete mathematical structures with applications to Computer Science - J.P. Trembly, R. Manohar, McGraw Hill.

3. Discrete Mathematics - Richard Johnsonbaugh, Pearson Education Asia

4. Discrete Mathematical Structures - Bernard Kolman, Robert C. Bushy, Sharon Cutler Ross, PHI

5. A first look at Graph Theory - John Clark & Derek Allan Holton, Allied Publishers

6. Cryptography and network security principles and practice - William Stallings, Pearson Education Asia

MICROPROCESSOR SYSTEMS

R302 3+1+0

Module 1

CPU, I/P unit, O/P unit, Memory, Bus organizations, ALU, Control Unit, Registers, Execution of an instruction, Main memory, Addressing, Memory Address Register - Memory Data Register – Memory systems - Architecture of 8085- Pin Diagram - Registers.

Module 2

Instruction set of 8085 - Instruction Types – Arithmetic – Logic data transfer, Branch, Stack, I/O and Machine Control instructions - Addressing Modes - Direct and Indirect Addressing - Immediate Addressing - Implicit Addressing.

Module 3

Subroutines - Stack Operations - Call Return sequence- Programming Examples.

CPU of a microcomputer – timing and control unit – The fetch operation – Machine cycle and T- State instruction and data flow.

Module 4

Interrupts of 8085 - Hardware & Software Interrupts – Enabling, Disabling and masking of interrupts – Polling – HALT & HOLD states – Programmable interrupt controller – 8259

Module 5

Interfacing Memory and I/O devices - Address space partitioning - Memory mapped I/O - I/O mapped I/O - Memory interfacing - interfacing EPROM & RAM to 8085 – Data transfer schemes - Programmed data transfer - synchronous and asynchronous transfer - interrupt driven data transfer – DMA data transfer – DMA controller – 8257 – I/O channels.

References

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

2. Microprocessors, interfacing and Applications - Renu Singh, B. P. Singh, New Age International

3. Microprocessors - B. Ram

4. Introduction to Microprocessors Systems - Adithya P. Mathur, PHI

5. Microprocessors Peripherals and Applications - Gilmore

SOLID STATE ELECTRONICS

RT303 2+1+0

Module 1

Transistor – Biasing - Stability - Thermal runaway. Transistor As an amplifier - RC coupled amplifier, Frequency Response, Gain Bandwidth relation - Cascading of transistors - cascade Darlington pair - emitter follower

Module 2

FET, FET amplifier – MOSFET, depletion and enhancement type - source drain characteristics and transfer characteristics.

Module 3

Oscillators - Concept of feed back - Transistorised phase shift oscillator - wien bridge Oscillator – Hartley Oscillator - Colpits Oscillator (Operation and Expression for frequency)

Module 4

Clipping, Clamping, Integration, Differentiation - Astable, Bistable and Monostable Multivibrators - Sweep generators, Simple Bootstrap sweep generators.

Module 5

Power supplies & Special semi conductor devices - Regulator power supplies – IC regulated Power supplies, 7805, 7905, LM317 – LED, LCD, Photodiode, Photo transistor, opto coupler. Seven segment display, SCR, UJT (basic concepts only), DIAC, TRIAC.

References

1. Integrated Electronics - Millman and Halkias, McGraw Hill

2. Pulse Digital and Switching wave forms - Millman and Taub, McGraw Hill

3. Electronics Devices & Circuits - Boylsted & Neshelsky, Pearson Education

PROBLEM SOLVING AND COMPUTER PROGRAMMING

RT 304 3+1+0

Module 1

Problem solving with digital Computer - Steps in Computer programming - Features of a good program - Modular Programming - Structured - Object Oriented - Top down and bottom up approaches - Algorithms - Flowchart - Pseudocode, examples

Module2

C fundamentals: Identifiers, keywords, data types, operators, expressions, data Input and Output statements, simple programming in C.

Module 3

Control statements & Functions: If - else, for, while, do - while, switch, break & continue statements, nested loops. Functions - parameter passing - void functions Recursion – Macros.

Module 4

Structured data types: Single dimensional arrays - multidimensional arrays, strings, structures & unions - Program for bubble sort.

Module 5

Pointers & files - Declaration, passing pointers to a functions- Accessing array elements using pointers - Operations on pointers - Opening & Closing a file - Creating & Processing a file, Command line arguments.

Text Book

Programming with C - Byron S. Gottfried, Tata McGraw Hill

References

1. Computer Programming in C - Kerninghan & Ritchie, PHI

2. Programming with ANSI and Turbo C - Ashok N. Kamthan, Pearson Eduacation

3. Let us - Yeaswanth Khanetkar, BPB

4. Programming in C - Stephen C. Kochan, CBS publishers

5. Using C in Program Design - Ronald Leach, Prism Books Pvt. Ltd, Bangalore

6. Mastering Turbo C - Bootle, BPB Publications

7. Programming and Problem Solving with PASCAL - Micheal Schneider, Wiley Eastern Ltd.

8. Pointers in C - Yeaswanth Khanetkar, PBP

9. C Programming - A Modern Approach - K.N. Iling W.W. Norton & Company Newyork

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

HUMANITIES

RT305 2+1+0

PART A: PRINCIPLES OF MANAGEMENT

Module 1

Scientific Management – Evolution of management theory – Contributions of Taylor, Gilbreth, Gantt, Emerson – Definition and functions of management – Authority, Responsibility, Delegation and Span of control – Types of structures of Organisation – Types of Business firms – Job evaluation and merit rating – Wages – Types of incentives.

Module 2

Procedure for ISO and ISI certification – Design, Development and implementation of re-engineering – Inspection – SQC control charts – quality assurance – TQM – Zero defects.

PART B: ENGINEERING ECONOMICS

Module 3

The Indian financial system – Reserve bank of India – functions – commercial banking system – profitability of public sector banks – development financial institutions – IDBI, ICICI, SIDBI, IRBI – Investment institutions – UTI, Insurance companies– The stock market – functions – Recent trends.

Module 4

Indian Industries – Industrial pattern – structural transformation – industrial growth – inadequacies of the programme of industrialization – Large and small scale industries – industrial sickness and government policy – industrial labour – influence of trade unions.

Module 5

The tax framework – Direct and Indirect taxes – Impact and incidence – Progressive and regressive – functions of the tax system – Black money – magnitude and consequences – Public debt – Debt position of the central and state governments – Deficit financing – revenue deficit and fiscal deficit – Problems associated with deficit financing.

References

1. Management- Stoner, Freeman and Gilbert, PHI

2. Engineering Management- Mazda, Pearson Education

3. Indian Economy - Ruddar Datt, S Chand and Company Ltd.

4. Indian Economy – Problems of Development and Planning - A. N. Agarwal, Wishwa Prakashan.

LOGIC SYSTEM DESIGN

R306 3+1+0

Module 1

Addition, Subtraction, Multiplication & division of binary nos, BCD nos, excess-3 code, gray code, alphanumeric codes, error detection using parity bits - error correcting codes, haming code.

Module 2

Postulates of boolean algebra - basic theorems - Logic functions - truth tables - canonical forms - SOP, POS - methods of minimization of logic functions - K maps & quine mcclaskey method - realization using logic gates - NAND NOR gates - universal gates - don’t care combinations - formation of switching function - from word statements.

Module3

Sequential logic - flip flops - SR, JK, T & D flip flops - master slave JK flip flop, Counters - asynchronous, binary decade, and up/down counters - synchronous binary decade, and up/down counters.

Module4

Adders - design - Half adder, Full adder, Half subtractor & Full subtractor - Carry look ahead adder, carry save adder, carry propagation adder.

Module 5

Registers - serial in & parallel in shift registers - left & right shift registers - static shift registers - typical IC’s - counters using shift registers - ring counter, Johnson counter.

References

1. An introduction to digital computer design - Rajaraman & Radhakrishnan, PHI

2. Logic and Computer Design – M. Moris Mano, Charles R. Kime Pearson Education

3. Switching & finite automata theory - Zvi Kohavi, Tata McGraw Hill

4. Digital computer fundamentals - Thomas C. Bartee, Tata McGraw Hill.

5. Digital Computer Design - Malvino, Tata McGraw Hill.

6. Digital Design - Morris Mano, Pearson Education

7. Digital Design Principles & Practice – John F. Wakerly, Pearson Education

SOLID STATE ELECTRONICS LAB

R307 0+0+4

1. Characteristics of Silicon, Germanium, Zener diodes.

2. Characterisctics of CE, CB configurations of transistors; Characteristics of FET.

3. Clipping and clamping Circuits - RC differentiating and Integrating Circuits.

4. Half wave and full wave an Bridge rectifiers.

5. Single stage RC coupled amplifiers - Frequency response

6. Astable multivibrators using BJT.

7. Sweep Generator (Simple sweep)

8. Oscillators - Rc phase shift oscillator.

PROGRAMMING LAB

R308 0+0+4

1. Familiarisation with computer system microprocessor - peripherals - memory card etc.

2. Familiarisation of operating system - DOS Windows etc. (use of files, directories, internal commands, external commands, compilers, file manager, program manager, control panel etc.)

3. Familiarisation with word processing packages like wordstar and Msword

4. Progrmming experiments in C to cover control structures - functions - arrays - Structures - pointers and files.

5. Familiarisation of C++ and Visual tools.

Any experiment according to the syllabus of RT304 problem solving and Computer Programming can be included.