preface - national institute of engineering · 2016-09-19 · preface dear students, since it...

1

PREFACE

Dear Students,

Since it started in the year 1946, NIE is promoting excellence in education through highly qualified faculty members and modern infrastructure. The Board of Directors believes in continuous improvement in delivery of technical education. Thanks to Karnataka government that designed and developed a seamless admission process through CET, many highly meritorious pre-university passed students are joining NIE, which has become a brand name among hundreds of colleges in the country. In fact, NIE is one of the top ten preferred colleges where all the seats got filled-up in the first round of 2016 admissions.

The concerted efforts of stake holders at NIE have made it get autonomous status, prestigious TEQIP-I & II. We are in the process of getting renewal of accreditation from National Board of Accreditation, New Delhi. NIE has been granted permanent affiliation by VTU to all its courses.

Today NIE has of 7 UG, 13 PG and 5 Post-graduate Diploma programmes and 13 Centres of Excellence with overall student strength of over 3500. NIE's journey to excellence, with the main objective of continuous improvements of administrative and academic competence, is envisioned through three major pillars: intellectual infrastructure, courses/services offerings and institution building.

Our curriculum is designed to develop problem-solving skill in students and build good academic knowledge.

Dr. G.L. Shekar July 2016 Principal

2

Dear Student

Our dedicated team of highly talented faculty members are always

trying to strive for academic excellence and overall personality

development. The major emphasis of imparting training at NIE is to

encourage enquiry and innovation among our students and lay the

strong foundation for a future where they are able to face global

challenges in a rapidly-changing scenario. Efforts are being made

to design the curriculum based on Bloom‘s Taxonomy framework,

to meet the challenges of the current technical education.

NIE is making sincere efforts in meeting the global standards

through new formats of National Board of Accreditation, New Delhi

and timely World Bank-MHRD initiative TEQIP (Technical

Education Quality Improvement Program).

I sincerely hope that your academic pursuit in NIE will be fruitful

and enjoyable in every aspect Wishing you the very best.

Dr. G. S. Suresh July 2016 Dean (Academic Affairs)

3

VISION

The Department will provide quality and value based education

to produce innovative world-class computing engineers and will

enhance quality research for the betterment of society.

MISSION

To impart high quality training, education and competence

in information science domain through best-in class faculty

and facilities

To produce globally acceptable information science

graduates who can contribute professionally to the industry

and research activities by offering courses on emerging

technologies.

To provide platforms to work effectively and innovatively in

multi-disciplinary domain.

PROGRAM OUTCOMES

1. Engineering Knowledge: Real world engineering

problems are solved by applying knowledge of science.

2. Problem Analysis: Identify, devise and analyze real world

engineering problems using principles of mathematics,

sciences and information technologies.

3. Design and Develop solutions: Designing and

developing solutions for engineering problems based on

needs while considering the norms of Safety and

environmental conditions.

4. Conduct investigations of complex problems: Use

research based knowledge and research methods

including design of experiments, analysis and interpretation

of data and synthesis of the information to provide valid

conclusions.

4

5. Modern Tool usage: Applying appropriate engineering

techniques and tools that includes simulation and modeling

to solve complex engineering problems

6. The engineering and society: Apply reasoning informed

by the contextual knowledge to assess societal, health,

safety, legal and cultural issues and their consequent

responsibilities relevant to the professional engineering

practice.

7. Environment and sustainability: Understand the impact

of the professional engineering solutions in societal and

environmental contexts and demonstrate the knowledge of

and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional

ethics, responsibilities and norms of engineering practice

9. Individual and Team Work: Participate and performs

effectively as an individual and as a member or leader in

diverse teams and in multidisciplinary environment

10. Communication: Communicate effectively with

engineering community and the society through reports

and presentations

11. Project Management and finance: Apply the principles of

software engineering and fundamentals of finance to

manage a project in multidisciplinary environment. In the

verge of technological changes, there is a need to

recognize and learn independently and also in a team.

12. Lifelong learning: Recognize the need for and have the

preparation and ability to engage in independent and

lifelong learning in the broadest context of technological

change.

5

PROGRAM EDUCATIONAL OBJECTIVES

PEO 1: Our graduates will be professionally successful in

information technology career.

PEO 2: Our graduates will successfully pursue higher studies

in globally recognized institutions.

PEO 3: Our graduates will build professionally successful

careers in the field of emerging technologies.

PROGRAM SPECIFIC OUTCOMES

PSO 1: Information Science Engineers able to understand and

analyze computer systems focused with hardware and

software needs.

PSO 2: Develop software systems/solutions, with knowledge of

software design process and skills with broad range of

programming platforms and tools.

PSO 3: Demonstrate professional competence in communi-

cation skills, project management and involve in life-long

learning.

6

BLUEPRINT OF SYLLABUS STRUCTURE AND QUESTION PAPER PATTERN

Blue Print of Syllabus Structure

1. Complete syllabus is prescribed in SIX units as Unit 1, Unit

2, etc.

2. In each unit there is one topic under the heading “Self Learning Exercises” (SLE). These are the topics to be

learnt by the student on their own under the guidance of the course instructors. Course instructors will inform the students about the depth to which SLE components are to be studied. Thus there will be six topics in the complete syllabus which will carry questions with a weightage of 10% in SEE only. No questions will be asked on SLE components in CIE.

Blue Print of Question Paper

1. Question paper will have SEVEN full questions.

One full question each of 15 marks (Question No 1, 2, 3, 4, 5 and 6) will be set from each unit of the syllabus. Out of these six questions, two questions will have internal choice from the same unit. The unit from which choices are to be given is left to the discretion of the course instructor.

2. Question No 7 will be set for 10 marks only on those topics prescribed as “Self Learning Exercises”.

9

III SEMESTER

ENGINEERING MATHEMATICS - III (4:0:0) (Common to all branches)

Sub Code : MA0403 CIE : 50% Marks

Hrs/Week : 04 SEE : 50% Marks

SEE Hrs : 03 Hrs Max. Marks : 100

Objective: Mathematics course content spread over four

semesters is designed to cater to the common needs of all the

major engineering disciplines at the UG level.

Course Outcomes:

On Successful Completion of the Course, the students will be

able to:

1. Define a Fourier series and rewrite the periodic function of

period 2l in terms of Fourier series, half range series.

2. Construct and solve homogeneous and non homogeneous

partial differential equations.

3. Apply half range Fourier series expansion to solve the

boundary value problems on wave, heat and Laplace‘s

equations. Compute Fourier and Inverse Fourier

transforms of functions.

4. Apply numerical techniques to solve the systems of linear

algebraic equations, compute the largest Eigen value and

the corresponding Eigen vector of a matrix and estimate a

real root of the given equation.

5. Apply appropriate formulae for interpolation, estimate the

values of the derivatives and definite integrals using

numerical techniques.

10

6. Compute Z- transform and inverse Z- transform of

functions and select the necessary transforms to solve

difference equations.

UNIT 1: 9 Hrs

Fourier Series:

Convergence and divergence of infinite series of positive terms –

Definition and illustrative examples.

Fourier series of period 2l,Half range series, complex form of

Fourier series, Practical harmonic analysis.

Self Learning Exercise: Fourier series with period 2Π

UNIT 2: 9 Hrs

Partial Differential Equations:

Formation of PDE, Solution of homogeneous and non-

homogeneous PDE, Solution of homogeneous PDE by direct

integration. Solution of homogeneous PDE by the method of

separation of variables. Various possible solutions of one

dimensional wave equation. Solution of Lagrange‘s linear PDE –

simple problems, D‘Alembert‘s solution of wave equation.

Self Learning Exercise: Heat equation and two dimensional

Laplace‘s equation

UNIT 3: 8 Hrs

Application of PDE and Fourier Transforms

Application of PDE – Solution of boundary value problems

associated with one dimensional wave equation and two

dimensional Laplace‘s equation. Infinite Fourier Transforms,

Fourier sine and cosine transforms, Inverse Transforms.

Self Learning Exercise: Heat equation

UNIT 4: 9 Hrs

Numerical Methods – 1:

Numerical solution of a system of linear algebraic equations –

Gauss Seidel & Relaxation iterative methods. Computation of

11

largest eigen value and the corresponding eigen vector by

Rayleigh‘s power method. Numerical solution of algebraic and

transcendental equations. Newton Raphson and Regula falsi

methods.

Self Learning Exercise: Rayleigh‘s inverse power method

UNIT 5: 9 Hrs

Numerical Methods - 2

Finite differences – forward and backward differences, Newton‘s

forward interpolation formula, Interpolation for unequal intervals –

Newton‘s divided difference formula, Lagrange‘s interpolation

formula. Numerical differentiation associated with Newton‘s

forward, backward and divided difference formulae. Numerical

Integration – Simpson‘s 1/3rd

rule, Simpson‘s 3/8th rule, Weddle‘s

rule (All formulae without proof)

Self Learning Exercise: Newton‘s backward interpolation and

Lagrange‘s inverse interpolation formula

UNIT 6: 8 Hrs

Z-Transforms

Difference Equations – Basic definition. Z-transforms, Definition,

Standard Z-transforms, Linearity property – Damping rule, Shifting

rule, Initial value theorem, Final value theorem. Inverse Z-

transforms. Application of Z-transforms to solve difference

equations.

Self Learning Exercise: Inverse Z-transforms by power series

method

TEXT BOOK:

1. Higher Engineering Mathematics – Dr. B.S. Grewal, 42nd

edition, Khana Publications

2. Advanced Engineering Mathematics - Erwin Kreyszig,

wiley publications, 10th edition.

12

REFERENCE BOOKS:

1. Advanced Engg. Mathematics – H. K. Das, Chand

Publications.

2. Higher Engg. Mathematics – B. V. Ramanna, Tata

