SCHEME OF TEACHING AND EXAMINATION

ACADEMIC YEAR: 2016 – 2017

B.E. IV SEMESTER

Sl.

No. Subject Code Subject Credits

Hours/Week Examination Marks

Lecture Tutorial Practical CIE SEE Total

1 UMA401C Engineering Mathematics-IV 04 4 0 0 50 50 100

2 UIS408C Microcontroller and Embedded Systems 04 4 0 0 50 50 100

3 UIS403C Analysis and Design of Algorithms 04 3 2 0 50 50 100

4 UIS414C Object Oriented Programming with C++ 04 4 0 0 50 50 100

5 UIS409H Professional Communication & Technical

Writing

02 2 0 0 50 50 100

6 UIS416C Theoretical Foundations of Computer

Science

04 4 0 0 50 50 100

7 UIS410L Microcontroller and Embedded Systems

Laboratory

1.5 0 1 2 50 50 100

8 UIS411L Analysis of Algorithm using C++

Laboratory

1.5 0 1 2 50 50 100

9 UMA400M Advanced Mathematics – II – 4 – – 50 50 100*

Total 25 21** 4 4 400 400 800

* Advanced Mathematics-II is a mandatory subject only for students having Diploma and admitted to 3rd Semester through lateral

entry Scheme. Passing the subject is compulsory; however marks will not be considered for awarding grade/class. A PP/NP

grade will be awarded for passing/not passing the subject.

** The total lecture hours for students having Diploma and admitted to 3rd Semester through lateral entry scheme is 26 hours.

IV SEMESTER

UMA401C: ENGINEERING MATHEMATICS – IV

4 CREDITS (4 – 0 – 0)

UNIT – I

14 Hours

Complex Analysis: Analytic functions, Cauchy–Riemann equations in Cartesian and polar

forms-consequences, construction of analytic function (Cartesian and polar forms). Definition

of Conformal transformations:zez ,2

, 02

zwherez

az , Bilinear transformations.

Complex Integration: Line integral, Cauchy’s theorem – Corollaries, Cauchy’s integral

formula. Taylor and Laurent’s series (statements only), Singularities, poles, calculations of

residues, Residue theorem (without proof) – problems.

UNIT – II

14 Hours

Special Functions: Series solution of Bessel’s differential equation, recurrence formulae,

generating function, orthogonal property, Bessel’s integral formula.

Series solution of Legendre’s differential equation recurrence formulae, generating function,

orthogonal property, Rodrigue’s formula.

UNIT – III

12 Hours

Statistics and Probability: Curve fitting by the method of least squares:2,, cxbxayabybxay x .correlation and regression. Probability – addition rule,

conditional probability, multiplication rule, Baye’s rule.

Discrete and continuous random variables – PDF – CDF, Binomial, Poisson and Normal

distributions.

UNIT – IV

12 Hours

Sampling Distribution: Sampling, Sampling distribution, standard error, Null and

alternative hypotheses, Type I error and Type II errors, testing of hypothesis for means, level

of significance for means, Confidence limits for means, large and small samples, Student’s

t – distribution. Central limit theorem (without proof).

Joint Probability Distribution and Markov Chains: Concept of joint probability , Joint

distributions – discrete random variables, Continuous random variables, independent random

variables, Markov chains, higher transition probabilities, stationary distributions of regular

markov chains and absorbing states.

TextBooks:

1) B.S.Grewal, “Higher Engineering Mathematics”, Khanna Publishers, New Delhi.

2) Seymour Lipschutz, Theory band Problems of Probability, Schaum’s series.

3) H. K. Dass, S. Chand & Co. “Advanced Engineering Mathematics”.

4) E. Kreyszig, John Wiley & Sons, “Advanced Engineering Mathematics”.

5) Roy D. Yates and David J. Goodman, “Probability and stochastic Processes”, 2nd

Edition, Wiley India Pvt. Ltd., 2012.

