Syllabus Data Science 2020

SCHEME
for
BACHELOR OF TECHNOLOGY PROGRAMME
in
COMPUTER ENGINEERING
(Specialization in Data Science)
(w.e.f Session 2020-2021)
DEPARTMENT OF COMPUTER ENGINEERING
FACULTY OF INFORMATICS & COMPUTING
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA

FARIDABAD
J. C. BOSE UNIVERSITY OF SCIENCE & TECHNOLOGY, YMCA
VISION
J. C. Bose University of Science and Technology, YMCA, Faridabad aspires to be a nationally

and internationally acclaimed leader in technical and higher education in all spheres which
transforms the life of students through integration of teaching, research and character building.
MISSION
 To contribute to the development of science and technology by synthesizing teaching,

research and creative activities.
 To provide an enviable research environment and state-of-the art technological exposure
to its scholars.
 To develop human potential to its fullest extent and make them emerge as world class
leaders in their professions and enthuse them towards their social responsibilities.
DEPARTMENT OF COMPUTER ENGINEERING
VISION
The department aims to make a place at both national and international level by producing high
quality ethically rich computer engineers conversant with the state-of-the-art technology with
the ability to adapt the upcoming technologies to cater to the ever changing industrial demands
and societal needs. It endeavours to establish itself as a centre of excellence by contributing to
research areas having IT impact on the people‟s life and nation‟s growth.
MISSION
 To provide the future leaders in the area of computer engineering and information
technology through the development of human intellectual potential to its fullest extent.
 To enable the students to acquire globally competence through problem solving skills
and exposure to latest developments in IT related technologies.
 To educate the students about their professional and ethical responsibilities.
 To ensure continuous interaction with the industry and academia through collaborative
research projects.
ABOUT THE PROGRAM
The Bachelor of Technology (B.Tech) program in Computer Engineering with specialization

in Data Science has a strong flavor on design and hands-on experience. This is a 4- year
undergraduate degree course in engineering. As a primary objective, the program aims to
impart training to enrolled students with regard to existing and evolving techniques and theories
related to Data Science which include statistics, data mining, artificial intelligence, big data
and cloud computing and data visualization with strong focus on programming skills using
Python and R. This course is oriented towards Data Science and related aspects. Big Data
Analytics helps organization harness their data and use it to identify new opportunities. It leads
to smarter business moves, more efficient operations, higher profits and more satisfied
customers.The discipline‟s applications enable Data Scientists, Predictive Modellers, and other
analytics professionals to analyse growing volumes of structured transaction data. Besides the
theoretical and laboratory based curriculum, students complete an advanced programming
project in the final year of the program including one full semester in an industry.
This degree provides a solid foundation in core Computer Engineering disciplines with strong
focus on Data Science aspects, critical thinking and problem-solving skills. Through the
academic program, students also develop excellent written and oral communication skills, learn
to work as a team and project management.
NOTE:
1. The scheme will be applicable from Academic Session 2020-21onwards.
2. The syllabus for the theory and practical subjects is provided along with the scheme.
3. A student has to earn at least 12 credits during the duration of Degree subject to passing
of at least one MOOC course of 12 week duration (carrying minimum 3 credits) per
year through SWAYAM Platform. The Credit Transfer/Mobility Policy for Online
Courses approved in 17th Academic Council Dated 11.06.2019 may be referred for the
same.
B.TECH PROGRAM
COMPUTER ENGINEERING
PROGRAM EDUCATION OBJECTIVES

PEO1 To create knowledge about core areas related to the field of computer science and
information technology.
PEO2 To enable students to apply mathematics, science and computer engineering principles
to model, design and implement software projects to meet customers‟ business
objectives.
PEO3 To develop the ability to evaluate the computing systems from view point of quality,
security, privacy, cost effectiveness, utility and ethics.
PEO4 To inculcate lifelong learning by introducing principles of group dynamics, public
policies, environmental and societal context
PROGRAM OUTCOMES
PO1 Engineering knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based knowledge
and research methods including design of experiments, analysis and
interpretation of data, and synthesis of the information to provide valid
conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities
with the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and understanding
of the engineering and management principles and apply these to one‟s own
work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability
to engage in independent and life-long learning in the broadest context of
technological change.
PROGRAM SPECIFIC OUTCOMES

PSO1 Ability to design and develop analytic computing solutions using concepts of
Mathematics, Computer Engineering and other related disciplines to meet
customers‟ business objectives.
PSO2 Ability to test and analyze the quality of various subsystems and to integrate them
in order to evolve a larger business computing system.
STRUCTURE OF UNDERGRADUATE ENGINEERING PROGRAM
S.No. Category Breakup

of Credits (Total
177)
1 Humanities and Social Sciences including Management 9
Courses
2 Basic Science courses 35
3 Engineering Science courses including workshop, 16
drawing, basics of electrical/mechanical/computer etc
4 Professional core courses 73
5 Professional Elective courses relevant to chosen 0
specialization/branch
6 Open subjects – Electives from other technical and /or 12
emerging subjects
7 Project work, seminar and internship in industry or 20
Elsewhere
8 MOOCs 12
9 Mandatory Courses Non-credit
[Environmental Sciences, Induction training, Constitution
of India]
Total 177*
SEMESTER WISE SUMMARY OF THE PROGRAM
S.No. Semester No. of Contact Hours Marks Credits

1. I 25(A)/26(B) 650(A)/600(B) 19.5(A)/18.5(B)
2. II 26(A)/25(B) 600(A)/650(B) 18.5(A)/19.5(B)
3. III 35 800 25
4. IV 34 850 24
5. V 32 900 24
6. VI 30 800 24
7. VII 22 700 20
8. VIII One Semester 500 10
9. MOOCs - - 12*
Total 204 5800 177*
*Student has to earn at least 12 credits during the duration of Degree subject to passing
of at least one MOOC course of 12 week duration (carrying minimum 3 credits) per
year.
CREDIT DISTRIBUTION IN THE FIRST YEAR OF
UNDERGRADUATE ENGINEERING PROGRAM
Subject Lecture Tutorial Laboratory/ Total
(L) (T) Practical(P) credits(C)
Chemistry 3 1 3 5.5
Physics 3 1 3 5.5
Mathematics-1 3 1 0 4
Mathematics -2 3 1 0 4
Programming for Problem solving 3 0 4 5
English 2 0 2 3
Engineering Graphics & Design 0 0 4 2
Workshop 0 0 8 4
Basic Electrical Engg. 3 1 2 5
MOOC - - - 3
COURSE CODE AND DEFINITIONS

Course Code Definitions
L Lecture
T Tutorial
P Practical
BSC Basic Science Courses
ESC Engineering Science Courses
HSMC Humanities and Social Sciences including Management courses
PCC Professional core courses
OEC Open Elective courses
LC Laboratory course
MC Mandatory courses
PROJ Project
MOOC Massive Open Online Course
MANDATORY INDUCTION PROGRAM (3-WEEKS DURATION)
When new students enter an institution, they come with diverse thoughts, backgrounds and
preparations. It is important to help them adjust to the new environment and inculcate in them
the ethos of the institution with a sense of larger purpose. A 3-week long induction program
for the UG students entering the institution, right at the start, has to be planned. Normal classes
will start only after the induction program is over. Its purpose is to make the students feel
comfortable in their new environment, open them up, set a healthy daily routine, create bonding
in the batch as well as between faculty and students, develop awareness, sensitivity and
understanding of the self, people around them, society at large, and nature.
Tentative activities which can be planned in this Induction Programme are as follows:
 Physical Activity
 Creative Arts
 Universal Human Values
 Literary
 Proficiency Modules
 Lectures by Eminent People
 Visits to Local Area
 Familiarization to Dept./Branch & Innovations
HUMANITIES & SOCIAL SCIENCES INCLUDING MANAGEMENT
S.No. Code No. Course Title Hours Per week Total Semester
Credits
L T P
1 HSMC-101 English 1
2 - - 2
2 HSMC-102 English Lab 1
- - 2 1
3 HSMC- 01 Effective Technical 3 0 0 3 3

Communication
4 HSMC-02 Economics for 3 0 0 3 4
Engineers
Total Credits 9
BASIC SCIENCE COURSES (BSC)

S.No. Code No. Course Hours Per Week Total Semester
L T P Credits
1 BSC101D Physics(Semi Conductor 3 1 3 5.5 1/2
Physics)
2 BSC103E Mathematics –I (Calculus 3 1 0 4 1
& Linear Algebra)
3 BSC106E Mathematics –II 3 1 0 4 2
(Probability & Statistics)
4 BSC102 Chemistry 3 1 3 5.5 1/2
5 BSC-DS- Mathematics for Data 3 - - 3 3
301 Science
6 BSC-DS- Statistics -1 3 - 4 5 3
302 Statistics using MS-Excel
BSC-DS- lab
303
7 BSC-DS- Statistics-II 3 - 4 5 4
401
BSC-DS- Statistics -II Lab using R/
402 SPSS
6 BSC-01 Biology 2 1 0 3 5
Total Credits 35
ENGINEERING SCIENCE COURSE (ESC)
S.No. Code No. Course Title Hours Per Week Total Semester
Credits
L T P
1
ESC101 Basic Electrical Engineering 3 1 - 4
2
ESC104 Workshop- I - - 4 2
3 Basic Electrical Engineering
ESC107 - - 2 1
Lab
4 ESC102
Engineering Graphics &
Design - - 4 2
5 Programming for
ESC103 3 - - 3
Problem solving
6 Programming for
ESC105 - - 4 2
Problem solving Lab
7
ESC106 Workshop- II 2
- - 4
Total Credits 16
PROFESSIONAL CORE COURSES (PCC)

S.No. Code No. Course Title Hours Per Week Total Semester
Credits
L T P
1 PCC-CS-301 Data Structures & 3 0 4 5 3
Algorithms
PCC-CS-303 Data Structure &
Algorithms Lab
2 PCC-DS-301 Fundamentals to Database 3 0 4 5 3
Systems
PCC-DS-303 Database systems LAB
3 PCC-DS-302 IT Workshop(Python) 0 0 4 2 3
4 PCC-CS-401 Computer Networks 3 1 0 4 4
5 PCC-DS-401 Data Mining for Data 3 0 4 5 4
Science
PCC-DS-403 Data Mining Lab using
R/SPSS/Python
6 PCC-DS-402 Object Oriented 3 0 4 5 4
Programming with Java
PCC-DS-404 Object Oriented
Programming using
Java
7 PCC-DS-501 Artificial Intelligence for 3 0 0 3 5
Data Science
8 PCC-CS-404 Design and Analysis of 3 0 0 3 5
Algorithms
9 PCC-DS-502 Soft Computing for Data 3 0 4 5 5
Science
PCC-DS-504 Soft computing for Data
Science lab
10 PCC-CS-403 Operating System 3 0 4 5 5
PCC-CS-406 Operating system

Programming LAB
11 PCC-DS-503 Computer Architecture 3 0 0 3 5
12 PCC-DS-601 Machine Learning for 3 0 4 5 6
Data Science
PCC-DS-605 Machine Learning Lab
13 PCC-DS-602 Data Acquisition and 3 0 0 3 6
Analysis
14 PCC-DS-603 Big Data Fundamentals 3 0 4 5 6
PCC-DS-606 Big Data Lab
15 PCC-DS-604 Internet & Web 3 0 0 3 6
Technologies
16 PCC-DS-701 Cloud Computing 3 0 0 3 7
[Same syllabus but OEC
CODES]
17 PCC-DS-702 Natural language 3 0 0 3 7
Processing
18 PCC-DS-703 Deep Learning and Image 3 0 0 3 7
Processing
19 PCC-DS-704 Business Intelligence and 3 0 0 3 7
Predictive Analysis
Total Credits 73
OPEN ELECTIVE COURSES (OEC)

S. No. Code No. Course Title Hours Per Week Total Semester
Credits
L T P
1 OEC-CS-601 Open Elective-I 3 0 0 3 6
2 OEC-CS-602 Open Elective-II 3 0 0 3 6
3 OEC-CS-701 Open Elective-III 3 0 0 3 7
4 OEC-CS-702 Open Elective-IV 3 0 0 3 7
Total Credits 12
PROJECT AND INDUSTRIAL TRAINING

S. No. Code No. Course Title Hours Per Week Total Semester
Credits
L T P
1 PROJ-DS-301 Project-I - - 4 2 3
2 PROJ-DS-401 Project-II - - 4 2 4
3 PROJ-DS-501 Project-III - - 4 2 5
4 PROJ-DS-601 Project-IV - - 4 2 6
5 PROJ-DS-701 Project-V - - 4 2 7
6 PROJ-CS-801 Industry Internship - - - 10 8
Total Credits 20
J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA, FARIDABAD
B.Tech. (Computer Engineering Specialization in Data Science)
Scheme of Studies/Examination
Semester- 3
S. Category Course Course Title Hours per Credi Marks Marks for Total
No Code week ts for End Term
. Session Examinatio
al n
L T P
1 BSC BSC- Mathematics for 3 0 0 3 25 75 100
DS-301 Data Science
2 PCC PCC- Data Structures& 3 0 0 3 25 75 100
CS-301 Algorithms
3 PCC PCC- Fundamentals to 3 0 0 3 25 75 100
DS-301 Database Systems
4 BSC BSC- Statistics -1 3 0 0 3 25 75 100
DS-302
5 HSMC HSMC- Effective 3 0 0 3 25 75 100

01 Technical
Communication
6 Project PROJ- Project-I 0 0 4 2 25 75 100
DS-301
7 PCC PCC- IT Workshop 0 0 4 2 15 35 50
DS-302 (Python)
8 BSC BSC- Statistics using 0 0 4 2 15 35 50

DS-303 MS-Excel lab
9 PCC PCC- Database systems 0 0 4 2 15 35 50

DS-303 LAB
10 PCC PCC- Data Structure & 0 0 4 2 15 35 50

CS-303 Algorithms Lab
Total 15 0 20 25 210 590 800
Note:
(a) Theory exams will be of 03 hours duration and Practical exams will be of 02 hours
duration
(b) Additional 3 credits per year to be earned through MOOCs
Semester- 4
S. Catego Course Course Title Hours per Credi Marks Marks for Total
No ry Code week ts for End Term
L T P al n
1 PCC PCC-CS- Computer 3 1 0 4 25 75 100
401 Networks
2 BSC BSC-DS- 3 0 0 3 25 75 100

401 Statistics-II
3 PCC PCC-DS- Data Mining for 3 0 0 3 25 75 100
401 Data Science
4 PCC PCC-DS- Object Oriented 3 0 0 3 25 75 100
402 Programming
with Java
5 HSMC HSMC-02 Economics for 3 0 0 3 25 75 100
Engineers
6 MC MC-03 Environmental 2 0 0 0 25 75 100

Sciences
7 Project PROJ-DS- Project-II 0 0 4 2 25 75 100
401
8 BSC BSC-DS- Statistics -II Lab 0 0 4 2 15 35 50
402 using R/ SPSS
9 PCC PCC-DS- Data Mining Lab 0 0 4 2 15 35 50