McGraw-Hill Publications.

3. Advanced Engineering Mathematics- Peter O Neil;

Thomas, Broks/ Cole , 7th Edition.

13

DISCRETE MATHEMATICAL STRUCTURES (4:0:0)

Sub Code : IS0401 CIE : 50% Marks



Course Outcomes:


able to:

1. Explain the fundamental principles of counting, permutation

and combination theory.

2. Describe the basics of logic theory and its proofs.

3. Perform operations on Sets, Subsets and solve problems on

probability.

4. Describe the discrete structures like functions and relations

and apply the knowledge on functions and its properties.

5. Apply the knowledge on relations and its properties.

6. Solve problems involving recurrence relations and

Generating Functions.

UNIT 1: 7 Hrs

Fundamental Principles of Counting:

The Rules of Sum and Product, Permutations, Combinations – The

Binomial Theorem.

Self Learning Exercise: Combinations with repetition.

UNIT 2: 9 Hrs

Fundamentals of Logic:

Basic Connectives and Truth Tables, Logical Equivalence: The

Laws of Logic. Logical Implication: Rules of Inference, The Use of

Quantifiers, Mathematical Induction.

Self Learning Exercise: Definitions, and the Proofs of Theorems.

14

UNIT 3: 9 Hrs

Set Theory:

Sets and Subsets. Set Operations and the Laws of Set Theory.

Counting and Venn Diagrams. A First Word on Probability. The

Axioms of Probability.

Self Learning Exercise: Conditional Probability: Independence.

UNIT 4: 9 Hrs

Functions:

Cartesian Products and Relations. Functions: Plain and One-to-

One. Onto Functions: Stirling Numbers of the Second Kind,

Special Functions, The Pigeonhole Principle.

Self Learning Exercise: Function Composition and Inverse

Functions.

UNIT 5: 9 Hrs

Relations:

Properties of Relations. Computer Recognition: Zero-One Matrices

and Directed Graphs. Partial Orders: Hasse Diagrams.

Self Learning Exercise: Equivalence Relations and Partitions

UNIT 6: 9 Hrs

Recurrence Relations:

First order linear recurrence relations, The Second order linear

homogeneous recurrence relation with constant coefficients, Non

Homogeneous recurrence relation.

Self Learning Exercise: Method of generating functions.

TEXT BOOK:

1. Discrete and Combinatorial Mathematics, Ralph.

P. Grimaldi, Pearson Education. 5th Edition, 2004

15

REFERENCE BOOK:

1. Discreet Mathematical Structures with Applications to

Computer Science J.P.Tremblay and R.Manohar,

MCGraw-Hill International Edition.

2. A Treatise on Discrete Mathematical Structures, Jayant

Ganguly, Sanguine- Pearson, 2010

3. Discrete Mathematics and its Applications, Kenneth H.

Rosen: 7th Edition. McGraw Hill, 2010

E-BOOK:

1. Discrete Mathematical Structures for Computer Science by Ronald E. Prather. ISBN: 9780395206225

MOOC’s:

1. http://nptel.ac.in/courses/106106094/

16

LOGIC DESIGN (4:0:0)




Course Outcomes:


able to:

1. Understand the operation of basic gates and interpret basic Boolean laws, different methods of logic simplification. (Understand)

2. Determine output of data processing circuits, timer IC modes and operational amplifiers. (Analyze)

3. Understand different types of number system and operation of arithmetic building block. (Understand)

4. Describe operation of different types of Flip- Flops. (Understand)

5. Understand working of shift register and operation of

synchronous, asynchronous and decade counter.

(Understand)

6. Design of Sequential Circuits using moore and mealy

model. (Create)

UNIT 1: 9 Hrs

Digital Logic:

Overview of Basic Gates—NOT, OR, AND; Universal Logic

Gates—NOR, NAND; AND-OR-Invert GATES; Positive and

Negative Logic; Introduction to HDL

Combinational Logic Circuits:

Boolean Laws And Theorems; SOP Method; Truth Table to K-

Map; Pairs, Quads and Octets; Karnaugh Simplifications; Don‗t-

care Conditions; POS Method; POS Simplification;

17

Simplification by Quine-McClusky Method, HDL Implementation

Models

Self Learning Exercise: Conversion between SOP and POS.

UNIT 2: 9 Hrs

Data-Processing Circuits:

Multiplexers; Demultiplexers; BCD-to-decimal Decoders; Encoders;

Ex-or GATES; Parity Generators and Checkers; HDL

Implementation of Data Processing Circuits, Clocks and Timing

Circuits- Clock Waveforms; Schmitt Trigger, 555 Timer- Astable,

Monostable.

Self Learning Exercise: TTL Clock

UNIT 3: 8 Hrs

Number Systems and Codes:

Binary Number System; Binary-to-decimal Conversion;

Hexadecimal Numbers; The ASCII Code; The Excess-3 Code; The

Gray Code

Arithmetic Circuit:

Binary Addition; Binary Subtraction; 2‗S Complement

Representation; 2‗S Complement Arithmetic; Arithmetic

Building Blocks; The Adder-subtracter, Arithmetic Logic Unit;

Binary Multiplication and Division.

Self Learning Exercise: Unsigned Binary Numbers; Sign-

magnitude Numbers;

UNIT 4: 9 Hrs

Flip-Flops:

RS Flip-flops; Gated Flip-flops; Edge-triggered RS Flip-flops;

Edge-triggered D Flip-flops; Edge-triggered JK Flip-flops Master-

slave Flip-flops; Various Representations of Flip-flops;

Conversion of Flip-flops: A Synthesis Example

18

Self Learning Exercise: Flip-flop Timing; Analysis of Sequential

Circuits;

UNIT 5: 8 Hrs

Registers and Counters:

Types of Registers; Serial In–Serial Out; Serial In–Parallel

Out; Parallel In–Serial Out Parallel In–Parallel Out; Asynchronous

Counters-Ripple counter mod 16, 3 bit up-down counter;

Synchronous-mod 8 binary counter, parallel up-down Counters;

Decade Counters- mod 5 counter.

Self Learning Exercise: Applications of Shift Registers; Decoding

Gates;

UNIT 6: 9 Hrs

Design of Sequential Circuits:

Model Selection; State Transition Diagram; State Synthesis

Table; Design Equations and Circuit Diagram; Implementation

Using Read Only Memory; Algorithmic State Machine; State

Reduction Technique

Self Learning Exercise: Design of Asynchronous Sequential

Circuit.

TEXT BOOK:

1. Digital Principles and Applications, D P Leach, Albert

Paul Malvino, G Saha, Tata McGraw-Hill, 7th Edition, 2011.

REFERENCE BOOK:

1. Logic and Computer Design Fundamentals, M. Morris

Mano, Charles R.Kime, Pearson Edu.TMH, 2nd

Edition

2013.

2. Fundamentals of Logic Design, Charle H Roth,

Jr.,Thomson, 5th Edition, 2010.

19

3. Fundamentals of Digital Logic with Verilog

Design, Stephen Brown, Vonko Vranesic, TMH, 2nd

Edition, 2010.

E-BOOKS:

1. http://nsdl.oercommons.org/courses/digital-logic

2. http://www.collegeopentextbooks.org/textbook listings/text- books -by-subject/computer science

3. http://nsdl.oercommons.org/courses/lab-2-introduction-to-vhdl/view

4. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science

MOOC’s: http://oscar.iitb.ac.in/ComputerScience

http://www.collegeopentextbooks.org/textbook%20listings/

20

DATA STRUCTURES (4:0:0)




Course Outcomes:


able to:

1. Apply the concept of pointers.

2. Explain the basic concepts of stacks.

3. Analyze and solve the problems using types of Queues.

4. Discuss linked list operations and its implementation.

5. Design and implement the circular list.

6. Construct the non – linear data structure – trees.

UNIT 1: 9 Hrs

Pointer: Understanding pointers, Pointer variables, Accessing

address of a variable, Initialization of pointer variables, Accessing

variables through pointers, Chain of pointers, Pointer expressions,

Pointer Arithmetic and arrays, Array of pointers, Pointers as

function argument, Function returning pointers, Pointers to

function. malloc, free.

Self Learning Exercise: Dynamic memory allocation – calloc,

realloc, Similarity between pointers and subscripted variables

UNIT 2: 9 Hrs

Abstract Data Types: Introduction. Stack: Definition and

examples, Representing stacks in C, An example: Infix, Postfix,

Prefix. Recursion: Recursive definition and processes. Recursion

in C, Writing recursive programs.

Self Learning Exercise: Application of stacks

21

UNIT 3: 8 Hrs

Queue: The Queue, its representation and implementation,

Circular Queue implementation.

Self Learning Exercise: Priority Queue

UNIT 4: 9 Hrs

Linked Lists 1: Inserting and Removing nodes from a list,

Implementation of stacks, getnode and freenode operations,

Linked implementation of queues, Linked list as a data structure,

Example of list operations, Header nodes, List in C. Allocating and

freeing dynamic variables. Linked lists using dynamic

variables.Recursive implementation of the above.

Self Learning Exercise: Comparison of lists and arrays with

respect to insertion, deletion and storage.

UNIT 5: 9 Hrs

Linked Lists 2: Queues as lists in C, Examples of list operations in

C, Circular lists, Stack as a circular lists, Queue as a circular list,

Primitive operations on circular lists. Double linked list.

Self Learning Exercise: Need for a header node.

UNIT 6: 8 Hrs

Binary tree: Operations on binary trees, Application of binary

trees, Node representation of binary trees, Internal and external

nodes, Implicit array representation of binary trees, Choosing a

binary tree representation, Binary tree traversal in C. C

representation of trees, Tree traversal. Various manipulations on

trees like comparing two trees for equality, total number of nodes

swapping trees, binary search tree etc. recursively.

Self Learning Exercise: Threaded binary trees

TEXT BOOK:

1. Data Structures using C, Aaron M Tenenbaum, Yedidyah

Langsam and Moshe J Augenstein, 2009, Pearson

education, low price edition.

22

REFERENCE BOOKS:

1. Programming in ANSI C, E Balagurusamy, Fifth Edition,

2011, Tata McGraw-Hill. (for UNIT-1)

2. Data Structures, A Pseudocode Approach with C,

Richar F Gilberg and Behronz A Forouzan, Thomson,

2005.

3. Computer Science, A Structured Programming

Approach using C, Richar F Gilberg and Behronz a

Forouzan, Thomson, second edition, 2003.

4. Fundamentals of Data Structures in C, Horowitz, Sahni,

Anderson-Freed, 2nd Edition, Universities Press 2007.

MOOC’s:

1. A Tool for Data Structure Visualization is available at

https://www.cs.usfca.edu/~galles/visualization/Algorithms.h

tml

2. In this paper, a software application that features the

visualization of commonly used data structures and their

associated insertion and deletion operations is introduced.

In addition, this software can be used to animate user-

defined algorithms.

www1bpt.bridgeport.edu/~risc/pdf/jp29.pdf

23

OBJECT ORIENTED PROGRAMMING (4:0:0)




Course Outcomes:


able to:

1. Explain the various principles of Object Oriented

Programming.

2. Formulate the Objects and classes for the real world

application

3. Discuss the concepts of references, dynamic allocation,

function overloading and copy constructors.

4. Identify the importance of Operator overloading and

inheritance.

5. Apply Virtual functions, Templates and exception handling.

6. Use the basic I/O operations and file I/O operations in C++.

UNIT 1: 6 Hrs

Principles of Object-Oriented Programming:

Software crisis, software evolution, A Look at Procedure-Oriented

Programming, Object Oriented programming paradigm, Basic

Concepts of Object-Oriented Programming, Benefits of OOP,

Object-Oriented Languages, Applications of OOP.

Beginning with C++:

What is C++? , Applications of C++, A Simple C++ Program, More

C++ Statements. An Example with Class, Structure of C++

Program

Self Learning Exercise: C++ program for simple problems

24

UNIT 2: 9 Hrs

Tokens, Expressions and Control Structures:

Introduction, Tokens, Keywords, Identifiers and Constants, Basic

Data Types, User-Defined Data Types, Derived Data Types,

Symbolic Constants, Type Compatibility, Declaration of Variables,

Dynamic Initialization of variables, Reference variables, Operators

in C++, Scope Resolution Operator, Member Dereferencing

Operators, Memory Management Operators, Manipulators, Type

Cast Operator, Expressions and their Types, Special Assignment

Expressions, Implicit Conversions, Operator Overloading, Operator

Precedence, Control Structures, C++ Keywords.

Functions: main function, function prototyping , call by reference ,

return by reference , inline function , default arguments.

Classes and Objects:

Introduction , C Structures revisited , specifying a class, defining

member functions , C++ program with class, making an outside

function inline, nesting of member functions, private member

functions, arrays with in a class, memory allocation for objects ,

arrays of objects , objects as function arguments , Friend

Functions, returning objects , const member functions, pointers to

members, Constructors , Parameterized Constructors , multiple

constructors in a class, constructors with default arguments,

dynamic initialization of objects, copy constructor , dynamic

constructors and Destructors.

Self Learning Exercise: object Assignment: examples of

Destructors

UNIT 3: 10 Hrs

Arrays, pointers, References, and the Dynamic Allocation

Operators:

Constructors, Parameterized Constructors, multiple constructors in

a class, constructors with default arguments, dynamic initialization

of objects, copy constructor, dynamic constructors and Destructors. Arrays of Objects- Creating Initialized vs. Uninitialized Arrays,

Pointers to Objects, The this Pointer, Pointers to Derived Types,

25

Pointers to Class Members, References – Reference Parameters,

Passing References to Objects and Returning References., C++‘s

Dynamic Allocation Operators- Initializing Allocated Memory,

Allocating Arrays and Allocating Objects.

Function Overloading, Copy Constructors, and Default

Arguments:

Function Overloading, Copy Constructors, Default Function

Arguments – Default Argument vs. Overloading.

Self Learning Exercise: Using Default Arguments Correctly.

UNIT 4: 10 Hrs

Operator Overloading:

Introduction, defining operator overloading, overloading unary

operators, overloading binary operators, overloading binary

operators using friends, manipulation of strings using operators,

examples, rule for overloading operators.

Inheritance:

Introduction, defining derived classes, single inheritance, making a

private member inheritable, multilevel inheritance, multiple

inheritance, hierarchical inheritance, hybrid inheritance, virtual

base classes, abstract classes, constructors in derived classes.

Self Learning Exercise: Member Classes, Nesting of classes

UNIT 5: 9 Hrs

Pointers, Virtual Functions and Polymorphism:

Introduction, pointers, pointers to objects, this pointer, pointer to

derived classes, virtual functions, pure virtual functions, virtual

constructor and destructors.

Templates:

Introduction, class templates, class templates with multiple

parameters, function templates, function templates with multiple

parameters, overloading of templates functions, member function

templates, nontype template arguments.

26

Exception Handling:

Introduction, basics of exception handling, exception handling

mechanism, throwing mechanism, catching mechanism, rethrowing

an exception, specifying exceptions.

Self Learning Exercise: Exception in Constructors and

Destructors.

UNIT 6: 8 Hrs

Managing console I/O operations

Introduction , C++ Streams, The C++ Stream Classes, unformatted

I/O operations, Formatted console I/O operations, - managing

output with manipulators, working with files: classes for file stream

operations, opening and closing a file, detecting end of file, more

about open (), file pointers and their manipulators, sequential input

and output operations, random access, error handling during file

operations.

Manipulating strings:

Introduction, creating string objects, manipulating string objects,

relational operations, string characteristics, accessing characters in

strings, comparing and swapping.

Self Learning Exercise: command line arguments

TEXT BOOKS:

1. C++ The Complete Reference, Herbert Schildt, TMH, 4th

Edition, 2002

2. Object Oriented Programming with C++, E

Balagurusamy, 6th Edition, 2013

REFERENCE BOOKS:

1. The C++ programming language, Bjarne stroustrup,

Pearson Education, 3rd

Edition.

2. C++ Primer, Stanley B.Lippman and Josee Lajore,

Addison Wesley, 3rd

Edition.

27

E-BOOK:

1. OOP: Learn Object Oriented Thinking and Programming by Rudolf Pecinovsky - Eva & Tomas Bruckner Publishing,

2013.

MOOC’s:

1. www.indus.ac.in

2. http://www.studytonight.com/cpp/cpp-and-oops-

concepts.php

28

LOGIC DESIGN LAB (0:0:3)

Sub Code : IS0101 Max. Marks : 50

Hrs/Week : 03 Course Outcomes:

On Successful Completion of the Course, the students will

be able to:

1. Apply acquired knowledge to explore working of basic

gates, data processing circuits flip-flop circuits and shift

registers.(Apply)

2. Demonstrate design and working of different types of

counters, amplifiers, multivibrator and relate simulated

result with the practical approach.( Apply)

Experiments are on the following topics:

1. Basic Gates and Universal gates 2. Multiplexers and De-multiplexers 3. Decoders 4. JK Master Slave flip flops 5. Shift Registers 6. Synchronous and Asynchronous counters

Experiments:

1. Understand the working of basic gates and implementation

of basic gates using universal gates NAND and NOR.

2. Develop following data processing circuits using Basic

gates / NAND gates and verify the truth table

4:1 Multiplexer, 1:4 Demultiplexer, 2:4 Decoder

3. Develop following Arithmetic Building Blocks using Basic

gates / NAND gates and verify the truth table

Half adder and Half subtractor, Full adder and Full

subtractor

4. Develop JK Master Slave flip-flop circuits and realize Truth

– Table

29

5. Verify following operations using Shift Registers

Serial in-Serial out, Serial in-Parallel out, Parallel in-

Serial out, Parallel in-Parallel out

6. Design and implement a Mod-N Synchronous counters

using JK flip-flop and verify truth table.

7. Design and implement an Asynchronous counters using

decade counter IC to count up from 0 to n (n 9).

8. Develop Ring counter and Johnson counter using IC 7495.

Experiments using VHDL/Verilog

9. Construct VHDL/ Verilog code for basic gate, Multiplexer /

De-multiplexer, simulate and verify its working.

10. Construct VHDL / Verilog code for Adder/ Subtractor,

Counter simulate and verify its working.

TEXT BOOK:

1. Logic and Computer Design Fundamentals, M.

Morris Mano, Charles R.Kime, Pearson Edu.TMH,

2nd

Edition 2013.

2. Digital Principles and Applications, D P Leach, Albert

Paul Malvino, Goutam saha, TataMcGraw-Hill, 7th Edition,

2011.

3. Fundamentals of Digital Logic with V H D L ,

Stephen Brown, Zvonko Vranesic, TMH, 3rd

Edition, 2015.

REFERENCE BOOK:

1. Fundamentals of Logic Design, Charle H Roth,

Jr.,Thomson, 5thEdition,2010.

E-BOOK:

1. http://nsdl.oercommons.org/courses/lab-2-introduction-to-vhdl/view

MOOC’s: http://oscar.iitb.ac.in/ComputerScience

30

DATA STRUCTURE LAB (0:0:3)


Hrs/Week : 03

Course Outcomes

On Successful completion of the course, the students will be

able to:

1. Identity the appropriate data structure for given problem

2. Apply the suitable data structure for the given real world

problem

