EN010401 Engineering Mathematics III
|
Objectives: Apply standard methods of mathematical &statistical analysis
MODULE 1 Fourier series (
12 hours)
Dirichlet conditions – Fourier series with period 2 π
and 2l – Half range sine and cosine series – Harmonic Analysis – r.m.s Value
MODULE 2 Fourier Transform ( 12
hours)
Statement
of Fourier integral theorem – Fourier transforms – derivative of transforms-
convolution theorem (no proof) – Parsevals identity
MODULE 3 Partial
differential equations (
12 hours)
Formation
by eliminating arbitrary constants and arbitrary functions – solution of
Lagrange’s equation – Charpits method
–solution of Homogeneous partical differential equations with constant coefficients
MODULE 4 Probability
distribution (
12 hours)
Concept
of random variable , probability distribution – Bernoulli’s trial – Discrete
distribution – Binomial distribution – its mean and variance- fitting of
Binominal distribution – Poisson distribution as a limiting case of Binominal
distribution – its mean and variance – fitting of Poisson distribution –
continuous distribution- Uniform distribution – exponential distribution – its
mean and variance – Normal distribution – Standard normal curve- its properties
MODULE 5 Testing
of hypothesis (
12 hours)
Populations
and Samples – Hypothesis – level of significance – type I and type II error –
Large samples tests – test of significance for single proportion, difference of
proportion, single mean, difference of mean – chi –square test for
variance- F test for equality of
variances for small samples
References
1. Bali&
Iyengar – A text books of Engg. Mathematics – Laxmi Publications Ltd.
2. M.K.
Venkataraman – Engg. Mathematics vol II 3rd year part A & B –
National Publishing Co.
3. I.N. Sneddon
– Elements of partial differential equations – Mc Graw Hill
4. B.V. Ramana
– Higher Engg. Mathematics – Mc Graw Hill
5. Richard A
Johnson – Miller Fread’s probability & Statistics for Engineers- Pearson/
PHI
6. T.
Veerarajan – Engg. Mathematics – Mc Graw Hill
7. G.
Haribaskaran – Probability, Queueing theory and reliability Engg. – Laxmi
Publications
8. V.
Sundarapandian - probability ,Statistics and Queueing theory – PHI
9. H.C.Taneja –
Advanced Engg. Mathematics Vol II – I.K.International
10. A.K.Mukhopadhyay-Mathematical Methods For Engineers and
Physicists-I.K.International
EN010 402(ME): Principles of Management
(Common with EN010 502(ME))
|
Objectives
·
To develop an understanding of different functional
areas of management.
·
To understand the functions and duties an individual
should perform in an organisation.
Module I (12 hours)
Management Concepts: Vision, Mission, Goals and Objectives of
management-MBO- Scientific management- Functions of management- Planning-
Organizing- Staffing- Directing- Motivating- Communicating- Coordinating-
Controlling- Authority and Responsibility- Delegation- Span of control-
Organizational structure- Line, Line and staff and Functional relationship.
Module II (12 hours)
Personnel Management: Definition and concept- Objectives of
personnel management- Manpower planning- Recruitment and Selection of manpower-
Training and development of manpower- Labour welfare- Labour turnover- Quality
circle- Industrial fatigue- Industrial disputes-Method of settling disputes-
Trade unions.
Module III (12 hours)
Production management: Objectives and scope of production
management- Functions of production department- production management frame
work- product life cycle-Types of production- Production procedure- Project
planning with CPM and PERT- Basic concepts in network.
Module IV (12 hours)
Financial Management:
Objectives and Functions of Financial Management- Types of Capital- Factors
affecting working capital- Methods of financing.
Cost Management:
Elements of cost- Components of cost- Selling Price of a product.
Module V (12 hours)
Sales and Marketing Management: Sales management- Concept-
Functions of sales department- Duties of sales engineer- Selling concept and
Marketing concept- Marketing- Definition and principles of marketing- Marketing
management and its functions- Sales forecasting- Pricing- Advertising- Sales
promotion- Channels of distribution- Market research.
|
IT 010 404: Theory of Computation
(Common with CS 010 406)
|
·
To impart the basic
concepts of theory of automata ,languages and computation.
·
To develop
understanding about machines for sequential computation, formal languages and
grammars , and classification of feasible and intractable problems.
Module I (10 hours)
Proving techniques-Mathematical
induction -Diagonalization principle –Pigeonhole principle- Functions –
Primitive recursive and partial recursive functions – Computable and non
computable functions—-Formal representation of languages – Chomsky
Classification.
Module II (13 hours)
Introduction to Automata theory –
Definition of Automation – Finite Automata –Language acceptability by Finite
Automata –Deterministic and Nondeterministic finite automation- Regular
Expressions – Finite Automation with Î-Transitions –Conversion of NFA to DFA - Minimisation of
DFA-DFA to Regular Expressions conversion-pumping lemma for regular languages –
Applications of finite automata-NFA with
o/p ( moore /mealy)
Module
III (12 hours)
Context Free Grammar
–Simplification of CFG-Normal forms-Chomsky Normal form and Greibach Normal
form- pumping lemma for Context free languages- Applications of PDA -Pushdown
Automata – Formal definition – Language acceptability by PDA through empty stack and final state –
Deterministic and nondeterministic PDA – designing of PDA-
Module IV (13 hours)
Turing Machines – Formal
definition – Language acceptability by TM –TM as acceptors, Transducers - designing
of TM- Two way infinite TM- Multi tape
TM - Universal Turing Machines-
Church
Module V (12 hours)
Complexity classes- Tractable problems– Class P –P
Complete-Reduction problem- Context grammar nonempty-Intractable problems-
Class NP – NP Complete- Cooks theorem-Reduction
problems-SAT-Clique-Hamiltonian-TSP-Vertex Cover-NP Hard problems.
|
IT010 405: Data Structures and
Algorithms
(Common with CS010 403)
Teaching scheme Credits:
4
3 hours lecture
and 1 hour tutorial per week
Teaching scheme Credits:
4
3 hours lecture
and 1 hour tutorial per week
|
O bjectives
·
To impart the basic
concepts of data structures and algorithms
·
To develop
understanding about writing algorithms and step by step approach in solving
problems with the help of fundamental data structures.
Module I (10 hours)
Principles
of programming – System Life Cycle - Performance Analysis and Measurements-
Time and Space complexity-Complexity calculation of simple algorithms. Hashing:-
Static Hashing-Hash Tables-Different Hash Functions-Mid Square-
Division-Folding-Digit Analysis,
Collision-Collision Resolution Techniques.
Module II (12hours)
Study of basic data structures
– Arrays- Structures-Sparse matrix –
Stacks – Queues- Circular queues- Priority queues - Dqueues. Evaluation of
expressions – Polynomial representation using arrays.
Module
III (12hours)
Linked Lists - Linked
stacks and queues - Doubly linked lists – Polynomial representation using
linked lists, Garbage collection and Compaction.
Module IV (14 hours)
Trees - Binary Trees –
Tree Traversal – Inorder - Preorder and Postorder,
Search trees - AVL Trees,
height balanced trees, Multiway search Trees- B Trees-B+ Trees. Graphs – Depth
first and breadth first search.
Module V (12 hours)
Sorting methods: Selection sort, Bubble sort, Insertion
sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods.
|
IT 010 406: OBJECT Oriented Techniques
|
Objectives:
·
To present the concept of object oriented
programming and discuss the important elements of C++ and Java.
·
Write simple applications using C++ and Java.
Module I
10
Object-oriented paradigm,
elements of object oriented programming – Merits and demerits of OO methodology
– C++ fundamentals – data types, operators and expressions, control flow,
arrays, strings, pointers and functions.
Module II 14
Classes
and objects – constructors and destructors, operator overloading – inheritance,
virtual functions and polymorphism, namespaces, Templates, Standard Template
Library
Module III 12
An
overview of Java, data types, variables and arrays, operators, control
statements, classes, objects, methods – Inheritance. Inner Classes, Anonymous
inner classes.
Module IV 12
Packages
and Interfaces, Exception handling, Multithreaded programming, Strings and
collections, Streams and I/O programming
Module V 12
JAVA applets-life cycle, devolepment and
execution, applet tag. AWT- components, containers, layout, event handling,
Event listeners, Adapter classes.
Comparison
of C++ and Java
References :
1. K.R.Venugopal,
Rajkumar Buyya, T.Ravishankar, “Mastering C++”, TMH, 2003
2. Herbert Schildt, “The Java 2 : Complete
Reference”, Fourth edition, TMH, 2002
3. Rajkumar Buyya,Selvi,Chu. “Object
oriented programming with JAVA essentials and applications” Mc Graw Hill
4. Ira Pohl, “ Object oriented programming using C++”, Pearson
Education Asia, 2003
5. Bjarne Stroustrup, "The C++ programming language"
Addison Wesley, 2000
6. John R.Hubbard, "Progranning with C++", Schaums
outline series, TMH, 2003
7. H.M.Deitel, P.J.Deitel, "Java :
how to program", Fifthe edition, Prentice Hall of India private limited.
8. E.Balagurusamy “ Object Oriented Programming with C++”, TMH
2/e
IT010 403: Computer Organisation and Architecture
|
O bjectives
·
To give an insight into the organisation of functional units of a
computer system
·
Also to give a fair
idea of the architecture of a computer system
.
Module I (9 hours)
Introduction- Function and structure
of a computer, Functional components of a computer, Interconnection of
components Performance of a computer Representation of Instructions- Machine instructions,
Operands, Addressing modes, Instruction formats, Instruction sets, Instruction
set architectures – CISC and RISC architectures Programming- Concepts of
machine level programming, assembly level programming and high level
programming.
Module II (12 hours)
Processing Unit- Organisation of
a processor- Registers, ALU and Control unit, Data path in a CPU, Instruction
cycle Arithmetic and Logic Unit- Arithmetic algorithms, Design of arithmetic
unit, logic unit, status register, and accumulator Control Unit- Operations of
a control unit, Design of Hardwired control unit and Microprogrammed control unit
Module
III (12 hours)
Memory Subsystem- Semiconductor
memories, Memory cells – SRAM and DRAM cells, Internal Organization of a memory
chip, Organization of a memory unit, Error correction memories, Interleaved
memories, Cache memory unit – Concept of cache memory, Mapping methods,
Organization of a cache memory unit, Fetch and write mechanisms, Memory
management unit – Concept of virtual memory, Address translation, Hardware
support for memory management.
Module IV (12 hours)
Input/Output Subsystem- Access of
I/O devices, I/O ports, I/O control mechanisms – Program controlled I/O,
Interrupt controlled I/O and DMA controlled I/O, I/O interfaces – Serial port,
Parallel port, PCI bus, SCSI bus, USB bus, Firewall and Infiniband, I/O peripherals
– Input devices, Output devices, Secondary storage devices.
Module V ( 15 hours)
Parallel Organisations-
Introduction to pipelining and pipeline hazards, Design issues of pipeline
architecture , Instruction level parallelism, Introduction to Interconnection Network- Practical
issues, Examples Multiprocessors- Characteristics, Memory organisation,
Synchronization, Models of memory consistency, Issues of deadlock and
scheduling, Cache and related problems, Parallel Processing Concepts.
|
|
Objectives:-
·
To
provide an introduction to Logic Systems Design
thereby giving a hands on experience on working with digital ICS ,which
enable the study Computer System Architecture.
- Familiarization of Logic
Gates and Realization of Logic
Circuits using basic Gates.
- Design and implementation of Arithmetic
Circuits:- Half Adder, Full Adder,
n bit Ripple Carry Adder, Carry Look ahead Adder, BCD Adder
- Study of Flip Flops:-
implementation of RS, JK, D, T
and MS Flip Flops
- Design and implementation of
Synchronous and Asynchronous Counters, UP/DOWN Counters
- Design and Implementation of
Shift Registers, Counters using Shift Registers – Ring Counter and Johnson
Counter
- Study of Multiplexers ,
Demultiplexers, Encoder and Decoder
- Design of Comparators and Parity Generators.
|
IT
010 408: Data Structures and Programming Lab
|
Objectives
·
To provide experience on design, testing, and analysis of Algorithms
and Data Structures.
·
To acquaint the students with the Data Structures used in the Computer
Science field.
I. Simple experiments to get familiarisation with C++ and Java.
II.
Data structure
implementations and applications like,
1) Representation of Polynomials using Arrays and Linked List and
the different operations that can be performed on Polynomials
2) Representation of Sparse Matrix
using Arrays and Linked List and the different operations that can be
performed on Sparse Matrices
3) Representation of Stacks using Arrays and Linked List and the
different operations that can be performed on Stacks
4) Representation of Queues using Arrays and Linked List and the
different operations that can be performed on Queues
5) Representation of Double
Ended Queue using Arrays and Linked List and the different operations that can
be performed on Double Ended Queue
6) Representation of
Priority Queues using Arrays and Linked List and the different operations that
can be performed on Priority Queues
7) Representation of Binary Trees using Arrays and Linked List and
the different operations that can be performed on Binary Trees
8) Representation of Graphs using Arrays and Linked List and the
different operations that can be performed on Graphs
9) Infix, Postfix and Prefix conversions.
10) Different Sorting and Searching methods.
11) String representation using Arrays and Linked List and different
pattern matching algorithms
12) Implementation and operations on B-Tree and B+Tree
Any experiment according to the syllabus of IT010 405
can be substituted.
50%-Laboratory practical and record
30%- Test/s
20%- Regularity in the class
70% - Procedure, conducting experiment, results, tabulation, and
inference
30% - Viva
voce
No comments:
Post a Comment