403 using
R/SPSS/Python
10 PCC PCC-DS- Object Oriented 0 0 4 2 15 35 50
404 Programming
using Java
Total 17 1 16 24 220 630 850
Note:
duration
Semester- 5
L T P al n
1 PCC PCC-DS- Artificial 3 0 0 3 25 75 100
501 Intelligence for
Data Science
2 PCC PCC-CS- Design and 3 0 0 3 25 75 100

404 Analysis of
Algorithms
3 PCC PCC-DS- Soft Computing 3 0 0 3 25 75 100
502 for Data Science
4 PCC PCC-CS- Operating 3 0 0 3 25 75 100

403 System
5 BSC BSC-01 Biology 2 1 0 3 25 75 100
6 PCC PCC-DS- Computer 3 0 0 3 25 75 100

503 Architecture
7 MC MC-01 Constitution of 2 0 0 0 25 75 100
India
8 Project PROJ-DS- Project-III 0 0 4 2 25 75 100

501
9 PCC PCC-DS- Soft computing for 0 0 4 2 15 35 50

504 Data Science lab
10 PCC PCC-CS- Operating system 0 0 4 2 15 35 50
406 Programming
LAB
Total 20 0 12 24 230 670 900
Note:
duration
Semester- 6
L T P al n
1 PCC PCC-DS- Machine Learning 3 0 0 3 25 75 100
601 for Data Science
2 PCC PCC-DS- Data Acquistion 3 0 0 3 25 75 100
602 and Aanalysis
3 PCC PCC-DS- Big Data 3 0 0 3 25 75 100
603 Fundamentals
4 PCC PCC-DS- Internet & Web 3 0 0 3 25 75 100
604 Technologies
5 OEC OEC-CS- OpenElective-I 3 0 0 3 25 75 100
601
6. OEC OEC-CS- Open Elective-II 3 0 0 3 25 75 100
602
7. Project PROJ-CS- Project-IV 0 0 4 2 25 75 100
601
8 PCC PCC-DS- Machine Learning 0 0 4 2 15 35 50
605 Lab
9 PCC PCC-DS- Big Data Lab 0 0 4 2 15 35 50
606
Total 18 0 12 24 205 595 800
Note:
duration
Semester- 7 (May be carried out in 8th Semester*)
L T P al n
1 PCC PCC-DS- Cloud Computing 3 0 0 3 25 75 100
701
[Same syllabus but
OEC CODES]
2 PCC PCC-DS- Natural language 3 0 0 3 25 75 100

702 Processing
3 PCC PCC-DS- Deep Learning and 3 0 0 3 25 75 100

703 Image Processing
[SYLLABUS
NOT FOUND]
4 OEC OEC-CS- Open Elective-III 3 0 0 3 25 75 100

701
5 OEC OEC-CS- Open Elective-IV 3 0 0 3 25 75 100
702
6 PCC PCC-DS- Business 3 0 0 3 25 75 100
704 Intelligence and
Predictive
Analysis
7 Project PROJ-CS- Project-V 0 0 4 2 25 75 100

701
Total 17 1 4 20 175 525 700
* The course contents of 7th Semester may be pursued by the students of UTDs/Departments of
Affiliated colleges in 8th semester. In the case of pursuance of internship in 7th semester, the course
contents of 7th semester will be taught in 8th semester and vice-versa. The approval of such
interchangeability should be requested from the authority before the commencement of 7th semester.
Note: Exams duration will be as under
duration
Semester- 8 (May be carried out in 7th semester*)
S. Category Course Course Title Duration Credits Marks Marks Total

No. Code for for End
Session Term
al Examin
ation
1. Project PROJ- Industry 6 Months 10 200 300 500
CS-801 Internship*
Total 10 200 300 500
Note: Additional 3 credits per year to be earned through MOOCs
Procedure for Annual Examination and continuous Assessment

(A) Annual Exams Marks
1. Project Evaluation 50 Marks
2. Project Seminar 50 Marks
3. Project Viva 100 marks
(B) Continuous Assessment Marks

1. Assessment by Institute faculty 100 Marks
2. Assessment by Industrial Guide 150 Marks
3. Conduct Marks 50 Marks
* The Industry Internship may be pursued by UTDs/Departments of Affiliated colleges in 7th or 8th
semester. In the case of pursuance of internship in 7th semester, the course contents of 7th semester will
be taught in 8th semester and vice-versa. The approval of such interchangeability should be requested
from the authority before the commencement of 7th semester.
OPEN ELECTIVE COURSES*
Open Elective-I Open Elective-II Open Elective-III Open Elective-IV
Soft Skills and Human Resource Financial Economic Policies in
Interpersonal Management Management India
Communication (OEC-CS-602(I)) (OEC-CS-701(I)) (OEC-CS-702(I))
(OEC-CS-601(I))
Cyber Law and Ethics ICT for Development E-commerce and Cloud Computing
(OEC-CS-601(II)) (OEC-CS-602(II)) Entrepreneurship (OEC-CS-702(II))
(OEC-CS-701(II))
Data Analyticis using Intellectual Property R programming Optical Network
Python Rights (OEC-CS-701(III)) Design
(OEC-CS-601(III)) (OEC-CS-602(III)) (OEC-CS-702(III))
Electronic Devices International Business Renewable Energy High Speed Network
(OEC-CS-601(IV)) Environment System (OEC-CS-702(IV))
(OEC-CS-602(IV)) (OEC-CS-701(IV))
Digital System Design Operations Research - -
(OEC-CS-601(V)) (OEC-CS-602(V))
* The list is non-exhaustive and may be appended with new courses time to time with the
approval of Board of Studies.
ADDITIONAL REQUIREMENTS FOR B.TECH (Hons.)
A student will be eligible to get Under-Graduate (B.Tech) with Honours if he/she completes
additional credits through MOOC‟s. (AICTE Model Curriculum, Chapter1(B)). Following
pattern will be followed for earning additional credits for the award of Honours degree:
ogram ration edits to be nimum CGPA

earned*
Tech mester I to VIII
Note: From session 2019-20 onwards, for B.Tech program, a student has to earn at least 12
credits during the duration of the Degree subject to the passing of at least one MOOC course
(carrying minimum 3 credits) per year. The MOOC chosen by the student should not be on
offer/scheme of the degree.
The Credit Transfer/Mobility Policy for Online Courses approved in 17th Academic Council Dated
11.06.2019 may be referred for the same.
DETAILED 4-YEAR CURRICULUM CONTENTS
Undergraduate Degree in Engineering & Technology
Branch/Course: COMPUTER ENGINEERING
Second year (Third semester onwards)
PROFESSIONAL CORE COURSES

B.TECH. 3RD SEMESTER
CODE: ESC-301
SUBJECT NAME: MATHEMATICS FOR DATA SCIENCE
CREDITS: 3
SESSIONAL: 25 L T P
THEORY EXAM: 75 3 00
TOTAL: 100
Course Objectives:
To acquaint the students with concepts relating to
1. Mathematical logic, functions and relations
2. Graph theory and algebraic structures
3. State machines and formal language
4. Numerical Methods in solving the problems of Polynomial, definite integrals and
differential equations
Course Contents:
Unit I
Counting Techniques, Permutation & Combination, Pigeonhole Principle, Basic Proof
Techniques, Induction, Propositional Logic, Quantifiers, Equivalences and Normal Forms,
Sets, Functions and Relations, Equivalence Relation, Partial Order Relation, Hasse Diagram,
Posets, Concept of Lattice.
Unit II
Graphs and Relations, Directed Graphs, Undirected Graphs, Connectivity, Trees,Tree
Traversal Minimum spanning tree, Graph Coloring, Hamiltonian and Euler‟s Graph, Planar
Graph, Shortest Path algorithm
Unit III
Generating function, Algebraic Structure, Group, Abelian Group, Cyclic Group, permutation
group, Cosets, Langrange‟s Theorem, Normal Subgroup
Unit IV
Formal definition of a language, Discussion on grammar, Terminal, Non Terminal, Production
System, Chomsky Hierarchy of Grammar and associated machines
Unit V
Solution of polynomial using Bisection, RegulaFalsi and Newton Raphson Method, Solving
the definite integrals using Trapozoidal method and Simpson Rule, Solving differential
equation using RungaKutta Method
Course Outcomes
After completing this course, the students should have developed a clear understanding of
1. Mathematical logic, functions and relations
2. Graph theory and algebraic structures
3. State machines and formal language
4. Numerical Methods for solving Polynomials, definite integrals and differential
equations
Reference Books:
1. C.L.Liu: Elements of Discrete Mathematics McGraw Hill.
2. Lipschutz, Seymour: Discrete Mathematics, Schaum's Series.
3. Babu Ram: Discrete Mathematics, Vinayek Publishers, New Delhi.
4. Trembley, J.P. & R. Manohar: Discrete Mathematical Structure with Application to
Computer Science, TMH.
5. Kenneth H. Rosen : Discrete Mathematics and its applications, TMH
6. Doerr Alan &Levasseur Kenneth; Applied Discrete Structures for Computer Science,
Galgotia Pub. Pvt. Ltd.
7. Theory of Computer Science; K.L.P. Mishra. N. Chandrasekaran
8. Introductory Methods of Numerical Analysis, S SSastri, PHI
9. Numerical Methods: Problems and Solutions, Jain Iyenger Jain, New Age International
Publishers
CODE: PCC-CS-301
SUBJECT NAME: DATA STRUCTURES & ALGORITHMS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To enable them to write algorithms for solving problems with the help of fundamental
data structures
Course Contents:
MODULE 1: INTRODUCTION
Basic Terminologies: Elementary Data Organizations, Data Structure Operations: insertion,
deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-Space trade off.
Searching: Linear Search and Binary Search Techniques and their complexity analysis.
MODULE 2: STACKS AND QUEUES
ADT Stack and its operations: Algorithms and their complexity analysis, Applications of
Stacks: Expression Conversion and evaluation – corresponding algorithms and complexity
analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue;
Operations on each types of Queues: Algorithms and their analysis.
MODULE 3: LINKED LISTS
Singly linked lists: Representation in memory, Algorithms of several operations: Traversing,
Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue,
Header nodes, Doubly linked list: operations on it and algorithmic analysis; Circular Linked
Lists: all operations their algorithms and the complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree,
Binary Search Tree, AVL Tree; Tree operations on each of the trees and their algorithms with
complexity analysis. Applications of Binary Trees, B Tree, B+ Tree: definitions, algorithms
and analysis.
MODULE 4: SORTING AND HASHING
Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all the methods.
Hashing and collision resolution.
Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and
complexity analysis.
Course Outcomes:
1. For a given algorithm student will able to analyze the algorithms to determine the time and
computation complexity and justify the correctness.
2. For a given Search problem (Linear Search and Binary Search) student will able to
implement it.
3. For a given problem of Stacks, Queues, linked list and Tree, student will able to implement
it and analyze the same to determine the time and computation complexity.
4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion Sort, Quick
Sort, Merge Sort, Heap Sort and compare their performance in term of Space and Time
complexity.
5. Student will able to implement Graph search and traversal algorithms and determine the time
and computation complexity.
References:
1. A. M. Tenenbaum, Langsam, Moshe J. Augentem , “Data Structures using C,” PHI Pub.
2. A.V. Aho, J.E. Hopcroft and T.D. Ullman, “Data Structures and Algorithms” Original
edition, Addison-Wesley, 1999, Low Priced Edition.
3. Ellis Horowitz &SartajSahni, “Fundamentals of Data structures” Pub, 1983,AW
CODE: ESC-302
SUBJECT NAME: FUNDAMENTALS TO DATABASE SYSTEMS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
COURSE OBJECTIVES
1. To make the students able to understand basic terminology used in database systems,
basic concepts, the applications of database systems.
2. To understand role of Database administrator in DBMS. Teaching them various data
model like Hierarchical model, Network Model, Relational model, E-R model , E-R
diagram from data given by user and table from E-R diagram,.
3. Make the students familiar with relational database theory and be able to write relational
algebra expressions for query, the logical design guidelines for databases, normalization
approach, primary key, super key, foreign key concepts.
Course Contents:
UNIT-I
Database: Introduction to database, relational data model, DBMS
architecture, data independence, DBA, database users, end users, front endtools.
UNIT-II
Modelling: Entity types, entity set, attribute and key, relationships, relation types, E- R
diagrams,database design using ERdiagrams.
UNIT-III
Relational Data Model: Relational model concepts, relational
constraints, primary and foreign key, normalization: 1NF, 2NF,3NF.
UNIT-IV
Transaction management and Concurrency control: Transaction management: ACID
properties, serializability and concurrency control, Lock based concurrency control (2PL,
Deadlocks), Time stamping methods, optimistic methods, database recovery management.
UNIT-V
Structured Query Language: SQL queries, create a database table, create relationships
between database tables, modify and manage tables, queries, forms, reports, modify, filter
and viewdata.
COURSE OUTCOMES
1. To understand the basic concepts, applications and architecture of databasesystems.
2. To master the basics of ERdiagram.
3. To understand relational database algebra expressions and construct queries
usingSQL.
4. To implement design principles for logical design of databases.
Reference Books
1. Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3rdedition, Addision-

