ENGINEERING MATHEMATICS-IV

[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - III
IA Marks
15MAT41

20

Number of Lecture Hours/Week

04

Exam Marks

80

Total Number of Lecture Hours

50

Exam Hours

03

CREDITS - 04

Course objectives: This course will enable students to

Understand mathematics fundamentals necessary to formulate, solve and analyze engineering problems
Understand and apply Numerical methods to solve ordinary differential equations
Understand and use Finite difference method to solve partial differential equations
Perform Complex analysis
Understand and use of Sampling theory
Understand and apply Joint probability distribution and stochastic process
Module -1
Teaching RBT
Hours
Levels
Numerical Methods: Numerical solution of ordinary differential equations of first
order and first degree, Picards method, Taylors series method, modified Eulers
method, Runge - Kutta method of fourth order. Milnes and Adams-Bashforth predictor
and corrector methods (No derivations of formulae). Numerical solution of
simultaneous first order ordinary differential equations, Picards method, Runge-Kutta
method of fourth order
Module -2

10Hours

L1, L2,
L3, L4

Numerical Methods :Numerical solution of second order ordinary differential 10 Hours

equations, Picards method, Runge-Kutta method and Milnes method. Special
Functions: Bessels functions- basic properties, recurrence relations, orthogonality
and generating functions. Legendres functions - Legendres polynomial, Rodrigues
formula, problems.

L1, L2,
L3, L4

Module - 3
Complex Variables: Function of a complex variable, limits, continuity, 10 Hours
differentiability,. Analytic functions-Cauchy-Riemann equations in Cartesian and polar
forms. Properties and construction of analytic functions. Complex line integralsCauchys theorem and Cauchys integral formula, Residue, poles, Cauchys Residue
theorem with proof and problems. Transformations: Conformal transformations,
discussion of transformations:
and bilinear
transformations.
Module-4

L1, L2,
L3, L4

1|Page

Probability Distributions: Random variables(discrete and continuous), probability 10 Hours

functions. Poisson distributions , geometric distribution, uniform distribution,
Exponential and normal distributions, Problems. Joint probability distribution: Joint
Probability distribution for two variables, expectation, covariance, correlation
coefficient.

L1, L2,
L3, L4

Module-5
Sampling Theory: Sampling, Sampling distributions, standard error, test of 10 Hours
hypothesis for means and proportions, confidence limits for means, students tdistribution, Chi-square distribution as a test of goodness of fit. Stochastic process:
Stochastic process, probability vector, stochastic matrices, fixed points, regular
stochastic matrices, Markov chains, higher transition probability.

L1, L2,
L3, L4

Course outcomes:
After studying this course, the students will be able to

Use appropriate numerical methods to solve first and second order ordinary differential equations.
Use Bessel's and Legendre's function which often arises when a problem possesses axial and spherical
symmetry, such as in quantum mechanics, electromagnetic theory, hydrodynamics and heat conduction.
State and prove Cauchys theorem and its consequences including Cauchy's integral formula, compute
residues and apply the residue theorem to evaluate integrals.
Analyze, interpret, and evaluate scientific hypotheses and theories using rigorous statistical methods .

Graduate Attributes (as per NBA)

1. Engineering Knowledge
2. Problem Analysis
3. Life-Long Learning
Conduct Investigations of Complex Problems
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:

1. B.V.Ramana "Higher Engineering M athematics" Tata McGraw-Hill, 2006

2. B. S. Grewal," Higher Engineering Mathematics", Khanna publishers, 42nd edition, 2013
Reference Books:

1. N P Bali and Manish Goyal, "A text book of Engineering mathematics" , Laxmi publications, latest
edition.

2. Kreyszig, "Advanced Engineering Mathematics " - 9th edition, Wiley, 2013

3. H. K Dass and Er. RajnishVerma ,"Higher Engineering Mathematics", S. Chand, 1st ed, 2011

2|Page

SOFTWARE ENGINEERING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

SEMESTER - III
IA Marks
15CS42

Subject Code

20

Number of Lecture Hours/Week

04

Exam Marks

80

Total Number of Lecture Hours

50

Exam Hours

03

CREDITS - 04

Course objectives: This course will enable students to

Module -1

Understand software engineering principles in building large programs

Analyse ethical and professional issues and to explain why they are of concern to software
engineers
Understand the process of requirements gathering and their validation
Study the System models and design patterns
Discuss the distinctions between validation testing and defect testing
Understand software quality parameters
Teaching RBT
Hours
Levels

Introduction: Professional Software Development, Software Engineering Ethics. Case

Studies.Software Processes: Models. Process activities. Coping with Change. The
Rational Unified Process.

10Hours

L1, L2

Agile Software Development: Agile methods . Plan-driven and agile development. 10 Hours
Extreme programming. Agile project management. Scaling agile methods.
Requirements Engineering: Functional and non-functional requirements .The
software Requirements Document. Requirements Specification . Requirements
Engineering Processes. Requirements Elicitation and Analysis. Requirements
validation. Requirements Management.
Module - 3

L2, L3,
L4

System Models: Context models. Interaction models. Structural models. Behavioural 10 Hours
models. Model-driven engineering. Design and Implementation: Object-oriented
design using the UML. Design patterns. Implementation issues. Open source
development

L2, L3,
L4, L5

Module -2

Module-4
Software Testing: Development testing, Test-driven development, Release testing, 10 Hours
User testing. Software Evolution: Evolution processes .Program evolution dynamics.
Software maintenance. Legacy system management

L2, L3,
L4, L5

Module-5

3|Page

Project Planning: Software pricing. Plan-driven development. Project scheduling.

Agile planning. Estimation techniques. Quality management : Software quality.
Software standards. Reviews and inspections. Software measurement and metrics.

10
Hours

L2, L3,
L4, L5

Course outcomes:
After studying this course, the students will be able to
Design a system, component, or process to meet desired needs within realistic constraints.
Asses professional and ethical responsibility
function on multi-disciplinary teams
use the techniques, skills, and modern engineering tools necessary for engineering practice
Analyse, design, verify, validate, implement, apply, and maintain software systems.
Graduate Attributes (as per NBA)

1.
2.
3.
4.

Project Management and Finance

Conduct Investigations of Complex Problems
Modern Tool Usage
Ethics

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:

1. Ian Sommerville: Software Engineering, 9th Edition, Pearson Education, 2012.

(Listed topics only from Chapters 1,2,3,4, 5, 7, 8, 9, 23, and 24)
Reference Books:
1. Roger.S.Pressman: Software Engineering-A Practitioners approach, 7th Edition, Tata McGraw Hill
2. PankajJalote: An Integrated Approach to Software Engineering, Wiley India

4|Page

DESIGN AND ANALYSIS OF ALGORITHMS

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

SEMESTER - III
Subject Code

15CS43

IA Marks

20

Number of Lecture Hours/Week

04

Exam Marks

80

Total Number of Lecture Hours

50

Exam Hours

03

CREDITS - 04

Course objectives: This course will enable students to

Understand and analyse the asymptotic performance of algorithms.

Demonstrate the familiarity with major kinds of algorithms.
Understand and use of Divide and Conquer method, Greedy Method, Dynamic programming and
Backtracking methods in solving problems
Judge suitable algorithmic design paradigms for real life problems
Synthesize efficient algorithms in common engineering design situations
Module -1
Teaching RBT
Hours
Levels
Introduction: What is an Algorithm?, Algorithm Specification, Performance Analysis:
Space complexity, Time complexity. Asymptotic Notations: Big-Oh notation, Omega
notation, Theta notation and Little-oh notation, Important Problem Types:Sorting,
Searching, String processing, Graph Problems, Combinatorial Problems. Fundamental
Data Structures: Stacks, Queues, Graphs, Trees, Sets and Dictionaries.

10Hours

L1, L2,

Divide and Conquer: General method, Binary search, Recurrence equation for Divide 10 Hours
and Conquer, Finding the maximum and minimum, Quick sort, Merge sort, Strassens
matrix multiplication, Convex Hull, Closest-pair problem, Advantages and
Disadvantages of Divide and Conquer. Decrease and Conquer Approach: Topological
Sort

L2, L3,
L4, L5,
L6

Module -2

Module - 3
Greedy Method: General method, Coin Change Problem, Knapsack Problem, Job 10 Hours
sequencing with deadlines, Minimum cost spanning trees: Prims Algorithm, Kruskals
Algorithm. Single source shortest paths:Dijkstra's Algorithm. Optimal Tree problem:
Huffman Trees and Codes. Transform and Conquer Approach.

L2, L3,
L4, L5,
L6

Module-4
Dynamic Programming: General method, Multistage Graphs, All Pairs Shortest 10 Hours
Paths: Floyd's Algorithm, Optimal Binary Search Trees, 0/1-Knapsack problem,
Bellman-Ford Algorithm, Travelling Sales Person problem, Reliability design.

L2, L3,
L4, L5,
L6

Module-5

5|Page

Backtracking: General method, N-Queens problem, Sum of subsets problem, Graph

colouring, Hamiltonian cycles. Branch and Bound: General method, Travelling Sales
Person problem,0/1 knapsack problem: LC Branch and Bound solution, FIFO Branch
and Bound solution. NP-Hard and NP-Complete problems: Basic concepts, non
deterministic algorithms, NP - Hard and NP-Complete Classes.

10
Hours

L2, L3,
L4, L5,
L6

Course outcomes:

After studying this course, the students will be able to

Asses the correctness of algorithms using inductive proofs and loop invariants.
Analyse and Compare the asymptotic behaviors of functions obtained by elementary composition of
polynomials, exponentials, and logarithmic functions.

Describe the relative merits of worst-, average-, and best-case analysis.

Describe, apply and analyse the different algorithm design techniques: divide-and-conquer, dynamic
programming, greedy paradigm, graph algorithms and their analysis.

Judge the applicability of appropriate method for solving real world problems

Graduate Attributes (as per NBA)

1.
2.
3.
4.
5.

Engineering Knowledge
Problem Analysis
Design/Development of Solutions
Conduct Investigations of Complex Problems
Life-Long Learning

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:

1. Computer Algorithms/C++, Ellis Horowitz, SatrajSahni and Rajasekaran, 2nd edition, 2014, Universities
Press

2. Introduction to the Design and Analysis of Algorithms, AnanyLevitin:, 3rd Edition, 2012, Pearson
Reference Books:

1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 3rd
Edition, PHI

2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education)