6) Dennis G. Zill, Patrick D. Shanahan, “A first course in Complex analysis with

applications”, 2nd edition, 2010.

UIS408C: Microcontroller and Embedded Systems

4 Credits (4-0-0)

UNIT – I

13 Hours

The 8051 Microcontrollers, Assembly Language Programming: Microcontrollers and

Embedded systems, Overview of the 8051 family, Inside the 8051, Introduction to 8051

Assembly programming, Assembling and running an 8051 program, the program counter and

ROM space in the 8051, 8051 data types and directives, 8051 flag bits and PSW register,

8051 register banks and stack.

Jump, Loop and Call Instructions, I/O Port Programming: Loop and Jump instructions,

Call instructions, Time delay for various 8051 chips, 8051 I/O programming, I/O bit

manipulation programming.

UNIT – II 13 Hours

8051 Addressing Modes, Arithmetic, Logic Instructions and Programs: Immediate and

register addressing modes, Accessing memory using various addressing modes, Bit addresses

for I/O and RAM, Extra 128-byte-on-chip RAM in 8052, Arithmetic instructions, Signed

number concepts and arithmetic operations, Logic and compare instructions, Rotate

instruction and data serialization, BCD, ASCII, and other application programs.

8051 Programming in C, Pin description of 8051: Data types and time delay in 8051 C, I/O

programming in 8051 C, Logic operations in 8051 C, Data conversion programs in 8051 C,

Accessing code ROM space in 8051 C, Data serialization using 8051 C, pin description of the

8051.

UNIT – III

13 Hours

8051 Timer Programming in Assembly and C: Programming 8051 timers, counter

programming, Programming timer 0 and 1 in 8051 C.

8051 Serial Port Programming in Assembly and C: Basics of serial communication, 8051

conversion to RS232, 8051 serial port programming in Assembly, Programming the second

serial port, Serial port programming in C.

UNIT – IV

13 Hours

Interrupts Programming in Assembly and C: 8051 interrupts, Programming timer

interrupts, Programming external hardware interrupts, Programming the serial

communication interrupt, Interrupt priority in the 8051/52, Interrupt programming in C.

8051 Interfacing with the 8255, Motor Control: Programming the 8255, 8255 Interfacing,

8051 C programming for the 8255, Stepper motor interfacing, DC motor interfacing and

PWM.

Text Book(s):

1. Muhammad Ali Mazidi, Janice Gillispie Mazidi and Rolin D. McKinlay, “ The 8051

Microcontroller and Embedded Systems” using Assembly and C. Pearson 2nd Edition,

2011.

Chapter 1: 1.1-1.2, Chapter 2: 2.1-2.7, Chapter 3: 3.1-3.3, Chapter 4: 4.1-4.2, Chapter

5: 5.1-5.4, Chapter 6: 6.1-6.5, Chapter 7: 7.1-7.6, Chapter 8: 8.1, Chapter 9: 9.1-9.3,

Chapter 10: 10.1-10.5, Chapter 11: 11.1-11.6, Chapter 15: 15.1-15.3, Chapter 17:

17.2-17.3

Reference Book(s):

1. Kenneth J. Ayala, “The 8051 Microcontroller Architecture, Programming and

Applications”, 2nd Edition, Penram International, 1996.

2. Dr. Uma Rao and Dr. Andhe Pallavi, “The 8051 Microcontroller Architecture,

Programming and Applications”, Pearson Education Sanguine.

3. V Udayshankar, M S Mallikarjunaswamy, “ 8051 Microcontroller: Hardware,

Software and Applications”, McGrawHill, New Delhi.

UIS403C: ANALYSIS AND DESIGN OF ALGORITHMS

4 CREDITS (3 – 2 – 0)

UNIT – I

13 Hours

Introduction: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving,

Important Problem Types, Fundamental Data Structures.

Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic

Notations and Basic Efficiency Classes, Mathematical Analysis of Nonrecursive Algorithms,

