Professional Documents
Culture Documents
PREFACE
This document contains information about the curriculum and teaching scheme of BCA
program. The normal duration of this program will be three years which will be segregated
into six semesters. This document is aimed at providing an insight to the teaching fraternity,
students and other academic staff and has been developed in consultation with subject
experts.
The UETR aims to be a University of opportunities where a student can learn knowledge &
skills in the chosen course of study with flexibility in selecting his/ her subjects as per
interest. The National Policy of Education (NEP 2020) lays emphasis on the three corner
stones, namely,
3. Co-curricular Courses has been introduced for the overall development of the
students
4. Multi Entry Multi Exit system with Credits saved in Academic Bank of Credit
(ABC)
At UETR, efforts have been made to ensure that the offered curriculum follows the NEP
2020. Following features make UETR curriculum distinctive in empowering students with
knowledge and skills:
1) Choice Based Credit System (CBCS): In each semester a provision is made for a
group of Elective subjects. The student will have a choice to study the elective subject
of his choice. Normally the elective subjects are offered in later years but at UETR
they will be offered from the first year of study itself.
2) Practical Skilling: For almost every subject taught in a given course of study, the
student has to do a project which will be evaluated at the end of the semester. For
subjects where it is not feasible to do a project, the student will be writing a research
based exhaustive term paper on a given topic. In addition to the project-based learning,
the student will be frequently engaged in internships with industry. Thus, in UETR
curriculum there will be multiple slots for internship.
5) International Partnerships: The UETR has entered in MoUs with a few reputed
universities in US, Russia, Ethipoia and few are in process in Canada and Australia.
We lay emphasis in giving benefit to our students for studying in these universities for
a limited period.
8) Competency Certificate Awarded At The End Of Each Year: In line with multi-
entry-multi-exit system enunciated in the NEP 2020, every student will be awarded a
Competency Level Certificate at the end of each year on successful completion of the
stipulated Credits. With such certificate (s), the student may find suitable employment,
should he/she decide to temporarily discontinue the studies to re-join after a gap.
The teaching scheme and detailed syllabi has been designed after considering the teaching
schemes of various reputed IITs and NITs like IIT Roorkee, IIT Bombay, IIT Hyderabad,
IIT Madras, and NIT Kurukshetra. The following members have designed the teaching
scheme and detailed syllabi.
3
INDEX
Page
S.No. Contents
Number
1) Abbreviations 4
2) Board of Studies 6
ABBREVIATIONS
CT - Course Type
Cr - Credit
L - Lecture
T - Tutorial
P - Practical Hours
PC - Program Core
ME - Major Elective
CC - Co-curricular
VC - Vocational Course
NGOI - Non-Governmental Organization Internship
PJ - Project
ATT - Attendance
BOARD OF STUDIES
SCHOOL OF COMPUTING
UETR
S. No. Category Name Role in BOS
Non-Member
6) Nominee of the Registrar Mr. Sohan Lal (Dy. Registrar)
Secretary
The following external expert members have assigned in designing the teaching scheme and detailed syllabi:
1) Dr. Partha Pratim Roy, Associate Professor, Department of CSE, IIT Rooree
3) Dr. Ankit Kumar Jain, Assistant Professor, Department of CSE, NIT Kurukshetra
7
BREAKUP OF CREADITS
PRACTICALS
Fundamentals of Information
8) BCA191 PC 0 0 2 1 5 15 5 5 70 100
Technology Lab
PRACTICALS
*Note: Student must go for field work with any Non-Governmental Organization and after completion the
course he/she has to submit the report.
10
PRACTICALS
PRACTICALS
Note: After completion of fourth semester, student must complete four to six weeks Summer Internship training which
will be evaluated in fifth Semester.
12
PRACTICALS
* After completion of fourth semester, student must complete four to six weeks Summer Internship training which will
be evaluated in fifth Semester.
13
PRACTICALS
CREDITS PROGRAM
S. No. COURSE CODE COURSE NAME
CORE
1 BCA106
Mathematical Foundation of Computer Science
3
2 BCA107
Basic Mathematics
3 ME -1
3 BCA108
Discrete Structures
3
4 BCA208
Basics of Digital Electronics
3
5 BCA209
Computer Organization
3 ME -2
6 BCA210
Computer Based Numerical And Statistical Techniques
3
7 BCA306
Software Engineering
3
8 BCA307
Software Project Management
3 ME -3
9 BCA308
System Analysis and Design
3
10 BCA406
Cyber Laws and IPR
3
11 BCA407
Information security management
3 ME -4
12 BCA408
Ethical Hacking
3
13 BCA507
Cloud Computing and Virtualization
3
14 BCA508
Data Warehousing And Data Mining
3 ME -5
15 BCA509
Internet of Things
3
CREDITS PROJECT
BASED
S. No. COURSE CODE COURSE NAME
LEARNING
COURSE
1 2 PBL -1
BCA203 Project Based Learning-1
2 2 PBL -2
BCA403 Project Based Learning-2
16
The Co Curriculum Courses will be offer centrally with the following courses code
CO-
S. No. COURSE CODE COURSE NAME CURRICULAR
CREDITS COURSE
1 2 CC -1
UCC001 Communication Skills
2 2 CC -2
UCC002 Environment Studies
3 2 CC -3
UCC003 Management Paradigms from Bhagavad Gita
6 2 CC-6
UCC006 Essence of Indian Traditional Knowledge
7 2 CC-7
UCC007 Vedic Science
8 2 CC-8
UCC008 Vedic Mathematics
The vocational courses will be offer centrally with the following courses code
34 UVC4003 Landscape
18
S. Contact
Contents
No. Hours
Introductions to Computers: Computers and Its Evolution of Computer, Basic Computer
Organization, Input Units, Output Units, Disk Storage, Comparison based Analysis of
1. 8
Various Hardware Components, Algorithm Development, Techniques of Problem Solving,
Flow Chart, Stepwise Refinement Algorithm for Searching
Computer Arithmetic: Binary, Binary Arithmetic, Number System converting from One
3. Number System to Another, Binary to Decimal, Decimal to Hexa Decimal, Hexa Decimal to 7
Octal
Element of Computer Processing System: Hardware CPU, Storage Device and Media,
VDU, Data Communication, Software System Software &Application Software, Structured
4. 6
Programming Concept, Top Down Design, Program Correctness, Debugging and Testing of
Program
Total Hours 35
20
Suggested Books:
S. Year of
Title
No. Publication
S. Contact
Contents
No. Hours
Introduction to Programming Concepts: Software, Classification of Software,
Modular Programming, Structured Programming, Algorithms and Flowcharts with
1. examples, Overview of C Language, History of C, Character Set, C Tokens, Identifiers, 08
Keywords, Data Types, Variables, Constants, Symbolic Constants, Operators in C,
Hierarchy of Operators, Expressions, Type Conversions and Library Functions.
Managing Input & Output Operation: Formatted & Unformatted I/O Functions,
Decision Making, Branching and Looping, Decision Making Statements, if Statement,
ifelse Statement, Nesting of ifelse Statements, elseif Ladder, Switch Statement,
2. 07
Operator, Looping While, Do While, for Loop, Nested Loop, Break, Continue and goto
Statements. Functions, Function Definition, Prototyping, Types of Functions, Passing
Arguments to Functions, Nested Functions, Recursive functions.
Arrays: Declaring & Initializing, One Dimensional Arrays, Two Dimensional Arrays,
MultiDimensional Arrays, Passing Arrays to Functions, Strings, Declaring & Initializing
3. 08
Strings, Operations on Strings, Arrays of Strings, Passing Strings to Functions, Storage
Classes, Automatic, External, Static and Register Variables.
Structures & Union: Declaring & Initializing, Nested Structure, Array of Structure,
Passing Structures to Functions, Unions, Typedef, enum, Bit Fields, Pointers,
4. Declarations, Pointer Arithmetic, Pointers &Functions, Call by Value, Call by 07
Reference, Pointers and Arrays, Arrays of Pointers, Pointers and Structures, Meaning of
Static and Dynamic Memory Allocation, Memory Allocation Functions.
Files Handling: File Modes, File Functions and File Operations, Text & Binary Files,
5. Command Line Arguments, C Preprocessor Directives, Macros, Definition, Types of 07
Macros, Creating and Implementing User Defined Header Files.
Total Hours 37
22
Suggested Books:
S. Year of
Title
No. Publication
1 E. Balaguruswamy, ―Programming In ANSI C‖, 4th Edition, TMH Publications, 2007 2007
Ashok N. Kamthane, ―Programming with ANSI and Turbo C‖, Pearson Education,
2 2006
2006
3 Gottfried, ―Programming in C‖ Schaum‖s Series Tata Mcgraw Hill 2011
4 YashwantKanetkar,‖Let Us C‖ 2005
23
Set Theory: Introduction, Size of Sets and Cardinals, Venn Diagrams, Combination of
Sets, Multi Sets, Ordered Pairs and Set Identities. Relation: Definition, Operations on
1. Relations, Composite Relations, Properties of Relations, Equality of Relations, Partial 07
Order Relation,Functions: Definition, Classification of functions, Operations on functions,
Recursively Defined Functions.
Discrete Numeric Function: Introduction, Piano‘s Axioms, Mathematical Induction,
Strong Induction, Recurrence Relation & Generating Functions, Introduction and
2. Properties of Generating Functions, Simple Recurrence Relation with Constant 08
Coefficients and Linear Recurrence Relation without Constant Coefficients, Methods of
Solving Recurrences.
Propositional Logic: Propositions, Truth Tables, Tautology, Contradiction, Algebra of
Propositions, Theory of Inference & Natural Detection. Predicate Logic, Theory of
3. 08
Predicates, First Order Predicate, Predicate Formulas, Quantifiers, Inference Theory of
Predicate Logic.
Posets, Hasse Diagram and Lattices: Introduction, Partial Ordered Sets, Combination of
4. Partial Ordered Sets, HasseDiagram, Introduction of Lattices, Properties of Lattices, 07
Bounded, Complemented, Modular & Complete Lattice.
Total Hours 36
24
Suggested Books:
S. Year of
Title
No. Publication
S. Contact
Contents
No. Hours
Limits and Continuity: Definition of Limit, Algebra of limits, Right & left-hand limits,
1. Infinite limits, Continuity (Definitions & examples, Algebra of Continuous functions), 13
Differentiability, Rolle‘s and Mean value theorem with numerical problems.
Total Hours 36
26
Suggested Books:
S. Year of
Title
No. Publication
S. Contact
Contents
No. Hours
Sets, Relations and Functions:
Set Theory: Basic operations on sets, Cartesian products, disjoint union (sum), and power
sets, Multisets, ordered pairs, set identities.
Relations: Definition, Types of Relations (reflexivity, symmetry, transitivity, equivalence
1. 8
relation), Operations on relations, Properties of relations, Composite Relations, Equality of
relations.
Functions: Definition, Classification of functions (surjections, injections), Operations on
functions, Recursively defined functions.
Partial Order Sets: Definition, Partial order sets, Combination of partial order sets, Hasse
2. diagram. Lattices: Definition, Properties of lattices – Bounded, Complemented and 6
Complete Lattice
Algebraic Structures: Algebraic structures with one binary operation - semigroup, monoid,
and group. Cosets, Lagrange‘s theorem, normal subgroup, homomorphic subgroup,
3. 10
Permutation groups. Algebraic structures with two binary operations ring, integral domain,
and field.
Propositional Logic:
Propositional Logic: Proposition, well-formed formula, Truth tables, Tautology,
Contradiction, Algebra of proposition, Theory of Inference, Natural Deduction. Predicate
4. Logic: First order predicate, well-formed formula of predicate, quantifiers, Inference 8
theory of predicate logic.
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle, Permutation &
Combinations
Introduction to Graph Theory
Graphs: Definition and terminology, Representation of graphs, operations on graphs,
multigraphs, bipartite graphs, Complete graphs, Regular graph, Planar graphs,
Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph
5. 10
coloring.
Trees: Definition, Binary tree, Binary tree traversal, binary search tree.
Recurrence Relation & Generating function: Recursive definition of functions, Method of
solving recurrences.
Total 42
28
Suggested Books:
Year of
S. No. Name of Books / Authors
Publication
Liu C.L., Elements of Discrete Mathematics, McGraw Hill Int. edn. [Unit 1, Unit
2. 1986
4, Unit 5]
Kolman B & Busby C.R., Discrete Mathematical Structure for Computer Science,
3. 2008
Prentice Hall of India Ltd. [Unit 2, Unit 3]
Trembley J.P. & Manohar R., Discrete Mathematical Structures with Applications
5. 1997
to Computer Science, Tata McGraw Hill. [Unit 2, Unit 3, Unit 5]
29
Suggested Books:
Year of
S. No. Name of Books / Authors
Publication
Module 3:HTML-Form: < input >, <textarea>, < button >, < select >, < label
3. >.HTML-Headers: Title, Base, Link, Styles, Script, Meta HTML-Miscellaneous: 6
HTML Meta Tag, XHTML, HTML Deprecated Tags & Attributes.
4. CSS3-Syntax: CSS Syntax, single Style Sheets, Multiple Style Sheets, Value Lengths 10
and Percentages. CSS3-Selectors: ID Selectors, Class Selectors, Grouping Selectors,
Universal Selector, Descendant / Child Selectors, Attribute Selectors, CSS - Pseudo
Classes. CSS3-Color Background Cursor: background-image, background-repeat,
background-position, CSS Cursor
Total 40
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
2 × 10
Practical Laboratory
= 20
Explore & describe some system utility like Regedit, Memory Partioning, Control Panel,
1. 2 Hrs
Window Tools.
List various keys in registry and perform experiments to back up a key in registry using
2. 2 Hrs
regedit.
Perform an experiment to install any rpm or debianlinux distribution with emphasis on drive
3. 2 Hrs
partitioning.
6. Create, open, edit, view file in linux 10,create user and group through CLI 2 Hrs
Create an office writer document & using tables distinguish between different types of
7. 2 Hrs
memories.
Draft a letter asking for quotations of different peripheral devices for your computer lab and
8. 2 Hrs
mail the letter using mail merge in open office writer.
9. Create an open office writer document and implement macro function. 2 Hrs
Create a template & draw a basic block diagram of computer & using graphs compare the
10. 2 Hrs
performance of different laptop/notebook PC.
34
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
2 Write a Program to print different data types in ‗C‘ and their ranges. 2 Hrs
Write a Program to demonstrate pre increment and post increment. (++a, a++ where a
4 2 Hrs
is a value to be initialized)
Write a Program to read marks of a student in six subjects and print whether pass or
5 2 Hrs
fail (using if-else).
9 Write a Program to display vowels and consonants using switch case. 2 Hrs
Suggested Books:
S. Year of
Title
No. Publication
1 E. Balaguruswamy, ―Programming In ANSI C‖, 4th Edition, TMH Publications, 2007 2007
Ashok N. Kamthane, ―Programming with ANSI and Turbo C‖, Pearson Education,
2 2006
2006
36
4 YashwantKanetkar,‖Let Us C‖ 2005
37
7 Design and web page for login and registration for user using internal CSS. 2 Hrs.
8 Design a web page with background image, text colors and border for text using external CSS. 2 Hrs.
Design a simple single page web site which should have logo, banner image, about us,
9 2 Hrs.
and footer.
Design a simple multiple page website like about us page, service, gallery, and contact
10 2 Hrs.
us page.
38
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
S. Contact
Contents
No. Hours
Introduction: Elementary Data Organization, Data Structures, Data Structures
Operations, Abstract Data Types, Algorithms Complexity, Time Space Trade Off.
Preliminaries, Mathematical Notations and Functions, Algorithmic Notations, Control
1. 08
Structures, Complexity of Algorithms, Asymptotic Notations for Complexity of
Algorithms, String Processing, Definition, Storing Stings, String as ADT, String
Operations, Word/ Text Processing, Pattern Matching Algorithms.
Array: Definition, Linear Arrays, Arrays as ADT, Representation of Linear Arrays in
Memory, Traversing Linear Arrays, Inserting &Deleting,Multi DimensionalArrays,
Matrices and Sparse Matrices.
2. 07
Stack: Definition, Array Representation of Stacks, Linked Representation of Stacks, Stack
as ADT, Arithmetic Expressions, Polish Notation, Application of Stacks, Recursion,
Towers of Hanoi, Implementation of Recursive Procedures by Stack.
Queues: Definition, Array Representation of Queue, Linked List Representation of
Queues Types of Queue, Simple Queue, Circular Queue, Double Ended Queue, Priority
Queue, Operations on Queues, Applications of Queues.
3. Linked List: Definition, Representation of Singly Linked List in Memory, Traversing a 07
Singly Linked List, Searching a Singly Linked List, Memory Allocation, Garbage
Collection, Insertion into a Singly Linked List, Deletion from a Singly Liked List; Doubly
Liked List, Header Liked List, Circular Linked List.
Sorting &Searching: Bubble Sort, Insertion Sort, Selection Sort, Searching, Linear
Search, Binary Search
4. Tree: Definitions, Binary Trees, Representing Binary Trees in Memory, Traversing 08
Binary Trees, Binary Search Trees, Searching, Inserting and Deleting in a Binary Search
Tree.
Graph Terminology: Graph Theory Terminology, Sequential Representation of Graphs,
5. Adjacency Matrix, Traversing a Graph. Minimum Spanning Tree Kruskal‘s Algorithm, 06
Prims Algorithm
Total Hours 36
40
Suggested Books:
S Year of
Name of Books / Authors
No Publication
An Introduction to Data Structures with applications - Jean Paul Trembley and Paul G.
2 2012
Sorenson, McGraw Hill Publications
3 Data Structures and Program Design in C - R. Kruse etal,, Pearson Education 2000
Total Hours 36
42
Suggested Books:
S. Year of
Content
No Publication
2 Beginning Python: Using Python 2.6 and Python 3- James Payne 2010
Total 35
44
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. Digital Design, M. Morris Mano and M. D. Ciletti, 4th Edition, Pearson- UNIT I, II, III 2007
2. Digital Systems: Principles and Design, Raj Kamal, Pearson- UNIT III 2014
3. Maini, Digital Electronics: Principles and Integrated Circuits, Wiley India- UNIT IV, V 2007
4. Switching Theory and Finite Automata, Kohavi, TMH Publications- UNIT V 2009
M. Morris Mano and Michael D.Ciletti– Digital Design: With an introduction to Verilog HDL,
5. 2014
Pearson Education – 5th Edition- 2014. ISBN:9789332535763- UNIT III, IV, V
Malvino, A.P. and Leach, D.P. and GoutamSaha. 2014. Digital Principles and Applications
6. 2014
(SIE). Tata McGraw Hill. ISBN: 9789339203405- UNIT I, II, III
45
S. Contact
Contents
No. Hours
Register Transfer Language, Bus and Memory Transfers, Bus Architecture, Bus
Arbitration, Arithmetic Logic, Shift Microoperation, Arithmetic Logic Shift Unit, Design
1. 8
of Fast address, Arithmetic Algorithms (addition, subtraction, Booth Multiplication),
IEEE standard for Floating point numbers.
Control Design: Hardwired & Micro Programmed (Control Unit): Fundamental Concepts
(Register Transfers, performing of arithmetic or logical operations, fetching a word from
memory, Storing a word in memory), Execution of a complete instruction, Multiple-Bus
2. 7
organization, Hardwired Control, Micro programmed control(Microinstruction,
Microprogram sequencing, Wide-Branch addressing, Microinstruction with Next-address
field, Prefetching Microinstruction).
Memory Organization: Memory Hierarchy, Main Memory (RAM and ROM Chips),
4. organization of Cache Memory, Auxiliary memory, Cache memory, Virtual Memory, 6
Memory management hardware.
Total 35
46
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
M. Morris Mano and Michael D.Ciletti– Digital Design: With an introduction to Verilog HDL,
5. 2014
Pearson Education – 5th Edition- 2014. ISBN:9789332535763.
Malvino, A.P. and Leach, D.P. and GoutamSaha. 2014. Digital Principles and Applications
6. 2014
(SIE). Tata McGraw Hill. ISBN: 9789339203405.
47
Suggested Books:
Year of
S. No. Name of Books / Authors
Publication
1. Gerald &Whealey, ―Applied Numerical Analyses‖, AW 2004
Jain, Iyengar and Jain, ―Numerical Methods for Scientific and Engineering
2. 2012
Computations‖, New Age International
Grewal B S, ―Numerical methods in Engineering and Science‖, Khanna
3. 2007
Publishers, Delhi
T Veerarajan, T Ramachandran, ―Theory and Problems in Numerical Methods,
4. 2018
TMH
5. Pradip Niyogi, ―Numerical Analysis and Algorithms‖, TMH 2017
6. Sastry S. S, ―Introductory Methods of Numerical Analysis‖, Pearson Education. 2005
7 Gupta C.B., Vijay Gupta, ―Introduction to Statistical Methods‖, Vikas Publishing. 2009
Goyal, M, ―Computer Based Numerical and Statistical Techniques‖, Firewall
8 2005
Media, New Delhi.
49
S Contact
Contents
No Hours
Problem Identification: Knowing what the problem before it can be solved.
1. Analysing the different aspect of the problem and finding the solution. 8
Project Design: Creation of different modules of the project as the blue print and
3. analysis of working of different modules as a unit. 10
Project Development: Writing the code for the different modules of the project and
4. combining all the modules as one unit. 8
Project Testing & Documentation: Once the project is ready test the project with
different type of testing in order to insure accurate result. Prepare the proper
5. documentation for the project e.g., Presentation, File etc. 10
Total Hours 42
50
Suggested Books:
S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication
Suggested Books:
S. Year of
Name of Books / Authors
No Publication
Peavy, Howard S., Rowe, Donald R and Tchobanoglous, George, ―Environmental
1 2017
Engineering‖ McGraw Hill Education (India) Pvt. Ltd., New Delhi.
Metcalf & Eddy, ―Wastewater Engineering: Treatment & Reuse‖, Tata Mc-Graw
4 2003
Hill.
Seinfeld, JH and Pandis, SN, ―Atmospheric Chemistry and Physics: From Air
5 2006
Pollution to Climate Change‖, John Wiley
Qasim, S.R., Motley, E.M. and Zhu, G. Water works Engineering – Planning, Design
6 2002
and Operation, Prentice Hall, New Delhi.
Lee, C.C. and Shun dar Lin, Handbook of Environmental Engineering Calculations,
7 1999
Mc Graw Hill, New York.
Subscripting pointer to an array: Array and Function: 1D array and function –Passing
individual array elements to a function –passing individual array elements address to a
function –passing whole 1d array to a function –2D array and function –Passing
individual array elements to a function –passing individual array elements address to a
function –passing whole 2d array to a function –using arrays of function pointer
Dynamic memory allocation: malloc() –calloc() –realloc() . –free().
Structure: Why is structure used? –What is structure? –Advantages of structures –
Defining a Structure –Declaration of Structure Variables –Initialization of Structure
Variables –Accessing Structure Members –Storage of Structures in Memory –Size of
Structures –Reading and Displaying Structure Variables –Assignment of Structure
5. Variables –Pointers to structures –Array of structures –Arrays within structures –Nested 8
structures –Self-referential structures –memory link (linked list) –Bit fields
Union and Enumeration and typedef: What are unions? –Structures versus unions –
Working with unions –Initializing unions –Advantages of unions –enum keyword –
typedef keyword.
Total 38
8. Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. E. Balaguruswamy, ―Programming In ANSI C‖, 4th edition, TMH Publications, 2007 2007
2. Ashok N. Kamthane, ―Programming with ANSI and Turbo C‖, Pearson Education, 2006 2006
4 YashwantKanetkar,‖Let Us C‖ 2005
55
4 Traversal implementation of Binary Tree (Post order, Pre-order and In-order). 2 Hrs
8 To demonstrate the concept of one dimentional array finding the sum of array elements. 2 Hrs
Suggested Books:
S Year of
Name of Books / Authors
No Publication
An Introduction to Data Structures with applications - Jean Paul Trembley and Paul G.
2 2012
Sorenson, McGraw Hill Publications
3 Data Structures and Program Design in C - R. Kruse etal,, Pearson Education 2000
Suggested Books:
S. Year of
Content
No Publication
2 Beginning Python: Using Python 2.6 and Python 3- James Payne 2010
S. Contact
Contents
No. Hours
Event and GUI programming: Event handling in java, Event types, Mouse and
key events, GUI Basics, Panels, Frames, Layout Managers: Flow Layout, Border
3. Layout, Grid Layout, GUI components like Buttons, Check Boxes, Radio Buttons, 10
Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars, Sliders,
Windows, Menus, Dialog Box, Applet and its life cycle, Introduction to swing.
I/O programming: Text and Binary I/O, Binary I/O classes, Object I/O, Random
4. 6
Access Files.
Total Hours 40
59
8. Suggested Books:
S Year of
Content
No Publication
Introduction to Java Programming (Comprehensive Version), Daniel Liang, Seventh
1 2008
Edition, Pearson.
2 Programming in Java, SachinMalhotra&Saurabh Chaudhary, Oxford University Press. 2013
3 Murach‘s Beginning Java 2, Doug Lowe, Joel Murach and Andrea Steelman, SPD. 2005
Core Java Volume-I Fundamentals, Eight Edition, Horstmann& Cornell, Pearson
4 2007
Education.
5 The Complete Reference, Java 2 (Fourth Edition), Herbert Schild, TMH. 2000
S. Contact
Contents
No. Hours
Relational Data Model & Language: Relational Data Model Concepts, Integrity
2. Constraints, Entitu Constraints, Refrential Integrity, Key Constraints, Domain 07
Constraints, Relational Algebra, Relational Calculas, Tuple and Domain Calculas
Total Hours 38
61
8. Suggested Books:
S. Year of
Content
No Publication
S Contact
Contents
No. Hours
INTRODUCTION: Evolving role of software, Software Characteristics, Software
crisis, Silver bullet, Software myths, Software process, Personal Software Process (PSP),
1. Team Software Process (TSP), emergence of software engineering, Software process, 08
project and product, Software Process Models: Waterfall Model, Prototype Model,
Spiral, Model, RAD Model, Iterative Model, Incremental Mode
8. Suggested Books:
S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication
Project Monitoring and Control: Dimensions of Project Monitoring & Control, Earned
Value Analysis, Earned Value Indicators: Budgeted Cost for Work Scheduled (BCWS),
3. Cost Variance (CV), Schedule Variance (SV), Cost Performance Index (CPI), Schedule 08
Performance Index (SPI), Interpretation of Earned Value Indicators, Error Tracking,
Software Reviews, Types of Review, Walkthrough, Code Reviews.
8. Suggested Books:
S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication
S. Contact
Content
No. Hours
System Concepts and Information System Environment: The System Concept,
Definition, Characteristics of Systems, Elements of a System, Open and Closed and closed
1. system, Formal and Informal Information Systems, Computer based Information Systems, 08
Management Information System, Decision Support System, General Business
Knowledge, and Interpersonal Communicational System.
The System Development Life Cycle: Recognition of needs, Impetus for System Change,
Feasibility Study, Analysis, Design, Implementation, Post implementation and
2. Maintenance. The Role of the Systems Analyst: Historical Perspective, Academic and 08
Personal Qualifications, the multifaceted role of the Analyst, The Analyst/User Interface,
Behavioral issues.
Systems Planning and Initial Investigation: Strategies for Determining Information
Requirement, Problem Definition and Project initiation, Background Analysis, Fact
3. Analysis, Review of Written Documents, Onsite Observations, Interviews and 07
Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service
Analysis.
Information Gathering: Kind of Information needed. Information about the firms,
Information gathering tools, the art of Interviewing, Arranging the Interview, Guides to
4. Successful Interview, Types of Interviews and Questionnaires, The Structured and 09
Unstructured Alternatives. The Tools of Structured Analysis: The Dataflow Diagram
(DFD), Data Dictionary, Decision Trees and Structured English.
Feasibility Study: System performance, Economic Feasibility, Technical Feasibility,
5. Behavioral Feasibility, Steps in Feasibility Analysis. Input/Output and Forms Design: 08
Input Design, CRT Screen Design, Output Design, Requirements form Design.
Total Hours 40
67
S. Year of
Content
No. Publication
S. Contact
Content
No. Hours
Spirituality in Business and Workplace Current Challenges in Business Management &
Society Relevance of Ancient Indian Wisdom for contemporary society Spirituality in
Business The notion of Spirituality An introduction to Bhagavad Gita & its relevance.
Perspectives on Leadership and Work Failed Leadership: Causes & Concerns Leadership
Perspectives in the Gita1 Axioms of Work & Performance The Notion of Meaningful
Work
S. Year of
Content
No. Publication
S. Contact
Contents
No. Hours
Introduction: Concept Data Structure –Example –Need of Data structure –Advantages of
using DS.
1. 4
Function: –What is function –Types of function –How function works –Function
recursion and how it works.
Stack: Operations on Stack –Array & Linked Representation –Programs on stack –Push
& Pop operations –Traversing.Applications of Stack.
2. 8
Arithmetic Expression Evaluation –Notations, Infix –Postfix, Prefix –Conversion infix to
post fix –Conversion postfix to infix –Evaluation of Postfix and Pre fix using stack.
Queue: Operations on Queue –Array & Linked Representation –Programs on stack –
Insert & Delete operations –Circular queue ––Deque –Priority Queue –Application of
queue.
Linked List: Concept of linked list –Difference of linklist& array –Single linked list –
3. Representation –Operations –Traversing –Insertion(first node, last node, at a position, 10
after a node value) –Deletion(first node, last node, at a position, after a node value) –
Double linked list –Representation –Operations, traversing –Insertion (first node, last
node, at a position, after a node value) –Deletion (first node, last node, at a position, after
a node value) –Circular link list & header link list example.
Tree: Tree terminology –Binary tree –Complete Binary Tree –Binary search tree –Tree
Traversals –Creation of Binary Tree from traversal methods –Expression Tree &
4. 8
expression Manipulation –Binary Search Tree –Insertion & deletion in BST(Program) –
AVL Tree, M-way Search Tree –B+ tree, Insertion & deletion.
Graph: Graph terminology: Representation of graphs –Path matrix –Graph Traversal –
5. BFS (breadth first search) –DFS (depth first search) –Minimum spanning Tree –Kruskal's 5
Algorithm & Prim's Algorithm –Warshall's algorithm (shortest path algorithm).
Total 35
72
8. Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. Fundamentals of Data Structures – Horowitz and Sahani, Galgotia Publication 2016
An Introduction to Data Structures with applications – Jean Paul Trembley and Paul G.
2. 2012
Sorenson, McGraw Hill Publications
3. Data Structures and Program Design in C – R. Kruse etal,, Pearson Education 2000
Laboratory Experiment 2 × 10 = 20
2 hours
1. Program to define the data types, variable, operators, arrays and control structures.
2 hours
2. Program to define class and constructors. Demonstrate constructors.
2 hours
3. Program to define class, methods and objects. Demonstrate method overloading.
2 hours
4. Program to define inheritance and show method overriding.
2 hours
5. Program to demonstrate Packages.
2 hours
6. Program to demonstrate Exception Handling.
2 hours
7. Program to demonstrate Multithreading.
2 hours
8. Program to demonstrate I/O operations.
2 hours
9. Program to demonstrate Network Programming.
2 hours
10. Program to demonstrate Applet structure and event handling.
8. Suggested Books:
S Year of
Content
No Publication
Introduction to Java Programming (Comprehensive Version), Daniel Liang, Seventh
1 2008
Edition, Pearson.
2 Programming in Java, SachinMalhotra&Saurabh Chaudhary, Oxford University Press. 2013
3 Murach‘s Beginning Java 2, Doug Lowe, Joel Murach and Andrea Steelman, SPD. 2005
Core Java Volume-I Fundamentals, Eight Edition, Horstmann& Cornell, Pearson
4 2007
Education.
75
5 The Complete Reference, Java 2 (Fourth Edition), Herbert Schild, TMH. 2000
1 SQL queries for the creation of tables and insertion of values intotables. 2 Hrs
SQL queries for viewing all data and specific data corresponding to a particular row or
2 2 Hrs
column in atable.
3 SQL queries for the updation, deletion and dropping oftables. 2 Hrs
5 SQL queries for renaming, truncating and destroying the tables. 2 Hrs
6 SQL queries for the use of not null, group by, havingclause. 2 Hrs
S. Year of
Content
No Publication
Suggested Books:
S. Year of
Content
No Publication
1
3
79
S Contact
Contents
No Hours
Deadlock: System Model, Characterization, Methods for Handling Dead Locks. Dead
3. 6
Lock Prevention, Avoidance and Detection, Recovery from Dead Lock.
Organization of File and I/O Subsystems, Directory Management, Basic File System,
File Descriptors, File Manipulation, File Organization Methods, Management of
Auxiliary Storage Space, Command Language and File System Utilities, I/O
5. 8
Subsystems, Programmed I/O, DMA, Interrupt Driven I/O, Recovery Procedures,
Protection and Security, Safeguards, Penetration, Access and Information Flow
Control, Protection Problems, Formal Models of Protection.
Total Hours 36
8. Suggested Books:
S. Year of
Content
No Publication
1 Introduction to Operating Systems: Deitel 2017
S Contact
Contents.
No Hours
Introduction: Web, Web Standards & Browser, Basics of www, Browser, Internet
1. 08
History, Web Standards, W3C Elements, Domain & Hosting.
HTML 5 Basics: HTML, Difference between HTML 4, XHTML & HTML 5, HTML
Elements Doctype, HTML, Head, Title, Body, Headings, Paragraph, Font, Table,
2. 08
Listing, Div, Header, Footer, Article, Nav, Aside, Frames, Script, Anchor, Target
Attribute, Style.
CSS 3 Basics: CSS 3 Basics, Selectors, Inline, Internal & External CSS, Color,
3. Background, Margins, Padding, Text, Alignments, Font, Anchor, Border, RGB, 08
Opacity, List etc.
Java Script Basics: Java Script Introduction, Inline, Internal & External Java Script,
4. Output, Statements, Variables, Objects, Arithmetic, Data Types, Functions, Events, 07
Arrays etc.
82
DHTML: Define DHTML, How and Why Combine HTML, CSS and Java Script,
5. 07
Creation of Small Website of Minimum 7 to 10 Pages Represents Student Profile.
Total Hours 38
8. Suggested Books:
S. Year of
Content
No Publication
S Contact
Contents
No Hours
Cyber Space: Fundamental definitions -Interface of Technology and Law – Jurisprudence
and-Jurisdiction in Cyber Space - Indian Context of Jurisdiction -Enforcement agencies –
1. 8
Need for IT act - UNCITRAL – E-Commerce basics.Information Technology Act, 2000 -
Aims and Objects — Overview of the Act – Jurisdiction
Electronic Governance: Legal Recognition of Electronic Records and Electronic
Evidence -Digital Signature Certificates - Securing Electronic records and secure digital
signatures - Duties of Subscribers - Role of Certifying Authorities - Regulators under the
2. Act -The Cyber Regulations Appellate Tribunal - Internet Service Providers and their 10
Liability– Powers of Police under the Act – Impact of the Act on other Laws. Cyber
Crimes -Meaning of Cyber Crimes –Different Kinds of Cybercrimes – Cybercrimes
under IPC.
Cr.P.C and Indian Evidence Law: Cybercrimes under the Information Technology
3. Act,2000 - Cybercrimes under International Law - Hacking Child Pornography, Cyber 8
Stalking, Denial of service Attack, Virus Dissemination, Software Piracy, Internet Relay
83
Chat (IRC) Crime, Credit Card Fraud, Net Extortion, Phishing etc - Cyber Terrorism-
Violation of Privacy on Internet - Data Protection and Privacy – Indian Court cases.
Intellectual Property Rights: Copyrights- Software – Copyrights vs Patents debate -
Authorship and Assignment Issues - Copyright in Internet - Multimedia and Copyright
4. 6
issues - Software Piracy - Trademarks - Trademarks in Internet – Copyright and
Trademark cases.
Patents: Understanding Patents - European Position on Computer related Patents, Legal
5. position on Computer related Patents - Indian Position on Patents – Case Law, Domain 6
names -registration - Domain Name Disputes-Cyber Squatting-IPR cases
Total 38
8. Suggested Books:
Year of
S.No. Name of the Books/Authors
Publication
1. Justice Yatindra Singh: Cyber Laws, Universal Law Publishing Co., New Delhi 2016
2. Farouq Ahmed, Cyber Law in India, New Era publications, New Delhi 2012
3. S.R.Myneni: Information Technology Law(Cyber Laws), Asia Law House, 2018
Hyderabad
4. Chris Reed, Internet Law-Text and Materials, Cambridge University Press 2004
Pawan Duggal: Cyber Law- the Indian perspective Universal Law Publishing Co.,
5. 2016
New Delhi
84
S Contact
Contents.
No Hours
Fundamentals of Information Security: Key Elements of Networks, Logical Elements of
Network, Critical Information Characteristics, Information States etc.
Information Security Management Concerns: Threats and Attack Vectors, Types of
Attacks, Common Vulnerabilities, and Exposures (CVE), Security Attacks, Computer
1. 10
Security Concerns, Information Security Measures etc., threat and vulnerability
management, incident management, risk management, information leakage, crisis
management and business continuity, legal and compliance, security awareness and
security implementation considerations
Information Security Management : Methodologies and Frameworks: ISO 27000 series
and the Plan-Do-Check-Act model, assessment of threats and vulnerabilities, incident
response, forensics and investigations, risk assessment and risk management frameworks,
2. dealing with classified/ sensitive data, contingency planning, legal and regulatory drivers 9
and issues, certification, common criteria, security awareness, education and training, and
practical considerations when implementing the frameworks to address current and future
threats.
Information Security Management: Methodologies and Frameworks: ISO 27000 series and
the Plan-Do-Check-Act model, assessment of threats and vulnerabilities, incident
response, forensics and investigations, risk assessment and risk management frameworks,
3. dealing with classified/ sensitive data, contingency planning, legal and regulatory drivers 9
and issues, certification, common criteria, security awareness, education and training, and
practical considerations when implementing the frameworks to address current and future
threats.
Information Security Policies, Procedures, and Audits: Information Security Policies
4. necessity-key elements & characteristics, Governance, Security Policy Implementation, 6
Configuration, Security Standards-Guidelines & Frameworks etc.
Information Security Management: Roles and Responsibilities: Security Roles &
5. Responsibilities, Accountability, Roles, and Responsibilities of Information Security 6
Management, team-responding to emergency situation-risk analysis process etc.
Total 40
85
8. Suggested Books:
Year of
Name of the Books/Authors
Publication
1. Harold F. Tipton, Micki Krause, Information Security Management Handbook, CRC
2007
Press
Jake Kouns, Daniel Minoli, Information Technology Risk Management in
2. Enterprise Environments: A Review of Industry Practices and a Practical Guide to 2011
Risk Management Teams, John Wiley & Sons
Dave Tyson, Security Convergence: Managing Enterprise Security Risk,
3. 2011
Butterworth-Heinemann
Malcolm Harkins, Managing Risk and Information Security: Protect to Enable,
4. 2012
Apress
Greg Witte, Melanie Cook, Matt Kerr, Shane Shaffer, Security Automation
5. Essentials: Streamlined Enterprise Security Management & Monitoring with SCAP, 2012
McGraw Hill Professional
86
8. Suggested Books:
Year of
S.No. Name of the Books/Authors
Publication
1. Patrick Engebretson, The Basics of Hacking and Penetration Testing, Elsevier 2013
2. Network Security and Ethical Hacking, Rajat Khare, Luniver Press 2006
Network intrusion alert: an ethical hacking guide to intrusion detection, Ankit
3. 2007
Fadia, Manu Zacharia, Thomson Course Technology PTR,
4. Ethical Hacking, Thomas Mathew, OSB Publisher 2003
Hacking Exposed: Network Security Secrets & Solutions, Stuart McClure, Joel
5. 2005
Scambray and George Kurtz, McGraw-Hill
87
S Contact
Contents
No Hours
1. 8
2. 6
3. 10
4. 8
5. 10
Total Hours 42
88
Suggested Books:
S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication
S Contact
Contents
No Hours
BackgroundofIndianCulture
1. Spirituality and Dharmasas root sources of Indian Culture.
2. Description of Four Ages (Yuga) in Vedas, Upanishads and Puranas - Satyug,
Tretayug, Dwaparyug and Kali yug.
1. 7
3. In perspective of Prakriti Explanation of Trigunas as Sat, Raj and Tama.
4. Difference between Ramayana and Shri Ramcharitmanas Assignment: Read
following chapter(s) of Ramcahritra Manas for Group Discussion.
Chapter 1: Bal Kand
Metaphysics of Manas
1. Period of Creation of Shri Ramcharitmanas and introduction of Valmiki and
Goswami Tulsidas.
2. Description of Brahman and Jiva, Incarnation of Divine existence in Manas.
2. 3. Different Conditions of Prakriti and Human Mind. 8
4. Capacity to bear the divine qualities and sign of higher personality
Assignment: Read following chapter(s) of Ramcahritra Manas for Group Discussion.
Chapter 2: Ayodhya Kand Chapter
3: Arannya Kand
Highest Qualities of Human Personality
1. Amenity (Open Mindness), Decency. Patience, Softness. Sanyamcombined practice
of Dharna-Dhyan-Samadhi, Discipline.
2. Fearlessness, Holiness, Bravery. Thoughtfulness. Precious destined insight,
3. Compassion. 7
3. Renunciation, Devotion towards teacher, Duties of Disciple. Importance of Ayodhya
and Affection of Raja Dasharatha towards his son.
4. Shri Ram's Obedience towards his father and Extreme of Devotion — Mahavir
Hanuman Assignment: Read following chapter(s) of Ramcahritra Manas for Group
90
Discussion.
Chapter 4: Kishkindha Kand Chapter
5: Sundar Kand Chapter
6: Lanka Kand
Ideal Expressions of Different Emotions
1. Idol of Friendship. Maxims of Socialism, Natural Beauty, and Importance of
Environment.
2. Battle as the last option in Different Policies. Techniques of Battle'sSkill.
4. 3. Respect towards existence and presence of different animals and birds. 8
4. Construction of Bridge a Unique example of Engineering and Raja Ram as a
Tapaswi Assignment: Read following chapter(s) of Ramcahritra Manas for Group
Discussion.
Chapter 7: Uttar Kand
Total Hours 42
Suggested Books:
S. Year of
Content
No Publication
1 Jiwan ka Satya,SwaamiRamsukh Das, Geeta Press, Gorakhpur 1994
Shri Ram Charitra Manas Code82, Tikakar Shri Hanuman Prasad Poddar, Geeta
2 1994
Press, Gorakhpur
S. Contact
Contents
No. Hours
1. 4
2. 8
3. 10
4. 8
5. 5
Total 35
92
8. Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1.
2.
3.
4.
93
Laboratory Experiment 2 x 10 = 20
Study of Unix/Linux General Purpose Utility Command List Obtained from (Man,
2 Who, CD, PS, LS, MV, MKDIR, RMDIR, Echo, More, Date, Time, Kill, History, 2 Hrs
CHMOD, Chown, Finger, PWD, CAL, Logout, Shut Down)Commands.
6 Basic UNIX Commands and various UNIX editors such as vi, ed, ex and EMACS. 2 Hrs
8 Program for system calls of unix operating systems (opendir, readdir, closedir) 2 Hrs
9 Program for system calls of unix operating system (fork, getpid, exit) 2 Hrs
Suggested Books:
S. Year of
Content
No Publication
1 Introduction to Operating Systems: Deitel 2017
1. Home page Development static pages (using Only HTML) of an online Book store. 2 Hrs
2. Validate the Registration, user login and payment by credit card pages using JavaScript. 2 Hrs
To write a program, which takes user id as input and displays the user details by taking
3. 2 Hrs
the user information from the XML document?
To create a simple Bean with a label - which is the count of number of clicks and a
5. 2 Hrs
BeanInfo class such that only the ―count‖ property is visible in the Property Window.
To create two Beans Traffic Light which implemented as a Label with only three
6. background coloursRed,Green,Yellow and Automobile which is implemented as a 2 Hrs
TextBox which states its state/movement with above stated conditions.
To convert the static web pages online library into dynamic web pages using servlets &
7. 2 Hrs
cookies.
Suggested Books:
S. Year of
Content
No Publication
Suggested Books:
S. Year of
Content
No Publication
1.
2.
3.
99
S. Contact
Content
No. Hours
Introduction: Introduction, Motivation, OSI Model, Signals & Media, Bits Over Signals,
Synchronous Communication, Modulation &Modems, Band Width, Throughput and
1. 08
Noise, Time Division and Frequency Division Multiplexing, Standards, Switching
Methods, ISDN.
Physical Layer: Physical Layer Design Issues (Service provided to data link layer)
2. 08
Introduction Transmission Media, RS232C & RS449, Line Coding, Switching Techniques.
Data Link Layer: Data Link Layer Design Issues (Service provided to N/W Layer),
Framing, Error Control, Flow Control, Link Management, Error Detection & Error
Correction Coding, Data Link Protocols (Elementary and Sliding Window), Local and
3. 08
Metropolitan Area Networks, The Medium Access Sub Layer, Static & Dynamic Channel
Allocation in LANs and MANs, ALOHA Protocols (Pure & Slotted), Different Protocols
of LAN, IEEE Standard 802 for LAN (802.2, 802.4,802.5).
Network Layer: Network Layer Design Issues (Service provided to transport layer,
Routing, Congestion, Internet Working, Routing Algorithms, Congestion Control
4. Algorithm Internet Working, Congestion Control, Design Issues, Buffer Management, 07
Synchronization, Session and Presentation Layer Synchronization Issues, Formatting, Data
Compression, Data Security.
Total Hours 38
100
S. Year of
Content
No. Publication
Young, Margret Levine Internet: The Complete Reference, Tata McGraw Hill, New
5. 2002
Delhi,2002.
101
S. Contact
Contents
No. Hours
Fundamentals of Artificial Intelligence: Introduction, A.I. Representation, Non-AI
&AI Techniques, Representation of Knowledge, KnowledgeBase Systems, State Space
1. Search, Production Systems, Problem Characteristics, types of production systems, 6
Intelligent Agents and Environments, concept of rationality, the nature of
environments, structure of agents, problem solving agents, problem formulation.
Uninformed Search Strategies: Formulation of real-world problems, Breadth First
Search, Depth First Search, Depth Limited Search, Iterative Deepening Depth First
2. 8
Search, Bidirectional Search, Comparison of Uninformed search Strategies, Searching
with partial information, Sensor-less problems Contingency problems.
Informed Search Strategies: Generate& test, Hill Climbing, Best First Search, A* and
3. AO* Algorithm, Constraint satisfaction, Game playing: Minimax Search, Alpha-Beta 6
Cutoffs, Waiting for Quiescence.
Knowledge Representation: Knowledge based agents, Wumpus world. Propositional
Logic: Representation, Inference, Reasoning Patterns, Resolution, Forward and
Backward Chaining. First order Logic:Representation, Inference, Reasoning Patterns,
4. 8
Resolution, Forward and Backward Chaining.
Basics of PROLOG: Representation, Structure, Backtracking. Expert System: Case
study of Expert System in PROLOG
Introduction to Planning and ANN: Blocks world, STRIPS, Implementation using
goal stack, Introduction to Neural networks: - basic, comparison of human brain and
5. machine, biological neuron, general neuron model, activation functions, Perceptron 8
learning rule, applications and advantages of neural networks. Brief introduction to
single layer and multiplayer networks.
Uncertainty: Non-Monotonic Reasoning, Logics for Non-Monotonic Reasoning,
Justification based Truth Maintenance Systems, Semantic Nets, Statistical Reasoning,
6. 6
Fuzzy logic: fuzzy set definition and types, membership function, designing a fuzzy set
for a given application. Probability and Bayes‘ theorem, Bayesian Networks.
Total 42
102
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. Elaine Rich and Kevin Knight: "Artificial Intelligence." Tata McGraw Hill 2017
Ivan Bratko : "Prolog Programming For Artificial Intelligence" , 2nd Edition Addison
3. 2001
Wesley, 1440.
S. Contact
Contents
No. Hours
Introduction to Cloud Computing: Overview: introduction to cloud computing, OS
and Virtualization, VM, advantage of Virtualization, Virtualization and cloud and its
overlapping, service driven model, advantage of cloud computing: marketing point of
view, types of services, business value, business impact of cloud, technological value
of cloud, end user benefits, change for provider and administrator, pros and cons of
cloud model, anatomy of cloud, solution component, service catalog,user self-service
portal, service request management, provisioning, optimized infrastructure,
chargeback, benefit of cloud, delivery and deployment model,different cloud
1. architecture: public, private and hybrid and its pros and cons, delivery models. Cloud 10
transformation roadmap, history of cloud, Clint-server,cluster, grid models, cloud vs
grid and their relationship, cluster and cloud, utility computing and evolution of cloud
computing, cloud computing.
Milestones.
Introduction to Virtualization: Overview of Virtualization: Need of Virtualization,
traditional IT Infrastructure, shortcoming of physical infrastructure, benefit
ofVirtualization, comparison of traditional IT infrastructure with virtualized
infrastructure.
Virtualization: Implementing Virtualization, typical hardware / software server stack
and its logical equivalence, pre/post virtualization server stack, types of virtualization,
2. area and technology-based classification, history of virtualization, time sharing system, 6
IBM mainframe and PowerVM virtualization, Extending Virtualization to x86 and its
hardware support, impact of Virtualization: cost and manageability impact.
Server and Storage Virtualization: Types of Server Virtualization, simulation,
Hardware Assisted Virtualization, Hypervisors, Ring levels on x86 processors, types
of Hypervisors, IBM PowerVM Hypervisors, common consideration in server
3. Virtualization, Desktop Virtualization: Benefits Constraints and Types. Anatomy of 7
serverVirtualization, three major layers in Xen server, storage Virtualization overview:
benefit and types, features of logical layers, Host level storage Virtualization, host-
based mirroring, storage level Virtualization, network-based storage Virtualization.
104
8. Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
John Rittinghouse and James Ransome, Cloud Computing, Implementation, Management 2010
1.
and Strategy, CRC Press, 2010.
Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You 2008
2.
Work and Collaborate Que Publishing, August 2008.
James E Smith, Ravi Nair, Virtual Machines, Morgan Kaufmann Publishers, 2006. 2006
3
David E. Y. Sarna Implementing and Developing Cloud Application, CRC press 2011. 2011
4
Lee Badger, Tim Grance, Robert Patt-Corner, Jeff Voas, NIST, Draft cloud computing 2011
5 synopsis and recommendation, May 2011.
105
S. Contact
Contents
No. Hours
Basic Concepts - Data Warehousing Components – Building a Data Warehouse –
Database Architectures for Parallel Processing – Parallel DBMS Vendors -
1. Multidimensional Data Model – Data Warehouse Schemas for Decision Support, 10
Concept Hierarchies -Characteristics of OLAP Systems – Typical OLAP Operations,
OLAP and OLTP.
Introduction to Data Mining Systems – Knowledge Discovery Process – Data Mining
Techniques – Issues – applications- Data Objects and attribute types, Statistical
2. description of data, Data Preprocessing – Cleaning, Integration, Reduction, 6
Transformation and discretization, Data Visualization, Data similarity and
dissimilarity measures.
Mining Frequent Patterns, Associations and Correlations – Mining Methods- Pattern
3. Evaluation Method – Pattern Mining in Multilevel, Multi Dimensional Space – 7
Constraint Based Frequent Pattern Mining, Classification using Frequent Patterns
Decision Tree Induction - Bayesian Classification – Rule Based Classification –
Classification by Back Propagation – Support Vector Machines –– Lazy Learners –
Model Evaluation and Selection-Techniques to improve Classification Accuracy.
4. Clustering Techniques – Cluster analysis-Partitioning Methods - Hierarchical Methods 5
– Density Based Methods - Grid Based Methods – Evaluation of clustering –
Clustering high dimensional data- Clustering with constraints, Outlier analysis-outlier
detection methods.
Datasets – Introduction, Iris plants database, Breast cancer database, Auto imports
5. database - Introduction to WEKA, The Explorer – Getting started, Exploring the 10
explorer, Learning algorithms, Clustering algorithms, Association–rule learners.
Total 38
106
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques‖, Third 2012
1.
Edition, Elsevier, 2012
Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP‖, Tata 2016
2.
McGraw – Hill Edition, 35th Reprint 2016.
K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and 2006
3
Practice‖, Eastern Economy Edition, Prentice Hall of India, 2006.
107
S. Contact
Contents
No. Hours
Introduction to IoT: Sensing, Actuation, Networking basics, Communication
Protocols, Sensor Networks, Machine-to-Machine Communications, IoT Definition,
1. 10
Characteristics. IoT Functional Blocks, Physical design of IoT, Logical design of IoT,
Communication models & APIs.
M2M to IoT-The Vision-Introduction, From M2M to IoT, M2M towards IoT-the
2. global context, A use case example, Differing Characteristics. Definitions, M2M 6
Value Chains, IoT Value Chains, An emerging industrial structure for IoT,
M2M vs IoT An Architectural Overview–Building architecture, Main design
3. principles and needed capabilities, An IoT architecture outline, standards 7
considerations. Reference Architecture and Reference Model of IoT.
IoT Reference Architecture- Getting Familiar with IoT Architecture, Various
architectural views of IoT such as Functional, Information, Operational and
4. 5
Deployment. Constraints affecting design in IoT world- Introduction, Technical design
Constraints.
Domain specific applications of IoT: Home automation, Industry applications,
Surveillance applications, Other IoT application.
Developing IoT solutions: Introduction to Python, Introduction to different IoT tools,
5. 10
Introduction to Arduino and Raspberry Pi Implementation of IoT with Arduino and
Raspberry, Cloud Computing, Fog Computing, Connected Vehicles, Data Aggregation
for the IoT in Smart Cities, Privacy and Security Issues in IoT.
Total 38
108
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis 2014
1. Karnouskos, David Boyle, ―From Machine-to-Machine to the Internet of Things:
Introduction to a New Age of Intelligence‖, 1st Edition, Academic Press, 2014.
Vijay Madisetti and Arshdeep Bahga, ―Internet of Things (A Hands-onApproach)‖, 2014
2.
1st Edition, VPT, 2014
Francis daCosta, ―Rethinking the Internet of Things: A Scalable Approach to 2013
3
Connecting Everything‖, 1st Edition, Apress Publications, 2013
Cuno Pfister, Getting Started with the Internet of Things, O‟Reilly Media, 2011, 2011
4
ISBN: 978-1-4493- 9357-1
109
S. Contact
Contents
No. Hours
1. 10
2. 6
3. 7
4. 5
5. 10
Total 38
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1.
2.
4
110
S. Contact
Contents
No. Hours
Life of Swami Vivekananda - as a boy and as a wandering monk Sri Ramakrishna and
1. 10
his impact on SwamiVivekananda
Parliament of religions; his travels in India and abroad, his return and activities for
2. 6
National regeneration. Vivekananda and ContemporaryIndia
Vivekananda and Yogic Methods: Raj yoga, Bhakti Yoga, Karma Yoga and
4. 5
JnanaYoga Harmony between Education, Science and differentReligions
Swami Vivekananda‘s views on: Caste, Society, Politics, Art, Literature and
5. Manmaking Education The Message of Swami Vivekananda for the upliftment of 10
masses, women andyouth. Vivekananda in Uttarakhand
Total 38
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. Rolland, R. (2001). Life of Ramakrishna.Kolkata: Advaita Ashrama. 2001
Godman, D. (1985). Be as You Are: The teachings of Sri Raman Maharishi.Delhi: 1985
2.
Penguin Books.
111
S. Contact
Contents
No. Hours
1. 4
2. 8
3. 10
4. 8
5. 5
Total 35
113
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1.
2.
3.
4.
114
S. Contact
Content
No. Hours
1. 08
2. 08
3. 08
4. 07
5. 07
Total Hours 38
115
S. Year of
Content
No. Publication
1.
2.
3.
4.
5.
116
2 hours
3. Implementation of AO* algorithm
2 hours
4. Implementation of Hill Climbing
2 hours
5. Implement Perceptron learning algorithm
2 hours
6. Implement a real-life application in Prolog.
2 hours
7. Expert System in Prolog-new application
2 hours
8. Implement any two Player game using min-max search algorithm.
2 hours
9. Design a fuzzy set for shape matching of handwritten character
2 hours
10. Implementation of fuzzy set for a given application
Suggested Books:
S. Year of
Name of Books / Authors
No. Publication
1. Elaine Rich and Kevin Knight: "Artificial Intelligence." Tata McGraw Hill 2017
Ivan Bratko : "Prolog Programming For Artificial Intelligence" , 2nd Edition Addison
3. 2001
Wesley, 1440.
Suggested Books:
S. Year of
Content
No Publication
1.
2.
3.
119
S Contact
Content
No Hours
INTRODUCTION TO BIG DATA AND HADOOP: Types of Digital Data,
Introduction to Big Data, Big Data Analytics, History of Hadoop, Apache Hadoop,
1. Analyzing Data with Unix tools, Analyzing Data with Hadoop, Hadoop Streaming, 08
Hadoop Echo System, IBM Big Data Strategy, Introduction to InfosphereBigInsights and
Big Sheets.
HDFS (Hadoop Distributed File System): The Design of HDFS, HDFS Concepts,
Command Line Interface, Hadoop file system interfaces, Data flow, Data Ingest with
2. 07
Flume and Scoop and Hadoop archives, Hadoop I/O: Compression, Serialization, Avro
and File-Based Data structures.
Map Reduce: Anatomy of a Map Reduce Job Run, Failures, Job Scheduling, Shuffle and
3. 08
Sort, Task Execution, Map Reduce Types and Formats, Map Reduce Features
Hadoop Eco System Pig: Introduction to PIG, Execution Modes of Pig, Comparison of
Pig with Databases, Grunt, Pig Latin, User Defined Functions, Data Processing operators.
4. 08
Hive: Hive Shell, Hive Services, Hive Metastore, Comparison with Traditional
Databases, Tables, Querying Data and User Defined Functions.
Suggested books:
S. Year of
Content
No Publication
1. Tom White ―Hadoop: The Definitive Guide‖ Third Edition, O‘reilyMedia,. 2012
2. SeemaAcharya, SubhasiniChellappan, "Big Data Analytics" Wiley. 2015
3. Michael Berthold, David J. Hand, "Intelligent Data Analysis‖, Springer, 2007
Jay Liebowitz, ―Big Data and Business Analytics‖ Auerbach Publications, CRC
4. 2013
press
Tom Plunkett, Mark Hornick, ―Using R to Unlock the Value of Big Data: Big Data
5. Analytics with Oracle R Enterprise and Oracle R Connector for Hadoop‖, McGraw- 2013
Hill/Osborne Media (2013), Oracle press.
AnandRajaraman and Jefrey David Ulman, ―Mining of Massive Datasets‖,
6. Cambridge University Press 2012
Bill Franks, ―Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
7. Streams with Advanced Analytics‖, John Wiley & sons 2012
8. Glen J. Myat, ―Making Sense of Data‖, John Wiley & Sons 2007
9. Pete Warden, ―Big Data Glossary‖, O‘Reily 2011
121
S Contact
Contents
No Hours
Cryptography and Network Security: Introduction to the Concept of Security,
Cryptographic Techniques, Computer-based Symmetric and Asymmetric Key
1. Cryptographic Algorithms, Public Key Infrastructure (PKI), Internet Security Protocols, 08
Network Security.
Total Hours 36
6. Suggested Books:
122
S. Year of
Content
No Publication
S Contact
Contents
No Hours
1.
2.
3.
4.
5.
Total Hours 36
5. Suggested Books:
S. Year of
Content
No Publication
1 2011
124
2 2012
3 2009
4 2017
5 2011
125
S. Year of
Content
No Publication
1. Tom White ―Hadoop: The Definitive Guide‖ Third Edition, O‘reilyMedia,. 2012
2. SeemaAcharya, SubhasiniChellappan, "Big Data Analytics" Wiley. 2015
3. Michael Berthold, David J. Hand, "Intelligent Data Analysis‖, Springer, 2007
Jay Liebowitz, ―Big Data and Business Analytics‖ Auerbach Publications, CRC
4. 2013
press
Tom Plunkett, Mark Hornick, ―Using R to Unlock the Value of Big Data: Big Data
5. Analytics with Oracle R Enterprise and Oracle R Connector for Hadoop‖, McGraw- 2013
Hill/Osborne Media (2013), Oracle press.
AnandRajaraman and Jefrey David Ulman, ―Mining of Massive Datasets‖,
6. Cambridge University Press 2012
Bill Franks, ―Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
7. Streams with Advanced Analytics‖, John Wiley & sons 2012
8. Glen J. Myat, ―Making Sense of Data‖, John Wiley & Sons 2007
9. Pete Warden, ―Big Data Glossary‖, O‘Reily 2011
127
8. Suggested Books:
S. Year of
Content
No Publication