Wesley, Low PricedEdition,2000.
2. An Introduction to Database Systems by C.J. Date, 7th edition, Addison-Wesley, Low
Priced Edition, 2000.
3. Database Management and Design by G.W. Hansen and J.V. Hansen, 2nd edition,
Prentice- Hall of India, Eastern EconomyEdition,1999.
4. Database Management Systems by A.K. Majumdar and P. Bhattacharyya, 5thedition,Tata
McGraw-Hill Publishing. ,1999.
5. A Guide to the SQL Standard, Date, C. and Darwen,H. 3rd edition, Reading, MA:,
Addison- Wesley,1994.
6. Data Management & file Structure by Loomis, PHI,1989.
7. P. Rob, C. Coronel, Database System Concepts by, Cengage Learning India,2008.
8. R. Elmsasri,S. Navathe Fundamentals of Database Systems, Pearson Education,Fifth
Edition,2007.
9. MySQL : ReferenceManual
CODE: BSC-302
SUBJECT NAME: STATISTICS -1
CREDITS: 3
SESSIONAL: 25 L T P
THEORY EXAM: 75 3 0 0
TOTAL: 100
Course Objectives
1. How to summarize the data and to obtain its salient features from the vast mass of
original data.
2. Concepts of probability and its applications.
3. Concept of index numbers
4. Concept of regression analysis
Course Contents:
UNIT I
Statistical Methods: Definition and scope of Statistics, concepts of statistical population and
sample. Data: quantitative and qualitative, attributes, variables, scales of measurement
nominal, ordinal, interval and ratio. Presentation: tabular and graphical representation of data.
Consistency and independence of data with special reference to attributes.
UNIT II
Measures of Central Tendency: mathematical and positional. Measures of Dispersion: range,
quartile deviation, mean deviation, standard deviation, coefficient of variation, Moments,
absolute moments, factorial moments, skewness and kurtosis, Sheppard‟s corrections.
UNIT III
Bivariate data: Definition, scatter diagram, simple, partial and multiple correlation (3 variables
only), rank correlation. Simple linear regression, principle of least squares and fitting of
polynomials and exponential curves.
UNIT IV
Index Numbers: Definition, construction of index numbers and problems thereof for weighted
and unweighted index numbers. Fixed based index numbers and chain index numbers,
conversion of fixed based to chain based index numbers and vice-versa. Consumer price index
numbers.
UNIT V
Probability: Introduction, random experiments, sample space, events and algebra of events.
Definition of Probability: classical, statistical and axiomatic. Conditional Probability, laws of
addition and multiplication, independent events, theorem of total probability, Bayes‟ theorem
and its applications. Random variables: discrete and continuous random variables, p.m.f., p.d.f.
and c.d.f.
Course Outcomes
1. Tabular and graphical representation of data based on variables and curve fitting
2. Measures of central tendency, Dispersion, Skewness and Kurtosis.
3. Important theorems on probability and their use in solving problems.
4. Index numbers and their creation
Reference Books
1. Goon A.M., Gupta M.K. and Dasgupta B. (2002): Fundamentals of Statistics, Vol. I & II,
8thEdn. The World Press, Kolkata.
2. Miller, Irwin and Miller, Marylees (2006): John E. Freund‟s Mathematical Statistics with
Applications, (7th Edn.), Pearson Education, Asia.
3. Mood, A.M. Graybill, F.A. and Boes, D.C. (2007): Introduction to the Theory of Statistics,
3rd Edn., (Reprint), Tata McGraw-Hill Pub. Co. Ltd.
4. Hogg, R.V., Tanis, E.A. and Rao J.M. (2009): Probability and Statistical Inference, Seventh
Ed, Pearson Education, New Delhi.
CODE: HSMC-01
SUBJECT NAME: EFFECTIVE TECHNICAL COMMUNICATION
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. Learning to structure content following recognized patterns of technical and
creative writing with the ability to define, describe, classify and compare products
and processes; fostering clear conceptualization.
2. Undertake guided exercises for better drafts that show familiarity with editing
techniques like hedging and generalization.
3. Guiding self-appraisal through SWOC analysis and goal setting aided by basic
problem solving and critical thinking.
4. Learning skills of corporate communication.
Course Contents:
MODULE 1: INFORMATION DESIGN AND DEVELOPMENT
Different kinds of technical documents, Information development life cycle, Organization
structures, factors affecting information and document design, Strategies for organization,
Information design and writing for print and for online media.
MODULE 2: TECHNICAL WRITING, GRAMMAR AND EDITING
Technical writing process, forms of discourse, Writing drafts and revising, Collaborative
writing, creating indexes, technical writing style and language. Basics of grammar, study of
advanced grammar, editing strategies to achieve appropriate technical style. Introduction to
advanced technical communication, Usability, Hunan factors, Managing technical
communication projects, time estimation, Single sourcing, Localization.
MODULE 3: SELF DEVELOPMENT AND ASSESSMENT
Self assessment, Awareness, Perception and Attitudes, Values and belief, Personal goal setting,
career planning, Self-esteem. Managing Time; Personal memory, Rapid reading, Taking notes;
Complex problem solving; Creativity
MODULE 4: COMMUNICATION AND TECHNICAL WRITING
Public speaking, Group discussion, Oral; presentation, Interviews, Graphic presentation,
Presentation aids, Personality Development. Writing reports, project proposals, brochures,
newsletters, technical articles, manuals, official notes, business letters, memos, progress
reports, minutes of meetings, event report.
MODULE 5: ETHICS
Business ethics, Etiquettes in social and office settings, Email etiquettes, Telephone Etiquettes,
Engineering ethics, Managing time, Role and responsibility of engineer, Work culture in jobs,
Personal memory, Rapid reading, Taking notes, Complex problem solving, Creativity.
Course Outcomes:
1. Students will have learnt to structure content following recognized patterns of
technical and creative writing and acquired the ability to define, describe, classify
and compare products and processes with clear conceptualization.
2. Will be able to draft and edit better demonstrating familiarity with editing
techniques like hedging and generalization.
3. Demonstrate ability for self-appraisal through SWOC analysis and goal setting
aided by basic problem solving and critical thinking.
4. Will have learnt skills of corporate communication.
References:
1. David F. Beer and David McMurrey, Guide to writing as an Engineer, John Willey. New
York, 2004
2. Diane Hacker, Pocket Style Manual, Bedford Publication, New York, 2003. (ISBN
0312406843)
3. Shiv Khera, You Can Win, Macmillan Books, New York, 2003.
4. Raman Sharma, Technical Communications, Oxford Publication, London, 2004.
5. Dale Jungk, Applied Writing for Technicians, McGraw Hill, New York, 2004. (ISBN:
07828357-4)
6. Sharma, R. and Mohan, K. Business Correspondence and Report Writing, TMH New Delhi
2002.
7. Xebec, Presentation Book, TMH New Delhi, 2000. (ISBN 0402213)
CODE: PCC-CS-302
SUBJECT NAME: IT WORKSHOP (PYTHON)
CREDITS: 2
SESSIONAL: 25 L T P
THEORY EXAM: 75 004
TOTAL: 100
Course Objectives:
1. Fundamentals and Data structures of pythons programminglanguage.
2. Use collections of Python
3. Basics of functions and Files of Python
4. Concepts of classes and objects in Python
Course Contents:
Unit 1: Basic concepts of Python
Installation and Working with Python, Understanding Python variables, Python basic
Operators, Understanding python blocks, standard Python library, Declaring and using
Numeric data types: int, float, complex,User interaction: standard input output ; Control
structures : selection constructs- using if, else and elif, Repetition constructs- simple for loops
in python, for loop using ranges, Use of while loops in python, Loop manipulation using pass,
continue, break and else. Programming using Python conditional and loops block.
Unit 2: Collections
Understanding String in build methodsList –methods to process lists, Shallow & Deep copy,
Nested lists, lists as matrices, lists as stacks, Queues, De queues.Tuples - basic operations on
tuples, nested tuples,Dictionaries – operations on dictionary, ordered dictionary, iteration on
dictionary, conversion of lists & strings into dictionary, Sets & frozen sets, looping techniques
on lists & dictionaries
Unit3 : Functions and Files in Python
Functions – basics of functions, functions as objects, recursive functions, Lamda, filter, reduce,
map, list comprehension, iterators andgenerators. Files - reading config files in python, Writing
log files in python, Understanding read functions, read(), readline() and readlines(),
Understanding write functions, write() and writelines(), Manipulating file pointer using seek,
Programming using file operations
Unit 4: Classes
The Class Definition, Constructors, Operations, using Modules, Hiding Attributes, Overloading
Operators, Inheritance, Deriving Child Classes, Creating Class Instances, Invoking Methods,
Polymorphism. The Basics of NumPy: NumPy Array Basics , Boolean Selection, Helpful
Methods and Shortcuts
Course Outcomes:
1. Write programs efficiently in python
2. Effectively use functions and files in python
3. Carry out basic data science operations like retrieving, processing and visualizing using
python.
4. Use the concept of classes and objects in Python
Reference Books:
1. Martin C. Brown , “Python, The Complete Reference” , Mc-Graw Hill, 2002
2. Wesley J Chun, “Core Python Programming”, Prentice Hall, Second Edition,2006
3. Dr. M. Shubhakantasingh, “Programming with Python and its applications to Physical
Systems” Manakin Press.
CODE: PCC-CS-302
SUBJECT NAME: STATISTICS USING MS-EXCEL LAB
CREDITS: 2
SESSIONAL: 15 L T P
END SEMESTER: 35 0 0 4
TOTAL: 50
Course Contents:
Exercises relating to
1. Basic Tables
2. Graphs
3. Data Validation
4. Central Tendency finding
5. Advance IFs
6. Box and Whisker Plots
7. Correlation & Regression
8. Lookup functions
9. Advance Lookup functions
10. Pivot Tables
11. Advance Pivot Tables
12. Using Advanced Filters in Tables with multiple criteria and extract ranges.
13. Writing macros in EXCEL
Reference Books:
1. Excel 2016: Formulas And Functions by Paul McFedries, Pearson
2. Excel 2016 Formulas by Michael Alexander and Dick Kusleika, John Wiley
CODE: ESC-304
SUBJECT NAME: DATABASE SYSTEM (LAB)
CREDITS: 2
SESSIONAL: 15 L T P
END SEMESTER: 35 0 04
TOTAL: 50
Course Contents:
1) Create a database having two tables with the specified fields, to computerize alibrary
system of a Delhi University College.
LibraryBooks (Accession number, Title, Author, Department, PurchaseDate, Price)
IssuedBooks (Accession number, Borrower)
a) Identify primary and foreign keys. Create the tables and insert at least 5 recordsin
eachtable.
b) Delete the record of book titled “Database SystemConcepts”.
c) Change the Department of the book titled “Discrete Maths” to“CS”.
d) List all books that belong to “CS”department.
e) List all books that belong to “CS” department and are written by author“Navathe”.
f) List all computer (Department=”CS”) that have beenissued.
g) List all books which have a price less than 500 or purchased between“01/01/1999”
and“01/01/2004”.
2) Create a database having three tables to store the details of students ofComputer Department
in yourcollege.
Personal information about Student (College roll number, Name of student, Date of
birth, Address, Marks(rounded off to whole number) in percentage at 10 + 2, Phone
number)
Paper Details (Paper code, Name of the Paper)
Student’s Academic and Attendance details (College roll number, Paper code,
Attendance, Marks in home examination).
a) Identify primary and foreign keys. Create the tables and insert at least 5 records in
eachtable.
b) Design a query that will return the records (from the second table) along with the name
of student from the first table, related to students who have more than 75% attendance
and more than 60% marks in paper2.
c) List all students who live in “Delhi” and have marks greater than 60 in paper1.
d) Find the total attendance and total marks obtained by eachstudent.
e) List the name of student who has got the highest marks in paper2
3) Create the following tables and answer the queries given below:
Customer (CustID, email, Name, Phone, ReferrerID)
Bicycle (BicycleID, DatePurchased, Color, CustID, ModelNo)
BicycleModel (ModelNo, Manufacturer, Style)
Service (StartDate, BicycleID, EndDate)
a) Identify primary and foreign keys. Create the tables and insert at least 5 records in
each table.
b) List all the customers who have the bicycles manufactured by manufacturer“Honda”.
c) List the bicycles purchased by the customers who have been referred by customer“C1”.
d) List the manufacturer of red colored bicycles.
e) List the models of the bicycles given for service.
4) Create the following tables, enter at least 5 records in each table and answer the queries
given below.
EMPLOYEE ( Person_Name, Street, City )
WORKS ( Person_Name, Company_Name, Salary )
COMPANY ( Company_Name, City )
MANAGES ( Person_Name, Manager_Name )
a) Identify primary and foreign keys.
b) Alter table employee, add a column “email” of type varchar(20).
c) Find the name of all managers who work for both Samba Bank and NCB Bank.
d) Find the names, street address and cities of residence and salary of all employees
who work for “Samba Bank” and earn more than$10,000.
e) Find the names of all employees who live in the same city as the company for
which they work.
f) Find the highest salary, lowest salary and average salary paid by each company.
g) Find the sum of salary and number of employees in each company.
h) Find the name of the company that pays highest salary.
5) Create the following tables, enter at least 5 records in each table and answer the queries
given below.
Suppliers (SNo, Sname, Status, SCity)
Parts (PNo, Pname, Colour, Weight, City)
Project (JNo, Jname,Jcity)
Shipment (Sno, Pno, Jno, Qunatity)
a) Identify primary and foreign keys.
b) Get supplier numbers for suppliers in Paris with status>20.
c) Get suppliers details for suppliers who supply part P2. Display the supplier
listin increasing order of supplier numbers.
d) Get suppliers names for suppliers who do not supply partP2.
e) For each shipment get full shipment details, including total shipment weights.
f) Get all the shipments where the quantity is in the range 300 to 750inclusive.
g) Get part nos. for parts that either weigh more than 16 pounds or are supplied by
suppliers S2, or both.
h) Get the names of cities that store more than five red parts.
i) Get full details of parts supplied by a supplier in London.
j) Get part numbers for part supplied by a supplier in London to a project in London.
k) Get the total number of project supplied by a supplier (say,S1).
l) Get the total quantity of a part (say, P1) supplied by a supplier (say,S1)
Course Outcomes:
After the completion of the course
 Create Database efficiently in SQL.

 Effectively use SQL functions.
 Carry out basic SQL operations on Tables.
 Use the concept of primary key and foreign key in SQL.
CODE: PCC-CS-303
SUBJECT NAME: DATA STRUCTURES AND ALGORITHMS (LAB)
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
S.No. Experiment
1 Programs on String
2 Programs on Array
3 Programs on Pointer
4 Write a program to search an element from an array using Linear Search
5 Write a program to search an element from an array using Binary Search
6 Write a program to sort elements of an array using selection sort
7 Write a program to sort elements of an array using insertion sort
8 Write a program to sort elements of an array using bubble sort
9 Write a program to sort elements of an array using Quick sort
10 Write a program to sort elements of an array using Merge sort
11 Write a program to push , pop and display the elements in a stack using array
12 Write a program to convert infix into postfix notation using stack using array
13 Write a program to evaluate postfix notation using stack
14 Write a program to insert, delete and display the elements in a queue using
array
15 Write a program to insert, delete and display the elements in a circular queue
16 Write a program to insert, delete and display the elements in a one way linked
list at beginning, at end and at certain point
17 Write a program to insert, delete and display the elements in a two way linked
list at beginning, at end and at certain point
18 Write a program to push , pop and display the elements in a stack using
linked list
19 Write a program to convert infix into postfix notation using stack using linked
list
20 Write a program to insert, delete and display the elements in a queue using
linked list
21 Write a program to insert, delete and display the elements in a binary tree
22 Write a program to insert, delete and display the elements in a binary search
tree
23 Write a program to sort elements using heap sort
24 Write a program to insert, delete and display elements in a graph
4TH SEMESTER
CODE: PCC-CS-401
SUBJECT NAME: COMPUTER NETWORKS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To develop an understanding of modern network architectures from a design and
performance perspective.
2. To introduce the student to the major concepts involved in wide-area networks (WANs),
local area networks (LANs) and Wireless LANs (WLANs).
3. To provide an opportunity to do network programming
4. To provide a WLAN measurement ideas.
Course Contents:
MODULE-1: DATA COMMUNICATION COMPONENTS