Mathematical Analysis of Recursive Algorithms, Example: Fibonacci Numbers.

UNIT – II

13 Hours

Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force String

Matching, Exhaustive Search.

Divide-and-Conquer: Mergesort, Quicksort, Binary Search, Binary Tree Traversals and

Related Properties, Multiplication of Large Integers and Stressen’s Matrix Multiplication.

Decrease-and-Conquer: Insertion Sort, Depth-First Search and Breadth-First Search,

Topological Sorting, Decrease-by-a-Constant-Factor Algorithms, Variable-Size-Decrease

Algorithms.

UNIT – III

13 Hours

Transform-and-Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort, Problem

Reduction.

Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching,

Hashing, B-trees.

Dynamic Programming: Computing a Binomial Coefficient, Warshall’s and Floyd’s

Algorithms, The Knapsack Problem and Memory Functions.

UNIT – IV

13 Hours

Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman

Trees.

Limitation of Algorithm Power: Lower-Bound Arguments, Decision Trees.

Coping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound.

Text Book(s):

1) Anany Levitin, “Introduction to the Design & Analysis of Algorithms”, 2nd Edition,

[Chapters or Topics: 1, 2.1–2.5, 3.1, 3.2, 3.4, 4.1–4.5, 5.1–5.3, 5.5, 5.6, 6.1, 6.3, 6.4,

6.6, 7, 8.1, 8.2, 8.4, 9, 11.1–11.3, 12.1–12.2], Pearson Education, 2007.

Reference Book(s):

1) Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein,

“Introduction to Algorithms”, 2nd Edition, PHI, 2006.

2) Horowitz E., Sahni S., Rajasekaran S. “Computer Algorithms”, Galgotia Publications,

2001.

UIS414C: OBJECT ORIENTED PROGRAMMING WITH C++

4 CREDITS (4 – 0 – 0)

UNIT – I

12 Hours

Principles of Object-Oriented Programming: Software Evolution, A Look at

Procedure-Oriented Programming, Object-Oriented Programming Paradigm, Basic Concepts

of Object-Oriented Programming, Object Oriented Languages, Applications of OOP.

Introduction to C++: Console Input/Output in C++, Variables in C++, Reference Variables

in C++, Function Prototyping, Function Overloading, Default Values for Formal Arguments

of Functions, Inline Functions.

Classes and Objects: Introduction to Classes and Objects, Member Functions and Member

Data, Objects and Functions, Objects and Arrays, Namespaces, Nested Classes.

UNIT – II

13 Hours

Constructors and Destructors: Constructors, Destructors, The Philosophy of OOPS.

Inheritance: Introduction to Inheritance, Base Class and Derived Class Pointers, Function

Overriding, Base Class Initialization, The Protected Access Specifier, Deriving by Different

Access Specifiers, Different Kinds of Inheritance, Order of Invocation of Constructors and

Destructors.

Dynamic Memory Management: Introduction, Dynamic Memory Allocation, Dynamic

Memory Deallocation.

UNIT – III

13 Hours

Operator Overloading: Operator Overloading, Overloading the Various Operators:

Overloading the Increment and the Decrement Operators (Prefix and Postfix), Overloading

the Unary Minus and the Unary Plus Operator, Overloading the Arithmetic Operators,

Overloading the Relational Operators, Overloading the Assignment Operator, Overloading

the Insertion and Extraction Operators, Overloading the new and the delete Operators,

Overloading the Subscript Operator, Overloading the Pointer-to-member () Operator

(Smart Pointer).

UNIT – IV

14 Hours

Virtual Functions and Dynamic Polymorphism: The Need for Virtual Functions, Virtual

Functions, The Mechanism of Virtual Functions, Pure Virtual Functions, Virtual Destructors

and Virtual Constructors.

Templates: Introduction, Function Templates, Class Templates, The Standard Template

Library (STL).

Stream Handling: Streams, The Class Hierarchy of Handling Streams, Text and Binary