3. Demonstrate the knowledge of various data structures to

construct a program.

List of Programs:

1. Write a C program using pointer for searching the desired

element from the array.

2. Design and implement programs using Dynamic memory

allocation to create dynamic array and sorting the

elements.

3. Design and implement programs using Dynamic memory

allocation to create dynamic 2D array and to swap

specified rows and columns.

4. Write a C program to construct a stack of integers and to

perform the operations Push, Pop and Display. The

program should print appropriate messages for stack

overflow, stack underflow and stack empty.

5. Design and implement programs to simulate application of

stacks to convert infix expression to postfix expression.

6. Design and implement programs to simulate application of

stacks to evaluate postfix expression.

31

7. Design and implement programs using recursive function

to generate

a. Fibonacci Numbers.

b. To search for an element using binary search method.

8. Write a C program to simulate the working of a queue of

integers using an array.

9. Write a C program to simulate the working of a circular

queue of integers using an array.

10. Write a C program using dynamic variables and pointers,

to construct a singly linked list. The operations to be

supported are:

a. Insert at the front of a list.

b. Insert at any position in the list.

c. Deleting a node based on specified value.

d. Searching a node based on specified value.

e. Displaying all the nodes in the list.

11. Write a C program using dynamic variables and pointers to

construct a stack of integers using singly linked list.

12. Write a C program to support the following operations on a

doubly linked list where each node consists of integers.

a. Create a doubly linked list by adding each node at the

front.

b. Insert a new node to the left of the node whose key

value is read as an input.

c. Delete the node of a given data, if it is found, otherwise

display appropriate message.

d. Display the contents of the list.

13. Write a C program

a. To construct a binary search tree of integers.

b. To traverse the tree using all the methods i. e., inorder,

preorder and postorder

c. To display the elements in the tree.

32

TEXT BOOK:

1. Aaron M Tenenbaum, Yedidyah Langsam and Moshe J

Augenstein, ―Data Structure using C‖, 2009, Pearson

education, low price edition.

33

OBJECT ORIENTED PROGRAMMING LAB (0:0:2)


Hrs/Week : 02

Course Outcomes


able to:

1. Create classes and objects using simple programs.

2. Apply principles of Object Oriented Programming for

problem solving.

3. Justify the usage of overloading and Inheritance.

4. Develop a mechanism to handle exception and files.

List of Programs:

1. Simple programs

a. Write a C++ program to read three numbers from the

keyboard and display the lowest value on the screen.

b. Write a C++ program to check whether the given

number is an Armstrong number or not.(Hint:

Armstrong number 153= 13 + 53 + 33 ).

c. Write a C++ program to find and display Factorial of a

number.

d. Write a C++ program to print ASCII value of a

character.

e. Write a C++ program that will accept an array of

numbers and display the number of times the given

number occurred in the array.

2. Write a C++ program that will ask for a temperature in

Fahrenheit and display in Celsius. Use a class called temp

and member functions.

34

3. Define a BANK class to represent a bank account. Include

the following members:

Data members

a. Name of the depositor

b. Account number

c. Type of account

d. Balance amount in the account

Member functions

a. To assign initial values

b. To deposit an amount

c. To withdraw an amount after checking the balance

d. To display name and balance of a specified account

number.

Write a C++ program to test the class for handling 10

customers.

4. Define a STUDENT class with USN, Name and marks in 3

tests of a subject. Declare an array of 10 STUDENT

objects. Using appropriate functions, find the average of

two better marks for each student. Print the USN, Name

and average marks of all the students.

5. Write a C++ program to create a class called COMPLEX

and implement the following overloading functions ADD

that return a COMPLEX number.

a. ADD ( a, s2 ) – where a is an integer (real part) and s2

is a complex number.

b. ADD (s1, s2) – where s1 and s2 are complex numbers.

6. Define a class String that could work as a user-defined

string type. Include constructors that will create an

uninitialized string

String s1;

// string with length 0 and also to initialize an object with a

string constant at the time of creation like

String s2(“Good Luck”);

35

Include a function that adds two strings to make a third

string. i.e. , String s3 = s1 + s2; //use copy constructor

Write a complete program to test the class to see that it

does the following tasks:

a. Creates uninitialized string objects.

b. Creates objects with string constants.

c. Concatenate two strings properly.

d. Display the desired string object.

7. Write a C++ program to create a class called STACK using

an array of integers.

Implement the following operations by overloading the

operators + and - .

a. s1 = s1 + element; where s1 is an object of the class

STACK and element is an integer to be pushed on to

the top of the stack.

b. s1 = s1- ; where s1 is an object of the class STACK

and – operator pops the element.

Handle the STACK empty and STACK full conditions. Also

display the contents of the stack after each operation, by

overloading the operator <<.

8. Write a C++ program to create a class called MATRIX

using a two-dimensional array of integers. Implement the

following operations by overloading the operator = = which

checks the compatibility of two matrices m1 and m2 to be

added and subtracted. Perform the addition and

subtraction by overloading the operator + and –

respectively. Display the results by overloading the

operator <<.

if ( m1 == m2 )

{

m3 = m1 + m2 ;

m4 = m1 – m2 ;

}

else

Display error

36

9. Write a C++ program to create a template function for

Quick sort and demonstrate sorting of integers and

doubles.

10. Write a C++ program to create a class called QUEUE with

member function to add an element from the queue. Using

these member functions, implement a queue of integer and

double. Demonstrate the operations by displaying the

content of the queue after every operation.

11. Write a C++ program to create a class called LIST with

member functions:

a. To insert an element at the front

b. To delete an element from the front of the list

Demonstrate all the functions after creating a list object.

12. Write a C++ program to create a class called DLIST

(Doubly Linked List ) with member functions :

a. To insert a node at a specified position

b. Delete a node from a specified position of the list.

Demonstrate the operations by displaying the content of

the list after every operation.

13. Write a C++ program to create a class called STUDENT

with data members USN, Name and Age. Using

inheritance, create the classes UGSTUDENT and

PGSTUDENT having field as Semester, Fees and Stipend.

Enter the data for at least 5 students. Find the average age

for all UG and PG students separately.

14. Write a C++ program to create a class called BIN_TREE

(binary tree) with member functions to perform Inorder,

Preorder and Postorder traversals. Create a BIN_TREE

object and demonstrate the traversals.

15. Write a C++ program with the following:

a. A function to read two double type numbers from

keyboard

37

b. A function to calculate the division of these two

numbers

c. A try block to throw an exception when a wrong type of

data is keyed in

d. A try block to detect and throw an exception if the

condition ―divide-by-zero‖ occurs

e. Appropriate catch block to handle the exceptions

thrown.

16. A file contains a list of telephone numbers in the following

form:

Anil 2453675

George 2534563

…….. ………

The names contain only one word and the names and

telephone numbers are separated by white spaces. Use a

class object to store each set of data. Write an interactive

menu driven program in C++ that will access the file and

implement the following tasks:

a. Determine the telephone number of the specified

person

b. Determine the name if a telephone number is known

c. Update the telephone number, whenever there is a

change.

d. Output the list in two columns.

TEXT BOOKS:

1. C++ The Complete Reference, Herbert Schildt, TMH, 4th

Edition, 2002

2. Object Oriented Programming with C++, E

Balagurusamy, 6th Edition, 2013

38

ENVIRONMENTAL STUDIES (2:0:0)

Sub Code : HS0002 CIE : 50% Marks



Course Outcomes:


able to:

1. Investigate the relationship between human life and

environment from scientific perspective.

2. Appreciate the current and emerging problems and provide

potential solutions.

3. Increase the awareness on environmental problems.

UNIT 1: 4 Hrs

Introduction and definition of Environment. Man-Environment

interaction. Impact of mans‘ activity on Environment. Ecosystems

(kinds, component parts, pyramids etc, Pond ecosystem as an

example), Biodiversivity (Hot spots).

Self Learning Exercise: The need of Environment

Education/Knowledge (from the point of view of Sustainable

Development).

UNIT 2: 4 Hrs

Ecology-

a) Energy/nutrient flow (food chains etc)

b) Biogeochemical cycles (CNS cycles)

Self Learning Exercise: Concepts of limiting nutrients.

UNIT 3: 4 Hrs

Natural Resources, Water resources – Availability & Quality

aspects, Water borne diseases & water induced diseases, Fluoride

39

problem in drinking water Mineral resources, Minerals, Energy –

renewable and non renewable,

Self Learning Exercise: Land and Forest Wealth.

UNIT 4: 4 Hrs

Environnemental pollution- Water, Air, Soli, Noise. Solid waste

generation and allied issues. Self Learning Exercise: Sustainable

development- Concepts

UNIT 5: 4 Hrs

Some important local and global environmental issues-

a) Global issues- global warming, acid rain, ozone depletion.

Self Learning Exercise: Local issues- specific to the locality

UNIT 6: 6 Hrs

Introduction to Environmental Impact Assessment (EIA),

Environmental Auditing. Environmental Legislation and Acts.

Pollution Control boards. Regulatory standards.

Self Learning Exercise: Environmental Ethics.

TEXT BOOK:

1. Benny Joseph “Environmental Science and

Engineering.”. Tata McGraw-Hill Publishing Company

Limited.

REFERENCE BOOKS:

1. Gilbert M. Masters “Introduction to Environmental

Engineering and Science.” Prentice-Hall of India Pvt.

Limited.

2. Edward J. Kormondy “Concepts of Ecology‖. Prentice-

Hall of India Pvt. Limited.

3. P.D.Sarma. “Ecology and Environment‖ Rastogi

Publications.

40

BRIDGE COURSE MATHEMATICS – I (2:0:0)

(For Diploma students during III semester)




Objective: The course content spread over two semesters caters

to the basic need of diploma students entering the engineering