Representation of data and its flow Networks , Various Connection Topology, Protocols and
Standards, OSI model, Transmission Media, LAN: Wired LAN, Wireless LANs, Connecting
LAN and Virtual LAN, Techniques for Bandwidth utilization: Multiplexing - Frequency
division, Time division and Wave division, Concepts on spread spectrum.
MODULE-2: DATA LINK LAYER AND MEDIUM ACCESS SUB LAYER
Error Detection and Error Correction - Fundamentals, Block coding, Hamming Distance, CRC;
Flow Control and Error control protocols - Stop and Wait, Go back – N ARQ, Selective Repeat
ARQ, Sliding Window, Piggybacking, Random Access, Multiple access protocols -Pure
ALOHA, Slotted ALOHA, CSMA/CD,CDMA/CA
MODULE-3: NETWORK LAYER
Switching, Logical addressing – IPV4, IPV6; Address mapping – ARP, RARP, BOOTP and
DHCP–Delivery, Forwarding and Unicast Routing protocols.
MODULE-4: TRANSPORT LAYER
Process to Process Communication, User Datagram Protocol (UDP), Transmission Control
Protocol (TCP), SCTP Congestion Control; Quality of Service, QoS improving techniques:
Leaky Bucket and Token Bucket algorithm.
MODULE-5: APPLICATION LAYER
Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW,
HTTP, SNMP, Bluetooth, Firewalls, Basic concepts of Cryptography
Course Outcomes:
1. Explain the functions of the different layer of the OSI Protocol.
2. Draw the functional block diagram of wide-area networks (WANs), local area networks
(LANs) and Wireless LANs (WLANs) describe the function of each block.
3. For a given requirement (small scale) of wide-area networks (WANs), local area networks
(LANs) and Wireless LANs (WLANs) design it based on the market available component
4. For a given problem related TCP/IP protocol developed the network programming.
5.Configure DNS DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP,
SNMP, Bluetooth, Firewalls using open source available software and tools.
Reference Books:
1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGrawHill.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall
India.
3. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International
Edition.
4. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of India.
5. TCP/IP Illustrated, Volume 1, W. Richard Stevens, Addison-Wesley, United States of
America
CODE: PCC-CS-402
SUBJECT NAME: STATISTICS-II
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives
1. Probability distributions and their expectation.
2. Estimation of population parameters using sample statistics and draw appropriate
conclusions from the analysis.
3. Null and alternative hypothesis
4. Regression Analysis and models
Course Contents:
UNIT I
Standard probability distributions: Binomial, Poisson, geometric, negative binomial,
hypergeometric, uniform, normal, exponential, Cauchy, beta and gamma along with their
properties and limiting / approximation cases.
UNIT II
Concept of population and sample, complete enumeration versus sampling, sampling and non-
sampling errors. Types of sampling: non-probability and probability sampling, basic principle
of sample survey, simple random sampling with and without replacement, definition and
procedure of selecting a sample, estimates of: population mean, total and proportion, variances
of these estimates, estimates of their variances and sample size determination.
UNIT III
Methods of Estimation: Method of moments, method of maximum likelihood estimation,
method of minimum Chi-square, basic idea of Bayes estimators.
UNIT IV
Principles of test of significance: Null and alternative hypotheses (simple and composite),
Type-I and Type-II errors, critical region, level of significance, size and power, best critical
region, most powerful test, uniformly most powerful test.
UNIT V
Regression analysis: Simple regression analysis, Estimation and hypothesis testing in case of
simple and multiple regression models, Concept of model matrix and its use in estimation.
Analysis of variance: Definitions of fixed, random and mixed effect models, analysis of
variance and covariance in one-way and two way classified data for fixed effect models.
Course Outcomes
1. Concept of random variables and its probability distributions.

2. Sampling Techniques
3. Basic concepts of hypothesis testing, including framing of null and alternative
hypothesis.
4. Regression analysis and models.
Reference Books:
1. Goon A.M., Gupta M.K. and Dasgupta B. (2002): Fundamentals of Statistics, Vol. I & II,
8thEdn. The World Press, Kolkata.
2. Miller, Irwin and Miller, Marylees (2006): John E. Freund‟s Mathematical Statistics with
Applications, (7th Edn.), Pearson Education, Asia.
3. Mood, A.M. Graybill, F.A. and Boes, D.C. (2007): Introduction to the Theory of Statistics,
3rd Edn., (Reprint), Tata McGraw-Hill Pub. Co. Ltd.
4. Hogg, R.V., Tanis, E.A. and Rao J.M. (2009): Probability and Statistical Inference, Seventh
Ed, Pearson Education, New Delhi.
5. A.M. Goon, M.K. Gupta and Das Gupta: Fundamentals of Statistics, Vol. 1, The World Press
Pvt. Ltd., Kolkata, 1966.
6. Mukhopadhyay, P. : Mathematical Statistics, New Central Book Agency, Calcutta,1996.
CODE:
SUBJECT NAME: DATA MINING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Pre-requisites: Database Management System

Course Objectives:
1. To familiarize the students with the basic roadmap of data mining and various data
mining techniques.
2. To introduce the techniques of frequent pattern mining and Clustering
3. To acquaint students with classification and prediction techniques in data mining.
4. To introduce students with time series data, data streams, advance mining applications
areas like web mining, social network analysis etc.
MODULE-1: INTRODUCTION
Introduction to Data Warehousing, Architecture, Data warehouse schemas, OLAP servers,
OLAP operations, KDD process, Data Mining: Architecture, Predictive and Descriptive
models, Data Preprocessing: Data cleaning & Discretization, Data Mining primitives and
Applications, Major issues in data mining
MODULE-2: FREQUENT PATTERN MINING AND CLUSTERING
Mining frequent patterns, association and correlations; Association Rule Mining: support &
confidence, a-priori algorithm, FP Growth algorithm; Advanced Pattern Mining; Sequential
Pattern Mining concepts, Cluster Analysis – Types of Data in Cluster Analysis, Similarity and
Distance Measures, Partitioning methods: k-means & k-medoids, Hierarchical Methods:
agglomerative and divisive methods; Density-Based Methods, Clustering with Constraints,
Outlier Detection
MODULE-3: CLASSIFICATION AND PREDICTION
Classification: Basic Concepts, Decision tree induction, Bayesian classification, Bayesian Belief
Networks; Lazy Learners, Rule based classification, Model Evaluation and Selection, improve
classifier accuracy, back propagation through Neural Networks, Genetic Algorithm, Support
Vector Machines, Prediction: linear and non-linear regression techniques.
MODULE-4: ADVANCED MINING APPLICATIONS
Mining Complex Data Types: Mining Data Streams: Stream Data Processing and Stream Data
Systems, Mining Time series Data: Periodicity Analysis for time related sequence data,
Similarity search in Time-series analysis; Web Mining, Web page layout structure; mining web
link structure, content and usage patterns; Recent trends in Distributed Warehousing and Data
Mining, Class Imbalance Problem; Graph Mining; Social Network Analysis
Course Outcomes:
After completion of course, students would be able to:
1. Understand and interpret the contribution of data warehousing and data mining to
the decision-support level of organizations.
2. Categorize and carefully differentiate between situations for applying different
data-mining techniques: frequent pattern mining, associations and correlations.
3. Design and deploy appropriate classification techniques for different applications.
4. Evaluate various mining techniques on complex data objects and ability to solve
real world problems in business and scientific information using data mining.
REFERENCES
1. Jiawei Han and M Kamber, Data Mining Concepts and Techniques,, Second
Edition, Elsevier Publication, 2011.
2. Introduction to Data Mining - Pang-Ning Tan, Michael Steinbach, Vipin Kumar,
Addison Wesley, 2006. 3. G Dong and J Pei, Sequence Data Mining, Springer,
2007.
3. Alex Berson, Stephen J. Smith “Data Warehousing, Data-Mining & OLAP”, TMH
4. Margaret H. Dunham, S. Sridhar,”Data Mining:Introductory and Advanced Topics”
Pearson Education
CODE: PCC-CS-404
SUBJECT NAME: OBJECT ORIENTED PROGRAMMING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To understand Java programming constructs like variable, primitive data types,
operators, type conversion, type casting etc.
2. To develop program by using classes, object, interface, multithreading, constructors,
packages, polymorphism, inheritance, exception and file handling.
3. To understand the various concepts of advanced java programming and to familiarize
the student with the AWT hierarchy and to acquaint the student the concepts of event
handling of JAVA
4. To understand the concepts of Swing package and learn the basics of data access using
JDBC
5. To implement the server-side programming using JSP and to familiarize the students
with the concepts of reusable classes using JAVA Beans
6. To perform the network programming and Remote method invocation.
Course Contents:
Unit-I FUNDAMENTALS OF JAVA PROGRAMMING: Java Programming
Constructs, Classes, Objects, constructors, Interfaces, Packages, Exceptions
handling, Multithreading, Streams and file I/O: Applets, Introduction to JDBC,
Types of JDBC Drivers, JDBC Architecture, JDBC Classes and Interfaces.
Unit-II AWT AND SWINGS:AWT Class Hierarchy, Creating Containers and adding
Components, Layout, Panels, event Handling, Adapter Classes, Dialog Boxes,
Scrollbar, Menus, Difference between AWT and Swings, Containment Hierarchy
of Swings, Adding Components, JTextField, JPasswordField,JTable,
JComboBox,JProgressBar, JList,JTree, JColorChooser, Dialogs.
Unit- III JSP & INTRODUCTION TO J2EE: Introduction to JSP, advantage of JSP over
java Servlet, architecture of JSP, Life cycle of JSP, Basic tags and implicit objects,
action tags. Introductions to Java Beans, Properties, accessor Methods, Bean
builder, advantages of java beans, BDK Introspection: Design patterns, Bean info
Interface, persistence, customizer, Java beans API, EJB: Benefits of EJB, usage
scenario, EJB Architecture, session Beans, Entity Beans, Introduction to Struts
Framework.
Unit-IV NETWORK PROGRAMMING AND RMI : Networking Basic, Sockets,
knowing IP address, using URL Class and URL Connection Class, communication
between Server and client, retrieving a file at server, RMI: RMI Architecture, RMI
registry, dynamic code loading in RMI, RMI API Creating a distributed application
using RMI, directory and Naming Services, overview of JNDI, object serialization.
Course Outcomes:
After the course completion the students will be:
1. The students will be to implement the problems using the classes, polymorphism,
inheritance, exception, files, multithread, and Interface.
2. The students will be able to create User interface using AWT and Swings and connect it to
with the database using JDBC.
3. The students will be to perform server-side scripting using JSP and apply java beans to solve
the problems
4. The Students will be able to established client server communication and create distributed
application by using of the RMI.
Reference Books:
1. Sachin Malhotra and Saurabh Chaudhary, “Programming in JAVA”, Oxford
University Press, ISBN: 0-19-806358
2. E-Balagurusamy, “Programming with JAVA- A Primer” Tata McGraw-Hill
Publishers, ISBN 0-07-463542-5
3. Dietel and Dietel “CORE JAVA”
4. Herbert Shield “The complete reference-JAVA2”, TMH
5. Uttam K. Roy, “Advanced Java Programming”, Oxford University Press, ISBN: 0-19-
945550-3
6. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication.
7. Internet & Web Technologies – Raj Kamal, TMH
8. Herbert Shield “The complete reference-JAVA2” , TMH
CODE: HSMC-402
SUBJECT NAME: ECONOMICS FOR ENGINEERS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
The students should be able to:
1. Understand the supply and demand forces.
2. Build an ability to be an efficient engineer by utilizing limited resources to satisfy unlimited
wants.
3. Get knowledge about the market environment and take decisions regarding price
determination.
4. Develop awareness about the economic forces influencing an organisation.
Course Contents:
MODULE-1:
Introduction to the subject: Micro and Macro Economics, Relationship between Science,
Engineering, Technology and Economic Development. Production Possibility Curve, Nature
of Economic Laws.
MODULE-2:
Time Value of Money: concepts and application. Capital budgeting; Traditional and modern
methods, Payback period method, IRR, ARR, NPV, PI (with the help of case studies)
MODULE-3:
Meaning of Demand. Law of Demand, Elasticity of Demand; meaning, factors effecting it and
its practical application and importance. Demand forecasting (a brief explanation)
MODULE-4:
Meaning of Production and factors of production, Law of variable proportions and returns to
scale. Internal and external economies and diseconomies of scale. Concepts of cost of
production, different types of costs; accounting cost, sunk cost, marginal cost, and Opportunity
cost. Break even analysis, Make or Buy decision (case study). Relevance of Depreciation
towards industry.
MODULE-5:
Meaning of market, types of market, perfect competition, Monopoly, Monopolistic, Oligopoly.
(main features). Supply and law of supply, Role of demand and supply in price determination.
MODULE-6:
Indian Economy, nature and characteristics. Basic concepts; fiscal and monetary policy, LPG,
Inflation, Sensex, GATT, WTO and IMF. Difference between Central bank and Commercial
banks
Course Outcomes:
After the successful completion of the course, students will be able to:
1. Utilise the understanding of economic forces for different aspects of an organisation.
2. Take decisions about optimum use of different resources.
3. Apply decisions methodologies to decide the different aspects of the product of an organisation
in different market conditions.
4. Utilise the different aspects of economics for understanding the organisational problems and
manage it in the best possible way.
Reference Books:
1. Jain T.R., Economics for Engineers, VK Publication
2. Chopra P. N., Principle of Economics, Kalyani Publishers
3. Dewett K. K., Modern economic theory, S. Chand
4. H. L. Ahuja., Modern economic theory, S. Chand
5. DuttRudar&Sundhram K. P. M., Indian Economy
6. Mishra S. K., Modern Micro Economics, Pragati Publications
7. Pandey I.M., Financial Management; Vikas Publishing House
8. Gupta Shashi K., Management Accounting, Kalyani Publication
CODE: MC-03
SUBJECT NAME: ENVIRONMENTAL SCIENCES
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. The prime objective of the course is to provide the students a detailed knowledge on the
threats and challenges to the environment due to developmental activities.
2. The students will be able to identify the natural resources and suitable methods for their
conservation and sustainable development.
3. The focus will be on awareness of the students about the importance of ecosystem and
biodiversity for maintaining ecological balance.
4. The students will learn about various attributes of pollution management and waste
management practices. The course will also describe the social issues both rural and urban
environment and environmental legislation
Course Contents:
MODULE-1: The Multidisciplinary Nature of Environmental Studies

Definition, scope and importance. Need for public awareness.
MODULE-2: Natural Resources: Renewable and Non-Renewable Resources
Natural resources and associated problems:
 Forest resources: Use and over-exploitation, deforestation, case studies. Timber
extraction, mining, dams and their effects on forests and tribal people.
 Water resources: Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dams-benefits and problems.
 Mineral resources: Use and exploitation, environmental effects of extracting and
mineral resources, case studies.
 Food resources: World food problems, changes caused by agriculture and overgrazing,
effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case
studies.
 Energy resources: Growing energy needs, renewable and non- renewable energy
sources, use of alternate energy sources. Case studies.
 Land resources: Land as a resource, land degradation, man induced landslides, soil
erosion and desertification.
 Role of an individual in conservation of natural resources. Equitable use of resources
for sustainable lifestyles.
MODULE-3: Ecosystems
 Concept of an ecosystem. Structure and function of an ecosystem. Producers,
consumers and decomposers.
 Energy flow in the ecosystem. Ecological succession. Food chains, food webs and
ecological pyramids.
 Introduction, types, characteristic features, structure and function of the following
ecosystem: a) Forest ecosystem b) Grassland ecosystem c) Desert ecosystem d) Aquatic
ecosystems (ponds, streams, lakes, rivers, oceans, estuaries).
MODULE-4: Biodiversity and its Conservation
 Introduction – Definition: genetic, species and ecosystem diversity.