6|Page

MICROPROCESSORS AND ARM PROCESSORS

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - IV
IA Marks
15CS44

20

Number of Lecture Hours/Week

04

Exam Marks

80

Total Number of Lecture Hours

50

Exam Hours

03

CREDITS - 04

Course Objectives: To make/enable students to

Familiar with importance and applications of Microprocessors, Microcontrollers, ARM
processors
Understand architecture of 8086 microprocessor and ARM processor
Understand instruction set of 8086 and ARM processor and write 8086 ALPs
Write hybrid (assembly & C) program for ARM processor
Interface peripheral devices like Keyboard, LCD, sensors and stepper motor with
ARMprocessor
Module -1
Teaching RBT
Hours
Levels
The x86 microprocessor: Brief history of the x86 family, Inside the 8088/86,
Introduction to assembly programming, Introduction to Program Segments, The
Stack, Flag register, x86 Addressing Modes. Assembly language
programming: Directives & a Sample Program, Assemble, Link & Run a
program, More Sample programs, Control Transfer Instructions, Data Types
and Data Definition, Full Segment Definition, Flowcharts and Pseudo code.
Text book 1: Ch 1: 1.1 to 1.7, Ch 2: 2.1 to 2.7
Module -2

10

L1,L2

Hours

x86: Instructions sets description, Arithmetic and logic instructions and 10 Hours
programs: Unsigned Addition and Subtraction, Unsigned Multiplication and
Division, Logic Instructions, BCD and ASCII conversion, Rotate Instructions.
INT 21H and INT 10H Programming : Bios INT 10H Programming , DOS
Interrupt 21H.8088/86 Interrupts, x86 PC and Interrupt Assignment.
Text book 1: Appendix B, Ch 3: 3.1 to 3.5, Ch 4: 4.1 , 4.2 Chapter 14:
14.1 and 14.2