course at the third semester lacking in the knowledge of several

topics taught at the PU level.

Course Outcomes:


able to:

1. Compute the nth derivative of the given function

2. Translate any differentiable function in power series and compute the value of the indeterminate forms

3. Compute the partial derivatives and solve problems associated with it.

4. Compute integrals using appropriate methods and also reduction formulae.

5. Recognize and solve first order differential equation using appropriate methods.

UNIT 1: 4 Hrs

Differential Calculus – 1:

Basic formulae – rules (revision). Successive differentiation, nth

derivative of standard functions – formulae and illustrative examples. Leibnitz theorem – problems only. Self Learning Exercise: Basic differentiation and problems

41

UNIT 2: 5 Hrs

Differential Calculus – 2:

Expansion of functions – Taylor‘s and Maclaurin‘s expansion of a

function of one variable. Indeterminate forms – L‘Hospital‘s rule –

0/0, ∞ - ∞ , 0 × ∞ problems

Self Learning Exercise: Indeterminate form - ∞/∞

UNIT 3: 4 Hrs

Partial Differentiation:

Partial differentiation, Euler‘s theorem (problems only), Total

derivative and Chain rule

Self Learning Exercise: Jacobians

UNIT 4: 4 Hrs

Integral Calculus – 1:

Basic formulae – rules (revision) Bernoulli‘s rule of integration by parts – problems Definite integrals (Revision). Properties – illustrative problems.

Self Learning Exercise: Integration of algebraic, rational and

irrational functions

UNIT 5: 4 Hrs


Reduction formulae for integrals of Sinnx, Sin

mx Cos

nx (no proof)

and evaluation of these with standard limits and problems.

Self Learning Exercise: Cosnx

UNIT 6: 5 Hrs

Differential Equations:

Revision of Differential Equations of first order and first degree,

Solution of higher order homogeneous and non homogeneous

differential equations [P.I of the type: eax

, sin(ax+b)/cos(ax+b),xn]

Self Learning Exercise: Cauchy‘s differential equation

42

TEXT / REFERENCE BOOK:

1. Higher Engineering Mathematics by Dr. B.S. Grewal 42nd

edition, Khanna publications.

2. Higher Engineering Mathematics by H.K.Dass , (2008

edition), Chand Publications.

43

IV SEMESTER

ENGINEERING MATHEMATICS – IV (4:0:0)

(Common to all branches)




Objective: Mathematics course content spread over four

semesters is designed to cater to the common needs of all the

major engineering disciplines at the UG level.

Course Outcomes:


able to:

1. Use numerical techniques to solve ordinary and

simultaneous differential equation with initial conditions.

2. Construct analytic functions and apply this concept to solve

fluid flow problems.

3. Explain geometric approach of conformal mapping and

compute complex line integrals using Cauchy‘s theorem.

4. Compute the series solution of Bessel and Legendre

differential equations also produce recurrence relations

and solve problems associated with them.

5. Apply the method of least square to produce the best fitting

curve for a given data and solve problems associated with

discrete probability distribution.

6. Solve problems associated with continuous probability

distribution, discrete joint distribution and Markov chain

using transition probability matrix.

44

UNIT 1: 9 Hrs

Numerical Methods:

Numerical Solutions of first order and first degree ordinary

differential equations – Taylor‘s method, Modified Euler‘s method,

Runge-Kutta method of fourth order. Milne‘s predictor and corrector

methods (no proofs). Simultaneous differential equations using

Taylor‘s and Runge-Kutta methods.

Self Learning Exercise: Solution of second order ordinary

differential equations using Taylor‘s and Runge-Kutta methods

UNIT 2: 9 Hrs

Complex Variables – 1:

Function of a complex variable – Limit, Continuity, Differentiability –

Definitions. Analytic functions, Cauchy-Riemann equations in

cartesian and polar forms, Properties of analytic functions.

Construction of analytic functions-Applications. Conformal Mapping

– Definition. Discussion of w = z2, w = z + (a

2 / z), z ≠0

Self Learning Exercise: w = sinz, ez

UNIT 3: 8 Hrs

Complex Variables – 2:

Bilinear transformations, Complex line integral, Cauchy‘s theorem,

Cauchy‘s integral formula. Laurent series expansion, Poles,

Residues, Problems on Cauchy‘s residue theorem.

Self Learning Exercise: Problems on Laurent series

UNIT 4: 9 Hrs

Special Functions:

Series solution of Bessel‘s differential equation leading to Bessel

function of first kind. Equations reducible to Bessel‘s differential

equation, Recurrence relations, Rodrigue‘s formula, Problems.

Self Learning Exercise: Series solution of Legendre‘s differential

equation

45

UNIT 5: 9 Hrs

Statistics and Probability – 1:

Curve fitting by the method of least squares: straight line, parabola

and exponential curves.

Probability: Random variables - Discrete random variables,

Binomial and Poisson distributions.

Self Learning Exercise: Basic definitions of probability and

problems upto Baye‘s theorem

UNIT 6: 8 Hrs

Probability - II

Continuous random variables, Exponential and Normal

distributions, Joint probability distribution (Discrete), Markov

chains – probability vector, Stochastic matrix, transition probability

matrix

Self Learning Exercise: Uniform distribution

TEXT BOOK:

1. Higher Engineering Mathematics – Dr. B.S. Grewal, 42nd

edition Khana Publications.

2. Advanced Engineering Mathematics - Erwin Kreyszig,

wiley publications, 10th Edition.

REFERENCE BOOKS:

1. Advanced Engg. Mathematics – H. K. Dass (2008 edition),

Chand Publications.

2. Higher Engg. Mathematics – B.V. Ramanna (2010 edition),

Tata McGraw-Hill Publications.

3. Probability, Statistics and Random Processes-3rd

Edition,Tata McGraw-Hill Publishing Company Limited,

New Delhi,2008- T.Veerarajan.

46

GRAPH THEORY AND COMBINATORICS (4:0:0)




Course Outcomes:


able to:

1. Explain the knowledge of fundamental concepts in graph

theory, including properties and characterization of

different types of graphs.

2. Understand additional concepts and terms in graph theory

and illustrate with an example how to solve actual problem

using graph theory

3. Discuss the significance of planarity and other concepts

from theoretical and practical point of view.

4. Demonstrate the concept of Trees, its properties and

types.

5. Apply the various Optimizing and Matching algorithms to

solve real world problems.

6. Analyze the applications of Inclusion and Exclusion

principle in combinatorial mathematics.

UNIT 1: 9 Hrs

Introduction to Graph Theory:

Definitions and Examples, Subgraphs, Complements and Graph

Isomorphism, Vertex Degree

and Handshaking property

Self Learning Exercise: Operations on Graphs

47

UNIT 2: 9 Hrs

Paths and Circuits:

Walks, Paths, Circuits and Cycles, Connected graphs,

disconnected graphs and components,

Euler Trails and circuits, Konigsberg Bridge Problem, Hamiltonian

Paths and Cycles.

Self Learning Exercise: Traveling Salesman Problem.

UNIT 3: 9 Hrs

Planar Graphs :

Planar, Non-planar graphs, Bipartite and Complete Bipartite

graphs, Kuratowski‘s graphs,

Euler‘s formula, Detection of planarity, Dual of a planar graph,

Graph coloring and

Chromatic polynomials: Decomposition theorem, Multiplication

theorem

Self Learning Exercise: Map Coloring

UNIT 4: 9 Hrs

Trees:

Definitions, Properties and Examples, Rooted Trees, Spanning

trees, Trees and Sorting, Weighted Trees and Prefix Codes.

Self Learning Exercise: Biconnected Components and

Articulation Points.

UNIT 5: 8 Hrs

Optimization and Matching :

Dijkstra‘s Shortest Path Algorithm, Minimal Spanning Trees: The

Algorithms of Kruskal and Prim,

Transport Networks: The Max Flow and Min-Cut Theorem

Self Learning Exercise: Matching Theory.

UNIT 6: 8 Hrs

The Principle of Inclusion and Exclusion: The Principle of

Inclusion and Exclusion,

48

Generalizations of the Principle, Derangements – Nothing is in its

Right Place, Rook Polynomials

Self Learning Exercise: Arrangements with forbidden positions

TEXT BOOKS:

1. Discrete and Combinatorial Mathematics by Ralph P.

Grimaldi, PHI, 5th Edition, 2004.

2. Graph Theory with Applications to Engineering and

Computer Science by Narsingh Deo, Prentice-Hall, 2004

REFERENCE BOOKS:

1. Graph Theory and Combinatorics by

D.S. Chandrasekharaiah: Prism, 2005.

2. Discrete Mathematics by Seymour Lipschutz and Marc

Lipson, 2nd

Edition.

E-BOOKS:

1. http://ocw.mit.edu/courses/Mathematics for computer-science/Readings

2. http://ntcl.ac.in

3. http://www.iro.umontreal.ca/~hahn/IFT3545/GTWA.pdf

MOOC’s: http://www.visualgo.net

http://www.visualgo.net/

http://www.visualgo.net/

49

COMPUTER ORGANIZATION (4:0:0)




Course Outcomes:


able to:

1. Describe the instruction execution in a typical computer

2. Analyze a central processing unit (CPU) through its

constituent parts like arithmetic logic unit (ALU), data path,

buses and the controller unit using micro-programmed

approach.

3. Apply the concept of microprogramming to add instructions

to the instruction set by incorporating more micro-programs

into the control memory.

4. Analyze various ways to speed up processor (by

incorporating instruction fetch unit, cache memory,

pipelining and branch prediction)

5. Compare different Data paths (mic-1, mic-2, mic-3) with

respect to cost and speed of execution.

6. Explain different addressing modes and expanding op-

codes of an instruction.