Biogeographical classification of India. Value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and option values. Biodiversity at global,
National and local levels.
 India as a mega-diversity nation. Hot-spots of biodiversity. Threats to biodiversity:
habitat loss, poaching of wildlife, man-wildlife conflicts. Endangered and endemic
species of India. Conservation of biodiversity: insitu and ex-situ conservation of
biodiversity
MODULE-5: Environmental Pollution Definition
 Causes, effects and control measures of: Air pollution b) Water pollution c) Soil
pollution d) Marine pollution e) Noise pollution f) Thermal pollution g) Nuclear
hazards
 Solid waste Management: Causes, effects and control measures of urban andindustrial
wastes. Role of an individual in prevention of pollution. Pollution case studies. Disaster
management: floods, earthquake, cyclone and landslides.
MODULE-6: Social Issues and the Environment
 From Unsustainable to Sustainable development Urban problems related to energy.
Water conservation, rain water harvesting, watershed management. Resettlement and
rehabilitation of people; its problems and concerns. Case studies.
 Environmental ethics: Issues and possible solutions. Climate change, global warming,
acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies.
Wasteland reclamation. Consumerism and waste products.
 Environment Protection Act. Air (Prevention and Control of Pollution) Act. Water
(Prevention and Control of Pollution) Act
 Wildlife Protection Act. Forest Conservation Act. Issues involved in enforcement of
environmental legislation Public awareness.
MODULE-7: Human Population and the Environment
Population growth, variation among nations. Population explosion – Family Welfare
Programme. Environment and human health. Human Rights. Value Education.
HIV/AIDS. Women and Child Welfare. Role of Information Technology in
Environment and human health. Case Studies.
MODULE-8: Field Work
 Visit to a local area to document environmental assets-river / forest / grassland / hill /
mountain.
 Visit to a local polluted site – Urban / Rural / Industrial / Agricultural.
 Study of common plants, insects, birds.
 Study of simple ecosystems – pond, river, hill slopes, etc.
Course Outcomes (COs):

At the end of the program the students acquired knowledge about:
1) Understand / evaluate / develop technologies on the basis of ecological principles and

environmental regulations which in turn help in sustainable development. The students
will also be able to introduce the thinking about environmental issues from an
interdisciplinary perspective.
2) Identify and relate about the renewable and non-renewable resources, their importance
and ways of conservation to sustain human life on earth.
3) Know about the concepts of ecosystem and its function in the environment, the need
for protecting the producers and consumers in various ecosystems and their role inthe
food web.
4) Recognize, relate and become sensitive to the effects of pollution and will be able
tocontribute his learning‟s towards their prevention or mitigation. The students will also
be able to describe the social issues along with the trends of human population growth
and the possible means to combat the challenges.
Reference Books:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL
Learning Private Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela 2008
PHI Learning Pvt Ltd.
3. Environmental Science by Daniel B. Botkin& Edwards A. Keller, Wiley INDIA edition.
CODE: PCC-CS-405
SUBJECT NAME: STATISTICS -II LAB USING R/ SPSS
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
R/ SPSS Lab
1. Basic fundamentals, installation and use of software, data editing
2. Use of R as a calculator, functions and assignments.
3. Use of R for matrix operations, missing data and logical operators.
4. Conditional executions and loops, data management with sequences.
5. Data management with repeats, sorting, ordering, and lists.
6. Vector indexing, factors, Data management with strings, display and formatting.
7. Data management with display paste, split and replacement, manipulations with alphabets,
evaluation of strings, data frames.
8. Data frames, import of external data in various le formats, statistical functions, compilation
of data.
9. Graphics and plots, statistical functions for central tendency, variation, skewness and
kurtosis.
10. Handling of bivariate data through graphics, correlations, programming and illustration
with examples.
11. Parametric and Non Parametric testing of Statistical Hypothesis, t-test
12. One way ANOVA, two way ANOVA
13. Simple Correlation, Linear Regression, Multiple Linear Regression,
14. Testing for overall significance of Model Coefficients,
15. Testing for Individual Regression Coefficients, Outliers Detection, Dealing with multi-
collinearity
Reference Books
1. Learning Statistics using R ByRndall, E.Schumacker, Sage Publication
2. R for Everyone By Jared P.Lander, Pearson Education
CODE: PCC-CS-406
SUBJECT NAME: DATA MINING LAB USING R/SPSS/PYTHON
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
Course Objectives:
1. To familiarize the students with the basics of Python and SPSS modeler.
2. To introduce Python Libraries: Numpy, Pandas, Matplotlib, Scipy, Seaborn and SKLearn
3. To acquaint students with implementation of various data mining and visualization
techniques in Python.
4. To get them understand SPSS modeler working environment, creation of streams and
collecting data.
5. To acquaint students about modeling in SPSS.
Outline:
1. Basic fundamentals, installation and use of software (Python/SPSS Modeler)
2. Python/SPSS Fundamentals and working environment
3. Introduction to Python Libraries: Numpy, Pandas, Matplotlib, Scipy, Seaborn and
SKLearn
4. Data Wrangling - Numpy and Pandas
5. Data Cleaning using Pandas
6. Data Visualization using matplotlib and Seaborn
7. Learn Applied Statistics - Descriptive Statistics in Python
8. Learn Statistics - Statistical Inference in Python
9. Implementation of Supervised ML - Linear Regression in Python
10. Implementation of Supervised ML - Logistic regression in Python
11. Implementation of Supervised ML - Decision Tree Model in Python
12. Implementation of Ensemble Techniques - Random Forest in Python
13. Implementation of Ensemble Techniques - Boosting Techniques in Python
14. Implementation of Unsupervised ML - Clustering and Principal Component Analysis
in Python
15. Implementation of NLP - Text Processing and Sentimental Analysis techniques in
Python
16. Creation of data streams in SPSS Modeler
17. Data visualization techniques in IBM SPSS Modeler
18. Implementation of clustering techniques in SPSS Modeler on sample datasets
19. Implementation of a-priori algorithm in SPSS Modeler on sample datasets
20. Implementation of classification techniques: Decision tree (CART) and Regression
Techniques: Linear regression in SPSS Modeler
Course Outcomes:
After completion of course, students would be able to:
1. Understand the basic concepts and roadmap of Python and IBM SPSS Modeler.
2. Understand and implement various data mining techniques like clustering,
association rule discovery, classification and regression
3. Categorize and carefully differentiate between situations for applying different
data-mining techniques: frequent pattern mining, associations, classification and
regression using learned software
4. Build models for trending real world data analytical problems like sentiment
analysis, text analysis etc.
REFERENCES
1. Jiawei Han and M Kamber, Data Mining Concepts and Techniques,, Second
Edition, Elsevier Publication, 2011.
2. McKinney, W. (2012). Python for data analysis: Data wrangling with Pandas,
NumPy, and IPython. " O'Reilly Media, Inc.".
3. Swaroop, C. H. (2003). A Byte of Python. Python Tutorial.
CODE: PCC-CS-407
SUBJECT NAME: OBJECT ORIENTED PROGRAMMING USING
JAVA LAB
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
List of Programs
1. Write a program to take a string and copy some of the characters of the string in to character
array.
2. Write a program for splitting a string into pieces wherever a space is found.
3. Write a program to initialize the instance variables of a class, using parameters constructor.
4. Write a program to test whether a static variable can access the instance variable or not.
5. Write a program to test whether a static variable can access the static variable or not.
6. Write a program to create a package with the name pack and store the addition class in it.
7. Write a program to shows how a package is import a package and use the class of the imported
package
8. Write a program which tell us the use of try, catch and finally block.
9. Write a program which shows how to write and read a data from the file.
10. Write a program to improve the efficiency to write and read a data from the file.
11. Write a program to show the serialization and de- serialization of object
12. Write a program to synchronize the threads acting on a single object. The synchronized block
on the program can be executed by only thread at a time
13. Write a program depicting a situation in which deadlock can occur.
14. Write a program to implement the producer – consumer problem using thread communication
5TH SEMESTER
CODE: ESC-501
SUBJECT NAME: ARTIFICIAL INTELLIGENCE
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course objectives:
1. To understand achievements of AI and the theory underlying those achievements and
review "conventional" searching methods including breadth-first, depth-first, best-first
search any many more heuristic techniques. Heuristic functions and their effect on
performance of search algorithms.
2. To represent the knowledge in different forms in AI.
3. To understand and apply reasoning in Different areas of AI.
4. To learn the different methods of Planning and learning, Neural network and genetic
algorithms. Architecture of Rule based and Non Rule based expert system
Course Contents:
Unit-I BASICS OF AI: Definition of AI, History, Domains AI, Proposing and evaluating
AI applications, AI problems & State space, Some examples problems
representations like Travelling Salespersons, Syntax analysis Problem, Basic issues
to solve AI problems, Underlying assumptions, AI techniques, Level of model,
Criteria for success
Unit II SEARCH AND PLANNING: Control strategies, Uninformed Search (DFS, BFS,
IDDFS), Heuristic Search Techniques: Generate & Test: Hill Climbing(simple &
steepest), Best first search/A*, Problem Reduction/AO*, Constraint satisfaction,
MEA, Simulated annealing, Constraint Satisfaction Problems
Unit-III KNOWLEDGE REPRESENTATION TECHNIQUES AND REASONING:

Syntax & Semantic for Propositional logic, Syntax & Semantic for Predicate Logic,
Problems with FOPL, Resolution of proposition logic, Semantic nets, Frames,
Conceptual Graphs, Scripts, Baye‟sTheorm, Demster Shafer Theory of Evidence,
Fuzzy Reasoning, Temporal Reasoning
Unit-IV PLANNING & LEARNING: Planning, Planning in Situational calculus,

Representation for planning, Partial order planning, Partial order planning
algorithm, Learning by Examples, Learning by Analogy, Explanation based
learning, Neural nets, Genetics algorithms, Architecture of expert system(Rule
Based and Non-Rule Based)
Course outcomes:
After undergoing the course, Students will be able to:
a. Understand the importance, the basic concepts and the Applications of AI and Apply various
search techniques used for Intelligent systems
b. Efficiently represent the various knowledge representation schemes used for
intelligent systems.
c. Apply Reasoning in different areas of AI
d. Apply Soft computing techniques (like ANN and GA) to solve the AI problem. Also
understand the phases and the architecture of various advanced system like NLP
based system and Expert System.
Reference Books:
1. David W. Rolston: Principles of Artificial Intelligence and Expert System