L2, L3

Module - 3

7|Page

Signed Numbers and Strings: Signed number Arithmetic Operations, String 10 Hours
Operations. Memory and Memory interfacing: Memory address decoding,
data integrity in RAM and ROM, 16-bit memory interfacing.8255 I/O
programming: I/O address MAP of x86 PCs, programming and interfacing
the 8255.

L2,L3,
L4.L6

Module-4
Introduction to ARM: RISC and CISC Architectures, The ARM 10 Hours
Architecture: The Acorn RISC Machine, The ARM programmers model:
General purpose registers, CPSR, SPSR, ARM memory map, data format, load
and store architecture, ARM development tools. ARM Assembly language
Programming

L1, L2,
L3

Text book 2: Ch 1: 1.5 and 1.6, Ch 2:2.1,2.2,2.3,2.4, Ch 3: 3.1 to 3.5

Module-5
Cortex-M3 series block diagram, registers, instruction set, and addressing
modes,Embedded CProgramming for ARM7, C Programs for ARM
microprocessor in KEIL, Interfacing ARM7TDMI/ Cortex-M3 to LCD,
Keyboard, DAC, sensors and Stepper motor.
Ref book 4: Ch 1: 1.1,1.2,1.3,1.5

10
Hours

L1, L2,
L3,L6

Text book 3: Ch 5.

Course outcomes:
After studying this course, the students will be able to
Differentiate microprocessors and microcontrollers
Design and develop 8086 assembly language code to solve problems
Gain the knowledge to interface various devices to ARM processor
Design and developing interrupts routines for interfacing devices
Graduate Attributes (as per NBA)
1. Engineering Knowledge
2. Modern Tool Usage
3. Design/Development of Solutions
4. Conduct Investigations of Complex Problems
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.

8|Page

Text Books:

1. Muhammad Ali Mazidi, Janice GillispieMazidi, Danny Causey, The x86 PC Assembly
Language Design and Interfacing, 5th Edition, Pearson, 2013.
2. ARM System-on-Chip Architecture, Steve Furber, Second Edition, Pearson, 2015
3. ARM System Developers Guide, Designing and Optimizing Software, Andrew N.
Sloss,Dominic Symes, Chris W wight, Elsevier, 2014
Reference Books:
1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2009.
2. Douglas V. Hall: Microprocessors and Interfacing, Revised 2nd Edition, TMH, 2006.
3. K. Udaya Kumar & B.S. Umashankar : Advanced Microprocessors & IBM-PC Assembly
Language Programming, TMH 2003.
4. The Definitive Guide to the ARM Cortex-M3, by Joseph Yiu, 2nd Edition , Newnes, 2009

9|Page

OBJECT ORIENTED PROGRAMMING WITH C++

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - III
IA Marks
15CS45

20

Number of Lecture Hours/Week

04

Exam Marks

80

Total Number of Lecture Hours

50

Exam Hours

03

CREDITS - 04

Course objectives:This course will enable students to

Differentiate between object oriented programming and procedure oriented programming.

Define and Describe Classes, objects, constructors, destructors, inheritance, operator
overloading, andPolymorphism, Template and exception handling.
Develop the skills of designing and developing C++ programs using OOP features.
Disseminate the importance of Object oriented programming

Module -1

Teaching RBT
Hours
Levels

Overview of C++:The Origins of C++ ,What Is Object-Oriented Programming?

,Encapsulation ,Polymorphism , Inheritance. Some C++ Fundamentals ,A Sample C++
Program ,A Closer Look at the I/O Operators, Declaring Local Variables ,No Default
to int, The bool Data Type , Old-Style vs. Modern C++ , The New C++ Headers ,
Namespaces, Working with an Old Compiler, Introducing C++ Classes, Function
Overloading, Operator Overloading ,Inheritance Constructors and Destructors ,The
C++ Keywords, The General Form of a C++ Program. Classes and Objects: Classes,
Structures and Classes Are Related, Unions and Classes Are Related , Anonymous
Unions, Friend Functions, Friend Classes, Inline Functions, Defining Inline Functions
Within a Class Parameterized Constructors, Constructors with One Parameter: A
Special Case Static Class Members ,Static Data Members ,Static Member Functions
,When Constructors and Destructors Are Executed ,The Scope Resolution Operator,
Nested Classes, Local Classes, Passing Objects to Functions ,Returning Objects
,Object Assignment.