UNIT 1: 8 Hrs

Computer systems organization : Organization of a simple

Computer. Data path of a typical von neumam machine, Instruction

Execution, An interpreter for a simple computer.

Primary Memory: Memory Addresses, byte ordering. General

structure of a Memory chip. Address lines, Data lines, Chip select

line, read write lines. Operation of a memory, read and write.

50

Secondary Memory: Memory Hierarchy (registers, cache, main

memory, disk)

Clocks: division of the clock into sub-cycles (for providing time

references for multiple events), generation of an asymmetric clock.

Self Learning Exercise: Need for cache Memory (exclude

design of cache memory as it will be studied later).

UNIT 2: 9 Hrs

ALU: Logic diagram of a one-bit ALU. Getting a 32 bit ALU by

using many bit slices.

Memory: Memory Organization, Logic diagram of a 4X3 memory

(address selection, chip select enabling, generating read, write,

output-enable etc.). Memory Chips- using multiple memory chips to

organize the required memory (required size and width may be

more than size and width of available memory chips).

I/O interfacing: Creating input and output ports using latches and

buffers.

Memory interfacing: interfacing single and multiple chips to CPU

Self Learning Exercise: Need for Chip select

UNIT 3: 9 Hrs

The microarchitecture level : An Example Microarchitecture ,the

Data Path, ALU signals and functions performed,32 bit register

section, 32 bit ALU, 32 bit shifter, the precise timing of the data-

path, timing diagram for one data path cycle- setting up of control

signal, loading of registers, operating ALU and shifter, propagation

of results. Memory operations:32-bit word-addressable memory

port, 8-bit byte addressable memory port, MAR for word

addressing, PC for byte addressing, Organizing the 4 GB byte

oriented memory as 4-byte word and 1 byte word memory, sign

extension of one byte data into a 32bit data. Microinstructions:

signals for controlling the data-path, Micro-instruction format,

Microinstruction Control, The Mic-1:the complete micro-

architecture, Control store, Micro-program counter, Micro-

instruction register etc. The operation of the micro-architecture:

Mic-1.

51

Self Learning Exercise: Operations not possible in one Cycle.

UNIT 4: 9 Hrs

Instruction set ( ISA ) to be implemented by Mic-1: BIPUSH, DUP,

GOTO, IADD, IFEQ, IF_ICMPEQ, IINC, ILOAD, IOR, ISTORE,

NOP, POP, SWAP.

(Note: omit INVOKEVIRTUAL, IRETURN, LDC-W, WIDE).

Compiling a high level language to Mic-1 instruction set.

An Example Implementation: Microinstructions and Notation,

Implementation of the instruction set by Mic-1. (i.e., micro-

programs for all the macro instructions mentioned above).

Self Learning Exercise: Implementation of AND, ISUB,IFLT

instructions.

UNIT 5: 9 Hrs

Design Of The Microarchitecture Level : Speed versus Cost,

Reducing the Execution Path Length , merging the interpreter loop

with microcode, going from a two bus architecture to a three bus

architecture, Adding an instruction fetch unit (IFU) to Mic-1. A finite

state machine for implementing the IFU.

A Design with Prefetching: The Mic-2 , The data path for Mic-2,

Implementation of micro-programs for the instruction set in Mic-2.

Self Learning Exercise: A Pipelined Design: The Mic-3, mic-3

data-path (pipelined model), microstep of mic-3, instruction

execution on mic-3 (i.e., the execution of the pipe-line)

UNIT 6: 8 Hrs

Improving Performance Cache Memory, Design of Cache

memory:Direct mapped cache: design, set associative caches.

The instruction set architecture level: Expanding opcodes,

addressing modes- immediate addressing, direct addressing,

Register addressing, register indirect addressing, indexed

addressing, based-indexed addressing, orthogonality of opcodes

and addressing modes.

52

Branch Prediction, Dynamic branch prediction, static branch

prediction,

Self Learning Exercise: Advantages and Disadvantages of direct

and set associative cache memory.

TEXT BOOKS:

1. Structured Computer Organization: Andrew S.

Tannenbaum, 5th edition, 2005 (5

th edition is available in

Indian reprint Pearson/Prentice hall publication.)

REFERENCE BOOKS:

1. Douglas E. Comer ―Computer Architecture‖, Pearson

publication 2007 (The book is an outcome of the author‘s

efforts to salvage an undergraduate computer organization

course at PURDUE university (USA) which had suffered

years of neglect as a result of being taught by a series of

professors (mostly visitors) with little or no background in

digital hardware!- read the first para of PREFACE of the

book).

2. Malvino ―Digital computer Electronics:An introduction to

microcomputers, second edition(presently out of print- look

for an old copy). The author has come up with his own

„educational computer called SAP--Simple As Possible--

which has 3 generations, SAP-1,SAP-2 and SAP-3, which

is a look-alike of 8085.

3. Patterson and Hennessy, ―A quantitative approach to

computer architecture‖ (a monumental book on computer

architecture)

4. Williaum Stallings, ―Computer organization and

Architecture‖, A general text on computer Architecture.

5. Morris mono, ―Logic and computer design fundamentals‖ ,

A good reference for digital logic design, CPU design and

I/O.

53

MOOC’s:

1. http://www.supereasyfree.com/software/simulators/structur

ed-computer-organization-tanenbaum/mic-1-ijvm-

simulator/mic-ijvm-simulator.php

http://www.supereasyfree.com/software/simulators/structured-computer-organization-tanenbaum/mic-1-ijvm-simulator/mic-ijvm-simulator.php



54

ANALYSIS AND DESIGN OF ALGORITHMS (4:0:0)




Course Outcomes:


able to:

1. Explain the need for algorithms and the basic techniques of

analyzing efficiency of the algorithms.

2. Explain the efficiencies of recursive and non-recursive

algorithms.

3. Analyze and design algorithms using Divide and conquer

techniques.

4. Apply and design algorithms using Dynamic Programming

techniques.

5. Determine the efficiency and design the algorithms using

greedy techniques

6. Classify the NP problems and explain the limitations of

algorithm power.

UNIT 1: 9 Hrs

Analysis of algorithms:

Introduction, What is an algorithm?, Fundamentals of Algorithmic

Problem Solving, Fundamentals of the Analysis of Algorithm

Efficiency ,the Analysis Framework, Asymptotic Notations and

Basic Efficiency Classes, Mathematical Analysis of Non-recursive

Algorithms, Mathematical Analysis of Recursive Algorithms

Self Learning Exercise: Exercise problems on Mathematical

Analysis of Recursive Algorithms.

55

UNIT 2: 8 Hrs

Brute Force, Exhaustive Search:

Brute force :Selection Sort , Bubble Sort , Sequential Search and

Brute-Force String. Matching, Exhaustive Search: Traveling

Salesman Problem, Knapsack Problem, Depth-First Search and

Breadth- First Search.

Self Learning Exercise: Solving Assignment problem using

Exhaustive Search.

UNIT 3: 8 Hrs

Decrease-and-Conquer and Divide-and-Conquer

Decrease-and-Conquer: The method, Applications: Insertion Sort,

Topological Sorting, Interpolation Search. Divide and Conquer: The

method, Applications: Mergesort, Quicksort, and Strassen‗s Matrix

Multiplication.

Self Learning Exercise: The Closest-Pair Problems.

UNIT 4: 9 Hrs

Greedy Technique and Transform-and-Conquer:

Greedy Technique: The method, Applications: Prim‗s Algorithm,

Kruskal‗s Algorithm, Dijkstra‗s Algorithm, Huffman Trees and

Codes. Balanced Search Trees: The method, Applications: AVL

Trees, 2-3 Trees. Heaps and Heap-sort: Notion of the Heap, Heap-

sort.

Self Learning Exercise: Problems on Heap Sort.

UNIT 5: 9 Hrs

Dynamic Programming and SPACE-TIME TRADEOFFS:

Dynamic Programming: The method, Applications: The Knapsack

Problem and Memory Functions, Warshall‗s and Floyd‗s Algorithms

Space-Time Tradeoffs: The method, Applications: Introduction,

Sorting by Counting. Input Enhancement in String Matching using

harspool‘s Sring matching.

Self Learning Exercise: Boyer moore‘s String matching.

56

UNIT 6: 9 Hrs

Coping with the Limitations of Algorithm Power:

Backtracking: The method, Applications: n-Queens Problem,

Hamiltonian circuit Problem, Subset-Sum Problem Branch-and-

Bound: The method, Applications: Assignment Problem, Knapsack

Problem.

Self Learning Exercise: Limitations of Algorithm Power P, NP,

and NP-Complete Problems

TEXT BOOK:

1. Introduction to the Design & Analysis of Algorithms by

Anany Levitin, 3rd

Edition, 2011

2. Data structures, Algorithms and Applications in C++ by

Sartaj Sahni, TMH, 2nd

Edition, 2004

REFERENCE BOOK:

1. Introduction to Algorithms by Cormen, Leiserson, Rivest

and Stein, 3rd

Edition

MOOC’s:

1. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science for video lectures

2. www.nptel.com/algorithms for algorithm lecture notes

3. www.wikipedia.com/algorithms for primary information

http://ocw.mit.edu/courses/electrical-engineering-and-computer-science

http://ocw.mit.edu/courses/electrical-engineering-and-computer-science

http://www.nptel.com/algorithms

57

FINITE AUTOMATA AND FORMAL LANGUAGES

(3:2:0)




Course Outcomes:


able to:

1. Analyze different concepts of Automata Theory. (Analyze)

2. Apply properties of regular language. (Apply)

3. Construct parse trees for CFG. (Apply))

4. Construct Push Down Automata.(Apply)

5. Construct Turing Machine. (Apply)

6. Describe properties of Context Free Language and

undecidable problem. (Understand)

UNIT 1: 6 Hrs

Introduction to Finite Automata:

Introduction to Finite Automata, the central concepts of Automata

theory, deterministic finite automata, non-deterministic finite

automata, and application. Finite automata with Epsilon transition.

Self Learning Exercise: Extended transitions and Languages for

Є- NFA.

UNIT 2: 7 Hrs

Regular Expressions and Languages, Properties of Regular

Languages:

Regular Expression, Finite Automate and Regular Expressions,

Proving languages not to be regular, Closure Properties of Regular

58

Languages, Decision Properties of Regular Languages,

Equivalence and minimization of automata.

Self Learning Exercise: Applications of Regular Expressions.

UNIT 3: 7 Hrs

Context-Free Grammars and Languages:

Context-free grammars, Parse trees, Applications, Ambiguity in

grammars and languages.

Self Learning Exercise: Removing Ambiguity in grammars.

UNIT 4: 6 Hrs

Pushdown Automata:

Definition of the Pushdown automata, The languages of a PDA,

Equivalence of PDA‘s and CFG‘s, Deterministic Pushdown

Automata.

Self Learning Exercise: PDA to CFG

UNIT 5: 7 Hrs

Problems that computers cannot solve, The Turing Machine,

Programming techniques for Turing machines, extension to the

basic Turing machine, Restricted Turing Machine.

Self Learning Exercise: Turing Machine and Computers.

UNIT 6: 7 Hrs

Undecidability:

A Language that is not recursively enumerable, AN undecidable

problem that is RE, Post‘s Correspondance problem.

Properties of Context Free Languages

Normal forms for CFGs, The pumping lemma for CFGs.

Self Learning Exercise: Closure properties of CFLs.

59

TEXT BOOK:

1. Introduction to Automata Theory, Languages and

Computation, J.P. Hopcroft, Rajeev Motwani, J.D. Ullman,

Pearson Education, 3rd

Edition, 2012.

REFERENCE BOOKS:

1. Introduction to Languages and Theory of Computation,

John Martin, Tata McGraw Hill, 3rd

Edition, 2014.

2. Introduction to Computer Theory, Daniel I.A., Cohen,

John Wiley and Sons, Inc, 2nd

Edition, 2011.

3. An Introduction to Formal Languages and Automata,

Peter Linz, Narosa Publishing House, 5th Edition, 2011.

4. Introduction to the Theory of Computation, Michael

Sipser, Course Technology, 2nd edition, 2013.

E-BOOKS:

1. Finite Automata and Regular Expressions: Problems

and Solutions by Stefan Hollos, J. Richard Hollos, Abrazol

Publishing, 2013.

MOOC’s:

1. https://www.coursera.org/course/automata

http://www.amazon.in/s/ref=rdr_kindle_ext_aut?_encoding=UTF8&index=books&field-author=Stefan%20Hollos&search-alias=digital-text

http://www.amazon.in/s/ref=rdr_kindle_ext_aut?_encoding=UTF8&index=books&field-author=J.%20Richard%20Hollos&search-alias=digital-text

60

DATABASE MANAGEMENT SYSTEMS (4:0:0)




Course Outcomes:


able to:

1. Describe fundamental elements of a relational database management system.

2. Design entity-relationship diagrams to represent simple database application scenarios.

3. Apply relational algebraic operations on a database model.

4. Formulate SQL queries on the databases.

5. Criticize a database design and improve the design by normalization.

6. Describe the various features of transaction processing and

concurrency control.

UNIT 1: 9 Hrs

Databases and Database Users: Introduction, Example,

Characteristics of the database approach, Actors on the scene,

Workers behind the Scene, Advantages of using DBMS Approach,

Implications of the Database Approach, When Not to Use a

Database Management Systems.

Database System Concepts and Architecture: Data Models,

Schemas, and Instances, Three-schema Architecture and Data

Independence, Database Languages and Interfaces.

Self Learning Exercise: The Database System Environment,

Classification of Database Management Systems.

UNIT 2: 8 Hrs

Data Modeling Using the Entity-Relationship (ER) Model: Using High-Level Conceptual Data Models for Database Design, A

Sample Database Application, Entity Types, Entity Sets, Attributes,

61

and Keys, Relationship Types, Relationship Sets, Roles, and

Structural Constraints, Weak Entity Types, ER Diagrams, Naming

Conventions, and Design Issues.

Self Learning Exercise: Subclasses, superclasses and

inheritance.

UNIT 3: 9 Hrs

The Relational Data Model, Relational Database Constraints

and Relational Algebra:

Relational Model Concepts, Relational Model Constraints and

Relational Database Schemas, Update Operations, Transactions

and Dealing with Constraint Violations. Unary relational operations,

Relational algebra from set theory, Binary Relational Operations,

Examples of Queries in Relational Algebra

Self Learning Exercise: Relational Database Design Using ER-to-

Relational Mapping.

UNIT 4: 9 Hrs

Basic SQL, Complex Queries, Views and Schema Modification:

SQL Data Definition and Data types, Specifying Constraints, Basic

retrieval Queries, Insert, Delete, and Update Statements in SQL,

More Complex SQL retrieval Queries, Views (Virtual Tables) in

SQL, Schema Change Statements in SQL.

Self Learning Exercise: Embedded SQL, Dynamic SQL.

UNIT 5: 8 Hrs

Functional Dependencies and Normalization for Relational

Databases:

Informal Design Guidelines for Relation Schemas, Functional

Dependencies, Normal Forms Based on Primary Keys, General

Definitions of Second and Third Normal Forms.

Self Learning Exercise: Boyce-Codd Normal Form.

UNIT 6: 9 Hrs

Transaction processing concepts:

Introduction to transaction processing, Transaction and system

concepts, desirable properties of transaction, characterizing

62

schedules based on recoverability, characterizing schedules based

on serializability, transaction support in SQL

Concurrency control techniques: Two – phase locking

techniques for concurrency control.

Self Learning Exercise: Database recovery techniques:

Deferred update, Immediate Update, Shadow Paging.

TEXT BOOK:

1. Fundamentals of Database Systems, Ehmasri and

Navathe: Pearson Education, Sixth Edition, 2013.

REFERENCE BOOKS:

1. Database System Concepts, Henry F Korth, Abraham

Silberschatz, Sudarshan S, McGraw-Hill, 6th Edition, 2013.

2. Database Management Systems Raghu Ramakrishnan

and Johannes Gehrke, McGraw Hill, Third Edition, 2013.

MOOC’s

1. http://www.MySQL Database For Beginners –Learning AdvisorBeginner PHP and MySQL Tutorial-Udemy Introduction to Modern DatabaseSystemsUniversità TelematicaInternazionaleUNINETTUNO

2. https://www.coursera.org/course/db

3. https://onlinecourses.nptel.ac.in/noc15_cs14/preview

4. https://lagunita.stanford.edu/courses/DB/RD/SelfPaced/about#

E-BOOKS:

1. http://ocw.mit.edu/courses/electrical-engineering-and-computerscience/6-830- database-systems-fall-2010/download- course-materials/

2. https://books.google.com/books?isbn=9380006330

3. http://www.ebooks-for- all.com/bookmarks/list/ onecat/ Electronic-books+Computers+Databases/0.html

4. http://www.lincoste.com/ebooks/english/pdf/computers/database_management_systems.pdf

5. www.slideshare.net/rahulrathore725/dbms-slides

6. http://www.nptelvideos.in/2012/11/database-management-system.html

63

ANALYSIS AND DESIGN OF ALGORITHMS LAB

(0:0:2)


Hrs/Week : 02

Course Outcomes


able to:

1. Explain the meaning of space and time complexity of

algorithms.

2. Gain practical experience in a variety of common

algorithms and analyze these using asymptotic notations.

3. Explain different algorithm design techniques for solving

wide range of problems.

4. Compare performances of different algorithms to solve the

same problem.

List of Programs:

1. Implement the following problems using Brute Force

technique and Repeat the experiment for different values

of n, the number of elements in the list to be searched/

sorted.

a. Recursive linear search

b. Selection sort

2. Implement the following problems using Divide & Conquer

technique, and analyse their time complexity.

a. Merge sort

b. Quick sort

c. Recursive binary search

64

3. Implement the following problems using Decrease &

Conquer technique, and analyse their time complexity.

a. Insertion sort

b. Topological sorting using DFS

c. Interpolation Search

d. BFS

4. Problems using transform and conquer technique

a. Heap sort

5. Problems using greedy technique

a. Prim's algorithm

b. Kruskal's algorithm

c. Dijkstra's algorithm

6. Problems using dynamic programming technique

a. Warshall's algorithm

b. Floyd's algorithm

c. Knapsack algorithm

7. Problems using Backtracking technique.

a. N queens problem

8. Problems using Branch & Bound technique.

a. Travelling Salesperson Problem

TEXT BOOK:

1. Introduction to the Design & Analysis of Algorithms by

Anany Levitin, 3rd

Edition, 2011

2. Data structures, Algorithms and Applications in C++ by

Sartaj Sahni, TMH, 2nd

Edition, 2004

65

DATABASE LAB (0:0:2)


Hrs/Week : 02

Course Outcomes


able to:

1. Design a database schema for a given problem-domain

2. Solve queries of relational database using the SQL.

PART – A

Exercise – 1

1. Create table ‗Dept‘ with the following specification:

COLUMN NAMES TYPE SIZE

Dept_no Number 2

Dept_name Char 30

Dept_location Char 20

2. Write the SQL command to view the structure of the above

created table.

3. Add a record in the Dept table.

4. Write the SQL command to display all the columns of the

Department table.

Exercise – 2 (Constraints on the table)

Column or Table level Constraints

1. Create a table Emp with certain data entry restrictions and

specifications:

- Emp_no should be a primary key

- Emp_name, Designation and Date_of_join should not be

empty.

- Salary should be greater than 3000.

66

- Dno is a foreign key referencing the table Emp.

- Mgr is self referential integrity referring Emp_no

COLUMN NAMES TYPE SIZE

Emp_no Number 5

Emp_name Varchar2 30

Designation Char 10

Mgr Number 5

Date_of_join Date

Salary Number 9,2

Comm Number 6,2

Dno Number 2

Constraints on Existing tables

2. Write the SQL command to make Dept_no of Department

table a primary key.

Foreign Key constraint

3. Write the SQL command to make Dno of Emp table

referring Dept_no of table Dept.

4. Add records in the Emp table:

Exercise – 3 (Simple SELECT Command)

Give the SQL commands for the following:

1. Display all information in the tables EMP and DEPT.

2. Display only the join date and employee name for each

employee.

3. Display the join date, name and department number for all

clerks.

4. Display the names and salaries of all employees with a

salary greater than 20000.

5. Display the names of all employees with an `A' in their

name.

67

6. Display the names of all employees with exactly 5 letters in

their name.

7. Display the names and join dates of all employees joined in

2000 or 2005

8. Display the names and dates of employees with the

column headers \Name" and \Start Date"

9. Display the department numbers of all departments

employing a clerk.

10. Display the names and salaries of all employees in reverse

salary order.

Exercise – 4 (Group SELECT Command)

1. Display the maximum, minimum and average salary and

commission earned.

2. Display the department number, total salary payout and

total commission payout for each department.

3. Display the department number, total salary and total

commission payout for each department that pays at least

one employee commission.

4. Display the department number and number of clerks in

each department.

5. Display the department number and total salary of

employees in each department with four or more people.

6. Display the employee number of each employee who

manages other employees with the number of people he or

she manages.

Exercise – 5 (Join SELECT Command)

1. Display the name of each employee with his department

name.

68

2. Display a list of all departments with the employees in each

department.

3. Display all the departments with the manager for that

department.

4. Display the names of each employee with the name of

his/her boss.

5. Display the names of each employee where the manager

is same as ‗JONES‘

6. Display the employee number and name of each employee

who manages other employees with the number of people

he or she manages.

Exercise – 6 (SELECT with Sub-queries)

1. Display the names and job titles of all employees with the

same job as Jones.

2. Display the names and department name of all employees

working in the same city as Jones.

3. Display the name of the employee whose salary is the

lowest.

4. Display the names of all employees except the lowest paid.

5. Display the names of all employees whose job title is the

same as anyone in the sales dept.

Exercise – 7 (Views)

1. Create a view called VIEWEMP which gives the same

displays as Emp.

2. Create a view called DEPTSUM with two columns called

DEPARTMENT and SUMSAL containing the name of each

department and the sum of the salaries for all employees in

the department. Look at it using a SELECT command.

69

3. Create a view called BOSS which has the name and

number of each employee with the name and number of

his or her manager (with blanks alongside any employee

that has no manager). Give each column in the view a

suitable name.

PART – B

Mini Project on DBMS:

To gain hands-on experience in designing and implementing a

database-system application, select one of the application and

then analyze the requirements, and design, implement,

document and demonstrate a working database-system

application. The result of your project should be a working

implementation that uses SQL to access data stored in a

relational database.

Groups:

The project is to be done in groups of 4 students. Each group

is responsible for its own division of work, scheduling, etc.

More than a group cannot work on the same application

choice, and the applications will be distributed on the first-

come-first-served basis.

Report Requirements:

The final report must contain:

A short overview of the system including identification of

the various types of users and user groups who will be

accessing the system in various ways.

A graphical schema of the database using the E-R model.

A list of the attributes for each entity and relationship,

identification of keys and a short description of the purpose

of each entity set and relationship set.

70

The DDL statements to create the relational schema in

some appropriate Normal Form, identification and

justification of which Normal Form the schema is in, and

identification of primary and foreign keys.

Example scenarios of how various types of users will

interact with the system with example screen shots or

listings obtained by spooling.

A description of the system's limitations and the

possibilities for improvements.

71

CONSTITUTION OF INDIA AND PROFESSIONAL

ETHICS (2:0:0)

Sub Code : HS0001 CIE : 50% Marks



Course Outcomes:

On successful completion of the course the students will be able to:

1. Preamble to the Constitution of India – Fundamental Rights under part III, details of exercise of Rights – limitations and impartment cases. Understand the significance of many provisions of the Constitution as well as to gain insight into their beck ground. They will also understand number of fundamental rights subject‘s limitations in light of leading cases.

2. Relevance of Direct to Principals of State Policy under part IV They will study these as there are guidelines for the State as well as for the Citizens to be followed by the State in matter of administration as well as in making the laws. It also includes fundamental duties of the Indian Citizens in part IV A (Article 51A)

3. Union Executive – President – Vice President – Prime Minister, Parliament, Supreme Court of India. For the administration of a State, the doctrines of Separation of Power are there in this unit.

4. State Executive – Governors, Chief Minister, State legislature and High Court. The Students will be able to know how the State is administered at the State level and also the powers and functions of High Court.

5. Constitutional provisions for SCs/STs, Women and Children, Backward classes, Emergency provisions.

72

Special provisions have been created for them with special reference to Women empowerment. For the stability and security of the Nation, Emergency Provision are Justified.

6. Electoral Process- Amendment procedure, 42nd

, 44th, 74

th,

76th, 86

th, 91

st Constitutional Amendments.

It is an independent body with enormous power and functions to be followed both at the Union and State level. Amendments are necessary, only major few amendments have been included.

7. Scope and Aims of Engineering Ethics – responsibility of engineers – impediments to responsibility. The scope is very wide, it also includes responsibility of engineers must be considered in the light of social responsibility along with impediments.

8. Honesty – Integrity, Reliability, Risks, Safety, Liability in Engineering Ethics. As the engineers need to possess these qualities, which will make them full fledged professionals. The laws, codes of Ethics and morality determined the extend of ability in engineering.

UNIT 1: 4 Hrs

Preamble to the Constitution of India. Fundamental rights under

Part III details of Exercise of Rights, Limitations and Important

Leading cases.

UNIT 2: 3 Hrs

Relevance of Directive Principles of State Policy under Part-IV, IVA

Fundamental duties.

UNIT 3: 3 Hrs

Union Executive - President, Vice-President, Prime Minister, Union

Legislature - Parliament and Union Judiciary – Supreme Court of

India.

73

UNIT 4: 3 Hrs

State Executive - Governors, Chief Minister, State Legislature and

High Court.

UNIT 5: 4 Hrs

Constitutional Provisions for Scheduled Casters and Tribes,

Women and Children and Backward Classes, Emergency

Provisions.

UNIT 6: 3 Hrs

Electoral process, Amendment procedure, 42nd, 44th, 74th, 76th,

86th and 91st Constitutional amendments.

UNIT 7: 3 Hrs

Scope and aims of engineering ethics, responsibility of Engineers.

Impediments to responsibility.

UNIT 8: 3 Hrs

Honesty, Integrity and reliability, risks, safety and liability in

Engineering.

TEXT BOOK:

1. Durga Das Basu : "Introduction to the Constitution of India"

(student edition) Prentice - Hall EEE, 19th /20th Edition,

2001.

2. "Engineering Ethics" by M.Govindarajan, S.Natarajan,

V.S.Senthikumar, Prentice - Hall of India Pvt. Ltd., New

Delhi, 2004

74

BRIDGE COURSE MATHEMATICS – II (2:0:0)

(For Diploma students during IV semester)




Objective: The course content spread over two semesters caters

to the basic need of diploma students entering the engineering

course at the third semester lacking in the knowledge of several

topics taught at the PU level.

Course Outcomes:


able to:

1. Compute double and triple integrals.

2. Compute certain improper integrals using Beta – Gamma

functions.

3. Solve problems on vector differentiation.

4. Operate vector differential operator ‗del‘ on vector and

scalar point functions and solve problems associated with

it.

5. Operate Laplace and Inverse Laplace transform on

functions and use it to solve differential equations with

initial and boundary conditions.

UNIT 1: 5 Hrs


Double and Triple integrals – evaluation. Evaluation of double

integral over a region

Self Learning Exercise: Evaluation by converting into polar form

75

UNIT 2: 4 Hrs


Beta and Gamma functions – Definition, Relation between beta

and gamma function (without proof) simple problems.

Self Learning Exercise: Properties

UNIT 3: 4 Hrs

Vector Calculus – 1:

Differentiation of vectors, velocity, acceleration, components of

velocity and acceleration

Self Learning Exercise: Revision of Vector Algebra

UNIT 4: 4 Hrs

Vector Calculus – 2:

Vector differentiation -Gradient, Divergence, Curl and Laplacian,

Solenoidal.

Self Learning Exercise: Irrotational vectors and finding scalar

potential

UNIT 5: 5 Hrs

Laplace Transforms:

Definition, Laplace transforms of standard functions (formulae).

Shifting and Derivative of transform properties – simple problems.

Unit step function- Problems

Self Learning Exercise: Laplace transform of discontinuous

functions

UNIT 6: 4 Hrs

Inverse Laplace Transforms:

Inverse transforms – Method of completing square and partial

fractions. Solution of ordinary and simultaneous differential

equations using Laplace transforms method.

Self Learning Exercise: Applications

76

TEXT / REFERENCE BOOK:

1. Higher Engineering Mathematics by Dr. B.S. Grewal,

42nd

edition, Khanna publications.

2. Higher Engineering Mathematics by H.K.Dass , (2008

edition), Chand Publications.

preface - national institute of engineering · 2016-09-19 · preface dear students, since it...

Documents