Development, McGraw Hill Book Company.
2. Artificial Intelligence by Elain Rich & Kevin Knight, TMH
3. Principals of AI(Nills .J.Nilsson)
4. DAN. W.Petterson
5. AI by Russel and Norvig, Pearson education
6. Petrick Henry Winston(AI)
CODE: PCC-CS-501
SUBJECT NAME: ADA
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.
Course Contents:
MODULE-1: INTRODUCTION
Characteristics of algorithm, Analysis of algorithm: Asymptotic analysis of complexity bounds
– best, average and worst-case behaviour; Performance measurements of Algorithm, Time and
space trade-offs, Analysis of recursive algorithms through recurrence relations: Substitution
method, Recursion tree method and Masters‟ theorem.
MODULE-2:FUNDAMENTAL ALGORITHMIC STRATEGIES
Brute-Force, Greedy, Dynamic Programming, Branch and-Bound and backtracking
methodologies for the design of algorithms; Illustrations of these techniques for Problem-
Solving, Bin Packing, Knapsack, Job sequencing with deadline, Optimal Binary Search tree,
N-Queen problem, Hamiltonian Cycle, TSP, Heuristics – characteristics and their application
domains.
MODULE-3:GRAPH AND TREE TRAVERSAL ALGORITHMS
Depth First Search (DFS) and Breadth First Search (BFS); Shortest path algorithms, Transitive
closure, Minimum Spanning Tree, Topological sorting, Network Flow Algorithm.
MODULE-4:TRACTABLE AND INTRACTABLE PROBLEMS
Computability of Algorithms, Computability classes – P, NP, NP-complete and NP-hard,
Cook‟s theorem, Standard NP-complete problems and Reduction techniques.
MODULE-5:ADVANCED TOPICS
Approximation algorithms, Randomized algorithms, Class of problems beyond NP – P SPACE
Course Outcomes:
1. For a given algorithms analyze worst-case running times of algorithms based on asymptotic
analysis and justify the correctness of algorithms.
2. Describe the greedy paradigm and explain when an algorithmic design situation calls for it.
For a given problem develop the greedy algorithms.
3. Describe the divide-and-conquer paradigm and explain when an algorithmic design situation
calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrence relation.
4. Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the dynamic
programming algorithms, and analyze it to determine its computational complexity.
Reference Books :
1. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein, “Introduction to
Algorithms”, MIT Press/McGraw-Hill; 3rd edition, [ISBN: 978-0262533058], 2009.
2. Ellis Horowitz, SartajSahni and SanguthevarRajasekaran, “Fundamentals of Algorithms”,
Universities Press; 2nd edition [ISBN:978-8173716126],2008.
3. Jon Kleinberg and ÉvaTardos, “Algorithm Design”, Pearson Publisher; 1st edition [ISBN:978-
0321295354],2012.
4. Michael T Goodrich and Roberto Tamassia, “Fundamentals of Algorithms” Wiley Press; 1st edition
[ISBN:978-8126509867],2006.
CODE: PCC-CS-502
SUBJECT NAME: SOFT COMPUTING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives
1. Basic techniques related to Soft Computing and their roles in building intelligent
machines
2. How to identify and select the suitable soft computing technology for solving the real
world problem
3. How to design the suitable soft computing based framework for solving the real world
problem
4. How to implement soft computing based solutions for real-world problems.
Unit I
Introduction to Soft Computing, Requirement of Soft computing, Soft computing Vs Hard
Computing, Major domains covered under Soft Computing
Unit II
Biological neural network, Artificial Neural Network, Learning rules and various activation
functions, Single layer Perceptrons , AND OR and NOT type classifiers, XOR problem, Back
Propagation networks, Architecture of Backpropagation(BP) Networks, Backpropagation
Learning, Gradient Descent Method, Variation of Standard Back propagation Neural Network,
Introduction to Associative Memory, Adaptive Resonance theory and Self Organizing Map.
Unit III
Fuzzy Systems: Fuzzy Set theory, Fuzzy versus Crisp set, s-norm, t-norm, complement norm,
aggregation norms, concept of fuzzy numbers, Fuzzification, Minmax Composition,
Defuzzification Method, Fuzzy Logic, Fuzzy Rule based systems, Fuzzy Decision Making,
Fuzzy Control Systems. K means clustering, fuzzy c means clustering.
UNIT IV
Genetic Algorithm: History of Genetic Algorithms (GA), Working Principle, Various
Encoding methods, Fitness function, GA Operators- Reproduction, Crossover, Mutation,
Convergence of GA, Bit wise operation in GA, Multi-level Optimization. Solving Knapsack
and Travelling Salesman Problem using GA.
Course Outcomes
1. Apply fuzzy logic and reasoning to handle uncertainty and solve various engineering
problems
2. Apply Genetic algorithms in solving combinatorial optimization problems.
3. Apply Neural networks in classification, regression, clustering and other problems
related to inductive learning
Reference Books:
1. Fuzzy Sets and Fuzzy Logic: Theory and Applications, George J Klir and Bo Yuan,
PHI
2. Neural Networks, A Classroom Approach, Satish Kumar, Tata McGraw Hill
3. Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis & Applications,
S.Rajasekaran, G. A. Vijayalakshami, PHI.
4. Genetic Algorithms: Search and Optimization, E. Goldberg.
CODE: PCC-CS-503
SUBJECT NAME: OPERATING SYSTEM
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To understand evolution and types of OS and to understand the structure, components and
functions of OS.
2. To learn about Processes, threads and various Scheduling policies.
3. To understand process concurrency and synchronization.
4. To understand the principles of concurrency and Deadlocks.
5. To understand various memory management schemes.
6. To understand virtual memory management, Disk management, I/O management and File
systems
Course Contents:
MODULE-1:Introduction: Concept of Operating Systems, Generations of Operating systems,
Types of Operating Systems, OS Services, System Calls, Structure of an OS - Layered,
Monolithic, Microkernel Operating Systems.
MODULE-2:Processes: Definition, Process Relationship, Different states of a Process,
Process State transitions, Process Control Block (PCB), Context switching
Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of
multithreads.
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling
criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time;
Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR.
MODULE-3:Inter-process Communication: Critical Section, Race Conditions, Mutual
Exclusion, Hardware Solution, Strict Alternation, Peterson‟s Solution, The
Producer/Consumer Problem, Semaphores, Monitors, Message Passing, Classical IPC
Problems: Reader‟s & Writer Problem, Dinning Philosopher Problem etc.
MODULE-4:Deadlocks: Definition, Necessary and sufficient conditions for Deadlock,
Deadlock Prevention, Deadlock Avoidance: Banker‟s algorithm, Deadlock detection and
Recovery.
MODULE-5:Memory Management: Basic concept, Logical and Physical address map,
Memory allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and
External fragmentation and Compaction; Paging: Principle of operation – Page allocation –
Hardware support for paging, Protection and sharing, Disadvantages of paging.
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of
reference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page Replacement
algorithms: Optimal, First in First out (FIFO) and Least Recently used (LRU).
MODULE-6:I/O Hardware: I/O devices, Device controllers, Direct memory access Principles
of I/O Software: Goals of Interrupt handlers, Device drivers, Device independent I/O software,
Secondary-Storage Structure: Disk structure, Disk scheduling algorithms
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), Free-space
management (bit vector, linked list, grouping), directory implementation (linear list, hash
table).
Case study: UNIX and WINDOWS Operating System.
Course Outcomes:
After the completion of the course, the students will be able to:
1. Learn the basic concepts of operating system, its various types and architecture
2. Learn and implement process management issues including process life cycle,
scheduling, synchronization and deadlocks
3. Learn and implement memory management issues including memory partitioning,
memory allocation and virtual memory concept
4. Learn and implement files systems and I/O systems including file management and disk
management
Reference Books:
1. Abraham Silberschatz, Peter Galvin, Greg Gagne, “Operating System Concepts
Essentials”, 9th Edition, Wiley Asia StudentEdition.
2. Naresh Chauhan, "Principles of Operating Systems,",Oxford University Press India, 2014.
3. William Stallings, “Operating Systems: Internals and Design Principles”, 5th Edition,
Prentice Hall ofIndia.
CODE: PCC-IT-501
SUBJECT NAME: BIOLOGY
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
At the end of this course, students will be able to understand:
1) Biology is an important scientific discipline as Mathematics, Physics and Chemistry.
2) “Genetics” is to Biology what Newton‟s Laws are to physical sciences.
3) All forms of life have the same building blocks and yet the manifestations are as diverse
as one can imagine
4) Without catalysis, life would not have exist on earth .
5) Molecular basis of coding and decoding (genetic information) is universal
6) Fundamental principles of chemical and physical energy transactions are the same in
physical/chemical and biological world
Course Contents:
MODULE 1: INTRODUCTION
Purpose: To convey that Biology is as important a scientific discipline as Mathematics, Physics
and Chemistry.Bring out the fundamental differences between science and engineering by
drawing acomparison between eye and camera, Bird flying and aircraft. Mention the most
exciting aspectof biology as an independent scientific discipline. Why we need to study biology?
Discuss howbiological observations of 18th Century that lead to major discoveries. Examples
from Brownianmotion and the origin of thermodynamics by referring to the original observation
of RobertBrown and Julius Mayor. These examples will highlight the fundamental importance
ofobservations in any scientific inquiry.
MODULE 2: CLASSIFICATION
Purpose: To convey that classification per se is not what biology is all about. The
underlyingcriterion, such as morphological, biochemical or ecological be highlighted.Hierarchy
of life forms at phenomenological level. A common thread weaves this hierarchyClassification.
Discuss classification based on (a) cellularity- Unicellular or multicellular (b)ultrastructure-
prokaryotes or eucaryotes. (c) energy and Carbon utilisation -Autotrophs,heterotrophs,
lithotropes (d) Ammonia excretion – aminotelic, uricoteliec, ureotelic (e) Habitataacquatic or
terrestrial (e) Molecular taxonomy- three major kingdoms of life. A given organismcan come
under different category based on classification. Model organisms for the study ofbiology come
from different groups. E.coli, S.cerevisiae, D. Melanogaster, C. elegance, A.Thaliana, M.
Musculus.
MODULE 3: Genetics
Purpose: To convey that “Genetics is to biology what Newton‟s laws are to Physical Sciences”
Mendel‟s laws, Concept of segregation and independent assortment. Concept of allele.
Genemapping, Gene interaction, Epistasis. Meiosis and Mitosis be taught as a part of
genetics.Emphasis to be give not to the mechanics of cell division nor the phases but how genetic
materialpasses from parent to offspring. Concepts of recessiveness and dominance. Concept of
mappingof phenotype to genes. Discuss about the single gene disorders in humans. Discuss the
concept ofcomplementation using human genetics.
MODULE 4: BIOMOLECULES
Purpose: To convey that all forms of life has the same building blocks and yet themanifestations
are as diverse as one can imagineMolecules of life. In this context discuss monomeric units and
polymeric structures. Discussabout sugars, starch and cellulose. Amino acids and proteins.
Nucleotides and DNA/RNA. Twocarbon units and lipids.
MODULE 5: ENZYMES
Purpose: To convey that without catalysis life would not have existed on earth.Enzymology:
How to monitor enzyme catalysed reactions. How does an enzyme catalysereactions? Enzyme
classification. Mechanism of enzyme action. Discuss at least two examples.Enzyme kinetics
and kinetic parameters. Why should we know these parameters to understandbiology? RNA
catalysis.
MODULE 6: INFORMATION TRANSFER
Purpose: The molecular basis of coding and decoding genetic information is
universalMolecular basis of information transfer. DNA as a genetic material. Hierarchy of
DNA structurefrom single stranded to double helix to nucleosomes. Concept of genetic code.
Universality anddegeneracy of genetic code. Define gene in terms of complementation and
recombination.
MODULE 7: MACROMOLECULAR ANALYSIS
Purpose: How to analyse biological processes at the reductionist levelProteins- structure and
function. Hierarch in protein structure. Primary secondary, tertiary andquaternary structure.
Proteins as enzymes, transporters, receptors and structural elements.
MODULE 8: METABOLISM
Purpose: The fundamental principles of energy transactions are the same in physical
andbiological world.Thermodynamics as applied to biological systems. Exothermic and
endothermic versusendergonic and exergoinc reactions. Concept of Keq and its relation to
standard free energy.Spontaneity. ATP as an energy currency. This should include the
breakdown of glucose to CO2 +H2O (Glycolysis and Krebs cycle) and synthesis of glucose
from CO2 and H2O (Photosynthesis).Energy yielding and energy consuming reactions.
Concept of Energy Charge.
MODULE 9: MICROBIOLOGY
Concept of single celled organisms. Concept of species and strains. Identification
andclassification of microorganisms. Microscopy. Ecological aspects of single celled
organisms.
Sterilization and media compositions. Growth kinetics.
Course Outcomes:
At the end of this course, students are able to:
1) Classify enzymes and distinguish between different mechanisms of enzyme action.
2) Identify DNA as genetic material in the molecular basis if information transfer.
3) Analyse biological processes at the reductionist level.
4) Apply the thermodynamic principles to biological systems.
5) Identify and classify microorganisms.
Reference Books:
1. “Biology: A global approach” Campbell, N. A.; Reece, J. B.; Urry, Lisa; Cain, M,L.;
Wasserman, S. A.; Minorsky, P. V.; Jackson, R. B. Pearson Education Ltd
2. “Outlines of Biochemistry” , Conn, E.E; Stumpf, P.K; Bruening, G; Doi, R.H.John Wiley
and Sons
3. “Principles of Biochemistry (V Edition)”, By Nelson, D. L.; and Cox, M. M.W.H.Freeman
and Company
4. “Molecular Genetics (Second edition)”, Stent, G. S.; and Calender, R. W.H. Freemanand
company, Distributed by Satish Kumar Jain for CBS Publisher
5. “Microbiology” , Prescott, L.M J.P. Harley and C.A. Klein 1995. 2nd edition Wm, C.Brown
Publishers
CODE: PCC-CS-501
SUBJECT NAME: COMPUTER ARCHITECTURE
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives
1. To discuss the basic concepts of Computer Architecture and organization.
2. To give a clear view of how computer systems work.
3. To familiarize the students with concepts of parallel and pipelined implementations.
4. To introduce them to the state of art in this field
Course Contents:
Unit-I
INTRODUCTION AND GENERAL SYSTEM ARCHITECTURE:
CPU, memory, input-output subsystems, control unit. stored program control concept, Flynn‟s
classification of computers (SISD, MISD, MIMD)
Register Transfer Language (concept of Register Transfers, Performing of arithmetic or logical
operations, Fetching a word from memory, storing a word in memory), Bus and Memory
Transfers, Bus Architecture, Bus Arbitration, Register Transfer Operations: Arithmetic,
Logical and Shift micro operation, : Data Representation: Fixed Point, Floating Point, (IEEE
standard for Floating point numbers)
Unit-II
CONTROL DESIGN (Hardwired, Microprogrammed):
Hardwired Control Unit - computer instructions‟ Execution of a complete instruction
(FetchDecode-Execute cycle), type of instructions, memory reference, register reference, I/O
reference, design of Hardwired CU.
Micro Programmed Control Unit : Microinstruction, Micro-program sequencing in control
memory, Wide-Branch addressing, Microinstruction with Next-address field, Prefetching
Microinstruction).
Unit-III
PROCESSOR DESIGN:
Processor Organization: General register organization, Stack organization, Addressing modes,
Instruction format, Data transfer and manipulations, Program Control, ReducedInstruction Set
and Complex Instruction Set Computer.
Unit –IV
INPUT-OUTPUT ORGANIZATION:
I/O Interface, Modes of transfer, Interrupts and Interrupt handling, Direct Memory access,
Input-Output processor.
Unit-V
MEMORY ORGANIZATION:
Memory Hierarchy, Main Memory (RAM and ROM Chips), Auxiliary memory, Associative
memory, matching logic, Cache memory: locality of reference, mapping functions and write
policies, Virtual Memory, Memory management hardware.
UNIT-VI
ADVANCED CONCEPTS :
Pipelined processors: Basic concepts of pipelining, throughput and speedup, pipeline hazards.
Parallel Processors: Introduction, Concurrent access, memory and cache coherence.
Course Outcomes:
At the end of the course, the students will be able to
1. Explain the functional capabilities of a stored program device and its various processing
units.
2. Express the micro-operations needed to design the Arithmetic and logical unit of a
computer system.
3. Specify the different types of instructions and their formats needed in the design of
various functional units of the processor.
4. Analyze the performance measurement, data representation and memory Hierarchy of
the computer system.
Reference Books
1. Computer System Architecture, M. Mano(PHI), Seventh edition 2007
2. Stallings, William : Computer Organization & Architecture(PHI), Seventh edition 2005
3. Computer Architecture and Organization”, 3rd Edition by John P. Hayes
WCB/McGraw-Hill
CODE: MC-01
SUBJECT NAME: CONSTITUTION OF INDIA/ESSENCE OF INDIAN
TRADITIONAL KNOWLEDGE
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1) To enable the student understand the importance of constitution.
2) To understand the structure of executive, legislature and judiciary
3) To understand philosophy of fundamental rights and duties.
4) To understand the autonomous nature of constitutional bodies.
5) To understand the central and state relation, financial and administrative.
CONSTITUTION OF INDIA– BASIC FEATURES AND FUNDAMENTAL PRINCIPLES
The Constitution of India is the supreme law of India. Parliament of India can not make any
law which violates the Fundamental Rights enumerated under the Part III of the Constitution.
The Parliament of India has been empowered to amend the Constitution under Article 368,
however,it cannot use this power to change the “basic structure” of the constitution, which has
been ruled and explained by the Supreme Court of India in its historical judgments. The
Constitution of India reflects the idea of “Constitutionalism” – a modern and progressive
concept historically developed by the thinkers of “liberalism” – an ideology which has been
recognized as one of the most popular political ideology and result of historical struggles
against arbitrary use of sovereign power by state. The historic revolutions in France, England,
America and particularly European Renaissance and Reformation movement have resulted into
progressive legal reforms in the form of “constitutionalism” in many countries. The
Constitution of India was made by borrowing models and principles from many countries
including United Kingdom and America.
The Constitution of India is not only a legal document but it also reflects social, political and
economic perspectives of the Indian Society. It reflects India‟s legacy of “diversity”. It has
been said that Indian constitution reflects ideals of its freedom movement, however, few critics
have argued that it does not truly incorporate our own ancient legal heritage and cultural values.
No law can be “static” and therefore the Constitution of India has also been amended more
than one hundred times. These amendments reflect political, social and economic
developments since the year 1950.
The Indian judiciary and particularly the Supreme Court of India has played an historic role
asthe guardian of people. It has been protecting not only basic ideals of the Constitution but
also strengthened the same through progressive interpretations of the text of the Constitution.
The judicial activism of the Supreme Court of India and its historic contributions has been
recognized throughout the world and it gradually made it “as one of the strongest court in the
world”.
Course Contents
1. Meaning of the constitution law and constitutionalism.
2. Historical perspective of the Constitution of India.
3. Salient features and characteristics of the Constitution of India.
4. Scheme of the fundamental rights.
5. The scheme of the Fundamental Duties and its legal status.
6. The Directive Principles of State Policy – Its importance and implementation.
7. Federal structure and distribution of legislative and financial powers between theUnion and
the States.
8. Parliamentary Form of Government in India – The constitution powers and status ofthe
President of India
9. Amendment of the Constitutional Powers and Procedure
10. The historical perspectives of the constitutional amendments in India
11. Emergency Provisions : National Emergency, President Rule, Financial Emergency
12. Local Self Government – Constitutional Scheme in India
13. Scheme of the Fundamental Right to Equality
14. Scheme of the Fundamental Right to certain Freedom under Article 19
15. Scope of the Right to Life and Personal Liberty under Article 21
Course Outcomes:
1) Able to understand the historical background of the constitutional making and its
importance for building democratic India.
2) Able to apply the knowledge on directive principle of state policy, the knowledge in
strengthening of the constitutional institutions like CAG, Election Commission.
3) Able to analyse the history, features of Indian Constitution, the role of governors and
chief ministers of state, role of state election commissioner, the decentralization of
power between central, state and local self-government.
4) Level organizations, various commissions viz SC/ST/OBC and women.
REFERENCES:
1. The Constitutional Law Of India 9th Edition, by Pandey. J. N.
2. The Constitution of India by P.M.Bakshi
3. Constitution Law of India by Narender Kumar
4. Bare Act by P. M. Bakshi
CODE: PCC-CS-504
SUBJECT NAME: SOFT COMPUTING LAB
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
List of Experiments
Programming in Matlab for the following problems.
1. Classification of water temperature into appropriate fuzzy set (chilled, cool, normal,
warm, hot, very hot) with membership.
2. Taking the human age from 1-100 years and classifying it into appropriate fuzzy sets
(child, young, middle age, old, very old) with membership and plotting the graph.
3. Union of fuzzy sets using different s-norm formula and plotting the graph.
4. Intersection of fuzzy sets using different t-norm formula and plotting the graph.
5. Complement of fuzzy sets complement -norm formula and plotting the graph.
6. Design of a washing machine in the neural tool of Matlab.
7. Training of single perceptron as AND,OR and NOT type classifier using threshold
activation.
8. Training of single perceptron as AND,OR and NOT type regression using sigmoidal
activation and backpropagation.
9. Implementation of auto associative memory.
10. Implementation of hetero associative memory.
11. Implementation of ART network.
12. Solving knapsack using GA.
13. Solving TSP using GA.
14. Introduction to curve fitting in MATLAB using neural Tool
CODE: PCC-CS-505
SUBJECT NAME: OPERATING SYSTEM LAB
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
S.No. Title
1 Study of General UNIX commands with their meaning, syntax and usage.
Study of Directory Related UNIX commands with their meaning, syntax and
2
usage.
3 Study of File related UNIX commands with their meaning, syntax and usage.
Study of Process Related UNIX Commands with their meaning, syntax and
4
usage.
Study of User Communication UNIX commands with their meaning, syntax and
5
usage.
6 Study of Simple Filter UNIX commands with their meaning, syntax and usage.
Study of Advanced filters UNIX Commands with their meaning, syntax and
7
usage.
Study of System Administrative UNIX commands with their meaning, syntax
8
and usage.
9 Working with vi Editor
Write a shell program to calculate overtime pay of 5 employees; overtime is paid

10 at the rate of Rs. 12/Hr for every hour worked above 40 hrs per week. Assume that
no employee works for fraction of an hour.
11 Write a shell program to generate all combinations of „1‟ , „2‟ ,‟3‟ using for loop
Write a shell program that receives an argument & a string from the user. If the
12 argument is 1 display the string in bold letters, for 2 display it in underline form; if
3 display it like blinking characters, if 4 then display it in reverse video character.
Implementation of CPU scheduling algorithms First Come First Serve (FCFS),
Priority scheduling-Priority Number Based, Shortest Process Next (SPN), Shortest
13
Remaining time Next (SRN), Modified Round Robin, Highest response ratio Next
(HRRN), Multi-Level Queue, Multi-Level Feedback Queue Scheduling).
Implementation of Page Replacement Algorithms First in First out (FIFO), Least
14
Recently Used (LRU), Optimal, Clock page replacement algorithms.
Implementation of Banker’s algorithm for deadlock avoidance in multiple
15
instances of resources.
Implementation of disk scheduling algorithms (First Come First Serve (FCFS),
16 Shortest Seek Time First (SSTF), SCAN, Circular-SCAN (C-SCAN), F-Scan, N-
step Scan, LOOK, C-LOOK).
6TH SEMESTER
CODE: PCC-CS-601
SUBJECT NAME: MACHINE LEARNING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To learn the concept of patterns in data and how to extract these patterns from data
without being explicitly programmed in various domains in the context of applying
different Supervised and Un-supervised learning techniques.
2. To design and analyse various machine learning algorithms and techniques with a
modern outlook focusing on recent advances.
3. To explore the time series data and techniques available to deal with it.
4. Explore and learn probabilistic and statistical techniques such as Bayesian learning.
5. To explore Deep learning techniques and the problem where these techniques can be
applied.
Course Contents:
MODULE-1: SUPERVISED LEARNING (REGRESSION/CLASSIFICATION)
 Basic methods: Distance-based methods, Nearest-Neighbours, Decision Trees, Naive
Bayes
 Linear models: Linear Regression, Logistic Regression, Generalized LinearModels
 Support Vector Machines, Nonlinearity and Kernel Methods
 Beyond Binary Classification: Multi-class/Structured Outputs, Ranking
MODULE-2: UNSUPERVISED LEARNING
 Clustering: K-means/Kernel K-means
 Dimensionality Reduction: PCA and kernel PCA
 Matrix Factorization and Matrix Completion
MODULE-3:
Evaluating Machine Learning algorithms and Model Selection, Introduction to Statistical
Learning Theory, Ensemble Methods (Boosting, Bagging, Random Forests). Introduction to
Bayesian Learning and Inference
MODULE-4:
Scalable Machine Learning (Online and Distributed Learning), Semi-supervised Learning,
Active Learning, Reinforcement Learning.
Modelling Sequence/Time-Series Data, Introduction to Deep Learning and Feature
Representation Learning
Course Outcomes:
1. Analyse the nature of the data associated with a machine learning problem and formulate
various kind of machine learning approaches and paradigms in the mathematical terms.
2. Apply and evaluate the various machine learning approach/techniques for a given problem.
3. Compare the nature of non-time series and time series data and the techniques available to
deal with such data.
4. Evaluate and formulate a given problem in terms of various probabilistic and statistical
methods and solve them using suitable technique.
5. Get the understanding of the various problem where deep learning techniques are to be
applied.
Reference Books:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning,
Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007.
CODE: PCC-IT-601
SUBJECT NAME: DATA ACQUISITION AND ANALYSIS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
MODULE-1
Big Data: Introduction, characteristics, types, sources, examples, technologies; integrating
diverse data; introduction to Hadoop, open source technologies, Introduction to NoSQL,
aggregate data models.
MODULE -2
Data Science: Getting Value out of Big Data, Building a Big Data Strategy, Five Components
of Data Science, Five P's of Data Science. Steps in the Data Science Process.
Big Data Modeling and Management: Data Ingestion, Data Storage, Data Quality, Data
Operations, Data Scalability and Security, Real Big Data Management Applications.
MODULE -3
Data Acquisition: Real time data acquisitition, Review of transducer, Introduction about
Instrumentation system. Types of Instrumentation system. Data acquisition system and its uses
in intelligent Instrumentation system. Detail study of each block involved in making of DAS,
Signal conditioners as DA, IA, signal converters (ADC), Sample and hold. Designing
application for Pressure, Temperature measurement system using DAS. Data logger.
MODULE -4
Data Analysis: Introduction, various techniques like Classification, regression, clustering,
association analysis, and graph analysis.
MapReduce workflows, anatomy of MapReduce job run, classic Map-reduce, YARN, failures
in classic Map-reduce and YARN, job scheduling, shuffle and sort, task execution, MapReduce
types,
CODE: PEC
SUBJECT NAME: BIG DATA FUNDAMENTALS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. Understand the Big Data Platform and its Use cases
2. Provide an overview of Apache Hadoop
3. Provide HDFS Concepts and Interfacing with HDFS
4. Understand Map Reduce Jobs
5. Provide hands on Hodoop Eco System
6. Apply analytics on Structured, Unstructured Data.
Course Contents
UNIT I: INTRODUCTION TO BIG DATA AND HADOOP
Types of Digital Data, Introduction to Big Data, Big Data Analytics, History of Hadoop,
Apache Hadoop, Analysing Data with Unix tools, Analysing Data with Hadoop, Hadoop
Streaming, Hadoop Ecosystem, IBM Big Data Strategy, Introduction to InfosphereBigInsights
and Big Sheets.
UNIT II: HDFS(Hadoop Distributed File System)
The Design of HDFS, HDFS Concepts, Command Line Interface, Hadoop file system
interfaces, Data flow, Data Ingest with Flume and Sqoop and Hadoop archives, Hadoop I/O:
Compression, Serialization, Avro and File-Based Data structures.
UNIT III: Map Reduce
Anatomy of a Map Reduce Job Run, Failures, Job Scheduling, Shuffle and Sort, Task
Execution, Map Reduce Types and Formats, Map Reduce Features.
Unit IV: Hadoop Ecosystem

Pig: Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases, Grunt,
Pig Latin, User Defined Functions, Data Processing operators. Hive: Hive Shell, Hive Services,
Hive Metastore, Comparison with Traditional Databases, HiveQL, Tables, Querying Data and
User Defined Functions. Hbase: HBasics, Concepts, Clients, Example, Hbaseversus RDBMS.
Big SQL: Introduction
Course Outcomes:
The students will be able to:
1. Identify Big Datatools to handle BigDataand its Business Implications.
2. Access and Process Data on Distributed File System.
3. Manage Job Execution in Hadoop Environment.
4. Develop Big Data Solutions using Hadoop Eco System.
References Books:
1. Tom White “Hadoop: The Definitive Guide” Third Edit on, O‟reily Media, 2012.
2. SeemaAcharya, SubhasiniChellappan, "Big Data Analytics" Wiley 2015.
3. Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007.
4. Jay Liebowitz, “Big Data and Business Analytics” Auerbach Publications, CRC press
(2013)
5. Tom Plunkett, Mark Hornick, “Using R to Unlock the Value of Big Data: Big Data
Analytics with Oracle R Enterprise and Oracle R Connector for Hadoop”, McGraw-
Hill/Osborne Media (2013), Oracle press.
CODE: PEC
SUBJECT NAME: INTERNET AND WEB TECHNOLOGIES
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To build an understanding of the fundamental concepts of Information Retrieval.
2. To familiarize students with the basic taxonomy and terminology of Indices.
3. To learn about the Query Language and Metadata Search.
4. To learn about Semantic Web and various social networks.
5. To learn about the latest trends in Information Retrieval.
Course Contents:
Module 1 Introduction to Information Retrieval Information retrieval problem, an inverted
index, Processing Boolean queries ,The extended Boolean model versus ranked retrieval , an
inverted index ,Bi-word indexes, Positional indexes, Combination schemes
Module 2 Index construction Hardware basics, Blocked sort-based indexing , Single-pass in-
memory indexing ,Distributed indexing, Dynamic indexing, Other types of indexes Index
compression: Statistical properties of terms in information retrieval ,Heap‟s law: Estimating
the number of terms, Zipfs law: Modeling the distribution of terms, Dictionary compression,
Dictionary string, Blocked storage, Postings file compression.
Module 3 Scoring , term weighting and the vector space model Parametric and zone indexes
,Weighted zone scoring, Learning weights ,The optimal weight, Term frequency and
weighting, Inverse document frequency, Tf-idf weighting, The vector space model for scoring,
Variant tf-idf functions.
Module 4 Computing scores in a complete search system Efficient scoring and ranking, In
exact top K document retrieval, Index elimination ,Champion lists, Static quality scores and
ordering ,Impact ordering ,Cluster pruning ,Component so fan information retrieval system,
Tiered indexes
Module 5 Web search basics Background and history, Web characteristics, The web graph,
Spam, Advertising as the economic model, The search user experience, User query needs
Crawling, Crawler architecture, DNS resolution, The URL frontier, Link analysis, The Web as
a graph, Anchor text and the web graph ,Page Rank, Markov chains, The Page Rank
computation, Topic-specific Page Rank
Module 6 Language models for information retrieval Language models, Finite automata and
language models, Types of language models, Multinomial distributions over words , The query
likelihood model, Using query likelihood language models in IR, Estimating the query
generation probability ,Language modeling versus other approaches in IR.
Course Outcomes
1. To identify basic theories and analysis tools as they apply to information retrieval.
2. To develop understanding of problems and potentials of current IR systems.
3. To learn and appreciate different retrieval algorithms and systems.
4. To apply various indexing, matching, organizing, and evaluating methods to IR problem.
5. To become aware of current experimental and theoretical IR research.
Reference Books
1. C. D. Manning, P. Raghavan and H. Schütze, Introduction to Information Retrieval,
Cambridge University Press, 2008 (available at http://nlp.stanford.edu/IR-book).
2. Chakrabarti, S. (2002). Mining the web: Mining the Web: Discovering knowledge from
hypertext data. Morgan-kaufman.
3. B. Croft, D. Metzler, T. Strohman, Search Engines: Information Retrieval in Practice,
Addison- Wesley, 2009 (available at http://ciir.cs.umass.edu/irbook/).
4. R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley, 2011
(2nd Edition).
5. An Introduction to Information Retrieval Christopher D. Manning, PrabhakarRaghavan,
HinrichSchütze Cambridge UniversityPress
CODE: PCC-CS-603
SUBJECT NAME: BIG DATA LAB
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
1. Install and Configure Cloudera QuickStart with VirtualBox VM.
2. Perform the following File Management tasks in Hadoop:

a. Create a directory and adding files.
b. List the contents of directory.
c. Upload and Download a file in HDFS.
d. Copy and Move a file from source to destination in HDFS and from/To Local
file system to HDFS.
e. Remove a file or directory in HDFS.
3. Implement word count program in Java and Hadoop Map Reduce.
4. Analyze weather data and generate the output with maximum and minimum temperature
of each day along with time using Java and Map Reduce.
5. Write a program to implement Matrix Multiplication with Map Reduce.
6. Perform the following tasks using Apache Pig:
a. Load and Store data into Apache Pig from the file system (HDFS/ Local).
b. Run the Diagnostic Operators to verify the execution of Load Statement.
c. Run the Group and Join operators on the relations.
d. Select the required tuples and remove unwanted tuples from the relations
using FILTER operator.
e. Run Pig Latin Built-In Functions.
7. Run the Pig Latin scripts to find word count in a given file.
8. Write a Pig Latin script to find the Number of Products Sold in Each Country.
[Download Sales Data Set (.CSV) from Internet for Input]
9. Perform the following tasks using Hive:
a. Create, Alter and Drop Databases, Tables, Views, Functions and Indexes.
b. Process and Analyze structured data in a Metastore using Hive Query

Language (HiveQL).
10. Improve Query Performance by using Dynamic and Static Partitioningin Apache Hive.
11. Perform the following tasks using HBase:
a. Run general commands like status, version, table_help, and whoami.

b. Create, Alter and Drop Tables.
c. Create Update, Read and Delete data in HBase table.
d. Grant and Revoke permissions to users in HBase.
12. Recording and Storing Logs about customer search history and perform analytics for
better business using HBase.
CODE: PCC-IT-602
SUBJECT NAME: MACHINE LEARNING LAB
CREDITS: 2
SESSIONAL: 15 L T P
TOTAL: 50
S.NO PRACTICAL
1. Write a program for using different data types and file handling techniques in python.
2. Write a program to implement Linear Regression algorithm using Python.
3. Write a program to implement Logistic Regression algorithm using Python.
4. Write a program to implement Support Vector Machine using Python.
5. Write a program to implement K-Nearest Neighbour using Python.
6. Write a program to implement the naïve Bayesian classifier for a sample training
data set stored in a file. Compute the accuracy of the classifier, considering few test
data sets.
7. Write a program to demonstrate the working of the decision tree based ID3
algorithm. Use an appropriate data set for building the decision tree and apply this
knowledge to classify a new sample.
8. Build an Artificial Neural Network by implementing the Backpropagation algorithm

and test the same using appropriate data sets.
9. Write a program to implement K-means clustering using Python.
10. Write a program for making different types of plots (e.g. Scatter plot, Box Plot, Bar
Chart etc.) for a given dataset.
11. Write a program to implement different morphological operations on an image.
12. Write a program to implement CNN for handwritten digit classification using
appropriate dataset (e.g. MNIST).
7TH SEMESTER
CODE: PEC
SUBJECT NAME: CLOUD COMPUTING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
COURSE OBJECTIVES
1. Trust-based security model to real-world security problems.
2. An overview of the concepts, processes, and best practices needed to successfully secure
information within Cloud infrastructures.
3. Students will learn the basic Cloud types and delivery models and develop an
understanding of the risk and compliance responsibilities and Challenges for each Cloud
type and service delivery model.
Course contents:
MODULE 1: INTRODUCTION TO CLOUD COMPUTING:
Online Social Networks and Applications, Cloud introduction and overview, Different
clouds, Risks, Novel applications of cloud computing.
MODULE 2: CLOUD COMPUTING ARCHITECTURE:
Requirements, Introduction Cloud computing architecture, On Demand Computing
Virtualization at the infrastructure level, Security in Cloud computing environments, CPU
Virtualization, A discussion on Hypervisors Storage Virtualization Cloud Computing Defined,
The SPI Framework for Cloud Computing, The Traditional Software Model, The Cloud
Services Delivery Model Cloud Deployment Models Key Drivers to Adopting the Cloud, The
Impact of Cloud Computing on Users, Governance in the Cloud, Barriers to Cloud Computing
Adoption in the Enterprise .
MODULE 3: SECURITY ISSUES IN CLOUD COMPUTING
Infrastructure Security, Infrastructure Security: The Network Level, The Host Level, The
Application Level, Data Security and Storage, Aspects of Data Security, Data Security
Mitigation Provider Data and Its Security Identity and Access Management Trust Boundaries
and IAM, IAM Challenges, Relevant IAM Standards and Protocols for Cloud Services, IAM
Practices in the Cloud, Cloud Authorization Management.
MODULE 4: SECURITY MANAGEMENT IN THE CLOUD
Security Management Standards, Security Management in the Cloud, Availability
Management: SaaS, PaaS, IaaS Privacy Issues Privacy Issues, Data Life Cycle, Key Privacy
Concerns in the Cloud, Protecting Privacy, Changes to Privacy Risk Management and
Compliance in Relation to Cloud Computing, Legal and Regulatory Implications, U.S. Laws
and Regulations, International Laws and Regulations.
MODULE 5: AUDIT AND COMPLIANCE
Internal Policy Compliance, Governance, Risk and Compliance (GRC), Regulatory/External
Compliance, Cloud Security Alliance, Auditing the Cloud for Compliance, Security-as-a-
Cloud.
MODULE 6: DATA INTENSIVE COMPUTING
Map-Reduce Programming Characterizing Data-Intensive Computations, Technologies for
DataIntensive Computing, Storage Systems, Programming Platforms, MapReduce
Programming, MapReduce Programming Model, Example Application.
COURSE OUTCOMES:
a) Identify security aspects of each cloud model.
b) Develop a risk-management strategy for moving to the Cloud.
c) Implement a public cloud instance using a public cloud service provider.
TEXT/REFERENCES
1. “Cloud Computing Explained: Implementation Handbook for Enterprises”, John Rhoton,
Publication Date: November 2, 2009.
2. “Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance
(Theory in Practice)”, Tim Mather, ISBN-10: 0596802765,O'Reilly Media, September
2009.
CODE: PEC
SUBJECT NAME: NATURAL LANGUAGE PROCESSING/ SOCIAL
MEDIA ANALYTICS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To make the students familiar with difference levels/stages of natural language
processing and to introduce concept of Formal languages and grammars: Chomsky
hierarchy and problems associated (like Left-Associative grammars, ambiguous
grammars) with them.
2. To introduce the students with Morphology and Part of Speech Tagging by taking
examples from Hindi, English.
3. To introduce the top down and the bottom up parsing approaches and their respective types
of parsers.
4. To make the students familiar with grammar types like ATN & RTN.
5. To make the students familiar with the basic techniques of parsing like CKY, Earley&Tomita's
algorithms and role Hidden Markov Model in NLP
6. To make the students familiar with Semantics-knowledge and its utilization.
MODULE-1: AUTOMATIC SPEECH RECOGNITION

Introduction to Automatic Speech Recognition (ASR), Components in ASR, Challenges in ASR,
Issues in ASR based Application development.
MODULE-2: COMPONENTS OF NATURAL LANGUAGE PROCESSING
Lexicography, syntax, semantics, pragmatics: word level representation of natural languages
prosody& natural languages.
MODULE-3 FORMAL LANGUAGES AND GRAMMARS
Chomsky hierarchy, Left-Associative grammars, ambiguous grammars, resolution of
ambiguities. Introduction of top down and bottom up parsers.
MODULE-4: COMPUTATION LINGUISTICS:
Morphology of natural languages like Hindi, English etc.,Part of Speech Tagging (POS),
recognition and parsing of natural language structures: ATN & RTN, General techniques of parsing:
CKY, Earley& Tomita's algorithms. Introduction to Hidden Markov Model (HMM)
MODULE-5: SEMANTICS-KNOWLEDGE REPRESENTATION
Semantic networks logic and inference pragmatics, graph models and optimization, Prolog for natural
language semantic (e.g. DCG).
MODULE-6: APPLICATION OF NLP: INTELLIGENT WORK PROCESSORS
Machine translation, user interfaces, Man-Machine interfaces, natural language querying,
tutoring and authoring systems, speech recognition, commercial use of NLP.
Course Outcomes:
1. Difference levels/stages of natural language processing and the concept of Formal languages
and grammars: Chomsky hierarchy and problems associated (like Left Associative grammars,
ambiguous grammars) with them.
2. The top down and the bottom up parsing approaches and their respective types of parsers like
CKY, Earley& Tomita's.
3. The Hidden Markov Model and its application in NLP.
4. The student will be able to write small ATN & RTN grammars for simple English sentences.
5. The student will be able to do Morphology of words from natural languages like Hindi, English
and Semantics-knowledge and its important to understand the documents.
References Books
1. "Natural Language Understanding" James Allen, -1995 Benjamin/kummings Pub. Comp. Ltd
2. "Language as a cognitive process", Terry Winograd 1983, AW
3. "Natural Language processing in prolog", G. Gazder, 1989, Addison Wesley.
4. " Introduction of Formal Language Theory", Moll, Arbib&Kfoury, 1988, Springer Verlog.
CODE: PEC
SUBJECT NAME: DEEP LEARNING AND IMAGE PROCESSING
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. To build an understanding of the fundamental concepts of Deep Learning

2. To familiarize students with the neural networks and CNN
3. To understand unsupervised Deep Learning
4. To introduce the new trends and dynamic systems in Deep Learning
Unit1: Introduction to Deep Learning, Bayesian Learning, Decision Surfaces
Unit2: Linear Classifiers, Linear Machines with Hinge Loss, Optimization Techniques,
Gradient Descent, Batch Optimization
Unit 3: Introduction to Neural Network, Multilayer Perceptron, Back Propagation Learning
Unit 4: Deep Unsupervised Learning- Autoencoders (standard, denoising, contractive, etc

etc), Variational Autoencoders, Adversarial Generative Networks, Maximum
Entropy Distributions
Unit5: Convolutional Neural Networks - Invariance, stability, Variability models

(deformation model, stochastic model), Scattering networks, Group Formalism
Unit 6: Recent Trends in Deep Learning Architectures, Residual Network, Skip Connection
Network, Fully Connected CNN etc.
Unit 7: Localization, regression, Embeddings (DrLim), inverse problems, Extensions to non-

euclidean domains, Dynamical systems: RNNs.
Course Outcomes:
a. The students will be able to understand deep learning concepts.

b. The students will be able to understand Linear Classifiers, Linear Machines with Hinge
Loss, Optimization Techniques, Gradient Descent, Batch Optimization
c. The students will be able to understand Neural Network, CNN, Unsupervised Learning
with Deep Network
d. The students will be able to understand inverse problem and dynamic systems
CODE: HSMC-03
SUBJECT NAME: BUSINESS INTELLIGENCE AND PREDICTIVE
ANALYSIS
CREDITS: 3
SESSIONAL: 25 L T P
TOTAL: 100
Course Objectives:
1. Be exposed with the basic rudiments of business intelligence system
2. Understand the modeling aspects behind Business Intelligence
3. Understand of the business intelligence life cycle and the techniques used in it
4. Be exposed with different data analysis tools and techniques
Course Contents:
UNIT I : BUSINESS INTELLIGENCE
Effective and timely decisions – Data, information and knowledge – Role of mathematical
models – Business intelligence architectures: Cycle of a business intelligence analysis –
Enabling factors in business intelligence projects – Development of a business intelligence
system – Ethics and business intelligence.
UNIT II: KNOWLEDGE DELIVERY

The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc
Querying, Parameterized Reports and Self-Service Reporting, dimensional analysis,
Alerts/Notifications, Visualization: Charts, Graphs, Widgets, Scorecards and Dashboards,
Geographic Visualization, Integrated Analytics, Considerations: Optimizing the Presentation
for the Right Message.
UNIT III: EFFICIENCY

Efficiency measures – The CCR model: Definition of target objectives- Peer groups –
Identification of good operating practices; cross efficiency analysis – virtual inputs and outputs
– Other models. Pattern matching – cluster analysis, outlier analysis
UNIT IV: PREDICTIVE ANALYSIS BASICS

Data Exploration and Data Refinement: Data Summaries, Data Visualization, Treatment of
Missing Observations, Detection of Outliers – the Box Plot, Correlation Analysis, Variable
Importance and Dimension Reduction basics: Binning-Reducing the Number of Categories in
Categorical Variables , Principal Component Analysis of Continuous Variables, Dimension
Reduction using Best Subset Regression, Dimension Reduction using Bivariate Association
Probabilities. Evaluation Methods for Prediction and Classification Problems: Prediction
Measures- MAE, MSE, RMSE, MAPE, MSPE, and RMSPE, Application to Validation and
Test Data Sets, Avoiding Overtraining.
Prediction methods: Linear regression, Logistic regression, K-NN, Neural Nets: architecture,
input layer, hidden layer, output layer, back-propagation method, comparison of various
methods. Confusion matrix
Course Outcomes:
1. Explain the fundamentals of business intelligence.

2. Link data mining with business intelligence.
3. Apply various modeling techniques.
4. Explain the data analysis and knowledge delivery stages.
Reference Books:
1. Efraim Turban, Ramesh Sharda, Dursun Delen, “Decision Support and Business
Intelligence Systems”, 9th Edition, Pearson 2013.
2. The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling, Ralph
Kimball, Margy Ross

Syllabus Data Science 2020

Uploaded by

Copyright:

Available Formats

Syllabus Data Science 2020

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus Data Science 2020

Uploaded by

Copyright:

Available Formats

SCHEME

BACHELOR OF TECHNOLOGY PROGRAMME

DEPARTMENT OF COMPUTER ENGINEERING

FACULTY OF INFORMATICS & COMPUTING

J. C. BOSE UNIVERSITY OF SCIENCE AND TECHNOLOGY, YMCA

J. C. Bose University of Science and Technology, YMCA, Faridabad aspires to be a nationally

 To contribute to the development of science and technology by synthesizing teaching,

The Bachelor of Technology (B.Tech) program in Computer Engineering with specialization

(Specialization in Data Science)

PROGRAM EDUCATION OBJECTIVES

PROGRAM SPECIFIC OUTCOMES

S.No. Category Breakup

SEMESTER WISE SUMMARY OF THE PROGRAM

S.No. Semester No. of Contact Hours Marks Credits

COURSE CODE AND DEFINITIONS

3 HSMC- 01 Effective Technical 3 0 0 3 3

BASIC SCIENCE COURSES (BSC)

PROFESSIONAL CORE COURSES (PCC)

PCC-CS-406 Operating system

OPEN ELECTIVE COURSES (OEC)

PROJECT AND INDUSTRIAL TRAINING

5 HSMC HSMC- Effective 3 0 0 3 25 75 100

8 BSC BSC- Statistics using 0 0 4 2 15 35 50

9 PCC PCC- Database systems 0 0 4 2 15 35 50

10 PCC PCC- Data Structure & 0 0 4 2 15 35 50

Total 15 0 20 25 210 590 800

2 BSC BSC-DS- 3 0 0 3 25 75 100

6 MC MC-03 Environmental 2 0 0 0 25 75 100

9 PCC PCC-DS- Data Mining Lab 0 0 4 2 15 35 50

2 PCC PCC-CS- Design and 3 0 0 3 25 75 100

4 PCC PCC-CS- Operating 3 0 0 3 25 75 100

6 PCC PCC-DS- Computer 3 0 0 3 25 75 100

8 Project PROJ-DS- Project-III 0 0 4 2 25 75 100

9 PCC PCC-DS- Soft computing for 0 0 4 2 15 35 50

2 PCC PCC-DS- Natural language 3 0 0 3 25 75 100

3 PCC PCC-DS- Deep Learning and 3 0 0 3 25 75 100

4 OEC OEC-CS- Open Elective-III 3 0 0 3 25 75 100

7 Project PROJ-CS- Project-V 0 0 4 2 25 75 100

S. Category Course Course Title Duration Credits Marks Marks Total

Note: Additional 3 credits per year to be earned through MOOCs

Procedure for Annual Examination and continuous Assessment

(B) Continuous Assessment Marks

ogram ration edits to be nimum CGPA

Undergraduate Degree in Engineering & Technology

Branch/Course: COMPUTER ENGINEERING

(Specialization in Data Science)

Second year (Third semester onwards)

PROFESSIONAL CORE COURSES

1. Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 3rdedition, Addision-

 Create Database efficiently in SQL.

MODULE-1: DATA COMMUNICATION COMPONENTS

1. Concept of random variables and its probability distributions.

Pre-requisites: Database Management System

MODULE-1: The Multidisciplinary Nature of Environmental Studies

Course Outcomes (COs):

1) Understand / evaluate / develop technologies on the basis of ecological principles and

Unit-III KNOWLEDGE REPRESENTATION TECHNIQUES AND REASONING:

Unit-IV PLANNING & LEARNING: Planning, Planning in Situational calculus,

1. David W. Rolston: Principles of Artificial Intelligence and Expert System