10Hours

L1,L2,
L4

Module -2

10 | P a g e

Arrays, Pointers, References, and the Dynamic Allocation Operators: Arrays of 10 Hours
Objects, Creating Initialized vs. Uninitialized Arrays , Pointers to Objects, Type
Checking C++ Pointers , The this Pointer, Pointers to Derived Types , Pointers to Class
Members , References, Reference Parameters, Passing References to Objects,
Returning References, Independent References, References to Derived Types,
Restrictions to References, A Matter of Style , C++'s Dynamic Allocation Operators
,Initializing Allocated Memory ,Allocating Arrays ,Allocating Objects ,The nothrow
Alternative ,The Placement Form of new.Function Overloading, Copy Constructors
and Default Arguments: Function Overloading, Overloading Constructors,
Overloading a Constructor to Gain Flexibility, Allowing Both Initialized and
Uninitialized Objects Copy Constructors , Finding the Address of an Overloaded
Function , The overload Anachronism, Default Function Arguments, Default
Arguments vs. Overloading, Function Overloading and Ambiguity.

L2,L3

Module - 3
Operator Overloading: Creating a Member Operator Function, Creating Prefix and 10 Hours
Postfix Forms, of the Increment and decrement Operators , Overloading the Shorthand
Operators, Operator Overloading Restrictions, Operator Overloading Using a Friend
Function,Using a Friend to Overload ++ or , Friend Operator Functions Add
Flexibility , Overloading new and delete, Overloading new and delete for Arrays,
Overloading the nothrow Version of new and delete, Overloading Some Special
Operators, Overloading [ ] , Overloading ( ), Overloading >, Overloading the Comma
Operator.Inheritances: Base-Class Access Control, Inheritance and protected
Members, Protected Base-Class Inheritance, Inheriting Multiple Base Classes,
Constructors, Destructors, and Inheritance, When Constructors and Destructors Are
Executed , Passing Parameters to Base-Class Constructors, Granting Access, Virtual
Base Classes.

L2,L3,
L4

Module-4
Virtual Functions and Polymorphism: Virtual Functions, Calling a Virtual Function 10 Hours
Through a Base, Class Reference, The Virtual Attribute Is Inherited, Virtual Functions
Are Hierarchical, Pure Virtual Functions, Abstract Classes, Using Virtual Functions,
Early vs. Late Binding. Templates: Generic Functions, A Function with Two Generic
Types, Explicitly Overloading a Generic Function, Overloading a Function Template,
Using Standard Parameters with Template Functions , Generic Function Restrictions ,
Applying Generic Functions, A Generic Sort, Compacting an Array, Generic Classes,
An Example with Two Generic Data Types, Applying Template Classes: A Generic
Array Class, Using Non-Type Arguments with Generic Classes, Using Default
Arguments with Template Classes, Explicit Class Specializations, The typename and
export Keywords, The Power of Templates .Exception Handling: Exception Handling
Fundamentals, Catching Class Types, Using Multiple catch Statements, Handling
Derived-Class Exceptions, Exception Handling Options, Catching All Exceptions,
Restricting Exceptions, Rethrowing an Exception, Understanding terminate( ) and
unexpected( ), Setting the Terminate and Unexpected Handlers, The
uncaught_exception( ) Function, The exception and bad_exception Classes Applying
Exception Handling.

L2,L3,
L6

Module-5

11 | P a g e

C++ I/O System Basics : Old vs. Modern C++ I/O, C++ Streams, The C++ Stream
Classes, C++'s Predefined Streams, Formatted I/O, Formatting Using the ios Members,
Setting the Format Flags, Clearing Format Flags,An Overloaded Form of setf( ),
Examining the Formatting Flags, Setting All Flags, Using width( ), precision( ), and
fill( ), Using Manipulators to Format I/O, Overloading << and >>, Creating Your Own
Inserters, Creating Your Own Extractors, Creating Your Own Manipulator Functions
C++ File I/O: fstream> and the File Classes, Opening and Closing a File, Reading and
Writing Text Files, Unformatted and Binary I/O, Characters vs. Bytes, put( ) and get( ),
read( ) and write( ), More get( ) Functions, getline( ) , Detecting EOF, The ignore( )
Function, peek( ) and putback( ), flush( ), Random Access, Obtaining the Current File
Position , I/O Status, Customized I/O and Files.

10
Hours

L2,L3
L5,L6

Course outcomes:
After studying this course, the students will be able to

Differentiate object oriented programming and procedural programming.

Understand and use the concepts of Object Oriented Paradigm
Design and develop C++ programs using OOPs features.
Apply the knowledge gained in the
a. Understanding of Java and other object oriented programming languages.
b. Design and Development of wide range of object oriented software packages.
Acquire competency in using OOPs in different platforms.
Understand the importance of life-long learning in the field of OOPs.

Graduate Attributes (as per NBA)

1.
2.
3.
4.

Engineering Knowledge
Design/Development of Solutions
Modern Tool Usage
Conduct Investigations of Complex Problems

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Book
1. Herbert Schildt: C++ The Complete Reference, 4th Edition, Tata McGraw Hill, 2014. (Listed
topics only from Chapters 11,12,13,14, 15, 16, 17, 18, 19, 20, and21)
Reference Books:

1. Stanley B.Lippmann, JoseeLajore: C++Primer, 4th Edition, Addison Wesley.

2. Joyce Farrell, Object-Oriented Programming Using C++, 4th edition, Cengage Learning.
3. K R Venugopal, RajkumarBuyya,TRavishanker:Mastering C++,Tata McGraw Hill.

12 | P a g e

INTRODUCTION TO CYBER SECURITY AND CYBER LAW

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - III
IA Marks
15CS461

20

Number of Lecture Hours/Week

03

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 03

Course objectives: This course will enable students to

Understand the area of cybercrime and forensics.

Understand the motive and causes for cybercrime, detection and handling.
Study the areas affected by cybercrime and investigation.
Understand the tools used in cyber forensic
Know Legal Perspectives in cyber security

Module -1

Teaching RBT
Hours
Levels

Introduction to Cybercrime: Cybercrime: Definition and Origins of the Word, 08 Hours

Cybercrime and Information Security, Who are Cybercriminals?, Classifications of
Cybercrimes, Cybercrime: The Legal Perspectives, Cybercrimes: An Indian
Perspective, Cybercrime and the Indian ITA 2000, A Global Perspective on
Cybercrimes, Cybercrime Era: Survival Mantra for the Netizens. Cyber offenses: How
Criminals Plan Them: How Criminals Plan the Attacks, Social Engineering,
Cyberstalking, Cybercafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack
Vector, Cloud Computing.

L1, L2

Module -2
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile 08 Hours
and Wireless Devices, Trends in Mobility, Credit Card Frauds in Mobile and Wireless
Computing Era, Security Challenges Posed by Mobile Devices, Registry Settings for
Mobile Devices, Authentication Service Security,Attacks on Mobile/Cell
Phones,Mobile Devices: Security Implications for organizations, Organizational
Measures for Handling Mobile,Organizational Security Policies and Measures in
Mobile Computing Era, Laptops

L1, L2

Module 3
Tools and Methods Used in Cybercrime: Introduction, Proxy Servers and 08 Hours
Anonymizers, Phishing, Password Cracking, Keyloggers and Spywares, Virus and
Worms, Trojan Horses and Backdoors, Steganography, DoS and DDoS Attacks, SQL
Injection,
Buffer
Overflow,
Attacks
on
Wireless
Networks
Phishing and Identity Theft: Introduction, Phishing, Identity Theft (ID Theft)

L1, L2

0Module-4

13 | P a g e

Understanding Computer Forensics: Introduction, Historical Background of Cyber 08 Hours

forensics, Digital Forensics Science, The Need for Computer Forensics, Cyber
forensics and Digital Evidence, Forensics Analysis of E-Mail, Digital Forensics Life
Cycle, Chain of Custody Concept, Network Forensics, Approaching a Computer
Forensics Investigation, Setting up a Computer Forensics Laboratory: Understanding
the Requirements, Computer Forensics and Steganography, Relevance of the OSI 7
Layer Model to Computer Forensics, Forensics and Social Networking Sites: The
Security/Privacy Threats, Computer Forensics from Compliance Perspective,
Challenges in Computer Forensics, Special Tools and Techniques, Forensics Auditing,
Antiforensics.

L1, L2

Module-5
Introduction to Security Policies and Cyber Laws: Need for An Information
Security Policy, Information Security Standards ISO, Introducing Various Security
Policies and Their Review Process, Introduction to Indian Cyber Law, Objective and
Scope of the it Act, 2000, Intellectual Property Issues, Overview of Intellectual Property - Related Legislation in India, Patent, Copyright, Law Related to
Semiconductor Layout and Design, Software License.

08Hours

L1, L2

Course outcomes:

After studying this course, the students will be able to

Acquire knowledge on the cybersecurity cybercrime and forensics.

Explain cybercrime on various mobile and wireless devices
Interpret computer forensics
Understand legal issues in cybercrime.
Use of Tools and methods in cybercrime and security.

Graduate Attributes (as per NBA)

1. Modern Tool Usage

2. The Engineer and Society
3. Ethics
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. SunitBelapure and Nina Godbole, Cyber Security: Understanding Cyber Crimes, Computer Forensics
And Legal Perspectives, Wiley India Pvt Ltd, ISBN: 8126521791, Publish Date 2011
2. Dr. Surya PrakashTripathi, RitendraGoyal, Praveen Kumar Shukla, KLSI. Introduction to information
security and cyber laws. Dreamtech Press. ISBN 13: 9789351194736
Reference Books:

14 | P a g e

1. Thomas J. Mowbray, Cybersecurity: Managing Systems, Conducting Testing, and Investigating

Intrusions, Copyright 2014 by John Wiley & Sons, Inc, ISBN: 978 -1-118 -84965 -1
2. James Graham, Ryan Olson, Rick Howard, Cyber Security Essentials, CRC Press, 15-Dec-2010

15 | P a g e

GRAPH THEORY AND ITS APPLICATIONS

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - III
IA Marks
15CS462

20

Number of Lecture Hours/Week

03

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 03

Course objectives: This course will enable students to

Understand and apply graphs as a powerful modelling tool that can be used to solve practical problems
in various fields.
Illustrate the main concepts of graph theory, graph representations and the basic classes of graphs.
Identify induced sub graphs, cliques, matchings, covers in graphs
Solve famous graph associated problems.

Use of Optimization and matching algorithms

Module -1

Introduction to Graph Theory: Definitions and Examples, Subgraphs, Complements,

and Graph Isomorphism, Vertex Degree, Euler Trails and Circuits

Teaching RBT
Hours
Levels
08Hours

L1, L2

08 Hours

L2, L3

08 Hours

L1,L2,
L3

08 Hours

L2,L3,
L4

08 Hours

L2,L3,
L4

Module -2
Introduction to Graph Theory contd.: Planar Graphs, Hamilton Paths and Cycles,
Graph Colouring, and Chromatic Polynomials
Module - 3
Trees: Definitions, Properties, and Examples, Routed Trees, Trees and Sorting,
Weighted Trees and Prefix Codes
Module-4
Optimization and Matching: Dijkstras Shortest Path Algorithm, Minimal Spanning
Trees The algorithms of Kruskal and Prim, Transport Networks Max-flow, Mincut Theorem, Matching Theory.
Module-5
Graph Algorithms: Computer representation of Graphs, Basic algorithms: Spanning
Tree, Set of Fundamental circuits, cut-vertices and separability, planarity testing
Course outcomes:

After studying this course, the students will be able to

Solve problems using basic graph theory

Identify induced sub graphs, cliques, matching, covers in graphs

16 | P a g e

Determine whether graphs are Hamiltonian and/or Eulerian

Solve problems involving vertex and edge connectivity, planarity and crossing numbers
Solve problems involving vertex and edge coloring
Model real world problems using graph theory
Graduate Attributes (as per NBA)

1. Design/Development of Solutions
2. Modern Tool Usage
3. Problem Analysis
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1.Graph theory with Applications to Engineering and computer Science, NarasinghDeo, Prentice Hall
Reference Books:

1. D.S. Chandrasekharaiah: Graph Theory and Combinatorics, Prism.

2. Chartrand Zhang: Introduction to Graph Theory, TMH
3. GeirAgnarsson& Raymond Geenlaw: Graph Theory Modeling, Applications, and Algorithms, Pearson
Education.

17 | P a g e

PYTHON PROGRAMMING
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

Subject Code

SEMESTER - III
IA Marks
15CS463

20

Number of Lecture Hours/Week

03

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 03

Course objectives: This course will enable students to

Learn Various Paradigms of Python Programming.

Use GUI Programming using Tkinter Python's de-facto standard.
Handle Files, Lists and Dictionaries in Python.
Explain How to combine data structures and functions available in Python to solve Problems.
Assess Python as a Programming Language
Module -1
Teaching RBT
Hours
Levels
Introduction to Computers, Programs, and Python Elementary Programming, History
of Python, Basic Features of Python ,Mathematical Functions, Strings, and Objects

08Hours

L1,L2

08Hours

L3,L5,
L6

08Hours

L2,
L3,L5,
L6

Lists, Multidimensional Lists, Object Oriented Programming, Inheritance and

Polymorphism, Programming examples
Module-5

08Hours

L2,L5,
L6

Files and Exception Handling, Tuples, Sets, and Dictionaries, Recursion, programming
examples
Course outcomes:

08Hours

L2,L5,
L6

Module -2
Creating Python Programs, Selections, Loops, Functions. Programming examples
Module - 3
Functional programming, Objects and Classes, More on Strings and Special Methods,
GUI Programming Using Tkinter, Programming examples
Module-4

After studying this course, the students will be able to:

Explain Python syntax and semantics

Understand the concepts of Object-Oriented programming as used in Python.
Demonstrate the fluency in using Python flow control and functions.
Write Programs using Lists, Dictionaries and handle Files.
Design and develop GUI Programming using Tkinter

18 | P a g e

 Build Data Structures using Python

Graduate Attributes (as per NBA)

4. Design/Development of Solutions
5. Modern Tool Usage
6. Problem Analysis
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Y. Daniel Liang, Introduction to Programming Using Python, Pearson, ISBN:978-0-13-274718-9, 2013

2.Exploring Python, Timothy A. Budd, Indian edition, McGraw Hill education, ISBN-13: 978-0-07132122-8
Reference Books:

1. Kenneth A. Lambert , B.L Juneja , Fundamentals of Python Programming, Cengage Learning,ISBN:97881-315-2903-4, 2015
2. Charles Dierbach. Introduction to Computer Science Using Python: A Computational Problem-Solving
Focus, Wiley,ISBN:978-81-265-5601-4,2015
3. Allen B.Downey,Think Python,OReilly,First Edition,2012,ISBN:978-93-5023-863-9

19 | P a g e

PARALLEL PROGRAMMING with OpenMP

Subject Code

[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2015 -2016)
SEMESTER - III
IA Marks
15CS464

20

Number of Lecture Hours/Week

03

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 03

Course objectives: This course will enable students to

Understand Parallel Hardware and Parallel Software.
Develop message-passing parallel programs using MPI
Design and Develop shared-memory parallel programs using Pthreads
Design and Develop shared-memory parallel programs using OpenMP.
Module -1
Motivation and History: Introduction, Modern Scientific Method, Evolution of
Supercomputing, Modern parallel Computers, Seeking Concurrency, Data Clustering,
Programming Parallel Computers. Parallel Architectures: Interconnection Networks,
Processor Arrays, Multiprocessors, Multicomputers, Flynns Taxonomy.

Teaching RBT
Hours
Levels
08Hours

L1,L2

08 Hours

L2,L3,
L6

08 Hours

L2,L3,
L6

08 Hours

L2,L3,
L6

08 Hours

L2,L3,
L6

Module -2
Parallel Hardware and Parallel Software: Some Background, Modifications to the von
Neumann Model, Parallel Hardware, Parallel Software, Input and Output, Performance,
Parallel Program Design, Writing and running Parallel Programs, Assumptions.

Module - 3
Distributed-Memory Programming with MPI: Getting Started, The Trapezoidal Rule in
MPI, Dealing with I/O, Collective Communication, MPI Derived Data types, Performance
Evaluation of MPI Programs, A Parallel Sorting Algorithm.

Module-4
Shared-Memory Programming with Pthreads: Processes, Threads, and Pthreads, Hello,
World, Matrix-Vector Multiplication, Critical Sections, Busy-Waiting, Mutexes, ProducerConsumer Synchronization and semaphores, barriers and Condition Variables, Read-Write
Locks, Caches, cache Coherence and False Sharing ,Thread Safety.

Module-5
Shared-Memory Programming with OpenMP: Getting Started, The Trapezoidal Rule,
Scpe of Variables, The Reduction Clause, More About Loops in OpenMp: Sorting,
Scheduling Loops, Producers and Consumers, Caches, Cache Coherence, and False
Sharing, Thread-Safety.

20 | P a g e

Course outcomes:

After studying this course, the students will be able to

Explain fundamental concepts of parallel architecture and software

Explain and use models of parallel programming.
Design and Develop message-passing parallel programs using MPI framework.
Design and Develop shared-memory parallel programs using Pthreads.
Design and Develop shared-memory parallel programs using OpenMP.

Graduate Attributes (as per NBA)

1.
2.
3.
4.
5.

Engineering Knowledge
Problem Analysis
Modern Tool Usage
Conduct Investigations of Complex Problems
Design/Development of Solutions

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. M. J. Quinn, Parallel programming in C with MPI and OpenMP, Tata McGraw Hill,2003.
2. Peter S. Pacheco, An introduction to parallel programming, Morgan Kaufmann,2011.

Reference Books:
1. B. Chapman, G. Jost, and Ruud van der Pas, Using OpenMP, MIT Press

21 | P a g e

DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY WITH C++

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

SEMESTER - IV
Laboratory Code

15CSL47

IA Marks

20

Number of Lecture Hours/Week

01I + 02p

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 02

Course objectives: This course will enable students to

Understand and analyze the asymptotic performance of algorithms.

Give practical exposure to students on various algorithms.

Demonstrate working nature of algorithms.

Design and implement various algorithms studied in the theory class and to know the
performance
Descriptions (if any)
Design, develop and implement the specified algorithms for the following problems using
C++ Language under LINUX /Windows environment.
Experiment Lists:
1.

RBT Levels: L3, L4, L5, L6

A. Create a structure called employee with the following details as variables within it.
1. Name of the employee
2. Age
3. Designation
4. Salary
Write a C++ program to create array of objects for the structure to access these and print the
name, age, designation and salary with suitable headings.

B. Write a C++ program to create three objects for a class named print_object with data members
such as roll_no&name. Create a member function set_data() for setting the data values and print()
member function to print which object has invoked it using this pointer

2.

A. Write a C++ program to define a Class called STRING containing two strings and overload
operator= = for comparing, operator+ for Concatenating, new and delete for allocating and
deallocating memory for STRING objects.
B. Write a C++ program to create an object of type class CIRCLE. Illustrate the constructor, the copy

22 | P a g e

constructor, and destructor functions associated with a CIRCLE object.

Continued...
3.

A. Write a C++ program to demonstrate virtual function (polymorphism) by creating a base

classpolygon which has virtual function area(). Derive two classes rectangle and triangle from
polygon and implement area() to calculate and return the area of rectangle and
triangle respectively.
B. Write a C++ program to explain class template by creating a template T for a class named pair
having two data members of type T which are read through a constructor and a member function
get-max() return the greatest of two numbers to main. Note: the value of T depends upon the data
type specified during object creation
4.

Sort a given set of N integer elements using Quick Sort method and Compute its time complexity.
Run the program for varied values of N = 10, 20, 30, 40,50,60,,100, and record the time taken to
sort. Plot a graph of the time taken versus N on graph sheet. The elements can be read from a file or
can be generated using the random number generator. Demonstrate using C++ how the divide-andconquer method works along with its time complexity analysis: worst, average, and best case.

5.

Sort a given set of N integer elements using Merge Sort method and Compute its time complexity.
Run the program for varied values of N = 10, 20, 30, 40,50,60,,100, and record the time taken to
sort. Plot a graph of the time taken versus N on graph sheet. The elements can be read from a file or
can be generated using the random number generator. Demonstrate using C++ how the divide-andconquer method works along with its time complexity analysis: worst, average, and best case.

6.

Implement in C++ the 0/1 Knapsack problem using i) Dynamic Programming ii) Greedy methods.

7.

From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra's algorithm. Write the program in C++ .

8.

Find Minimum Cost Spanning Tree of a given undirected graph using i) Kruskal's
algorithm ii) Prim's algorithm. Implement the program in C++ language.

9.

a) Design & Implement in C++ to Find a subset of a given set S = {Sl, S2,.....,Sn} of n
positive integers whose SUM is equal to a
given positive integer D. For example, if S =
{1, 2, 5, 6, 8} and D = 9, there are two solutions {1,2,6}and {1,8}. Display a suitable
message, if the given problem instance doesn't have a solution.

b) Design & Implement the presence of Hamiltonian Cycle in an undirected Graph G of N

Course outcomes:

After studying this course, the students will be able to

Analyze and Compare the asymptotic behaviours of functions obtained by elementary

composition of polynomials, exponentials, and logarithmic functions.

Design and develop code for different algorithm design techniques: divide-and-conquer,
dynamic programming, greedy paradigm, graph algorithms etc

23 | P a g e

Graduate Attributes (as per NBA)

1.
2.
3.
4.
5.

Engineering Knowledge
Problem Analysis
Modern Tool Usage
Conduct Investigations of Complex Problems
Design/Development of Solutions

Conduction of Practical Examination:

1 . All laboratory experiments ( TWELVE nos ) are to be included for practical

2.
3.
4.
5.

examination.
Studentsare allowed to pick one experimentfrom the lot.
Strictlyfollow theinstructions as printed on the cover page of answer script for
breakup of marks
Marks distribution: Procedure + Conduction + Viva: 20 + 50 + 10 (80)
Change of experiment is allowed only once and marks allotted to the procedure
part to be made zero.

24 | P a g e

MICROPROCESSORS and ARM LABORATORY

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)

SEMESTER - III
Laboratory Code

15CSL48

IA Marks

20

Number of Lecture Hours/Week

01I + 02P

Exam Marks

80

Total Number of Lecture Hours

40

Exam Hours

03

CREDITS - 02

Course objectives: This course will enable students to

Write and Execute 8086 ALPs using MASM/TASM

Design and Develop programs for interfacing LED displays, Keyboards,
DAC/ADC, and various other devices using 8086/ARM processor

Descriptions (if any)

Demonstration and Explanation hardware components and Faculty in-charge should explain
8086 architecture, pin diagram in one slot. The second slot, the Faculty in-charge should
explain instruction set types/category etc. Students have to prepare a write-up on the same
and include it in the Lab record and to be evaluated.

Laboratory Session-1: Write-upon Microprocessors, 8086 Functional block diagram, Pin

diagram and description. The same information is also taught in theory class; this helps
the students to understand better.
Laboratory Session-2: Write-uponInstruction group, Timing diagrams, etc. The same
information is also taught in theory class; this helps the students to understand better.
Note: TheseTWO Laboratory sessions are used to fill the gap between theory classes
andpractical sessions. Both sessions are evaluated as lab experiments for 20 marks.

25 | P a g e

Experiment List:

RBT Levels: L3, L4, L5, L6

Develop and execute the following programs using 8086 Assembly Language.
Any suitable assembler like MASM/TASM/any equivalent software may be
used.
Program should have suitable comments.
The board layout and the circuit diagram of the interface are to be provided to
the student during the examination.
Software Required: Open source ARM Mbed Development platform
KEIL IDE and Proteus for simulation
SOFTWARE(ALP) PROGRAMS: PART A

1. Design and develop an assembly language program to search a key element X in

a list of n 16-bit numbers. Adopt Binary search algorithm in your program for
searching.
2. Design and develop an assembly program to sort a given set of n 16-bit numbers
in ascending order. Adopt Bubble Sort algorithm to sort given elements.
3. Develop an assembly language program to reverse a given string and verify
whether it is a palindrome or not. Display the appropriate message.
4. Develop an assembly language program to compute nCrusing recursive
procedure. Assume that n and r are non-negative integers.
5. Design and develop an assembly language program to read the current time and
Date from the system and display it in the standard format on the screen.
6. To write and simulate ARM assembly language programs for data transfer,
arithmetic and logical operations.
7. To write and simulate C Programs for ARM microprocessor in KEIL

PART B

26 | P a g e

8. a. Design and develop an assembly program to demonstrate BCD Up-Down

Counter on the Logic Controller Interface.
b. Design and develop an assembly program to read the status of two 8-bit inputs
(X & Y) from the Logic Controller Interface and display X*Y.
9. Design and develop an assembly program to display messages FIRE and
HELP alternately with flickering effects on a 7-segment display interface for a
suitable period of time. Ensure a flashing rate that makes it easy to read both the
messages (Examiner does not specify these delay values nor is it necessary for the
student to compute these values).
10. Design and develop an assembly program to drive a Stepper Motor interface and
rotate the motor in specified direction (clockwise or counter-clockwise) by N
steps (Direction and N are specified by the examiner). Introduce suitable delay
between successive steps. (Any arbitrary value for the delay may be assumed by
the student).
11. Design and develop an assembly language program to
a. Generate the Sine Wave using DAC interface (The output of the DAC is to be
displayed on the CRO).
b. Generate a Half Rectified Sine waveform using the DAC interface. (The output
of the DAC is tobe displayed on the CRO).
12. To interface LCD with ARM microprocessor. Write and execute programs in C
language for displaying text messages and numbers on LCD
13. To interface Stepper motor with ARM microprocessor. Write a program to
rotate motor in half step and full step mode

Study Experiments:

Interfacing of temperature sensor with ARM freedom board (or any other
ARM microprocessor board) and display temperature on LCD

To design ARM cortex based automatic number plate recognition system

To design ARM based power saving system

Course outcomes:
After studying this course, the students will be able to
1. Explain 80x86/ARM instruction sets
2. Design and implement programs written in 80x86/ARM
27 | P a g e

3. Interface hardware devices to x86/ARM family

4. Assess processors for various kinds of applications.

Graduate Attributes (as per NBA)

1.
2.
3.
4.
5.

Engineering Knowledge
Problem Analysis
Modern Tool Usage
Conduct Investigations of Complex Problems
Design/Development of Solutions

Conduction of Practical Examination:

1 . All laboratory experiments (all 7 + 7nos ) are to be included for practical
examination.
2 . Studentsare allowed to pick one experimentfrom each of the lot.
3 . Strictlyfollow theinstructions as printed on the cover page of answer script for
breakup of marks
4 . PART A: Procedure + Conduction + Viva: 10 + 25 +05 (40)
5 . PART B: Procedure + Conduction + Viva: 10 + 25 +05 (40)
6. Change of experiment is allowed only once and marks allotted to the
procedure part to be made zero.

28 | P a g e