Input/Output, Text Versus Binary Files, Text Input/Output, Binary Input/Output, Opening

and Closing Files, Files as Objects of the fstream Class.

Type Conversion: Type Conversion, New Style Casts and RTTI.

Exception Handling: Introduction, C-Style Handling of Error-generating Code, C++ Style

Solution–the try/throw/catch Construct, Limitation of Exception Handling.

Text Book(s):

1) Sourav Sahay, “Object-Oriented Programming with C++”, [Chapters or Topics:

1.5–1.11, 2, 3.1–3.3, 4, 5, 6, 7.1–7.8, 8, 9, 10], Oxford University Press, 2006.

2) E. Balaguruswamy, “Object-Oriented Programming with C++”, 2nd Edition,

[Chapters or Topics: 1.2–1.8], Tata McGraw-Hill.

Reference Book(s):

1) Herbert Schildt, “The Complete Reference C++”, 4th Edition, Tata McGraw-Hill.

2) P. B. Kotur, “Object-Oriented Programming with C++”.

.

UIS409H: PROFESSIONAL COMMUNICATION AND TECHNICAL WRITING

2 CREDITS (2-0-0)

UNIT – I

06 Hours

Communication In The Workplace: Role of Communication in Business, Process of Human

Communication. Feedback, elements, objectives, principles of communication, Importance of

communication, barriers in communication

Communication In Organization: Formal & informal communication, verbal & non-verbal

communication, oral & written communication, horizontal and vertical communication.

UNIT – II

06 Hours

Writing For The Effect: Business Etiquette and need for effect, Conversational Style, You-

view Point

Listening: Introduction, meaning of listening, poor listening habits, types of listening,

Effective and ineffective listening skills, Strategies for effective listening, payoffs of effective

listening, barriers of effective listening.

UNIT – III

07 Hours

Written forms of communication: Letters: Business letters, memos, E-mails,

Reports: Objectives, Characteristics of a report, types of reports, importance of reports,

Formats, Prewriting, Structure of reports, Writing the reports, Revising, editing and proof

reading.

UNIT – IV

07 Hours

Research paper, Dissertation Correctness of communication Common Errors in Usage,

Punctuation and capitalization, words commonly misspelt.

Text Book(s):

1. 1. Lesikar and Fatley , Basics Business communication Skills for Empowering the

Internet Generation 10th edition,; Tata McGraw Hill edition, ISBN: 978-0-

07-059975-8.

2. Meenakshi Raman and Sangeeta Sharma “Technical Communication Principles and

practices”, Oxford University Press, ISBN-13 978-0-19-566804-9.

3. Meenakshi Raman and Prakash Singh “Business Communication”, Oxford University

Press, ISBN-13: 978-0-19-567695-2.

Reference Book(s):

1. M Ashraf Rizvi “ Effective Technical Communication”, Tata McGraw Hill Company

Limited, ISBN: 978-0-07-059952-9.

2. P.D.Chaturvedi Mukesh Chaturvedi “ Business Communication- Concepts, Cases and

Application”, Pearson Education, ISBN:81-317-0172-7.

3. Rajendra Pal and J S Khorahalli , Essential of Business Communication-, S Chand

and Sons Publications.

4. Urmita Rai nad S,M Rai ,Business Communication-, Himalaya Publishing House.

5. Krishna Mohan and Meera Banerjee , “Developing Communication Skills”,

McMillan India Ltd.

6. Asha Kaul , “Business Communication”, Prentice Hall India Pvt Ltd.

UIS416C: THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

4 CREDITS (4-0-0)

UNIT – I

13 Hours

Automata: Introduction to Finite Automata, The central concepts of Automata theory. Finite

Automata: Deterministic Finite automata, Non-Deterministic Finite Automata. An application

of Finite Automata, and Finite Automata with Epsilon-transitions,

Regular Expressions: Regular expressions, Finite Automata and Regular Expressions, and

Applications of Regular Expressions.

UNIT – II

13 Hours

Properties of Regular Languages: Proving languages not to be regular languages, Closure

properties of regular languages, Decision properties of regular languages, and Equivalence

and Minimization of Automata.

Context Free Grammars and Languages: Context Free Grammars, Parse trees,

Applications of Context Free Grammars, Ambiguity in Grammars and Languages.

UNIT – III

13 Hours

Pushdown Automata: Definition of the Pushdown Automaton, The languages of a PDA,

Deterministic Pushdown Automata.

Properties of Context-Free Languages: Normal forms for Context Free Grammars and The

pumping lemma for Context Free Languages.

UNIT – IV

13 Hours

Introduction To Turing Machine: The Turning Machine, Programming Techniques for

Turning Machines, Extensions to the basic Turning Machines, Turing Machine and

Computers.

Text Book(s):

1. John. E., Hopcroft, Rajeev. Motwani, Jeffrey. D., Ullman, “Introduction to Automata

Theory, Languages and Computation”, 3rd Edition, Pearson Education, 2007. (Chapters: 1.1,

1.5, 2.2 to 2.5, 3.1 to 3.3, 4, 5, 6.1, 6.2, 6.4, 7, 8.1 to 8.4, 8.6)

Reference Book(s):

1. Peter. Linz, “An Introduction to Formal Languages and Automata", Third Edition,

Fifth printing.

2. John, E., Hopcroft, Jeffrey. D. Ullman, “Introduction to Automata Theory, Languages

and Computation”, Narosa Publication.

A. M., PadmaReddy, “Finite Automata and Formal Languages, Pearson Education, 2012

Microprocessor and Microcontroller Laboratory (UIS410L)

1.5 Credit (0-0-3)

Part A: Software Programming

1. Assignments on Data Transfer Instructions:

a. Move block of n elements from source to destination

b. Exchange blocks of data from source to destination

2. Assignments on Arithmetic Instructions:

a. Addition of two 8 bit numbers and addition of two 16 bit numbers

b. Subtraction of two 8 bit numbers and subtract two 16 bit quantities taking care

borrow

c. Multiplication of two 8 bit numbers

d. Division of two 8 bit numbers

e. Find largest number form list of array

3. Assignments on Counters:

a. Decimal down counter

b. Decimal up counter

c. Hex down counter

d. Hex upcounter

4. Assignments on Boolean & Logical instructions:

a. AND Operation, OR Operation and XOR Operation

b. Clear 2nd bit of acc and Set 2nd bit of acc

5. Assignments on Code conversion-1:

a. Ascii2decimal

b. Decimal2ascii

c. Bcd2ascii

6. Assignments on Code conversion-2:

a. Decimal2hex

b. Hex2decimal

Part B: Hardware / Interfacing Programming

1. LED Toggling

2. Generation of RAMP waveforms

3. Generation of Triangular/ Square waveforms

4. Stepper motor control interface to 8051.

5. DC motor control interface to 8051.

UMA400M: ADVANCED MATHEMATICS – II

(MANDATORY SUBJECT)

(COMMON TO ALL BRANCHES)

UNIT – I

11 Hours

Solid Geometry: Distance formula (without proof), Division formula, direction cosines and

direction ratios, planes and straight lines, angle between the planes.

UNIT – II

10 Hours Vector Differentiation: Velocity, Acceleration of a particle moving on a space curves.

Vector point function. Directional derivative, Gradient, Curl and Divergence. Solenoidal

and Irrotational vectors-simple problems.

UNIT – III

19 Hours

Laplace Transforms: Definition – Transform of elementary functions. Derivatives and

integrals of transforms–problems. Periodic functions. Inverse transforms – Properties

Solutions of linear differential equations. Applications to Engineering problems.

TextBooks:

1) Elementary Mathematics by B. S. Grewal.

2) Engineering Mathematics by B. S. Grewal.

3) Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers.