Tri 1 2 3 4 5 6 7 8

NIRMA UNIVERSITY
Integrated B. Tech. (CSE)-MBA programme

Term - I
L T P C
3 1 0 4
Course Code CSI0101

Course Title Linear Algebra
Course Outcomes:
At the end of the course, students will able to-
1. acquire basic knowledge of matrix theory
2. comprehend basic concept of vector space and linear transformation
3. apply the knowledge of linear algebra in engineering problems
Syllabus: Teaching
hours: 30
Unit I 14
Matrix Theory: Review of algebra of matrices, Rank of matrix, Inverse of matrix

by Gauss-Jordan method, Solution of system of algebraic simultaneous equations,
Linearly dependent and Linearly independent functions, eigen values and eigen
vectors, Cayley-Hamilton Theorem (without proof), Eigen values and eigen vectors
of orthogonal, symmetric, skew-symmetric matrices, Hermitian matrix, skew-
Hermitian matrix, Unitary matrix, Normal matrix, Algebraic and geometric
multiplicity, Diagonalization.
Unit II 16
Vector Space and Linear Transformation: Vector space, subspaces, linear

combination, Wronskian, Basis of a vector space, Dimension, Rank-Nullity theorem
(statement and verification by examples), Definition of linear transformation, types
of linear transformations (Rotation, Reflection, Expansion, Contraction, Projection),
Matrix of linear transformations, Change of a basis.
Tutorials:
This shall consist 8 tutorials based on the syllabus.
Self-Study:
Self-study contents will be declared at the commencement of the semester. Around
10% of the questions will be asked from the self-study contents.
w.e.f A.Y 2020-21

Suggested Readings^:
1. D C Lay, Linear Algebra and its Application; Pearson Publication.
2. E Kreyszig, Advanced Engineering Mathematics; John Wiley Publication.
3. H Anton, Elementary linear algebra with applications; John Wiley Publication.
4. K Hoffman and R Kunze, Linear Algebra; PHI Publication.
5. S Kumaresan, Linear algebra - A Geometric approach; PHI Publication.
6. J P Sharma and M Yeolekar, Engineering mathematics Vol-II; PHI Publication.
L=Lecture, T=Tutorial, P=Practical, C=Credit

^this is not an exhaustive list
w.e.f A.Y 2020-21

NIRMA UNIVERSITY
Term - I
L T P C
2 0 2 3
Course Code CSI0102
Course Title English I
Course Outcomes:
At the end of the course, students will be able to-
1. develop their vocabulary
2. determine the use of correct spellings
3. assess, review and recompose different pieces of writing
4. construct grammatically correct English
Syllabus: Teaching
hours: 20
Unit I 07
Grammar: Overview of English Grammar, Tenses and Verb Structure, Articles,
Prepositions, Voices (Passive and Active), Direct and Indirect Speech, Punctuations
and Capitalization, Typical Mistakes by Non-English Speaking Individuals
Unit II 07
Vocabulary and Orthography: Confusable Words, One Word Substitute,
Synonyms & Antonyms, Homophones, Idioms & Phrases, Plurals, Prefix & Suffix
Unit III 06
Comprehension and Usage: Unseen Passages, Precise & Summarizing, Expansion
of Ideas
Laboratory Work:
The Term work and Exercises will be based on the topics covered in the syllabus. Minimum 8
exercise should carried out.
Self-Study:
Self-study contents will be declared at the commencement of the semester. Around 10% of
the questions will be asked from the self-study contents.
w.e.f A.Y 2020-21

1. Bear, D., Invernizzi, M., Templeton, S. & Johnson, F. Words Their Way: Word Study
for Phonics, Vocabulary, And Spelling. New Jersey: Merrill/Prentice-Hall.
2. Beck, I.L., Mckeown, M.G. &Kucan, L. Bringing Words to Life: Robust Vocabulary
Instruction. New York: Guilford Press.
3. Brieger, N., Pohl, A. Technical English, Vocabulary and Grammar.
4. Eastwood, J. Oxford Guide to English Grammar. Oxford University Press.
5. Ibbotson, M. Cambridge English for Engineering. Cambridge: Cambridge University
Press.
6. McCarthy, M. & O’Dell, F. Academic Vocabulary in Use. Cambridge: Cambridge
University Press.
7. Mohan, K & Raman, M. Effective English Communication. New Delhi: Tata Mcgraw
Hill.
8. Nick, K. &Laque-Mortimer, L. Practice Tests. Harlow: Pearson Longman.
9. Osborne, C. Practice Tests. London: HeinleCengage Learning.
10. Seely, J. The Oxford Guide to Effective Writing & Speaking. Oxford University
Press.
11. Sethi, J. &Dhamija, P. V. A Course in Phonetics and Spoken English. New Delhi:
Prentice Hall of India Pvt. Ltd.
12. Swan, M. Practical English Usage. Oxford: Oxford University Press.
13. Wren P. C. & Martin, M. High School English Grammar & Composition. Delhi:
Sultan Chand.
w.e.f A.Y 2020-21

NIRMA UNIVERSITY
Term - I
L T P C
2 1 2 4
Course Code CSI0103
Course Title Physics
Course Outcomes:
At the end of the course, students will be able to -
1. Acquire the knowledge of fundamental principles of physics and relate to the
engineering science,
2. Apply the concepts of Physics for solving Engineering problems,
3. Relate principles of Physics for solving new and challenging problems of technology.
Syllabus: Teaching
hours: 20
Unit I 10
Elementary Quantum Physics: Introduction to Quantum Physics: Particle in a
three dimensional box,
Physics of Nanomaterials: Introduction – Nanoscale; Nanomaterials: Methods for
synthesis of nanomaterials, Properties of nanomaterials – Electrical, Magnetic,
Optical, Mechanical, Characterization techniques – X ray Diffraction (XRD) -
Single Crystal, Powder and Laue techniques, Low energy Electron Diffraction
(LEED), Scanning Electron Microscopy, Tunnelling Electron Microscopy,
Nanostructures; Carbon nanotubes Characteristics and applications,
Nanotechnology and environment.
Unit II 6
Lasers and Holography: Introduction, Basics of Interaction of radiation with
matter, Condition for light Amplification, Population inversion and metastable state,
pumping, the principle pumping scheme: Three and Four level scheme,
Construction and working of optical resonator, Optical amplifier, Applications of
laser beam, Holography.
Unit III 4
Introduction to Fiber Optics: Introduction of fiber-optic system, Principle and
construction of fiber cable, Acceptance angle and numerical aperture, Types of
Optical fiber: Based on material & based on mode of propagation, Index profile,
Fiber optic communication link, Fiber optic sensor, Advantages of fiber optic
system.
w.e.f A.Y 2020-21

Self- Study:
1. M N Avadhnulu and P. Kshirsagar, A Text Book of Engineering Physics, S Chand.
2. T. Pradeep, Nano: The Essentials, New Central book Agency.
3. B. L. Theraja, Physics for Engineers, S Chand Publication

Experiments:
1. To estimate the solar energy in terms of solar power and V-I characteristics, Power
load characteristics of the solar cell.
2. To evaluate the charge to mass ratio for electron by applying perpendicular magnetic
field on the electron beam in CRT.
3. To measure the resistivity of semiconductor by four point probe method at different
temperature.
4. Determination of forbidden energy band gap in a semiconductor using a junction
diode.
5. To measure electrical resistivity by Hall Effect for semiconductor chip.
6. To measure the wavelength of light from sodium vapor lamp and find the thickness of
thin film using Newton’s rings method.
7. Curie Temperature measurement of ferromagnetic materials.
w.e.f A.Y 2020-21

NIRMA UNIVERSITY
Term - I
L T P C
2 1 2 4
Course Code CSI0104
Course Title Fundamentals of Programming
Course Outcomes:
After successful completion of the course, a student will be able to –
1. explain the fundamental programming concepts and methodologies essential to build
programs
2. analyze given problem and apply appropriate operator/control construct for
programming the same
3. apply array structure and manipulate strings in programming
Syllabus Teaching
hours:20
Unit I
Introduction to Computers and Programming: Introduction to Computers, its 3
Applications and Characteristics, Hardware and Software, Computer
Organization, Algorithms and Flowcharts, Programming Languages, Program
Development Environment.
Unit II
Basic structure of C program: Character set, Tokens, Identifiers in C, Variables 5
and Data Types, Constants, Console I/O Operations.
Operators and Expressions: Expressions and Arithmetic Operators, Relational
and Logical Operators, Conditional operator, size of operator, Assignment
operators and Bitwise Operators.
Unit III
Decision Making and Control Statements: If Statement, Switch Statement, 6
Unconditional Branching using go to statement, While Loop, Do While Loop, For
Loop, Break and Continue statements.
Unit IV
Arrays: Defining Arrays, Sorting and Searching Arrays, Multidimensional 6
Arrays, Variable-Length Arrays.
Characters and Strings: Fundamentals of Characters and Strings, Character-
Handling Library Functions, Standard Input/Output Library Functions for strings,
String-Manipulation Functions.
w.e.f A.Y 2020-21

Self-Study:
The self-study contents will be declared at the commencement of semester. Around 10% of
the questions will be asked from self-study contents.
Laboratory Work:
Laboratory work will be based on above syllabus with minimum 8 experiments to be
incorporated.
Tutorial Work:
The tutorial work will be based on the topics covered in the syllabus. Minimum 8 tutorials
should be carried out.
1. Deitel and Deitel, ‘C How to program’, Pearson.
2. E Balagurusamy, ‘Programming in ANSI C’, McGraw Hill.
3. YashwantKanitkar, ‘Let Us C’, BPB Publications.
4. Kernighan., Ritchie, ‘ANSI C Language’, Prentice Hall of India.
5. V Rajaraman, ‘Fundamentals of Computers’, Prentice Hall of India.

w.e.f A.Y 2020-21

NIRMA UNIVERSITY
Term - I
L T P C
2 0 2 3
Course Code CSI0105
Course Title Elements of Electrical Engineering
Course Outcomes:
At the end of the course, students will be able to –
1. interpret the electrical energy terms and relate its usage in various applications
2. illustrate the role of circuit elements in different system conditions
3. distinguish the operational aspects of ac-dc systems
Syllabus Teaching
hours:20
Unit I 8
Review of DC Circuits: Kirchhoff’s laws, solution of star-delta circuits, charging
and discharging of capacitor, series-parallel magnetic circuits, fringing effect,
comparison between electric and magnetic circuit, concept of induced emfs,
series-parallel connection of inductors, rise and decay of current in inductive
circuit.
Unit II 7
Single-phase AC Circuits
Generation of alternating emf, instantaneous, rms, peak, average values and
related other terms, vector representation of AC quantities, Steady state analysis
of R, L, C series circuits, power triangle, resonance in series circuits.
Unit III 5
Three-phase AC Circuits: Generation of three-phase emf, star connection, delta
connection, relationship between line and phase quantities, power measurement
in three-phase circuit, variation in wattmeter reading with power factor.
Self-Study:
The self-study contents will be decided at the commencement of semester. Around 10% of the
questions will be asked from self-study contents.
Laboratory Work:
This shall consist of at least 8 experiments based on the above syllabus.
w.e.f A.Y 2020-21

1. B.L.Theraja, A.K. Theraja, Textbook of Electrical Technology Volume I, S. Chand &
Co.
2. U. A. Patel, Textbook of Elements of Electrical Engineering, Mahajan Publishing
House, Ahmedabad.
3. J. Nagrath, Basic Electrical Engineering, TMH Publishing Co. Ltd.
4. Vincent Del Toro, Textbook of Principles of Electrical Engg. Prentice Hall of India
Pvt. Ltd., New Delhi.

w.e.f A.Y 2020-21

NIRMA UNIVERSITY
Term - II
L T P C
3 1 0 4
Course Code CSI0201

Course Title Calculus
Course Outcomes:
1. apply differential and integral calculus to solve engineering problems
2. apply convergence of infinite series in engineering filed
3. deal with functions of several variables that are essential in engineering
Syllabus: Teaching
hours: 30
Unit I 16
Integral Calculus: Evaluation of definite and improper integrals, Beta and Gamma
functions and their properties, Applications of definite integrals to evaluate surface
areas and volumes of revolutions, Multiple Integration: double and triple integrals
(Cartesian and polar), change of order of integration in double integrals, Change of
variables (Cartesian to polar), Applications: areas and volumes by (double
integration) Center of mass and Gravity (constant and variable densities).
Unit II 7
Differential Calculus: Limit, continuity and partial derivatives, total derivative and
chain rule, Euler’s theorem, Taylor’s series in two variables, Tangent plane and
normal line, Maxima, minima and saddle points Method of Lagrange multipliers.
Unit III 7
Infinite Series: Convergence of series, tests for convergence, power series, Taylor's
and Maclaurin’s series. Series for exponential, trigonometric and logarithmic
functions.
Tutorials:
This shall consist 10 tutorials based on the syllabus.
Self-Study:
Self-study contents will be declared at the commencement of the semester. Around
10% of the questions will be asked from the self-study contents.
w.e.f. A.Y. 2020-21

