You are on page 1of 127

1

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,

1. Wide flexibility in selection of Major Elective and Minor Elective

2. Continuous Skilling all through the duration of the Course

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.

3) Research at Undergraduate Level: At UETR the undergraduate students will be


groomed to carryout research investigations by the mentoring faculty members and
publish research papers authored by them.
2

4) Lectures from Distinguished Mentors: A number of eminent academicians from


India and abroad have consented to deliver lectures in their specialisations to students
of UETR. A few leading experts from Industry too are there as UETR Distinguished
Mentors. They will provide unparalleled knowledge through lectures and project
guidance.

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.

6) Vocational Courses: Besides the prescribed curriculum, there will be specially


designed subjects, called Vocational Courses, which will be available to students to
gain special skills.

7) Non-Governmental Organization Internship Course: Course for students to Learn,


Perform and Grab with focus on self-development, civic engagement, & collectivism
building. The course goal is to realize their potentials by being a Global citizen &
support in the achievement of Sustainable Development Goals working inclusively &
collaboratively.

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

3) Teaching Scheme 8-13

4) Detailed Syllabus: Semester 1

5) Detailed Syllabus: Semester 2

6) Detailed Syllabus: Semester 3

7) Detailed Syllabus: Semester 4

8) Detailed Syllabus: Semester 5

9) Detailed Syllabus: Semester 6


4

ABBREVIATIONS
CT - Course Type

Cr - Credit

L - Lecture

T - Tutorial

P - Practical Hours

PC - Program Core

ME - Major Elective

MNE - Minor Elective

PBL - Project Based Learning

CC - Co-curricular
VC - Vocational Course
NGOI - Non-Governmental Organization Internship

SIR - Summer Internship Report

PJ - Project

TH - Theory End Semester Examination Duration

ATT - Attendance

CWA - Class Work Assessment

PWA - Practical Work Assessment


5

MTE 1 - Mid Term Examination I

MTE 2 - Mid Term Examination II

ESE - End Semester Examination

VAP - Value Added Program


6

BOARD OF STUDIES
SCHOOL OF COMPUTING
UETR
S. No. Category Name Role in BOS

1) Head/Coordinator of the Department Dr. Kamal Kant Verma (SOC) Chairperson

Dr. Satyajee Srivastava (SOC)


2) All Professors of the Department Members
Dr. Gesu Thakur (SOC)

Associate Professors of the Dr. Kamal Kant Verma (SOC)


3) Members
Department Dr.Sunil Shukla (SOC)

02 (Two) Assistant Professors of the Mr. Ravi Kumar (SOC)


4) Member
Department Mr. Bhupal Arya (SOC)

Dr. Veera Lakshmi (SOB)


04 (Four) teachers from inter related Dr. Minisha Phogat (SOA)
5) Member
Departments Dr. D. V. Gupta (Maths)
Dr. (Mrs.) Rashmi Gupta (English)

Non-Member
6) Nominee of the Registrar Mr. Sohan Lal (Dy. Registrar)
Secretary

7) Special Invitee Dr. S P Gupta Non-Member

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

2) Dr. Balasubramanian Raman, Professor, Department of CSE, IIT Roorkee

3) Dr. Ankit Kumar Jain, Assistant Professor, Department of CSE, NIT Kurukshetra
7

BCA WITH SPECIALIZATION IN COMPUTER


APPLICATIONS

BREAKUP OF CREADITS

SNO. Category Creadits %age


1 PC
2
3
4
5
6
7
8
9
Total
8

SCHOOL OF COMPUTING (SOC)

BACHELOR IN COMPUTER APPLICATIONS (BCA)


Total Credits: 137
FIRST YEAR ODD SEMESTER (Credits: 23)
Sl. CWA/
CODE COURSE TITLE CT L T P Cr ATT MTE1 MTE2 ESE Total
No. PWA
Fundamentals of Information
1) BCA101 PC 3 0 0 3 5 5 10 10 70 100
Technology

2) BCA102 Introduction to ‗C‘ Language PC 3 0 0 3 5 5 10 10 70 100

3) - Major Elective-1 ME 4 0 0 4 5 5 10 10 70 100

4) - Minor Elective-1 MNE 3 0 0 3 5 5 10 10 70 100

6) UCC001 Communication Skills CC 2 0 0 2 5 5 10 10 70 100

7) BCA131 Web designing VAP 2 0 0 2 5 5 10 10 70 100

8) UVC1001 Organic Farming VC 3 0 0 3 5 5 10 10 70 100

PRACTICALS

Fundamentals of Information
8) BCA191 PC 0 0 2 1 5 15 5 5 70 100
Technology Lab

9) BCA192 Introduction to ‗C‘ Language Lab PC 0 0 2 1 5 15 5 5 70 100

10) BCA193 Web designing Lab VAP 0 0 2 1 5 15 5 5 70 100

TOTAL 20 0 6 23 700 1000

FIRST YEAR ODD SEMESTER MAJOR ELECTIVE-1


Sl.
CODE TITLE CT L T P Cr ATT CWA MTE1 MTE2 ESE Total
No.
BCA111 Mathematical Foundation of ME
1) 4 0 0 4 5 5 10 10 70 100
Computer Science
BCA112 ME
2) Basic Mathematics 4 0 0 4 5 5 10 10 70 100
BCA113 ME
3) Discrete Structures 4 0 0 4 5 5 10 10 70 100
9

FIRST YEAR EVEN SEMESTER (Credits:26 )


CWA/
Sl.
CODE COURSE TITLE CT L T P Cr ATT PWA MTE1 MTE2 ESE Total
No.

1) BCA201 Data Structures using‘ C‘ PC 3 0 0 3 5 5 10 10 70 100

2) BCA202 Python Programming PC 3 0 0 3 5 5 10 10 70 100

3) - Major Elective-2 ME 4 0 0 4 5 5 10 10 70 100

4) - Minor Elective-2 MNE 3 0 0 3 5 5 10 10 70 100

Environment Studies and Value


5) UCC002 CC 2 0 0 2 5 5 10 10 70 100
Education

6) BCA231 Problem Solving Skill-1 VAP 2 0 0 2 5 5 10 10 70 100

7) UVC2001 Business Communication VC 3 0 0 3 5 5 10 10 70 100

PRACTICALS

08) BCA291 Data Structures using ‗C‘ Lab PC 0 0 2 1 5 15 5 5 70 100

09) BCA292 Python Programming Lab PC 0 0 2 1 5 15 5 5 70 100

10) BCA293 Problem Solving Skill-1 Lab VAP 0 0 2 1 5 15 5 5 70 100

11) BCA294 Project Based Learning-1 Lab PBL 0 0 4 2 5 15 5 5 70 100

12) BCA295 NGO Internship* IIE - - - 1 5 15 5 5 70 100

TOTAL 20 0 10 26 840 1200

FIRST YEAR EVEN SEMESTER MAJOR ELECTIVE-2


Sl.
CODE TITLE CT L T P Cr ATT CWA MTE1 MTE2 ESE Total
No.
BCA211 ME
1) Basics of Digital Electronics 4 0 0 4 5 5 10 10 70 100
BCA212 ME
2) Computer Organization 4 0 0 4 5 5 10 10 70 100
BCA213 Computer Based Numerical And ME
3) 4 0 0 4 5 5 10 10 70 100
Statistical Techniques

*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

SECOND YEAR ODD SEMESTER (Credits:23 )


Sl. CWA/
CODE COURSE TITLE CT L T P Cr ATT MTE1 MTE2 ESE Total
No. PWA

1) BCA301 Paradigm of OOPS Concepts with Java PC 3 0 0 3 5 5 10 10 70 100

2) BCA302 Database Management System PC 3 0 0 3 5 5 10 10 70 100

3) - Major Elective-3 ME 4 0 0 4 5 5 10 10 70 100

4) - Minor Elective-3 MNE 3 0 0 3 5 5 10 10 70 100

Management Paradigms from Bhagavad


5) UCC003 CC 2 0 0 2 5 5 10 10 70 100
Gita

6) BCA331 Problem Solving Skill-2 VAP 2 0 0 2 5 5 10 10 70 100

7) UVC4001 Drawing and Color Studies VC 3 0 0 3 5 5 10 10 70 100

PRACTICALS

Paradigm of OOPS Concepts with Java


8) BCA391 PC 0 0 2 1 5 15 5 5 70 100
Lab

9) BCA392 Database Management System Lab PC 0 0 2 1 5 15 5 5 70 100

10) BCA393 Problem Solving Skill-2 Lab VAP 0 0 2 1 5 15 5 5 70 100

TOTAL 20 0 6 23 700 1000

SECOND YEAR ODD SEMESTER MAJOR ELECTIVE-3


Sl.
CODE TITLE CT L T P Cr ATT CWA MTE1 MTE2 ESE Total
No.
BCA311 ME
1) Software Engineering 4 0 0 4 5 5 10 10 70 100
BCA312 ME
2) Software Project Management 4 0 0 4 5 5 10 10 70 100
BCA313 ME
3) System Analysis and Design 4 0 0 4 5 5 10 10 70 100
11

SECOND YEAR EVEN SEMESTER (Credits:25 )


Sl. CWA/
CODE COURSE TITLE CT L T P Cr ATT MTE1 MTE2 ESE Total
No. PWA

1) BCA401 Operating System PC 3 0 0 3 5 5 10 10 70 100

2) BCA402 Advanced Web Technology PC 3 0 0 3 5 5 10 10 70 100

3) - Major Elective-4 ME 4 0 0 4 5 5 10 10 70 100

4) - Minor Elective-4 MNE 3 0 0 3 5 5 10 10 70 100

Personality Development through


applied
5) UCC004 CC 2 0 0 2 5 5 10 10 70 100
Philosophy of Ramanaya and
Ramcharitra Manas

6) BCA431 Problem Solving Skill-3 VAP 2 0 0 2 5 5 10 10 70 100

7) UVC3005 Data Science & Applications VC 3 0 0 3 5 5 10 10 70 100

PRACTICALS

8) BCA491 Operating System Lab PC 0 0 2 1 5 15 5 5 70 100

9) BCA492 Advanced Web Technology Lab PC 0 0 2 1 5 15 5 5 70 100

10) BCA493 Problem Solving Skill-3 Lab VAP 0 0 2 1 5 15 5 5 70 100

11) BCA494 Project Based Learning-2 PBL 0 0 4 2 5 15 5 5 70 100

TOTAL 20 0 10 25 770 1100

SECOND YEAR EVEN SEMESTER MAJOR ELECTIVE-4


Sl.
CODE TITLE CT L T P Cr ATT CWA MTE1 MTE2 ESE Total
No.
BCA411 ME
1) Cyber Laws and IPR 4 0 0 4 5 5 10 10 70 100
BCA412 ME
2) Information security management 4 0 0 4 5 5 10 10 70 100
BCA413 ME
3) Ethical Hacking 4 0 0 4 5 5 10 10 70 100

Note: After completion of fourth semester, student must complete four to six weeks Summer Internship training which
will be evaluated in fifth Semester.
12

THIRD YEAR ODD SEMESTER (Credits:26 )


Sl. CWA/
CODE COURSE TITLE CT L T P Cr ATT MTE1 MTE2 ESE Total
No. PWA

1) BCA501 Data Communication and Networks PC 3 0 0 3 5 5 10 10 70 100

2) BCA502 Artificial intelligence PC 3 0 0 3 5 5 10 10 70 100

3) - Major Elective-5 ME 4 0 0 4 5 5 10 10 70 100

4) - Minor Elective-5 MNE 3 0 0 3 5 5 10 10 70 100

5) BCA503 Capstone Project -1 PJ 3 0 0 3 5 5 10 10 70 100

6) UCC005 Vivekananda Studies CC 2 0 0 2 5 5 10 10 70 100

7) BCA531 Problem Solving Skill-4 VAP 2 0 0 2 5 5 10 10 70 100

PRACTICALS

Data Communication and Networks


8) BCA591 PC 0 0 2 1 5 15 5 5 70 100
Lab

09) BCA592 Artificial intelligence Lab PC 0 0 2 1 5 15 5 5 70 100

10) BCA593 Problem Solving Skill-4 VAP 0 0 2 1 5 15 5 5 70 100

11) BAC594 Summer Internship Report* IIE - - - 3 5 15 5 5 70 100

TOTAL 20 0 6 26 770 1100

THIRD YEAR ODD SEMESTER MAJOR ELECTIVE-5


Sl.
CODE TITLE CT L T P Cr ATT CWA MTE1 MTE2 ESE Total
No.
BCA511 ME
1) Cloud Computing and Virtualization 4 0 0 4 5 5 10 10 700 100
BCA512 Data Warehousing And Data ME
2) 4 0 0 4 5 5 10 10 700 100
Mining
BCA513 ME
3) Internet of Things 4 0 0 4 5 5 10 10 700 100

* After completion of fourth semester, student must complete four to six weeks Summer Internship training which will
be evaluated in fifth Semester.
13

THIRD YEAR EVEN SEMESTER (Credits:14 )


Sl. CWA/
CODE COURSE TITLE CT L T P Cr ATT MTE1 MTE2 ESE Total
No. PWA

1) BCA601 Big Data Analytics PC 3 0 0 3 5 5 10 10 70 100

2) BCA602 Networks and Cyber Security PC 3 0 0 3 5 5 10 10 70 100

3) BCA603 Capstone Project -2 PJ 0 0 12 6 10 100 50 50 210 300

PRACTICALS

4) BCA611 Big Data Analytics Lab PC 0 0 2 1 5 15 5 5 70 100

5) BCA612 Networks and Cyber Security Lab PC 0 0 2 1 5 15 5 5 70 100

TOTAL 6 0 16 14 490 700


14

List of Program Core Courses

CREDITS PROGRAM
S. No. COURSE CODE COURSE NAME
CORE

1 BCA101 Fundamentals of Information Technology 3


PC -1

2 BCA102 Introduction to ‗C‘ Language 3


PC -2

3 BCA181 Fundamentals of Information Technology Lab 1


PC -3

4 BCA182 Introduction to ‗C‘ Language Lab 1


PC -4

5 BCA201 Data Structures using‘ C‘ 3


PC -5

6 BCA202 Python Programming 3


PC -6

7 BCA281 Data Structures using ‗C‘ Lab 1


PC -7

8 BCA282 Python Programming Lab 1


PC -8

9 BCA301 Paradigm of OOPS Concepts with Java 3


PC -9

10 BCA302 Database Management System 3


PC -10

11 BCA381 Paradigm of OOPS Concepts with Java Lab 1


PC -11

12 BCA382 Database Management System Lab 1


PC -12

13 BCA401 Operating System 3


PC -13

14 BCA402 Advanced Web Technology 3


PC -14

15 BCA481 Operating System Lab 1


PC -15

16 BCA482 Advanced Web Technology Lab 1


PC -16

17 BCA501 Data Communication and Networks 3


PC -17

18 BCA502 Artificial intelligence 3


PC -18

19 BCA581 Data Communication and Networks Lab 1


PC -19

20 BCA582 Artificial intelligence Lab 1


PC -20

21 BCA601 Big Data Analytics 3


PC -21

22 BCA602 Networks and Cyber Security 3


PC -22

23 BCA681 Big Data Analytics Lab 1


PC -23

24 BCA682 Networks and Cyber Security Lab 1


PC -24
15

List of Major Elective Courses

S. No. COURSE CODE COURSE NAME CREDITS ELECTIVE

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

List of Project Based Learning Courses

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

4 Personality Development through applied 2 CC -4


UCC004
Philosophy of Ramanaya and Ramcharitra Manas
5 2 CC -5
UCC005 Vivekananda Studies

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

S. No. COURSE CODE COURSE NAME


CREDITS

School of Smart Agriculture (Code:10)


1 UVC1001 Organic Farming

2 UVC1002 Disaster Management

3 UVC1003 Mushroom Cultivation

4 UVC1004 Food and Food Sources

5 UVC1005 Food Process Technology and Food Microbiology

6 UVC1006 Field Study Techniques & Report Writing

7 UVC1007 Pharmacognosy and Herbal Preparations

School of Business (Code:20)

8 UVC2001 Business Communication

9 UVC2002 Human Resource Management

10 UVC2003 Financial Literacy


17

11 UVC2004 Leadership and Teamwork

12 UVC2005 Critical Thinking and Writing

13 UVC2006 Basics of Marketing

14 UVC2007 Fundamental of Accounting

15 UVC2008 Fundamentals of Business Economics

16 UVC2009 Business Statistics

17 UVC2010 Cost Accounting Basics

18 UVC2011 Advertising Management

19 UVC2012 Time Management

20 UVC2013 Tour Package Operations & Management

21 UVC2014 Public Health & Hygiene

22 UVC2015 Fundamentals of Medical Laboratory

23 UVC2016 Basic Nutrition and Hygiene

24 UVC2017 Digital Marketing & Management

School of Computing (Code: 30)

25 UVC3001 Fundamentals of Computers

26 UVC3002 Digital Literacy and Cyber Security

27 UVC3003 Fundamentals of Web Designing

28 UVC3004 Office Automation Tools

29 UVC3005 Data Science & Applications

30 UVC3006 Computer skills for Economic Research & Communication

31 UVC3007 Quantitative Analysis

School of Design (Code: 40)

32 UVC4001 Drawing and Color Studies

33 UVC4002 Head (Bust)Study with Pencil and Color

34 UVC4003 Landscape
18

35 UVC4004 Drawing & Sketching of Human Body

36 UVC4005 Fashion (Apparel Designing)

37 UVC4006 Photography/ Lettering

List of Minor Elective Courses


19

1. Name of the School : School of Computing


2. Subject Code : BCA101
3. Name of the Subject : Fundamental of Information Technology
4. Pre-Requisite(if any) : Nil
5. Credits : 3
6. Contact Hours : L:3 T:0 P:0
7. Objective : The focus of the subject is on introducing skills relating to IT
basics, computer applications, programming, interactive media,
Internet basics etc. It will help them to pursue specialized
programs leading to technical and professional careers and
certifications in the IT industry.

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

Storage Fundamentals: Primary vs Secondary Storage, Examples of Primary Storage


2. Examples of Secondary Storage, Magnetic Tapes, Magnetic Disks. Cartridge Tape, Hard 7
Disks, Floppy Disks, Optical Disks, Compact Disks, Zip Drive, Flash Drives.

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

Assemblers, Compilers and Interpreters, Batch Processing, Multiprogramming,


5. 7
MultiTasking, Multiprocessing, Time Sharing, DOS, Windows, Unix/Linux.

Total Hours 35
20

Suggested Books:

S. Year of
Title
No. Publication

1. Digital Design: M.Morris Mano (PHI) 2008

2. V. Rajaraman, ―Fundamental of Computers‖, PHI 2009

3. ReemaThareja, ―Computer Fundamentals‖, OUP India 2014

4. P.k. Sinha, PreetiSinha ―Computer Fundamentals‖, BPb Publications 2011


21

1. Name of the School : School of Computing


2. Subject Code : BCA102
3. Name of the Subject : Introduction to ‗C‘ Language
4. Pre-Requisite(if any) : Nil
5. Credits : 3
6. Contact Hours : L:3 T:0 P:0
7. Objective : The objectives of this course are to make the student
Understandprogramming language, programming,
concepts of Loops, reading a set of Data, stepwise
refinement, Functions, Control structure, Arrays.

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

1. Name of the School : School of Computing


2. Subject Code : BCA106
3. Name of the Subject : Mathematical Foundations of Computer Science
4. Pre-Requisite(if any) : Nil
5. Credits : 4
6. Contact Hours : L: 4 T: 0 P:0
7. Objective: Understand sets, relations, functions, and discrete
structures
and to be able to model and solve realworld problems
using graphs and trees.
S. Contact
Contents
No. Hours

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.

Algebraic Structures: Introduction to Algebraic Structures and Properties, Types of


Algebraic Structures, Semi Group, Monoid Group, Abelian Group & Properties of Group.
5. 06
Sub Group, Cyclic Group, Cosets, Permutation Groups, Homomorphism & Isomorphism
of Groups.

Total Hours 36
24

Suggested Books:

S. Year of
Title
No. Publication

1 P.R.Vittal-Business Mathematics and Statistics, Margham Publications, Chennai. 2015


B.S.Vatsa-Discrete Mathematics - New Age International Limited Publishers,New
2 2009
Delhi
3 Kenneth H. Rosen, "Discrete Mathematics and Its Applications", McGraw Hill, 2006 2006
25

1. Name of the School : School of Computing


2. Subject Code : BCA107
3. Name of the Subject : Basic Mathematics
Pre-Requisite(if any) : Nil
4. Credits : 4
5. Contact Hours : L: 4 T: 0 P:0
6. Objective: Solve problems in Integral calculus, limits and
Continuity, Coordinate Geometry, Matrices and Differential Equations

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.

Integral Calculus: Integral as an inverse of Differentiation. Integration by parts. Methods


2. of substitution & use of partial fractions, standard forms and simple examples, Definite 13
integral & their applications to areas and length & Curves.

Differential Equation: First order and first-degree differential equations, separation of


3. variables, Homogeneous, linear, exact differential equations, second order linear equations 13
with constant coefficients, Orthogonal trajectories.

Co-ordinate Geometry: System of lines, System of Circles, Standard equations &


4. 08
properties of parabola & ellipse.

Matrices: Definition, Types of matrices, Laws of operations on matrices, Transpose,


adjoint and inverse of matrices, solution of linear system of equations, and Cramer‘s rule,
5. 13
Rank of Matrices, square Matrices, Eigen values, Eigen Vectors, Characteristic
polynomials, Cayley Hamilton theorem.

Total Hours 36
26

Suggested Books:

S. Year of
Title
No. Publication

1 Bansi lal & S. Arora‖ Two-Dimensional Co-ordinate Geometry‖ S. chand 2015

2 S.C.Gupta ‗Matrices‖, S. Chand 2019

3 R.S. Agarwal Differential Calculus S. Chand 2021


27

