EN010501 B Engineering Mathematics IV
|
Objectives:
To use basic numerical techniques for
solving problems and to know the importance of learning theories in mathmatics
and in queueing system.
MODULE 1 Finite differences (12 hours)
Finite difference
operators 
-
interpolation using Newtons forward and backward formula –Newton’s divided
difference formula - Numerical differentiation using Newtons forward and
backward formula – Numerical integration
– Trapezoidal rule – Simpsons 1/3rd and 3/8th rule
-
interpolation using Newtons forward and backward formula –Newton’s divided
difference formula - Numerical differentiation using Newtons forward and
backward formula – Numerical integration
– Trapezoidal rule – Simpsons 1/3rd and 3/8th rule
MODULE
2 Z transforms (12 hours)
Definition of Z
transforms – transform of polynomial function and trignometric functions
– shifting property , convolution property - inverse transformation – solution
of 1st and 2nd
order difference equations with constant coifficients using Z transforms.
MODULE 3 Discrete numeric
functions (12 hours)
Discrete numeric functions –
Manipulations of numeric functions- generating functions –Recurrence relations
– Linear recurrence relations with constant coefficients – Homogeneous
solutions – Particular solutions – Total solution – solution by the method of
generating functions.
MODULE 4 Complex integration (12 hours)
Functions of complex variable – analytic function - Line integral –
Cauchy’s integral theorem – Cauchy’s integral formula – Taylor’s series-
Laurent’s series – Zeros and singularities – types of singularities – Residues
– Residue theorem – evaluation of real integrals in unit circle – contour
integral in semi circle when poles lie on imaginary axis.
MODULE 5 Queueing Theory (12 hours)
General concepts –
Arrival pattern – service pattern – Queue disciplines – The Markovian
model M/M/1/
,
M/M/1/N – steady state solutions – Little’s formula.
,
M/M/1/N – steady state solutions – Little’s formula.
References
1. C.L.Liu and
D.P. Mohapatra – Elements of Discrete Mathematics - Mc Graw Hill
2. S.Lipschutz,
M.L.Lipson – Discrete mathematics –Schaum’s outlines – Mc Graw Hill
3. B.V. Ramana
- Higher Engg. Mathematics – McGraw Hill
4. Babu Ram –
Engg. Mathematics -Pearson.
5. K
Venkataraman- Numerical methods in science and Engg -National publishing co
6. V.
Sundarapandian - probability ,Statistics and Queueing theory - PHI
7. S.Bathul –
text book of Engg.Mathematics – Special functions and complex variables –PHI
8. H. Weif HSU
– probability, random variables & Random processes – Schaum’s out lines -
Mc Graw Hill
9. T.Veerarajan
- probability ,Statistics & Random processes - Mc Graw Hill
10. H.C.Taneja –
Advanced Engg. Mathematics Vol II – I.K.International
IT 010 IT 502:MICROPROCESSORS AND MICROCONTROLLERS
|
Objective:
- To have an in depth knowledge of the architecture and programming of 8-bit and 16-bit Microprocessors, Microcontrollers and to study how to interface various peripheral devices with them
Module 1: (10 hrs)
Intel 8086 Microprocessor:- Architecture, Pin Diagram, Register Organization,
Memory Organization- Memory Banks- Concept of Segmentation and Physical Address
Calculation, Operating Modes- Minimum and Maximum Modes, Timing Diagram- Concepts
of T-State, Machine Cycle and Instruction Cycle- Memory Read/ Write Cycles, I/O
Read/ Write Cycles.
Module 2: (10 Hrs)
Programming with 8086 Microprocessor:-
Instruction Set, Assembler Directives, Addressing Modes, Programming Examples,
8086 Interrupts- Hardware and Software Interrupts.
Module 3: (14 Hrs)
Microprocessor Interfacing:-
Memory and I/O Addressing- Memory and I/O Mapped I/O, USART 8251A, Programmable
Peripheral Interface 8255, Programmable Interval Timer 8254, Programmable
Keyboard./ Display Interface 8279, Programmable Interrupt Controller 8259, Programmable
DMA Controller 8257, Hard-disk Interface- SCSI, IDE.
Module 4:(13 Hrs)
Introduction to Microcontrollers:-
Comparison of Microcontroller with Microprocessor, Features of 8051 Microcontroller,
Architecture, Pin Diagram, I/O Ports,
Addressing Modes, Instruction Set, Programming Examples.
Module 5:( 13 Hrs)
Memory Organization- External
Memory Interfacing, Interrupts and Timers/ Counters- Applications- Interfacing
8051 with Switches, LEDs, Matrix Keyboards, Seven Segment Display, LCDs,
Stepper Motor
.
Text Books:-
1.
Douglas V.Hall Microprocessors and Interfacing Tata
MCGraw Hill
2.
Muhammad
Ali Mazidi, The 8051 Microcontroller
Pearson Education.
|
Reference:
1. Brey B.B., The Intel Microprocessors -
Architecture, Programming & Interfacing,
Prentice Hall
2.
Badri RAM Advanced Microprocessors
and Interfacing Tata MCGraw hill
3.
V Udayashankar and M.S. Mallikarajunaswamy 8051 Microcontroller Hardware Software and
Applications- Tata McGraw Hill
4.
Ajay Deshmukh Microcontrollers( theory and Applications)
Tata McGraw Hill.
5. Kenneth J Ayala, The 8051 Microcontroller Penram International
|
IT010 503: DATA COMMUNICATION
Module 1 (12
Hours)
Introduction to
Data Communication-Components, Data Representation, Data Flow. Networks,
Network Topologies, Protocols and Standards, Network Models, OSI Model, Layers
in OSI Model, IEEE Standards –
Ethernet – Token Ring – FDDI –Token Bus – Wireless LAN
Module 2 (13
Hours)
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 (13
Hours)
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 (10
Hours)
Terminal
handling – Point to point, Multidrop lines. Components of computer
communication – Transmission media – Guided media – Twisted pair cable, coaxial
cable, fiber optic cable. Digital Subscriber Line, Cable TV Networks.
Module 5 (12
Hours)
Media Access Control – SDMA, FDMA,
TDMA, CDMA – GSM – Architecture, Protocols, Connection Establishment, Frequency
Allocation , Localization, Handover, Security – GPRS.
References
|
IT010 504: Operating
Systems
(Common
with CS010 505)
|
Objectives
·
To understand the fundamental concepts and techniques
of Operating Systems.
·
To study the basic structure of Linux system.
Module I (8 hours)
Introduction:
Operating System – Batch, Multiprogrammed, Time-sharing and Real time systems – Operating
system structure – Operating system operations
System
Structures: Operating system service – System calls – System Programs – System structure – Simple structure, Layered approach – Kernel, Shell.
Module II (12 hours)
Process Management:
Process concept – Process state,
PCB – Process scheduling – Operations on processes – Interprocess communication
– Multithreading –Benefits, Models
Process Scheduling: Basic concepts – Preemptive scheduling, Dispatcher – Scheduling criteria – Scheduling algorithms – Multiple-processor scheduling.
Module III (16 hours)
Process
Synchronization: The Critical-Section problem – Peterson’s solution – Synchronization Hardware – Semaphores – Classic problems of synchronization
– Monitors
Deadlocks: System model –
Deadlock characterization – Methods for handling deadlocks – Prevention,
Avoidance and Detection – Recovery from deadlock.
Module IV (14 hours)
Memory Management:
Resident Monitor – Dynamic loading – Swapping – Contiguous memory allocation – Paging – Basic, Multi-level Paging – Segmentation
Virtual Memory –
Demand Paging – Page
Replacement algorithms – Allocation of
Frames – Thrashing – Cause of thrashing.
Module V (10 hours)
File System: File concept –
Access methods – Directory structure – Directory implementation – Linear
list, Hash table – Disk scheduling
Case study: Linux system.
|
5010 505: Language Translators
|
·
To understand the
different stages of the process of programming language translation
Module I (10 hours)
Introduction to programming
language translation - Design of Interpreters,
Incremental Compilers, assemblers, macro processors, linkers and
loaders (Basic Concepts Only) Structure of a compiler- Analysis/Synthesis model
of compilation, phases of a compiler, compiler construction tools Lexical
Analysis- Interface with input, parser and symbol table, token, lexeme and
patterns, difficulties in lexical analysis, error reporting and implementation,
Specification and recognition of tokens- Regular Expressions, Regular
definitions, Transition diagrams- LEX.
Module II (12 hours)
Syntax Analysis- Compile time
error handling- Error detection, reporting, recovery and repair Context free
grammars-ambiguity, associativity, precedence Top down parsing- Recursive
descent parsing , transformation on the grammars Predictive parsing-simple
LL(1) grammar Bottom up parsing- Operator precedence grammars, LR parsers -
LR(0), SLR(1), LALR(1) YACC.
Module III (14 hours)
Syntax Directed Translation-
Syntax directed definitions, Inherited and synthesized attribute, dependency
graph, e valuation order, bottom up and top down evaluation of attributes, L-
and S- attributed definitions Type Checking-Type system, type expressions,
structural and name equivalence of types, type conversion, overloaded functions
and operators, polymorphic functions Run Time Environments- Storage organisation,
activation tree, activation record, parameter passing, symbol table, dynamic
storage allocation
Module IV (12 hours)
Intermediate Code Generation-
Intermediate representations, translation of declarations, assignments,
intermediate code generation for control flow, boolean expressions and
procedure calls, implementation issues Code Generation and Instruction
Selection- Issues, basic blocks and flow graphs, register allocation, code
generation DAG representation of programs- Code generation from DAGs, peephole
optimization, code generator generators, specifications of machine
Module V (12 hours)
Code Optimization- Sources of
optimizations, Optimization of basic blocks, Loops in flow graphs, global
dataflow analysis, Iterative solution of data-flow equations, Code improving
transformations, dealing with aliases, dataflow analysis of structured flow
graphs.
|
IT010 506: Database Management Systems
(Common with CS010 503)
|
Objectives
·
To impart an introduction to the theory and practice
of database systems.
·
To develop basic knowledge on data modelling and
design of efficient relations.
·
To provide exposure to oracle database programming.
Module I (10 hours)
Basic Concepts -
Purpose of Database Systems- 3 Schema Architecture and Data Independence-
Components of DBMS –Data Models, Schemas and Instances-Data Modeling using the
Entity Relationship Model-Entity types, Relationship Types, Weak Entity Types .
Module II (14 hours)
Relational Model Concepts –Constraints – Entity Integrity
and Referential Integrity, Relational Algebra -Select, Project, Operations from
Set Theory, Join, OuterJoin and Division - Tuple Relational Calculus.
SQL- Data Definition with SQL - Insert, Delete and Update
Statements in SQL, Defining Domains, Schemas and Constraints, Constraint
Violations - Basic Queries in SQL - Select Statement, Use of Aggregate
functions and Group Retrieval, Nested Queries, Correlated Queries – Views.
Module III (12 hours)
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 - Assertions – Triggers.
Indexing and Hashing Concepts -: Ordered Indices, Hash
Indices, Dense and Sparse Indices, Multi Level Indices, Cluster Index, Dynamic
Hashing.
Module IV (11 hours)
Database Design– Design Guidelines–
Relational Database Design – Functional Dependency- Determination of Candidate
Keys, Super Key, Foreign Key, Normalization using Functional Dependencies,
Normal Forms based on Primary keys- General Definitions of First, Second and
Third Normal Forms. Boyce Codd Normal Form–
Multi-valued Dependencies and Forth Normal
Form – Join Dependencies and Fifth Normal Form
– Pitfalls in Relational Database Design.
Module V (13 hours)
Introduction to Transaction Processing-
Transactions- ACID Properties of Transactions- Schedules- Serializability of Schedules-
Precedence Graph- Concurrency Control – Locks and Timestamps-Database Recovery
Query processing and Optimization-
Translating SQL Queries into a Relational Algebra Computing Select, Project and
Join
Object Relational Databases-Distributed
Databases-Different Types-Fragmentation and Replication Techniques-Functions of
DDBMS.
|
IT010
507: PC Hardware and Microprocessors
Lab
|
Objectives
·
To
provide experience on assembling and troubleshooting of PC hardware
·
To be able to write microprocessor based programs and to understand the interfacing of peripheral devices with
the microprocessors
- Study of SMPS, TTL and composite type monitor circuits, Emulator, Logic state analyser, Serial port, Parallel port, Mother board, Display adapter card, Hard disk controller, Printer Interface, Keyboard Interface
- Identification of components/cards and PC assembling from components.
- Trouble shooting and maintenance -Common maintenance problems, Diagnostic software, Diagnostic cards, Designing and Programming add on cards.
- Programming with 8086 (Any 3 Experiments including BIOS/DOS Calls, Keyboard Control, Display, File Manipulation).
- Interfacing with 8086-8255,8253.
- Interfacing with 8086-8279,8251.
- ADC interface, Stepper Motor interface using DAC, Parallel Interface- Printer and HEX keyboard, Serial Interface- PC to PC serial interface using MODEM. (Any 2 Experiments)
- 8051 Micro controller based experiments – Simple assembly language programs (optional).
- 8051 Micro controller based experiments – Simple control applications (optional).
| ||
|
IT010
508: Systems Lab
|
·
To understand operating system structures and the implementation
aspects of various OS functions and schedulers.
·
To be able to design databases, write queries and develop applications.
Part 1:
Operating systems
- Basic UNIX commands and shell programming
- Introduction to the tools providing GUI based human computer interaction (for example Qt.) Automatic generation of code for interaction using visual programming (for example Qt Designer).
- Exercises involving the system calls fork(),exec(),create() etc.
- Implementation of typical problems such as bounded buffer, dining philosophers etc. by multiprogramming using threads, semaphores and shared memory
- Inter-process communication using mailboxes and pipes
Part 2:
Database management systems
- Familiarization of MySQL database- creation and manipulation of tables.
- Analyze a given situation such as Banking, Electricity Billing, Library Management, Payroll, Insurance ,Inventory, Health Care, Cricket Board Database, College Admission, Question Paper Bank, Hostel Management etc. Design and implement the database. Manipulate the tables using SQL commands.
- Develop a 2 tier application for the above situation using a suitable front end.
|
||
|
No comments:
Post a Comment