1. G B Thomas and R L Finney, Calculus and Analytic geometry; Pearson.
2. T Veerarajan, Engineering Mathematics; McGraw-Hill.
3. B V Ramana, Higher Engineering Mathematics; McGraw-Hill.
4. N P Bali and M Goyal, A text book of Engineering Mathematics; Laxmi
Publications.
5. B S Grewal, Higher Engineering Mathematics; Khanna Publishers.
6. E Kreyszig, Advanced Engineering Mathematics; John Wiley & Sons.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - II
L T P C
2 0 4 4
Course Code CSI0202

Course Title Engineering Graphics
Course Outcomes:
1. interpret the fundamental principles of engineering graphics and related drawing
standards,
2. construct profiles of various engineering curves,
3. apply the principles of orthographic and isometric projection for various solid
geometries,
4. construct engineering drawing using computer aided drafting tools.
Syllabus: Teaching
hours: 20
Unit I 1
Introduction to Engineering Drawing: Importance and applications of
engineering drawing for various branches of engineering, drawing instruments, BIS
Code of Practice, Lines, Lettering and Dimensioning, Scales, basic geometrical
construction, Sheet Layout.
Unit II 4
Engineering Curves: Construction of Conics by different methods, construction
of cycloid, epicycloids and hypocycloid, construction of involutes, constructions of
archimedean spiral and helix.
Unit III 7
Solid Geometry: Principle of Orthographic Projections, projections of points,
projections of straight lines, projections of planes.
Unit IV 4
Orthographic Projections and Isometric Projections: Conversion of pictorial
views into orthographic projections including sectional orthographic projection.
Conversion of orthographic views into isometric projections / views.
w.e.f. A.Y. 2020-21

Unit V 4
Computer Aided Drafting: Understanding of GUI (Graphical User Interface) of
drafting software, demonstration of use of available Drawing Commands,
Modifying / Editing commands, Annotation and Dimensioning Commands,
Concepts of Layers, demonstration of various line styles and construction of
drawings in soft form using drafting software.
Self-Study:
Laboratory Work:
Laboratory work will be based on the above syllabus with minimum 8 experiments.
1. Bhatt, N. D., Engineering Drawing, Charotar publication.
2. John, K. C. Engineering Graphics, PHI Publication.
3. Luzzader, W. J. and Duff, J. M. Fundamentals of Engineering Drawing, PHI
publication.
4. Bethune, J. D. Engineering Graphics with AutoCAD ®, PHI Publication.
5. 5. IS SP 46: 2003. Engineering Drawing Practices for Schools and Colleges.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term – II
L T P C
2 0 2 3
Course Code CSI0203
Course Title English II
Course Outcomes:
1. appraise written business communication and evaluate its relevance
2. create, examine, and structure project reports, business proposals, recommendations,
and evaluation reports etc. employing effective strategies of persuasion
3. construct effective and persuasive written communication for diverse business and
audiences
4. practice business communication for effectively
Syllabus: Teaching
hours: 20
Unit I 4
Introduction and Paragraph Writing: Introduction to business writing,
Structuring a paragraph, Construction of a paragraph and types of content,
Techniques of paragraph writing.
Unit II 3
Essay Writing: Introduction and types of essays, Characteristic features of an
essay, Components of an essay, Essay writing and editing, Guiding principles.
Unit III 4
Business Letters and Email Writing: Business letters- structure and layout,
Business letters- elements of style, Types of business letters, Email writing basics,
Email writing etiquette.
Unit IV 2
Business Report Writing: Features of a business report, Types of business report
Preparing a business report, Styles of reports.
Unit V 1
Proposal Writing: Purpose of proposal writing, Types of proposals, Structure of
w.e.f. A.Y. 2020-21

proposals, Developing a proposal
Unit VI 2
Creative Writing: Types of creative writing, Writing for advertising, Writing
reviews.
Unit VII 2
Cover Letter and Resume Writing: Application and cover letters, Types of
resumes, Features of a resume, Preparing a resume.
Unit VIII 2
Other Types of Business Writing: Inter-office memos, Circulars, Notice, agenda
and minutes.
Laboratory Work:
The Term work and exercises will be based on the topics covered in the syllabus. Minimum 8
exercises should carried out.
Self-Study:
1. Kaul, A. Business Communication. New Delhi: Prentice Hall of India Private
Limited.
2. Lesikar, R. V. and Flately, M. E. Basic Business Communication: Skills for
Empowering the Internet Generation. New Delhi: Tata McGraw Hill.
3. Mehra, P. Business Communication for Managers. Pearson.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - II
L T P C
2 0 2 3
Course Code CSI0204
Course Title Basic Electronics
Course Outcomes:
1. recognize the functions of electronic devices and basic circuits
2. design circuits based on operational amplifier
3. apply the concepts of number system conversion and Boolean algebra for
digital logic design
Syllabus: Teaching
hours: 20
Unit I 6
Analog Electronics: Physics of semiconductors, half and full wave rectifiers,
special purpose diodes, clipping and clamping circuits, BJT and its biasing circuits,
FET and its biasing circuits, applications such as amplifiers and oscillators,
overview of opto-electronics devices.
Unit II 7
Operational Amplifier and its Applications: Operational amplifier, comparator,
timer IC and multi-vibrators.
Unit III 7
Digital Electronics: Overview of number systems and its arithmetic, binary codes,
Boolean-algebra & simplification of Boolean expression; logic gates, concept of
universal logic; implementation of Boolean expressions using logic gates,
application of digital circuits (e.g. adder, subtractor, multiplexer, de-multiplexer,
etc.)
Self-Study:
The self-study contents will be decided at the commencement of semester. Around
10% of the questions will be asked from self-study contents.
w.e.f. A.Y. 2020-21

Laboratory Work:
This shall consist of at least 8 experiments based on the above syllabus.
1. V. K. Mehta, Rohit Mehta, Principles of Electronics, S. Chand and Co. Ltd.
2. R. Boylestad and L. Nashelsky, Textbook of Electronics Devices & Circuit Theory,
PHI Publication.
3. R. Gayakwad, Textbook of Operational Amplifiers and Linear Integrated Circuits,
PHI Publication.
4. Sergio Franko, Textbook of Designing with Operational Amplifiers and Analog
Integrated Circuits, McGraw Hill.
5. R. Coughlin and Driscoll, Textbook of OpAmp & Linear Integrated Circuits, PHI
Publications.
6. Anandkumar, Fundamentals of Digital Circuits, PHI publication.
7. Malvino A.P., Digital Computer Electronics, TMH publication.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - II
L T P C
2 0 2 3
Course Code CSI0205
Course Title Structured Programming
Course Outcomes:
After successful completion of the course, a student will be able to –
1. explain the importance of modular programming
2. apply pointers and structures to solve programming problems
3. create files and apply memory management techniques in programming
language
Syllabus: Teaching
hours: 20
Unit I 5
Introduction to Structural programming: Understanding Structural
Programming and its Importance.
Functions: Introduction to modular programming, User defined functions, formal
parameters, actual parameters Passing Arguments by Value and By Reference,
Scope Rules, Recursion, Recursion vs. Iteration, Math Library Functions, Passing
Arrays to Functions.
Unit II 5
Pointers: Pointer Variable Definitions and Initialization, Pointer Operators,
Passing Arguments to Functions by Reference, Pointer Expressions and Pointer
Arithmetic, Relationship between Pointers and Arrays, Arrays of Pointers, Pointers
to Functions.
Unit III 5
Structure and Union: Structure Definition, Declaring Variables of Structure,
Initializing Structures, Accessing Structure Members, Using Structures with
Functions and Pointers, Union.
w.e.f. A.Y. 2020-21

Unit IV 5
File Handling and memory management: Files and Streams, Creating a File,
Reading and writing Data from a File and to a File,File handling functions,
dynamic memory allocation using malloc, calloc and realloc.
Self-Study:
Laboratory Work:
incorporated.
1. Deitel and Deitel, ‘C How to program’, Pearson.
2. E Balagurusamy, ‘Programming in ANSI C’, McGraw Hill.
3. Yashwant Kanitkar, ‘Let Us C’, BPB Publications.
4. Kernighan., Ritchie, ‘ANSI C Language’, Prentice Hall of India.
5. V Rajaraman, ‘Fundamentals of Computers’, Prentice Hall of India.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - III
L T P C
2 0 4 4
Course Code CSI0301
Course Title Object Oriented Programming
Course Outcomes:
1. explain difference between structured programming and object oriented
programming with basic principles of these two
2. use basic constructs of object oriented programming language for
programming
3. apply inheritance, polymorphism and encapsulation properties to develop
object oriented program
Syllabus: Teaching
Hours:20
Unit I 2
Introduction: A Review of programming paradigms, Introduction to Object
Oriented Programming, Comparison of Object Oriented approach with other
programming approaches.
History and overview of Java: Creation of Java, , Evolution of Java,features of
Java, byte code, Java Development Kit (JDK), Java Virtual Machine (JVM)
,Introduction to three OOP principles (Inheritance, Polymorphism, Encapsulation),
Introduction to Classes and Methods.
Unit II 6
Data types, variables, Operators in Java
Control Statements: Selection statements (i.e. if, switch etc.), iteration
statements (i.e. while, do-while, the for-each version of the for Loop,
Nested Loops etc.) , jump statements (i.e. break, continue).
Arrays: one dimensional array, multi-dimensional array, alternative array
declaration statements.
Unit III 12
Classes and Methods: class fundamentals, declaring objects, assigning object
reference variables, adding methods to a class, returning a value, constructors, this
keyword, overloading methods, argument passing, object as parameter, returning
objects, access control, static, final, command line arguments, variable-length
arguments.
Inheritances: Basics, member access and inheritance, super class references,
w.e.f. A.Y. 2020-21

using super, multilevel hierarchy, constructor call sequence, method overriding,
dynamic method dispatch, abstract classes
Packages and Interfaces: defining and creating package, access protection,
importing packages, basics of interfaces, variables in interfaces, extending
interfaces
Self-Study:
Laboratory Work:
incorporated that will be considered for evaluation.
1. Herbert Schildt, Java – The Complete Reference, Tata McGraw Hill.
2. Balaguruswamy, Programming with Java – A primer, Tata McGraw Hill.
3. Student Workbook Java in a Nutshell- David Flanagan.
4. Core Java(TM), Volume I—Fundamentals- Cay S. Horstmann.
5. Teach Yourself Java in 21 Days - Sams.net Publishing and its licensor- Laura Lemay,
Charles L. Perkins.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - III
L T P C
3 1 0 4
Course Code CSI0302

Course Title Differential Equations
Course Outcomes:
1. apply techniques of differential equations in modeling to solve engineering problems
2. recognize and use the appropriate method to solve second order ordinary differential
equations
3. use power series to solve differential equations related to engineering filed
4. classify partial differential equations and apply appropriate analytic method to solve it
Syllabus: Teaching
Hours:30
Unit I 12
Ordinary Differential Equations: Introduction, Formation of ordinary
differential equation, First order and first degree differential equations, Linear
differential equations of higher order with constant coefficients, Complementary
function, Particular integral, Method of undetermined coefficients, Method of
variation of parameters, Higher order linear differential equations with variable
coefficients (Cauchy’s and Legendre’s forms), Simultaneous linear differential
equations and related applications,
Unit II 10
Series Solution of Ordinary Differential Equations: Power series solutions near
an ordinary point, Legendre polynomials, Regular singular points, Power series
solutions near a Regular singular point, Bessel functions of the first kind and
their properties
Unit III 8
Partial Differential Equations: First order partial differential equations and its
formation, solutions of first order linear and non-linear partial differential
equations, Method of separation variables and solution of heat equation.
Tutorials:
This shall consist tutorials based on the syllabus.
w.e.f. A.Y. 2020-21

Self-Study:
1. W E Boyce and R C DiPrima, Elementary Differential Equations and Boundary Value
Problems; Wiley India.
2. E Kreyszig, Advanced Engineering Mathematics; John Wiley & Sons.
3. T Veerarajan, Engineering Mathematics; McGraw Hill.
4. B V Ramana, Higher Engineering Mathematics; McGraw Hill.
5. N P Bali and M Goyal, A text book of Engineering Mathematics; Laxmi Publications.
6. B S Grewal, Higher Engineering Mathematics; Khanna Publishers.
7. S L Ross, Differential Equations; Wiley India.
8. E A Coddington, An Introduction to Ordinary Differential Equations; Prentice Hall
India.
9. E L Ince, Ordinary Differential Equations; Dover Publications.
10. G F Simmons and S G Krantz, Differential Equations; McGraw Hill.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - III
L T P C
3 0 2 4
Course Code CSI0303

Course Title Digital Electronics
Course Outcomes:
At the end of the course, students will be able to -
1. describe the basic building blocks of various digital circuits
2. design combinational logic and sequential logic circuits using basic components
3. identify digital components in computer organization
4. analyze digital circuits and its applications
Syllabus: Teaching
hours:30
Unit I 4
Overview of Binary Systems and Logic Gates: Introduction, Binary numbers,
conversions, Octal, Hexadecimal Numbers, Complements, Binary Codes, binary
storage, registers, Binary Logic
Boolean Algebra and Logic Gates, Boolean algebra, theorems and properties,
Boolean functions simplification, canonical and standard forms, other logic
operations, Digital logic gates, IC logic families.
Unit II 5
Boolean Function Simplification: The K-Map method, SOP/POS Simplification
with don’t care conditions using basic and universal gates, Tabulation method
Unit III 6
Combinational Logic: Introduction, analysis and design of various combinational
circuits such as Adders, Subtractors, Code Convertors, Comparators, Binary
Parallel Adder, Decimal Adder, magnitude comparators, ROMS, decoders,
multiplexers, PLA.
Unit IV 10
Sequential Logic: Introduction, flip-flops, triggering of flip-flop, analysis and
design of clocked sequential circuits, design with state equations, registers, shift
registers, ripple counters, synchronous counters.
Unit V 5
Digital Integrated Circuits: Introduction, BJT characteristics, RTL and DTL
logic. IIL and TTL Logic. ECL and MOS Logic CMOS Logic, ADC, DAC
w.e.f. A.Y. 2020-21

Self-Study:
Laboratory Work:
incorporated that will be considered for evaluation. Laboratory work will be based on Digital
Trainer kits and simulators.
1. M. Morris Mano, Digital Logic and Computer Design, PHI
2. Malvino and Leach, Digital Principals and applications, McGraw-Hill
3. Virendra Kumar, Digital Technology Principals and Practices, New Age International
4. Holdsworth, Digital logic design, Elsevier Science

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - III
L T P C
3 1 0 4
Course Code CSI0304

Course Title Discrete Mathematics
Course Outcomes:
At the end of the course, students will be able to
1. interpret the preliminaries of discrete mathematics
2. comprehend role of discrete mathematics in theoretical computer science
3. recognize the importance of formal approach for solving computing problems
Syllabus: Teaching
Hours:30
Unit I 3
Sets, Relation and Function: Operations and laws of sets, Cartesian products,
binary relation, partial ordering relation, equivalence relation, image of a set, sum
and product of functions, bijective functions, inverse and composite function. Basic
counting techniques: inclusion and exclusion, pigeon-hole principle.
Unit II 6
Proof Techniques: proof methods and strategies, forward proof, proof by
contradiction, principles of mathematical induction, strong induction, the well-
ordering principle, recursive definition, proof by contraposition, proof of necessity
and sufficiency.
Unit III 6
Propositional Logic: syntax, semantics, validity and satisfiability, basic
connectives and truth tables. logical equivalence: the laws of logic, logical
implication, rules of inference, the use of quantifiers.
Unit IV 5
Algebraic Structures and Morphism: algebraic structures with one binary
operation, semi groups, monoids, groups, congruence relation and quotient
structures, free and cyclic monoids and groups, permutation groups.
Unit V 6
Graphs and Trees: graphs and their properties, isomorphism, Eulerian and
Hamiltonian walks, graph coloring, perfect graph, rooted trees, trees and sorting,
weighted trees and prefix codes, shortest path, spanning trees.
Unit VI 4
Recurrence Relations and Recursive Algorithms: Recurrence relations, linear
recurrence relations with constant coefficients, use of recurrence relations for
analysis of algorithms.
w.e.f. A.Y. 2020-21

Self-Study:
Tutorial Work:
Tutorial work will be based on the above syllabus with minimum 10 tutorials to be
incorporated.
1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill.
2. Tremblay, J.P. & Manohar, Discrete mathematical structures with application to
computer science, McGraw Hill.
3. Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw Hill.
4. Susanna S. Epp, Discrete Mathematics with Applications, Wadsworth Publishing Co.
Inc.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Term - III
L T P C
1 1 0 2
Course Code CSI0305
Course Title Environmental Studies
Course Outcomes:
1. outline the multidisciplinary nature of environment and sustainability
2. explain types of environmental pollution and its control measures
3. appraise need of e-waste management
Syllabus: Teaching
Hours: 10
Unit I 03
Environment and Sustainability: Environment: Components, Multidisciplinary
nature, Impact Assessment; Concept of sustainability, Carbon credit.
Unit II 04
Environmental Pollution: Types of environmental pollution and pollutants;
Causes, effects and control measures of air pollution, water pollution and noise
pollution.
Unit III 03
E-Waste Management: E-waste: types and sources, Recycling of E-Waste, E-
Waste Management Rules of India, Case Studies.
Self-Study:
The self-study contents will be declared at the commencement of semester.
Tutorial Work:
Tutorial work will be based on above syllabus with minimum 03 Assignments to be
incorporated.
1. Dara, S. S., & Mishra, D. D. A textbook of Environmental Chemistry and Pollution
Control. S. Chand & Company Ltd.
2. Bharucha, E., Textbook of Environmental Studies, Universities Press.
3. Dhameja, S. Environmental Studies. S. Kataria and Sons.
4. Ristinen, R., & Kraushaar, J. Energy and the Environment, Wiley Publications.
w.e.f. A.Y. 2020-21

5. Rakesh Johri, E-Waste: Implementation, Regulation & Management in India &
Current global best practices, TERI Press.
6. Electronic Waste Management Rules, Ministry of Environment, Forest and Climate
Change, Government of India, New Delhi.

w.e.f. A.Y. 2020-21

NIRMA UNIVERSITY
Institute: Institute of Technology

Name of Programme: Integrated B.Tech.(CSE)-MBA
Course Code: CSI0401
Course Title: Data Structures and Algorithms
Course Type: Core
Year of Introduction: 2021-22
Credit Scheme
L T Practical Component C
LPW PW W S
3 1 0 - - - 4
Course Learning Outcomes (CLO):

1. define static and dynamic data structures and related operations
2. demonstrate advantages and disadvantages of specific algorithms and data structures
3. select basic algorithms for sorting and searching based on application
4. identify the appropriate data structure to design efficient algorithm for the given application
Syllabus: Total Teaching hours: 30

Unit Syllabus Teaching
hours
Unit-I Introduction to Data Structures: Basic Terminology, Elementary Data 05
Structure Organization, Classification of Data Structures: Primitive and Non-
primitive, Linear and Non-linear, Operations on Data structures, Asymptotic
notations, Notion of recursive algorithms.
Unit-II Linear Data Structures: Introduction, variations, operations and 05
applications of array, queue, stack and linked list
Unit-III Non-Linear Data Structures: Concepts and types of trees, tree traversal 08
algorithms, search trees, Priority queue implementation and applications,
Representations of Graphs, Graph algorithms i.e., traversals, minimum
spanning tree, shortest path, Traveling Salesman Problems
Unit-IV Indexing structure: Concepts and implementations of B-Tree, B+ tree 06
Unit-V Searching and Sorting Algorithms: Linear search, Binary search, internal 06
and external sorting algorithms, sorting without comparison.
Self-Study: The self-study contents will be declared at the commencement of semester.

Around 10% of the questions will be asked from self-study contents
Suggested 1. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data

Readings/ Structures with Applications, Tata McGraw Hill
References: 2. Tanenbaum, Data Structures using C & C++, PHI
3. Robert L. Kruse, Data Structures and Program Design in C, PHI
4. Mary E.S. Loomis, Data Management and file processing, PHI
Suggested List of -NA-
Experiments:
Suggested Case -NA-
List:
NIRMA UNIVERSITY
Course Title: Probability and Statistics
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. relate the concepts of probability and statistics and their need in engineering and
management
2. explain different probability distributions
3. apply concepts and methods in probability and statistics for modeling problems in
engineering and management domain
4. analyze the correctness of proposed hypothesis

hours
Unit-I The Role of Statistics in Engineering: The Engineering Method and 02
Statistical Thinking, Collecting Engineering Data, Probability and
Probability Models
Unit-II Probability and Probability Distributions: Independence, Bayes 07
Theorem, Discrete & Continuous Random Variables, Probability Mass and
Density Functions, Cumulative Distribution Functions, Mean and Variance
of a Random Variable, Discrete & Continuous Distributions, Joint
Probability Distributions
Unit-III Descriptive Statistics and Point Estimation of Parameters: Numerical 04
Summaries of Data, Frequency Distributions and Histograms, Point
Estimation
Unit-IV Statistical Intervals for a Single Sample: Confidence Interval on the 07
mean of a Normal Distribution, Confidence Interval on the Variance and
Standard Deviation of a Normal Distribution, Large-Sample Confidence
Interval for a Population Proportion, Guidelines for Constructing
Confidence Intervals, Tolerance and Prediction Intervals
Unit-V Hypothesis Testing: Statistical Hypothesis, P-Values in Hypothesis Test, 06
Tests on the Mean of a Normal Distribution, Tests on the Variance and
Standard Deviation of a Normal Distribution, Tests on a Population
Proportion, Testing for Goodness of Fit
Unit-VI Simple & Multiple Linear Regression: Properties of the Least Squares 04
Estimators, Hypothesis Tests in Simple & Multiple Linear Regression,
Confidence Intervals, Prediction of New Observations, Correlation
Suggested Readings/ 1. C.M. Douglas and G.C. Runger, Applied Statistics and Probability for
References: Engineers, Wiley
2. J. Susan Milton and Jesse Arnold, Introduction to Probability and Statistics:
Principles and Applications for Engineering and the Computing Sciences, ,
McGraw Hill Education
3. Timothy C. Urdan, Statistics in Plain English, Routledge
4. Bertsekas, Dimitri and J. Tsitsiklis, Introduction to Probability, Athena
Scientific
5. Alvin Drake, Fundamentals of Applied Probability Theory, McGraw-Hill
6. Sheldon Ross, A First Course in Probability, Prentice Hall
Suggested List of Sr. No. Title Hours

Experiments: 1 Basics of Python, Numpy and Matplotlib 04
2 Bayes’ Theorem 02
3 Descriptive Statistics and Visualization 02
4 Application of Gaussian Distribution 02
5 Application of Binomial Distribution 02
6 Application of Multivariate Bernoulli and Multinomial 04
Distributions
7 Simple and Multiple Linear Regression with model 04
statistics
Suggested Case List: -NA-

NIRMA UNIVERSITY
Course Title: Object Oriented Application Development
Course Type: Core
Credit Scheme
LPW PW W S
2 0 4 - - - 4

1. summarize the core concepts of object-oriented approach for application development
2. implement multi-threaded applications with basic input-output operations and exception
handling
3. apply the concepts of java technologies to design interactive applications
4. develop applications using JDBC connectivity to access data from database and execute
different queries to get required result

hours
Unit-I Exception Handling: Exception types, uncaught exceptions, try, catch, 05
throw, throws, finally, multiple catch clauses, nested try statements, built-in
exceptions, custom exceptions
Multithreaded Programming: Java thread model, Thread class, Runnable
interfaces, Creating a thread(s), Thread class methods
Managing I/O: Streams, Byte Streams and Character Streams, Predefined
Streams, reading console Input, Writing Console Output
Unit-II Event Handling: various event handling mechanisms, Delegation Event 07
Model, Events, Event Sources, Event Listeners, various classes related to
event sources and event listeners
AWT: window fundamentals, creating frames, working with graphics,
working with colors, working with fonts, Adding removing various controls,
Layout managers, menu bars and menus
Unit-III Introduction to Swing: MVC Architecture, Swing AWT and JFC, Writing 06
Swing Application, Swing Components, Changing Look and Feel of
Application, Enhancing Application Using Clipboard, Drag and Drop, I/O
Stream Enhancement, Printing, Internationalization
Unit-IV Java Database Programming: Java SQL Package Study, JDBC, Different 02
Types of Drivers of JDBC, creating connection using JDBC, DML and DDL
queries for application development
Suggested Readings/ 1. Herbert Schildt, Herbert Schildt, Java – The Complete Reference, Tata
References: McGraw Hill
2. Herbert Schildt and Dale Skrien, Java Programming: A Comprehensive
Introduction, Tata McGraw Hill
3. Java 8 Programming Black Book, Wiley
4. Balaguruswamy, Programming with Java – A primer, Tata McGraw Hill
5. John Zukowski, Java AWT reference, O'Reilly Media, Inc.
Suggested List of Sr. Title Hours

Experiments: No.
1 To create console-based applications applying the 02
concepts of exception handling and multithreaded
programming.
2 To create console-based applications applying the 04
concepts of file management.
3 To create a GUI program that implements concepts of 04
event handling such as keyboard press, mouse click etc.
4 To create a menu-based GUI program using AWT class 04
along with frames and various AWT controls that uses
concepts of file management.
5 To create a basic swing program and learn concepts frame 04
and event handling.
6 To exemplify Swing concepts layout designing through 06
stop watch.
7 To implement Swing programs that demonstrateJList 04
and JTree controls.
8 To create a Swing application of your choice that 06
includes following necessary functionalities:
● Home Frame with Menu
● Various Dialogs
● Use JTable control for display operation
● Database operations: add, edit, delete and
display.
9 To create a database table using Java, perform insert, 04
delete, update, delete and select operation.
10 Java program to write and execute the SQL query. 02

NIRMA UNIVERSITY
Course Title: Principles of Management
Course Type: Core
Credit Scheme
LPW PW W S
3 0 0 - - - 3

1. explain different function of management.
2. introduce the various theories and processes of management
3. relate with different functional areas of management
4. explain Contemporary issues in management

hours
Unit-I Nature of Management:Concept, Significance, Role &Skills, Levels of 08
Management, Introduction of POSDCORB (Planning, Organizing, Staffing,
Directing, Coordinating, Reporting and Budgeting). Evolution of
Management thoughts, Scientific Management, Human Relation
Contingency Approach. Overview of Indian thoughts on Management,
Management by Objectives (MBO)
Unit-II Planning:Meaning, Importance, Process. Decision making and its important. 04
Unit-III Organizing:Concepts, Structure, Advantages and Limitations of organizing. 08

Depart mentation: Meaning, Basis and Significance, Span of Control:
Meaning, Factors affecting span of Control, Centralization vs.
Decentralization. Delegation: Authority & Responsibility relationship.
Unit-IV Directing, Co-ordination and Controlling: Leading: Concept of 06
leadership, directing: Meaning and Process, Co-ordination as an Essence of
Management, controlling: Meaning, Process and Technique. Introduction to
Motivation, Basic Theories of Motivation
Unit-V Contemporary issues in management:Concept of TQM, Balance 04
Score card, HRIS.

Around 10% of the questions will be asked from self-study contents.
Suggested Readings/
References:
1. Koontz &Weihrich , Essentials of Management; Tata McGraw Hill
2. Tripathy&Reddy, Principles of Management; Tata McGraw Hill
3. Kreitner&Mohapatra, Management; Biztantra
4. Robbins, Decenzo& Coulter, Fundamentals of Management; Pearson
Education
5. Stoner, Freeman &Daniel R Gilbert, Management; Pearson Education
6. Robbins & Coulter, Management; Prentice Hall (India) Pvt. Ltd

Experiments:

NIRMA UNIVERSITY
Course Title: Open Source Laboratory
Course Type: Core
Credit Scheme
LPW PW W S
0 0 2 - - - 1

1. demonstrate basics of various open-source Content Management Systems
2. make use of database connectivity to perform various database operations using Perl
3. design solutions to solve real-world problems using open-source packages
Syllabus:
Laboratory work will be based on following topics and minimum 7 experiments will be
conducted.
Content Management System (CMS): Installation and configuration of open source CMS for
various administrative tasks; use CMS for various tasks such as website Design, online
magazine, publication, Learning Management System, Blog, etc.
Perl: Introduction, Understanding Scalar values, Basic Operators and control flow, List and
array variables, regular expression, subroutines, Hash, connecting with MySQL database
OpenCV: Installation of openCV, Load, Display and Save an image, image conversion, Capture
Video from Webcam, Basic drawing functions, filtering
Version Control: Introduction, need of version control, initialization of repository, viewing of

history, undo and redo changes, clone repository, push and pull changes
Self-Study: -NA-
Suggested Readings/ 1. Andreas Mauthe, Peter Thomas, Professional Content Management

References: Systems: Handling Digital Media Assets, Wiley
2. Tom Christiansen, brian d foy, Larry Wall, Jon Orwant, Programming
Perl, O'Reilly Media
3. Gary Bradski, Adrian Kaehler, Learning OpenCV, O'Reilly Media
4. Jon Loeliger and Matthew J. McCullough, Version Control with Git:
Powerful Tool and Techniques for Collaborative Software Development,
O'Reilly Media

Experiments: No.
1 To install and configure open-source CMS for various 02
administrative tasks.
2 To use CMS for various tasks such as website design, 04
online magazine, publication, Learning Management
System, Blog etc.
3 To write a Perl program to demonstrateScalar values, Basic 02
Operators and control flow, List and array variables.
4 To write a Perl program to demonstrateregular expression, 04
subroutines, Hash and Connection with MySQL database.
5 To install openCV, and demonstrate Load, Display, Save 02
and image conversion.
6 To perform Video capturing from Webcam, Basic drawing 02
functions and filtering using openCV.
7 To demonstrate need of version control, initialization of 02
repository and viewing history.
8 To perform Undo and redo changes, clone repository, push 02
and pull changes.

NIRMA UNIVERSITY
Course Title: Programming with Data Structures
Course Type: Core
Credit Scheme
LPW PW W S
0 0 4 - - - 2
1. demonstrate implementations of various operations of linear data structure
2. illustrate applications of various data structures practically
3. implement non-linear data structures like trees and graphs using primitive data types
Syllabus:
Laboratory work will be based on following concepts with minimum 10 experiments.
Various operations on array, operations on stack such as push, pop, and peep. Operations on
queue such as insert, delete. Operations on linked list such as traversal, searching,
updating.Operations on graphs and trees.
Self-Study: -NA-
Suggested Readings/ 1. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data

References: Structures with Applications, Tata McGraw Hill
2. Tanenbaum, Data Structures using C & C++, PHI
3. Robert L. Kruse, Data Structures and Program Design in C, PHI
4. Mary E.S. Loomis, Data Management and file processing, PHI
Suggested List of Sr. Title Hrs.
Experiments: 1 To realize array operations on a suitable application 04
2 To reverse a given string using Stack 02
To convert fully parenthesized infix expression to postfix
expression.
3 To simulate printer spooler application 02
To implement priority queue using an array.
4 To realize linked list operations on suitable applications 04
5 To simulate music playlist application using appropriate data 06
structure
6 To implement Quick sort for sorting a given set of integers in 04
ascending order.
7 To implement Binary search operation on a given set of 04
integers.
8 To construct a binary tree from a given preorder and post 04
order traversal sequence
9 To implement phone book dictionary using Binary Search 06
Tree
10 To obtain a spanning tree of a connected undirected graph 04
using appropriate data structure

NIRMA UN
NIRMA UNIVERSITY
Course Title: Computer Architecture
Course Type: Core
Credit Scheme
LPW PW W S
3 1 0 - - - 4

1. illustrate the basics of various architectural units of the Computer System
2. apply the knowledge of combinational and sequential logical circuits to mimic a simple
computer architecture
3. demonstrate the simulations for basic computer operations
4. appraise the importance of parallelism in computer architecture

hours
Unit-I Introduction to Computer Architecture Register transfer and Micro 08
operations: Register transfer language -Register transfer, Bus and
memory transfer, Arithmetic micro-operations, Logic Micro operations,
Shift micro-operations and Arithmetic logic shift unit.
Instruction codes: Computer registers, Computer instructions, Timing
and control, Instruction cycle, Memory reference instructions, Input-
Output and interrupt, complete computer description.
Unit-II Micro programmed Control: Control Memory, Address sequencing, 08
Microprogram example, Design of Control unit
Central Processing Unit: Introduction, General register organization,
Stack organization, Instruction formats, Addressing modes, Data transfer
and manipulation, Program control, Reduced instruction set computer
(RISC). Complex Instruction Set Computer (CISC), Comparison of RISC
and CISC Parallel Processing, Pipelining, Arithmetic pipelining,
Instruction pipelining, RISC pipeline, vector processing, Array processors
Unit-III Computer Arithmetic: Binary Arithmetic’s, Add, Subtract, Multiply 05
Divide, Algorithms, and Implementations Carry Look Ahead and Fast
Adders.
Unit-IV Input Output Organization: Input output interface, Asynchronous data 05
transfer, Modes of transfer, Priority interrupt, Direct Memory access
(DMA), Input output processor (IOP), CPU-IOP communication, Serial
communication.
Unit-V Memory Organization: Memory hierarchy, Main memory, Auxiliary 04
memory, Flash memory, Associative memory, Cache memory, Virtual
memory.

Suggested Readings/ 1. M. Morris Mano, Computer System Architecture, Prentice Hall of India
References: 2. Williams Stallings, Computer Organization and Architecture Prentice
Hall of India
3. Douglas V Hall Microprocessors and Interfacing Programming and
Hardware, Tata McGraw Hill
4. V. Carl Hamacher, Zvonko G. Vranesic and Safwat G. Zaky, Computer
Organization, Mcgraw Hills Publisher
5. M. Radhakrishnan, D. Balasubramanian, Computer Installation and
Troubleshooting, ISTE Learning Materials
Experiments:

NIRMA UNIVERSITY
Course Title: Digital Communications
Course Type: Core
Credit Scheme
LPW PW W S
2 0 2 - - - 3

1. explain data/signal transmission over communication medium
2. apply concepts of data communication to solve various problem
3. analyze various spread spectrum, multiplexing, and modulation techniques
4. choose appropriate guided or unguided modes of transmission based on specific needs

hours
Unit-I 03
Introduction to Data Communication: components of network, its types
and topology, protocol. Network models: OSI reference model, TCP/IP
protocol suite, Applications of data communications Data Communications
and Networking for Today's Enterprise
Unit-II 03
Data and Signal: types of Analog and digital signals and its characteristics,
transmission of digital signal, data rate limits, signals in time and frequency
domain, transmission impairment, performance measurement of network
Unit-III Digital Transmission: digital to digital and Analog to digital conversion, 05
transmission modes, Analog transmission: Digital to analog and analog to
analog conversion
Unit-IV Multiplexing and Spread Spectrum Techniques, Spread Spectrum 03
Techniques
Unit-V Types of Errors: detection versus correction, coding, block coding, cyclic 04
codes, checksum, forward error correction.
Unit-VI Transmission Media: Guided media and unguided media: radio frequency 02
allocation, frequency reuse

Suggested Readings/ 1. BehrouzForouzan, Introduction to Data Communication and Networking,

References: Tata McGraw Hill
2. William Stallings, Data and Computer Communication, PHI
3. Schweber W.L, Data Communication, Tata McGraw Hill
4. Andrew S Tanenbaum, Computer Networks, PHI
5. B.P. Lathi, Zhi Ding, Modern Digital and Analog Communication,
Oxford University Press

Experiments: No.
1 To identify various networking components with 02
applicability like connectors, cables, NIC, interconnecting
devices etc.
2 To simulation different network topologies and perform 02
comparative study of each. (Using CISCO Packet Tracer).
Determine which topology will be suitable for which
applications?
3 To perform hands on practice of signals and their 04
properties in Scilab/Matlab.
4 To implement and analyse various Line Coding Schemes. 04
To Implement unipolar NRZ-L, NRZ-I and polar
Manchester, Differential Manchester and AMI/Pseudo-
ternary.
To Compare the schemes for parameter synchronization,
DC component and bandwidth.
5 To implement analog modulation techniques (using 02
Scilab/Matlab)
6 To implement Pulse Code Modulation 02
7 To implement Synchronous Time Division Multiplexing 02
technique
8* To implement Cyclic Redundancy Check (CRC) error 02
detection algorithm for Noisy channel
9* To implement Error Correcting Code.
10* To perform real time simulation of modulated signal
transmission and reception.
Note: Marked with * are additional
NIRMA UNIVERSITY
Course Title: Database Management Systems
Course Type: Core
Credit Scheme
LPW PW W S
3 0 0 - - - 3

1. explain concepts and architecture of relational database management systems
2. relate various aspects of the relational database like models, functional dependencies and
normalization
3. evaluate various storage and retrieval methods to correlate with relational model through
appropriate indexing
4. interpret transaction processing, concurrency and recovery protocols for effective database
management

hours
Unit-I Overview and Architecture of Database Systems: Purpose of database, 05
File System versus DBMS, Advantages of a DBMS, Describing and Storing
Data in a DBMS: The Relational Model, Levels of Abstraction in a DBMS,
Data Independence. Multi-level architecture, Client/Server architecture,
Mapping, Database users and Administrators.
Unit-II Relational Database: Concepts and Design: Relational Model, Database 10
Schema, Schema Diagrams, Relational Query Languages, Relational
Operations. Relational Data Integrity: Keys: Candidate Keys and
Constraints: Candidate Keys, Primary Keys and Alternate Keys, Foreign
Keys and rules, Null value concept and other integrity constraints.
Relational Operators: Relational Algebra: Closure, set operations, special
relational operations, algebra for update operations, Relational
Comparisons. Relational Calculus: Tuple and Domain-Oriented relational
calculus. ER Diagram, ER to Relational Database Design.
Unit-III Query Language Concepts: Concept of DDL, DML, DCL, structure – 05
creation, alteration, constraints – Primary key, foreign key, unique, not null,
check, IN operator, Functions - aggregate functions, Built-in functions –
numeric, date, string functions, set operations, sub-queries, correlated sub-
queries, grouping, having, ordering, join and its types, views and its types,
transaction control
Unit-IV Normalization: Introduction, Non loss decomposition and functional 05
dependencies, normal forms
Unit-V Database Security and Transaction Management: Database Security 05
concepts, Transaction concepts, Transaction recovery, Concurrency control
problems and solutions
Suggested Readings/ 1. Silberschatz, Korth, Sudarshan Database System Concepts, McGraw-Hill

References: Computer Science Series
2. C J Date, An introduction to Database Systems, Addition-Wesley
3. Nilesh shah, Database System using Oracle, PHI.
4. RamezElmasri&Shamkant B. Navathe, Fundamentals of Database Systems,
Addison-Wesley
5. Hector Gracia-Molina, Jeffrey D. Ullman, and Jennifer Widom, Database
System Implementation, Pearson
Suggested List of NA
Experiments:

NIRMA UNIVERSITY
Course Title: Business Communication
Course Type: Core
Credit Scheme
LPW PW W S
2 0 2 - - - 3

1. apply business communication strategies and principles to prepare effective
communication for business situation
2. select appropriate organizational formats and channels used in developing and
presenting business message
3. communicate via electronic mail, Internet, and other technologies
4. deliver an effective oral business presentation during various professional settings

hours
Unit-I Introduction to Communication: Purpose of Communication; Process of 02
Communication; Importance of Communication in Business; Differences
between Technical and General Communication; Barriers to
Communication; Measures to Overcome the Barriers to Communication.
Unit-II Types of Communication: Types of Communication; Verbal 03
Communication-Importance of verbal communication- Advantages of
verbal communication- Advantages of written communication;
Significance of Non-verbal Communication. Communication
Network: Scope and Types of Communication Network; Formal and
Informal Communication Network; Upward Communication; Downward
Communication; Horizontal Communication; Diagonal Communication.
Unit-III Listening Skills: Listening Process; Classification of Listening; Purpose of 02
Listening; Common Barriers to the Listening Process; Measures to
Improve Listening; Listening as an Important Skill in Work Place, note
taking tips
Unit-IV Language for Communication: Language and Communication; General 02
Principles of Writing; Improving Writing Skills, Essentials of good style,
Expressions and words to be avoided; Grammar and Usage. Effective
Communication, rhetoric, institutional communication, intercultural
communication
Unit-V Written Communication: Principles of effective writing, Steps of writing, 06

Difference between creative, academic and professional writing, Letter
writing, E-mail writing, memo writing, circular writing, issues of
plagiarism.
Unit-VI Reading Skills: Reading Skill; Purpose of Reading; Types of Reading; 01

Techniques for Effective Reading, SQ3R skills, Speed Reading.
Unit-VII Employment Communication: Job Interview: Importance and Factors 04
Involving Job Interview; Characteristics of Job Interview; Job Interview
Process; Job Interview Techniques- Manners and etiquettes to be
maintained during an interview; Sample Questions Commonly asked
During Interview. Resume: Contents of Good Resume; Guidelines for
Writing Resume; Different Types of Resumes; Reason for a Cover Letter
to Apply for a Job-Format of Cover Letter; Different Types of Cover
Letters

Suggested Readings/ 1. Kaul, Asha: Business Communication: Prentice-Hall of India, Delhi

References: 2. Monippally, Matthukutty M. Business Communication Strategies. Tata
McGraw Hill Publishing Company Ltd., New Delhi
3. Sharma, Sangeeta and Binod Mishra. Communication Skills for Engineers
and 1 Scientists: PHI Learning Pvt. Ltd., New Delh
4. Michael Swan, Practical English Usage, OUP
5. William Zinsser, On Writing Well, Harper Resource Book
6. Liz Hamp-Lyons and Ben Heasly, Study Writing, Cambridge University
Press
7. Word Power Made Easy, Norman Lewis.
8. Raymond Murphy, Essential English Grammar: A Self-Study Reference
and Practice Book for Elementary Students of English with Answers,
Cambridge University Press

Experiments: No.
1 Introduction to lab component 02
2 Tenses, Reported Speech 02
3 Letters and Email writings 02
4 Pronunciation, Presentations 02
5 Resume Writing 02
6 Mock Interviews 04
7 Memos and Circular Writing 02
8 Role Plays 02
9 Group Discussion 02

NIRMA UNIVERSITY
Course Title: PL-SQL Programming
Course Type: Core
Credit Scheme
LPW PW W S
0 0 4 - - - 2

1. demonstrate database design using SQL
2. apply suitable query processing to access the database
3. develop efficient PL/SQL programs to access the database
Syllabus:Laboratory work will be based on following concepts with minimum 10 experiments:
SQL queries to store and access a data using join, scalar and aggregate functions, PL/SQL
blocks, using variables with different scope and data types, program structures to control
execution flow using conditional constructs and loop constructs, incorporating SQL statements in
PL/SQL blocks with and without cursors, exception handling, using and managing functions,
procedures and triggers.
Self-Study: -NA-
Suggested Readings/ 1. Ivan Bayross, SQL, PL/SQL, BPB Publications

References: 2. Scott Urman, Oracle9i PL/SQL programming, McGraw-Hill

Experiments: 1. To realize the SQL concepts with DML and DDL 04
commands.
To create a Table, add columns, and perform
unconditional search operations
2. To create a Table, add columns, and perform 04
conditional search operations
3. To use PL/SQL Basic Blocks 04
4. To explore the use of control structures in PL/SQL 04
5. To embed SQL in PL/SQL 04
6. To handle exceptions using PL/SQL 04
7. To write PL/SQL program using procedures 04
8. To write PL/SQL program using functions 04
9. To grant execution privileges using PL/SQL 04
programming
10. To create and update object Triggers using PL/SQL. 04
NIRMA UNIVERSITY
Course Title: Python Programming
Course Type: Core
Credit Scheme
LPW PW W S
0 0 4 - - - 2

1. interpret the basics of Python programming
2. apply standard programming constructs like repetition, selection, functions, composition,
modules, aggregated data
3. design Python programs to solve real world problems
Syllabus:
Laboratory work will be based on following topics and minimum 7 experiments will be
conducted.
Introduction to Computational Science: Introduction, Applications involving scientific

computing, Tools and languages to solve complex scientific problems
Programming in Python: Basics of Python,Interpreter and its environment; Introduction to data
types, concepts of mutability, operators and variables; random numbers, user inputs, statements;
branching, conditional and iteration; functions, File handling, Error handling and exceptions
Array handing, numPy, Matplotlib: Array computing and curve plotting, vectors and higher-
dimensional arrays, matrices, numPy, Matplotlib
Python Pandas: Introduction,Data alignment, aggregation, summarization, computation and
analysis with Pandas
Scientific computation using python: Introduction, Statistical data analysis
Self-Study: -NA-
Suggested Readings/ 1. Hans PetterLangtangen, A Primer on Scientific Programming with

References: Python, Springer
2. Claus Fuhrer, Jan Erik Solem, Olivier Verdier, Scientific Computing
with Python 3,Packt Publishing Limited
3. Martin C. Brown, Python: The Complete Reference, McGraw Hill
Education
4. Hemant Kumar Mehta, Mastering Python Scientific Computing,
Packt Publishing Limited
5. Sergio J. Rojas G., Erik A. Christensen, Francisco J. Blanco-Silva,
Learning SciPy for Numerical and Scientific Computing, Packt
Publishing Limited

Experiments: 1. To install the software IDE on the system. 04
To implement basic programs for python basic data
types and conversion between different data types.
2. To create python programs which demonstrate the 06
concepts function, random numbers, branching,
conditional and iteration statements.
3. To develop python programs for user inputs and python 06
data types like list, set.
4. To implement the python programs for file handling 04
concepts.
5. To implement the python programs for exception 02
handling concepts.
6. To develop python programs using Numpy and Scipy 04
concepts.
7. To create python programs using Numpy API concepts. 02
8. To plot the graph(s) using Matplotlib and its concepts. 04
9. To perform and exemplify data alignment, aggregation 04
and summarization concepts using Python Pandas.
10. To learn and create python programs for statistical data 04
analysis concepts.

NIRMA UNIVERSITY
Course Title: Operating Systems
Course Type: Core
Credit Scheme
LPW PW W S
3 1 0 - - - 4

1. illustrate basic components and services of operating systems
2. summarize the mechanism of operating systems to manage processes and memory
3. analyse the mechanism of operating systems to handle I/O devices and file management
4. demonstrate competence in recognizing and using operating system features

hours
Unit-I Introduction to Operating System: Operating system services, evolution 03
of operating systems, types of operating system
Unit- II Process Scheduling: Process states, process description, process control, 08
process management, scheduling algorithms, performance evaluation of
algorithm
Unit-III Threads: Threads, symmetric multiprocessing, micro kernels. 07
Concurrency: Mutual exclusion and synchronization, deadlock, and
starvation
Unit-IV Memory Management and Virtual Memory: Memory management 08
requirements, partitioning, paging, segmentation, virtual memory
Unit-V I/O Management and Files: I/O devices, organization of I/O functions, 04
OS design issues, I/O buffering, disk scheduling, disk cache, file
management

Suggested Readings/ 1. William Stallings, Operating Systems, PHI.
References: 2. Silberschiltz, Galvin and Greg Gange, Operating System, Willey India.
3. A.S.Tannenbaum, Modern Operating Systems, TMH Publications.
4. Peterson, Operating System Concepts, Addition-Wesley Longman
Publishing Co
5. Milan Milenkovic, Operating System Design & Concepts, McGraw Hill
Experiments:

NIRMA UNIVERSITY
Course Title: Design and Analysis of Algorithms
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. illustrate the notion of algorithmic complexity and logic of fundamental algorithms
2. apply fundamental algorithms in real life problem solving
3. identify and evaluate suitable data structures to solve a problem effectively and efficiently
4. build formal illustration of algorithmic complexity

hours
Unit-I Elementary Algorithmics: Efficiency of Algorithms, Average & worst- 03
case analysis, Elementary Operation
Unit-II Analysis Techniques: Empirical, mathematical, Asymptotic analysis 05
and related unconditional and conditional notations.
Unit-III Analysis of Algorithms: Analyzing control structures: sequencing, 05
“For” loops, Recursive calls, “While” and “repeat” loops, Amortized
analysis
Unit-IV Solving Recurrences: Intelligent guesswork, Homogeneous 07
recurrences, Inhomogeneous Recurrences, Change of variable, Range
transformations, Master Theorem, Recurrence Tree
Unit-V Data Structures: Heaps, Binomial heaps, Fibonacci heaps, Disjoint set 05
structures
Unit-VI Greedy Algorithms: Graphs: Minimum spanning trees-Kruskal’s 03
algorithm, Prim’s algorithm, Graphs: Shortest paths
Unit-VII Divide-and-Conquer: Multiplying large integers, Binary search, 06
sorting: sorting by merging, quick sort, finding the median, Matrix
multiplication, Exponentiation, approaches using recursion, memory
functions.
Unit-VIII Dynamic Programming: The principle of optimality, Various 05
applications using Dynamic Programming.
Unit-X Branch and Bound, Backtracking: Design of some classical problems 04
using branch and bound and Backtracking approaches.
Unit-X Randomized and Approximation Algorithms: Design of some 02
classical problems.
Suggested Readings/ 1. Charles E. Leiserson, Thomas H. Cormen, Ronald L. Rivest, Clifford
References: Stein - Introduction to Algorithms, PHI
2. Gilles Brassard & Paul Bratley, Fundamentals of Algorithmic, PHI.
3. Ellis Horowitz, SartajSahni, SanguthevarRajasekharan, Fundamentals of
Computer Algorithms, Galgotia.

Experiments: No.
1 To implement an iterative and full recursive version of 02
following sorting algorithms: Selection Sort, Insertion Sort
and Bubble Sort
2 To implement Quick Sort algorithm by randomly selecting 02
any element of an array as the pivot element. Display the
output after each call to the "PARTITION" function
finishes
3 To implement merge sort for specified scenarios 02
4 To implement Prim’s algorithm 04
5 To implement Binomial Heap and perform all its 04
operations.
6 To implement the chained matrix multiplication algorithm 02
using dynamic programming
7 To solve the 0/1 Knapsack problem using Branch-and- 04
Bound technique

NIRMA UNIVERSITY
Course Title: Software Engineering
Course Type: Core
Credit Scheme
LPW PW W S
2 0 2 - - - 3

1. explain various phases of software development lifecycle
2. identify the requirement specifications for a software project
3. develop the process model using standard tools and methodologies
4. implement a quality software project through effective team-building, planning, scheduling
and risk assessment.

hours
Unit-I Introduction: Introduction to Software Engineering, Defining Software, 02
Changing Nature of Software, attributes of a good Software, Software
Product, Software Development Life Cycle, Software Processes, Software
Engineering Practices, Software Myths
Unit-II Software Process Models: Generic Process Model (Defining Framework 03
Activity, Identifying Task Set), Process Assessment & Improvement,
Waterfall Process Model, Incremental Process Model, Spiral Process
Model, Prototyping Software Process Model, Evolutionary Process Model
Unit-III Project Management Concepts: Management activities, Project Planning, 03
Project Scheduling, Risk analysis and Management, Reactive vs. Proactive
Risk Strategies, Software Risks, Risk Identification, Risk Projection, Risk
Refinement, Risk Mitigation, Monitoring and Management.
Unit-IV Software requirement engineering: Software Requirements, Requirement 02
Engineering, Extraction and Specification, Feasibility Study, Requirements
Modelling
Unit-V Design Concepts: Object oriented design, Architectural Design, 03
Component level Design, User Interface Design
Unit-VI Software Process & Metrics: Metrics in the Process and Project Domains: 03
Process metrics, project metrics, Software Measurement Metrics for
Software Quality
Unit-VII Software Testing: Unit testing, integration testing, black box and white 04
box testing, verification and validation of software, software configuration
management
Suggested Readings/ 1. Ian Sommerville, Software Engineering, Addison – Wesley
References: 2. Roger Pressman, Software Engineering A Practitioner's Approach,
McGraw Hill Publication
3. Rajib Mall, Fundamentals of Software Engineering, Prentice Hall of
India
4. Ivar Jacobson, Object Oriented Software Engineering A use case
Approach, Pearson

Experiments:
1 To identify project scope, objectives, problem statement 02
formulation and requirement identification for project
2 To make a comparative study of various software 02

process models
3 To define functional & non-functional requirements for 04

same and prepare a SRS document for the project
4 To define modules of the project & Design the project 02

plan (Gantt Chart) for the same and identify deliverables
with time line
5 To design Use Case Diagrams and Use Case 02

Specifications for your system
6 To construct Activity Diagram Class Diagram & CRC 04

index cards for your system
7 To construct Sequence Diagram, Collaboration and State 02

Diagram for project
To implement two functional modules of your project. 02

8
Design test cases for your project and perform testing.
Prepare test strategy document
NIRMA UNIVERSITY
Course Title: Cyber Laws
Course Type: Core
Credit Scheme
LPW PW W S
2 0 0 - - - 2
1. summarize the key terms and developments in the field of cyber laws across India and other
jurisdictions
2. analyze issues related to internet censorship and surveillance, freedom of speech, data
protection, privacy, cybercrimes and electronic evidence
3. assess issues of jurisdiction, e-commerce, e-taxation, electronic signatures, and payments
4. relate the concepts of cyber laws with real life case studies.

hours
Unit-I Introduction: Glossary of terms, The evolution of Cyberspace, 04
Jurisdiction of Borderless Cyberspace, E-Contracting
Unit-II E-Commerce: Concept of Electronic Commerce, Electronic Signatures, 04
Electronic Money, taxation of e-commerce
Unit-III IPR and Privacy: Intellectual Property Rights and the Internet World, 04
Protecting Privacy and Data on the Internet
Unit-IV Cyber Crimes and Acts: Cybercrimes, Electronic Evidence, Information 04
Technology Act
Unit-V Issues and Challenges: Emerging new issues on the internet, Emerging 04
concepts of the Online Dispute Resolution, Case studies like SMS scam,
UTI bank phishing attack, online credit card fraud on ebay, data theft etc.

Suggested Readings/ 1. Karnika Seth, Computers, Internet and the New Technology Laws,
References: LexisNexis Butterworths Publication
2. Rodney Ryder and Nikhil Naren, Internet Law: Regulating Cyberspace
and Emerging Technologies, Bloomsbury Professional India
3. Karnika Seth, CYBER LAWS in the Information Technology Age
Suggested List of -NA--
Experiments:

NIRMA UNIVERSITY
Course Title: Computer Networks
Course Type: Core
Credit Scheme
LPW PW W S
2 0 2 - - - 3

1. summarize the functionality of different layers of computer network architectures
2. analyze protocols related to various layers
3. design computer network configurations
4. explain the significance of various fields of protocol headers

hours
Unit-I Introduction: Use of Computer Networks, Connecting devices, Networks 02
and its types, network standards. Network Hardware, Network Software,
OSI and TCP/IP Reference Model.
Unit-II Data Link Layer: Introduction and link layer services, Two sublayers, link 06
layer addressing, data link layer protocols, multiple-access protocols:
Aloha, CSMA, Ethernet protocols and types of Ethernet
Unit- III Network Layer: Design Issues, packet switching, Routing Algorithms: 07
Shortest Path Routing, Flooding, Distance Vector Routing, Link State
Routing, Congestion Control Algorithms, Quality of Service, Example
protocols: IPv4 and IPv6, addressing, subnetting, IP Datagram Format,
Fragmentation
Unit-IV Transport Layer: Transport Service, transport layer protocols for flow 03
control, Congestion Control, Example protocols: UDP, TCP
Unit-V Application Layer: The Domain Name System, Electronic Mail, World 02
Wide Web, HTTP, FTP, Content delivery.

Suggested Readings/ 1. Andrew S. Tanenbaum, Computer Networks, PHI Publication

References: 2. BehrouzForouzan, Data Communication Networking, TMH Publication
3. James Kurose and Keith Ross, Computer Networking: A Top-Down
Approach, Pearson
4. BehrouzForouzan, TCP/IP Protocol suite, TMH Publication
5. William Stallings, Data and Computer Communication, Pearson
6. Jim Kurose, Computer Networking: A top-down approach, Pearson

Experiments: 1 To understand the features of Wireshark as a packet 02
capture tool and understand encapsulation of
information. Also study effect of few network
commands.
2 To study behavior of generic devices used for 02
networking by designing a simple network with multiple
nodes and connect via interconnecting devices like hub
or switch. Perform simulation and trace communication
behavior of specified network devices.
3 To implement error detection and correction using 02
HAMMING code concept. Make a test run on input data
stream and verify error correction feature.
4 To simulate Virtual LAN configuration using CISCO 02
Packet Tracer Simulation
5 To configure Wireless LAN using CISCO Packet Tracer 02
6 To implement subnetting by designing multiple subnets 04
with suitable number of hosts. Make a plan to assign
static IP addressing across all subnet to explain
implementation of subnetting.
7 To simulate Static and Dynamic Routing Protocol 02
Configuration using CISCO Packet Tracer.
8 To implement echo client server using TCP/UDP sockets 02
9 To configure a network having DHCP server, DNS 02
Server, Web Server and SMTP server

NIRMA UNIVERSITY
Course Title: Linux Fundamentals
Course Type: Core
Credit Scheme
LPW PW W S
0 0 4 - - - 2

1. utilize various of Linux utilities effectively
2. demonstrate use of shell scripts to the given solve problems
3. implement some standard Linux utilities like grep fork etc. in C language
Syllabus: Laboratory work will be conducted based on the following topics with
minimum 7 experiments to be conducted:
Introduction to Linux, Types of shells, Basic command of Linux, Study of Editors, Files &
directory commands – cat, less, more, ls, comm, diff, tar, Pipes & redirection- use of !, &, > ,
touch, absolute & relative paths. Directory related commands – pwd, cd, mkdir, rmdir,
Manipulating file commands - cp, mv, rm, grep, chmod etc.
Shell programing based onShell variables,Arithmetic operators, Decision making

instructions, Logical operators, Case control structures, Loop control structures, head
command, tail command, Concatenation of two files, Directory Management, Scripts for
basic function of DBMS, System calls: Fork, exec. etc.
Self-Study: -NA-
Suggested Readings/ 1. Sumitabha Das, “UNIX: Concepts and Applications” Tata McGraw
References: Hill (Latest Edition)
2. YashvantKanetkar, Shell Programming, BPB.
3. Kernighan, the UNIX Programming Environment, Pearson
4. Maurice Bach, The Unix Operating System, Prentice Hall
Experiments: No.
1 To get acquaintance with basic UNIX commands like man, 04
who, cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more,
date, time, kill, history, chmod, chown, finger, pwd, cal,
logout, shutdown, grep etc.
To get acquaintance with UNIX filters
2 To write a shell script for performing the functions of a 04
basic calculator. (Using decision making, case control
structure and bc command)
3 To write a shell script to compare the contents of two files 04
To write a shell script to generate all the combinations of 1,
2 and 3
4 To write a shell script to keep on accepting lines of text 04
and write the text into a data file until the user inputs
"end". The script should count the number of lines input
and display them
To write a shell script to print the reverse of an input
number
5 To write a shell script which imitates head command 04
To write a shell script which imitates tail command
6 To write a shell script to generate the series of number 04
multiply by 2
To write a shell script to concatenate all given file into a
single file
7 To write a shell script for implementing directory 04
management
8 To write a shell script for performing basic functions 04
related to DBMS
9 To write a shell script to find factorial of a given integer 04
To write a Shell script to print the command line
arguments in reverse order
10 To write a C program to implement grep command 04
To write a C program to implement a system call using the
fork () and Exec () function

NIRMA UNIVERSITY
Course Title: Artificial Intelligence
Course Type: Core
Credit Scheme
LPW PW W S
2 1 0 - - - 3

1. explain the significance of Artificial Intelligence and knowledge representation,
2. demonstrate the design concepts of control and search strategies in AI Applications,
3. compare different search strategies for a given scenario
4. design applications using Artificial Intelligence.

hours
Unit-I Introduction to Artificial Intelligence Overview: 02
Knowledge: General concepts, definition and importance of knowledge,
knowledge-based system, representation, organization, manipulation and
acquisition of knowledge.
Unit-II Problems, Problem Spaces and State Space Search: The AI Problems, 07
The Underlying Assumption, What Is an AI Techniques. Defining the
Problems as a State Space Search, Production Systems, Production
Characteristics, Production System Characteristics, and Issues in The Design
of Search Programs.
Search and Control Strategies: Uninformed (Blind) and informed search,
DFS, BFS, Heuristic Search Techniques: Generate-And-Test, Hill
Climbing, Best-First Search, A*, AO*, Problem Reduction, Constraint
Satisfaction.
Unit-III Knowledge Representation: Knowledge Representation Issues, 05
Representations and Mappings, Approaches to Knowledge Representation,
Using Predicate Logic Representation Simple Facts in Logic, Resolution.
Representing Knowledge Using Rules, Procedural versus Declarative
Knowledge, Logic Programming, Forward Versus Backward Reasoning.
Unit-IV Weak Slot-And-Filler Structure: Semantic Nets, Frames 03
Reasoning: Symbolic Reasoning under Uncertainty, Introduction to Non-
monotonic Reasoning, Logics for Non-monotonic Reasoning. Statistical
Reasoning, Probability and Bay’s Theorem, Certainty Factors and Rule-Base
Systems, Bayesian Networks, Dumpster-Shafer Theory.
Unit-V Game Playing: Overview and Example Domain, Min-max Search, Adding 03
Alpha-Beta Cutoffs. Introduction of Expert system.

Suggested Readings/ 1. Russel and Norvig, Artificial Intelligence: A modern approach, prentice
References: Hall
2. Elaine Rich And Kevin Knight, Artificial Intelligence, Tata McGraw-
Hill
3. D.W.Patterson, Artificial Intelligence And Expert Systems, Prentice Hall
4. D.W.Rolston, Artificial Intelligence And Expert System Development,
Mcgraw-Hill
5. Ivan Bratko, PROLOG Programming for Artificial Intelligence,
Addison-Wesley

Experiments:
NIRMA UNIVERSITY
Course Title: Machine Learning
Course Type: Core
Credit Scheme
LPW PW W S
2 0 2 - - - 3

1. comprehend statistical methods as basis of machine learning domain
2. apply variety of learning algorithms for appropriate applications
3. implement machine learning techniques to solve problems in applicable domains
4. evaluate and compare algorithms based on different metrics and parameters.

hours
Unit-I Introduction: Motivation and Applications, Visualization, Basics of 02

Supervised and Unsupervised Learning
Unit-II Regression Techniques: Basic concepts and applications of Regression,

Simple Linear Regression – Gradient Descent and Normal Equation Method, 07
Multiple Linear Regression, Linear Regression with Regularization,
Hyperparameters tuning, Loss Functions.
Evaluation Measures for Regression Techniques
Unit-III Classification Techniques: Naïve Bayes Classification, Fitting Multivariate

Bernoulli Distribution, Gaussian Distribution and Multinomial Distribution, 09
K Nearest Neighbours, Decision trees.
Support Vector Machines: Hard Margin and Soft Margin, Kernels and
Kernel Trick. Evaluation Measures for Classification Techniques
Unit-V Advanced Concepts: Introduction to SVM, ANN, Basics of Semi- 02

Supervised and Reinforcement Learning, introduction to deep learning.

Suggested Readings: 1. Tom Mitchell, Machine Learning, TMH
2. C. Bishop, Pattern Recognition and Machine Learning, Springer
3. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification and Scene
Analysis, Wiley
4. KishanMehrotra, Chilukuri Mohan and Sanjay Ranka, Elements of

Artificial Neural Networks, Penram International
5. RajjanShinghal, Pattern Recognition, Techniques and
Applications, OXFORD
6. Ethemalpaydin, Introduction to Machine Learning, PHI

Experiments: 1 Introduction to Python and Numpy. 02
2 Introduction to Pandas, Matplotlib and Sklearn. 02
3 Simple and multiple linear regression using Gradient 02
Descent without regularization. (Without using sklearn or
equivalent library for both)
4 Simple and Multiple linear regression using Gradient 02
Descent and Normal equation with regularization.
5 K-nearest Neighbours classifications. 02
6 Naïve bayes classification using Multivariate Bernoulli and 02
Multinomial distribution.
7 Naïve bayes classification using Gaussian distribution. 02
8 Decision Tree classification. 02
9 Implementation of Support Vector Machine for linearly 02
separable data.
10 Implementation of Support Vector Machine for non- 02
linearly separable data.

NIRMA UNIVERSITY
Course Title: Information Security
Course Type: Core
Credit Scheme
LPW PW W S
3 1 0 - - - 4
1. illustrate principles and problems of cryptosystems for encryption, digital signing and
authentication
2. infer the role of mathematics of cryptography
3. choose appropriate cryptographic technique for developing a secured network
4. implement the cryptographic algorithms

hours
Unit-I Security Overview: Significance of Information and network security, 02

what are the hurdles in achieving the same, introduction to Cryptography
Unit-II Classical Encryption Techniques: Caesar Cipher, Monoalphabetic 06
substitution, Playfair Cipher, Polyalphabetic substitution, Transposition
Techniques
Unit-III Symmetric Ciphers: Block Ciphers and DES, Advanced Encryption 05
Standard (AES), Block Cipher Operations, Key Distribution
Unit-IV Mathematics: Pseudo Random Number Generation and Stream Ciphers, 10
Mathematical Background (Fermat's Little Theorem, Euler Totient
Function, Euler's Theorem Chinese Remainder Theorem etc.)
Unit-V Public Key Cryptography: RSA, Elliptic Curve Cryptography, 05
DiffieHelman Key Exchange, Digital Signatures, Key Distribution
Unit -VI Overview of Hash and MAC Functions and Digital Signature Standards 02

Suggested Readings/ 1. William Stallings, “Cryptography and Network Security:

References: Principles and Practice, Pearson
2. D. R. Stinson: Cryptography: Theory and Practice (Discrete
Mathematics and Its Applications), CRC Press.
3. B. Schneier: Applied cryptography: protocols, algorithms, and
source code in C, John Wiley & Sons.
4. Bernard Menezes: Network Security & Cryptography, 1st Edition
Experiments:
NIRMA UNIVERSITY
Course Title: Software Project Management and Quality Assurance
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. interpret various phases of software project management and quality assurance
2. apply the feasibility analysis in project management and network analysis tools for cost
and time estimation.
3. implement a quality software project through effective team-building, planning,
scheduling and risk assessment
4. develop skills to use modern software project management and development tools

hours
Unit-I Software Project Management Concepts: The Management Spectrum, 06
People, The Product, The Process, The W5HH Principle
Project Scheduling: Management Activities, Project Planning, Project
Scheduling, The Relationship Between People and Effort, defining a Task
Set for the Software Project, Activity Network, Time-Line Chart
Unit-II Process and Project Metrics: Metrics in Process and Project Domains, 08
Software Measurement, Size-Oriented Metrics, Function-Oriented Metrics,
UseCase-Oriented Metrics, Metrics in Software Quality, Defect Removal
Efficiency, Integrating Metrics within the Software Process
Estimation for Software Projects: LOC-based Estimation, FP-based
Estimation, UseCase-based Estimation, COCOMO I and II Model,
Estimation of Object-Oriented Projects, The Make/Buy Decision
Unit-III Risk Management: Reactive versus Proactive Risk Strategies, Software 05

Risks, Risk Identification, Risk Projection, Risk Refinement, Risk
Mitigation, Monitoring, and Management, The RMMM Plan
Project Execution and Closure: Reviews, Project Monitoring and Control,
Project Tracking, Milestone Analysis, Defect Analysis and Prevention,
Project Closure
Unit-IV Quality Concepts: Software Quality, Software Quality Requirements, 05
Software Quality Models, Software Quality Standards
Review Techniques: Cost Impact of Software Defects, Defect Amplification
and Removal, Review Metrics and Their Use, Informal Reviews, Formal
Technical Reviews
Unit-V Software Quality Assurance: Elements of Software Quality Assurance, 06
SQA Tasks, Goals, and Metrics, Formal Approaches to SQA, Statistical
Software Quality Assurance, Software Reliability, The SQA Plan
Software Configuration Management: SCM Activities, Baselines,
Software Repository and Its Branches, Configuration Control, Software
Configuration Audit

Suggested Readings/ 1. Roger Pressman, Software Engineering A Practitioner's Approach,

References: McGraw Hill Publication
2. Claude Y. Laporte, Alain April, Software Quality Assurance, Wiley
3. PankajJalote, Software Project Management in Practice, Addison-Wesley
Professional
4. Daniel Galin, Software Quality Assurance: From Theory to
Implementation, Pearson Education
5. Ian Sommerville, Software Engineering, Addison – Wesley

Experiments: No.
1 Define modules of a software project & design the project 04
plan (Using Microsoft Project) for the same and identify
deliverables with time line.
2 To explore and perform software project management 02
using Zepel tool.
3 To explore and perform software project development 02
using JIRA tool.
4 To explore and perform software project management and 02
development using Github tool.
5 To explore and perform project functionalities using 02
Kanbanize tool.
6 To explore and perform testing for quality assurance using 04
Jenkins tool.
7 To explore and perform project management activities 04
using GitLab tool.

NIRMA UNIVERSITY
Course Title: Web Technologies
Course Type: Core
Credit Scheme
LPW PW W S
2 0 4 - - - 4

1.interpret the basic structure of web designing technologies
2. apply the concepts of web technologies in designing static and dynamic web pages
3. design interactive web pages incorporating validation techniques

hours
Unit-I Introduction to various HTML tags: Introduction to HTML, HTML
Documents, HTML Structure tags, HTML Block level tags, HTML Text 07
level tags, Different types of Lists, Nesting of lists, Linking HTML
Documents, Frames, tables and forms.
Unit-II Cascaded Style Sheets: What are style sheets, importance of CSS, Different
approaches to style sheets, Using Multiple approaches, linking to style 06
information in separate file, setting up style information using inline, internal
and external style sheet.
Unit-III JavaScript: Introduction to JavaScript, JavaScript syntax, variables and their

types, JavaScript operators, arrays and array methods, Control statements, 07
built‐in objects in JavaScript, Array, String, Math, Date objects, validation
using JavaScript.
Self-Study: The self-study contents will be declared at the commencement of semester. Around
10% of the questions will be asked from self-study contents
Suggested 1. Harvey M. Deitel, Paul J. Deitel, Tem R. Nieto, Internet and World
Readings/ Wide Web: How to Program, Pearson
References: 2. Scott Parker, Paperback, The Web Designer's 101 Most Important
Decisions Professional Secrets for a Winning Website
3. Html5 Black Book: Covers Css3, Javascript, Xml, Xhtml, Ajax, Php
and Jquery, Kogent Learning Solutions Inc. (Dreamtech Press).
4. Jon Duckett, Beginning Web Programming with Html, XHTML
andCSS, Wiley
Suggested List Sr. Title Hours
of No.
Experiments: 1 A. Design a home page which will display your
information i.e.,resume.
B. Demonstrate various list types using appropriate 04
example
2 A. Create a HTML page which contains the two frames

using frameset tag. First frame contains the details
about chapters and second frame contains navigation
links. Once we clicked on navigation link then it
jumps on specific chapter section in first frame. Refer
the below given figure for more details.
04
B. Demonstrate an image map using map of India in

HTML. Once we click on specific state, it will open
another page with stateimage.
3 Design a web page for the following:
A. Design the table as given below:
04
B. Create a registration form of your choice. Use

appropriate form tags.
4 Design the web pages that demonstrate following concepts:
A. Font properties 04
B. Background properties
C. Box shadow, Margin, Padding and Outline
properties.
5 Create the web pages that demonstrate following concepts: 04

A) Demonstrate various border styles on HTML
elements.
B) Write a code on four div elements as shown in
below given figure:
6 Create the web pages that demonstrate following concepts:
A) Develop HTML code that displays horizontal
navigation menu bar using unordered list.
B) Demonstrate Table and Column properties. Refer
the following figure as sample:
04
7 A. Write a JavaScript that takes an integer value and

display the number with its digits in reversed order.
B. Write a JavaScript that read a set of N single 04
digits and convert them into single decimal
integer. For example, the script should convert
the set of 4 digits {9,3,1,6} to decimalinteger
9316.
8 A. Write a JavaScript code to display the denomination
of the amount deposited in the bank in terms of
100’s, 50’s, 20’s, 10’s, 5’s, 2’s and 1’s. (Eg: If
deposited amount is Rs.163, the output should be 1-
100’s, 1-50’s, 1- 10’s, 1-2’s & 1-1’s).
B. Design the web page which have simple guessing 04
number game. Write a JavaScript function which
generate random number in between 1 to 200. Give
user 5 attempts to guess the random number. If user
guess it correctly then change the background color
of web page to yellow and if user fail to guess the
number after the 5 attempts than change the
background color of web page to orange.
9 A. Write a JavaScript function that obtain a list of
person names from the user, store each name
in an array. When userenters “END”, it
terminates scanning. Sort the name
intoascending order and then display each 04
name in new line onweb page.
B. Write a JavaScript to display the current date,
current time and display the appropriate greeting
message according to time slot (e.g. : Morning,
20/05/2019 08:00:00 AM)
10 Design the web page to demonstrate the validation of

following fields. Write a JavaScript to validate each field
as per its valid format and given validation criteria.
i) IP address
ii) Alphanumeric values only 04
iii) Date in DD/MM/YYYY format
iv) Special symbol restriction
v) Email must be in proper form.
vi) Phone number should be minimum of 10 digits
vii) Required field validation
viii) Password and retype password must be same
Suggested -NA-
Case List:
NIRMA UNIVERSITY
Course Title: Internet of Things
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. comprehend the architectural components and platforms of IoT ecosystem
2. apply appropriate access technology as per the application requirement
3. identify the need of various IoT protocols as per the problem characteristics
4. design applications with suitable lightweight data processing and communication
methodology.

hours
Unit-I Introduction, applications, need and scope of IoT, Various IoT architectures, 05
functional stack, Processors and Operating Systems for resource constrained
devices
Unit-II Sensors and actuators, Smart objects, Connecting objects, protocols and 09
access technologies like IEEE802.15.4, BLE, LoRaWAN, LTE-M, NB-IoT
Unit-III IoT network layer, IPv6: IPv6 structure, addressing, routing, interconnecting 05
issues, 6LoWPAN: forwarding, addressing, header compression, neighbour
discovery, Routing in LLN, RPL
Unit-IV Application layer protocols, CoAP, MQTT, AMQP, Sensor data models and 06
representation, Integrating IoT Services with Interoperable data encoding
standards: JSON and CBOR
Unit V Securing IoT, Challenges in IoT security, Fog and Edge Computing, 05
Connected Vehicles, Autonomous Vehicles, Industrial Applications of IoT

Suggested Readings/ 1. Jean-Philippe Vasseur, Adam Dunkels, Interconnecting Smart

References: Objects with IP: The Next Internet, Morgan Kaufmann
2. David Hanes, G. Salgueiro, IoT Fundamentals - Networking
Technologies, Protocols, and Use Cases for Internet of Things,
Cisco Press
3. Pethuru Raj, Anupama Raman, The Internet of Things - Enabling
Technologies, Platforms and Use Cases, CRC Press
4. Peter Waher, Learning Internet of Things, Packt Publishing Ltd
5. Daniel Kellmereit, Daniel Obodovski, The Silent Intelligence: The
Internet of Things, DND Ventures
6. Olivier Hersent, David Boswarthick, Omar Elloumi, The Internet
of Things: Key Applications and Protocols, Wiley Publications

Experiments: No.
1 Building basic electronic circuits using various 02
components and exploring ESP8266, ESP32 and Arduino
IDE.
2 Programming with the ESP8266/ESP32 boards 02
3 Access sensors and control actuator using HTTP protocol 02
4 Reverse parking sensor for car with sensors and boards 02
5 Integrating Bluetooth, RFID, LoRa transceiver with 02
different IoT platforms
6 Integrating IoT devices with cloud platform for data 02
processing
7 Publish and Subscribe with MQTT 02
8 Application development using COAP 02
9 Interfacing IoT boards with platforms like IFTTT 02
10 Simulate IoT network on Cooja Simulator focusing on 02
6LowPAN

NIRMA UNIVERSITY
Course Title: Mobile OS and Applications
Course Type: Core
Credit Scheme
LPW PW W S
2 0 4 - - - 4
1. compare the similarities, differences and benefits of the current mobile operating systems
2. explain the functionalities of remote operations and security essential of mobile devices
3. analyze the latest trends and application in building Mobile OS
4. demonstrate the native applications required to build using mobile OS

hours
Unit-I Introduction: Introduction to different operating system platforms, 04
Windows Server, Windows Desktop, Linux servers, Android, Apple
iOS.
Unit-II Installation of software operating system and configuration, 05
identification and obtaining installation media as well as suitable
hardware, installing software.
Unit-III End-to-end testing of operating systems (Windows, Linux), test 02
remote management, login management, connectivity to network
resources
Unit-IV Various operating systems applications (IOS, Safari, Maps, App Store, 04
Windows, Command Prompt, Linux, Terminal, Android; Chrome,
Maps, Play Store.), Introduction to Cross Platform development
Unit-V Security principles of operating systems, virtual servers and cloud 05
services, user access control, malware protection, patch management
Self-Study: The self-study contents will be declared at the commencement of

semester. Around 10% of the questions will be asked from self-study
contents
Suggested 1. GerardusBlokdyk, Mobile Operating System a Complete Guide,
Readings/ 5STARCooks publication
References: 2. Reto Meier, Professional Android 4 Application Development,
Wrox Publication
3. Books Llc (Google online Books), Mobile Phone Operating System:
General Books LLCInstallation of Android studio.
4. Charlie Miller, Dion Blazakis, Dino DaiZovi, Stefan Esser,
Vincenzo Iozzo, iOS Hacker's Handbook, Wiley publication

Experiments: 1 A) Compare various Mobile operating systems with 04
applications.
B) Summaries the native applications for different
operating systems
2 Write a shell script for implementing directory 04
management. (In Linux OS).
3 Installation of Android studio and Development of 04
Hello World Application
4 Mobile application phase-I: 04
Demonstration of simple UI with user activity
- To develop an application by using list view
and spinner view to list out some items on
screen by selecting any of the item’s system
display complete information about that
item. Also show addition and deletion of the
items from the spinner view.
5 A) Develop a native calculator application. 04
B) Create an application that takes the name from a
text box and shows a hello message along with the
name entered in text box, when the user clicks the
OK button.
6 Create a screen that has input boxes for User Name, 04
Password, Address, Gender (radio buttons for male
and female), Age (numeric), Date of Birth
(Datepicker), State (Spinner) and a Submit button.
On clicking the submit button, print all the data
below the Submit Button (use any layout).
7 Mobile application phase-II: 04
To show Communication between two Activity
through Intents:In first Activity take two inputs
from user send these two numbers or strings via
intent to second activity, perform the user defined
operations on these two numbers/strings in second
activity. Now sent back to first activity and show
the results to the user on first activity.
8 Develop an application that uses GUI components, 04
Font and Colors.
9 To implement the security concepts when running 04
an operating system running on a platform; with a
focus on physical hardware, virtual servers and
cloud services
10 To study and explore different Remote Systems 04
Management API.
Suggested Case -NA-

List:
NIRMA UNIVERSITY
Course Title: Data Mining
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. interpret data types and understand the need of data mining
2. infer various data pre-processing techniques for the mining process
3. apply basic principles and algorithms used in practical data mining
4. evaluate and compare data mining algorithms based on different metrics and parameters for
real life applications.

hours
Unit-I Introduction: Motivation and importance, different kinds of data, 02
data mining functionalities, classification of data mining systems,
major issues in data mining
Unit-II Data Pre-processing: Data summarization, data cleaning, data
integration and transformation, data reduction, data discretization and 08
concept hierarchy generation, feature extraction, feature
transformation, feature selection, introduction to Dimensionality
Reduction, CUR decomposition
Unit-III Mining Frequent Patterns, Associations and Correlations: Basic
concept, efficient and scalable frequent item-set mining methods, 06
mining various kind of association rules, from association mining to
correlation analysis, Advanced Association Rule Techniques,
Measuring the Quality of Rules.
Unit-IV Classification and Prediction: Neural Network-Based Algorithms,
Rule-Based Algorithms, Combining Techniques, accuracy and error 04
measures, evaluation of the accuracy of a classifier or predictor.
Unit-V Advanced Cluster Analysis: Types of data in cluster analysis, 07
overview of major clustering methods, learning, Hierarchical
Agglomerative Clustering, k-means Algorithm, Self-Organizing
Maps, probabilistic model-based clustering, clustering high
dimensional data
Unit-VI Case studies: Applications of Distributed and parallel Data Mining. 03
Advanced Techniques: Web Mining, Spatial Database Mining,
Temporal Mining, And Multimedia Mining.
Self-Study: The self-study contents will be declared at the commencement of

semester. Around 10% of the questions will be asked from self-study
contents
Suggested 1. Jiawei Han and MichelineKamber, Data mining: Concepts and

Readings: Techniques, Morgan Kaufmann Publishers.
2. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine
Learning Tools and Techniques, Morgan Kaufmann
3. Hand, Mannila, and Smyth., Principles of Data Mining, MIT Press
4. Berry and Linoff, Mastering Data Mining, Wiley
5. Delmater and Hancock, Data Mining Explained, Digital Press

Experiments: 1 Implement Min-max normalization and z-score 02
normalization for the given dataset.
2 Apply the methods to find the missing values in the 02
given dataset.
3 Implement the suitable method with help of Quartile 02
for outlier detection.
4 Find frequent itemsets using an iterative level-wise 02
approach based on candidate generation.
5 Implement AND and OR gate using Perceptron 02
Learning (self-implementation)
6 Implement Ex-OR gate using backpropogation 02
Neural Network. (self-implementation)
7 Implement K-means clustering algorithm. 02
8 Implement probability model based clustering 02
algorithm.
9 Getting acquainted with WEKA and R- 02
programming.
10 Use WEKA for classification. 02
Suggested Case -NA-

List:
NIRMA UNIVERSITY
Course Title: Blockchain Technology
Course Type: Core
Credit Scheme
LPW PW W S
2 0 0 - - - 2

1. summarize the concept of Blockchain technology
2. develop the structure of a Blockchain network
3. evaluate security issues relating to Blockchain and cryptocurrency
4. design the applications based on Blockchain technology

hours
Unit-I Introduction to Blockchain: Need, Blockchain 1.0 to 5.0, types of 04

blockchain, Generic elements of a blockchain, digital money to distributed
ledgers, design primitives, protocols, security, consensus, permissions, and
privacy.
Unit-II Blockchain Architecture, Design and Consensus: Basic crypto primitives: 05

hash, signature, hash chain to Blockchain, basic consensus mechanisms,
requirements for the consensus protocol for permission less environment,
PoW, PoS, PoB, PoET, and scalability aspects of Blockchain consensus
protocols.
Unit-III Permissioned and Public Blockchains: Design goals, Consensus protocols 08

for Permissioned Blockchains, Hyperledger Fabric, Decomposing the
consensus process, Hyperledger fabric components, Smart Contracts, Chain
code design, Hybrid models (PoS and PoW)
Unit-IV Blockchain cryptography: Different techniques for Blockchain 03

cryptography, privacy and security of Blockchain, multi-sig concept

Suggested Readings/ 1. Narayanan, Arvind. et al, Bitcoin and
References: cryptocurrencytechnologies: a comprehensive introduction.
Princeton University Press.
2. Wattenhofer, Roger, The science of the blockchain, CreateSpace
Independent Publishing Platform.
3. Bahga, Arshdeep, and Vijay Madisetti,.Blockchain Applications:
A Hands-on Approach, VPT.
4. Nakamoto, Satoshi, Bitcoin: A peer-to-peer electronic cash
system, Research Paper.
5. Antonopoulos, Andreas M, MasteringBitcoin: Programming the
open blockchain, O'Reilly Media, Inc.
6. Diedrich, Henning, Ethereum: Blockchains, digital assets, smart
contracts, decentralized autonomous organizations, Wildfire
Publishing (Sydney).
7. Draft version of “S. Shukla, M. Dhawan, S. Sharma, S.
Venkatesan, ‘Blockchain Technology: Cryptocurrency and
Applications’, Oxford University Press.
8. Josh Thompson, ‘Blockchain: The Blockchain for Beginnings,
Guild to Blockchain Technology and Blockchain Programming’,
Create Space Independent Publishing Platform.

Experiments:

NIRMA UNIVERSITY
Course Title: Cloud Computing
Course Type: Core
Credit Scheme
LPW PW W S
3 0 2 - - - 4

1. explain core concepts of cloud computing, its services, and models
2. discuss systems, hardware, and application virtualization and outline their role in
enabling cloud services
3. explore the issues related to cloud computing and its application
4. apply fundamental concepts in cloud infrastructures to build and deploy cloud
applications.

hours
Unit-I Cloud Fundamentals and Virtualization: Introduction and understanding 05
of cloud computing, concepts, and models, Cloud-enabling technologies and
fundamental cloud security and requirements, virtual machines and
virtualization of clusters and data centers, Applications of Virtual Machines.
Unit-II Cloud delivery model: IaaS, PaaS, and SaaS, Cloud delivery model with the 03
perspective of the cloud provider and the cloud consumer.
Unit-III Cloud Computing Mechanisms: Cloud Infrastructure, Logical Network 07

Perimeter, Virtual Server, Cloud Storage Device, Cloud Usage Monitor,
Specialized Cloud Mechanisms, Load Balancer, SLA Monitor, Failover
System, Hypervisor, Automated Scaling Cloud Management Mechanisms,
Resource Management System, SLA Management System, CASE STUDY
examples.
Unit-IV Cloud Computing Architecture: Fundamental cloud architecture, Dynamic 08
Scalability Architecture, Elastic Resource Capacity Architecture, Service
Load Balancing Architecture, Cloud Bursting Architecture, advanced cloud
architecture, Zero Downtime Architecture, Resource Reservation
Architecture, Dynamic Failure Detection, and Recovery Architecture,
Storage Workload Management Architecture.
- 1–
C:\Users\Administrator\Desktop\COURSE - WEBSITE\Term VIII\Cloud Computing.docx
Unit-V Working with the cloud metrics, security issues, and production 07
readiness: Cost metrics and pricing models, Cloud usages cost metrics and
SLAs, service quality metrics, Technologies for Data Security in Cloud
Computing, Security Concerns, Legal issues, and Aspects, Securing the
Private and Public Cloud Architecture. Industry Standards Organizations,
Mapping Mechanisms to Characteristics, Cloud-Adapted Risk Management
Framework, Cloud Business Case Template.

Suggested Readings/ 1. RajkumarBuyya, James Broberg, Andrzej M Goscinski, Cloud

References: Computing: Principles and Paradigms, Wiley publication
2. Thomas Erl, ZaighamMahmood, and Ricardo Puttini, Cloud
Computing Concepts, Technology & Architecture, PRENTICE
HALL
3. Toby Velte, Anthony Velte, Cloud Computing: A Practical Approach,
McGraw-Hill Osborne Media
4. George Reese, Cloud Application Architectures: Building
Applications and Infrastructure in the Cloud, O'Reilly Publication
5. John Rhoton, Cloud Computing Explained: Implementation
Handbook for Enterprises, Recursive Press
6. RajkumarBuyya, Christian Vecchiola, S. ThamaraiSelvi, Mastering
Cloud Computing Foundations and Applications Programming,
McGraw Hill

Experiments: No.
1 To Install and study the simulation tool (Cloud Analyst) 02
with various features. Also, explore the utilities/usages of
the Brokers and Load balancers in the simulations.
2 To execute the scenario for the following condition: to 02
create the number of a minimum of five datacenters and
apply the five-user base. Also, generate the report using
the Cloud Analyst GUI tool.
3 To learn the use of computing and container services on 02
any one of the cloud platforms:
AWS/Google/Azure/IBM/Any other.
4 To host a website (both static and dynamic environment) 02
in the AWS public cloud and analyzing the utility of its
resources.
5 To understand the mechanism of the load balancing in 02
Cloud Computing and implementing the same in the AWS
public cloud using a Classical Load Balancer.
6 To understand the mechanism of the Auto-scaling and 02
elastic nature of the AWS public cloud and implement the
same by using a maximum of three EC2 instances in the
AWS.
7 Using the AWS S3 (Simple Storage Service), 02
implement the configuration management technique
and validate the access rights as public and private.
- 2–
- 3–
8 To understand the PAAS model of the IBM Cloud 02
and run a web application onto the already available
readymade environment (with all the necessary
available platforms).
9 To work with the IAM (Identity Access Management) 02
of the AWS (Amazon Web Services) Cloud and to
enables the access management mechanism in AWS
for Cloud security. Also, create and manage AWS
users and groups, and use permissions to allow and
deny their access to AWS resources.
10 Understanding the architecture and workflow of the 02
cloud sim and workflow sim. Analyze its results to
understand load balancing, scheduling, and failure
handling techniques.
- 4–

Tri 1 2 3 4 5 6 7 8

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Tri 1 2 3 4 5 6 7 8

Uploaded by

Copyright:

Available Formats

NIRMA UNIVERSITY

Integrated B. Tech. (CSE)-MBA programme

Course Code CSI0101

Matrix Theory: Review of algebra of matrices, Rank of matrix, Inverse of matrix

Vector Space and Linear Transformation: Vector space, subspaces, linear

w.e.f A.Y 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f A.Y 2020-21

Course Code CSI0102

Course Title English I

w.e.f A.Y 2020-21

w.e.f A.Y 2020-21

Course Code CSI0103

Course Title Physics

w.e.f A.Y 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f A.Y 2020-21

Course Code CSI0104

Course Title Fundamentals of Programming

w.e.f A.Y 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f A.Y 2020-21

Course Code CSI0105

Course Title Elements of Electrical Engineering

w.e.f A.Y 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f A.Y 2020-21

Course Code CSI0201

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0202

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0203

Course Title English II

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0204

Course Title Basic Electronics

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0205

Course Title Structured Programming

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0301

Course Title Object Oriented Programming

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0302

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21

Course Code CSI0303

w.e.f. A.Y. 2020-21

L=Lecture, T=Tutorial, P=Practical, C=Credit

w.e.f. A.Y. 2020-21