1. Name of the School : School of Computing


2. Subject Code : BCA108
3. Name of the Subject : Discrete Structures
4. Pre-requisite (if any) : Basics of Mathematics-I, Basics of Mathematics-II
5. Credits : 4
6. Contact Hours : 42 L: 4 T: 0 P: 0
7. Objective : Throughout the course, students will be expected to demonstrate their
understanding of Discrete Mathematics by being able to do each of the
following:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counterexamples.
5. Apply logical reasoning to solve a variety of problems.

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

Textbook: Discrete Mathematics and its Applications - Kenneth H. Rosen 7th


1. 2007
Edition -Tata McGraw Hill Publishers - 2007

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]

4. Deo N., Graph Theory, Prentice Hall of India. [Unit 5] 2016

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

1. Name of the School : School of Computing


2. Subject Code : BCA103
3. Name of the Subject : Communication Skills
4. Pre-Requisite (if any) : Nil
5. Credits : 2
6. Contact Hours : L: 2 T: 0 P:0
7. Objective: : Understand and learn the fundamentals of listening,
speaking and writing skills for life-long learning.
S. Contact
Contents
No. Hours
Listening Skill:
Purpose of Listening, Listening to Conversation (Formal and Informal), Active Listening,
1. 8
Benefits of Effective Listening Barriers to Listening, Listening to Announcements-
(railway/ bus stations/ airport /sports announcement/commentaries etc.)
Speaking:
Importance of Technical Communication, Barriers to Communication, Importance of
Communication Skills , Methods for Improving Speaking Skills, Types of Managerial
2. 6
Speeches: Occasional Speech, Thematic Speech, Tips and Characteristics of a good
Conversation, Common Manners and Etiquette, Non -Verbal Communication Tips for
Improving Non-Verbal Communication.
Reading:
3. Purpose, Process, Methodologies, Skimming and Scanning, Levels of Reading, Reading 10
Comprehension, Methods for Speeding up Reading Skills.
Writing and Different Modes of Writing:
Elements of Effective Writing, Paragraph Writing (Linkage and Cohesion), Letter Writing
4. (formal and informal), Essay writing, Notices, Precis Writing, Agenda, Minutes, Business 8
Report Writing, Business Proposal Writing, Elements of Proposal Writing, Layout of
Proposal Writing.
Digital Literacy and Social Media & Digital Ethics and Cyber Security :
What is Media Literacy, The Political, Social, Ideological and Economical Context of
5. 10
Media, Media and the Creation and the Reinforcement of Stereotypes , An introduction to
Pixlr and Picture Manipulation.
Total 42

Suggested Books:

Year of
S. No. Name of Books / Authors
Publication

Meenakshi Raman & Sangeeta Sharma, ―Technical Communication – Principles


1. 2007
and Practice‖, Oxford University Press.

Meenakshi Raman & Prakash Singh, ―Business Communication‖, Oxford


2. 2008
University Press.

Asha Kaul ,‖ Effective Business Communication‖, Prentice-Hall India Pvt. Ltd.,


3. 2008
March 2008.
30

4. B. N.Basu, ‖Technical Writing‖ , Prentice-Hall India Pvt. Ltd. 2007


31

1. Name of the School : School of Computing


2. Subject Code : BCA104
3. Name of the Subject : Web Designing
4. Pre-Requisite (if any) : Nil
5. Credits : 2
6. Contact Hours : L: 2 T: 0 P: 0
7. Objective : To develop the skill & knowledge of Web page design and
Students will understand to know how and can function either
as an entrepreneur or can take up jobs in the multimedia and
Web site development studio and other information technology
sectors.
S. Contact
Contents
No. Hours

Module 1:Web Programming Introduction: Architecture of a website, Different


technologies in making the website, Web Development Introduction. HTML-
Introduction: History of HTML, what you need to do to get going and make your first
1. HTML page, what are HTML Tags and Attributes, HTML Tag vs. Element, HTML 8
Attributes. HTML-Basic Formatting Tags: HTML Basic Tags, HTML Formatting
Tags, HTML Color Coding.HTML-Grouping Using Div Span: Div and Span Tags for
Grouping. HTML-Lists: Unordered Lists, Ordered Lists, Definition list

Module 2:HTML-Images: Image and Image Mapping. HTML-Hyperlink: URL -


Uniform Resource Locator, URL Encoding. HTML-Table: < table >, <th>, <tr>, < td
2. 6
>, < caption >, <thead>, <tbody>, <tfoot>, <colgroup>, < col >. HTML-Iframe: Using
Iframe as the Target.

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.

Module 4:CSS3-Introduction: Benefits of CSS, CSS Versions History, CSS Syntax,


External Style Sheet using < link >, Multiple Style Sheets, Value Lengths and
Percentages

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

Module 5:CSS3-Text Fonts, color, background-color, text-decoration, text-align,


5. vertical-align, text-indent, text-transform, white space, letter-spacing, word-spacing. 10
line-height, font-family, font-size, font-style, font-variant, font-weight.CSS3-Lists
Tables: list-style-type, list-style-position, list-style-image, list-style, CSS Tables,
32

border, width & height, text-align, vertical-alignpadding, color. CSS3-Box Model:


Borders & Outline, Margin & Padding, Height and width, CSS DimensionsCSS3-
Display Positioning: CSS Visibility, CSS Display, CSS Scrollbars, CSS Positioning,
Static Positioning, Fixed Positioning, Relative Positioning, Absolute Positioning, CSS
Layers with Z-Index, CSS Floats, The float Property, The clear Property, The clear fix
Hack

Total 40

Suggested Books:

S. Year of
Name of Books / Authors
No. Publication

1. HTML5 Black Book by Dreamtech Press 2015

2. Bootstrap: Responsive web development by Jake Spurlock, O' RELLY 2015

3. HTML and CSS by Jon Duckett. 2016

4 HTML5 for Masterminds by J. D. Gauchat 2017


33

1. Name of the School : School of Computing


2. Subject Code : BCA181
3. Name of the Subject : Fundamentals of Information Technology Lab
4. Pre-Requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T: 0 P: 2
7. Objective : The primary objective is to learn the implementation of
theoretical concepts through hands-on lab sessions. The
students learn documentation, letter writing, CV creation using
MS Word, data analysis using MS Excel and preparing effective
presentations using MS PowerPoint. The students also learn the
basic internal and external commands of MS DOS.

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.

4. Install RPM and DEBPackages. 2 Hrs

Perfom these commands in linuxchmod, su,chown, chgrp, ls, mkdir,pwd,date,who, find,


5. 2 Hrs
uname, wc, ifconfig.

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

1. Digital Design: M.Morris Mano (PHI) 2008

2. V. Rajaraman, ―Fundamental of Computers‖, PHI 2009

3. ReemaThareja, ―Computer Fundamentals‖, OUP India 2014

4. P.k. Sinha, PreetiSinha ―Computer Fundamentals‖, BPb Publications 2011


35

1. Name of the School : School of Computing


2. Subject Code : BCA182
3. Name of the Subject : Introduction to ‗C‘ Language Lab
4. Pre-Requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T: 0 P: 2
7. Objective : The course is designed to provide complete knowledge of C
language. Students will be able to develop logics which will
help them to create programs, applications in C. They will learn
basic principles of Programming.
Practical Laboratory 2 × 10 = 20

Write a program to print sample strings like ―hello world‖, ―Welcome to C


1 2 Hrs
Programming‖ with different formats using escape sequences.

2 Write a Program to print different data types in ‗C‘ and their ranges. 2 Hrs

3 Write a Program to calculate simple interest. 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).

6 Write a Program to calculate roots of quadratic equation (using if-else). 2 Hrs

7 Write a Program to perform arithmetic operations using switch case. 2 Hrs

8 Write a Program to display colors using switch case (VIBGYOR). 2 Hrs

9 Write a Program to display vowels and consonants using switch case. 2 Hrs

10 Write a program to calculate sum of individual digits of a given number. 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

3 Gottfried, ―Programming in C‖ Schaum‖s Series Tata Mcgraw Hill 2011

4 YashwantKanetkar,‖Let Us C‖ 2005
37

1. Name of the School : School of Computing


2. Subject Code : BCA183
3. Name of the Subject : Web designing using HTML and CSS Lab
4. Pre-Requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T: 0 P: 2
8. Objective : To develop the skill & knowledge of Web page design and
Students will understand to know how and can function either
as an entrepreneur or can take up jobs in the multimedia and
Web site development studio and other information technology
sectors.
2 x 10 =
Laboratory Experiment 20
1 Design a simple web page with head, body and footer, with heading tags, paragraph tags 2 Hrs.
Design a simple web page for a book‘s Topic in order list with hyperlink. Once clicked
2 on any topic it should redirect on another page which contains information regarding 2 Hrs.
particular topic
Design a web page which contains the list of product in table with product image. When
3 2 Hrs.
clicked on particular product details should open in next page.
Design your resume which contains your personal info, your image, and your career
4 objective in paragraph, your qualification in table, your skills in order list, and your 2 Hrs.
hobbies in unordered list.
Design a web page to capture the user basic information such as name, email, mobile,
4 2 Hrs.
gender, dob, address, username, password, and upload button to upload image.
6 Create a simple web page to demonstrate the inline CSS. 2 Hrs.

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

1. HTML5 Black Book by Dreamtech Press 2015

2. Bootstrap: Responsive web development by Jake Spurlock, O' RELLY 2015

3. HTML and CSS by Jon Duckett. 2016

4 HTML5 for Masterminds by J. D. Gauchat 2017


39

1. Name of the School : School of Computing


2. Subject Code : BCA201
3. Name of the Subject : Data Structures using ‗C‘
4. Pre-Requisite(if any) : Nil
5. Credits : 3
6. Contact Hours : L:3 T:0 P:0
7. Objective : To impart the basic concepts of data structures and algorithms,
to understand concepts about searching and sorting techniques to understand basic concepts about stacks,
queues, lists, trees and graphs.

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

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

4. Data Structures – Lipschutz, Schaum‘s Outline Series, TMH 2008


41

1. Name of the School : School of Computing


2. Subject Code : BCA202
3. Name of the Subject : Python Programming
4. Pre-requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 3 T:0 P:0
7. Objective : Learn core Python scripting elements such as variables and
flow control structures and discover who to work with lists
and data items.
S Contact
Contents
No Hours
Introduction: Features/characteristic of Python, Basic syntax, Writing and executing
simple program, Basic Data Types, Declaring variables, Performing assignments,
1. arithmetic operations, Simple input-output, Precedence of operators, Type conversion, 08
Conditional Statements: if, if-else, nested if - else Looping: for, while, nested loops,
Terminating loops, skipping specific conditions
Declaring strings, String Manipulation using string functions, Introduction to
2. Collection list, Manipulating Collections Lists. Tuples-Introduction to Tuples, 07
Manipulating Tuples.
Dictionaries, Functions and Modules: Concepts of dictionary, Techniques to create
updates & delete dictionary items. Functions: Defining a function, Calling a function,
Advantages of functions, Types of functions, Function parameters, Formal parameters,
3. Actual parameters, Anonymous functions, Global and Local variables. Modules: 08
Importing module, Creating & exploring modules, Math module, Random module,
Time module.
Python File Input-Output, Exception Handling and Regular Expression: Opening
and closing file, Various types of file modes, Reading and writing to files,
Manipulating directories. Exception Handling – What is exception, Various keywords
4. 07
to handle exception such try, catch, except, else, finally, raise Regular Expressions –
Concept of regular expression, various types of regular expressions, using match
function.
GUI Programming in Python (using Tkinter/wxPython/Qt) : What is GUI,
Advantages of GUI, Introduction to GUI library, Layout management, Events and
5. bindings, Font, Colors, drawing on Canvas (line, oval, rectangle, etc.), Widget such as 07
:Frame, Label Button, Check button, Entry, List box, Message, Radio button, Text,
Spin box etc.

Total Hours 36
42

Suggested Books:

S. Year of
Content
No Publication

1 Introduction to Computer Science using Python- Charles Dierbach 2010

2 Beginning Python: Using Python 2.6 and Python 3- James Payne 2010

3 Programming Languages – Principles and Paradigms- AdeshPandey 2005

4 MySQL for Python: Database Access Made Easy- A. Lukaszewski 2007


43

1. Name of the School : School of Computing


2. Subject Code : BCA208
3. Name of the Subject : Basics of Digital Electronics
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 4 T: 0 P: 0
7. Objective : This course is designed to introduce number system, data
representation, binary arithmetic, logic family, Boolean
algebra, combinational circuit to the undergraduate students.
S. Contact
Contents
No. Hours

Number Systems & Boolean Algebra


Introduction to number systems, Binary, Octal, Decimal and Hexadecimal arithmetic.
1. Subtraction Using (r-1)‘s and r‘s complement methods.Boolean Expressions. Sum of 8
product and product of sum forms.Writing boolean expression from truth table. Writing
truth table from boolean expression.Minterms & Maxterms.

Binary Codes, Logic Gates And Minimization Techniques


Types of binary codes.Error detection and correction codes.Introduction to logic gates.
2. Implementation of boolean functions using basic gates.Implementation of boolean 7
functions using Universal gates.Minimizations techniques.Karnaugh (K-Map). Qunine-
MaClusky method (Q-Map) of minimization.

Combinational Circuit Design


Types of digital circuits. Design steps of a combinational circuit. Types of combinational
3. circuits. Adder and Subtractor. Multiplexer and Demultiplexer. Decoder and Encoder. 7
Magnitude comparator. Special purpose combinational circuits. Programmable Logic
Devices.

Sequential Circuit Design-I


Types of sequential circuits. Introduction to Flip-Flops. Types and working of Flip-Flops.
4. 6
Interconversion of Flip-Flops. Triggering of Flip-Flops. Race-Around condition and its
elimination. Master-Slave Flip-Flop.
Sequential Circuit Design-II
Introduction to counters. Types of counters. Design steps of counter. Synchronous-up
5. Counter. Synchronous-Down counter. Synchronous Mod counter. Self-starting counter 7
and lock-out state. Finite state machine. Design of single input and single output finite
state machine.

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

1. Name of the School : School of Computing


2. Subject Code : BCA209
3. Name of the Subject : Computer Organization
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 4 T: 0 P: 0
7. Objective : To understand the concept of digital electronics.

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).

Processor Design: Processor Organization: General register organization, Stack


organization, Addressing mode, Instruction format, Data transfer & manipulations,
3. Program Control, Reduced Instruction Set Computer. Input-Output Organization: I/O 7
Interface, Modes of transfer, Interrupts & Interrupt handling, Direct Memory access,
Input- Output processor, Serial Communication.

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.

Parallel Processing, Pipelining- Arithmetic Pipelining, Instruction Pipelining, RISC


5. Pipelining, Vector Processing, Array Processor. Multiprocessor: Characteristic of 7
Multiprocessor, Interconnection Structure, Interprocessor Arbitration, Cache Coherence

Total 35
46

Suggested Books:

S. Year of
Name of Books / Authors
No. Publication

1. Computer Organization, John P.Hayes, McGraw Hill, 3rd Edition. 2007

2. Computer System Architecture, M. Mano, Pearson, 3rd Edition. 2014

3. Computer Organization, Vravice, Zaky & Hamacher (TMH Publication). 2007

4. Switching Theory and Finite Automata, Kohavi, TMH Publications. 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.

Malvino, A.P. and Leach, D.P. and GoutamSaha. 2014. Digital Principles and Applications
6. 2014
(SIE). Tata McGraw Hill. ISBN: 9789339203405.
47

1. Name of the School : School of Computing


2. Subject Code : BCA-210
3. Name of the Subject : Computer Based Numerical and Statistical Technique
4. Pre-requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : 31 L: 4 T: 0 P: 0
7. Objective : To demonstrate understanding of numerical and statistical
methods in support of the analysis, design and application for
problem solving in the field of information technology.
Contact
S. No. Contents
Hours
Introduction: Numbers and their accuracy, Computer Arithmetic, Mathematical
preliminaries, Errors and their Computation, General error formula, Error in a series
approximation
1. Solution of Algebraic and Transcendental Equation: Bisection Method, Iteration 6
method, Method of false position, Newton-Raphson method, Methods of finding
complex roots, Muller‘s method, Rate of convergence of Iterative methods,
Polynomial Equations.
Interpolation: Finite Differences, Difference tables Polynomial Interpolation:
Newton‘s forward and backward formula
Central Difference Formulae: Gauss forward and backward formula, Stirling‘s,
2. 6
Bessel‘s, Everett‘s formula.
Interpolation with unequal intervals: Langrange‘s Interpolation, Newton Divided
difference formula, Hermite‘s Interpolation.
Numerical Integration and Differentiation: Introduction, Numerical differentiation
3. Numerical Integration: Trapezoidal rule, Simpson‘s 1/3 and 3/8 rule, Boole‘s rule, 5
Waddle‘s rule.
Solution of differential Equations: Picard‘s Method, Euler‘s Method, Taylor‘s
4. Method, Runge-Kutta Methods, Predictor Corrector Methods, Automatic Error 6
Monitoring and Stability of solution.
Statistical Computation: Frequency chart, Curve fitting by method of least squares,
fitting of straight lines, polynomials, exponential curves etc, Data fitting with Cubic
5. 8
splines, Regression Analysis, Linear and Non-linear Regression, Multiple
regression, Statistical Quality Control methods.
Total 31
48

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

8. Name of the School : School of Computing


9. Subject Code : BCA203
10. Name of the Subject : Project Based Learning-1
11. Pre-requisite (if any) : NIL
12. Credits : 3
13. Contact Hours : 42 L: 0 T: 0 P: 4
14. Objective : How to identify the problem, designing and developing,
testing and documentation of the project.

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

Feasibility Study: Consideration of different social, economical and technical


feasibility of the developing project and its modules.
2. 6

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

2 Jalote, Pankaj, ―Software Engineering Ed.2‖, Narosa 2002 2006

3 Schaum‘s Series, ―Software Engineering‖, TMH 2004

4 Sommerville, Ian, ―Software Engineering‖ AWL Publication 2012


51

1. Name of the School : School of Computing


2. Subject Code : BCA204
3. Name of the Subject : Environment Studies
4. Pre-requisite (if any) : Nil
5. Credits : 2
6. Contact Hours : L:2 T:0 P:0
7. Objective : The course is designed to learn the fundamentals of Water
Engineering, various components of water supply scheme,
provide broad knowledge of solid waste management
systems, ecology and biodiversity and solid and hazardous
water.
S Contact
Contents.
No Hours
Nature and scope of Environmental Problems: Environment and society,
environmental disturbances, role of technology, sustainable development, quantification
of environmental issues.
1. 08
Population and Economic growth: Economic growth and industrialization
urbanization, Resource consumption, Renewable and nonrenewable resources, Energy
requirement and development.
Global Atmospheric systems: Concept of climate change, greenhouse effect, global
energy balance, global warming, carbon cycle, Intergovernmental Panel for Climate
Change (IPCC) emission scenarios, impact of climate change.
2. 08
Mass balance and Environmental chemistry: Mass and Energy balance, Particle
dispersion, oxygen demand, carbon emission, enthalpy in environmental systems,
chemical equilibria.
Ecology and Biodiversity: Energy flow in ecosystem, food chain, nutrient cycles,
3. eutrofication, value of biodiversity, biodiversity at global, national and local levels, 06
threats for biodiversity, conservation of biodiversity.
Water Pollution: water pollutants, effects of oxygen demanding waste on water, water
quality in lakes, reservoirs and groundwater, contaminant transport, self-cleaning
capacity of streams and water bodies, water quality standards, principles of water and
4. 09
wastewater treatment.
Air Pollution: Overview of emissions, pollutant standard index, toxic air pollutants,
vehicle emissions, indoor air quality, principles of air pollution control.
Solid and Hazardous Waste: Characteristics of Solid and Hazardous Waste, Collection
and transfer system, recycling, composting, waste to energy conversion, landfills.
5. 08
Environmental Management: Sustainable development, Environmental Impact
Assessment (EIA), Environmental Ethics, Legal aspects.
Total Hours 40
52

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.

Nathanson, Schneider, ―Basic Environmental Technology: Water Supply, Waste


2 2014
Management & Pollution Control‖ 6thedition, Pearson Education

Sincero/Sincero, ―Environmental Engineering: A Design Approach‖ Pearson


3 2015
Education.

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.

Hendricks, D. ‗Water Treatment Unit Processes – Physical and Chemical‘ CRC


8 2006
Press, New York.

J.G. Henry and G.W. Heinke, Environmental Science and Engineering,


9 2004
PearsonEducation,
10 G.B. Masters, Introduction to Environmental Engineering and Science,
2004
PearsonEducation
53

1. Name of the School : School of Computing


2. Subject Code : BCA205
3. Name of the Subject : Problem Solving Skills - I
4. Pre-Requisite (if any) : Nil
5. Credits : 2
6. Contact Hours : L: 2 T: 0 P: 0
7. Objective : In this course you will learn how to develop problem
solving and creativity skills and to recognize the
importance and function of problem solving and creative
thoughts and the role of critical thought in creative
ideation.
S. Contact
Contents
No. Hours
Operators and Expressions: Arithmetic operators –Increment and decrement operators –
Relational operators –Logical operators –The bitwise operators–The assignment operators
–The conditional operator –The size of operator –The comma operator –Type casting
operator –Other operators –Precedence and order of evaluation
Input-Output Library Functions –Unformatted I-O Functions –Single Character Input-
1. Output –String Input-Output –Formatted I-O Functions –printf() Width Specifier –scanf() 8
Width Specifier.
Control statements: Conditional Control Statements –if –if-else –nested if-else –else-if
ladder –Multiple Branching Control Statement –switch-case –Loop Control Statements –
while –do-while –for –Nested Loops –Jump Control statements –break –continue –goto –
exit –return.
Function: What is function? –Why function? –Advantages of using functions –Function
Prototype –Defining a function –Calling a function –Return statement –Types of
2. functions –Recursion –Nested functions –main () function –Library Function –Local and 6
global variables.
Storage class: Types of storage class –Scoping rules.
Pointer: Def of Pointer: Declaration of Pointer Variables –Assigning Address to Pointer
Variables –De-referencing Pointer Variables –Pointer to Pointer –Pointer Arithmetic.
Pointer and Function: Parameter Passing Techniques – call by value, call by address –
Using Pointers as Arguments: Function Returning value –Returning More than one
3. 8
value From A Function –Functions Returning Address –Function Returning Pointers –
Dangling pointer –Pointer to a Function –Calling A function through function pointer –
passing A function's address as an Argument to other function –Functions with variable
number of arguments.
Array: One dimensional array –Declaration of 1D arrays –Initialization of 1D arrays –
Accessing element of 1D arrays –Reading and displaying elements –Two dimensional
arrays –Declaration of 2D arrays –Initialization of 2D arrays –Accessing element of 2D
4. 8
arrays –Reading and displaying elements.
Pointer and Array: Pointer and one-dimensional arrays –Subscripting pointer variables –
Pointer to an array –Array of pointers –Pointers and two-dimensional arrays –
54

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

3. Gottfried,‖Programming in C‖ Schaum‖s Series Tata Mcgraw Hill 2011

4 YashwantKanetkar,‖Let Us C‖ 2005
55

1. Name of the School : School of Computing


2. Subject Code : BCA281
3. Name of the Subject : Data Structures using ‗C‘ Lab
4. Pre-Requisite(if any) : Nil
5. Credits : 1
6. Contact Hours : L:0 T:0 P:2
7. Objective : To impart the basic concepts of data structures and
algorithms, to understand concepts about searching and sorting techniques to understand basic
concepts about stacks, queues, lists, trees and graphs.
2 x 10 =
Laboratory Experiment 20
1 Programs of Stack, Queue, and Circular Queue using Array. 2 Hrs

2 Implement Singly Linked List. 2 Hrs

3 Implement Doubly Linked List and Circular Linked List. 2 Hrs

4 Traversal implementation of Binary Tree (Post order, Pre-order and In-order). 2 Hrs

4 Implement Insertion Sort, Counting Sort and Merge Sort. 2 Hrs

6 Write a C program for implementation of circular queue using array 2 Hrs

Personality Development: Decision-Making, Problem Solving, Goal Setting, Time


7 2 Hrs
Management & Positive Thinking

8 To demonstrate the concept of one dimentional array finding the sum of array elements. 2 Hrs

9 To display fibounacci series up to a range. 2 Hrs

10 To read n numbers and display it. 2 Hrs

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

4. Data Structures – Lipschutz, Schaum‘s Outline Series, TMH 2008


56

1. Name of the School : School of Computing


2. Subject Code : BCA282
3. Name of the Subject : Python Programming Lab
4. Pre-requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T:0 P:2
7. Objective : Learn core Python scripting elements such as variables and
flow control structures and discover who to work with lists
and data items.
Laboratory Experiment 2*10=20
1 Python program to add two numbers 2 Hours
2 Maximum of two numbers in Python 2 Hours
3 Python Program for factorial of a number 2 Hours
4 Python Program to find sum of array 2 Hours
5 Python Program to find largest element in an array 2 Hours
6 Python | Multiply all numbers in the list 2 Hours
7 Python program to find smallest number in a list 2 Hours
8 Python program to find largest number in a list 2 Hours
9 Python | Matrix creation of n*n 2 Hours
10 Python program to check if a string is palindrome or not 2 Hours

Suggested Books:

S. Year of
Content
No Publication

1 Introduction to Computer Science using Python- Charles Dierbach 2010

2 Beginning Python: Using Python 2.6 and Python 3- James Payne 2010

3 Programming Languages – Principles and Paradigms- AdeshPandey 2005

4 MySQL for Python: Database Access Made Easy- A. Lukaszewski 2007


57

1. Name of the School : School of Computing


2. Subject Code : BCA283
3. Name of the Subject : Problem Solving Skill-1 Lab
4. Pre-requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T:0 P:2
7. Objective : In this course you will learn how to develop problem
solving and creativity skills and to recognize the importance
and function of problem solving and creative thoughts and
the role of critical thought in creative ideation.

Laboratory Experiment 2*10=20


1 Program to print fibonacci series without using recursion and using recursion. 2 Hours
2 Program to print alphabet triangle. 2 Hours
3 Program to print multiplication of 2 matrices. 2 Hours
4 Program to find Sum of N input Numbers using Array 2 Hours
5 Program to find LCM of two Numbers using Recursion 2 Hours
6 Program for Dynamic Memory Allocation using malloc() 2 Hours
7 Program to Concatenate Strings using Pointer 2 Hours
8 Program to Print names of all Files present in a Directory 2 Hours
9 Program to implement circular queue 2 Hours
10 Program to Count Total Notes in a Given Amount 2 Hours
58

1. Name of the School : School of Computing


2. Subject Code : SOC154
3. Name of the Subject : Paradigm of Object-Oriented Programming using JAVA
4. Pre-Requisite(if any) : Nil
5. Credits : 5
6. Contact Hours : L:3 T:1 P:2
7. Objective : It aims to implement real-world entities like inheritance, hiding,
polymorphism, etc in programming.

S. Contact
Contents
No. Hours

Introduction to Java: Basics of Java programming, Data types, Variables,


Operators, Control structures including selection, Looping, Java methods,
Overloading, Math class, Arrays in java
1. 8
Objects and Classes: Basics of objects and classes in java, Constructors, Finalizer,
Visibility modifiers, Methods and objects, Inbuilt classes like String, Character,
String Buffer, File, this reference.

Inheritance and Polymorphism: Inheritance in java, Super and sub class,


Overriding, Object class, Polymorphism, Dynamic binding, Generic programming,
2. 8
Casting objects, Instance of operator, Abstract class, Interface in java, Package in
java, UTIL package.

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.

Multithreading in java: Thread life cycle and methods, Runnable interface,


5. Thread synchronization, Exception handling with try-catch-finally, Collections in 8
java, Introduction to JavaBeans and Network Programming.

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

6 Java Programming, D. S. Malik, Cengage Learning. 2011


60

1. Name of the School : School of Computing


2. Subject Code : SOC253
3. Name of the Subject : Database Management System
4. Pre-Requisite(if any) : Nil
5. Credits : 5
6. Contact Hours : L: 3 T:1 P:2
7. Objective : The primary goal of a DBMS is to provide an environment that
is both convenient and efficient to use in retrieving and
storing data base information.

S. Contact
Contents
No. Hours

Introduction: Data, Information and Knowledge, Characteristics of Database Approach,


Data Independence, Architecture of Database System, Data Dictionary, Types of
Database Language, Database System Life Cycle, Overview of Hierarchical, Network
1. 08
and Relational Model. Concepts of Keys, Conceptual, Logical and Physical Design, ER
Models, ER Diagrams, Strong and Weak Entity Sets, Generalization, Specialization and
Aggregation, Conversion of ER Model into Relational Schemes

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

Introduction to SQL: Characterstics of SQL, SQL Data Types, Types of SQL


Commands, SQL Operators, Table, View and Indexes Queries and Sub Queries,
3. 08
Aggregate Function, Insert, Update and Delete Operations, Joints Union Intersection,
Minus Cursors in SQL, PL/SQL, Triggers and Clusters

Normalization Concepts: Functional Dependencies and Dependency Preservations,


4. Normal Forms, 1NF, 2NF, 3NF, BCNF, 4NF, 5NF, DKNF, Indexing, File Organization, 08
Denormalization, Clustering of Tables and Indexes

Transaction Unit: Transaction Recovery, System Recovery, Two Phase Commit,


5. Concurrency Problems, Locking, Dead Locks, Security, Discretionary and Mandatory 07
Access Control, Data Encryption

Total Hours 38
61

8. Suggested Books:

S. Year of
Content
No Publication

―Database System Concepts‖, 6thEdition by Abraham Silberschatz, Henry F. Korth,


1 2004
S. Sudarshan, McGrawHill.

―Principles of Database and Knowledge - Base Systems‖, Vol. 1 by J. D. Ullman,


2 2000
Computer SciencePress.

―Fundamentals of Database Systems‖, 5thEdition by R. Elmasri& S. Navathe,


3 2003
PearsonEducation.

―Foundations of Databases‖, Reprint by Serge Abiteboul, Richard Hull, Victor


4. 2000
Vianu,Addison-Wesley.
62

1. Name of the School : School of Computing


2. Subject Code : SOC-255
3. Name of the Subject : Software Engineering
4. Pre-requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L:3 T:0 P:0
7. Objective : To enable the students to apply a systematic application of
scientific knowledge in creating and building cost effective
software solutions to business and other types of problems
and to make the students understand project management
concepts & their metrics.

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

REQUIREMENTS, ANALYSIS AND SPECIFICATION: Software Requirements


engineering, Requirement engineering process, Requirement Engineering Tasks, Types
of requirements, SRS. System Modelling: Data Modelling, Functional Modelling and
2. 07
information flow: Data flow diagrams, Behavioral Modelling, The mechanics of
structured analysis: Creating entity/ relationship diagram, data flow model, control flow
model, the data dictionary

SYSTEM DESIGN: Design principles, the design process; Design concepts:


Abstraction, refinement, modularity, software architecture, control hierarchy, structural
3. 08
partitioning, data structure, software procedure, information hiding; Effective modular
design: Functional independence, Cohesion, Coupling;

SOFTWARE TESTING AND MAINTENANCE Testing terminology- error,


bug/defect/fault, failure, Verification and validation, Test case design, Static testing,
4. 07
Dynamic testing--- Black box testing—Boundary value analysis, White box testing--
basis path testing, Unit testing, Integration testing, Acceptance Testing.

Software Reliability & Quality Assurance: reliability Issue, Reliability Matrices,


Software Quality, ISO 9000 Certification for Software Industry, Comparison between
5. 06
ISO and CMM, CASE and its Scope, Case support in software life Cycle, Reverse
engineering.
Total Hours 36
63

8. Suggested Books:

S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication

2 Jalote, Pankaj, ―Software Engineering Ed.2‖, Narosa 2002 2006

3 Schaum‘s Series, ―Software Engineering‖, TMH 2004

4 Sommerville, Ian, ―Software Engineering‖ AWL Publication 2012


64

1. Name of the School : School of Computing


2. Subject Code : SOC-255
3. Name of the Subject : Software Project Management
4. Pre-requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L:3 T:0 P:0
7. Objective : To able to explore the basic ideas and principles of Project
organization and scheduling and to analyze the issues related to Software quality assurance and testing.
S
Contact
No Contents
Hours
.
Introduction and Software Project Planning: Fundamentals of Software Project
Management (SPM), Need Identification, Vision and Scope document, Project Management
Cycle, SPM Objectives, Management Spectrum, SPM Framework, Software Project
1. 08
Planning, Planning Objectives, Project Plan, Types of project plan, Structure of a Software
Project Management Plan, Software project estimation, Estimation models, Decision
process.

Project Organization and Scheduling: Project fundamentals, Work Breakdown Structure


(WBS), Types of WBS, Functions, Activities and Tasks, Project Life Cycle and Product
2. Life Cycle, Ways to Organize Personnel, Project 07
schedule,SchedulingObjectives,Buildingtheprojectschedule,Schedulingterminologyandtech
niques, Network Diagrams :PERT, CPM.

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.

Software Quality Assurance and Testing: Testing Objectives, Testing Principles,


Structure of a System Test Plan, Test Cases, Test Approach, Test Suite Structure, Test
4. Environment, Test Execution Strategy Types of Testing, Levels of Testing, Program 07
Correctness, Software Quality Metrics and Indicators, The SEI Capability Maturity Model
(CMM), TQM, TQM principles, Six Sigma, SPICE, SQA Activities.

Project Management Tools: Software Configuration Management: Software


Configuration Items and tasks, Baselines, SCM Process, Change Control, Change Requests
5. 06
Management, Version Control, Risk Management: Risks and risk types, Risk Breakdown
Structure (RBS), Risk Management Process.
Total Hours 36
65

8. Suggested Books:

S. Year of
Content
No Publication
Pressman, Roger S., ―Software Engineering: A Practioner‘s Approach‖, Mcgraw Hill
1 2011
Publication

2 Jalote, Pankaj, ―Software Engineering Ed.2‖, Narosa 2002 2006

3 Schaum‘s Series, ―Software Engineering‖, TMH 2004

4 Sommerville, Ian, ―Software Engineering‖ AWL Publication 2012


66

1. Name of the School : School of Computing


2. Subject Code : SOC 261
3. Name of the Subject : System Analysis and Design
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T: 1 P: 0
7. Objective : On completion of this course the student should be able to:
Explain what systems are and how they are developed.
Explain the need for and value of a formalized step-by-step
approach to the analysis, design, and implementation of
computer information systems. Use tools and techniques
for process and data modeling.

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

8. Suggested books: In tabular form given below:

S. Year of
Content
No. Publication

1. Elias M.Awad, "Systems Analysis and Design" Galgotia Publication 2014

2. Hoffer, "Modern Systems Analysis and Design" Addision Wesley 2019

3. Kendall, "Introduction to System Analysis and Desogm", McGraw Hill 2015

4. System Analysis and Design Handbook: V. K. Jain, Wiley dreamtech 2018


68

1. Name of the School : School of Computing


2. Subject Code : SOC 261
3. Name of the Subject : Management Paradigms from Bhagavad Gita
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T: 1 P: 0
7. Objective : On completion of this course the student should be able to:
To identify some of the commonly felt problems that
individuals, organizations and the society aces.
To illustrate the usefulness of Gita in addressing some of
the problems.
To demonstrate how alternative world views and
paradigms of management could be developed with
knowledge of Ancient Indian wisdom such as Gita.
To provide a good introduction to Ancient Indian wisdom
using Gita as a vehicle.

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.

Assignment: Read five chapters of Bhagwat Gita for Group Discussion.

Chapter 1: Visada Yoga


1. Chapter 2: Sankhya Yoga 08

Chapter 3: Karma Yoga

Chapter 4: Jnana Yoga 07

Chapter 5: Karma Vairagya Yoga

Perspectives on Leadership and Work Failed Leadership: Causes & Concerns Leadership
Perspectives in the Gita1 Axioms of Work & Performance The Notion of Meaningful
Work

2. Assignment: Read five chapters of Bhagwat Gita for Group Discussion. 08


Chapter 6: Abhyasa Yoga
Chapter 7: Paramahamsa Vijnana Yoga
69

Chapter 8: Aksara-Parabrahman Yoga


Chapter 9: Raja-Vidya-Guhya Yoga
Chapter 10: Vibhuti-Vistara-Yoga

Perspectives on Self‐Management Mind as a key player in an individual Meditation as a


tool for self‐management Role of Yoga in addressing stress & burnout of managers Mind
as a key player in an individual Self‐Management by understanding the world within
Values & their role in Self‐management Shaping the personality through Trigunas
Assignment: Read five chapters of Bhagwat Gita for Group Discussion.
Chapter 11: Visvarupa-Darsana Yoga,
3. 07
Chapter 12: Bhakti Yoga,
Chapter 13: Ksetra-KsetrajnaVibhaga Yoga
Chapter 14:Gunatraya-Vibhaga Yoga
Chapter 15:Purusottama Yoga 07

Perspectives on Life and Society Perspectives on Sustainability Death as a creative


destruction process Law of Conservation of Divinity Conclusions
Assignment: Read five chapters of Bhagwat Gita for Group Discussion.
4. 09
Chapter 16: Daivasura-Sampad-Vibhaga Yoga
Chapter 17:Sraddhatraya-Vibhaga Yoga
Chapter 18:Moksa-Opadesa Yoga 08
Total Hours 40
70

8. Suggested books: In tabular form given below:

S. Year of
Content
No. Publication

1. Elias M.Awad, "Systems Analysis and Design" Galgotia Publication 2014

2. Hoffer, "Modern Systems Analysis and Design" Addision Wesley 2019

3. Kendall, "Introduction to System Analysis and Desogm", McGraw Hill 2015

4. System Analysis and Design Handbook: V. K. Jain, Wiley dreamtech 2018


71

1. Name of the School : School of Computing


2. Subject Code : VAP-251
3. Name of the Subject : Problem Solving Skills-II
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L:0 T: 0 P: 6
7. Objective : The objective of this course is made aware the students
about problem solving strategies.

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

4. Data Structures – Lipschutz, Schaum‘s Outline Series, TMH 2008


73
74

1. Name of the School : School of Computing


2. Subject Code : SOC154
3. Name of the Subject : Paradigm of OOPS Concepts with Java Lab
4. Pre-Requisite(if any) : Nil
5. Credits : 5
6. Contact Hours : L:3 T:1 P:2
7. Objective : It aims to implement real-world entities like inheritance, hiding,
polymorphism, etc in programming.

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

6 Java Programming, D. S. Malik, Cengage Learning. 2011


76

9. Name of the School : School of Computing


10. Subject Code : SOC253
11. Name of the Subject : Database Management System Lab
12. Pre-Requisite(if any) : Nil
13. Credits : 5
14. Contact Hours : L: 3 T:1 P:2
15. Objective : The primary goal of a DBMS is to provide an environment that
is both convenient and efficient to use in retrieving and
storing data base information.

Laboratory Experiment 2 x 10=20

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

4 SQL queries for aggregation, range finding etc on thetables. 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

7 To Study Views and Indices. 2 Hrs

8 Study of various types of JOINS. 2 Hrs

9 Study of various types of Integrity Constraints. 2 Hrs

10 Study of GROUP function (AVG, Count, max, min, sum) 2 Hrs

16. Suggested Books:

S. Year of
Content
No Publication

―Database System Concepts‖, 6thEdition by Abraham Silberschatz, Henry F. Korth,


1 2004
S. Sudarshan, McGrawHill.

―Principles of Database and Knowledge - Base Systems‖, Vol. 1 by J. D. Ullman,


2 2000
Computer SciencePress.
77

―Fundamentals of Database Systems‖, 5thEdition by R. Elmasri& S. Navathe,


3 2003
PearsonEducation.

―Foundations of Databases‖, Reprint by Serge Abiteboul, Richard Hull, Victor


4. 2000
Vianu,Addison-Wesley.
78

1. Name of the School : School of Computing


2. Subject Code : BCA283
3. Name of the Subject : Problem Solving Skill-2 Lab
4. Pre-requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T:0 P:2
7. Objective : In this course you will learn how to develop problem
solving and creativity skills and to recognize the importance
and function of problem solving and creative thoughts and
the role of critical thought in creative ideation.

Laboratory Experiment 2*10=20


1 2 Hours
2 2 Hours
3 2 Hours
4 2 Hours
5 2 Hours
6 2 Hours
7 2 Hours
8 2 Hours
9 2 Hours
10 2 Hours

Suggested Books:

S. Year of
Content
No Publication
1

3
79

1. Name of the School : School of Computing


2. Subject Code : SOC251
3. Name of the Subject : Operating System
4. Pre-Requisite(if any) : Nil
5. Credits : 5
6. Contact Hours : L:3 T:1 P:2
7. Objective:
1. Recognize the concepts and principles of operating systems.
2. Provide comprehensive introduction to understand the
underlying principles, techniques and approaches which
constitute a coherent body of knowledge in operating
systems.
3. To teach understanding how the various elements that
underlie operating system
4. Interact and provides services for execution of application
software.

S Contact
Contents
No Hours

Introduction & Historical Context of Operating Systems: All Components


Description, The Evolution of OS, Batch Systems, Multi Programming Systems, Time
1. Sharing Systems, Parallel Systems, Real Time Systems, Distributed Systems, 8
Operating System Structure, Micro Kernel, Monolithic Systems, Layered Systems,
Virtualization, Client Server Model.
80

Process Concepts: Threads & Concurrency, Scheduling Concurrency &


Synchronization Issues, Process Concepts, Threads, Overview, Benefits, User &
Kernel Threads, Multithreading Models, Scheduling, Operations On Processes,
2. 7
Cooperative Processes, IPC, Scheduling Criteria, Scheduling Algorithms, Multiple
Processor Scheduling, Process Synchronization, Critical Section Problems,
Semaphores, Synchronization Hardware and Monitors.

Deadlock: System Model, Characterization, Methods for Handling Dead Locks. Dead
3. 6
Lock Prevention, Avoidance and Detection, Recovery from Dead Lock.

Memory Management: Memory Management Concepts, Relocation, Linking, Multi


Programming with Fixed Partitions, Swapping, Variables Partitions, Overlays, Virtual
4. 7
Memory, Segmentation, Paging, Storage Allocation Strategies, Load Control and
Thrashing

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

2 Operating System Concepts: Peterson and Silbershatz 2008

3 Modern Operating Systems: Andrew S Tanenbaum 2010


81

1. Name of the School : School of Computing


2. Subject Code : SOC252
3. Name of the Subject : Advanced Web Technology
4. Pre-Requisite(if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T: 0 P: 2
7. Objective : The main objective of the course is present the
basic web technology concepts that are required for
developing web applications.

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

Bayross, 2000, Web Enable Commercial Application Development Using


1. 2000
HTML,DHTML, Javascript, Perl CGI, BPB Publications

2. A.Russell Jones, Mastering Active Server Pages 3, BPB Publications. 2006

3. Uttam K Roy, ―Web Technology, Google Book 2010

1. Name of the School : School of Computing


2. Subject Code : SOC-331
3. Name of the Subject : Cyber Laws & IPR
4. Pre-requisite (if any) : Engineering Mathematics
5. Credits : 3
6. Contact Hours : 38 L: 3 T: 0 P: 0
7. Objective : To understand the basics of cyber law, its related issues and
intellectual property rights rules and regulations

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

1. Name of the School : School of Computing


2. Subject Code : SOC-336
3. Name of the Subject : Information Security Management
4. Pre-requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : 40 L: 3 T: 0 P: 0
7. Objective : The main objective of this course is to study and understand
the principles of information security management that are
widely used in organizations and businesses that deal with
data and are connected to the Internet.

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

1. Name of the School : School of Computing


2. Subject Code : SOC-335
3. Name of the Subject : Ethical Hacking
4. Pre-requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : 40 L: 3 T: 0 P: 0
7. Objective: The main objective of this course is to teach students how to
think like a hacker, providing them with a deep
understanding of security issues and concerns. In addition,
this course also provides the students with specialist
knowledge and experience of advanced hacking techniques
and their countermeasures.
S Contact
Contents.
No Hours
Introduction: Understanding the importance of security, Concept of ethical hacking
and essential Terminologies-Threat, Attack, Vulnerabilities, Target of Evaluation,
1. 8
Exploit. Phases involved in hacking, Foot printing, Scanning, System Hacking,
Session Hijacking.
Buffer Overflows: Significance of Buffer Overflow Vulnerability, Why
Programs/Applications is vulnerable. Reasons for Buffer Overflow Attacks. Methods
2. of ensuring that buffer overflows are trapped. 8
Sniffers: Active and passive sniffing. ARP poisoning and countermeasures. Man in
the middle attacks, Spoofing and Sniffing attacks. Sniffing countermeasures.
SQL Injection: Attacking SQL Servers, Sniffing, Brute Forcing and finding
Application Configuration Files, Input validation attacks. Preventive Measures. Web
Application Threats, Web Application Hacking, Cross Site Scripting / XSS Flaws /
3. 8
Countermeasures Correct Web Application Set-up.
Web Application Security: Core Defense Mechanisms. Handling User Access,
Authentication, Session Management, Access Control.
Attacking Authentication: Attacking Session Management, Design Flaws in
4. Authentication Mechanisms Attacking Forgotten Password Functionality, attacking 8
Password change functions. Countermeasures to authentication attacks
Web Application Technologies: HTTP Protocol, Requests, Responses and Methods.
Encoding schemes.Server-side functionality technologies (Java, ASP, PHP).
5. 8
Attacking other users: Reflected XSS Vulnerabilities, Stored XSS Vulnerabilities,
DOM-Based XSS Vulnerabilities, HTTP Header Injection. Countermeasures to XSS.
Total 40

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

1. Name of the School : School of Computing


2. Subject Code : BCA203
3. Name of the Subject : Project Based Learning-2
4. Pre-requisite (if any) : NIL
5. Credits : 3
6. Contact Hours : 42 L: 0 T: 0 P: 4
7. Objective : How to identify the problem, designing and developing,
testing and documentation of the project.

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

2 Jalote, Pankaj, ―Software Engineering Ed.2‖, Narosa 2002 2006

3 Schaum‘s Series, ―Software Engineering‖, TMH 2004

4 Sommerville, Ian, ―Software Engineering‖ AWL Publication 2012


89

8. Name of the School : School of Computing


9. Subject Code : BCA203
10. Name of the Subject : Personality development through applied philosophy of
Ramanaya and Ramcharitra Manas
11. Pre-requisite (if any) : NIL
12. Credits : 3
13. Contact Hours : 42 L: 0 T: 0 P: 4
14. Objective : The student will be able to develop humanitarian
perspective and develop the ability of balanced
leadershipbyfocusingonvariousaspectsof personality
development and becomemotivationalspeaker andgood
oratorin the field of stress management andpersonality
development.

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

Ramayan Parichay, Geeta Press, Gorakhpur


3 1992
SUGGESTED READING IN RAMAYAN
91

1. Name of the School : School of Computing


2. Subject Code : VAP-251
3. Name of the Subject : Problem Solving Skills-3
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 0 T: 0 P: 6
7. Objective : The objective of this course is made aware the students
about problem solving strategies.

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

Vocational / Skill Development Course


94

9. Name of the School : School of Computing


10. Subject Code : SOC251
11. Name of the Subject : Operating System Lab
12. Pre-Requisite(if any) : Nil
13. Credits : 5
14. Contact Hours : L:3 T:1 P:2
15. Objective:
1. Recognize the concepts and principles of operating systems.
2. Provide comprehensive introduction to understand the
underlying principles, techniques and approaches which
constitute a coherent body of knowledge in operating systems.
3. To teach understanding how the various elements that underlie
operating system
4. Interact and provides services for execution of application
software.

Laboratory Experiment 2 x 10 = 20

1 Study of Logging/ Logout Details. 2 Hrs

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.

3 Study of GREP, FIND, COMM., CMPANFDIFF COMMAND. 2 Hrs

4 Study of sort command with itsoptions. 2 Hrs

5 Study of vieditor 2 Hrs

6 Basic UNIX Commands and various UNIX editors such as vi, ed, ex and EMACS. 2 Hrs

7 File manipulation commands (cat, grep, rm, touch) 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

10 Program for simulation of cpunix commands 2 Hrs


95

Suggested Books:

S. Year of
Content
No Publication
1 Introduction to Operating Systems: Deitel 2017

2 Operating System Concepts: Peterson and Silbershatz 2008

3 Modern Operating Systems: Andrew S Tanenbaum 2010


96

9. Name of the School : School of Computing


10. Subject Code : SOC252
11. Name of the Subject : Advanced Web Technology Lab
12. Pre-Requisite(if any) : Nil
13. Credits : 4
14. Contact Hours : L: 3 T: 0 P: 2
15. Objective : The main objective of the course is present the
basic web technology concepts that are required for
developing web applications.

Laboratory Experiment 2 x 10=20

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 JavaBean so that it converts value of INR(IndianRupees) into equivalent


4. 2 Hrs
American/Canadian/Australian Dollar value.

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.

8. Write a program in javascript to perform Arithmetic operations. 2 Hrs

9. Write a javascript function that reverse anumber. 2 Hrs

10. Write a program in javascript to print thefibonacci series. 2 Hrs


97

Suggested Books:

S. Year of
Content
No Publication

Bayross, 2000, Web Enable Commercial Application Development Using


1. 2000
HTML,DHTML, Javascript, Perl CGI, BPB Publications

2. A.Russell Jones, Mastering Active Server Pages 3, BPB Publications. 2006

3. Uttam K Roy, ―Web Technology, Google Book 2010


98

8. Name of the School : School of Computing


9. Subject Code : BCA283
10. Name of the Subject : Problem Solving Skill-3 Lab
11. Pre-requisite (if any) : Nil
12. Credits : 1
13. Contact Hours : L: 0 T:0 P:2
14. Objective : In this course you will learn how to develop problem
solving and creativity skills and to recognize the importance
and function of problem solving and creative thoughts and
the role of critical thought in creative ideation.

Laboratory Experiment 2*10=20


1 2 Hours
2 2 Hours
3 2 Hours
4 2 Hours
5 2 Hours
6 2 Hours
7 2 Hours
8 2 Hours
9 2 Hours
10 2 Hours

Suggested Books:

S. Year of
Content
No Publication

1.

2.

3.
99

1. Name of the School : School of Computing


2. Subject Code : SOC 257
3. Name of the Subject : Data Communication and Networks
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T:1 P:0
7. Objective : The course objectives include learning about computer
network organization & implementation, obtaining a
theoretical understanding of data communication &
computer networks and gaining practical experience in
installation, monitoring & troubleshooting of current LAN
systems.

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.

Transport Layer: Transport Layer Design Issue, Connection Management, Buffer


5. Management, Quality of Service, Session Layer Design Issues Synchronization Issues, 07
Introduction to Presentation Layer, Encryption & Decryption, RSA Algorithm.

Total Hours 38
100

8. Suggested books: In tabular form given below:

S. Year of
Content
No. Publication

1. A.S. Tennenbaum, Computer Networks,PHI. 2013

2. W. Stallings, Data & Computer Communication,PHI. 2014

Forouzen, BehrouzA.Fegan, Sophia Chung Data Communications &


3. 2006
Networking,TMH.

Carne, E. Bryan Professional's Guide to Data Communication in a TCP/IP World


4. 2004
Artech House, London, 2004.

Young, Margret Levine Internet: The Complete Reference, Tata McGraw Hill, New
5. 2002
Delhi,2002.
101

1. Name of the School : School of Computing


2. Subject Code : SOC 258
3. Name of the Subject : Artificial Intelligence
4. Pre-Requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T: 0 P: 2
7. Objective : To make familiar with basic principles of AI, to capable of
using heuristic searches, aware of knowledge-based
systems, to able to use fuzzy logic and neural networks, and
to learn various applications domains AI.

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

Stuart Russell & Peter Norvig : "Artificial Intelligence : A ModernApproach",


2. 2010
Pearson Education, 2nd Edition.

Ivan Bratko : "Prolog Programming For Artificial Intelligence" , 2nd Edition Addison
3. 2001
Wesley, 1440.

4. Patterson: ―Introduction to AI and Expert System, PHI 1990


5. Carl Townsend, ―Introduction to turbo Prolog‖, Paperback, 1483 1989

6. Jacek M. Zurada, Introduction to artificial neural systems, Jaico Publication 1994

7. Nilsson : ―Principles of Artificial Intelligence, Morgan Kaufmann. 1998


103

1. Name of the School : School of Computing


2. Subject Code : VAP 252
3. Name of the Subject : Cloud Computing and Virtualization
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 3 T: 0 P: 6
7. Objective : The course enables students to understand the virtualization
technology, Applications along with cloud computing
concepts and services.

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

Network and Application Virtualization: Network Virtualization overview: VPN,


4. VLAN, challenges in using application in traditional install, use and update model, 5
solution for challenges, Architecture, benefits of Application Virtualization.
Cloud Implementation: Deployment and Delivery Models Cloud Deployment
models: Public, Private, Hybrid, pros and cons of each architecture, cloud deployment
decision factors, Business IT Control, Business critical application, data and
transaction security, compliance and audit, balance of CAPEX and OPEX, workload
characteristics, workload lifespan preferences, Industry segment- SME and Large
5. enterprises, Data Freedom, software characteristics, time ti deploy, Public Cloud: 10
factor matrix, advantage, disadvantage, Public Cloud: Factor Matrix, advantage and
disadvantage, Hybrid Cloud: factor matrix, advantage, disadvantage, Overview of
Cloud deliverymodels, infrastructure, IT Layers, IaaS Overview, features, cloud
bursting, multi tenancy, resource pooling, PaaS: overview, component, example,
SaaS:advantage, example.
Total 38

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

1. Name of the School : School of Computing


2. Subject Code : VAP 252
3. Name of the Subject : Data Warehousing And Data Mining
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 3 T: 0 P: 6
15. Objective : To understand data warehouse concepts, architecture,
business analysis, data pre-processing and data visualization
techniques.

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

1. Name of the School : School of Computing


2. Subject Code : VAP 252
3. Name of the Subject : Internet of Things
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 3 T: 0 P: 6
7. Objective : In this course, student will explore various components of
Internet of things such as Sensors, internetworking and
cyber space. In the end they will also be able to design and
implement IoT circuits and solutions.

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

1. Name of the School : School of Computing


2. Subject Code : VAP 252
3. Name of the Subject : Capstone Project -1
4. Pre-Requisite (if any) : Nil
5. Credits : 3
6. Contact Hours : L: 3 T: 0 P: 6
7. Objective :

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

8. Name of the School : School of Computing


9. Subject Code : VAP 252
10. Name of the Subject : Vivekananda Studies
11. Pre-Requisite (if any) : Nil
12. Credits : 3
13. Contact Hours : L: 3 T: 0 P: 6
14. Objective : To acquaint students with the eternal values of Indian
culture as lived and propagated by Swami Vivekananda 2. To apprise students with the basic philosophy,
path breaking ideas and discussions of human upliftment as envisioned in the writings and works of
Swami Vivekananda. 3. To build a strong foundation of Vedantic philosophy, with a special focus on
Practical Vedanta of SwamiVivekananda. 4. To highlight the significance of our traditional values for
generating peace, universal love, acceptance, tolerance, and harmony in our real life. 5. To sensitize
students to the values of service, sacrifice, self-control, selflessness, and moral courage and highlight the
significance of character building and spirituality in their self-development.

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

An introduction to the System ofVedanta, Introduction to Vivekachudamani and


3. 7
Advaita Vedanta Vivekananda‘s PracticalVedanta.

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

3 Gambhirananda, S. (2004).Ma Sri Sarada Devi. Calcutta: AdvaitaAshrama. 2004

Pandit , M. P. (1959).The Teachings of Sri Aurobindo. Kolkata: Sri AurobindoStudy 1959


4
Circle.
Mukerjee, B. (1997).Life and Teachings of Sri Ma Anandamayi, Sri 1997
5
SatguruPublication, Division of Indian Books Centre, Delhi, 1997.
Purnatmananda, S. (Ed.) &Gupta, M. S. (tr.). (2004)Reminiscences of SriSarada 2004
6
Devi Compiled in Bengali. Kolkata: AdvaitaAshrama.
Osborne, A. (2002).The teachings of Raman Maharshi in His own 2002
7
words.Tiruvannamalai : Sri Ramanasram.
Osborne, A. (2002).The teachings of Raman Maharshi in His own 2002
8
words.Tiruvannamalai : Sri Ramanasram.
112

9. Name of the School : School of Computing


10. Subject Code : VAP-251
11. Name of the Subject : Problem Solving Skills-4
12. Pre-Requisite (if any) : Nil
13. Credits : 3
14. Contact Hours : L: 0 T: 0 P: 6
15. Objective : The objective of this course is made aware the students
about problem solving strategies.

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

9. Name of the School : School of Computing


10. Subject Code : SOC 257
11. Name of the Subject : Data Communication and Networks Lab
12. Pre-Requisite (if any) : Nil
13. Credits : 4
14. Contact Hours : L: 3 T:1 P:0
15. Objective : The course objectives include learning about computer
network organization & implementation, obtaining a
theoretical understanding of data communication &
computer networks and gaining practical experience in
installation, monitoring & troubleshooting of current LAN
systems.

S. Contact
Content
No. Hours

1. 08

2. 08

3. 08

4. 07

5. 07

Total Hours 38
115

Suggested books: In tabular form given below:

S. Year of
Content
No. Publication

1.

2.

3.

4.

5.
116

8. Name of the School : School of Computing


9. Subject Code : SOC 258
10. Name of the Subject : Artificial Intelligence Lab
11. Pre-Requisite (if any) : Nil
12. Credits : 4
13. Contact Hours : L: 3 T: 0 P: 2
14. Objective : To make familiar with basic principles of AI, to capable of
using heuristic searches, aware of knowledge-based
systems, to able to use fuzzy logic and neural networks, and
to learn various applications domains AI.

Laboratory Component 2×10=20

1. Implement Non-AI and AI Techniques 2 hours


2 hours
2. Implementation of Best First Search using A* algorithm

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

Stuart Russell & Peter Norvig : "Artificial Intelligence : A ModernApproach",


2. 2010
Pearson Education, 2nd Edition.
117

Ivan Bratko : "Prolog Programming For Artificial Intelligence" , 2nd Edition Addison
3. 2001
Wesley, 1440.

4. Patterson: ―Introduction to AI and Expert System, PHI 1990


5. Carl Townsend, ―Introduction to turbo Prolog‖, Paperback, 1483 1989

6. Jacek M. Zurada, Introduction to artificial neural systems, Jaico Publication 1994

7. Nilsson : ―Principles of Artificial Intelligence, Morgan Kaufmann. 1998


118

1. Name of the School : School of Computing


2. Subject Code : BCA283
3. Name of the Subject : Problem Solving Skill-4 Lab
4. Pre-requisite (if any) : Nil
5. Credits : 1
6. Contact Hours : L: 0 T:0 P:2
7. Objective : In this course you will learn how to develop problem
solving and creativity skills and to recognize the importance
and function of problem solving and creative thoughts and
the role of critical thought in creative ideation.

Laboratory Experiment 2*10=20


1 2 Hours
2 2 Hours
3 2 Hours
4 2 Hours
5 2 Hours
6 2 Hours
7 2 Hours
8 2 Hours
9 2 Hours
10 2 Hours

Suggested Books:

S. Year of
Content
No Publication

1.

2.

3.
119

1. Name of the School : School of Computing


2. Subject Code : SOC-354
3. Name of the Subject : Big Data Analytics
4. Pre-requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T:0 P:2
7. Objective:
1 To study the basic technologies that forms the
foundations of Big Data.
2 To study the programming aspects of cloud
computing with a view to rapid prototyping of
complex applications.
3 To understand the specialized aspects of big data
including big data application, and big data
analytics.
4 To study different types Case studies on the current
research and applications of the Hadoop and big data
in industry.

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.

Data Analytics with R: Machine Learning: Introduction, Supervised Learning,


5. 07
Unsupervised Learning, Collaborative Filtering. Big Data Analytics with Big R.
Total Hours 38
120

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

1. Name of the School : School of Computing


1. Name of the Subject : Network and Cyber Security
2. Pre-requisite (if any) : Nil
3. Credits : 4
4. Contact Hours : L: 3 T:1 P:0
5. Objective : To understand basics of Cryptography and Network
Security, to be able to secure a message over insecure
channel by various means, to learn about how to maintain
the Confidentiality, Integrity and Availability of a data., to
understand various protocols for network security to protect
against the threats in the networks.

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.

Database Security: Data management technologies, Information security, Information


Management Technologies, Security policies, Policy enforcement & related issues, Design
2. principles, Multilevel relational data models, Security impact on database function, 07
inference problem

Software Security & Intrusion Detection: Defining a discipline, A Risk Management


Framework, Code review with a tool, Architectural risk analysis, Software penetrating
testing, Risk Based security Testing, An Enterprise S/W security program, Security
3. knowledge Intrusion detection Defining Intrusion Detection, Security concepts intrusion 08
Detection concept, determining strategies for Intrusion Detection, Responses, Vulnerability
Analysis, Credentialed approaches, Technical issues.

Cyber network security concepts: Security Architecture, antipattern: signature-based


malware detection versus polymorphic threads, document driven certification and
4. 07
accreditation, policy driven security certifications. Refactored solution: reputational,
behavioral and entropy-based malware detection.
Enterprise securityin Cyber Network using Zachman framework: Zachman
framework for enterprise architecture, primitive models versus composite models,
5. architectural problem-solving patterns, enterprise workshop, matrix mining, mini patterns 07
for problem solving meeting

Total Hours 36

6. Suggested Books:
122

S. Year of
Content
No Publication

William Stallings, ―Cryptography and Network Security‖,Prentice hall, New


1 2011
Jersey

2 Johannes A. Buchmann, ―Introduction to Cryptography‖, Springer Verlag 2012

3 AtulJahate, ―Cryptography and Network Security‖, TMH 2009

4 Mayank Bhushan, Rajkumar Singh, ―Fundamental of Cyber Security‖ 2017

5 Nina Godbole, SunitBelapure, ―Cyber Security‖ Wiley Edition 2011


123

1. Name of the Subject : Capstone Project -2


2. Pre-requisite (if any) : Nil
2. Credits : 4
3. Contact Hours : L: 3 T:1 P:0
4. Objective :

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

8. Name of the School : School of Computing


9. Subject Code : SOC-354
10. Name of the Subject : Big Data Analytics Lab
11. Pre-requisite (if any) : Nil
12. Credits : 4
13. Contact Hours : L: 3 T:0 P:2
14. Objective:
5 To study the basic technologies that forms the
foundations of Big Data.
6 To study the programming aspects of cloud
computing with a view to rapid prototyping of
complex applications.
7 To understand the specialized aspects of big data
including big data application, and big data
analytics.
8 To study different types Case studies on the current
research and applications of the Hadoop and big data
in industry.

Laboratory Experiment 2*10=20


Toinstall Hadoop framework, configure it and setup a single no decluster. Use web-
1. 2 Hours
based tools to monitor your Hadoop setup.
To implement file management tasks in Hadoop HDFS like adding, retrieving and
2. 2 Hours
deleting files.
To Implement basic functions and commands in R Programming. To build Word
3. Cloud, ate>.miningmethodusing R for easy to understand and better visualization than 2 Hours
a data table.
To implement a word count application using the Map Reduce APL
a. The largest integer
4. b. The average of all the integers. 2 Hours
c. The same set of integers, but with each integer appearing only once.
d. The count of the number of distinct integers in the input.
To implement basic CRUD operations (create, read, update, delete) in MongoDB and
5. 2 Hours
Cassandra
To develop a MapReduce application and implement a program thatminesweather
6. 2 Hours
data.
7. Hadoop Installation: Psuedo Distributed Mode( Locally ) 2 Hours
8. Create a directory in HDFS at given path(s). 2 Hours
9. Copy a file from source to destination 2 Hours
10. Move file from source to destination. 2 Hours

15. Suggested books:


126

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

1. Name of the School : School of Computing


2. Subject Code : SOC-352
3. Name of the Subject : Network and Cyber Security Lab
4. Pre-requisite (if any) : Nil
5. Credits : 4
6. Contact Hours : L: 3 T:1 P:0
7. Objective : To understand basics of Cryptography and Network
Security, to be able to secure a message over insecure
channel by various means, to learn about how to maintain
the Confidentiality, Integrity and Availability of a data., to
understand various protocols for network security to protect
against the threats in the networks.

Laboratory Experiment 2*10=20


1. 2 Hours
2. 2 Hours
3. 2 Hours
4. 2 Hours
5. 2 Hours
6. 2 Hours
7. 2 Hours
8. 2 Hours
9. 2 Hours
10. 2 Hours

8. Suggested Books:

S. Year of
Content
No Publication

William Stallings, ―Cryptography and Network Security‖,Prentice hall, New


1 2011
Jersey

2 Johannes A. Buchmann, ―Introduction to Cryptography‖, Springer Verlag 2012

3 AtulJahate, ―Cryptography and Network Security‖, TMH 2009

4 Mayank Bhushan, Rajkumar Singh, ―Fundamental of Cyber Security‖ 2017

5 Nina Godbole, SunitBelapure, ―Cyber Security‖ Wiley Edition 2011

You might also like