0% found this document useful (0 votes)
93 views76 pages

B.Tech Syllabi - Branch-CSE, 2022 Regulations

Uploaded by

Riya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
93 views76 pages

B.Tech Syllabi - Branch-CSE, 2022 Regulations

Uploaded by

Riya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 76

COURSE CURRICULUM & SYLLABI OF

Bachelor of Technology (B.Tech)


Branch/Programme: Computer Science and Engineering
(2022 Regulations)

(Approved by the 5th and 8th Senate Meeting held on 30th July 2022 & 12th April 2024 respectively)

INDIAN INSTITUTE OF INFORMATION TECHNOLOGY SENAPATI, MANIPUR


(An Institute of National Importance by Act of Parliament, Government of India)
Mantripukhri, Imphal – 795002, Manipur, India.
www.iiitmanipur.ac.in

Page | 0
COURSE CURRICULUM
SEMESTER-I

Sem. Course Code Course Name L T P C


I MA1011 Mathematics I 3 1 0 8
I CS1011 Computer Programming 3 0 0 6
I CS1111 Computer Programming Lab 0 0 3 3
I EC1011 Digital Design 3 0 0 6
I EC1111 Digital Design Lab 0 0 3 3
I EC1012 Electrical Circuit Analysis 3 0 0 6
I PH1011 Physics I 3 0 0 6
I EN1011 English Language Skills I
JA1011 Japanese Language Skills I 2 0 2 6
KO1011 Korean Language Skills I
I GE1091 Yoga for Holistic Health 1 0 2 4
I GE1092 Induction Programme (Audit) 1 0 3 0
19 1 13 48
Contact Hours / Week 33

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 6+4 14 24 -- -- -- --
L-Lecture T-Tutorial P-Practical C-Credit

SEMESTER-II
Sem. Course code Course Name L T P C
II MA1012 Mathematics II 3 1 0 8
II CS1012 Data Structures 3 0 0 6
II CS1112 Data Structures Lab 0 0 3 3
II CS1061 Computer Organization and Architecture 3 0 0 6
II EC1013 Basic Electronic Circuits 3 0 0 6
II EC1112 Basic Electronics Lab 0 0 3 3
II PH1012 Physics II 3 0 0 6
II HS1091 Introduction to Entrepreneurship 2 0 0 4
EN1012 English Language Skills II
II JA1012 Japanese Language Skills II 2 0 2 6
KO1012 Korean Language Skills II
Total 19 1 8 48
Contact Hours / Week 26

1
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 16 8 24 -- -- -- --

SEMESTER-III
Sem. Course Code Course Name L T P C
III CS2021 Discrete Mathematics 3 1 0 8
III CS2014 Design and Analysis of Algorithms 3 0 0 6
III CS2013 Object Oriented Programming 3 0 0 6
III CS2041 Operating Systems 3 0 0 6
III EC2031 Signals and Systems 3 0 0 6
III MA2013 Probability and Random Processes 3 0 0 6
III CS2113 Object Oriented Programming Lab 0 0 3 3
III CS2141 Operating System Lab 0 0 3 3
III EC2131 Signals and Systems Lab 0 0 3 3
Total 18 1 9 47
Contact Hours / Week 28

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- 6 -- 41 -- -- --

SEMESTER-IV

Sem. Course code Course Name L T P C


IV CS2022 Theory of Computing 3 0 0 6
IV CS2042 Software Engineering 3 0 0 6
IV CS2031 Computer Networks 2 1 2 8
IV CS2043 Database Management Systems 2 1 2 8
IV CS2015 Web Technology 2 1 2 8
IV EC2032 Digital Signal Processing 2 1 2 8
IV EC2071 Microprocessor 2 1 0 6
Total 17 4 8 50
Contact Hours / Week 29
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- 50 -- -- --

2
SEMESTER-V

Sem. Course Code Course Name L T P C


V CS3051 Artificial Intelligence 3 0 0 6
V CS3044 Compiler Design 3 0 2 8
V CS3032 Data Communication and Internet Protocol 3 0 0 6
V CS30XX Professional Elective – I 3 0 0 6
V CS30XX Open Elective - I 3 0 0 6
V HS30XX HSS Elective – I 3 0 0 6
V CS3201 Project-I 0 0 4 4
Total 20 0 8 44
Contact Hours / Week 28
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 6 -- -- 20 6 6 4

SEMESTER-VI

Sem. Course Code Course Name L T P C


VI CS3071 Computer Graphics 3 0 2 8
VI CS3053 Statistical Machine Learning 3 0 0 6
VI CS3033 Cyber Security 3 0 0 6
VI CS30XX Professional Elective – II 3 0 0 6
VI CS30XX Open Elective - II 3 0 0 6
VI CS3023 Optimization Techniques 3 0 0 6
VI HS30XX HSS Elective II 3 0 0 6
VI HS3092 Employability Skills (Audit) 1 0 3 0
VI CS3202 Project - II 0 0 4 4
Total 22 0 9 48
Contact Hours / Week 31

Total Humanities & Basic Basic Open


Professional Professional Internship
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) / Project
Credit (HS) (BS) (BE) (OE)
Credit 6 -- -- 26 6 6 4

3
SEMESTER-VII

Sem. Course Code Course Name L T P C


VII CS4034 Cloud Computing 2 0 2 6
VII CS4035 Computer and Network Security 3 0 0 6
VII CS40XX Professional Elective - III 3 0 0 6
VII CS40XX Professional Elective - IV 3 0 0 6
VII CS40XX Open Elective - III 3 0 0 6
VII CS4203 Project – III 0 0 12 12
VII CS4204 Internship 0 0 3 3
Total 14 17 45
Contact Hours / Week 31

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- 18 6 6 15

SEMESTER-VIII

Sem. Course Code Course Name L T P C


VIII CS4205 Industry/ Research Internship 0 0 18 18
Total 0 18 18
Contact Hours / Week

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- -- -- -- 18

4
PROFESSIONAL ELECTIVE
Code Course Title Hours per week Credits
L T P
CS--- Advanced Database Systems 3 0 0 6
CS--- Advanced Data Structure and Algorithms 3 0 0 6
CS--- Audio and Speech Processing 3 0 0 6
CS--- Augment and Virtual Reality Systems 3 0 0 6
CS--- Data Mining and Warehousing 3 0 0 6
CS--- Deep Learning 3 0 0 6
CS--- Distributed Systems and Applications 3 0 0 6
CS--- High Performance Computing 3 0 0 6
CS--- Human Computer Interaction 3 0 0 6
CS--- Natural Language Processing 3 0 0 6
CS--- Parallel Programming 3 0 0 6
CS--- Information Retrieval 3 0 0 6

CS--- Software Testing 3 0 0 6

CS--- Pattern Classification 3 0 0 6

CS--- Advanced Computer Architecture 3 0 0 6

CS--- Principles of Programming Languages 3 0 0 6

CS--- Mobile Application Development 3 0 0 6

CS--- Soft Computing 3 0 0 6

CS--- Software Process & Project Management 3 0 0 6

CS--- Cyber Forensics 3 0 0 6

CS--- User-Centric Mobile Computing 3 0 0 6

CS--- Topics and Tools in Social Media Data Mining 3 0 0 6

CS--- Linux Kernel: Implementation And Security Issues 3 0 0 6

CS--- Computational Complexity 3 0 0 6

CS--- Big-data Processing and Management 3 0 0 6


CS--- Foundation of Data Science 3 0 0 6

5
OPEN ELECTIVE (OE)
Code Course Title Hours per week Credits

OE--- Big-data Processing and Management 3 0 0 6


OE--- Information Theory and Coding 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Internet of Things 3 0 0 6
OE--- Image and Video Processing 3 0 0 6
OE--- Software Testing 3 0 0 6
OE--- Deep Learning 3 0 0 6
OE--- Blockchain Technologies 3 0 0 6
OE--- Computer Vision 3 0 0 6
OE--- VLSI Technology 3 0 0 6
OE--- Wireless Sensor Network 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Multimedia Systems 3 0 0 6
OE--- Introduction to Bio-informatics 3 0 0 6

OE--- Cyber Security & Forensics 3 0 0 6


OE--- Quantum Computing 3 0 0 6

HSS ELECTIVE

Course Course Title Hours per week Credits


Code
L T P
HS3093 Introduction to Linguistics 2 0 2 6
HS3094 Environmental Sciences 3 0 0 6
HS3095 Professional Ethics for Engineers/ Ethics and Human 3 0 0 6
Values
HS3096 Principles of Management 3 0 0 6
HS3097 Entrepreneurship and Management Functions 3 0 0 6
HS3098 Organizational Behaviour 3 0 0 6
HS--- Computational Linguistics 3 0 0 6
HS--- Introduction of IPR 3 0 0 6
HS--- Sustainable Development Goals 3 0 0 6
HS--- Supply Chain and Logistic Management 3 0 0 6
HS--- Consumer Behaviour and Welfare Economics 3 0 0 6
HS--- Understanding Democracy and Governance in India 3 0 0 6
HS3099 Language, Cognition and Culture 3 0 0 6

6
DETAILED SYLLABI
SEMESTER-I
Sem. Course Code Course Name L T P C
I MA1011 Mathematics I 3 1 0 8
I CS1011 Computer Programming 3 0 0 6
I CS1111 Computer Programming Lab 0 0 3 3
I EC1011 Digital Design 3 0 0 6
I EC1111 Digital Design Lab 0 0 3 3
I EC1012 Electrical Circuit Analysis 3 0 0 6
I PH1011 Physics I 3 0 0 6

EN1011 English Language Skills I


I JA1011 Japanese Language Skills I 2 0 2 6
KO1011 Korean Language Skills I
I GE1091 Yoga for Holistic Health 1 0 2 4
I GE1092 Induction Programme (Audit) 1 0 3 0
19 1 13 48
Contact Hours / Week 33
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 6+4 14 24 -- -- -- --

MA1011 MATHEMATICS I 3-1-0-8


Syllabus:
Linear Algebra: Systems of linear equations and their solutions; vector space Rn and its subspaces; spanning set and
linear independence; matrices, inverse and determinant; range space and rank, null space and nullity, eigenvalues and
eigenvectors; diagonalization of matrices; similarity; inner product, Gram-Schmidt process; vector spaces (over the
field of real and complex numbers), linear transformations.
Single Variable Calculus: Convergence of sequences and series of real numbers; continuity of functions;
differentiability, Rolle's theorem, mean value theorem, Taylor's theorem; power series; Riemann integration,
fundamental theorem of calculus, improper integrals; application to length, area, volume and surface area of
revolution.
Texts:
1. G. Strang, Linear Algebra and Its Applications, 4th Edition (South Asian Edition), Wellesley- Cambridge
Press, 2009(ISBN: 9788175968110).
2. S. R. Ghorpade and B. V. Limaye, An Introduction to Calculus and Real Analysis, Springer India, 2006
(ISBN: 9788181284853).

7
References:
1. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
2. K. Hoffman and R. Kunze, Linear Algebra, 2nd Edition, Prentice Hall India, 2009.
3. R. G. Bartle and D. R. Sherbert, Introduction to Real Analysis, 3rd Edition, Wiley India, 2007.

CS1011 Computer Programming 3-0-0-6


Syllabus:
Need to study programming languages, Characteristics of Programming Languages, Programming language
paradigms: Imperative, Object Oriented, Functional, Logic, Event Driven and Concurrent Programming, Language
design issues, Language Translation issues, Data Types: properties of Types and objects, Elementary data types,
structured data types, Type conversion, Binding and binding times.
Procedural programming through Language ‗C‘: Basic Syntax and Semantics, Variables, Types, Expressions,
Assignment statements, Scope of variables, Conditional and Iterative Control Structures, I/O, Functions and parameter
passing, Strings and string processing, Pointers and References, Structures, Recursion.
Algorithm development: Techniques of problem solving, Stepwise Refinement, example of algorithm writing systems
as a solution to mathematical problems (at least ten), algorithms for searching and sorting, merging order lists, Flow-
chart for the above algorithms.
Texts:
1. Bryon Gottfried, Programming with C, McGraw Hill, Third edition (ISBN: 9780070145900).
References:
1. Horowitz, Sahni, and Anderson-Freed, Fundamentals of Data Structures in C, Universities Press, Second
edition (ISBN: 9788173716058).
2. Kernighan and Ritchie, The C Programming Language, PHI, Second edition, (ISBN:9788120305960).
3. Roosta Seyed, Foundations of Programming Languages Design & Implementation, 3rd Edition, Cenage
learning.

CS1111 Computer Programming Lab 0-0-3-3


Introduction to Linux OS, Free & Open source software, Basic tools & commands, Compiling and debugging C
program with GCC & GDB.
Basic Assignment Statement, Conditional and Iterative Control Structures, Some Numerical Examples, Functions and
parameter passing, Array and String, Pointer, Structure, Recursion, Dynamic Memory Allocation, File Handling,
Command Line Arguments.
Implementation of the following problem statements using C programming language along with algorithm and
flowchart are mandatory.
1. Solution to basic mathematical problems such as, largest of 2,3,..n numbers, factorial of a given number,
Armstrong number, palindrome, LCM, GCD, sum digits, sum of series (arithmetic, geometric, alternating), printing
octal, or hexadecimal equivalent of a given number or vice versa, solving quadratic equation, number pyramid,
printing 1st 500 hundred prime numbers, swapping of numbers using pointers and without using third variable,

8
Operations on matrix)
1. Arrange a list of numbers into a specific order (ascending, descending).
2. Arrange a list of strings into a specific order (ascending, descending, based on number of characters in the
string etc., the order will be provided as command line argument.
3. Reverse a string using recursion and check whether the string is palindrome or not.
4. Count frequency of a specific character from a given paragraph
5. Generate character bigrams from a given paragraph
6. Remove all characters in a string other than alphabet
7. Count the frequency of digits after decimal and find maximum occurring digit in the PI value upto first 100
decimals (3.1415 92653 58979 32384 62643 38327 95028 84197 1 6939 93751 05820 97494 45923 07816 40628
62089 98628 03482 53421 17067)
8. Display the content of a file in reverse direction (similar to $cat and $tac commands)
9. Store student record such as height, weight, date of birth etc. of the batch using structure and display the
stored details including average height and average weight.
Reference Book:
1. Bryon Gottfried, Programming with C, McGraw Hill
2. Horowitz, Sahni, and Anderson-Freed, Fundamentals of Data Structures in C, Universities Press, Second
edition.
3. GDB https://www.eecs.umich.edu/courses/eecs373/readings/Debugger.pdf, https://ftp.gnu.org/old-
gnu/Manuals/gdb/html_node/gdb_toc.html, https://www.sourceware.org/gdb/documentation/,
4. GCC https://www.cse.iitb.ac.in/grc/intdocs/gcc-basic-info.html, https://gcc.gnu.org/onlinedocs

EC1011 Digital Design 3-0-0-6


Syllabus:
Number System: Introduction to number systems, binary, Integer and floating-point- numbers, octal, hexadecimal and
decimal number system and their conversion.
Arithmetic Operations: Binary addition & subtraction; 1‘s and 2‘s complement, subtraction using 2‘s complement;
binary codes, addition and subtraction operations on binary-coded numbers; Algorithms for performing multiplication
and division.
Combinational Circuits: Basic Logic Operations, AND, OR, NOR, NAND, EX-OR, EX-NOR Gates, Boolean
expressions and their minimization using algebraic identities; Karnaugh map representation and minimization of
Boolean functions using K-map; Don‘t care conditions, NAND and NOR logic implementations, two-level
realizations using gates -- AND-OR, OR-AND, NAND-NAND and NOR-NOR structures.
Combinational Circuits using MSI Modules: Adders, subtractors, BCD arithmetic, serial adder, carry look-ahead
adder, multi-bit adder, Multiplexers, De-multiplexers, Decoders, Multiplexer-based realization of K-maps;
Combinational circuit design using multiplexers and gates. Programmable Logic Devices: ROM, PLA, PAL.
Sequential Circuits: Latches and Flip-flops; Ripple counters using T flip-flops; Synchronous counters; Shift Registers;
Ring and MLS counters; Sequence generator using J-K / D flip-flops, Finite state machines, propagation delay, setup
and hold time, critical path delay, Static RAM, Dynamic RAM.

9
Texts:
1. M. Morris Mano, Digital Logic and Computer Design, 11th Edition, Pearson Education, 2009.
References:
1. Ronald J Tocci, Neal S Wisdmer and Gregory L. Moss, Digital Systems: Principle and Applications, 10th
Edition, Pearson Education, 2011.
2. Albert Paul Malvino, Donald P Leach and Gautam Saha, Digital Principles and Applications 7th Edition, Tata
McGraw - Hill Education, 2011.

EC1111 Digital Design Lab 0-0-3-3


Familiarization with digital IC family 74LS00 and 74HS00. Familiarization with laboratory equipment – voltage
generator, function generator, oscilloscope. Study of digital IC characteristics – input voltage, input current, output
voltage, output current, fan out, noise margin and propagation delay. Combinational logic circuits: Implementation of
Boolean functions using logic gates; Arithmetic operations using logic gates; Implementation of Multiplexers, De-
multiplexers, Encoders, Decoders; Implementation of Boolean functions using Multiplexers/Decoders Study of
sequential logic circuits: Implementation of flip flops, Implementation of counters, Implementation of sequence
generators

EC1012 Electrical Circuit Analysis 3-0-0-6


Syllabus:
Basic components and circuit analysis: Charge, current, voltage and power, voltage and current sources, Ohm‘s law;
Voltage and current laws: nodes, paths, loops and branches, Kirchhoff‘s current law, Kirchhoff‘s voltage law,
independent sources, voltage and current division; Basic nodal and mesh analysis: nodal analysis, super-node, mesh
analysis, super-mesh; Network theorems: linearity and superposition, source transformations, Thevenin‘s theorem,
Norton‘s theorem, reciprocity, maximum power transfer;
Magnetically coupled circuits: mutual inductance, energy considerations, linear transformer, ideal transformer;
Poly-phase circuits: Poly-phase systems, single-phase three-wire systems, three-phase Y-Y connection, wye-delta
transformation, power measurement in three-phase systems;
Time and frequency domain analysis of linear circuits: Solution of first and second order differential equations for
Series and parallel R-L, R-C, R-L-C circuits, initial and final conditions in network elements, forced and free
response, time constants, steady state and transient state response.
Sinusoidal steady-state analysis: Forced response to sinusoidal functions, complex forcing function, phasor, phasor
relationship for R, L and C, impedance, admittance, phasor diagrams, instantaneous power, average power, apparent
power and power factor, complex power;
Two-port networks: one-port networks, linear 2-port network parameters, admittance parameters, impedance
parameters, hybrid parameters, transmission parameters.
Texts:
1. W. H. Hayt, J. E. Kemmerly, S. M. Durbin, Engineering Circuit Analysis, Tata-McGraw-Hill Publishing
Company Limited, 7th / 8th Edition, 2010/ 2012.
References:
1. Bruce Carlson, Circuits: Engineering Concepts and Analysis of Linear Electric Circuits, 2nd Reprint, Thomson

10
Asia Pvt. Ltd., 2006.
2. R. A. De Carlo and P. M. Lin, Linear Circuit Analysis, 2nd Edition, Oxford University Press, 2001.

PH1011 Physics I 3-0-0-6


Syllabus:
Special Theory of Relativity: Michelson-Morley experiment, Postulates of STR. Galilean transformation. Lorentz
transformation. Simultaneity. Length Contraction. Time dilation. Relativistic addition of velocities. Energy
momentum relationships.
Quantum Mechanics: Two-slit experiment. De Broglie‘s hypothesis. Uncertainty Principle, wave function and wave
packets, phase and group velocities. Schrödinger Equation. Probabilities and Normalization. Expectation values.
Eigenvalues and eigen functions. particle in a box, potential barrier, harmonic oscillator
Solid State Physics: Crystal lattices and symmetry groups, reciprocal lattice, Brillouin zone, Miller indices, crystal
structure by X-ray diffraction; free electron theory, electrons in a periodic potential, Bloch's theorem, Kronig-Penny
model, formation of bands, effective mass, holes, classification of metal, insulator and semiconductor, intrinsic and
extrinsic semiconductors, law of mass action, Hall effect; Curie law, concepts of ferro, ferri, and anti-ferro magnetism
Texts:
1. Kenneth S. Krane, Modern Physics, John Wiley &Sons, Inc, 3rd Edition, 2012
2. C. Kittel, Introduction to Solid State Physics, John Wiley & Sons, 2005.
References:
1. Beiser, Concepts of Modern Physics, Tata McGraw-Hill, New Delhi, 1995.
2. A.J. Dekker, Solid State Physics, Mcmillan, 1986.

EN1011 English Language Skills I 2-0-2-6


Syllabus:
Basic Grammar: articles, quantifiers, punctuation, use of tenses, gerunds and infinitives, present participles, subject
verb concord, adverbs, nouns, pronouns, prepositions, use of connectives, use of adjectives and adverbs; common
errors; Lexicon- Enriching vocabulary through one-word substitutes, synonyms, antonyms, etc.
Spoken English: importance for effective communication; linguistic aspects of mishearing; fluency; speaking to
multicultural/multidisciplinary audience; standard varieties of spoken English; understanding vowels, consonants and
syllable in English; tempo of speech & phrasal pause in English; English rhythm; stress on simple and derived words
in English; practice and learning to improve pronunciation of numbers, units of weights, distance, etc.
Aspects of Theatre in Spoken Communication: grooming, eye contact, body language, amplitude.
Preparing a Presentation: charts, graphs, drawings, maps, diagrams, tables, etc.; using power point slides and other
presentation aids; making presentations and self-evaluation.
Texts:
1. Shreesh Chaudhary. Better Spoken English, New Delhi: Vikas Publishing. (1992/2004)
2. J. D. O'Connor. Better English Pronunciation, Cambridge University Press. (1980)
3. F.T. Wood. A Remedial English Grammar for Foreign Students. New Delhi: Macmillan. (1965)

11
References:
1. Marilyn Anderson, Pramod K. Nayar, and Madhucchanda Sen. Critical Reasoning, Academic Writing and
Presentation Skills. Rev. ed. New Delhi: Longman-Pearson. (2010)
2. Oxford Advanced Learner‘s Dictionary of English, Ninth Edition. (2016)
3. Michael Swan and Catherine Walter. Oxford English Grammar Course: Advanced. Oxford: OUP. (2011)
4. Allan Pease and Barbara Pease. The Definitive Book of Body Language. New Delhi: Manjul Publishing
House. (2005)

JA1011 Japanese Language Skills I 2-0-2-6


Module I: Introduction to Japanese language and scripts: Hiragana,Katakana, and Kanji.
Introduction to Japanese pronunciation
Culture Input: Useful everyday Japanese greetings and expressions with classroom
vocabularies.
Introduction to Japanese numerals.
Module II: Learning self Introduction and how to connect with people.
Talk about things using Japanese demonstratives.
Module III: Learning how to tell time, and also to invite and accept invitation.
Be able to perform basic actions in daily life.
Module IV: Learning how to express likes and dislikes, simple thoughts and impressions about past events
and experiences.
Be able to express the existence of people and things.
Texts:
1. Minna No Nihongo Main Textbook Elementary1-2 (Goyal Publications)
2. Minna No Nihongo Translation and Grammatical Notes in English Elementary 1-2 (Goyal
Publications)
3. Minna no Nihongo 1 Kanji Eigo Ban (3A corporation)
4. Minna no Nihongo (3A corporation)
5. Listening materials (3A corporation website)

KO1011 Korean Language Skills I 2-0-2-6


Module I: Preliminaries I: Introduction to Korean language / Consonants & vowels / combining consonants &
vowels.
Preliminaries II : Final consonants / Reading practice / Basic expressions for the class
Module II: Greeting and introducing yourself.
Asking and answering questions about daily life
Module III: Talking about where things are
Buying things1 / Reading Sino-Korean numbers / Making requests
Module IV: Buying Things2 / Reading Pure Korean numbers /Quantifiers

12
Texts:
1. Sejong Korean 1(King Sejong Institute Foundation, Seoul) & Workbook

GE1091 Yoga for Holistic Health 1-0-2-4


Inauguration: Introduction to the Course, Benefits of the Course, Ice-Breaking, Goal Setting,
Team Building, The Power of Knowledge, The Power of Yoga & Meditation, Mental Relaxation
Techniques.
Module I: Capacity Building: Listening and Learning Enhancement, Questioning Skills, Communication
Skills, The Latest Ipod (Inner Peace, Outer Dynamism)
Introduction to Yoga: What‘s Yoga?, Benefits of Yoga, Limbs of Yoga, Obstacles to Yoga,
Practicals (Yoga Asanas).

Module II: Yoga & Personality Development:


Life Skills (Vastness of Life and Layers of Existence), Energy Management (Sources of Energy), Mind &
Emotion Management, The Power of a Focussed Mind (Present Moment), Body - Breath - Mind
Connection (Importance of Breath), Introduction to Breathing Techniques, Practicals (Pranayams +
Sudarshan Kriya).
Mechanics of Happiness:
Secret of Happiness, Stress Management (Sources of Stress, Physiology and Psychology of
Stress), Handling Opposite Situations, Responsibility and Happiness Index, The Power of
Responsibility, Living with Awareness (100%), Adaptability & Acceptance, Understanding
Changing Nature of Life, Improving memory, concentration & focus, Concentration Pranayama,
Practicals.

Module III: Emotional Intelligence:


Dealing with Worry/ Regret / Love/ Hate/ Fear/Regret/ Aversion, Anger Management, Time
Management & Prioritization, Overcoming negative mental habits (i.e. complaining, gossiping,
procrastination), Dealing with counterproductive habits, Lifestyle & Environment Awareness,
Life Choices and their global consequences, Practicals.
Self Confidence, Peer Pressure & Optimal Performance:
Anxiety Management and Confidence, Personal and interpersonal relationship, Coping with
Parental and Peer Pressure, Opinions, Inhibitions and their Impact on Life, Going Beyond Ego,
The Ego-Handling Technique, Practicals.

Module IV: Leadership:


The Qualities of a Leader, The Role of Enthusiasm, Power of a Team, The Power of Intention,
Intention, Attention, Manifestation, Commitment, Practicals.
Ethics, Morality and Integrity:
Importance of ethics, morals and integrity, Human Values, Social Code of Conduct, Role Models
of Integrity, Role of youth in nation building, Practicals.
A Vision for A Stress-free, Violence-free World:
Spreading Happiness, Happiness Survey, The Concept of Social work, Brainstorming for Team

13
Service Projects, Anti-Drug Awareness Campaign, Break into Service, Practical.
TEXT BOOK:
1. Commentary on the Patanjali Yoga Sutras
2. Wisdom for Life

GE1092 Induction Programme (Audit) 1-0-3-0


 Physical activity
 Creative Arts
 Universal Human Values
 Literary
 Proficiency Modules
 Lectures by Eminent People
 Visits to local Areas
 Familiarization to Dept./Branch & Innovations

14
Semester-II

Sem. Course code Course Name L T P C


II MA1012 Mathematics II 3 1 0 8
II CS1012 Data Structures 3 0 0 6
II CS1112 Data Structures Lab 0 0 3 3
II CS1061 Computer Organization and Architecture 3 0 0 6
II EC1013 Basic Electronic Circuits 3 0 0 6
II EC1112 Basic Electronics Lab 0 0 3 3
II PH1012 Physics II 3 0 0 6
II HS1091 Introduction to Entrepreneurship 2 0 0 4
EN1012 English Language Skills II
II JA1012 Japanese Language Skills II 2 0 2 6
KO1012 Korean Language Skills II
Total 19 1 8 48
Contact Hours / Week 26

Total Humanities & Basic Basic Open Internship /


Professional Professional
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 16 8 24 -- -- -- --

MA1012 Mathematics II 3-1-0-8


Syllabus:
Multivariable Calculus: Vector functions of one variable – continuity, differentiation and integration; functions of
several variables - continuity, partial derivatives, directional derivatives, gradient, differentiability, chain rule; tangent
planes and normals, maxima and minima, Lagrange multiplier method; repeated and multiple integrals with
applications to volume, surface area, moments of inertia, change of variables; vector fields, line and surface integrals;
Green's, Gauss's and Stokes' theorems and their applications.
Ordinary Differential Equation: First order differential equations - exact differential equations, integrating factors,
Bernoulli equations, existence and uniqueness theorem, applications; higher-order linear differential equations -
solutions of homogeneous and non-homogeneous equations, method of variation of parameters, series solutions of
linear differential equations, Legendre equation and Legendre polynomials, Bessel equation and Bessel functions of
first and second kinds. Laplace and inverse Laplace transforms; properties, convolutions; solution of ODE by Laplace
transform. Systems of first-order equations, two-dimensional linear autonomous system, phase plane, critical points,
stability.
Texts:
1. G. B. Thomas, Jr. and R. L. Finney, Calculus and Analytic Geometry, 9th Edition, Pearson Education India,
1996.
2. S. L. Ross, Differential Equations, 3rd Edition, Wiley India, 1984.

15
References:
1. H. Anton, I. C. Bivens and S. Davis, Calculus, 10th Edition, Wiley, 2011.
2. T. M. Apostol, Calculus, Volume 2, 2nd Edition, Wiley India, 2003.
3. W. E. Boyce and R. C. Di Prima, Elementary Differential Equations and Boundary Value Problems, 9th
Edition, Wiley India, 2009.
4. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India, 1995.

CS1012 Data Structures 3-0-0-6


Syllabus:
Performance of algorithms: space and time complexity, asymptotic;
Basic data structure: Linked list (singly, doubly, circular), stacks, queue (circular, priority, dqueue)
Sorting & searching: Insertion sort, selection sort, bubble sort, quicksort, mergesort, heapsort, shellsort, linear search;
Nonlinear data structure: Tree (Representation, binary tree (full, complete, balance), binary search tree), tree traversals
(post, in, pre), red-black tree, AVL tree
Advanced structure: Heap (max, min, binomial, fibonacci), hash (Chaining, Linear probing, Quadratic probing, Hash
tree);
Graphs: Representations (Adjacency Matrix, Adjacency list), Depth first search, Breadth first search;
Text:
1. A H Aho, J E Hopcroft and J Ullman, Data Structures and Algorithms, Addison-Wesley, 1987.
References:
1. M A Weiss, Data Structures and Problem-Solving Using Java, Addison-Wesley, 1997.
2. A M Tannenbaum, Y Langsam and M J Augenstein, Data Structures Using C++, Prentice Hall India, 1996.
3. Robert Sedgewick, Algorithms in C++ Parts 1-5, Pearson Education, Third Edition, 1998.
4. Seymour Lipschutz, Data Structures with C, SCHAUM SERIES, Tata McGraw-Hill, 1st edition, 2010.
5. Horowitz, Sahni, and Anderson-Freed, Fundamentals of Data Structures in C, Universities Press

CS1112 Data Structure Lab 0-0-3-3


Implementation of the following algorithms with operations are mandatory using C/C++ programming language
(preferably using functions to make it modular). Instructor may take help of application-specific mini-projects (a set
of input will be transformed to output) to explain the concept of these data structures.
Basic data structure: Linked list (singly, doubly, circular), stacks, queue (circular, priority, dqueue)
Sorting & searching: Insertion sort, selection sort, bubble sort, quicksort, mergesort, heapsort, shellsort, linear search;
Nonlinear data structure: Tree (Representation, binary tree (full, complete, balance), binary search tree), tree traversals
(post, in, pre), red-black tree, AVL tree
Advanced structure: Heap (max, min, binomial, fibonacci), hash (Chaining, Linear probing, Quadratic probing, Hash
tree);
Graphs: Representations (Adjacency Matrix, Adjacency list), Depth first search, Breadth first search;

16
References:
1. A H Aho, J E Hopcroft and J Ullman, Data Structures and Algorithms, Addison-Wesley
2. Horowitz, Sahni, and Anderson-Freed, Fundamentals of Data Structures in C, Universities Press
3. Seymour Lipschutz, Data Structures with C, SCHAUM SERIES, Tata McGraw-Hill
4. M A Weiss, Data Structures and Problem-Solving Using Java, Addison-Wesley
5. Robert Sedgewick, Algorithms in C++ Parts 1-5, Pearson Education, Third Edition

CS1061 Computer Organization and Architecture 3-0-0-6


Syllabus:
Review: History of computer architecture, combinational vs sequential logic, integer arithmetic: carry look-ahead,
booths algorithm, division (restoring and non-restoring) [Covered in EC101], Hardware description languages,
physical constraints (gate delay, fan-in, fan-out, energy/power). microcontrollers.
Instruction Set Architecture: Introduction to instruction set architecture, Basic organization of computing machine:
fetch, decode, and execute; Instruction set types, instruction format, addressing modes, subroutine call and return
mechanisms; Structure of machine-level programs; Low-level architectural support for high level languages.
Performance assessment; ARM Instruction Set and Intel X86 instruction set.
Computer Arithmetic: Representation of numeric data, signed and unsigned arithmetic; floating-point arithmetic
representation, arithmetic: addition, subtraction, multiplication, division; design of arithmetic and logic unit.
Processor Architecture: CISC vs RISC Designs, simple implementation schemes, data path design, control unit:
hardwired realization vs micro-programmed realization, multi-cycle implementation. Instruction level parallelism,
instruction pipelining, pipeline hazards.
Memory Architecture: Storage systems, memory architecture (static and Dynamic RAM; row and column
addressing; interleaving, banks), memory hierarchy: importance of temporal and spatial locality; main memory
organization, cache memory: address mapping, block size, replacement, and store policies; virtual memory system:
page table and TLB.
Interfacing and I/O Organization: External storage; Buses (daisy chaining; synchronous and asynchronous; point-to-
point; PCI, PCIe); IO fundamentals: handshaking, buffering, programmed IO, interrupt driven IO; Interrupt handling
mechanism, Buses: protocols, arbitration, direct memory access.
Texts:
1. David A. Patterson and John L. Hennesy, Computer Organization and Design: The Hardware Software
Interface, ARM Edition, 4th edition, Elsevier India, 2010.

References:
1. W. Stalling, Computer Organization and Architecture, PHI Publication
2. J.P. Hayes, Computer Architecture and Organization, Mc Graw Hill
3. A.S. Tanenbaum, Structured Computer Organization, PHI Publication
EC1013 Basic Electronic Circuits 3-0-0-6
Syllabus:
Course Topics - Examples of Electronic Systems: Music System, Radio, Television
Diodes and Applications: Semiconductor diode - ideal versus practical, resistance levels, diode equivalent circuits,

17
load line analysis; diode as a switch, diode as a rectifier, half wave and full wave rectifiers with and without filters;
clipping circuits, clamper circuits, breakdown mechanisms, Zener diode – operation and applications; regulated d-c
power supply.
Transistor Characteristics: Bipolar junction transistor (BJT) – construction, operation, amplifying action, common
base, common emitter and common collector configurations, operating point, voltage divider bias configuration;
Differential Amplifier.
Operational Amplifiers and Applications: Introduction to op-amp, characteristics of ideal op-amp, controlled source
models, classification, the operational amplifier (op-amp) as a linear active device, the VCVS model of an op-amp,
different amplifier configurations using op-amp, concept of virtual ground; op-amp operations, integrator and
differentiator, frequency response of op-amp and op-amp based amplifiers. CMRR, PSRR, slew rate; pin
configuration of 741 op-amp
Filters: Concepts of low-pass, high-pass and band-pass filters, ideal (brick-wall) filter response, frequency response
of simple RC filters, active RC filters using Op-amp.
Oscillators: Effects of negative and positive feedback of an amplifier, condition of harmonic oscillation, RC and LC
oscillator circuits.
Comparator: Op-amp as a comparator, digital inverters (TTL/CMOS) as comparators, comparator with hysteresis,
Schmitt trigger using Op-amp, 555 timer as a two dimensional comparator. Waveform generators: Concept of
bistable, monostable and astable circuits, timer and relaxation oscillator based on comparator and RC timing circuit,
square wave generator using 555 timer, crystal clock generator.
Data Converters: Sample and hold circuits, Digital to Analog Converter (DAC) using binary resistor scheme, R-2R
ladder DAC, DAC using switched current resources, Analog to Digital converter (ADC) using capacitor
charge/discharge: single-slope and dual-slope ADCs, ADC using counter and DAC, ADC using successive
approximation.
Texts:
1. Albert Malvino and David Bates, Electronic Principles, McGraw Hill Education; 2015.
References:
1. R. L. Boylestad and L. Nashelsky, Electronic Devices and Circuit Theory, Pearson Education, 2013.
2. Jacob Millman, Christos Halkias, Chetan Parikh, Millman's Integrated Electronics - Analog and Digital
Circuit and Systems, McGraw Hill Education; 2017
3. Adel S. Sedra, Kenneth C. Smith & Arun N. Chandorkar, Microelectronic Circuits, International Version 6th
Edition, 2013, Oxford University Press India

EC1112 Basic Electronics Lab 0-0-0-3


Experiments using diodes: Diode characteristics, design and analysis of half-wave and full-wave rectifier circuits
without and with filter, clipping circuits, clamper circuits,
Experiments using operational amplifier: Inverting amplifier, non-inverting amplifier, voltage follower, integrator,
differentiator, comparators, Multivibrators, Wien‘s Bridge Oscillator, first-order filters, D/A and A/D converters.

18
PH1012 Physics II 3-0-0-6
Syllabus:
Vector Calculus: Gradient, Divergence and Curl, Line, Surface, and Volume integrals, Gauss's divergence
theorem and Stokes' theorem in Cartesian, Spherical polar and cylindrical polar coordinates, Dirac Delta
function.
Electrostatics: Gauss's law and its applications, Divergence and Curl of Electrostatic fields, Electrostatic
Potential, Boundary conditions, Work and Energy, Conductors, Capacitors, Laplace's equation, Method of
images, Boundary value problems in Cartesian Coordinate Systems, Dielectrics, Polarization, Bound Charges,
Electric displacement, Boundary conditions in dielectrics, Energy in dielectrics, Forces on dielectrics.
Magnetostatics: Lorentz force, Biot-­­Savart and Ampere's laws and their applications, Divergence and Curl of
Magnetostatic fields, Magnetic vector Potential, Force and torque on a magnetic dipole, Magnetic materials,
Magnetization, Bound currents, Boundary conditions.
Electrodynamics: Ohm's law, Motional EMF, Faraday's law, Lenz's law, Self and Mutual inductance, Energy
stored in magnetic field, Maxwell's equations, Continuity Equation, Poynting Theorem, Wave solution of
Maxwell Equations.
Electromagnetic waves: Polarization, reflection & transmission at oblique incidences.

Texts:
1. Introduction to Electrodynamics by D. J. Griffiths, 3rd Ed., Prentice Hall of India, 2005.
2. Elements of Electromagnetics by M. N. O. Sadiku, Oxford, 2006.

References:
1. C. A. Balanis, Advanced Engineering Electromagnetics, 2nd Edition, John Wiley, 2012.
2. The Feynman Lectures on Physics, Vol.II by R. P. Feynman, R. B. Leighton and M. Sands, Narosa Publishing
House, 1998.

HS1091 Introduction to Entrepreneurship 2-0-0-4


Syllabus:
Meaning and Importance, Evolution, influencing factors (Psychological, Social, Economic, Environmental),
Characteristics, Types of entrepreneur (based business, technology, motivation, growth, stages), Myths & Barriers.
Meaning and concept of E-cells, advantages to join E-cell, significance of E-cell, various activities conducted by E-
cell, case studies (including success and failure stories) and comparative analysis, Rules And Legislation
(Applicability of Legislation; Industries Development (Regulations) Act, 1951; Factories Act, 1948; The Industrial
Employment (Standing Orders) Act, 1946; Suspension; Stoppage of work; Termination of employment;
Environment (Protection) Act, 1986; The sale of Goods Act, 1950; Industrial Dispute Act 1947; GST; Central
Excises Act, 1944
Why to become entrepreneur, the skills/ traits required to be an entrepreneur, Creative and Design; Thinking, the
entrepreneurial decision process, skill gap analysis, and role models, mentors and support; system,Introduction to
various form of business organization (sole proprietorship, partnership; corporations, Limited Liability company),
mission, vision and strategy formulation.
Assistance to an entrepreneur: Industrial Park (Meaning, features, & examples), Special Economic Zone (Meaning,
features & examples), Financial assistance by different agencies, MSME Act Small Scale Industries, Carry on
Business (COB) license, Environmental Clearance, National Small Industries Corporation (NSIC), Government

19
Stores Purchase scheme (e-tender process), Excise exemptions and concession, Exemption from income tax,
Quality Standards with special reference to ISO, Small Industries Development Bank of India (SIDBI), State Small
Industries Development Corporation (SSIDC), Directorate General of Supplies and Disposals, Khadi and Village
Industries Commission (KVIC)
Importance of communication, barriers and gateways to communication, listening to people, the power of talk,
personal selling, risk taking \& resilience, negotiation.
Text:
1. Introduction to Entrepreneurship, Commonwealth of Learning;
http://oasis.col.org/bitstream/handle/11599/2465/2011_VUSSC_Intro-to-
Entrepreneurship.pdf?sequence=1&isAllowed=y
References:
1. Entrepreneurship, Michael Laverty & Chris Littel,
https://openstax.org/books/entrepreneurship/pages/preface
2. Introduction to Entrepreneurship; Katherine Carpenter, University of Victoria;
https://open.umn.edu/opentextbooks/textbooks/introduction-to-entrepreneurship

EN1012 English Language Skills II 2-0-2-6


Syllabus:
Introduction to Communication: need for effective communication; the process of communication; significance of
technical communication; barriers to communication.
Listening Skills: listening as an active skill; listening for specific information; developing effective listening skills;
barriers to effective listening skills.
Reading Skills: skimming; scanning; understanding the gist of an argument; identifying the topic sentence; inferring
lexical and contextual meaning.
Writing Skills: sentence formation; use of appropriate diction; paragraph and essay writing; coherence and cohesion;
technical writing; letter writing; job application; report writing.
Speaking Skills: non-verbal communication; group discussion; presentation skills; technology-based communication.
Texts:
1. V.N. Arora and Lakshmi Chandra. Improve Your Writing. New Delhi: OUP, 1981.
2. Marilyn Anderson, Pramod K. Nayar, and Madhucchanda Sen. Critical Reasoning, Academic Writing and
Presentation Skills. Rev. ed. New Delhi: Longman-Pearson, 2010.
3. Allan Pease and Barbara Pease. The Definitive Book of Body Language. New Delhi: Manjul Publishing
House, 2005.
References:
1. F.T. Wood. A Remedial English Grammar for Foreign Students. New Delhi: Macmillan, 1965.
2. Nitin Bhatnagar and Mamta Bhatnagar. Communicative English for Engineers and Professionals. Pearson.
3. N. Krishnaswami and T. Sriraman. Current English for Colleges. Chennai: Macmillan, 1990.
4. N. Krishnaswami and T. Sriraman. Creative English for Communication. 2nded. New Delhi: Macmillan, 2009.

20
5. Michael Swan. Practical English Usage. 3rd ed. Oxford: OUP, 2005.
6. Michael Swan and Catherine Walter. Oxford English Grammar Course: Advanced. Oxford: OUP, 2011.

JA1012 Japanese Language Skills II 2-0-2-6


Module I: Be able to express one’s wants and desires, also be able to give simple requests, instructions
and recommendations. Be able to understand prohibitions and rules, and also to be able to
describe people, things, places, etc.
Module II: Be able to talk easily about potential and hobbies. Also be able to express the transformation
of things and people.
Module III: Be able to understand the difference between polite and informal sentences, as well as to be
able to use casual sentences and the context. Be able to use indirect sentences
Module IV: Be able to explain what action to perform at what time.Deeper understanding of the usage of
respected forms of Japanese .Be able to use conditional forms.
Texts:

1. Minna No Nihongo Main Textbook Elementary1-2 (Goyal Publications)


2. Minna No Nihongo Translation and Grammatical Notes in English Elementary 1-2 (Goyal
Publications)
3. Minna no Nihongo 1 Kanji Eigo Ban (3A corporation)
4. Minna no Nihongo (3A corporation)
5. Listening materials (3A corporation website)

KO1012 Korean Language Skills II 2-0-2-6


Module I: Talking about the past
Talking about Seasons and Weather / Negating
Module II: Asking and telling the date, day, and time
Making suggestions/promises
Module III: Asking and answering about weekend activities
Talking about studying Korean
Module IV: Talking about future plans
Texts:
1. Sejong Korean 1(King Sejong Institute Foundation, Seoul) & Workbook

21
Semester-III

Sem. Course Code Course Name L T P C


III CS2021 Discrete Mathematics 3 1 0 8
III CS2014 Design and Analysis of Algorithms 3 0 0 6
III CS2013 Object Oriented Programming 3 0 0 6
III CS2041 Operating Systems 3 0 0 6
III EC2031 Signals and Systems 3 0 0 6
III MA2013 Probability and Random Processes 3 0 0 6
III CS2113 Object Oriented Programming Lab 0 0 3 3
III CS2141 Operating System Lab 0 0 3 3
III EC2131 Signals and Systems Lab 0 0 3 3
Total 18 1 9 47
Contact Hours / Week 28
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- 6 -- 41 -- -- --

CS2021 Discrete Mathematics 3-1-0-8

Syllabus:

Sets and Sequences: Data Models: Finite Sets, Power Set, Cardinality of finite sets, Cartesian Product, Properties
of Sets, Vector Implementations of Sets. Introduction to Logic. Propositional Logic, Truth tables, Deduction,
Resolution, Predicates and Quantifiers, Mathematical Proofs. Infinite sets, well-ordering. Countable and
Uncountable sets, Cantor's diagonalization. Mathematical Induction - weak and strong induction.
Relational Structures on Sets : Relations & Graphs : Relations and their properties, n-array relations and their
applications, Equivalence of relations, partial ordering. Functions, Bijections. Binary relations and Graphs.
Posets and Lattices, Lattice and algebra system, principles of duality, basic properties of algebraic systems
defined by lattices, distributive and complimented lattices, Boolean lattice and Boolean algebra.
Sizes of Sets : Counting & Combinatorics : Counting, Sum and product rule, Principle of Inclusion Exclusion.
Pigeon Hole Principle, Counting by Bijections. Double Counting. Linear Recurrence relations - methods of
solutions. Generating functions, partitions of integers, exponential generating function. Permutations and
counting.
Structured Sets : Algebraic Structures : Structured sets with respect to binary operations. Groups, Semigroups,
Monoids. Rings, and Fields. Vector Spaces, Basis.
Graphs and Tree – Introduction, Isomorphism, Sub graphs, Walks, Paths, Circuits, Connectedness, Euler graphs,
Hamiltonian paths and circuits, Trees, Properties of trees, Distance and centers in tree – Rooted and binary trees;
Spanning trees, Fundamental circuits, Spanning trees in a weighted graph, cut sets, Properties of cut set,
Fundamental circuits and cut sets; Connectivity and separability, Network flows, 1-Isomorphism, 2-
Isomorphism, Combinational and geometric graphs, Planer graphs, Different representation of a planer graph.
Texts:
1. K. H. Rosen, Discrete Mathematics and its Applications, Tata McGraw-Hill, 2009

22
2. J. P. Tremblay and R. P. Manohar, Discrete Mathematical structures with Applications to Computer
Science, Tata McGraw-Hill, 2001
References:
1. Ronald Graham, Donald Knuth, and Oren Patashnik, Concrete Mathematics, Pearson Education
Publishers, 1996
2. J. L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed., Jones and Bartlett, 2010
3. R. C. Penner, Discrete Mathematics: Proof Techniques and Mathematical Structures, World Scientific,
1999

CS2014 Design and Analysis of Algorithms 3-0-0-6

Syllabus:
Models of Computation: space and time complexity measures, lower and upper bounds; Design techniques: the greedy
method, divide-and-conquer, dynamic programming, backtracking, branch and bound; Lower bound for sorting;
Selection; Graph Algorithms: connectivity, topological sort, shortest paths, minimum spanning trees, network flow;
The disjoint set union problem; String matching; NP-completeness; Introduction to approximate algorithms and
Randomized algorithms.

Texts:
1. T H Cormen, C E Leiserson, R L Rivest and C Stein, Introduction to Algorithms, MIT Press, 2001.
References:
1. Jon Kleinberg and Eva Tardos, Algorithm Design, Addison Wesley, 2005
2. A Aho, J E Hopcroft and J D Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley,
1974.
3. S Sahni, Data Structures, Algorithms and Applications in C++, McGraw-Hill, 2001.
4. M T Goodrich and R Tamassia, Algorithm Design: Foundations, Analysis and Internet Examples, John Wiley
& Sons, 2001.

CS2013 Object Oriented Programming 3-0-2-8


Syllabus:
Review of programming practices and code-reuse; Object model and object-oriented concepts: Data Abstraction:
Class, object, constructors, destructors, memory allocations for objects, member functions, friend functions, templates.
Inheritance: Single & multiple inheritance, virtual base class. Polymorphism: Compile time polymorphism: operator
overloading, function overloading, static binding. Run-time polymorphism: Virtual function, pure virtual function,
abstract class, dynamic binding. Exception handling. Object-oriented programming languages and implementation.
File handling.
Texts:
1. E Balaguruswamy: Object Oriented Programming with C++, McGraw Hill
2. Grady Booch: Object Oriented Analysis and Design, Pearson Education.
References:
1. Herbert Schild: The Complete Reference to C++, Osborne Mc Graw Hill.
2. Bertrand Meyer, Object Oriented Software Construction, Prentice-Hall.
3. Bjarne Stroustrup: The C++ Programming Language, Addison Wesley
4. Rambaughet al.: Object Oriented Modeling and Design, PHI(EEE).

CS2041 Operating Systems 3-0-2-8

Syllabus:
Process Management: process, thread, scheduling; Concurrency: mutual exclusion, synchronization, semaphores,

23
deadlocks; Memory Management: allocation, protection, hardware support, paging, segmentation; Virtual Memory:
demand paging, allocation, replacement, swapping, segmentation, TLBs; File Management: naming, file operations
and their implementation; File Systems: allocation, free space management, directory management, mounting; I/O
Management: device drivers, disk scheduling, Basics of Security.

Texts:
1. Silberschatz, A. and Galvin, P.B. Operating System Concepts, Wileys

References:

1. Stalling, W. Operating Systems: Internals and Design Principles, Pearson


2. Tanenbaum, A. S. Modern Operating System, Pearson
3. Dhamdhere, D.M. Operating Systems A Concept Based Approach, Mc Graw Hill

EC2031 Signals and Systems 3-0-0-6

Syllabus:
Signals: Signal Basics, Elementary signals, classification of signals; signal operations: scaling, shifting and inversion;
signal properties: symmetry, periodicity and absolute integrability; Sampling and Reconstruction, Sampling and
Nyquist theorem, aliasing, signal reconstruction: ideal interpolator, zero-order hold, first-order hold; Sinc function,
Practical reconstruction, group delay, phase delay.

Systems: classification of systems; Time-Domain Analysis of Continuous-Time Systems; system properties: linearity,
time/shift-invariance, causality, stability; continuous-time linear time invariant (LTI) and discrete-time linear shift
invariant (LSI) systems: impulse response and step response; response to an arbitrary input: convolution; circular
convolution; system representation using differential equations; Eigen functions of LTI/ LSI systems, frequency
response and its relation to the impulse response; correlation and cross correlation of two sequences.

Signal representation: signal space and orthogonal basis; continuous-time Fourier series and its properties; continuous-
time Fourier transform and its properties; Parseval‘s relation, time-bandwidth product; discrete time Fourier series;
discrete-time Fourier transform and its properties; relations among various Fourier representations. Linear
Convolution using DFT. Fast Fourier Transform (FFT);

Laplace transform and properties, Inverse Laplace Transform by Partial Fraction and Z-transform: definition, region
of convergence, properties; transform-domain analysis of LTI/LSI systems, system function: poles and zeros; stability,
inverse Z-Transform by Partial Fraction.

Text:
1. M. J. Roberts,‖ Fundamentals of Signals and Systems‖, 1st Edition, Tata McGraw Hill, 2007.
2. A.V. Oppenheim, A.S. Willsky and H.S. Nawab,‖ Signals and Systems‖, 2nd Edition Prentice Hall of India,
2006.
References:
1. R.F. Ziemer, W.H. Tranter and D.R. Fannin,‖ Signals and Systems - Continuous and Discrete‖, 4th Edition,
Prentice Hall, 1998.
2. Simon Haykin, Barry van Veen,‖ Signals and Systems‖, 2nd Edition, John Wiley and Sons, 1998.
3. TarunRawat, ―Signals and Systems‖, Oxford University Press.

MA2013 Probability and Random Processes 3-0-0-6

Syllabus:

Introduction to probability: mathematical background - sets, set operations, sigma and Borel fields; classical,
relative-frequency and axiomatic definitions of probability; conditional probability, independence, total

24
probability, Bayes rule; repeated trials;
Random variables: Cumulative distribution function, continuous, discrete and mixed random variables,
probability mass function, probability density functions; functions of a random variable; expectation - mean,
variance and moments; characteristic and moment-generating functions; Chebyshev, Markov and Chernoff
bounds; special random variables-Bernoulli, binomial, Poisson, uniform, Gaussian and Rayleigh; joint
distribution and density functions; Bayes rule for continuous and mixed random variables; joint moments,
conditional expectation; covariance and correlation- independent, uncorrelated and orthogonal random variables;
function of two random variables; sum of two independent random variables; random vector- mean vector and
covariance matrix, multivariate Gaussian distribution; Vector-space representation of Random variables, laws of
large numbers, central limit theorem;
Random process: discrete and continuous time processes; probabilistic structure of a random process; mean,
autocorrelation and autocovariance functions; stationarity- strict-sense stationary and wide-sense stationary
(WSS) processes: autocorrelation and cross-correlation functions; time averages and ergodicity; spectral
representation of a real WSS process-power spectral density, cross-power spectral density, Wiener Khinchin
theorem, linear time-invariant systems with WSS process as an input time and frequency domain analyses;
spectral factorization theorem;
Examples of random processes: white noise, Gaussian, Poisson and Markov processes, Basics of Queuing
Theory, Characteristics of queuing systems.

Texts:
1. Papoulis and S.U. Pillai, Probability Random Variables and Stochastic Processes, 4/e, McGraw-Hill,
2002.
2. A. Leon Garcia, Probability and Random Processes for Electrical Engineering, 2/e, Addison-Wesley,
1993.
References:
1. H. Stark and J.W. Woods, Probability and Random Processes with Applications to Signal Processing,
3/e, Prentice Hall, 2002.
2. John J. Shynk, Probability, Random Variables, and Random Processes: Theory and Signal Processing
Applications, 1/e, Wiley publications, 2012.

CS2141 Operating Systems Lab 0-0-3-3


Lab Assignment:

Implementation of CPU scheduling, Shared memory and IPC, Semaphores, file allocation strategies, File
Organization Techniques, Dead Lock Avoidance & Detection, page replacement algorithms, Threading &
Synchronization

Assignment on fork, shared memory and IPC, scheduling, deadlock, resource allocation graph, page replacement
algorithms, disc scheduling
Reference Book:
1. Silberschatz, A. and Galvin, P.B. Operating System Concepts, Wileys.
2. Stalling, W. Operating Systems: Internals and Design Principles, Pearson
3. Tanenbaum, A. S. Modern Operating System, Pearson
4. Richard Stevens, Unix Network Programming, Volume 2, Second Edition: Interprocess Communications,
Prentice Hall.

25
CS2113 Object Oriented Programming Lab 0-0-3-3
Lab Assignment:

Implementation of class and Object creation, Constructors, Abstract classes and Abstract methods, Inheritance,
overloading- operator & function, Exception Handling, Packages, File Handling, Multi-Threading, Graphic
Classes
Reference Book:
1. Grady Booch: Object Oriented Analysis and Design, Pearson Education.
2. E Balaguruswamy : Object Oriented Programming with C++, McGraw Hill
3. Herbert Schild : The Complete Reference to C++, Osborne Mc Graw Hill.
4. Bjarne Stroustrup: The C++ Programming Language, Addison Wesley
5. Bertrand Meyer, Object Oriented Software Construction, Prentice-Hall.

EC2131 Signals and Systems Lab 0-0-3-3

Syllabus:

Introduction to computation platforms: GNU Octave, SciLab, MATLAB.

Signals: Generation of Continuous and Discrete time signals (Unit step, Impulse, Ramp, Exponential and
Sinusoidal etc.); simulation of basic operations on signals (Folding, scaling, shifting, addition, subtraction,
multiplication etc.); finding the even and odd parts of a signal; computing whether the given system is linear or
not; computation of Sampling theorem;

Systems: Computation of output response of two sequences x(n) and h(n) using: a) Linear Convolution, b)
Circular Convolution, c) Circular Convolution with zero padding; computation of Cross correlation of two
sequences; Signal representation: Fourier Series Evaluation for Square Wave Function; Discrete Time Fourier
Transform (DTFT); DFT and IDFT of the sequences x(n) and X(k); computation of L-transform transfer function
for a given input; computations of Z-transform transfer function for a given input.

Reference:

1. V. K. Ingle and J. G. Proakis, ―Digital Signal Processing with MATLAB‖, Cengage, 2008.

26
SEMESTER-IV
Sem. Course code Course Name L T P C
IV CS2022 Theory of Computing 3 0 0 6
IV CS2042 Software Engineering 3 0 0 6
IV CS2031 Computer Networks 2 1 2 8
IV CS2043 Database Management Systems 2 1 2 8
IV CS2015 Web Technology 2 1 2 8
IV EC2032 Digital Signal Processing 2 1 2 8
IV EC2071 Microprocessor 2 1 0 6
Total 17 4 8 50
Contact Hours / Week 29
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- 50 -- -- --

CS2022 Theory of Computing 3-0-0-6


Finite Automata – deterministic and non-deterministic, regular operations, Regular Expression, Equivalence of DFA,
NFA and REs, closure properties, Non regular languages and pumping lemma, DFA Minimization, CFGs, Chomsky
Normal Form, Non CFLs and pumping lemma for CFLs, PDAs, Equivalence of PDA and CFG, Properties of CFLs,
DCFLs, Turing Machines and its variants, Configuration graph, closure properties of decidable languages, decidability
properties of regular languages and CFLs, Undecidability, reductions, Rice‘s Theorem, introduction to complexity
theory.
Text:
1. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages and computation,
Pearson / Addison Wesley
References:
1. Michael Sipser, Introduction to the Theory of Computation, Cengage Learning India Private Limited
2. H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, PHI Learning.

CS2042 Software Engineering 3-0-0-6


Software Engineering Principles: Overview of the software engineering discipline, Software lifecycle models, Agile
development, The Unified Process(UP), Organizing development projects
Requirements Engineering: Documenting requirements, user stories, use cases and scenarios Introduction to UML:
Review of object-oriented principles, UML use case, class, sequence, activity, state, component and deployment
diagrams. UML models
The Analysis and Design Process: User story realisation, Object- oriented modelling, Incremental refinement, Design
Principles: Software architecture, Separation of concerns, Design patterns, Object-Oriented design practices,
Refactoring,
Testing: Unit Testing, Test-Driven Development, Functional Testing.

27
Text:
1. R. S Pressman, Software Engineering: A Practioner‘s Approach, McGraw-Hill
References:
1. Sommerville, Software Engineering, Addison-Wesley.
2. Jim Arlow, Ila Neustadt. UML and the Unified Process Addison Wesley.
3. Grady Booch, James Rumbaugh, Ivar Jacobson: The Unified Modeling Language User Guide, Addison Wesley.

CS2031 Computer Networks 2-1-2-8


Network Basics: Evolution of computer networks; Network Models, Network Media, LAN, MAN and WAN, needs
and goals of networking topology, network architecture, need for protocols, OSI Reference Model, layer services,
primitives and service access points Data link layer: Framing, HDLC, PPP, sliding window protocols, medium access
control, Token Ring, Wireless LAN; Virtual circuit switching: Frame relay, ATM; Network Layer: Internet
addressing, IP, ARP, ICMP, CIDR, routing algorithms (RIP, OSPF, BGP); Transport Layer: UDP, TCP, flow control,
congestion control; Introduction to quality of service; Application Layer: DNS, Web, email, authentication,
encryption.
Lab: Unix network measurement and analysis tools, Wireshark, Socket interface and programming, RPC, RMI,
HTML, HTTP, CGI, XML, Assignments using Network Simulators
Text:
1. Andrew S. Tanenbaum, ‗Computer Networks‘, Prentice Hall
References:
1. Forouzan, Data Communications and Networking, Tata Mcgraw Hill
2. Stevens, UNIX Network Programming, Volume 1: Networking APIs: Sockets and XTI, 2nd Ed, Prentice Hall
3. Panwar, Mao, Ryoo, and Li, TCP/IP Essentials: A Lab-based Approach, Cambridge Press

CS2043 Database Management Systems 2-1-2-8


Databases: Introduction, Introduction to the Relational Model, Introduction to SQL, Intermediate SQL, Advanced
SQL, Formal Relational Query Languages.
Database Design: ER Model, Functional Dependencies, Schema Design, Normal Forms. Data Storage and Querying:
Storage and File Structure, Indexing and Hashing, Query Processing, Query Optimization. Transaction Management:
Transactions, Concurrency Control, Recovery System. System Architecture: Database System Architecture, Parallel
Databases, Distributed Databases. Advanced Topics: Data Warehousing and Mining, Information Retrieval, XML.
Lab: Using a relational DBMS: Writing SQL queries, accessing a DBMS from an external application. Implementing
of parts of DBMS such as various file organizations, indexing methods (Tree/ Hash/ Bitmap), external sorting
algorithms, and concurrency control schemes. Nonrelational DBMS; performance comparison of a non-relational
DBMS with a relational DBMS for an application.
Text:
1. Database System Concepts - Silberschatz, Korth & Sudarshan, McGraw-Hill.
2. Fundamentals of Database Systems, Elmasri, Ramez; Navathe, Shamkant, Addison Wesley.
References:
3. An Introduction to Database Systems - CJ Date, Addison-Wesley.

28
4. Database Systems: The Complete Book - Gracia-Molina, Ullman, Widom, Pearson.
5. H. Garcia-Molina, J. Ullman, J. Widom, Database System Implementation, 2nd Edition, Pearson, 2002.
6. J. Groff and P. Weinberg, SQL Complete Reference, McGraw Hill, 3rd Edition, 2017.
7. P. Sadalage and M. Fowler, NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence,
Addison Wesley, 2012.

CS2015 Web Technology 2-1-2-8


HTML5, CSS3 and XML: Introduction to markup language, elements of Html5, controlling of Form elements,
Dynamic graphics (canvas, SVG, etc.), controlling of audio and video elements; Introduction to CSS, type, elements
and their attributes, layout, controlling of motion and colours; Introduction to XML, Defining XML tags, their
attributes and values, Document type definition, XML Schema, Document Object model, XHTML, Parsing XML
Data (DOM and SAX parser), UI framework: Bootstrap 4
Client Side Scripting: Introduction to JavaScript, declaring variables, scope of variables functions, event handlers (on
click, on submit etc.), Document Object Model, Form validations. JavaScript Frameworks - ReactJS, AngularJS,
VueJS, architures, Model-view-controller, virtual DOM
Server Side Scripting: Using stack: introduction to Node.JS, ExpressJS, MongoDB, Data Flow in MEAN and MERN
stack, architures, example application; Using PHP: Introduction to PHP, Declaring variables, data types, arrays,
strings, operations, expressions, control structures, functions, Reading data from web form controls like Text Boxes,
radio buttons, lists etc., Handling File Uploads, Connecting to database (MySQL/MariaDB as reference), executing
simple queries, handling results, Handling sessions and cookies; File operations like opening, closing, reading,
writing, appending, deleting etc. on text and binary files, listing directories.
Lab: Unix network measurement and analysis tools, Wireshark, Socket interface and programming, RPC, RMI,
HTML, HTTP, CGI, XML, Assignments using Network Simulators
Text:
1.Internet and World Wide Web – How to program, Dietel and Nieto, Pearson
2. Matthew MacDonald, ‖Creating a Website - The Missing Manual‖, 4th ed, 2015, O‘Reilly.
3. Programming world wide web, R.W. Sebesta. Fourth Edition, Pearson
References:
1. Greg Lim, Beginning MERN Stack: Build and Deploy a Full Stack MongoDB, Express, React, Node.js App
2. Cris Bates, Web Programming: Building Internet Applications, 3ed, Wiley
3. HTML5, CSS3, JavaScript, PHP Tutorials http://www.w3schools.com
4. jQuery Tutorial https://learn.jquery.com
5. MongoDB Tutorial and Certifications https://university.mongodb.com
6. Express https://expressjs.com/en/starter/installing.html
7. React Tutorialhttps://reactjs.org/tutorial/tutorial.html
8. Node https://nodeschool.io

EC2032 Digital Signal Processing 2-1-2-8

Syllabus:
Frequency selective filters: Ideal filter characteristics, lowpass, highpass, bandpass and bandstop filters, Paley-
Wiener criterion, digital resonators, notch filters, comb filters, all-pass filters, inverse systems, minimum phase,

29
maximum phase and mixed phase systems.
Structures for discrete-time systems: Signal flow graph representation, basic structures for FIR and IIR systems
(direct, parallel, cascade and polyphase forms), transposition theorem, ladder and lattice structures.
Design of FIR and IIR filters: Design of FIR filters using windows, frequency sampling, Remez algorithm and least
mean square error methods; Design of IIR filters using impulse invariance, bilinear transformation and frequency
transformations.
Discrete Fourier Transform (DFT): Computational problem, DFT relations, DFT properties, fast Fourier transform
(FFT) algorithms (radix-2, decimation-in-time, decimation-in-frequency), Goertzel algorithm, linear convolution
using DFT. Multi-dimensional DFT (M-D DFT) and its computation.
Finite word length effects in digital filters: Fixed- and floating-point representation of numbers, quantization noise
in signal representations, finite word-length effects in coefficient representation, roundoff noise, SQNR
computation and limit cycle.
Introduction to multirate signal processing: Decimation, interpolation, polyphase decomposition, non-integer
sample rate conversion, multistage sample rate conversion; Applications of multi-rate filters in signal processing
and communication.
Lab Assignments:
Computation platforms: GNU Octave, SciLab, MATLAB.
Hardware platforms: Texas Instruments OMAP-L138/C6748 Development Kit (LCDK) with XDS100V3 Emulator.
Discrete Fourier Transform and Signal representation: n-point DFT and IDFT; Rationalization of Z- function,
sketching of Pole-Zero plot and plotting of magnitude and phase response of causal system.
Generation of signals: (i) ramp signals at different sampling frequencies, (iii) multi-toned sinusoid signals, (iv)
pseudo random noise sequence; Echo generation using three different delay.
Frequency selective filters: Understanding the concept of Filtering a noisy sinusoid using convolution in Time
Domain and Frequency domain; Evaluation of frequency responses of filters using various window techniques.
Design of filters (Butterworth and Chebyshev LP, BP and HP): FIR filters and IIR filters (Bilinear Transformation
and Impulse Invariance Method).
Audio Signal Processing: Audio loop, Audio Delay, Audio Echo.
Text:
1. S. K. Mitra,‖ Digital Signal Processing: A Computer- Based Approach‖, Tata McGraw Hill, 3/e, 2006.
References:
1. Richard G. Lyons, ―Understanding Digital Signal Processing‖, Prentice Hall, 3/e, 2011.
2. S. Salivahanan, A. Vallavaraj, C. Gnanapriya,‖ Digital Signal Processing‖, Tata McGraw Hill, New Delhi,
2003.
3. J. G. Proakis and D. G. Manolakis,‖ Digital Signal Processing: Principles, Algorithms and Applications‖,
Pearson Education, 4/e, 2007.
4. E. Ifeachor and B. Jervis,‖ Digital Signal Processing‖, Pearson, 2/e, 2006.
5. A. V. Oppenheim and R. W. Shafer, ―Discrete-Time Signal Processing‖, Prentice Hall India, 2/e, 2004.
6. V. K. Ingle and J. G. Proakis, ―Digital Signal Processing with MATLAB‖, Cengage, 2008.
7. M.H. Hayes, ―Schaum's Outline on Digital Signal Processing‖, McGraw-Hill, 1999.

30
EC2071 Microprocessor 2-1-0-6
Microprocessors: Evolution of Microprocessors, Basic functional blocks of a microprocessor, microprocessor-based
systems, concept of multiplexing in microprocessor.
Architecture of 8-bit Microprocessor: Intel 8085/8086 microprocessor, pin description and internal architecture,
comparison with 8-bit processor.
Instruction Set of x86: Assembly language fundamentals, Machine cycles, instruction format, addressing modes,
instruction set, classification, Data Transfers instructions, arithmetic and logical instructions, String manipulating
instructions, control transfer instructions, processor control instructions, flags, assembly language programming using
8086.
Peripheral Devices and Interfacing: Memory and I/O interfacing, 8255 Interfacing examples, interfacing of DC and
stepper motors, interfacing of key board, display, USART.
Lab Assignments:
Software experiments using an 8085/8086 Kit to learn its instruction set. Hardware experiments for the use of
peripherals like 8251 (USART). Experiments to learn Port IO, control of on chip peripherals such as timers,
interfacing with off chip peripherals such as LCD displays, Key boards, Stepper motors and ADC chips. Experiments
for the use of other microcontrollers such as PIC using development boards.
Text:
1. R.S. Gaonkar, Microprocessor Architecture, Programming, and Applications with the 8085, Penram
International Publishing, Fifth Edition, 2011.
References:
1. Nagoor Kani, Microprocessors and Microcontrollers, The McGraw-Hill Companies, 2nd Edition
2. J.H. Hennessy, and D.A. Patterson, Computer Architecture: A Quantitative Approch, Morgan Kaufmann
Publishers, Fourth Edition, 2006.
3. Kenneth J. Ayala, The 8051 Microcontroller, Architecture, Programming and Applications, Penram
International Publishing, 1996.
4. Hall D. V., ―Microprocessor and Interfacing-Programming and Hardware‖, 2nd Ed., Tata McGraw-Hill
Publishing Company Limited, 2008

31
SEMESTER-V
Sem. Course Code Course Name L T P C
V CS3051 Artificial Intelligence 3 0 0 6
V CS3044 Compiler Design 3 0 2 8
V CS3032 Data Communication and Internet Protocol 3 0 0 6
V CS30XX Professional Elective – I 3 0 0 6
V CS30XX Open Elective - I 3 0 0 6
V HS30XX HSS Elective – I 3 0 0 6
V CS3201 Project-I 0 0 4 4
Total 21 0 8 48
Contact Hours / Week 27
Total Humanities & Basic Basic Open
Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit 6 -- -- 26 6 6 4

CS3051 Artificial Intelligence 3-0-0-6


Intelligent Agents: Introduction to AI – Agents and Environments, Concept of rationality, Nature of environments,
Structure of agents; Problem solving agents – search algorithms, uninformed search strategies.
Problem Solving: Heuristic search strategies – heuristic functions; Local search and optimization problems – local
search in continuous space – search with nondeterministic actions – search in partially observable environments –
online search agents and unknown environments.
Game Playing and Constraint Satisfaction Problems: Game theory – optimal decisions in games – alpha-betasearch –
monte-carlo tree search – stochastic games – partially observable games; Constraint satisfaction problems (CSP) –
constraint propagation – backtracking search for CSP – local search for CSP – structure of CSP
Logical Agents: Knowledge-based agents – propositional logic – propositional theorem proving – propositional
model checking – agents based on propositional logic; First-order logic – syntax and semantics – knowledge
representation and engineering – inferences in first-order logic – forward chaining – backward chaining –
resolution.
Knowledge Representation And Planning: Ontological engineering – categories and objects – events – mental
objects and modal logic – reasoning systems for categories – reasoning with default information; Classical
planning – algorithms for classical planning – heuristics for planning – hierarchical planning – non-deterministic
domains – time, schedule, and resources – analysis.
Text Books:
1. Stuart Russel and Peter Norvig, Artificial Intelligence: A Modern Approach, Fourth Edition, Pearson
Education, 2020.
2. Kevin Night, Elaine Rich, and Shivashankar B. Nair, Artificial Intelligence, McGraw Hill Education, 3rd
Ed, 2017.

32
Reference Books:
1. Deepak Khemani, Artificial Intelligence, Tata McGraw Hill Education, 2013.
2. Artificial Intelligence by Example: Develop machine intelligence from scratch using real artificial intelligence
use cases - by Dennis Rothman, 2018.

CS3044 COMPILER DESIGN 3-0-2-8


Compilers and translators, different phases of a compiler; Lexical analysis: specification of tokens, recognition of
tokens, input buffering, automatic tools; Syntax analysis: context free grammars, top down and bottom up parsing
techniques, construction of efficient parsers, syntax-directed translation, automatic tools; Semantic analysis:
declaration processing, type checking, symbol tables, error recovery; Intermediate code generation: run-time
environments, translation of language constructs; Code generation: flow-graphs, register allocation, code generation
algorithms; Introduction to code optimization techniques.

Text Books:
1. A. V. Aho, L.S. Monica R. Sethi and J. D. Ullman, Compilers: Principles, Techniques, and Tools, 2nd Ed.,
Prentice Hall, 2009

Reference Books:
1. V. Raghavan, Principles of Compiler Design, McGrawHill, 2010.
2. C.N. Fischer and R.J. Le Blanc, Crafting a Compiler with C, Pearson Education, 2009

CS3032 DATA COMMUNICATION & INTERNET PROTOCOL 3-0-0-6


Basics of Digital communications: Signals, noise, Nyquist rate, Shannon capacity;
Analog Transmission: Modulation techniques, Fundamentals of modems, FDM; Digital
transmission: PCM,
Transmission media: Guided (twisted pair, coaxial, fiber optic) and Unguided media;
Balanced and Local area networks: Ethernet, Fast Ethernet, Introduction to Gigabit Ethernet and WLANs,
Hubs, Internet Protocols, Routing Protocols and Transport Protocols.

Text Books:
1. W. Stallings, Data and Computer Communications, 8th Ed., Pearson India, 2007

Reference Books:
1. S. Tanenbaum, Computer Networks, 4th Ed., Pearson India, 2003.
2. B. Forouzan, Data Communications and Networking, 4th Ed., Tata Mcgraw Hill, 2006.
3. J. Quinn, Digital Data Communications, 1st Ed., Prentice Hall Career and Technology, 1995.
4. P. C. Gupta, Data Communications and Computer Networks, 2nd Ed., Prentice Hall of India, 2009.
5. F. Halsall, Data Communications, Computer Networks and Open Systems, 4th Ed., Addison Wesley, 1996.
6. Adrian Farrel, The Internet and Its Protocols: A Comparative Approach(The Morgan Kaufmann Series in
Networking), 2004.

33
Online resource:
1. Lydia Parziale et. al. TCP/IP Tutorial and Technical Overview, https://www.redbooks.ibm.
com/pubs/pdfs/redbooks/gg243376.pdf

CS3201 Project-I 0-0-4-4


The aim of this project-based learning course is to implement and integrate concept/courses covered till 4th semester
including Computer organisation, Database, Network, Operating systems, Algorithm, Software engineering etc. Do not
encourage students to implement machine learning based project in this course.
Permissible implementation environments are *NIX, C, C++, Go, Octave, Scilab, Java, JavaScript, PhP, HTML/CSS.

34
SEMESTER-VI
Sem. Course Code Course Name L T P C
VI CS3071 Computer Graphics 3 0 2 8
VI CS3053 Statistical Machine Learning 3 0 0 6
VI CS3033 Cyber Security 3 0 0 6
VI CS30XX Professional Elective – II 3 0 0 6
VI CS30XX Open Elective - II 3 0 0 6
VI CS3023 Optimization Techniques 3 0 0 6
VI HS30XX HSS Elective II 3 0 0 6
VI HS3092 Employability Skills (Audit) 1 0 3 0
VI CS3202 Project - II 0 0 4 4
Total 22 0 9 48
Contact Hours / Week 31

Total Humanities & Basic Basic Open


Professional Professional Internship
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) / Project
Credit (HS) (BS) (BE) (OE)
Credit 6 -- -- 26 6 6 4

CS3071 COMPUTER GRAPHICS 3-0-2-8


Introduction: Graphics input and output devices; Raster scan and random scan devices.
Output primitives: Points, lines; Line/circle/ellipse-drawing algorithms.
Filled area primitives: Scan line polygon fill algorithm; Boundary-fill and flood-fill algorithms.
2D geometrical transformation: Translation, rotation, scaling, reflection, shear; Matrix representations.
2D viewing: Viewing pipeline; Viewing coordinate reference frame; Window-viewport coordinate transformation;
Line/polygon, clipping algorithms.
3D object representation: Polygon surfaces and quadric surfaces: Spline representation; Hermite, Bezier and BSpline
curve representations; Bezier and B-Spline surfaces; Polygon rendering methods. 3D geometrical transformation and
viewing.
Visible surface determination: Visible line and surface determination methods; Depth cueing. Graphics Architecture:
GPU; Graphics pipeline; DirectX, OpenGL.

Text Books:
1. Donald D. Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with OpenGL, 4th Edition,
Pearson Education, 2014.
Reference Books:
1. Peter Shirley, Michael Ashikhmin and Steve Marschner, Fundamentals of Computer Graphics, 3rd Edition,
CRC Press, 2009.
2. Sumanta Guha, Computer Graphics through OpenGL: From Theory to Experiments, 2nd Edition, CRC Press,
2014.

35
3. John L. Hennesy and David A. Patterson, Computer Architecture: A Quantitative Approach, 5th Edition,
Chapter 4 (Data-Level Parallelism in Vector, SIMD, and GPU Architectures), Elsevier India, 2012.

CS3053 STATISTICAL MACHINE LEARNING 3-0-0-6


Supervised learning algorithms: linear and logistic Regression, gradient descent, support vector machines, kernels,
artificial neural networks, decision trees, ML and MAP Estimates, K-nearest neighbor, Naive Bayes, Bayesian
networks; Unsupervised learning algorithms: K-means clustering, Gaussian mixture models, learning with partially
observable data (EM); Dimensionality reduction and principal component analysis; Model selection and feature
selection; Introduction to Markov decision processes.
Textbooks:
1. T. M. Mitchell, Machine Learning, McGraw-Hill, 2013.
2. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2013.

Reference Books:
1. S. Theodoridis and K. Koutroumbas. Pattern Recognition. Academic Press, 2009.
2. S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice-Hall of India, New Delhi, 2007.
3. T. Hastie, R. Tibshirani, J Friedman, Elements of Statistical Learning, Springer, 2009

CS3033 CYBER SECURITY 3-0-0-6


Introduction to Cyber security
Defining Cyberspace and Overview of Computer and Web-technology, Architecture of cyberspace, Communication
and web technology, Internet, World wide web, Advent of internet, Internet infrastructure for data transfer and
governance, Internet society, Regulation of cyberspace, Concept of cyber security, Issues and challenges of cyber
security.
Cyber crime and Cyber law
Classification of cyber crimes, Common cyber crimes- cyber crime targeting computers and mobiles, cyber crime
against women and children, financial frauds, social engineering attacks, malware and ransomware attacks, zero day
and zero click attacks, Cyber-criminals modus-operandi , Reporting of cyber crimes, Remedial and mitigation
measures, Legal perspective of cyber crime, IT Act 2000 and its amendments, Cyber crime and offenses,
Organizations dealing with Cyber crime and Cyber security in India, Case studies.
Social Media Overview and Security
Introduction to Social networks. Types of Social media, Social media platforms, Social media monitoring, Hashtag,
Viral content, Social media marketing, Social media privacy, Challenges, opportunities and pitfalls in online social
network, Security issues related to social media, Flagging and reporting of inappropriate content, Laws regarding
posting of inappropriate content, Best practices for the use of Social media, Case studies.
E-Commerce and Digital Payments

36
Definition of E-Commerce, Main components of E-Commerce, Elements of E-Commerce security, E-Commerce
threats, E-Commerce security best practices, Introduction to digital payments, Components of digital payment and
stake holders, Modes of digital payments- Banking Cards, Unified Payment Interface (UPI), e-Wallets, Unstructured
Supplementary Service Data (USSD), Aadhar enabled payments, Digital payments related common frauds and
preventive measures. RBI guidelines on digital payments and customer protection in unauthorized banking
transactions. Relevant provisions of Payment Settlement Act,2007
Digital Devices Security, Tools and Technologies for Cyber Security
End Point device and Mobile phone security, Password policy, Security patch management, Data backup,
Downloading and management of third party software, Device security policy, Cyber Security best practices,
Significance of host firewall and Ant-virus, Management of host firewall and Anti-virus, Wi-Fi security,
Configuration of basic security policy and permissions.
Text book:
Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives by Sumit Belapure and
Nina Godbole, Wiley India Pvt. Ltd.

Reference Book:
1. Cyber Crime Impact in the New Millennium, by R. C Mishra , Auther Press. Edition 2010
2. Security in the Digital Age: Social Media Security Threats and Vulnerabilities by Henry A. Oliver, Create
Space Independent Publishing Platform
3. Cyber Laws: Intellectual Property & E-Commerce Security by Kumar K, Dominant Publishers
4. Network Security Bible, Eric Cole, Ronald Krutz, James W. Conley, 2nd Ed, Wiley India Pvt. Ltd.
5. Fundamentals of Network Security by E. Maiwald, McGraw Hill.

CS3023 OPTIMIZATION TECHNIQUES 3-0-0-6


Linear programming problem: formulation and geometric ideas, simplex algorithm, duality, transportation and
assignment problem, Integer programming problems; Nonlinear optimization: method of Lagrange multipliers,
Karush-Kuhn-Tucker theory, numerical methods for nonlinear optimization; Convex optimization and quadratic
programming; Applications of linear, integer and quadratic programming to various areas of science and engineering.
Text Books:
1. S. Chandra, Jayadeva, A. Mehra, Numerical Optimization with Applications, 1st Edition, Narosa Publishing
House, 2009.
Reference Books:
1. John J. Jarvis, Mokhtar S. Bazaraa, Hanif D. Sherali, Linear Programming and Network Flows, 4th
Edition, John Wiley & Sons, 2010.
2. Hamdy A. Taha. Operation Research: An Introduction, 9th Edition, Prentice Hall, 2011.
3. D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, 3rd Edition, Springer, 2008.

37
HS3092 EMPLOYABILITY SKILLS (AUDIT) 1-0-3-0

38
SEMESTER-VII
Sem. Course Code Course Name L T P C
VII CS4034 Cloud Computing 2 0 2 6
VII CS4035 Computer and Network Security 3 0 0 6
VII CS40XX Professional Elective - III 3 0 0 6
VII CS40XX Professional Elective - IV 3 0 0 6
VII CS40XX Open Elective - III 3 0 0 6
VII CS4203 Project – III 0 0 12 12
VII CS4204 Internship 0 0 3 3
Total 14 17 45
Contact Hours / Week 31

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- 18 6 6 15

CS4034 CLOUD COMPUTING 2-0-2-6


Cloud Computing Overview, Applications, Intranets and the Cloud, First Movers in the Cloud.Organization and
Cloud Computing - When You Can Use Cloud Computing, Benefits, Limitations,Security Concerns, Regulatory
Issues. Cloud Computing with the Titans – Google, EMC, NetApp, Microsoft, Amazon, Salesforce.com,
IBM,Partnerships,The Business Case for Going to the Cloud - Cloud Computing Services, How Those Applications
Help Your Business, Deleting Your Datacenter, Salesforce.com, Thomson Reuters.
Clients, Security, Network, Services.Accessing the Cloud – Platforms, Web Applications, Web APIs, Web
Browsers.Cloud Storage – Overview, Cloud Storage Providers,Standards – Application, Client, Infrastructure,
Service.
Overview, Driving Forces, Company Offerings, Industries Software plus Services – Overview, Mobile Device
Integration, Providers, Microsoft Online.Developing Applications – Google, Microsoft, Intuit QuickBase, Cast Iron
Cloud, Bungee Connect,Development, Troubleshooting, Application Management.
Virtualization in Your Organization, Server Solutions, Thin Clients,Case Study: McNeilus Steel.Migrating to the
Cloud - Cloud Services for Individuals, Cloud Services Aimed at the MidMarket,Enterprise-Class Cloud Offerings,
Migration.Best Practices and the Future of Cloud Computing- Analyze Your Service, Best Practices, How Cloud
Computing Might Evolve.
Text Books:

Reference Books:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, ‗Mastering Cloud Computing‘, Tata Mcgraw Hill
2. Toby Velte, Anthony Velte, Robert Elsenpeter, ‗Cloud Computing – A Practical Approach‘, Tata
McGraw Hill

39
3. George Reese, ‗Cloud Application Architectures: Building Applications and Infrastructure in the
Cloud: Transactional Systems for EC2 and Beyond (Theory in Practice)‘, O‘Reilly
4. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, ‗Distributed and Cloud Computing, From Parallel
Processing to the Internet of Things‘, Morgan Kaufmann Publishers, 2012.
5. Rittinghouse, John W., and James F. Ransome, ‗Cloud Computing: Implementation, Management and
Security‘, CRC Press, 2017.

CS4035 COMPUTER AND NETWORK SECURITY 3-0-0-6

Objectives of cryptography, Basic cryptographic primitives, Cryptanalysis, Symmetric and Asymmetric key
cryptography, stream cipher (Based on LFSR) and block cipher (AES), Public key encryption (RSA, Rabin and
ElGamal), Digital signature, Entity authentication, Key Exchange (Diffie Hellman), Key distribution, Lightweight
cryptography and its application.
Attacks and countermeasures: Buffer overflow attacks, Internet worms, viruses, spyware, Spam, phishing, botnets,
denial of service, Web security, OWASP top ten, Wireless security.
Security and Privacy: Physical Media security, LAN security, TCP/IP and DNS security, routing protocol security,
Firewalls and intrusion detection systems, Signature and Anomaly Detection, Traffic Analysis, Operational
Network Security, Intrusion prevention system.

Text Books:
1. Behrouz A. Forouzan, Introduction to Cryptography and Network Security, McGraw-Hill 1st
edition, 2008.
2. W. Stallings, Cryptography and Network Security: Principles and Practice, 5th Ed, Prentice Hall,
2011.
Reference Books:
1. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied
Cryptography CRC Press, October 1996, Fourth Printing (July 1999).
2. Kaufman, Perlman, and Speciner, Network Security (2nd edition), Prentice Hall (2002).

CS4204 INTERNSHIP 0-0-3-3


Guidelines for Internship
Employers are increasingly prioritizing experience when picking students from academic institutions. Keeping this in
view, students are encouraged to attend summer internship after 4th and 6th Semester. They are also encouraged to
attend training or skill development program after 2nd semester. However, the training or skill development
programs will not be considered as internship. A maximum of three credits will be awarded at the end of the
internship (that is in 7th semester). Students are encouraged to read the following points in the context of internship.
Organization: Students are encouraged to opt a reputed IT/Electronics related industry or academic/ research
institutions for their internship. The term reputed IT/Electronics related industry refers to an organization, who have

40
recently introduced a disruptive sustainable business model. It may be start-ups or an established company. In case of
the start-ups, the company must have a valid registration number according to the Company ACT (Country of
origin). The term reputed academic/ research institutions refers to an academic or research organization either
recognized as Institute of National Importance or organizations with NIRF ranking less than 100 if the organization is
located in India. If the organization is located outside of India the times higher education ranking shall be less than
800. Internship in general should be outside the IIIT Senapati, Manipur only. In case of students are interested to do
specific research work with any faculty member of IIIT Senapati, Manipur, they are encouraged to do so only during
the semester as mini project but not in the summer vacation.

Duration: During the entire B.Tech. Program attending a minimum of 8 weeks of internship is mandatory. They
might attend multiple internships in multiple organizations or one internship of at-least 8 weeks long in one
organization. However, the minimum duration of each internship will be 4 weeks (in one organization), if students
are opting for multiple internships. They must finish the 8-weeks internship program before enrolling in 7th semester.
Students normally have two summer vacations of approximately two months each to complete the internship and one
summer vaccination to complete the training and skill development program of their own. Mode of internship: No
restrictions are there regarding the mode of the internship. It may be online or offline. However, the preferred mode
of internship is offline.

Assistance: The single point of contact for Internship is: Faculty-in-Charge, Training and Placement Cell, IIIT
Manipur, training@iiitmanipur.ac.in. Students may also contact the mentor faculty for any other assistance related to
the internship.

Documents required to apply: Academic section of the institute will provide the certificates (if required, including
No-objection-Certificate, Bonafide Certificate) to apply for the internship. However, students may approach any
faculty member of their choice for the letter of recommendation (if required).

Report: At the end of the internship, students need to submit an internship report (Hardcopy, 40-60 Page long,
template may download from http://iiitmanipur.ac.in/pages/essentialInfo.php) duly signed by the supervisor/ mentor
appointed by the industry to the Head of Department along with the internship offer-letter. In case of multiple
internships, they need to submit multiple reports and multiple offer letters. The internship report must include a
certificate from the supervisor/ mentor stating that the work done during the internship is genuine and is not copied
from any other sources. The name of the supervisor/ mentor, designation, name of the organization, email ID and
phone-number should be vivid on the certificate. Each department will form a committee to evaluate the internship
reports the first week of the seventh semester.
Evaluation: Students need to present the work done during internship(s) in the first week of beginning of the seventh
semester in-front of a committee formed by the department; the committee will also evaluate the internship reports and
will award grades.

41
SEMESTER-VIII
Sem. Course Code Course Name L T P C
VIII CS4205 Industry/ Research Internship 0 0 18 18
Total 0 18 18
Contact Hours / Week

Total Humanities & Basic Basic Open


Professional Professional Internship /
Course Social Science Science Engineering Elective
Core (PC) Elective (PE) Project
Credit (HS) (BS) (BE) (OE)
Credit -- -- -- -- -- -- 18

PROFESSIONAL ELECTIVES
Code Course Title Hours per week Credits
L T P
CS--- Advanced Database Systems 3 0 0 6
CS--- Advanced Data Structure and Algorithms 3 0 0 6
CS--- Audio and Speech Processing 3 0 0 6
CS--- Augment and Virtual Reality Systems 3 0 0 6
CS--- Data Mining and Warehousing 3 0 0 6
CS--- Deep Learning 3 0 0 6
CS--- Distributed Systems and Applications 3 0 0 6
CS--- High Performance Computing 3 0 0 6
CS--- Human Computer Interaction 3 0 0 6
CS--- Natural Language Processing 3 0 0 6
CS--- Parallel Programming 3 0 0 6
CS--- Information Retrieval 3 0 0 6
CS--- Software Testing 3 0 0 6

CS--- Pattern Classification 3 0 0 6

CS--- Advanced Computer Architecture 3 0 0 6

CS--- Principles of Programming Languages 3 0 0 6

CS--- Mobile Application Development 3 0 0 6

CS--- Soft Computing 3 0 0 6

CS--- Software Process & Project Management 3 0 0 6

CS--- Cyber Forensics 3 0 0 6

CS--- User-Centric Mobile Computing 3 0 0 6

42
CS--- Topics and Tools in Social Media Data Mining 3 0 0 6

CS--- Linux Kernel: Implementation And Security Issues 3 0 0 6

CS--- Computational Complexity 3 0 0 6

CS--- Big-data Processing and Management 3 0 0 6


CS--- Foundation of Data Science 3 0 0 6

OPEN ELECTIVE (OE)

Code Course Title Hours per week Credits

OE--- Big-data Processing and Management 3 0 0 6


OE--- Information Theory and Coding 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Internet of Things 3 0 0 6
OE--- Image and Video Processing 3 0 0 6
OE--- Software Testing 3 0 0 6
OE--- Deep Learning 3 0 0 6
OE--- Blockchain Technologies 3 0 0 6
OE--- Computer Vision 3 0 0 6
OE--- VLSI Technology 3 0 0 6
OE--- Wireless Sensor Network 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Multimedia Systems 3 0 0 6
OE--- Introduction to Bio-informatics 3 0 0 6

OE--- Cyber Security & Forensics 3 0 0 6


OE--- Quantum Computing 3 0 0 6

43
CSXXX ADVANCED DATABASE SYSTEMS 3-0-0-6
Database systems architectures, row stores and column stores, OLTP vs. OLAP, in-memory database
systems. Storage: secondary-storage devices.
Indexing: tree-based and hash-based techniques, multi-dimensional indexing, learning indices
from data. Write-optimised data structures: LSM trees, LSM hash tables, B epstrees.

Query evaluation: sorting and join processing, selection, projection, aggregation, query compilation.
Query optimisation: cardinality estimation, cost-based query optimisation, dynamic programming,
rulebased optimisation, learning query plans.

Transaction management: ACID properties, concurrency control, locking and multi-version


protocols, crash recovery.

Distributed database systems: parallel query evaluation, distributed transaction processing.


Scientific (array) databases, cloud databases, database systems for machine learning
Reference Books:
1. Silberschatz, H. Korth, S. Sudarshan, Database system concepts
2. R. Ramakrishnan, J. Gehrke, Database Management Systems
3. Elmasri R. and Navanthe S. B., Fundamentals of Database Systems
4. Thomas Connolly et. al., Database Systems, A Practical Approach to Design,
Implementation and Management Gary Hansen and James Hansen, Database
Management and Design.

CSXXX ADVANCED DATA STRUCTURE AND ALGORITHMS 3-0-0-6


Binary Tree, expression trees, Binary tree traversals, applications of trees Huffman Algorithm, Balanced
Trees, AVL Tree, B-Tree, Splay Trees, Heap, Heap operations- Binomial & Fibonacci Heaps, Suffix
trees.
Representation of graph, Graph Traversals, Depth-first and breadth-first traversal, Applications of
graphs, Topological sort, shortest-path algorithms, Dijkstras algorithm, Bellman-Ford algorithm,
Floyd‗s Algorithm, minimum spanning tree, Prim‗s and Kruskal‗s algorithms.
Backtracking, N-Queen‗s Problem, Branch and Bound, Assignment Problem, P & NP problems,
NPcomplete problems, Approximation algorithms for NP-hard problems, Traveling salesman problem,
Amortized Analysis.
String matching, Approximation algorithms, Stable matching, Number theoretic algorithms
Reference Books:
1. Thomas Cormen, Charles Leiserson, Ronald Rivest and Clifford Stein, Introduction to Algorithms
2. S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, Algorithms, Mcgraw-Hill, 2006
3. Steven Skiena, The Algorithm Design Manual
4. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++

44
CSXXX AUDIO AND SPEECH PROCESSING 3-0-0-6
Speech production, Time domain analysis, Frequency domain analysis, Cepstral analysis, LPC analysis, Speech
coding, Speech recognition, Speech enhancement, Text to speech conversion. Signal Processing Models of Audio
Perception, Psycho-acoustic analysis, Spatial Audio Perception and rendering, Audio compression methods,
Parametric Coding of Multichannel audio, Transform coding of digital audio, audio quality analysis.
Online Tutorials and Resources:
1. HTML5, CSS3, JavaScript, PHP Tutorials http://www.w3schools.com
2. jQuery Tutorial https://learn.jquery.com
3. MongoDB Tutorial and Certifications https://university.mongodb.com
4. Express https://expressjs.com/en/starter/installing.html
5. React Tutorialhttps://reactjs.org/tutorial/tutorial.html 6. Node https://nodeschool.io
Reference Books:
1. L. Rabiner and B. H. Juang, Fundamentals of Speech Recognition, Prentice Hall
2. L. Rabiner and R. W. Schafer, Digital Processing of Speech Signals, Prentice Hall
3. Quatieri, Discrete-Time Speech Signal Processing: Principles and Practice, 2001, Prentice Hall

CSXXX AUGMENT AND VIRTUAL REALITY SYSTEMS 3-0-0-6


Introduction: VR/AR experience; role of human sensory organs; hardware; software; interaction;
Overview of interactive software development life cycle; Computer graphics: 3D pipeline; overview
of pipeline stages; Computer vision: basic representation techniques; overview of object detection
and recognition; introduction to SLAM; Immersive content delivery: Representation and projection
techniques for 360 video, stereoscopic multimedia content; Basic HTTP-based adaptive streaming
architectures (DASH,HLS); adaptive FoV-based streaming; 360 video delivery over CDNs; Edge-
Cloud support for VR/AR applications; Future AR/VR applications (holoteleportation, telepresence
etc); System design and implementation: Unity; VR and AR SDKs; case studies on VR and AR systems.

Reference Books:
1. LaValle, Steven, Virtual reality. [free online book. Can be downloaded from
http://lavalle.pl/vr/] 2016.
2. LaViola, J.J., Kruijff, E., Bowman, D., McMahan, R. Poupyrev, I, 3D User Interfaces: Theory
and Practice. Addison Wesley Professional, 2017.
3. Jerald, Jason, The VR book: Human-centered design for virtual reality. Morgan Claypool., 2015.
4. Forsyth, D. A. Ponce, J, Computer Vision: A Modern Approach, Pearson, 2012.
5. Bhattacharya, S, Human-Computer Interaction: User-Centric Computing for Design,
McGraw-Hill India, 2019.

CSXXX DATA MINING AND WAREHOUSING 3-0-0-6


Data Mining: Introduction, related technologies - Machine Learning, DBMS, OLAP, Statistics; Goals;
Stages of the Data Mining Process, Knowledge Representation Methods; Applications; knowledge
representation; Representing input data and output knowledge; Visualization techniques; Attribute-

45
oriented analysis, Attribute generalization, Attribute relevance , Class comparison, Statistical
measures
Association Analysis: Association Analysis: Problem Definition, Frequent Item set Generation, Rule
generation. Alternative Methods for Generating Frequent Item sets, FP-Growth Algorithm, Evaluation
of Association Patterns.
Classification: Decision Trees Induction, Method for Comparing Classifiers, Rule Based Classifiers,
Nearest Neighbor Classifiers, Bayesian Classifiers.
Clustering Analysis: Overview, K-Means, Agglomerative Hierarchical Clustering, DBSCAN,
Cluster Evaluation, Density-Based Clustering, Graph- Based Clustering, Scalable Clustering
Algorithms.
Data Warehousing & modeling: Basic Concepts: Data Warehousing: A multitier Architecture, Data
warehouse models: Enterprise warehouse, Data mart and virtual warehouse, Extraction,
Transformation and loading, Data Cube: A multidimensional data model, Stars, Snowflakes and Fact
constellations: Schemas for multidimensional Data models, Dimensions: The role of concept
Hierarchies, Measures: Their Categorization and computation, Typical OLAP Operations.
Data warehouse implementation: Efficient Data Cube computation: An overview, Indexing OLAP
Data: Bitmap index and join index, Efficient processing of OLAP Queries, OLAP server Architecture
ROLAP versus MOLAP Versus
HOLAP.
Reference Books:
1. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques (Second
Edition), Morgan Kaufmann, 2005, ISBN: 0-12-088407-0

CSXXX DEEP LEARNING 3-0-0-6


INTRODUCTION: Introduction to machine learning- Linear models (SVMs and Perceptrons, logistic
regression)- Intro to Neural Nets: What a shallow network computes- Training a network: loss
functions, back propagation and stochastic gradient descent- Neural networks as universal function
approximates
DEEP NETWORKS: History of Deep Learning- A Probabilistic Theory of Deep
LearningBackpropagation and regularization, batch normalization- VC Dimension and Neural Nets-Deep
Vs Shallow Networks-Convolutional Networks- Generative Adversarial Networks (GAN),
Semisupervised Learning
DIMENTIONALITY REDUCTION Linear (PCA, LDA) and manifolds, metric learning Auto encoders and
dimensionality reduction in networks - Introduction to Convnet - Architectures AlexNet, VGG,
Inception, ResNet - Training a Convnet: weights initialization, batch normalization, hyperparameter
optimization
OPTIMIZATION AND GENERALIZATION: Optimization in deep learning Non-convex
optimization for deep networks- Stochastic Optimization Generalization in neural networks- Spatial
Transformer Networks- Recurrent networks, LSTM - Recurrent Neural Network Language Models-

46
Word-Level RNNs Deep Reinforcement Learning - Computational Artificial Neuroscience
CASE STUDY AND APPLICATIONS : Imagenet- Detection-Audio WaveNet-Natural Language Processing
Word2Vec -
Joint Detection-Bioinformatics- Face Recognition- Scene Understanding Gathering Image Captions.
Reference Books:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
2. Deng Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.

CSXXX DISTRIBUTED SYSTEMS AND APPLICATION 3-0-0-6


Introduction, design issues; Naming, resolution; Process and threads in distributed system, code migration; Clock
synchronization; Global state, election;
Distributed mutual exclusion, token and non-token based algorithms; Distributed deadlock prevention, avoidance,
detection, resolution;
Distributed shared memory, memory coherence; Distributed file system, sharing semantics, caching, replication, fault-
tolerance, atomicity; Distributed scheduling, load distribution, balancing, sharing;
Consistency and replication, data and client-centric models; Failure and recovery, synchronous and asynchronous
check point, message logging; Fault tolerance, commit protocols, failure resilient processes, group membership;
Security, secure channels, access control matrix.
Text book:
1. Distributed Systems: Concepts and Design, George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair,
5th Ed., Addison-Wesley/Pearson Education
Reference Book:
1. Distributed Systems: Principles and Paradigms, Andrew S. Tanenbaum and Maarten Van Steen, 2nd Ed,
Prentice-Hall/Pearson Education
2. Distributed Systems: Computing over Networks, Joel M. Crichlow, 2nd Ed, Prentice-Hall/Pearson Education

CSXXX HIGH PERFORMANCE COMPUTING 3-0-0-6


Parallel Processing Concepts; Levels and model of parallelism: instruction, transaction, task, thread,
memory, function, data flow models, demand-driven computation; Parallel architectures: superscalar
architectures, multi- core, multi-threaded, server and cloud; Fundamental design issues in HPC: Load
balancing, scheduling, synchronization and resource management; Operating systems for scalable
HPC; Parallel languages and programming environments; OpenMP, Pthread, MPI, java, Cilk;
Performance analysis of parallel algorithms; Fundamental limitations in HPC: bandwidth, latency and
latency hiding techniques; Benchmarking HPC: scientific, engineering, commercial applications and
workloads; Scalable storage systems: RAID, SSD cache, SAS, SAN; HPC based on cluster, cloud, and
grid computing: economic model, infrastructure, platform, computation as service; Accelerated HPC:

47
architecture, programming and typical accelerated system with GPU, FPGA, Xeon Phi, Cell BE;
Power-aware HPC Design: computing and communication, processing, memory design, interconnect
design, power management; Advanced topics: peta scale computing; big data processing, optics in
HPC, quantum computers.
HPC programming assignments: Hands on experiment and programming on parallel machine and HPC
cluster using Pthread, OpenMP, MPI, Nvidia Cuda and Cilk. Also there will be some hands on
experiments on standard
multiprocessor simulator or cloud simulator.

Reference Books:
1. Georg Hager and Gerhard Wellein. Introduction to High Performance Computing for Scientists and Engineers (1st
ed.). CRC Press, Chapman amp;amp; Hall/CRC Computational Science, India, 2010
2.Vipin Kumar , Ananth Grama , Anshul Gupta , George Karypis. Introduction to Parallel Computing (2nd ed.).
Pearson India . 2003.
3.John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach (5th ed.). Elsevier India
Pvt. Ltd. 2011.
4.David B. Kirk and Wen-mei W. Hwu. Programming Massively Parallel Processors: A Hands-On Approach (1st ed.).
Elsevier India Pvt. Ltd. 2010.
5.Michael T. Heath. Scientific Computing: An Introductory Survey (2nd ed.). McGraw Hill Education (India)
Private Limited, 2011

CSXXX HUMAN COMPUTER INTERACTION 3-0-0-6


HCI foundation: history, human abilities, state of the art in computing technology, interaction styles
and paradigms; Design process: interaction design basics, HCI in software process, design rules and
guidelines, implementation support (UI software), universal design; Interaction styles: direct
manipulation, WIMP, web interface, natural language interaction; Evaluation techniques; Models in
HCI: formal models, linguistic models, cognitive models (KLM/GOMS), cognitive architectures,
hybrid models; Task analysis; Dialogue design; Advanced
topics (overview) pervasive computing, CSCW, virtual reality, tangible user interface, multimedia.
Reference Books:
1. A. Dix, J. Finlay, G. D. Abowd and R. Beale, Human Computer Interaction, Pearson Education,
2. C. Stephanidis (ed.), User Interface for All: Concepts, Methods and Tools. Lawrence Erlbaum
Associates
3. J. M. Caroll (ed.), HCI Models, Theories and Frameworks: Towards a Multidisciplinary Science
(Interactive Technologies), Morgan Kauffman
4. W. O Galitz, The Essential Guide to User Interface Design, John Wiley Sons, Inc.
5. B. Shneiderman, Designing the User Interface, Addison Wesley

48
CSXXX INFORMATION RETRIEVAL 3-0-0-6
Introduction: concepts and terminology of information retrieval systems, Information Retrieval Vs Information
Extraction; Indexing: inverted files, encoding, Zipf‘s Law, compression, boolean queries; Fundamental IR models:
Boolean, Vector Space, probabilistic, TFIDF, Okapi, language modeling, latent semantic indexing, query processing
and refinement techniques; Performance Evaluation: precision, recall, F-measure; Classification: Rocchio, Naive
Bayes, k-nearest neighbors, support vector machine; Clustering: partitioning methods, k-means clustering,
hierarchical; Introduction to advanced topics: search, relevance feedback, ranking, query expansion.
Reference Books:
1. Christopher D. Manning, Prabhakar Raghavan and Hinrich Schtze, Introduction to Information Retrieval,
Cambridge University Press
2. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, Modern Information Retrieval, Addison Wesley, 1st edition,
1999.
3. Soumen Chakrabarti, Mining the Web, Morgan-Kaufmann Publishers, 2002.
4. Bing Liu, Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, Springer, Corr. 2nd printing
edition, 2009.
5. David A. Grossman, Ophir Frieder, Information Retrieval: Algorithms and Heuristics, Springer, 2nd edition,
6. 2004.

CSXXX NATURAL LANGUAGE PROCESSING 3-0-0-6


Introduction: What is Natural Language Processing, hands-on demonstrations. Phases, Ambiguity and uncertainty in
language. Turing test and Reverse Turing test.
Regular Expressions: Chomsky hierarchy, regular languages, and their limitations. Finite-state automata. Practical
regular expressions for finding and counting language phenomena. A little morphology. Hands-on Regex on corpora
Programming in Python (if not already covered): An introduction to programming in Python. Why Python? Variables,
numbers, strings, arrays, dictionaries, conditionals, iteration. The NLTK (Natural Language Toolkit), with
demonstrations and visualization.
Morphological analysis: Stemming, and lematization (key algorithms), String Edit Distance and Alignment (Key
algorithmic tool: dynamic programming, first a simple example, then its use in optimal alignment of sequences. String
edit operations, edit distance, and examples of use in spelling correction, and machine translation.)
Syntactic and semantic analysis: Grammar (CG, CFG, Phrase structure G, LG, Dependency grammar), PoS Tagging,
Parsing, Handling of unknown words, named entities, multi word expressions.
Advanced topic: Machine translation, Sentiment analysis, Topic modeling, Stylometry, APIs, Social Media, Web
Scraping, IR
Reference Books:
1. Introduction to Speech and Language Processing, Dan Jurafsky and James H. Martin

49
CSXXX PARALLEL PROGRAMMING 3-0-0-6
Principles of parallel algorithm design: decomposition techniques, mapping scheduling computation, templates;
Programming shared-address space systems: Cilk Plus, OpenMP, Pthreads; Parallel computer architectures: shared
memory systems and cache coherence, distributed-memory systems, interconnection networks and routing;
Programming scalable systems: message passing: MPI, global address space languages; Analytical modeling of
program performance: speedup, efficiency, scalability, cost optimality, isoefficiency ; Collective communication:
Synchronization; Non-numerical algorithms: Sorting, graphs ; Numerical algorithms: dense matrix algorithms, sparse
matrix algorithms; Performance measurement and analysis of parallel programs; GPU
Programming; Problem solving on clusters using MapReduce.
Reference Books:
1.Introduction to Parallel Computing, 2nd Ed, Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar (2003)
2.Using OpenMP: Portable Shared Memory Parallel Programming - Barbara Chapman, Gabriele Jost, Ruud van der
Pas (2008)
3.Using MPI: Portable Parallel Programming with the Message-Passing Interface, 3rd Ed - William Gropp, Ewing
Lusk, Anthony Skjellum (2014)
4.Programming Massively Parallel Processors: A Hands-on Approach, 3rd Ed. - David B. Kirk, Wen-mei W.
Hwu (2016)

CSXXX PATTERN CLASSIFICATION 3-0-0-6


Introduction to Pattern Recognition, Tree Classifiers -Decision Trees: CART, C4.5, ID3., Random Forests. Bayesian
Decision Theory. Linear Discriminants. Discriminative Classifiers: the Decision Boundary- Separability, Perceptrons,
Support Vector Machines. Parametric Techniques- Maximum Likelihood Estimation, Bayesian Parameter Estimation,
Sufficient Statistics. Non -Parametric Techniques Kernel Density Estimators, Parzen Window, Nearest Neighbor
Methods. Feature Selection- Data Preprocessing, ROC Curves, Class Separability Measures, Feature Subset Selection,
Bayesian Information Criterion. The Curse of Dimensionality-Principal Component Analysis. Fisher Linear
Discriminant, Singular Value Decomposition, Independent Component Analysis, Kernel PCA Locally Linear
Embedding. Clustering-. Sequential Algorithms, Hierarchical Algorithms, Functional Optimization-Based Clustering,
Graph Clustering, Learning Clustering, Clustering High Dimensional Data, Subspace Clustering, Cluster Validity
Measures, Expectation Maximization, Mean Shift. Classifier Ensembles-Bagging, Boosting / AdaBoost. Graphical
Models- Bayesian Networks, Sequential Models- State-Space Models, Hidden Markov Models, Context
Dependent Classification. Dynamic Bayesian Networks.

Reference Books:
1. R.O. Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001
2. S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009
3. C. M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006

50
CSXXX SOFT COMPUTING 3-0-0-6
Introduction of Soft Computing, Soft computing vs. hard computing, applications of soft Computing, Various types of
Soft Computing techniques, Neuron, Nerve structure and Synapse, Neural network architecture, single layer and
multilayer feed-forward networks, McCulloch Pitts neuron model, perceptron model, MLP, back propagation learning
methods, effect of learning rule coefficient.
Evolutionary Computation, Historical Development of EC, genetic Algorithms, Genetic programming, Evolutionary
Strategies, Evolutionary programming, features of Evolutionary computation, Advantages and Applications of
Evolutionary Computation. Basic concept of Genetic algorithm, Conventional Optimization and Search Techniques,
Comparison of Genetic Algorithm with Other Optimization Techniques, Advantages, Applications and Limitations of
Genetic Algorithm.
Terminologies and Operators of GA, Introduction to basic terms: Encoding, Breeding, Search Termination, Diploidy,
Dominance and Abeyance. Classification of Genetic Algorithm- Simple Genetic Algorithm (SGA), Parallel and
Distributed Genetic Algorithm (PGA and DGA), Parallel and Distributed Genetic Algorithm (PGA and DGA),
Adaptive Genetic Algorithm (AGA), Fast Messy Genetic Algorithm (FMGA), Independent Sampling Genetic
Algorithm (ISGA).
Introduction to Fuzzy Logic, Utility, Limitations, Different faces of imprecision, inexactness, Ambiguity,
Undecidability, Fuzziness and certainty, Classical Sets and Fuzzy Sets, Classical Relations and Fuzzy Relations,
Properties of Membership Functions, Fuzzification, and Defuzzification.
Automated Methods for Fuzzy Systems, Batch Least square and recursive Least Square Algorithms, Clustering
methods, Fuzzy system Simulation, fuzzy relational equations, Fuzzy associative memories. Fuzzy Classification and
pattern Recognition, Cluster analysis and validity, c-Means clustering, Single sample Identification, Multifeatured
pattern recognition and Image processing.
Text Books:
1. Deepa, S.N. and Sivanandam, S.N., "Principles of Soft Computing‖, 2nd Edition, Wiley India, 2011.
2.Zimmermann H. J. "Fuzzy set theory and its applications" Springer international edition, 2011.
Reference Books:
1. Timothy, J. Ross, ―Fuzzy Logic with Engineering Applications‖, 3rd Edition, Wiley India, 2010.

CSXXX SOFTWARE PROCESS AND PROJECT MANAGEMENT 3-0-0-6

Software maturity Framework, Principles of Software Process Change, Software Process Assessment, The Initial
Process, The Repeatable Process, The Defined Process, The Managed Process, The Optimizing Process. Process
Reference Models Capability Maturity Model (CMM), CMMI, PCMM, PSP, TSP.

Software Project Management Renaissance Conventional Software Management, Evolution of Software Economics,
Improving Software Economics, The old way and the new way. Life-Cycle Phases and Process artifacts Engineering
and Production stages, inception phase, elaboration phase, construction phase, transition phase, artifact sets,
management artifacts, engineering artifacts and pragmatic artifacts, model based software architectures.

Software process workflows, Iteration workflows, Major milestones, Minor milestones, Periodic status assessments.
Process Planning Work break down structures, Planning guidelines, cost and schedule estimating process, iteration
planning process, Pragmatic planning.

51
Line-of- business organizations, project organizations, evolution of organizations, process automation. Project Control
and process instrumentation. The seven-core metrics, management indicators, quality indicators, life-cycle
expectations, Pragmatic software metrics, and metrics automation.

CCPDS-R Case Study and Future Software Project Management Practices Modern Project Profiles, Next-Generation
software Economics, Modern Process Transitions.
TEXT BOOKS:
1. Managing the Software Process, WattsS. Humphrey, Pearson Education.
2. Software Project Management, Walker Royce, Pearson Education.
REFERENCE BOOKS:
1. Effective Project Management: Traditional, Agile, Extreme, Robert Wysocki, Sixth edition, Wiley India,rp2011.
2. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education,2000
3. Process Improvement essentials, James R. Persse, O‘Reilly,2006
4. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition, TMH,2006
5. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O‘Reilly,2006.
6. Head First PMP, Jennifer Greene & Andrew Stellman, O‘Reilly,2007
7. Software Engineering Project Management, Richard H. Thayer & Edward Yourdon, 2nd edition, Wiley India,2004.
8. The Art of Project Management, Scott Berkun, SPD, O‘Reilly,2011.
9. Applied Software Project Management, Andrew Stellman & Jennifer Greene, SPD, O‘Reilly,rp2011.
10. Agile Project Management, Jim Highsmith, Pearson education,2004.

CSXXX CYBER FORENSICS 3-0-0-6


Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics evidence and courts,
legal concerns and private issues; Understanding Computing Investigations – Procedure for corporate High-Tech
investigations, understanding data recovery work station and software, conducting and investigations
Data acquisition- understanding storage formats and digital evidence, determining the best acquisition method,
acquisition tools, validating data acquisitions, performing RAID data acquisitions; Introduction to Forensic Tools,
Usage of Slack space, tools for Disk Imaging, Data Recovery, Vulnerability Assessment Tools, Encase and FTK tools,
Anti Forensics and probable counters, retrieving information, process of computer forensics and digital investigations,
processing of digital evidence, digital images, damaged SIM and data recovery, multimedia evidence, retrieving
deleted data: desktops, laptops and mobiles, retrieving data from slack space, renamed file, ghosting, compressed files.
Volatile data collection, Non-volatile data collection, Registry Analysis, Browser Usage, Hibernate File Analysis,
Crash Dump Analysis, File System Analysis, File Metadata and Timestamp Analysis, Event Viewer Log Analysis,
MFT analysis, Timeline Creation, Evidence Collection in Linux and Mac Operating system.
History of Memory Forensics, x86/x64 architecture, Data structures, Volatility Framework & plugins Memory
acquisition, File Formats – PE/ELF/Mach-O, Processes and process injection, Command execution and User activity,
Networking, sockets, DNS and Internet history, shellbags, paged memory and advanced registry artifacts, Related
tools – Bulk Extractor and YARA, Timelining memory, Recovering and tracking user activity, Recovering attacker
activity from memory, Introduction to Anti-forensics, tools and techniques
Processing crimes and incident scenes, securing a computer incident or crime, seizing digital evidence at scene,

52
storing digital evidence, obtaining digital hash, reviewing case.
Text book:
1. Computer Forensics: Incident Response Essentials by Warren G. Kruse II and Jay G. Heiser, Addison Wesley
2. Guide to Computer Forensics and Investigations by B. Nelson, A. Phillips, F Enfinger, C. Stuart
Reference Book:
1. Computer Forensics, Computer Crime Scene Investigation by J. Vacca
2. Advances in Memory Forensics by Fabio Pagani
3. The Art of Memory Forensics (Detecting Malware and Threats in Windows, Linux, and Mac Memory) Michael
Hale Ligh, Andrew Case, Jamie Levy, Aron Walters

CSXXX FOUNDATION OF DATA SCIENCE 3-0-0-6


Introduction: Definition of Data Science- Big Data and Data Science hype – and getting past the hype - Datafication -
Current landscape of perspectives - Statistical Inference - Populations and samples - Statistical modeling, probability
distributions, fitting a model – Over fitting. Basics of R: Introduction, R Environment Setup, Programming with R,
Basic Data Types.
Data Types & Statistical Description Types of Data: Attributes and Measurement, What is an Attribute? The Type of
an Attribute, The Different Types of Attributes, Describing Attributes by the Number of Values, Asymmetric
Attributes, Binary Attribute, Nominal Attributes, Ordinal Attributes, Numeric Attributes, Discrete versus Continuous
Attributes. Basic Statistical Descriptions of Data: Measuring the Central Tendency: Mean, Median, and Mode,
Measuring the Dispersion of Data: Range, Quartiles, Variance, Standard Deviation, and Interquartile Range, Graphic
Displays of Basic Statistical Descriptions of Data.
Vectors: Creating and Naming Vectors, Vector Arithmetic, Vector sub setting, Matrices: Creating and Naming
Matrices, Matrix Sub setting, Arrays, Class. Factors and Data Frames: Introduction to Factors: Factor Levels,
summarizing a Factor, Ordered Factors, Comparing Ordered Factors, Introduction to Data Frame, subsetting of Data
Frames, Extending Data Frames, Sorting Data Frames. Lists: Introduction, creating a List: Creating a Named List,
Accessing List Elements, Manipulating List Elements, Merging Lists, Converting Lists to Vectors
Conditionals and Control Flow: Relational Operators, Relational Operators and Vectors, Logical Operators, Logical
Operators and Vectors, Conditional Statements. Iterative Programming in R: Introduction, While Loop, For Loop,
Looping Over List. Functions in R: Introduction, writing a Function in R, Nested Functions, Function Scoping,
Recursion, Loading an R Package, Mathematical Functions in R.
Data Reduction: Overview of Data Reduction Strategies, Wavelet Transforms, Principal Components Analysis,
Attribute Subset Selection, Regression and Log-Linear Models: Parametric Data Reduction, Histograms, Clustering,
Sampling, Data Cube Aggregation. Data Visualization: Pixel-Oriented Visualization Techniques, Geometric
Projection Visualization Techniques, Icon-Based Visualization Techniques, Hierarchical Visualization Techniques,
Visualizing Complex Data and Relations.
TEXT BOOKS:
1. Doing Data Science, Straight Talk from The Frontline. Cathy O‘Neil and Rachel Schutt, O‘Reilly, 2014 2. Jiawei
Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques, 3rd ed. The Morgan Kaufmann Series
in Data Management Systems.

53
3. K G Srinivas, G M Siddesh, ―Statistical programming in R‖, Oxford Publications.
REFERENCE BOOKS:
1. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch, Pearson Education. 2. Brain S.
Everitt, ―A Handbook of Statistical Analysis Using R‖, Second Edition, 4 LLC, 2014.
3. Dalgaard, Peter, ―Introductory statistics with R‖, Springer Science & Business Media, 2008. 4. Paul Teetor, ―R
Cookbook‖, O‘Reilly, 2011

CSXXX PRINCIPLES OF PROGRAMMING LANGUAGES 3-0-0-6


Preliminary Concepts: Reasons for Studying Concepts of Programming Languages, Programming Domains, Language
Evaluation Criteria, Influences on Language Design, Language Categories, Language Design Trade-Offs,
Implementation Methods, Programming Environments
Syntax and Semantics: General Problem of Describing Syntax and Semantics, Formal Methods of Describing Syntax,
Attribute Grammars, Describing the Meanings of Programs
Names, Bindings, and Scopes: Introduction, Names, Variables, Concept of Binding, Scope, Scope and Lifetime,
Referencing Environments, Named Constants
Data Types: Introduction, Primitive Data Types, Character String Types, User Defined Ordinal Types, Array,
Associative Arrays, Record, Union, Tuple Types, List Types, Pointer and Reference Types, Type Checking, Strong
Typing, Type Equivalence
Expressions and Statements: Arithmetic Expressions, Overloaded Operators, Type Conversions, Relational and
Boolean Expressions, Short Circuit Evaluation, Assignment Statements, Mixed-Mode Assignment
Control Structures – Introduction, Selection Statements, Iterative Statements, Unconditional Branching, Guarded
Commands.
Subprograms and Blocks: Fundamentals of Sub-Programs, Design Issues for Subprograms, Local Referencing
Environments, Parameter Passing Methods, Parameters that Are Subprograms, Calling Subprograms Indirectly,
Overloaded Subprograms, Generic Subprograms, Design Issues for Functions, User Defined Overloaded Operators,
Closures, Coroutines
Implementing Subprograms: General Semantics of Calls and Returns, Implementing Simple Subprograms,
Implementing Subprograms with Stack-Dynamic Local Variables, Nested Subprograms, Blocks, Implementing
Dynamic Scoping
Abstract Data Types: The Concept of Abstraction, Introductions to Data Abstraction, Design Issues, Language
Examples, Parameterized ADT, Encapsulation Constructs, Naming Encapsulations
Concurrency: Introduction, Introduction to Subprogram Level Concurrency, Semaphores, Monitors, Message Passing,
Java Threads, Concurrency in Function Languages, Statement Level Concurrency. Exception Handling and Event
Handling: Introduction, Exception Handling in Ada, C++, Java, Introduction to Event Handling, Event Handling with
Java and C#.
Functional Programming Languages:Introduction, Mathematical Functions, Fundamentals of Functional Programming
Language, LISP, Support for Functional Programming in Primarily Imperative Languages, Comparison of Functional
and Imperative Languages
Logic Programming Language: Introduction, an Overview of Logic Programming, Basic Elements of Prolog,

54
Applications of Logic Programming.
Scripting Language: Pragmatics, Key Concepts, Case Study: Python – Values and Types, Variables, Storage and
Control, Bindings and Scope, Procedural Abstraction, Data Abstraction, Separate Compilation, Module Library. (Text
Book 2).
TEXT BOOKS:
1. Concepts of Programming Languages Robert. W. Sebesta 10/E, Pearson Education.
2. Programming Language Design Concepts, D. A. Watt, Wiley Dreamtech, 2007.
REFERENCE BOOKS:
1. Programming Languages, 2nd Edition, A.B. Tucker, R. E. Noonan, TMH.
2. Programming Languages, K. C. Louden, 2nd Edition, Thomson, 2003

CSXXX SOFTWARE TESTING 3-0-0-6


INTRODUCTION: Testing as an Engineering Activity – Testing as a Process – Testing Maturity Model- Testing
axioms – Basic definitions – Software Testing Principles – The Tester‗s Role in a Software Development
Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design –
Defect Examples- Developer/Tester Support of Developing a Defect Repository.

TEST CASE DESIGN STRATEGIES: Test case Design Strategies – Using Black Box Approach to Test Case Design
– Boundary Value Analysis – Equivalence Class Partitioning – State based testing – Cause-effect graphing –
Compatibility testing – user documentation testing – domain testing - Random Testing – Requirements based testing –
Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing – code
functional testing – Coverage and Control Flow Graphs – Covering Code Logic – Paths – code complexity testing –
Additional White box testing approaches- Evaluating Test Adequacy Criteria.
LEVELS OF TESTING: The need for Levels of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests
– The Test Harness – Running the Unit tests and Recording results – Integration tests – Designing Integration Tests –
Integration Test Planning – Scenario testing – Defect bash elimination System Testing – Acceptance testing –
Performance testing – Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing
OO systems – Usability and Accessibility testing – Configuration testing –Compatibility testing – Testing the
documentation – Website testing.
TEST MANAGEMENT: People and organizational issues in testing – Organization structures for testing teams –
testing services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items – test
management – test process – Reporting Test Results – Introducing the test specialist – Skills needed by a test
specialist – Building a Testing Group- The Structure of Testing Group- .The Technical Training Program.
TEST AUTOMATION: Software test automation – skills needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test metrics and measurements
– project, progress and productivity metrics.

55
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, ―Software Testing – Principles and Practices‖, Pearson
Education, 2006.
2. Ron Patton, ―Software Testing‖, Second Edition, Sams Publishing, Pearson Education, 2007. AU
Library.com
REFERENCES:
1. Ilene Burnstein, ―Practical Software Testing‖, Springer International Edition, 2003.
2. Edward Kit,‖ Software Testing in the Real World – Improving the Process‖, Pearson Education, 1995.
3. Boris Beizer,‖ Software Testing Techniques‖ – 2nd Edition, Van Nostrand Reinhold, New York, 1990.
4. Aditya P. Mathur, ―Foundations of Software Testing _ Fundamental Algorithms and Techniques‖, Dorling
Kindersley (India) Pvt. Ltd., Pearson Education, 2008.

CSXXX ADVANCED COMPUTER ARCHITECTURE 3-0-0-6


In-order pipelines overview; Out-of-order pipelines, Branch prediction; Advanced branch prediction techniques; Issue,
select, and commit; Aggressive speculation; Compiler techniques for enhancing ILP; Caches: Design, modeling, and
optimizations; On-chip networks; Theory of memory models; Coherence Protocols; Low power design; Reliability
and Hardware Security.
Books and references
1. Advanced Computer Architecture, Smruti R. Sarangi, McGrawHill 2021

CSXXX MOBILE APPLICATION DEVELOPMENT 3-0-0-6


Introduction to Android: The Android Platform, Android SDK, Eclipse Installation, Android Installation, Building
you First Android application, Understanding Anatomy of Android Application, Android Manifest file. Android
Application Design Essentials: Anatomy of an Android applications, Android terminologies, Application Context,
Activities, Services, Intents, Receiving and Broadcasting Intents, Android Manifest File and its common settings,
Using Intent Filter, Permissions. Android User Interface Design Essentials: User Interface Screen elements, Designing
User Interfaces with Layouts, Drawing and Working with Animation. Testing Android applications, Publishing
Android application, Using Android preferences, Managing Application resources in a hierarchy, working with
different types of resources. Using Common Android APIs: Using Android Data and Storage APIs, Managing data
using Sqlite, Sharing Data between Applications with Content Providers, Using Android Networking APIs, Using
Android Web APIs, Using Android Telephony APIs, Deploying Android Application to the World.
Reference Books
1. T1. Lauren Darcey and Shane Conder, ―Android Wireless Application Development‖, PearsonEducation, 2nd
ed. (2011)
2. Reto Meier, ―Professional Android 2 Application Development‖, Wiley India Pvt Ltd
3. Mark L Murphy, ―Beginning Android‖, Wiley India Pvt Ltd Android Application Development All in one for
Dummies by Barry Burd, Edition: I

56
CSXXX USER CENTRIC MOBILE COMPUTING 3-0-0-6
INTRODUCTION: Introduction to Mobile Computing: Applications of Mobile Computing- Generations of Mobile
Communication Technologies- Multiplexing, Spread spectrum -MAC Protocols — SDMA- TDMA- FDMA- CDMA.
MOBILE TELECOMMUNICATION SYSTEM: Introduction to Cellular Systems GSM — Services & Architecture,
Protocols, Connection Establishment, Frequency Allocation, Routing, Mobility Management, Security — GPRS-
UMTS — Architecture Handover Security. MOBILE NETWORK LAYER: Mobile IP DHCP AdHoc– Proactive
protocol-DSDV, Reactive Routing Protocols — DSR, AODV, Hybrid routing –ZRP, Multicast Routing- ODMRP,
Vehicular Ad Hoc networks (VANET) –MANET Vs VANET Security. MOBILE TRANSPORT AND
APPLICATION LAYER: Mobile TCP– WAP Architecture, WDP, WTLS, WTP, WSP, WAE, WTA Architecture
WML. MOBILE PLATFORMS AND APPLICATIONS: Mobile Device Operating Systems — Special Constraints &
Requirements, Commercial Mobile Operating Systems, Software Development Kit: iOS, Android, BlackBerry,
Windows Phone — MCommerce, Structure, Pros & Cons, Mobile Payment System, Security Issues.
Reference Books:
1. Mobile Communications, Jochen Schiller, Pearson
2. Mobile Computing, Asoke K Telukder, Roopa R Yavagal, TMH
3. Principle of wireless Networks by Kaveh Pahlavan and Prashant Krishnamurthy, Pearson 2002.
4. Principle of wireless Networks by Kaveh Pahlavan and Prashant Krishnamurthy, Pearson 2002.

CSXXX TOPICS AND TOOLS IN SOCIAL MEDIA DATA MINING 3-0-0-6


Data mining: Topics on social media data mining including retrieval, ranking, trends detection, event detection, event
forecasting, opinion mining, and any other relevant topics. Link mining: Topics on social media link analysis
including centrality, community, link prediction, influence analysis and any other relevant topics. Log analysis: Topics
related to user's behavioral analysis, personalization, recommendation, and any other relevant topics. Lab Component:
Various state-of-the-art big data analytics tools for mining social media data.
Reference:
1. C.D. Manning, P.Raghavan and H.Schutze, Introduction to Information Retrieval, Cambridge University
Press. 2008.
2. M.A. Russell, Mining the Social Web, 2nd Edn., O'Reilly Media, 2013.
3. R.Zafarani, M.A.Abbasi and H.Liu, Social Media Mining: An Introduction, Cambridge University Press, 2014

CSXXX LINUX KERNAL: IMPLEMENTATION AND SECURITY ISSUE 3-0-0-6


Introduction: Basic operating system concepts review, an overview of the Unix file system, an overview of Unix
kernels, Linux kernel source code – organization, building the kernel, gdb and debugging techniques, code browsing
tools, review of Intel Pentium architecture, module programming – writing and inserting a module in kernel.
Virtual File System and Device drivers: System calls, virtual file system, registering and mounting, file system
debugger, ext2 and ext3 file systems, disk cache and swapping, device drivers: character, block and other devices,
character and block device operations. Processes Overview of the boot process, grub the boot loader, preliminary
setup and overview of kernel startup and initialization, swapper, init and initial processes, process switching,

57
scheduling policy, the scheduling algorithm, data structures used by the scheduler, functions used by the scheduler,
unqueue balancing in multiprocessor systems, lightweight processes and threads. Kernel Synchronization : How the
kernel services requests, synchronization primitives, spinlocks, semaphores; mutexes, reader/writer locks, read-copy-
update mechanism, synchronizing accesses to kernel data structures, examples of race condition prevention, locking
and interprocess communication. - Memory Management: Segmentation and paging in hardware and in the kernel,
page cache and buffer cache, Page frame management, memory area management, slab allocator, noncontiguous
memory area managemn, caching (kmalloc) and process address space (vmalloc), swapping.
References:
1. Daniel P. Bovetand Marco Cesati,Understanding the Linux Kernel,O'Reilly Media, 3rd Edition, 2005
2. Wolfgang Mauerer, Professional Linux Kernel Architecture, Wiley Publishing, 2008.
3. Jonathan Corbet, Alessandro Rubiniand Greg Kroah-Hartman.,Linux device drivers‖, O'Reilly Media, 3rd
Edition, 2005
4. Siever, Stephen Figgins, Robert Love, Arnol-Robbins, Linux in a Nutshell, O'Reilly Media, 6th Edition, 2009

CSXXX COMPUTATIONAL COMPLEXITY 3-0-0-6


Formalizing Problems, Machines, Time & Space; Computability. Complexity Classes; Nondeterminism. Reduction;
co-Classes. EXP-classes; Hierarchy theorems; Oracle. Relativization; Space complexity; Polynomial hierarchy;
Counting classes; Counting vs Hierarchy;Probabilistic TM; Interaction & Circuits.
Textbooks:
1. https://www.cse.iitk.ac.in/users/nitin/courses/CS640-2017-18-I/
2. Arora & Barak, Computational Complexity (Cambridge University Press)

CSXXX BIG DATA PROCESSING AND MANAGEMENT 3-0-0-6


Introduction to Big Data: Data Storage and Analysis - Characteristics of Big Data – Big Data Analytics - Typical
Analytical Architecture – Requirement for new analytical architecture – Challenges in Big Data Analytics – Need of
big data frameworks. Hadoop Framework Hadoop – Requirement of Hadoop Framework - Design principle of
Hadoop –Comparison with other system - Hadoop Components – Hadoop 1 vs Hadoop 2 – Hadoop Daemon‘s –
HDFS Commands – Map Reduce Programming: I/O formats, Map side join, Reduce Side Join, Secondary sorting,
Pipelining MapReduce jobs Hadoop Ecosystem Introduction to Hadoop ecosystem technologies: Serialization:
AVRO, Co-ordination: Zookeeper, Databases: HBase, Hive, Scripting language: Pig, Streaming: Flink, Storm. Spark
Framework Overview of Spark – Hadoop vs Spark – Cluster Design – Cluster Management – performance,
Application Programming interface (API): Spark Context, Resilient Distributed Datasets, Creating RDD, RDD
Operations, Saving RDD - Lazy Operation – Spark Jobs SQL and Datasets: Single API for Java and Scala, working
with Datasets, Transforming Sample Data, Memory Management for Datasets and Data Frames
Textbooks:
1. Mike Frampton, ―Mastering Apache Spark‖, Packt Publishing, 2015.
2. TomWhite,―Hadoop:TheDefinitiveGuide‖,O‘Reilly,4thEdition,2015.
3. Nick Pentreath, Machine Learning with Spark, Packt Publishing, 2015.

58
4. Mohammed Guller, Big Data Analytics with Spark, Apress,2015
5. Donald Miner, Adam Shook, ―Map Reduce Design Pattern‖, O‘Reilly, 2012
6. Edward Capriolo, Dean ampler, Jason Rutherglen, ―Programming Hive‖, O'Reilly Media;
7. Chuck Lam , ―Hadoop in Action‖ ,Manning Publications; 1st Edition ,December, 2010

CSXXX CYBER FORENSICS 3-0-0-6


Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics evidence and courts,
legal concerns and private issues; Understanding Computing Investigations – Procedure for corporate High-Tech
investigations, understanding data recovery work station and software, conducting and investigations.
Data acquisition- understanding storage formats and digital evidence, determining the best acquisition method,
acquisition tools, validating data acquisitions, performing RAID data acquisitions; Introduction to Forensic Tools,
Usage of Slack space, tools for Disk Imaging, Data Recovery, Vulnerability Assessment Tools, Encase and FTK tools,
Anti Forensics and probable counters, retrieving information, process of computer forensics and digital investigations,
processing of digital evidence, digital images, damaged SIM and data recovery, multimedia evidence, retrieving
deleted data: desktops, laptops and mobiles, retrieving data from slack space, renamed file, ghosting, compressed files.
Volatile data collection, Non-volatile data collection, Registry Analysis, Browser Usage, Hibernate File Analysis,
Crash Dump Analysis, File System Analysis, File Metadata and Timestamp Analysis, Event Viewer Log Analysis,
MFT analysis, Timeline Creation, Evidence Collection in Linux and Mac Operating system.
History of Memory Forensics, x86/x64 architecture, Data structures, Volatility Framework & plugins Memory
acquisition, File Formats – PE/ELF/Mach-O, Processes and process injection, Command execution and User activity,
Networking, sockets, DNS and Internet history, shellbags, paged memory and advanced registry artifacts, Related
tools – Bulk Extractor and YARA, Timelining memory, Recovering and tracking user activity, Recovering attacker
activity from memory, Introduction to Anti-forensics, tools and techniques
Processing crimes and incident scenes, securing a computer incident or crime, seizing digital evidence at scene,
storing digital evidence, obtaining digital hash, reviewing case.
Text book:
1. Computer Forensics: Incident Response Essentials by Warren G. Kruse II and Jay G. Heiser, Addison Wesley
2. Guide to Computer Forensics and Investigations by B. Nelson, A. Phillips, F Enfinger, C. Stuart
Reference Book:
1. Computer Forensics, Computer Crime Scene Investigation by J. Vacca
2. Advances in Memory Forensics by Fabio Pagani
3. The Art of Memory Forensics (Detecting Malware and Threats in Windows, Linux, and Mac Memory)
Michael Hale Ligh, Andrew Case, Jamie Levy, Aron Walters

59
OPEN ELECTIVE (OE)

Code Course Title Hours per week Credits

OE--- Big-data Processing and Management 3 0 0 6


OE--- Information Theory and Coding 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Internet of Things 3 0 0 6
OE--- Image and Video Processing 3 0 0 6
OE--- Software Testing 3 0 0 6
OE--- Deep Learning 3 0 0 6
OE--- Blockchain Technologies 3 0 0 6
OE--- Computer Vision 3 0 0 6
OE--- VLSI Technology 3 0 0 6
OE--- Wireless Sensor Network 3 0 0 6
OE--- Embedded Systems 3 0 0 6
OE--- Multimedia Systems 3 0 0 6
OE--- Introduction to Bio-informatics 3 0 0 6
OE--- Cyber Security & Forensics 3 0 0 6
OE--- Quantum Computing 3 0 0 6

OE--- BIG DATA PROCESSING AND MANAGEMENT 3-0-0-6


Introduction to Big Data: Data Storage and Analysis - Characteristics of Big Data – Big Data Analytics - Typical
Analytical Architecture – Requirement for new analytical architecture – Challenges in Big Data Analytics – Need of
big data frameworks. Hadoop Framework Hadoop – Requirement of Hadoop Framework - Design principle of
Hadoop –Comparison with other system - Hadoop Components – Hadoop 1 vs Hadoop 2 – Hadoop Daemon‘s –
HDFS Commands – Map Reduce Programming: I/O formats, Map side join, Reduce Side Join, Secondary sorting,
Pipelining MapReduce jobs Hadoop Ecosystem Introduction to Hadoop ecosystem technologies: Serialization:
AVRO, Co-ordination: Zookeeper, Databases: HBase, Hive, Scripting language: Pig, Streaming: Flink, Storm. Spark
Framework Overview of Spark – Hadoop vs Spark – Cluster Design – Cluster Management – performance,
Application Programming interface (API): Spark Context, Resilient Distributed Datasets, Creating RDD, RDD
Operations, Saving RDD - Lazy Operation – Spark Jobs SQL and Datasets: Single API for Java and Scala, working
with Datasets, Transforming Sample Data, Memory Management for Datasets and Data Frames
Textbooks:
1. Mike Frampton, ―Mastering Apache Spark‖, Packt Publishing, 2015.
2. TomWhite,―Hadoop:TheDefinitiveGuide‖,O‘Reilly,4thEdition,2015.
3. Nick Pentreath, Machine Learning with Spark, Packt Publishing, 2015.
4. Mohammed Guller, Big Data Analytics with Spark, Apress,2015

60
5. Donald Miner, Adam Shook, ―Map Reduce Design Pattern‖, O‘Reilly, 2012
6. Edward Capriolo, Dean ampler, Jason Rutherglen, ―Programming Hive‖, O'Reilly Media;
7. Chuck Lam , ―Hadoop in Action‖ ,Manning Publications; 1st Edition ,December, 2010

OE--- INFORMATION THEORY AND CODING 3-0-0-6


Introduction to information theory; Uncertainty; self-information; Entropy; Discrete memoryless source; Joint
Entropy; Conditional Entropy; mutual information and their properties; Information measures of continuous random
variables; Differential Entropy;
Channel Models and Capacity; Importance and types of various channel models; Channel capacity calculation; Binary
symmetric channel, binary erasure channel; Gaussian channel; Shannon‘s channel capacity and channel coding
theorem; Shannon‘s limit.
Source coding; Average code length; Kraft‘s inequality; Optimal code length; Shannon Fano Elias coding; Huffman
coding; Non binary Huffman codes;
Introduction to Error control codes; Block codes, linear block codes, generator and parity check matrices, standard
Array and syndrome Decoding; cyclic codes and their properties, Encoder and Decoder design;serial and parallel
concatenated block code;
Convolution Codes; Properties, Encoder-Tree diagram, Trellis diagram, state diagram, transfer function of
convolutional codes, Viterbi Decoding, Trellis coding, Reed Solomon codes.
Text Books:
1. T. M. Cover and J. A. Thomas, Elements of Information Theory, 1/e, John Wiley, 1991.
2. S. Lin and D.J. Costello, Error Control Coding, 2/e, Prentice-Hall, 2004.
Reference Books:
1. R. B. Ash, Information Theory, 1/e, Dover Publisher, 1990.
2. Todd K. Moon, Error Control Coding: Mathematical Methods and Algorithms, 1/e, Wiley, 2005.

OE--- EMBEDDED SYSTEMS 3-0-0-6


Introduction: Introduction to embedded systems with examples, characteristics of embedding computing applications,
concept of real-time system, challenges in embedded system design. Design process: requirements, specifications,
architecture design, designing of components, system integration. Instruction set architecture: cisc and risc instruction
set architecture. Embedded system architecture: basic embedded processor/microcontroller architecture, cisc
examples, 8051, risc example, arm architecture, dsp processors, harvard architecture, pic. Memory system
architecture: caches, virtual memory, memory management unit and address translation. Designing embedded
computing platform: the cpu bus, memory devices, i/o devices, component interfacing, design with microprocessor.
Processes and operating systems: multiple tasks and multiple processes; pre-emptive real-time operating systems,
priority- based scheduling, inter process communication mechanisms, evaluating operating system performance,
power management and optimization for processes. Networks: distributed embedded architectures; networks for
embedded systems. Case studies: washing machine, inkjet printer,
telephone exchange, etc

61
Text Books:
1. W. Wolf, "Computers as components: Principles of embedded computing system design", 2/e, Elsevier,
2008.
Reference Books:
1. D. Symes, and C. Wright, "ARM system developer's guide: Designing and optimizing system software‖,
Elsevier,2008.
2. Muhammad Ali Mazidi, Janice G.Mazidi, Rolin D.McKinlay, ―Jack Ganssle, The 8051 Microcontroller and
Embedded Systems ―.
3. Jack Ganssle, "The art of designing embedded systems", 2/e, Elsevier, 2008.

OE--- INTERNET OF THINGS 3-0-0-6


FUNDAMENTALS OF IoT Evolution of Internet of Things - Enabling Technologies IoT Architectures: oneM2M,
IoT World Forum (IoTWF) and Alternative IoT models Simplified IoT Architecture and Core IoT Functional Stack -
Fog, Edge and Cloud in IoT Functional blocks of an IoT ecosystem Sensors, Actuators, Smart Objects and Connecting
Smart Objects.
IoT PROTOCOLS IoT Access Technologies: Physical and MAC layers, topology and Security of IEEE 802.15.4,
802.15.4g, 802.15.4e, 1901.2a, 802.11ah and LoRaWAN Network Layer: IP versions, Constrained Nodes and
Constrained Networks Optimizing IP for IoT: From 6LoWPAN to 6Lo, Routing over Low Power and Lossy Networks
Application Transport Methods: Supervisory Control and Data Acquisition Application Layer Protocols: CoAP and
MQTT.
DESIGN AND DEVELOPMENT Design Methodology - Embedded computing logic - Microcontroller, System on
Chips
- IoT system building blocks - Arduino - Board details, IDE programming - Raspberry Pi - Interfaces and Raspberry
Pi with Python Programming.
DATA ANALYTICS AND SUPPORTING SERVICES Structured Vs Unstructured Data and Data in Motion Vs Data
in Rest Role of Machine Learning No SQL Databases Hadoop Ecosystem Apache Kafka, Apache Spark Edge
Streaming Analytics and Network Analytics Xively Cloud for IoT, Python Web Application Framework Django AWS
for IoT System Management with NETCONF-YANG.
CASE STUDIES/INDUSTRIAL APPLICATIONS Cisco IoT system - IBM Watson IoT platform Manufacturing -
Converged Plantwide Ethernet Model (CPwE) Power Utility Industry GridBlocks Reference Model - Smart and
Connected Cities: Layered architecture, Smart Lighting, Smart Parking Architecture and Smart Traffic Control.
Reference Books:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry, IoT Fundamentals:
Networking Technologies, Protocols and Use Cases for Internet of Things, Cisco Press, 2017
2. Arshdeep Bahga, Vijay Madisetti, Internet of Things A hands-on approach, Universities Press, 2015
3. Olivier Hersent, David Boswarthick, Omar Elloumi , The Internet of Things Key applications and Protocols,
Wiley, 2012 (for Unit 2).
4. Jan Ho ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand. David Boyle,

62
‖From Machine-to-Machine to the Internet of Things - Introduction to a New Age of Intelligence‖, Elsevier,
2014.
5. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), Architecting the Internet of Things, Springer,
2011.

CSXXX IMAGE AND VIDEO PROCESSING 3-0-0-6


Image Representations: Image acquisition, Sampling, Quantization Visual Perception and Color Spaces: Physiological
characteristics of the eye and image formation
Human color vision: Color models: CIE, RGB, CMYK, HSI, HSV, L*a*b* Spatial Domain Image Enhancement and
Filtering: Point processing (contrast enhancement, histogram equalization), Spatial domain 2D LSI filtering,
Median filtering, Frequency Domain Image Filtering and Enhancement: 2D Discrete Fourier Transform, Frequency
domain LSI filtering, Enhancement in the frequency domain , DCT
Image Compression: JPEG Multiresolution and Wavelet Transform
Video representation and compression: MPEG2, H.264/AVC
Reference Books:
1. Digital Image Processing, 3rd edition by Gonzalez, Woods, Pearson Education India
2. Handbook of Image and Video Processing, 2nd edition, Editor A L Bovik, Academic Press;
3. Fundamentals of Digital Image Processing, 1st edition by Anil K. Jain, Prentice Hall India Learning Private
Limited (2015)
4. Digital video Processing, 2nd Edition, by M. Tekalp, Prentice Hall International

OE--- SOFTWARE TESTING 3-0-0-6


INTRODUCTION: Testing as an Engineering Activity – Testing as a Process – Testing Maturity Model- Testing
axioms – Basic definitions – Software Testing Principles – The Tester‗s Role in a Software Development
Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design –
Defect Examples- Developer/Tester Support of Developing a Defect Repository.
TEST CASE DESIGN STRATEGIES: Test case Design Strategies – Using Black Box Approach to Test Case Design
– Boundary Value Analysis – Equivalence Class Partitioning – State based testing – Cause-effect graphing –
Compatibility testing – user documentation testing – domain testing - Random Testing – Requirements based testing –
Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing – code
functional testing – Coverage and Control Flow Graphs – Covering Code Logic – Paths – code complexity testing –
Additional White box testing approaches- Evaluating Test Adequacy Criteria.
LEVELS OF TESTING: The need for Levels of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests
– The Test Harness – Running the Unit tests and Recording results – Integration tests – Designing Integration Tests –
Integration Test Planning – Scenario testing – Defect bash elimination System Testing – Acceptance testing –
Performance testing – Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing
OO systems – Usability and Accessibility testing – Configuration testing –Compatibility testing – Testing the
documentation – Website testing.

63
TEST MANAGEMENT: People and organizational issues in testing – Organization structures for testing teams –
testing services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items – test
management – test process – Reporting Test Results – Introducing the test specialist – Skills needed by a test
specialist – Building a Testing Group- The Structure of Testing Group- .The Technical Training Program.
TEST AUTOMATION: Software test automation – skills needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test metrics and measurements
– project, progress and productivity metrics.
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, ―Software Testing – Principles and Practices‖, Pearson Education,
2006.
2. Ron Patton, ―Software Testing‖, Second Edition, Sams Publishing, Pearson Education, 2007. AU Library.com

REFERENCES:
1. Ilene Burnstein, ―Practical Software Testing‖, Springer International Edition, 2003.
2. Edward Kit,‖ Software Testing in the Real World – Improving the Process‖, Pearson Education, 1995.
3. Boris Beizer,‖ Software Testing Techniques‖ – 2nd Edition, Van Nostrand Reinhold, New York, 1990.
4. Aditya P. Mathur, ―Foundations of Software Testing _ Fundamental Algorithms and Techniques‖, Dorling
Kindersley (India) Pvt. Ltd., Pearson Education, 2008.

OE--- DEEP LEARNING 3-0-0-6


INTRODUCTION : Introduction to machine learning- Linear models (SVMs and Perceptrons, logistic regression)-
Intro to Neural Nets: What a shallow network computes- Training a network: loss functions, back propagation and
stochastic gradient descent- Neural networks as universal function approximates
DEEP NETWORKS : History of Deep Learning- A Probabilistic Theory of Deep LearningBackpropagation and
regularization, batch normalization- VC Dimension and Neural Nets-Deep Vs Shallow Networks-Convolutional
Networks- Generative Adversarial Networks (GAN), Semisupervised Learning
DIMENTIONALITY REDUCTION Linear (PCA, LDA) and manifolds, metric learning Auto encoders and
dimensionality reduction in networks - Introduction to Convnet - Architectures AlexNet, VGG, Inception, ResNet -
Training a Convnet: weights initialization, batch normalization, hyperparameter optimization
OPTIMIZATION AND GENERALIZATION : Optimization in deep learning Non-convex optimization for deep
networks- Stochastic Optimization Generalization in neural networks- Spatial Transformer Networks- Recurrent
networks, LSTM - Recurrent Neural Network Language Models- Word-Level RNNs Deep Reinforcement Learning -
Computational Artificial Neuroscience
CASE STUDY AND APPLICATIONS : Imagenet- Detection-Audio WaveNet-Natural Language Processing
Word2Vec -
Joint Detection-Bioinformatics- Face Recognition- Scene Understanding Gathering Image Captions.
Reference Books:
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
2. Deng Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.

64
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.

OE--- BLOCKCHAIN TECHNOLOGIES 3-0-0-6


History, Types, Consensus – Decentralization using Blockchain, Blockchain and Full Ecosystem, Decentralization –
Platforms for Decentralization; Bitcoin – Digital Keys and Addresses, Transactions, Mining, Bitcoin Networks and
Payments, Wallets, Alternative Coins, Theoretical Limitations, Bitcoin Limitations – Name Coin, Prime Coin, Zcash,
Smart Contracts, Ricardian Contracts.
The Ethereum Network, Components of Ethereum Ecosystem, Ethereum Programming Languages: Runtime Byte
Code, Blocks and Blockchain, Fee Schedule, Supporting Protocols, Solidity Language.
Introduction to Web3, Contract Deployment, POST Requests, Development frameworks, Hyperledger as a protocol,
The Reference Architecture – Hyperledger
Fabric – Distributed Ledger – Corda
Kadena, Ripple-Rootstock, Quorum, Tendermint, Scalability, Privacy, Other Challenges, Current Research on
Blockchain, Notable Projects – Miscellaneous tools.
Text book:
1. Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, Arvind Narayanan, Joseph Bonneau,
Edward Felten, Andrew Miller and Steven Goldfeder, Princeton University Press
Reference Book:
1. Mastering Bitcoin, Andreas Antonopoulos, Satoshi Nakamoto, O‘Reilly Publishing

OE--- COMPUTER VISION 3-0-0-6


INTRODUCTION: Image Processing, Computer Vision and Computer Graphics , What is Computer Vision - Low-
level, Mid-level, High-level , Overview of Diverse Computer Vision Applications: Document Image, Analysis, Bio-
metrics, Object Recognition, Tracking, Medical Image Analysis, Content-Based Image Retrieval, Video Data
Processing, Multimedia, Virtual Reality and Augmented Reality.
IMAGE FORMATION MODELS: Monocular imaging system , Orthographic Perspective Projection, Camera model
and Camera calibration, Binocular imaging systems, Multiple views geometry, Structure determination, shape from
shading , Photometric Stereo, Depth from Defocus , Construction of 3D model from images.
IMAGE PROCESSING, FEATURE EXTRACTION, AND MOTION ESTIMATION: Image pre-processing, Image
representations (continuous and discrete) , Edge detection, Regularization theory , Optical computation ,Stereo Vision
, Motion estimation , Structure from motion.
SHAPE REPRESENTATION AND SEGMENTATION: Contour based representation, Region based representation,
De- formable curves and surfaces, Snakes and active contours, Level set representations, Fourier, and wavelet
descriptors , Medial representations , Multi-resolution analysis, Object recognition.
IMAGE UNDERSTANDING AND COMPUTER VISION APPLICATIONS: Pattern recognition methods, Face
detection, Face recognition, 3D shape models of faces Application: Surveillance foreground-background separation
human gait analysis Application: In-vehicle vision system: locating roadway road markings identifying road signs

65
locating pedestrians.
Reference Books:
1. D. Forsyth and J. Ponce, Computer Vision - A modern approach, Prentice Hall
2. Richard Szeliski, Computer Vision: Algorithms and Applications (CVAA), Springer, 2010
3. E. R. Davies, , Computer Machine Vision, Academic Press, 2012
4. Dana H. Ballard, Christopher M. Brown, Computer Vision, Prentice Hall 1st Edition (May 1, 1982) , ISBN-
978-0131653160
5. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second Edition,
Cambridge University Press, March 2004. 28
6. K. Fukunaga; Introduction to Statistical Pattern Recognition, Second Edition, Academic Press, Morgan
Kaufmann, 1990.
7. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison- Wesley, 1992.

OE--- VLSI TECHNOLOGIES 3-0-0-6


Overview of VLSI design methodology, overview of VLSI design flow, fabrication process flow, layout design rules,
full custom mask layout design, MOSFET scaling and small geometry effects. Brief ideas of MOS modelling. MOS
inverters as VLSI design. CMOS Transistors and Current model. CMOS Inverter and characteristics
Building blocks, Inverter static characteristics and dynamic characteristics; switching and interconnect issues. Noise
Margin and Delay of Inverter. RC Delay. Delay optimization
Combinatorial Circuit Family. Stick Diagram & Interconnects.
Sequential MOS logic circuits, Power, Static Power, and CMOS Latch and flipflop design
Static Timing Analysis; Adder subsystem design, and Approximate Computing; Dynamic logic circuits using MOS.
Construction and characterization of semiconductor memories.
Text book:
1. Jan M. Rabaey, Anantha Chandra Kasan, Borivoje Nikolic, Digital Integrated Circuits, A Design Perspective
Reference Book:
1. David Hodges, Analysis and Design of Digital Integrated Circuits, In Deep Submicron Technology (special
Indian edition)
2. N. Weste and D. Harris, CMOS VLSI Design A Circuits and Systems Perspective, 4th edition, Pearson

OE--- WIRELESS SENSOR NETWORK 3-0-0-6


Introduction: Fundamentals of wireless communication technology, the electromagnetic spectrum radio propagation,
characteristics of wireless channels, modulation techniques, multiple access techniques, wireless LANs, PANs,
WANs, and MANs, Wireless Internet.
Introduction to adhoc/sensor networks: Key definitions of adhoc/ sensor networks, unique constraints and challenges,
advantages of ad-hoc/sensor network, driving applications, issues in adhoc wireless networks, issues in design of
sensor network, sensor network architecture, data dissemination and gathering.
MAC Protocol : Issues in designing MAC protocols for adhoc wireless networks, design goals, classification of MAC

66
protocols, MAC protocols for sensor network, location discovery, quality, other issues, S-MAC, IEEE 802.15.4.
Routing Protocols: Issues in designing a routing protocol, classification of routing protocols, table-driven, on-demand,
hybrid, flooding, hierarchical, and power aware routing protocols.
QoS and Energy Management : Issues and Challenges in providing QoS, classifications, MAC, network layer
solutions, QoS frameworks, need for energy management, classification, battery, transmission power, and system
power management schemes.
TEXT BOOKS:
1. C. Siva Ram Murthy, and B. S. Manoj, "AdHoc Wireless networks ", Pearson Education - 2008.

REFERENCE BOOKS:
1. Feng Zhao and Leonides Guibas, "Wireless sensor networks ", Elsevier publication - 2004.
2. Jochen Schiller, "Mobile Communications", Pearson Education, 2nd Edition, 2003.
3. William Stallings, "Wireless Communications and Networks ", Pearson Education - 2004

OE--- EMBEDDED SYSTEM 3-0-0-6


Introduction: Introduction to embedded systems with examples, characteristics of embedding computing applications,
concept of real-time system, challenges in embedded system design. Design process: requirements, specifications,
architecture design, designing of components, system integration. Instruction set architecture: cisc and risc instruction
set architecture. Embedded system architecture: basic embedded processor/microcontroller architecture, cisc
examples, 8051, risc example, arm architecture, dsp processors, harvard architecture, pic. Memory system
architecture: caches, virtual memory, memory management unit and address translation. Designing embedded
computing platform: the cpu bus, memory devices, i/o devices, component interfacing, design with microprocessor.
Processes and operating systems: multiple tasks and multiple processes; pre-emptive real-time operating systems,
priority- based scheduling, inter process communication mechanisms, evaluating operating system performance,
power management and optimization for processes. Networks: distributed embedded architectures; networks for
embedded systems. Case studies: washing machine, inkjet printer, telephone exchange, etc
Text Books:
1. W. Wolf, "Computers as components: Principles of embedded computing system design", 2/e, Elsevier, 2008.
Reference Books:
1. D. Symes, and C. Wright, "ARM system developer's guide: Designing and optimizing system software‖,
Elsevier,2008.
2. Muhammad Ali Mazidi, Janice G.Mazidi, Rolin D.McKinlay, ―Jack Ganssle, The 8051 Microcontroller and
Embedded Systems ―.
3. Jack Ganssle, "The art of designing embedded systems", 2/e, Elsevier, 2008.

67
OE--- MULTIMEDIA SYSTEM 3-0-0-6
Introductions: Introduction to multimedia systems: What is multimedia History of multimedia. Components of
multimedia systems Web and Internet multimedia applications. Transition from conventional media to digital media
Computer Fonts and Hypertext: Usage of text in Multimedia. Families and faces of fonts. Outline fonts
Bitmap fonts. International character sets and hypertext. Digital font‘s techniques. Audio fundamentals and
representations: Digitization of sound. Frequency and bandwidth. Decibel system. Data rate. Audio file format.
Sound synthesis. MIDI. Wavetable, Compression and transmission of audio on Internet Image Fundamentals and
representations: Colour Science. Colour. Colour Models. Colour palettes. Dithering, 2D Graphics. Image.
Compression and File Formats: GIF, JPEG, JPEG 2000, PNG, TIFF, EXIF, PS, PDF
Basic Image Processing. White balance correction. Dynamic range correction. Gamma correction. Photo
Retouching. Video and Animation: Video Basics. How Video Works. Broadcast Video Standards. Analog video.
Digital video. Video Recording and Tape formats. Shooting and Editing Video (Use Adobe Premier for editing).
Video Compression and File Formats. Video compression based on motion compensation. MPEG-1, MPEG-2,
MPEG-4, MPEG-7, MPEG-21. Animation: Cell Animation. Computer Animation. Morphing.
Reference Books
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu, ―Fundamentals of Multimedia (2nd
2. ed.)‖, 2014, Springer International Publishing.
3. Tay Vaughan, ―Multimedia making it work‖, 2014, McGraw-Hill Education; 9 edition.
4. 1. Parekh Ranjan, ―Principles of Multimedia‖, Tata McGraw-Hill, 2007
5. Li & Drew, ― Fundamentals of Multimedia‖ , Pearson Education, 2009.
6. Rajneesh Aggarwal & B. B Tiwari, ― Multimedia Systems‖, Excel Publication, New Delhi, 2007.

7. Anirban Mukhopadhyay and Arup Chattopadhyay, ―Introduction to Computer Graphics and Multimedia‖,
Second Edition, Vikas Publishing House.

OE--- INTRODUCTION TO BIO-INFORMATICS 3-0-0-6


Introduction to bioinformatics, biological databases (collection,organization, storage and retrival of data) and their
growth, concept of homology and associated terms, pairwise sequence alignment, dotmatrix plot.
Dynamic programming algorithm, global (Needleman-Wunsch) and local (Smith-Waterman) alignments.
Scoring matrices (PAM and BLOSUM families), gap penalty, statistical significance of alignment, BLAST
Multiple sequence alignment (progressive alignment, iterative alignment, sum-of-pairs method), Sequence Logos.
Pattern finding in protein and DNA sequencing, Gibbs Sampler,Hidden Markov Models, Profiles construction and
searching,
PSI-BLAST.
Phylogenetics (maximum parsimony method, distance method (neighbor-joining), maximum-likelihood method), gene
prediction in prokaryotes and eukaryotes, homology and abinitio methods.
Reference Books
1. "Introduction to Bioinformatics Algorithms" by Neil Jones and Pavel Pevzner.
2. "Bioinformatics" by David Mount (2nd edition).

68
References:
1. Marketa Zvelebil, Jeremy O. Baum. Understanding Bioinformatics. Garland Science, 2007.
2. Bourne, Philip E. Structural Bioinformatics. (2nd Ed.) Wiley, 2009.
3. Richard Durbin, Sean R. Eddy, Anders Krogh, Graeme Mitchison. Biological Sequence
Analysis. Cambridge University Press, 1998.

OE--- QUANTUM COMPUTING 3-0-0-6


Brief review of linear algebra and probability preliminaries; Basic notions: Qubits, Dirac‘s notation, operations on
qubits, unitary operators and matrix representations. Single qubit gates - Hadamard, Rotation, NOT and Phase gates.
Multi-qubit gates – CNOT, Toffoli. SWAP test.; Quantum circuits, Church-Turing hypothesis and extensions,
Universality of quantum circuits; No cloning theorem, Relation to probabilistic computation, Bell pair, EPR paradox
Quantum Oracles, Quantum algorithms for promise problems: Deutsch-Jozsa, Bernstein-Vazirani and Simon; Phase
estimation, Eigenvalue estimation and Quantum Fourier Transforms; Searching in an unstructured database: Grover
search – geometric and diffusion views. Quantum walks. Optimality of Grover search.
Shor‘s algorithm for factoring. Order finding, Period finding, Reductions; Quantum algorithms for hidden subgroup,
element distinctness, collision detection and triangle counting problems.
Lower bounds. Adversary method, polynomial method, quantum query complexity; Quantum Complexity Theory.
Complexity class BQP and its connections to classical computation; Advanced topics in quantum computation like
Noisy intermediate scale quantum models, quantum error correction and quantum proofs for classical theorems
Text book:
1. Quantum Computation and Quantum Information by Michael A. Nielsen and Isaac L. Chuang
2. An Introduction to Quantum Computing by Phillip Kaye, Raymond Laflamme and Michele Mosca
Reference Book:
1. Quantum Computing since Democritus by Scott Aaronson
2. • Quantum Algorithms via Linear Algebra: A Primer by Richard J. Lipton and Kenneth W. Regan

OE--- CYBER SECURITY AND FORENSICS 3-0-0-6


Cryptography, Services of cryptography, Types of Cryptography, Cryptanalysis, Types of Cryptanalysis.
Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics evidence and courts,
legal concerns and private issues; Understanding Computing Investigations – Procedure for corporate High-Tech
investigations, understanding data recovery workstation and software, conducting and investigations.
Data acquisition- understanding storage formats and digital evidence, determining the best acquisition method,
acquisition tools, validating data acquisitions, performing RAID data acquisitions; Introduction to Forensic Tools,
Usage of Slack space, tools for Disk Imaging, Data Recovery, Vulnerability Assessment Tools, Encase and FTK tools,
Anti Forensics and probable counters, retrieving information, process of computer forensics and digital investigations,
processing of digital evidence, digital images, damaged SIM and data recovery, multimedia evidence, retrieving
deleted data: desktops, laptops and mobiles, retrieving data from slack space, renamed file, ghosting, compressed files.

69
Volatile data collection, Non-volatile data collection, Registry Analysis, Browser Usage, Hibernate File Analysis,
Crash Dump Analysis, File System Analysis, File Metadata and Timestamp Analysis, Event Viewer Log Analysis,
MFT analysis, Timeline Creation, Evidence Collection in Linux and Mac Operating system.
History of Memory Forensics, x86/x64 architecture, Data structures, Volatility Framework & plugins Memory
acquisition, File Formats – PE/ELF/Mach-O, Processes and process injection, Command execution and User activity,
Networking, sockets, DNS and Internet history, shellbags, paged memory and advanced registry artifacts, Related
tools – Bulk Extractor and YARA, Timelining memory, Recovering and tracking user activity, Recovering attacker
activity from memory, Introduction to Anti-forensics, tools and techniques
Processing crimes and incident scenes, securing a computer incident or crime, seizing digital evidence at scene,
storing digital evidence, obtaining digital hash, reviewing case.
Text book:
1. Computer Forensics: Incident Response Essentials by Warren G. Kruse II and Jay G. Heiser, Addison
Wesley
2. Guide to Computer Forensics and Investigations by B. Nelson, A. Phillips, F Enfinger, C. Stuart
Reference Book:
1. Computer Forensics, Computer Crime Scene Investigation by J. Vacca
2. Advances in Memory Forensics by Fabio Pagani
3. The Art of Memory Forensics (Detecting Malware and Threats in Windows, Linux, and Mac Memory)
Michael Hale Ligh, Andrew Case, Jamie Levy, Aron Walters

OE--- 5G ARCHITECTURE AND ITS APPLICATION 3-0-0-6


Introduction and fundamentals of wireless communications: evolution of cellular systems
requirements, goals, and vision of the next generation wireless communication systems Fading, digital
modulations, performance metrics.
Multiple-input multiple-output (MIMO) systems. Introduction to Multi-antenna Systems, Motivation, Types
of multi-antenna systems, MIMO vs. multi-antenna systems. Diversity, Exploiting multipath diversity,
Transmit diversity, Space-time codes, The Alamouti scheme, Delay diversity, Cyclic delay diversity, Space-
frequency codes, Receive diversity, The rake receiver, Combining techniques, Spatial Multiplexing.
5G Overview: Evolution of mobile networks, 5G Standards and specifications, What is 5G?, 5G key
capabilities, 5G design goals, 5G Use cases, 5G contribution to global economy.
5G Architecture: Traditional Telecom Network, Building blocks of 5G, Network Architecture – Traditional
Vs 5G; 5G New Radio (NR) Architecture, 5G Core (5GC) Network Architecture, Transport Network
Architecture.
Machine learning applications: Channel modeling and estimation Spectrum sensing and sharing Resource
allocation (NOMA, mmWave massive MIMO).

70
Text book:
1. R. Vannithamby and S. Talwar, Towards 5G: Applications, Requirements and Candidate Technologies., John
Willey & Sons, West Sussex, 2017.
2. Manish, M., Devendra, G., Pattanayak, P., Ha, N., 5G and Beyond Wireless Systems PHY Layer Perspective,
Springer Series in Wireless Technology
Reference Book:
1. T. S. Rappaport, R. W. Heath Jr., R. C. Daniels, and J. M. Murdock,, Millimeter Wave Wireless
Communication., Pearson Education, 2015.
2. M. Vaezi, Z. Ding, and H. V. Poor,, Multiple Access techniques for 5G Wireless Networks and Beyond.,
Springer Nature, Switzerland, 2019

OE--- PRINCIPLES OF MOBILE COMPUTING 3-0-0-6


Overview of wireless and mobile systems (wireless LANs, cellular systems, sensor networks, etc.) and the
challenges therein. The radio channel and wireless physical layer design.
Radio propagation, Queuing systems. Medium access, multiplexing, link adaptation. Multihop routing
protocols, routing metrics. Multicast, multihop data forwarding, opportunistic routing.
Solutions to handle mobility at various layers of the networking stack. Mobile IP, Mobile TCP, TCP
behavior over wireless, other transport layer issues. Energy efficiency, localization, security.
Smartphone-based platform architectures and applications. Future directions: dynamic spectrum access,
heterogeneous networks, internet of things.
Text book:
1. J. H. Schiller, Mobile Communications, Pearson Education India , 2nd Edition, 2008
2. William Stallings, Wireless Communications and Networks, Pearson , 2nd Edition, 2009
3. Reference Book:
1. T. S. Rappaport, Wireless Communication: Principles and Practice, Pearson Education India , 2nd Edition,
2009
2. Sudip Misra, Isaac Woungang, Subhas Chandra Misra, Guide To Wireless Ad Hoc Networks, Springer-verlag
London Ltd , 2009 Edition

71
HSS ELECTIVE
Course Code Course Title Hours per week Credits

L T P
HS3093 Introduction to Linguistics 2 0 2 6
HS3094 Environmental Sciences 3 0 0 6
HS3095 Professional Ethics for Engineers/ Ethics and Human 3 0 0 6
Values
HS3096 Principles of Management 3 0 0 6
HS3097 Entrepreneurship and Management Functions 3 0 0 6
HS3098 Organizational Behaviour 3 0 0 6
HS--- Computational Linguistics 3 0 0 6
HS--- Introduction of IPR 3 0 0 6
HS--- Sustainable Development Goals 3 0 0 6
HS--- Supply Chain and Logistic Management 3 0 0 6
HS--- Consumer Behaviour and Welfare Economics 3 0 0 6
HS--- Understanding Democracy and Governance in India 3 0 0 6
HS3099 Language, Cognition and Culture 3 0 0 6

HS3093 INTRODUCTION TO LINGUISTICS 3-0-0-6


Historical Linguistics, Linguistic Typology: Language universals; the major language families; types of
languages in the world (isolating, agglutinating, polysynthetic etc.); languages of India

Phonetics, Phonology, Morphology: The production of speech; the organs of speech; a phonetic description
of speech sounds (vowels and consonants and their place and manner of articulation); combination of speech
sounds; minimal pairs; free and bound morphemes; word building strategies; inflectional and derivational
morphology

Syntax, Semantics: The structure of sentences and their constituents; basic sentence patterns; the subject,
verb and object/ complement; IC Analysis; word meaning and sentence relations; sense relations
(synonymy, homonymy etc)

Sociolinguistics, Applied Linguistics, Neurolinguistics: What is language/ mother-other tongue?; language,


society and variation; basic concepts: language/ dialect/ sociolect/ idiolect/ style/ context/ register; methods
of teaching language; language and the brain

Text:
1. Murray, T. 1995.The Structure of English: Introduction to Phonetics, Phonology and Morphology.
Boston: Allyn & Bacon
2. Mathews, P.H. 2003 Linguistics: A Very Short Introduction. Oxford University Press
References:
1. Fromkin, V., Rodman R. and Hyams, N. 2003. An Introduction to Language. Heinle and Thompson.

72
2. Radford, A., Atkinson, M., Britain, D., Clahsen, H. and Spenser, A. 2009 Linguistics: An
Introduction. Cambridge University Press.
3. Additional reference material to be provided by Instructor.

HS3094 ENVIRONMENTAL SCIENCES 3-0-0-6


Environmental studies and Natural Resources:
Definition, scope and importance of environmental studies.
Natural Resources:
Renewable and non-renewable resources:
Natural resources and associated problems;
(a) Forest resources: Use and over-exploitation, deforestation, Timber extraction, mining, dams and their
effects on forests and tribal people.
(b) Water resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over
water, dam‘s benefits and problems.
(c) Mineral Resources: Use and exploitation, environmental effects of extracting and using mineral
resources.
(d) Food Resources: World food problems, changes caused by agriculture and over grazing, effects of
modern agriculture, fertilizers-pesticides problems, water logging, salinity.
(e) Energy Resources: Growing energy needs, renewable and non- renewable energy sources, use of
alternate energy sources.
Eco Systems:
Concept of an eco-system, Structure and function of an eco-system, Producers, consumers, decomposers,
Energy flow in the ecosystems, Ecological succession, Food chains, food webs and ecological pyramids.
Introduction, types, characteristic features, structure and function of the following ecosystems:
(a) Forest ecosystem
(b) Grass land ecosystem
(c) Desert ecosystem.
(d) Aquatic eco systems (ponds, streams, lakes, rivers, oceans, estuaries)
Environmental Pollution:
Definition: Causes, effects and control measures of;
(a) Air pollution
(b) Soil pollution
(c) Marine pollution
(d) Noise pollution
(e) Nuclear hazards
Solid waste Management: Causes, effects and control measures of urban and industrial wastes.

73
Disaster management: Floods, earth quake, cyclone and landslides.
Social issues and the Environment:
From unsustainable to sustainable development, Urban problems related to energy, Water conservation, rain
water harvesting, watershed management, Environmental ethics: issues and possible solutions, Climate
change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust.
Environment protection Act, Air (prevention and control of pollution) Act, Water (prevention and control of
pollution) Act, Wildlife protection Act, Forest conservation Act, Issues involved in enforcement of
environmental legislations.
Texts:
1. Textbook of Environmental studies, Erach Bharucha, UGC.
2. Fundamental concepts in Environmental Studies, D. D. Mishra, S Chand & Co Ltd.

HS3096 PRINCIPLES OF MANAGEMENT 3-0-0-6


Introduction of organisations and management, Concept of Industrial Management, Characteristics of
Management, Management as an art – profession, Principles of Management, The evolution of management,
Organisational environment, , Decision making- types, conditions and decision making process, Decision
Making Aids.
Dimensions of P-O-L-C: Vision & Mission; Strategizing; Goal & Objectives; Organization Design, Culture,
Human
Resource Management, Understanding Work Teams, Motivation, Leadership and Communication and
Interpersonal Skills, foundation of Control.
Introduction to Functional areas of Management: Operations Management, Marketing Management, Financial
Management.
Introduction to Entrepreneurship: Starts ups, Prospects & Challenges., Environmental Issues, CSR,
Sustainability, The role of statistics for Industrial management: Simple Linear Regression and Correlation
Assumptions and Properties of Least Square Estimator, Its Application by taking industrial data and its
interpretations, Statistical
Software-Eview to be utilized to solve the industrial problems.

Text Books:
1. Koontz, H., and Weihrich, H., Essentials of Management: An International, Innovation and
Leadership Perspective, 10th ed., McGraw Hill, 2015.
2. Robbins, SP, Bergman, R, Stagg, I, and Coulter, M, Management 7, Prentice Hall, 7th edition,
2015.
3. Richard I Levin, David S Rubin, Statistical management, 7th Edition, Prentice Hall India, 2011.
4. Kotler, P., Keller, Kevin Lane Keller et al. Marketing Management, 3rd Edition, 2016.
5. Eugene F. Brigham and Michael C. Ehrhardt, Financial Mangement: Theory and Practice,

74
SouthWestern College Pub; 15th Edition, 2016.

Reference Books:
1. Mahadevan, B., Operations Management, Theory and Practice, Pearson Education Asia,
2. A. Aswathapa, Organizational Behaviour, 2010
3. Robert R. Reeder, Briety & Betty H. reeder, Industrial Marketing, Prentice Hall of India Pvt. Ltd,
New delhi,2008.

HS3099 LANGUAGE, COGNITION AND CULTURE 3-0-0-6


Language evolution: Form and content; ways of thinking; role of meaning in comprehension
Cognitive and semantic issues: Structural and linguistic issues; categorization, metaphor and mental imagery; sense
relations; spatial and temporal language
Socio-cultural issues: Embodiment, universalism / relativism, schemas; kinship relations
Theoretical perspectives: Various approaches and views; Separate Worlds Hypothesis; Gender Theory; Speech Act
Theory; Gricean Maxims; Performative Theory etc.

Text Books:
1. A. Akmajian, R. A. Demers, A. K. Farmer, R. M. Harnish. 2001. Linguistics: An Introduction to
Language and Communication. (PART II: ‗Communication and Cognitive Science‘). MIT Press,
London.
2. Croft, W. and D.A. Cruse. 2004. Cognitive Linguistics, Cambridge University Press.
(Select papers (Langacker, Harris, van Djik etc) to be provided by Instructor)

References:
1. Friedenberg, J. and Silverman, G. 2006. Cognitive Science: An Introduction to the Study of Mind.
Sage Publications, Thousand Oaks, California.
2. Albertazzi, L. 2000. Meaning and Cognition: A Multidisciplinary Approach. John Benjamins
Publishing Company.
3. Gumperz, J. and Levinson, S. C. 1996. Rethinking Linguistic Relativity. Cambridge University
Press.
Sunderland, J. 2006. Language and Gender: An Advanced Resource Book. Routledge, New York.

75

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy