SCHOOL OF COMPUTER SCIENCE AND

ENGINEERING (SCOPE)

B. Tech Computer Science and

Engineering with Specialization in
Artificial Intelligence and Machine
Learning

Curriculum and Syllabus

(2020-2021 admitted students)
 VISION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY

Transforming life through excellence in education and research.

VIT will impart futuristic education in multidisciplinary areas and instil high patterns
of discipline through our dedicated staff, who shall set global standards, making our
students cognitively superior and ethically strong, who in turn shall improve the
quality of life of the human race.

MISSION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY

World class Education: Excellence in education, grounded in ethics and critical

thinking, for improvement of life.
Cutting edge Research: An innovation ecosystem to extend knowledge and solve
critical problems.
Impactful People: Happy, accountable, caring and effective workforce and
students.
Rewarding Co-creations: Active collaboration with national & international
industries & universities for productivity and economic development.
Service to Society: Service to the region and world through knowledge and
compassion.

VISION STATEMENT OF THE SCHOOL OF COMPUTER SCIENCE &

ENGINEERING

To be a world-renowned centre of education, research and service in computing and

allied domains.

MISSION STATEMENT OF THE SCHOOL OF COMPUTER SCIENCE &

ENGINEERING

 To offer computing education programs with the goal that the students become
technically competent and develop lifelong learning skills.
 To undertake path-breaking research that creates new computing technologies and
solutions for industry and society at large.
 To foster vibrant outreach programs for industry, research organizations, academia and
society.
B. Tech Computer Science and Engineering with Specialization in
Artificial Intelligence and Machine Learning

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

1. Graduates will be engineering practitioners and leaders, who would help solve
industry‘s technological problems.

2. Graduates will be engineering professionals, innovators or entrepreneurs engaged

in technology development, technology deployment, or engineering system
implementation in industry.

3. Graduates will function in their profession with social awareness and

responsibility.

4. Graduates will interact with their peers in other disciplines in industry and
society and contribute to the economic growth of the country.

5. Graduates will be successful in pursuing higher studies in engineering or

management.

6. Graduates will pursue career paths in teaching or research.

B. Tech Computer Science and Engineering with Specialization in
Artificial Intelligence and Machine Learning
PROGRAMME OUTCOMES (POs)
PO_01: Having an ability to apply mathematics and science in engineering
applications.

PO_02: Having a clear understanding of the subject related concepts and of

contemporary issues.

PO_03: Having an ability to design a component or a product applying all the relevant
standards and with realistic constraints.

PO_04: Having an ability to design and conduct experiments, as well as to analyse

and interpret data.

PO_05: Having an ability to use techniques, skills and modern engineering tools
necessary for engineering practice

PO_06: Having problem solving ability-solving social issues and engineering

problems

PO_07: Having adaptive thinking and adaptability.

PO_08: Having a clear understanding of professional and ethical responsibility

PO_09: Having cross cultural competency exhibited by working in teams

PO_10: Having a good working knowledge of communicating in English

PO_11: Having a good cognitive load management [discriminate and filter the
available data] skills

PO_12: Having interest in lifelong learning

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO1: Design and develop intelligent automated systems applying mathematical, analytical,
programming and operational skills to solve real world problems.

PSO2: Apply machine learning techniques, software tools to conduct experiments, interpret data
and solve complex problems.

PSO3: Implement engineering solutions for the benefit of society by the use of AI and ML.
 B. Tech Computer Science and Engineering with Specialization in
Artificial Intelligence and Machine Learning

CREDIT STRUCTURE
Category-wise Credit distribution

Category Credits

University Core (UC) 53

Programme Core
(PC- CSE-49 , AI & ML - 60
11)
University Elective (UE) 12
Programme Elective
(PE - CSE – 3, AI & ML - 35
32)
Total 160
 B. Tech Computer Science and Engineering with Specialization in
Artificial Intelligence and Machine Learning

DETAILED CURRICULUM
University Core

Sl. Course
Course Title L T P J C Pre- Requisite
No Code

Technical English-
1 ENG1901 0 0 4 0 2 Foundation English II
I

Technical English-
2 ENG1902 0 0 4 0 2 71% to 90% in EPT
II

Advanced Greater than 90% score

3 ENG1903 0 0 2 4 2
Technical English in EPT
Engineering
4 CHY1701 3 0 2 0 4
Chemistry
Engineering
5 PHY1701 3 0 2 0 4 -
Physics
Calculus for 10+2 Mathematics or
6 MAT1011 3 0 2 0 4
Engineers MAT1001
Statistics for
7 MAT2001 3 0 2 0 4 MAT1011
Engineers

8 FLC4097 Foreign Language 2 0 0 0 2 -

9 HUM1021 Ethics and Values 2 0 0 0 2 -

Problem Solving
10 CSE1001 0 0 6 0 3 -
and Programming

Problem Solving
and Object
11 CSE1002 0 0 6 0 3 -
Oriented
Programming
Lean Startup
12 MGT1022 1 0 0 4 2 -
Management

Technical Answers
PHY1901 and 115
13 CSE1901 for Real Word 1 0 0 4 2
credits earned
Problems (TARP)

Industrial Completion of minimum

14 CSE1902 1
Internship 2 semester
1 As per academic
15 CSE1904 Capstone Project
2 regulations
 Comprehensive
16 CSE1903 0 0 0 0 1 -
Examination

17 Soft Skills * 6 -

Environmental
18 CHY1002 3 0 0 0 0 -
Sciences

Introduction to
19 PHY1901 1 0 0 0 1 -
Innovative Projects

Co /
20 EXC Extracurricular 0 0 0 0 0 -
Activity

B. Tech Computer Science and Engineering with Specialization in

Artificial Intelligence and Machine Learning

Programme Core

Sl.No Course Course Title L T P J C Pre- Categaory

Code Requisite
1. MAT1014 Discrete 3 1 0 0 4 S
Mathematics
and Graph
Theory

2. MAT3004 Applied Linear 3 1 0 0 4 MAT2002 S

Algebra

3. EEE1001 Basic Electrical 2 0 2 0 3 - E

and Electronics
Engineering

4. CSE1003 Digital Logic 3 0 2 0 4 - E

and Design
5. CSE2001 Computer 3 0 0 0 3 CSE1003 E
Architecture
and
Organization

6. CSE2013 Theory of 3 0 0 0 3 - E
computation
7. CSE2011 Data Structures 3 0 2 0 4 - E
and algorithms

8. CSE2012 Design and 3 0 2 0 4 CSE2011 E

Analysis of
Algorithms
9. CSE1004 Network and 3 0 2 0 4 - E
Communication
 10. CSE2004 Database 3 0 2 0 4 - E
Management
System
11. CSE2005 Operating 3 0 2 0 4 - E
Systems
12. CSE3002 Internet and 2 0 2 4 4 CSE2004 E
Web
Programming
13. CSE1007 Java 3 0 2 0 4 E
Programming
14. CSE1014 Foundations of 2 0 2 4 4 - E
AI
15. CSE1015 Machine 2 0 2 4 4 - E
Learning
Essentials
16. CSE1016 Deep Learning: 2 0 2 0 3 - E
Principles and
Practices

B. Tech Computer Science and Engineering with Specialization in

Artificial Intelligence and Machine Learning
Programme Elective

Course
Domain Course Title L T P J C Pre-requisite
Code
Machine Intelligence
CSE3042
for Medical Image 2 0 0 4 3 -
(HC1) Analysis
HEALTHCARE

Computer Vision in
CSE4038 Healthcare 2 0 2 0 3 CSE3042
Application
CSE4039 Intelligent Embedded
2 0 0 4 3 CSE3042
Systems
CSE4040 Bio-Informatics 2 0 0 4 3 CSE3042
Soft Computing in
CSE4048 2 0 0 4 3 CSE3042
Medical Diagnostics
CSE3043 Video Analytics 2 0 0 4 3 -
CSE4041 Perception and
2 0 0 4 3 CSE3043
SURVEILLANCE

Algorithm
CSE4042 Evolutionary
SYSTEMS

Computation for 2 0 0 4 3 CSE3043

Video Processing
CSE4049 Speech and Language
Processing using 3 0 2 0 4 CSE3043
deep learning
Audio/Video
CSE4043 3 0 0 4 4 CSE3043
Forensics
 CSE3045 IoT for Smart Cities 2 0 0 4 3 -
Event Processing and
CSE4064 2 0 0 4 3 CSE3045
Correlation Systems
CSE4051 Predictive Analysis
3 0 0 4 4 CSE3045
IOT and IOT

Smart Product
CSE4052 2 0 0 4 3 CSE3045
Development

Modeling &
CSE4065 Simulation of Digital 2 0 0 0 2 CSE3045
Systems
CSE3046 AI for Cyber Security 3 0 0 4 4 -
SECURITY

Malware Analysis in
CSE4053 2 0 2 4 4 CSE3046
CYBER

Data Science
Artificial Intelligence
CSE4054 3 0 0 0 3 CSE3046
in Block chain
Cyber Threat
CSE4055 1 0 4 0 3 CSE3046
Intelligence
CSE4444 Game Programming 2 0 2 4 4 -
GAMING

CSE4044 AR/VR 2 0 2 4 4 -
CSE4045 Human Machine
2 0 2 0 3 -
Interaction
CSE4046 3D Graphics and
3 0 0 4 4 -
Animation
Intelligent Multi
CSE4056 Agent and Expert 2 0 0 4 3 -
systems
Network Science and
CSE4057 3 0 0 4 4 -
Modeling
CSE4058 Business Intelligence 2 0 0 4 3 -
GENERIC AI

CSE4059 Cognitive Systems 2 0 0 4 3 -

Intelligent Robots
CSE4060 and Drone 2 0 0 4 3 -
Technology
Knowledge
CSE4062 2 0 0 4 3 -
Representation
Reinforcement and
CSE4063 1 0 0 4 2 -
Ensemble Learning
Probability and
CSE4XXX
Statistics for 3 0 2 0 4 -
Artificial Intelligence
Software
CSE3001 Engineering 2 0 2 4 4 -
Principles
Microprocessor and CSE1003,
CSE2006 2 0 2 4 4
Interfacing CSE2001-

CSE3020 Data Visualization 2 0 2 4 4 CSE1015

CSE Social and
CSE3021 Information 3 0 0 4 4 -
Networks
Parallel and
CSE4001 Distributed 2 0 2 4 4 -
Computing
Information Security 2 0 2 4 4
CSE3501 CSE1004
Analysis and Audit
 Information security 2 0 2 4 4
CSE3502 CSE1004
Management
Foundations of 2 0 2 4 4
CSE3505
Data Analytics
Essentials of Data 2 0 2 4 4
CSE3506
Analytics

University Elective Baskets

Management courses

Sl.No Code Title L T P J C

1 MGT1001 Basic Accounting 3 0 0 0 3
2 MGT1002 Principles of Management 2 0 0 4 3
3 MGT1003 Economics for Engineers 2 0 0 4 3
4 MGT1004 Resource Management 2 0 0 4 3
5 MGT1005 Design, Systems and Society 2 0 0 4 3
6 MGT1006 Environmental and Sustainability 2 0 0 4 3
Assessment
7 MGT1007 Gender, Culture and Technology 2 0 0 4 3
8 MGT1008 Impact of Information Systems on 2 0 0 4 3
Society
9 MGT1009 Technological Change and 2 0 0 4 3
Entrepreneurship
10 MGT1010 Total Quality Management 2 2 0 0 3
11 MGT1014 Supply Chain Management 3 0 0 0 3
12 MGT1015 Business Mathematics 3 0 0 0 3
13 MGT1016 Intellectual Property Rights 3 0 0 0 3
14 MGT1017 Business Regulatory Framework 3 0 0 0 3
For Start-ups
15 MGT1018 Consumer Behaviour 3 0 0 0 3
16 MGT1019 Services Marketing 3 0 0 0 3
17 MGT1020 Marketing Analytics 2 0 2 0 3
18 MGT1021 Digital and Social Media 3 0 0 0 3
Marketing
19 MGT1022 Lean Start-up Management 1 0 0 4 2
20 MGT1023 Fundamentals of Human Resource 3 0 0 4 4
Management
21 MGT1024 Organizational Behaviour 3 0 0 4 4
22 MGT1025 Foundations of Management And 3 0 0 4 4
Organizational Behaviour
23 MGT1026 Information Assurance and 2 0 0 4 3
Auditing
24 MGT1028 Accounting and Financial 2 2 0 4 4
Management
25 MGT1029 Financial Management 2 1 0 4 4
26 MGT1030 Entrepreneurship Development 3 0 0 4 4
27 MGT1031 International Business 3 0 0 4 4
28 MGT1032 Managing Asian Business 3 0 0 4 4
29 MGT1033 Research Methods in Management 2 1 0 4 4
30 MGT1034 Project Management 3 0 0 4 4
31 MGT1035 Operations Management 3 0 0 0 3
32 MGT1036 Principles of Marketing 3 0 0 4 4
33 MGT1037 Financial Accounting and Analysis 2 1 0 4 4
34 MGT1038 Financial Econometrics 2 0 0 4 3
35 MGT1039 Financial Markets and Institutions 2 0 0 4 3
36 MGT1040 Personal Financial Planning 2 0 0 4 3
37 MGT1041 Financial Derivatives 2 1 0 4 4
38 MGT1042 Investment Analysis and Portfolio 2 0 0 4 3
Management
39 MGT1043 Applications in Neuro Marketing 3 0 0 4 4
40 MGT1044 Global Brand Marketing Strategies 3 0 0 4 4
41 MGT1045 Industrial Marketing 3 0 0 4 4
42 MGT1046 Sales and Distribution Management 3 0 0 4 4
43 MGT1047 Social Marketing 3 0 0 4 4
44 MGT1048 Political Economy of Globalization 3 0 0 4 4
45 MGT1049 Sustainable Business Models 3 0 0 4 4
46 MGT1050 Software Engineering Management 2 0 0 4 3
47 MGT1051 Business Analytics for Engineers 2 2 0 0 3
48 MGT1052 Bottom of the Pyramid Operations 3 0 0 0 3
49 MGT1053 Entrepreneurship Development, 1 0 2 0 2
Business Communication and IPR
50 MGT1054 Product Planning and Strategy 2 2 0 0 3
51 MGT1055 Design Management 2 2 0 0 3
52 MGT1056 Accounting and Financial 3 0 0 4 4
Management
53 MGT6001 Organizational Behaviour 2 0 0 4 3
Humanities courses

Sl.No Code Title L T P J C

1 HUM1001 Fundamentals of Cyber Laws 3 0 0 0 3
2 HUM1002 Business Laws 3 0 0 0 3
3 HUM1003 Basic Taxation for Engineers 3 0 0 0 3
4 HUM1004 Corporate Law for Engineers 3 0 0 0 3
5 HUM1005 Cost Accounting for Engineers 3 0 0 0 3
6 HUM1006 Business Accounting for Engineers 3 0 0 0 3
7 HUM1007 Contemporary Legal Framework for Business 3 0 0 0 3
8 HUM1009 International Business 3 0 0 0 3
9 HUM1010 Foreign Trade Environment 3 0 0 0 3
10 HUM1011 Export Business 3 0 0 0 3
11 HUM1012 Introduction to Sociology 3 0 0 0 3
12 HUM1013 Population Studies 3 0 0 0 3
13 HUM1021 Ethics and Values 2 0 0 0 2
14 HUM1022 Psychology in Everyday Life 2 0 0 4 2
15 HUM1023 Indian Heritage and Culture 2 0 0 4 2
16 HUM1024 India and Contemporary World 2 0 0 4 2
17 HUM1025 Indian Classical Music 1 0 2 4 1
18 HUM1033 Micro Economics 3 0 0 0 3
19 HUM1034 Macro Economics 3 0 0 0 3
20 HUM1035 Introductory Econometrics 2 0 2 0 2
21 HUM1036 Engineering Economics and Decision Analysis 2 0 0 4 2
22 HUM1037 Applied Game Theory 2 0 0 4 2
23 HUM1038 International Economics 3 0 0 0 3
24 HUM1039 Community Development in India 2 0 0 4 2
25 HUM1040 Indian Social Problems 3 0 0 0 3
26 HUM1041 Indian Society Structure and Change 3 0 0 0 3
27 HUM1042 Industrial Relations and Labour Welfare in 3 0 0 0 3
India
28 HUM1043 Mass Media and Society 2 0 0 4 2
29 HUM1044 Network Society 3 0 0 0 3
30 HUM1045 Introduction to Psychology 2 0 2 0 2
31 HUM1706 Business Accounting for Engineers 3 0 0 0 3
CHY1002 Environmental Sciences L T P J C
3 0 0 0 3
Pre-requisite Chemistry of 12th standard or equivalent Syllabus version
V:1.1
Course Objectives:
1. To make students understand and appreciate the unity of life in all its forms, the
implications of life style on the environment.
2. To understand the various causes for environmental degradation.
3. To understand individuals contribution in the environmental pollution.
4. To understand the impact of pollution at the global level and also in the local
environment.

Expected Course Outcome:

Students will be able to

1. Students will recognize the environmental issues in a problem oriented interdisciplinary

perspectives
2. Students will understand the key environmental issues, the science behind those problems
and potential solutions.
3. Students will demonstrate the significance of biodiversity and its preservation
4. Students will identify various environmental hazards
5. Students will design various methods for the conservation of resources
6. Students will formulate action plans for sustainable alternatives that incorporate science,
humanity, and social aspects
7. Students will have foundational knowledge enabling them to make sound life decisions as
well as enter a career in an environmental profession or higher education.

Module:1 Environment and Ecosystem 7 hours

Key environmental problems, their basic causes and sustainable solutions. IPAT equation.
Ecosystem, earth – life support system and ecosystem components; Food chain, food web, Energy
flow in ecosystem; Ecological succession- stages involved, Primary and secondary succession,
Hydrarch, mesarch, xerarch; Nutrient, water, carbon, nitrogen, cycles; Effect of human activities
on these cycles.
Module:2 Biodiversity 6 hours

Importance, types, mega-biodiversity; Species interaction - Extinct, endemic, endangered and rare
species; Hot-spots; GM crops- Advantages and disadvantages; Terrestrial biodiversity and Aquatic
biodiversity – Significance, Threats due to natural and anthropogenic activities and Conservation
methods.

Module:3 Sustaining Natural Resources and 7 hours

Environmental Quality

Environmental hazards – causes and solutions. Biological hazards – AIDS, Malaria, Chemical
hazards- BPA, PCB, Phthalates, Mercury, Nuclear hazards- Risk and evaluation of hazards. Water
footprint; virtual water, blue revolution. Water quality management and its conservation. Solid and
hazardous waste – types and waste management methods.

Module:4 Energy Resources 6 hours

Renewable - Non renewable energy resources- Advantages and disadvantages - oil, Natural gas,
Coal, Nuclear energy. Energy efficiency and renewable energy. Solar energy, Hydroelectric
power, Ocean thermal energy, Wind and geothermal energy. Energy from biomass, solar-
Hydrogen revolution.

Module:5 Environmental Impact Assessment 6 hours

Introduction to environmental impact analysis. EIA guidelines, Notification of Government of
India (Environmental Protection Act – Air, water, forest and wild life). Impact assessment
methodologies. Public awareness. Environmental priorities in India.

Module:6 Human Population Change and Environment 6 hours

Urban environmental problems; Consumerism and waste products; Promotion of economic

development – Impact of population age structure – Women and child welfare, Women
empowerment. Sustaining human societies: Economics, environment, policies and education.

Module:7 Global Climatic Change and Mitigation 5 hours

Climate disruption, Green house effect, Ozone layer depletion and Acid rain. Kyoto protocol,
Carbon credits, Carbon sequestration methods and Montreal Protocol. Role of Information
technology in environment-Case Studies.

Module:8 Contemporary issues 2 hours

Lecture by Industry Experts
Total Lecture hours: 45 hours

Text Books
1. G. Tyler Miller and Scott E. Spoolman (2016), Environmental Science, 15th Edition,
Cengage learning.
George Tyler Miller, Jr. and Scott Spoolman (2012), Living in the Environment –
2. Principles, Connections and Solutions, 17th Edition, Brooks/Cole, USA.
Reference Books
1. David M.Hassenzahl, Mary Catherine Hager, Linda R.Berg (2011), Visualizing
Environmental Science, 4thEdition, John Wiley & Sons, USA.
Mode of evaluation: Internal Assessment (CAT, Quizzes, Digital Assignments) & FAT
Recommended by Board of Studies 12.08.2017
Approved by Academic Council No. 46 Date 24.08.2017
 CHY1701 Engineering Chemistry (UC) L T P J C
3 0 2 0 4
Pre-requisite Chemistry of 12th standard or equivalent Syllabus version
1.1
Course Objectives:
1. To impart technological aspects of applied chemistry
2. To lay foundation for practical application of chemistry in engineering aspects
Expected Course Outcomes (CO): Students will be able to
1. Recall and analyze the issues related to impurities in water and their removal methods and
apply recent methodologies in water treatment for domestic and industrial usage
2. Evaluate the causes of metallic corrosion and apply the methods for corrosion protection
of metals
3. Evaluate the electrochemical energy storage systems such as lithium batteries, fuel cells
and solar cells, and design for usage in electrical and electronic applications
4. Assess the quality of different fossil fuels and create an awareness to develop the
alternative fuels
5. Analyze the properties of different polymers and distinguish the polymers which can be
degraded and demonstrate their usefulness
6. Apply the theoretical aspects: (a) in assessing the water quality; (b) understanding the
construction and working of electrochemical cells; (c) analyzing metals, alloys and soil
using instrumental methods; (d) evaluating the viscosity and water absorbing properties of
polymeric materials

Module:1 Water Technology 5 hours

Characteristics of hard water - hardness, DO, TDS in water and their determination – numerical
problems in hardness determination by EDTA; Modern techniques of water analysis for industrial
use - Disadvantages of hard water in industries.
Module:2 Water Treatment 8 hours
Water softening methods: - Lime-soda, Zeolite and ion exchange processes and their applications.
Specifications of water for domestic use (ICMR and WHO); Unit processes involved in water
treatment for municipal supply - Sedimentation with coagulant- Sand Filtration - chlorination;
Domestic water purification – Candle filtration- activated carbon filtration; Disinfection methods-
Ultrafiltration, UV treatment, Ozonolysis, Reverse Osmosis; Electro dialysis.
Module:3 Corrosion 6 hours
Dry and wet corrosion - detrimental effects to buildings, machines, devices & decorative art forms,
emphasizing Differential aeration, Pitting, Galvanic and Stress corrosion cracking; Factors that
enhance corrosion and choice of parameters to mitigate corrosion.
Module:4 Corrosion Control 4 hours
Corrosion protection - cathodic protection – sacrificial anodic and impressed current protection
methods; Advanced protective coatings: electroplating and electroless plating, PVD and CVD.
Alloying for corrosion protection – Basic concepts of Eutectic composition and Eutectic mixtures -
Selected examples – Ferrous and non-ferrous alloys.
Module:5 Electrochemical Energy Systems 6 hours
Brief introduction to conventional primary and secondary batteries; High energy electrochemical
energy systems: Lithium batteries – Primary and secondary, its Chemistry, advantages and
applications.
Fuel cells – Polymer membrane fuel cells, Solid-oxide fuel cells- working principles, advantages,
applications.
Solar cells – Types – Importance of silicon single crystal, polycrystalline and amorphous silicon
solar cells, dye sensitized solar cells - working principles, characteristics and applications.
 Module:6 Fuels and Combustion 8 hours
Calorific value - Definition of LCV, HCV. Measurement of calorific value using bomb calorimeter and
Boy‟s calorimeter including numerical problems.
Controlled combustion of fuels - Air fuel ratio – minimum quantity of air by volume and by weight-
Numerical problems-three way catalytic converter- selective catalytic reduction of NOX; Knocking inIC
engines-Octane and Cetane number - Antiknocking agents.
Module:7 Polymers 6 hours
Difference between thermoplastics and thermosetting plastics; Engineering application of plastics -
ABS, PVC, PTFE and Bakelite; Compounding of plastics: moulding of plastics for Car parts, bottle
caps (Injection moulding), Pipes, Hoses (Extrusion moulding), Mobile Phone Cases, Battery Trays,
(Compression moulding), Fibre reinforced polymers, Composites (Transfer moulding), PET bottles
(blow moulding);
Conducting polymers- Polyacetylene- Mechanism of conduction – applications (polymers in sensors,
self-cleaning windows)
Module:8 Contemporary issues: 2 hours
Lecture by Industry Experts
Total Lecture hours: 45 hours
Text Book(s)
1. 1. Sashi Chawla, A Text book of Engineering Chemistry, Dhanpat Rai Publishing Co., Pvt.
Ltd., Educational and Technical Publishers, New Delhi, 3rd Edition, 2015.
2. O.G. Palanna, McGraw Hill Education (India) Private Limited, 9th Reprint, 2015.
3. B. Sivasankar, Engineering Chemistry 1st Edition, Mc Graw Hill Education (India),
2008
4. Photovoltaic solar energy : From fundamentals to Applications , Ang le Reinders,
Pierre Verlinden, Wilfried van Sark, Alexandre Freundlich, Wiley publishers, 2017.
Reference Books
2 1. O.V. Roussak and H.D. Gesser, Applied Chemistry-A Text Book for Engineers and
Technologists, Springer Science Business Media, New York, 2nd Edition, 2013.
2. S. S. Dara, A Text book of Engineering Chemistry, S. Chand & Co Ltd., New Delhi, 20th
Edition, 2013.
Mode of Evaluation: Internal Assessment (CAT, Quizzes, Digital Assignments) & FAT
List of Experiments

Experiment title Hours

1. Water Purification: Estimation of water hardness by EDTA method and its 1 h 30 min
removal by ion-exchange resin
Water Quality Monitoring: 3h
2. Assessment of total dissolved oxygen in different water samples by
Winkler‟s method
3. Estimation of sulphate/chloride in drinking water by conductivity method
4/5 Material Analysis: Quantitative colorimetric determination of divalent 3h
. metal ions of Ni/Fe/Cu using conventional and smart phone digital-
imaging methods
6. Analysis of Iron in carbon steel by potentiometry 1 h 30 min
7. Construction and working of an Zn-Cu electrochemical cell 1 h 30 min
8. Determination of viscosity-average molecular weight of different 1 h 30 min
natural/synthetic polymers
9. Arduino microcontroller based sensor for monitoring 1 h 30 min
pH/temperature/conductivity in samples.
Total Laboratory Hours 17 hours
Mode of Evaluation: Viva-voce and Lab performance & FAT
Recommended by Board of Studies 31-05-2019
Approved by Academic Council 54th ACM Date 13-06-2019
Course code PROBLEM SOLVING AND PROGRAMMING L T P J C
CSE1001 0 0 6 0 3
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To develop broad understanding of computers, programming languages and their
generations
2. Introduce the essential skills for a logical thinking for problem solving
3. To gain expertise in essential skills in programming for problem solving using
computer
Expected Course Outcome:
1. Understand the working principle of a computer and identify the purpose of a computer
programming language.
2. Learn various problem solving approaches and ability to identify an appropriate
approach to solve the problem
3. Differentiate the programming Language constructs appropriately to solve any problem
4. Solve various engineering problems using different data structures
5. Able to modulate the given problem using structural approach of programming
6. Efficiently handle data using flat files to process and store data for the given problem

List of Challenging Experiments (Indicative)

1 Steps in Problem Solving Drawing flowchart using yEd tool/Raptor Tool 4 Hours
2 Introduction to Python, Demo on IDE, Keywords, Identifiers, I/O Statements 4 Hours
3 Simple Program to display Hello world in Python 4 Hours
4 Operators and Expressions in Python 4 Hours
5 Algorithmic Approach 1: Sequential 4 Hours
6 Algorithmic Approach 2: Selection ( if, elif, if.. else, nested if else) 4 Hours
7 Algorithmic Approach 3: Iteration (while and for) 6 Hours
8 Strings and its Operations 6 Hours
9 Regular Expressions 6 Hours
10 List and its operations 6 Hours
11 Dictionaries: operations 6 Hours
12 Tuples and its operations 6 Hours
13 Set and its operations 6 Hours
14 Functions, Recursions 6 Hours
15 Sorting Techniques (Bubble/Selection/Insertion) 6 Hours
16 Searching Techniques : Sequential Search and Binary Search 6 Hours
17 Files and its Operations 6 Hours
Total hours: 90 hours
Text Book(s)
1. John V. Guttag., 2016. Introduction to computation and programming using python: with applications to
understanding data. PHI Publisher.
Reference Books
1. Charles Severance.2016.Python for everybody: exploring data in Python 3, CharlesSeverance.
2. Charles Dierbach.2013.Introduction to computer science using python: a computational
problem-solving focus. Wiley Publishers.
Mode of Evaluation: PAT/ CAT / FAT
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 38 Date 23-10-2015
CSE1002 PROBLEM SOLVING AND OBJECT ORIENTED L T P J C
PROGRAMMING
0 0 6 0 3
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives:
1. To emphasize the benefits of object oriented concepts.
2.To enable students to solve the real time applications using object oriented programmingfeatures
3.To improve the skills of a logical thinking and to solve the problems using any processing
elements

Expected Course Outcome:

1. Demonstrate the basics of procedural programming and to represent the real world entitiesas
programming constructs.
2.Enumerate object oriented concepts and translate real-world applications into graphical
representations.
3.Demonstrate the usage of classes and objects of the real world entities in applications.
4.Discriminate the reusability and multiple interfaces with same functionality based featuresto
solve complex computing problems.
5. Illustrate possible error-handling constructs for unanticipated states/inputs and to use generic
programming constructs to accommodate different datatypes.
6. Validate the program against file inputs towards solving the problem..

List of Challenging Experiments (Indicative)

1. Postman Problem 10 hours
A postman needs to walk down every street in his area in order to deliver the
mail. Assume that the distances between the streets along the roads are given.
The postman starts at the post office and returns back to the post office after
delivering all the mails. Implement an algorithm to help the post man to walk
minimum distance for the purpose.
2. Budget Allocation for Marketing Campaign 15 hours
A mobile manufacturing company has got several marketing options such as
Radio advertisement campaign, TV non peak hours campaign, City top paper
network, Viral marketing campaign, Web advertising. From their previous
experience, they have got a statistics about paybacks for each marketing
option. Given the marketing budget (rupees in crores) for the current year and
details of paybacks for each option, implement an algorithm to determine the
amount that shall spent on each marketing option so that the company attains
the maximum profit.
3. Missionaries and Cannibals 10 hours
Three missionaries and three cannibals are on one side of a river, along with a
boat that can hold one or two people. Implement an algorithm to find a way
to get everyone to the other side of the river, without ever leaving a
group of missionaries in one place outnumbered by the cannibals in that
place.
4. Register Allocation Problem 15 hours
A register is a component of a computer processor that can hold any type of
 data and can be accessed faster. As registers are faster to access, it is
desirable to use them to the maximum so that the code execution is faster.
For each code submitted to the processor, a register interference graph (RIG)
is constructed. In a RIG, a node represents a temporary variable and an edge
is added between two nodes (variables) t1 and t2 if they are live
simultaneously at some point in the program. During register allocation, two
temporaries can be allocated to the same register if there is no edge
connecting them. Given a RIG representing the dependencies between
variables in a code, implement an algorithm to determine the number of
registers required to store the variables and speed up the code execution
5. Selective Job Scheduling Problem 15 hours
A server is a machine that waits for requests from other machines and
responds to them. The purpose of a server is to share hardware and software
resources among clients. All the clients submit the jobs to the server for
execution and the server may get multiple requests at a time. In such a
situation, the server schedule the jobs submitted to it based on some criteria
and logic. Each job contains two values namely time and memory required
for execution. Assume that there are two servers that schedules jobs based
on time and memory. The servers are named as Time Schedule Server and
memory Schedule Server respectively. Design a OOP model and implement
the time Schedule Server and memory Schedule Server. The Time Schedule
Server arranges jobs based on time required for execution in ascending order
whereas memory Schedule Server arranges jobs based on memory required
for execution in ascending order
6. Fragment Assembly in DNA Sequencing 15 hours
DNA, or deoxyribonucleic acid, is the hereditary material in humans and
almost all other organisms. The information in DNA is stored as a code
made up of four chemical bases: adenine (A), guanine (G), cytosine (C), and
thymine (T). In DNA sequencing, each DNA is sheared into millions of
small fragments (reads) which assemble to form a single genomic sequence
(superstring). Each read is a small string. In such a fragment assembly, given
a set of reads, the objective is to determine the shortest superstring that
contains all the reads. For example, given a set of strings, 000, 001, 010,
011, 100, 101, 110, 111 the shortest superstring is 0001110100. Given a set
of reads, implement an algorithm to find the shortest superstring that
contains all the given reads.
7. House Wiring 10 hours
An electrician is wiring a house which has many rooms. Each room has
many power points in different locations. Given a set of power points and
the distances between them, implement an algorithm to find the minimum
cable required.
Total Laboratory Hours 90 hours
Text Book(s)
1. Stanley B Lippman, Josee Lajoie, Barbara E, Moo, C++ primer, Fifth edition, Addison-
Wesley, 2012.
2 Ali Bahrami, Object oriented Systems development, Tata McGraw - Hill Education, 1999.
3 Brian W. Kernighan, Dennis M. Ritchie , The C programming Language, 2nd edition,
Prentice Hall Inc., 1988.
Reference Books
1. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 4th edition, 2013
2. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 7th edition, Prentice Hall, 2010
3. Maureen Sprankle and Jim Hubbard, Problem solving and Programming concepts, 9th
edition, Pearson Eduction, 2014.
Mode of assessment: PAT / CAT / FAT
Recommended by Board of Studies 29-10-2015
Approved by Academic Council No. 39 Date 17-12-2015
CSE1902 Industrial Internship L T P J C
0 0 0 0 1
Pre-requisite Completion of minimum of Two semesters

Course Objectives:
The course is designed so as to expose the students to industry environment and to take up on-site assignment as
trainees or interns.

Expected Course Outcome:

At the end of this internship the student should be able to:
1. Have an exposure to industrial practices and to work in teams
2. Communicate effectively
3. Understand the impact of engineering solutions in a global, economic, environmental and societal context
4. Develop the ability to engage in research and to involve in life-long learning
5. Comprehend contemporary issues
6. Engage in establishing his/her digital footprint

Contents 4 Weeks
Four weeks of work at industry site.
Supervised by an expert at the industry.

Mode of Evaluation: Internship Report, Presentation and Project Review

Recommended by Board of Studies 28-02-2016
Approved by Academic Council No. 37 Date 16-06-2015
 CSE1901 Technical Answers for Real World Problems (TARP) L T P J C
1 0 0 4 2
Pre-requisite Nil Syllabus version
1.0
Course Objectives:
 To help students to identify the need for developing newer technologies for industrial / societal
needs
 To train students to propose and implement relevant technology for the development ofthe
prototypes / products
 To make the students learn to the use the methodologies available for analysing the developed
prototypes / products

Expected Course Outcome:

At the end of the course, the student will be able to
1. Identify real life problems related to society
2. Apply appropriate technology(ies) to address the identified problems usingengineering
principles and arrive at innovative solutions

Module:1 15 hours
1. Identification of real life problems
2. Field visits can be arranged by the faculty concerned
3. 6 – 10 students can form a team (within the same / different discipline)
4. Minimum of eight hours on self-managed team activity
5. Appropriate scientific methodologies to be utilized to solve the identified issue
6. Solution should be in the form of fabrication/coding/modeling/product design/process
design/relevant scientific methodology(ies)
7. Consolidated report to be submitted for assessment
8. Participation, involvement and contribution in group discussions during the contact hours
will be used as the modalities for the continuous assessment of the theory component
9. Project outcome to be evaluated in terms of technical, economical, social, environmental,
political and demographic feasibility
10. Contribution of each group member to be assessed
11. The project component to have three reviews with the weightage of 20:30:50

Mode of Evaluation: (No FAT) Continuous Assessment the project done – Mark weightage of
20:30:50 – project report to be submitted, presentation and project reviews
Recommended by Board of Studies 28-02-2016
Approved by Academic Council No.37 Date 16-06-2015
 CSE1903 Comprehensive Examination L TP J C
0 0 0 0 1
Pre-requisite Syllabus version
1.00

Digital Logic and Microprocessor

Simplification of Boolean functions using K-Map – Combinational logic: Adder, subtractor,
encoder, decoder, multiplexer, de-multiplexer – Sequential Logic: Flip flops- 8086
Microprocessor: instructions – peripherals: 8255, 8254, 8257.

Computer Architecture and Organization

Instructions - Instruction types- Instruction Formats - Addressing Modes- Pipelining- Data
Representation - Memory Hierarchy- Cache memory-Virtual Memory- I/O Fundamentals- I/O
Techniques - Direct Memory Access - Interrupts-RAID architecture
Programming, Data Structures and Algorithms
Programming in C; Algorithm Analysis – Iterative and Recursive Algorithms; ADT - Stack and its
Applications - Queue and its Applications; Data Structures – Arrays and Linked Lists; Algorithms
- Sorting – Searching; Trees – BST, AVL; Graphs – BFS , DFS , Dijkstra‟s Shortest Path
Algorithm.

Theory of Computation
Deterministic Finite Automata, Non deterministic Finite Automata, Regular Expressions, Context
Free Grammar, Push down Automata and Context Free Languages, Turing Machines.

Web Technologies
Web Architecture- JavaScript – objects String, date, Array, Regular Expressions, DHTML-
HTML DOM Events; Web Server – HTTP- Request/Response model-RESTful methods- State
Management – Cookies , Sessions – AJAX.

Operating Systems
Processes, Threads, Inter‐process communication, CPU scheduling, Concurrency and
synchronization, Deadlocks, Memory management and Virtual memory & File systems.

Database Management System

DBMS, Schema, catalog, metadata, data independence, pre-compiler; Users-naïve, sophisticated,
casual ;ER Model- Entity, attributes, structural constraints; Relational Model-Constraints,
Relational Algebra operations; SQL- DDL, DML, TCL, DCL commands, basic queries and Top
N queries; Normalization-properties, 1NF, 2NF, 3NF, BCNF; Indexing-different types, Hash VsB-
tree Index; Transaction-problems, Concurrency Control-techniques, Recovery-methods.
Data Communication and Computer Networks
Circuit Switching, Packet Switching, Frame Relay, Cell Switching, ATM , OSI Reference model,
TCP\IP, Network topologies, LAN Technologies, Error detection and correction techniques,
Internet protocols , IPv4/IPv6, Routing algorithms, TCP and UDP, Sockets, Congestion control,
Application Layer Protocols, Network Security: Basics of public and private key cryptosystems-
Digital Signatures and Hash codes, Transport layer security, VPN, Firewalls.
Recommended by Board of Studies 05-03-2016
Approved by Academic Council No. 40 Date 18-03-2016
CSE1904 Capstone Project LT P J C
0 0 0 0 12
Pre-requisite As per the academic regulations Syllabus version
v. 1.0
Course Objectives:
To provide sufficient hands-on learning experience related to the design, development and analysis of
suitable product / process so as to enhance the technical skill sets in the chosen field.

Expected Course Outcome:

1. Formulate specificproblemstatementsfor ill-defined real life problemswithreasonable
assumptions and constraints.
2. Perform literature search and /or patent search in the area of interest.
3. Conductexperiments / Design and Analysis / solution iterations and documentthe results.
4. Perform error analysis / benchmarking / costing
5. Synthesise the results and arrive at scientific conclusions / products / solution
6. Document the results in the form of technical report / presentation

Mode of Evaluation: Periodic reviews, Presentation, Final oral viva, Poster submission
Recommended by Board of Studies 10.06.2015
Approved by Academic Council 37th AC Date 16.06.2015
Course Code Course Title L T P J C
ENG1901 Technical English - I 0 0 4 0 2
Pre-requisite Foundation English-II Syllabus Version
1
Course Objectives:
1. To enhance students‘ knowledge of grammar and vocabulary to read and write error-free
language in real life situations.
2. To make the students‘ practice the most common areas of written and spoken
communications skills.
3. To improve students‘ communicative competency through listening and speaking activities
in the classroom.
Expected Course Outcome:
1. Develop a better understanding of advanced grammar rules and write grammatically
correct sentences.
2. Acquire wide vocabulary and learn strategies for error-free communication.
3. Comprehend language and improve speaking skills in academic and social contexts.
4. Improve listening skills so as to understand complex business communication in a
variety of global English accents through proper pronunciation.
5. Interpret texts, diagrams and improve both reading and writing skills which would help
them in their academic as well as professional career.

Module:1 Advanced Grammar (CO: 1,2) 4 hours

Articles, Tenses, Voice and Prepositions
Activity: Worksheets on Impersonal Passive Voice, Exercises from the prescribed text

Module:2 Vocabulary Building I (CO:2&5) 4 hours

Idioms and Phrases, Homonyms, Homophones and Homographs
Activity: Jigsaw Puzzles; Vocabulary Activities through Web tools

Module:3 Listening for Specific Purposes (CO:4&5) 4 hours

Gist, monologues, short conversations, announcements, briefings and discussions
Activity: Gap filling; Interpretations

Module:4 Speaking for Expression (CO:3&4) 6 hours

Introducing oneself and others, Making Requests & responses, Inviting and Accepting/Declining
Invitations
Activity: Brief introductions; Role-Play; Skit.
Module:5 Reading for Information (CO: 5&4) 4 hours
Reading Short Passages, News Articles, Technical Papers and Short Stories
Activity: Reading specific news paper articles; blogs
Module:6 Writing Strategies (CO:5&3) 4 hours
Joining the sentences, word order, sequencing the ideas, introduction and conclusion
Activity: Short Paragraphs; Describing familiar events; story writing

Module:7 Vocabulary Building II (CO:2,3&5) 4 hours

Enrich the domain specific vocabulary by describing Objects, Charts, Food, Sports and
Employment.
Activity: Describing Objects, Charts, Food, Sports and Employment

Module:8 Listening for Daily Life (CO: 4 &5) 4 hours

Listening for statistical information, Short extracts, Radio broadcasts and TV interviews
Activity: Taking notes and Summarizing

Module:9 Expressing Ideas and Opinions (3,4 &5) 6 hours

Telephonic conversations, Interpretation of Visuals and describing products and processes.
Activity: Role-Play (Telephonic); Describing Products and Processes

Module: 10 Comprehensive Reading (1,2&5) 4 hours

Reading Comprehension, Making inferences, Reading Graphics, Note-making, and Critical
Reading.
Activity: Sentence Completion; Cloze Tests

Module: 11 Narration (5,2 &4) 4 hours

Writing narrative short story, Personal milestones, official letters and E-mails.
Activity: Writing an E-mail; Improving vocabulary and writing skills.

Module:12 Pronunciation (2,3 &4) 4 hours

Speech Sounds, Word Stress, Intonation, Various accents
Activity: Practicing Pronunciation through web tools; Listening to various accents of English

Module:13 Editing (1,4&5) 4 hours

Simple, Complex & Compound Sentences, Direct & Indirect Speech, Correction of Errors,
Punctuations.
Activity: Practicing Grammar

Module:14 Short Story Analysis (5,2&3) 4 hours

―The Boundary‖ by Jhumpa Lahiri
Activity: Reading and analyzing the theme of the short story.
Total Lecture hours 60 hours
Text Book / Workbook
1. Wren, P.C.; Martin, H.; Prasada Rao, N.D.V. (1973–2010). High School English Grammar
& Composition. New Delhi: Sultan Chand Publishers.
2 Kumar, Sanjay,; Pushp Latha. (2018) English Language and Communication Skills for
Engineers, India: Oxford University Press.
Reference Books

1. Guptha S C, (2012) Practical English Grammar & Composition, 1st Edition, India:
Arihant Publishers
2. Steven Brown, (2011) Dorolyn Smith, Active Listening 3, 3rd Edition, UK:
Cambridge University Press.
3. Liz Hamp-Lyons, Ben Heasley, (2010) Study Writing, 2nd Edition, UK: Cambridge
University Pres.
4. Kenneth Anderson, Joan Maclean, (2013) Tony Lynch, Study Speaking, 2nd Edition, UK:
Cambridge, University Press.
5. Eric H. Glendinning, Beverly Holmstrom, (2012) Study Reading, 2nd Edition, UK:
Cambridge University Press.
6. Michael Swan, (2017) Practical English Usage (Practical English Usage), 4th edition, UK:
Oxford University Press.
7. Michael McCarthy, Felicity O'Dell, (2015) English Vocabulary in Use Advanced (South
Asian Edition), UK: Cambridge University Press.
8. Michael Swan, Catherine Walter, (2012) Oxford English Grammar Course Advanced, Feb,
4th Edition, UK: Oxford University Press.
9. Watkins, Peter. (2018) Teaching and Developing Reading Skills: Cambridge Handbooks
for Language teachers, UK: Cambridge University Press.
10. (The Boundary by Jhumpa Lahiri) URL:
https://www.newyorker.com/magazine/2018/01/29/the-
boundary?intcid=inline_amp
Mode of evaluation: Quizzes, Presentation, Discussion, Role play, Assignments and FAT
List of Challenging Experiments (Indicative)
1. Self-Introduction 12 hours
2. Sequencing Ideas and Writing a Paragraph 12 hours
3. Reading and Analyzing Technical Articles 8 hours
4. Listening for Specificity in Interviews (Content Specific) 12 hours
5. Identifying Errors in a Sentence or Paragraph 8 hours
6. Writing an E-mail by narrating life events 8 hours
Total Laboratory Hours 60 hours
Mode of evaluation: Quizzes, Presentation, Discussion, Role play, Assignments and FAT
Recommended by Board of Studies 08.06.2019
Approved by Academic Council 55 Date: 13-06-2019
Course Code Course Title L T P J C

ENG 1902 Technical English - II 0 0 4 0 2

Pre-requisite 71% to 90% EPT score Syllabus Version

1
Course Objectives:
1. To acquire proficiency levels in LSRW skills on par with the requirements for placement
interviews of high-end companies / competitive exams.
2. To evaluate complex arguments and to articulate their own positions on a range of technical
and general topics.
3. To speak in grammatical and acceptable English with minimal MTI, as well as develop a
vast and active vocabulary.
Expected Course Outcome:
1. Communicate proficiently in high-end interviews and exam situations and all social
situations
2. Comprehend academic articles and draw inferences
3. Evaluate different perspectives on a topic
4. Write clearly and convincingly in academic as well as general contexts
5. Synthesize complex concepts and present them in speech and writing

Module:1 Listening for Clear Pronunciation 4 hours

Ice-breaking, Introduction to vowels, consonants, diphthongs.
Listening to formal conversations in British and American accents (BBC and CNN) as well as other
‗native‘ accents
Activity: Factual and interpretive exercises; note-making in a variety of global English accents
Module:2 Introducing Oneself 4 hours
Speaking: Individual Presentations
Activity: Self-Introductions, Extempore speech
Module:3 Effective Writing 6 hours
Writing: Business letters and Emails, Minutes and Memos
Structure/ template of common business letters and emails: inquiry/ complaint/ placing an order;
Formats of Minutes and Memos
Activity: Students write a business letter and Minutes/ Memo
Module:4 Comprehensive Reading 4 hours
Reading: Reading Comprehension Passages, Sentence Completion (Technical and General Interest),
Vocabulary and Word Analogy
Activities: Cloze tests, Logical reasoning, Advanced grammar exercises
Module:5 Listening to Narratives 4 hours
Listening: Listening to audio files of short stories, News, TV Clips/ Documentaries, Motivational
Speeches in UK/ US/ global English accents.
Activity: Note-making and Interpretive exercises
Module:6 Academic Writing and Editing 6 hours
Writing: Editing/ Proofreading symbols
Citation Formats
Structure of an Abstract and Research Paper
Activity: Writing Abstracts and research paper; Work with Editing/ Proofreading exercise
Module:7 Team Communication 4 hours
Speaking: Group Discussions and Debates on complex/ contemporary topics
Discussion evaluation parameters, using logic in debates
Activity: Group Discussions on general topics
Module:8 Career-oriented Writing 4
hours
Writing: Resumes and Job Application Letters, SOP
Activity: Writing resumes and SOPs
Module:9 Reading for Pleasure 4 hours
Reading: Reading short stories
Activity: Classroom discussion and note-making, critical appreciation of the short story
Module: 10 Creative Writing 4
hours
Writing: Imaginative, narrative and descriptive prose
Activity: Writing about personal experiences, unforgettable incidents, travelogues
Module: 11 Academic Listening 4
hours
Listening: Listening in academic contexts
Activity: Listening to lectures, Academic Discussions, Debates, Review Presentations, Research
Talks, Project Review Meetings
Module:12 Reading Nature-based Narratives 4
hours
Narratives on Climate Change, Nature and Environment
Activity: Classroom discussions, student presentations
Module:13 Technical Proposals 4 hours
Writing: Technical Proposals
Activities: Writing a technical proposal
Module:14 Presentation Skills 4 hours
Persuasive and Content-Specific Presentations
Activity: Technical Presentations
60
Total Lecture hours: hours
Text Book / Workbook
1. Oxenden, Clive and Christina Latham-Koenig. New English File: Advanced Students Book.
Paperback. Oxford University Press, UK, 2017.
2 Rizvi, Ashraf. Effective Technical Communication. McGraw-Hill India, 2017.

Reference Books
Oxenden, Clive and Christina Latham-Koenig, New English File: Advanced: Teacher’s
1. Book with Test and Assessment. CD-ROM: Six-level General English Course for Adults.
Paperback. Oxford University Press, UK, 2013.
Balasubramanian, T. English Phonetics for the Indian Students: A Workbook. Laxmi
2.
Publications, 2016.
 Philip Seargeant and Bill Greenwell, From Language to Creative Writing. Bloomsbury
3.
Academic, 2013.
4. Krishnaswamy, N. Eco-English. Bloomsbury India, 2015.
Manto, Saadat Hasan. Selected Short Stories. Trans. Aatish Taseer. Random House India,
5.
2012.
6. Ghosh, Amitav. The Hungry Tide. Harper Collins, 2016.
Ghosh, Amitav. The Great Derangement: Climate Change and the Unthinkable. Penguin
7.
Books, 2016.
The MLA Handbook for Writers of Research Papers, 8th ed. 2016.
8.
Online Sources:
https://americanliterature.com/short-short-stories. (75 short short stories)
http://www.eco-ction.org/dt/thinking.html (Leopold, Aldo.―Thinking like a Mountain")
/www.esl-lab.com/;
www.bbc.co.uk/learningenglish/;
/www.bbc.com/news;
/learningenglish.voanews.com/a/using-voa-learning-english-to-improve-listening-
skills/3815547.html

Mode of evaluation: Quizzes, Presentation, Discussion, Role play, Assignments and FAT

List of Challenging Experiments (Indicative)

1. Self-Introduction using SWOT 12 hours

2. Writing minutes of meetings 10 hours

3. Writing an abstract 10 hours

4. Listening to motivational speeches and interpretation 10 hours

5. Cloze Test 6 hours

6. Writing a proposal 12 hours

Total Laboratory Hours 60 hours

Mode of evaluation: Quizzes, Presentation, Discussion, Role play, Assignments and FAT
Recommended by Board of Studies 08.06.2019
Approved by Academic Council 55 Date: 13-06-2019
Course Code Course title L T P J C
ENG1903 Advanced Technical English 0 0 2 4 2
Pre-requisite Greater than 90 % EPT score Syllabus Version
1
Course Objectives:
1. To review literature in any form or any technical article
2. To infer content in social media and respond accordingly
3. To communicate with people across the globe overcoming trans-cultural barriers and
negotiate successfully

Expected Course Outcome:

1. Analyze critically and write good reviews
2. Articulate research papers, project proposals and reports
3. Communicate effectively in a trans-cultural environment
4. Negotiate and lead teams towards success
5. Present ideas in an effective manner using web tools

Module:1 Negotiation and Decision Making Skills through Literary Analysis 5 hours
Concepts of Negotiation and Decision Making Skills
Activity: Analysis of excerpts from Shakespeare‘s ―The Merchant of Venice‖ (court scene) and
discussion on negotiation skills.
Critical evaluation of excerpts from Shakespeare‘s ―Hamlet‖(Monologue by Hamlet) and discussion
on decision making skills

Module:2 Writing reviews and abstracts through movie interpretations 5 hours

Review writing and abstract writing with competency
Activity: Watching Charles Dickens ―Great Expectations‖ and writing a movie review
Watching William F. Nolan‘s ―Logan‘s Run‖ and analyzing it in tune with the present scenario of
depletion of resources and writing an abstract

Module:3 Technical Writing 4 hours

Stimulate effective linguistics for writing: content and style
Activity: Proofreading
Statement of Purpose
Module:4 Trans-Cultural Communication 4 hours
Nuances of Trans-cultural communication
Activity:
Group discussion and case studies on trans-cultural communication.
Debate on trans-cultural communication.
Module:5 Report Writing and Content Writing 4 hours
Enhancing reportage on relevant audio-visuals
Activity: Watch a documentary on social
issues and draft a report
Identify a video on any social issue and interpret
Module:6 Drafting project proposals and article writing 4 hours
Dynamics of drafting project proposals and research articles
Activity: Writing a project proposal.Writing a research
article.
Module:7 Technical Presentations 4 hours
Build smart presentation skills and strategies
Activity: Technical presentations using PPT and Web tools
Total Lecture hours 30 hours
Text Book / Workbook
1. Raman, Meenakshi & Sangeeta Sharma. Technical Communication: Principles and Practice,
3rd edition, Oxford University Press, 2015.
Reference Books
1 Basu B.N. Technical Writing, 2011 Kindle edition
2 Arathoon, Anita. Shakespeare’s The Merchant of Venice (Text with Paraphrase), Evergreen
Publishers, 2015.
3 Kumar, Sanjay and Pushp Lata. English Language and Communication Skills for Engineers,
Oxford University Press, India, 2018.
4 Frantisek, Burda. On Transcultural Communication, 2015, LAP Lambert Academic
Publishing, UK.
5 Geever, C. Jane. The Foundation Center’s Guide to Proposal Writing, 5th Edition, 2007,
Reprint 2012 The Foundation Center, USA.
6 Young, Milena. Hacking Your Statement of Purpose: A Concise Guide to Writing Your SOP,
2014 Kindle Edition.
7 Ray, Ratri, William Shakespeare's Hamlet, The Atlantic Publishers, 2011.
8 C Muralikrishna & Sunitha Mishra, Communication Skills for Engineers, 2nd edition, NY:
Pearson, 2011.
Mode of Evaluation: Quizzes, Presentation, Discussion, Role Play, Assignments

List of Challenging Experiments (Indicative)

1. Enacting a court scene - Speaking 6 hours
2. Watching a movie and writing a review 4 hours
3. Trans-cultural – case studies 2 hours
4. Drafting a report on any social issue 6 hours
5. Technical Presentation using web tools 6 hours
6. Writing a research paper 6 hours
J- Component Sample Projects
1. Short Films
2. Field Visits and Reporting
 3. Case studies
4. Writing blogs
5. Vlogging
Total Hours (J-Component) 60 hours
Mode of evaluation: Quizzes, Presentation, Discussion, Role play, Assignments and FAT
Recommended by Board of Studies 08.06.2019
Approved by Academic Council 55 Date: 13-06-2019
Course code Course title L T P J C
PHY1901 Introduction to Innovative Projects 1 0 0 0 1
Pre-requisite Nil Syllabus version
1.0
Course Objectives:
This course is offered to the students in the 1 Year of B.Tech. in order to orient them towards
independent, systemic thinking and be innovative.
1. To make students confident enough to handle the day to day issues.
2. To develop the ―Thinking Skill‖ of the students, especially Creative Thinking Skills
3. To train the students to be innovative in all their activities
4. To prepare a project report on a socially relevant theme as a solution to the existing issues
Expected Course Outcome: Students will be able to
1. Understand the various types of thinking skills.
2. Enhance the innovative and creative ideas.
3. Find out a suitable solution for socially relevant issues- J component

Module:1 A Self Confidence 1 hour

Understanding self – Johari Window –SWOT Analysis – Self Esteem – Being a contributor –
Case
Study
Project : Exploring self, understanding surrounding, thinking about how s(he) can be a
contributor
for the society, Creating a big picture of being an innovator – writing a 1000 words imaginary
autobiography of self – Topic ―Mr X – the great innovator of 2015‖ and upload. (4 non- contact
hours)
Module:1 B Thinking Skill 1 hour
Thinking and Behaviour – Types of thinking– Concrete – Abstract, Convergent, Divergent,
Creative,
Analytical, Sequential and Holistic thinking – Chunking Triangle – Context Grid – Examples –
Case Study.
Project : Meeting at least 50 people belonging to various strata of life and talk to them / make
field visits to identify a min of100 society related issues, problems for which they need solutions
and categories them and upload along with details of people met and lessons learnt. (4 non-
contact hours)
Module:1 C Lateral Thinking Skill 1 hour
 Blooms Taxonomy – HOTS – Outof the box thinking – deBono lateral thinking model –
Examples
Project : Last weeks - incomplete portion to be done and uploaded
Module:2 A Creativity 1 hour
Creativity Models – Walla – Barrons – Koberg & Begnall – Examples
Project : Selecting 5 out of 100 issues identified for future work. Criteria based approach
for prioritisation, use of statistical tools & upload . (4 non- contact hours)
Module:2 B Brainstorming 1 hour
25 brainstorming techniques and examples
Project : Brainstorm and come out with as many solutions as possible for the top 5 issues
identified & upload . (4 non- contact hours)
Module:3 Mind Mapping 1 hour
Mind Mapping techniques and guidelines. Drawing a mind map
Project : Using Mind Maps get another set of solutions forthe next 5 issues (issue 6 – 10) . (4
non- contact hours)
Module:4 A Systems thinking 1 hour
Systems Thinking essentials – examples – Counter Intuitive condemns
Project : Select 1 issue / problem for which the possible solutions are available with you.
Apply Systems Thinking process and pick up one solution [explanation should be given why the
other possible solutions have been left out ]. Go back to the customer and assess the
acceptability and upload. . (4 non- contact hours)
Module:4 B Design Thinking 1 hour
Design thinking process – Human element of design thinking – case study
Project : Apply design thinking to the selected solution, apply the engineering & scientific tinge
to it. Participate in ―design week‖ celebrations upload the weeks learning out come.
Module:5 A Innovation 1 hour
Difference between Creativity and Innovation – Examples of innovation –Being innovative.
Project: A literature searches on prototyping of your solution finalized. Prepare a prototype
model or process and upload. . (4 non- contact hours)
Module:5 B Blocks for Innovation 1 hour
Identify Blocks for creativity and innovation – overcoming obstacles – Case Study
Project : Project presentation on problem identification, solution, innovations-expected
results – Interim review with PPT presentation. . (4 non- contact hours)
Module:5 C Innovation Process 1 hour
Steps for Innovation – right climate for innovation
Project: Refining the project, based on the review report and uploading the text. . (4 non-
contact hours)
Module:6 A Innovation in India 1 hour
Stories of 10 Indian innovations
Project: Making the project better with add ons. . (4 non- contact hours)
Module:6 B JUGAAD Innovation 1 hour
Frugal and flexible approach to innovation - doing more with less Indian Examples
Project: Fine tuning the innovation project with JUGAAD principles and uploading
(Credit for JUGAAD implementation) . (4 non- contact hours)
Module:7 A Innovation Project Proposal 1 hour
Presentation
Project proposal contents, economic input, ROI – Template
Project: Presentation of the innovative project proposal and upload . (4 non- contact hours)
Module:8 A Contemporary issue in Innovation 1 hour
Contemporary issue in Innovation
Project: Final project Presentation , Viva voce Exam (4 non- contact hours)
Total Lecture hours: 15 hours

Text Book(s)
1. How to have Creative Ideas, Edward debone, Vermilon publication, UK, 2007
2. The Art of Innovation, Tom Kelley & Jonathan Littman, Profile Books Ltd, UK, 2008
Reference Books
1. Creating Confidence, Meribeth Bonct, Kogan Page India Ltd, New Delhi, 2000
2. Lateral Thinking Skills, Paul Sloane, Keogan Page India Ltd, New Delhi, 2008
3. Indian Innovators, Akhat Agrawal, Jaico Books, Mumbai, 2015
4. JUGAAD Innovation, Navi Radjou, Jaideep Prabhu, Simone Ahuja Random house India,
Noida, 2012.

Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar

Three reviews with weightage of 25 : 25 : 50 along with reports

Recommended by Board of Studies 15-12-2015

Approved by Academic Council No. 39 Date 17-12-2015
HUM1021 ETHICS AND VALUES L T P J C
2 0 0 0 2
Pre-requisite Nil Syllabus version
1.1
Course Objectives:
1. To understand and appreciate the ethical issues faced by an individual in profession, society andpolity
2. To understand the negative health impacts of certain unhealthy behaviors
3. To appreciate the need and importance of physical, emotional health and social health

Expected Course Outcome:

Students will be able to:
1. Follow sound morals and ethical values scrupulously to prove as good citizens
2. Understand various social problems and learn to act ethically
3. Understand the concept of addiction and how it will affect the physical and mental health
4. Identify ethical concerns in research and intellectual contexts, including academic integrity, useand
citation of sources, the objective presentation of data, and the treatment of human subjects
5. Identify the main typologies, characteristics, activities, actors and forms of cybercrime

Module:1 Being Good and Responsible 5 hours

Gandhian values such as truth and non-violence – Comparative analysis on leaders of past and present –
Society‟s interests versus self-interests - Personal Social Responsibility: Helping the needy, charity and
serving the society

Module:2 Social Issues 1 4 hours

Harassment – Types - Prevention of harassment, Violence and Terrorism

Module:3 Social Issues 2 4 hours

Corruption: Ethical values, causes, impact, laws, prevention – Electoral malpractices;
White collar crimes - Tax evasions – Unfair trade practices

Module:4 Addiction and Health 5 hours

Peer pressure - Alcoholism: Ethical values, causes, impact, laws, prevention – Ill effects of smoking -
Prevention of Suicides;
Sexual Health: Prevention and impact of pre-marital pregnancy and Sexually Transmitted Diseases

Module:5 Drug Abuse 3 hours

Abuse of different types of legal and illegal drugs: Ethical values, causes, impact, laws and prevention

Module:6 Personal and Professional Ethics 4 hours

Dishonesty - Stealing - Malpractices in Examinations – Plagiarism

Module:7 Abuse of Technologies 3 hours

Hacking and other cyber crimes, Addiction to mobile phone usage, Video games and Social networking
websites

Module:8 Contemporary issues: 2 hours

Guest lectures by Experts
 Total Lecture hours: 30 hours

Reference Books
1. Dhaliwal, K.K , ―Gandhian Philosophy of Ethics: A Study of Relationship between his
Presupposition and Precepts,2016, Writers Choice, New Delhi, India.
2. Vittal, N, ―Ending Corruption? - How to Clean up India?‖, 2012, Penguin Publishers, UK.
3. Pagliaro, L.A. and Pagliaro, A.M, ―Handbook of Child and Adolescent Drug and Substance Abuse:
Pharmacological , Developmental and Clinical Considerations‖, 2012Wiley Publishers, U.S.A.
4. Pandey, P. K (2012), ―Sexual Harassment and Law in India‖, 2012, Lambert Publishers, Germany.

Mode of Evaluation: CAT, Assignment, Quiz, FAT and Seminar

Recommended by Board of Studies 26-07-2017
Approved by Academic Council No. 46 Date 24-08-2017
MAT-1011 Calculus for Engineers L T P J C
3 0 2 0 4
Pre-requisite 10+2 Mathematics or MAT1001 Syllabus Version
1.0
Course Objectives :
1. To provide the requisite and relevant background necessary to understand theother
important engineering mathematics courses offered for Engineers and Scientists.
2. To introduce important topics of applied mathematics, namely Singleand
Multivariable Calculus and Vector Calculus etc.
3. To impart the knowledge of Laplace transform, an important transform technique for
Engineers which requires knowledge of integration
Expected Course Outcomes:
At the end of this course the students should be able to
1. apply single variable differentiation and integration to solve applied problems in
engineering and find the maxima and minima of functions
2. understand basic concepts of Laplace Transforms and solve problems with periodic
functions, step functions, impulse functions and convolution
3. evaluate partial derivatives, limits, total differentials, Jacobians, Taylor series and
optimization problems involving several variables with or without constraints
4. evaluate multiple integrals in Cartesian, Polar, Cylindrical and Spherical coordinates.
5. understand gradient, directional derivatives, divergence, curl and Greens‟, Stokes,
Gauss theorems
6. demonstrate MATLAB code for challenging problems in engineering

Module:1 Application of Single Variable Calculus 9 hours

Differentiation- Extrema on an Interval-Rolle‟s Theorem and the Mean Value Theorem-
Increasing and Decreasing functions and First derivative test-Second derivative test-Maxima
and Minima-Concavity. Integration-Average function value - Area between curves - Volumes
of solids of revolution - Beta and Gamma functions–interrelation

Module:2 Laplace transforms 7 hours

Definition of Laplace transform-Properties-Laplace transform of periodic functions-Laplace
transform of unit step function, Impulse function-Inverse Laplace transform-Convolution.

Module:3 Multivariable Calculus 4 hours

Functions of two variables-limits and continuity-partial derivatives –total differential-Jacobian
and its properties.

Module:4 Application of Multivariable Calculus 5 hours

Taylor‟s expansion for two variables–maxima and minima–constrained maxima and minima-
Lagrange‟s multiplier method.

Module:5 Multiple integrals 8 hours

Evaluation of double integrals–change of order of integration–change of variables between
Cartesian and polar co-ordinates - Evaluation of triple integrals-change of variables between
Cartesian and cylindrical and spherical co-ordinates- evaluation of multiple integrals using
gamma and beta functions.
Module:6 Vector Differentiation 5 hours
Scalar and vector valued functions – gradient, tangent plane–directional derivative-divergence
and curl–scalar and vector potentials–Statement of vector identities-Simple problems

Module:7 Vector Integration 5 hours

line, surface and volume integrals - Statement of Green‟s, Stoke‟s and Gauss divergence
theorems -verification and evaluation of vector integrals using them.

Module:8 Contemporary Issues: 2 hours

Industry Expert Lecture

Total Lecture hours: 45 hours

Text Book(s)
[1] Thomas‟ Calculus, George B.Thomas, D.Weir and J. Hass, 13 th edition, Pearson, 2014.
[2] Advanced Engineering Mathematics, Erwin Kreyszig, 10th Edition, Wiley India, 2015.
Reference Books
1. Higher Engineering Mathematics, B.S. Grewal, 43rd Edition ,Khanna Publishers, 2015
2. Higher Engineering Mathematics, John Bird, 6th Edition, Elsevier Limited, 2017.
3. Calculus: Early Transcendentals, James Stewart, 8th edition, Cengage Learning, 2017.
4. Engineering Mathematics, K.A.Stroud and Dexter J. Booth, 7th Edition, Palgrave
Macmillan (2013)
Mode of Evaluation
Digital Assignments, Quiz, Continuous Assessments, Final Assessment Test
List of Challenging Experiments (Indicative)
1. Introduction to MATLAB through matrices, and general Syntax 2 hours
2 Plotting and visualizing curves and surfaces in MATLAB – 2 hours
Symbolic computations using MATLAB
3. Evaluating Extremum of a single variable function 2 hours
4. Understanding integration as Area under the curve 2 hours
5. Evaluation of Volume by Integrals (Solids of Revolution ) 2 hours
6. Evaluating maxima and minima of functions of several variables 2 hours
7. Applying Lagrange multiplier optimization method 2 hours
8. Evaluating Volume under surfaces 2 hours
9. Evaluating triple integrals 2 hours
10. Evaluating gradient, curl and divergence 2 hours
11. Evaluating line integrals in vectors 2 hours
12. Applying Green's theorem to real world problems 2 hours
Total Laboratory Hours 24 hours
Mode of Assessment:
Weekly assessment, Final Assessment Test
Recommended by Board of Studies 12-06-2015
Approved by Academic Council No. 37 Date 16-06-2015
 MAT2001 Statistics for Engineers L T P J C
3 0 2 0 4
Prerequisites MAT1011 – Calculus for Syllabus Version: 1.0
Engineers
Course Objectives :
1. To provide students with a framework that will help them choose the appropriate
descriptive methods in various data analysis situations.
2. To analyse distributions and relationship of real-time data.
3. To apply estimation and testing methods to make inference and modelling techniques
for decision making.
Expected Course Outcome:
At the end of the course the student should be able to:
1. Compute and interpret descriptive statistics using numerical and graphical techniques.
2. Understand the basic concepts of random variables and find an appropriate
distribution for analysing data specific to an experiment.
3. Apply statistical methods like correlation, regression analysis in analysing,
interpreting experimental data.
4. Make appropriate decisions using statistical inference that is the central to
experimental research.
5. Use statistical methodology and tools in reliability engineering problems.
6. demonstrate R programming for statistical data

Module: 1 Introduction to Statistics 6 hours

Introduction to statistics and data analysis-Measures of central tendency –Measures of
variability-[Moments-Skewness-Kurtosis (Concepts only)].
Module: 2 Random variables 8 hours
Introduction -random variables-Probability mass Function, distribution and density functions
- joint Probability distribution and joint density functions- Marginal, conditional distribution
and density functions- Mathematical expectation, and its properties Covariance , moment
generating function – characteristic function.
Module: 3 Correlation and regression 4 hours
Correlation and Regression – Rank Correlation- Partial and Multiple correlation- Multiple
regression.
Module: 4 Probability Distributions 7 hours
Binomial and Poisson distributions – Normal distribution – Gamma distribution –
Exponential distribution – Weibull distribution.
Module: 5 Hypothesis Testing I 4 hours
Testing of hypothesis – Introduction-Types of errors, critical region, procedure of testing
hypothesis-Large sample tests- Z test for Single Proportion, Difference of Proportion, mean
and difference of means.
Module: 6 Hypothesis Testing II 9 hours
Small sample tests- Student‟s t-test, F-test- chi-square test- goodness of fit - independence of
attributes- Design of Experiments - Analysis of variance – one and two way classifications -
CRD-RBD- LSD.
Module: 7 Reliability 5 hours
Basic concepts- Hazard function-Reliabilities of series and parallel systems- System
Reliability - Maintainability-Preventive and repair maintenance- Availability.
Module: 8 Contemporary Issues 2 hours
Industry Expert Lecture
Total Lecture hours 45 hours
Text book(s)
1. Probability and Statistics for engineers and scientists, R.E.Walpole, R.H.Myers,
S.L.Mayers and K.Ye, 9th Edition, Pearson Education (2012).
2. Applied Statistics and Probability for Engineers, Douglas C. Montgomery, George
C. Runger, 6th Edition, John Wiley & Sons (2016).
Reference books
1. Reliability Engineering, E.Balagurusamy, Tata McGraw Hill, Tenth reprint 2017.
2. Probability and Statistics, J.L.Devore, 8th Edition, Brooks/Cole, Cengage Learning
(2012).
3. Probability and Statistics for Engineers, R.A.Johnson, Miller Freund‟s, 8th
edition, Prentice Hall India (2011).
4. Probability, Statistics and Reliability for Engineers and Scientists, Bilal M. Ayyuband
Richard H. McCuen, 3rd edition, CRC press (2011).
Mode of Evaluation
Digital Assignments, Continuous Assessment Tests, Quiz, Final Assessment Test.
List of Experiments (Indicative)
• Introduction: Understanding Data types; importing/exporting 2 hours
data.
• Computing Summary Statistics /plotting and visualizing data 2 hours
using Tabulation and Graphical Representations.
• Applying correlation and simple linear regression model to real 2 hours
dataset; computing and interpreting the coefficient of
determination.
• Applying multiple linear regression model to real dataset; 2 hours
computing and interpreting the multiple coefficient of
determination.
• Fitting the following probability distributions: Binomial 2 hours
distribution
• Normal distribution, Poisson distribution 2 hours
• Testing of hypothesis for One sample mean and proportion 2 hours
from real-time problems.
• Testing of hypothesis for Two sample means and proportion 2 hours
from real-time problems
• Applying the t test for independent and dependent samples 2 hours
• Applying Chi-square test for goodness of fit test and 2 hours
Contingency test to real dataset
• Performing ANOVA for real dataset for Completely 2 hours
randomized design, Randomized Block design ,Latin square
Design
Total laboratory hours 22 hours
Mode of Evaluation
Weekly Assessment, Final Assessment Test
Recommended by Board of Studies 25-02-2017
Approved by Academic Council 47 Date: 05-10-2017
MGT1022 Lean Start up Management L T P J C
1 0 0 4 2
Pre-requisite Nil Syllabus version
v.1.0
Course Objectives: To develop the ability to
1. Learn methods of company formation and management.
2. Gain practical skills in and experience of stating of business using pre-set collection of
business ideas.
3. Learn basics of entrepreneurial skills.

Expected Course Outcome: On the completion of this course the student will be able to:
1. Understand developing business models and growth drivers
2. Use the business model canvas to map out key components of enterprise
3. Analyze market size, cost structure, revenue streams, and value chain
4. Understand build-measure-learn principles
Foreseeing and quantifying business and financial risks

Module:1 2 Hours
Creativity and Design Thinking (identify the vertical for business opportunity, understand your
customers, accurately assess market opportunity)

Module:2 3 Hours
Minimum Viable Product (Value Proposition, Customer Segments, Build- measure-learn process)

Module:3 3 Hours
Business Model Development(Channels and Partners, Revenue Model and streams, Key
Resources, Activities and Costs, Customer Relationships and Customer Development Processes,
Business model canvas –the lean model- templates)

Module:4 3 Hours
Business Plan and Access to Funding(visioning your venture, taking the product/ service to market,
Market plan including Digital & Viral Marketing, start-up finance - Costs/Profits & Losses/cash
flow, Angel/VC,/Bank Loans and Key elements of raising money)

Module:5 3 Hours
Legal, Regulatory, CSR, Standards, Taxes

Module:6 2 Hours
Lectures by Entrepreneurs

Total Lecture 15 hours

Text Book(s)
1. The Startup Owner's Manual: The Step-By-Step Guide for Building a Great Company, Steve
Blank, K & S Ranch; 1st edition (March 1, 2012)
2
The Four Steps to the Epiphany, Steve Blank, K&S Ranch; 2nd edition (July 17, 2013)
3 The Lean Startup: How Today's Entrepreneurs Use Continuous Innovation to Create Radically
Successful Businesses, Eric Ries, Crown Business; (13 September 2011)
Reference Books
1. Holding a Cat by the Tail, Steve Blank, K&S Ranch Publishing LLC (August 14, 2014)
2 Product Design and Development, Karal T Ulrich, SD Eppinger, McGraw Hill
3 Zero to One: Notes on Startups, or How to Build the Future, Peter Thiel, Crown
Business(2014)
4 Lean Analytics: Use Datato Build a Better Startup Faster (Lean Series), Alistair Croll&
Benjamin Yoskovitz, O'Reilly Media; 1st Edition (March 21, 2013)
5 Inspired: How To Create Products Customers Love, Marty Cagan, SVPG Press; 1st edition (June
18, 2008)
6 Website References:
1. http://theleanstartup.com/
2. https://www.kickstarter.com/projects/881308232/only-on-kickstarter-the-leaders-guide-by-
eric-ries
3. http://businessmodelgeneration.com/
4. https://www.leanstartupmachine.com/
5. https://www.youtube.com/watch?v=fEvKo90qBns
6. http://thenextweb.com/entrepreneur/2015/07/05/whats-wrong-with-the-lean-startup-
methodology/#gref
7. http://www.businessinsider.in/Whats-Lean-about-Lean-Startup/articleshow/53615661.cms
8. https://steveblank.com/tools-and-blogs-for-entrepreneurs/
9. https://hbr.org/2013/05/why-the-lean-start-up-changes-everything
10. chventures.blogspot.in/ platformsandnetworks.blogspot.in/p/saas-model.html

Mode of Evaluation: Assignments; Field Trips, Case Studies; e-learning; Learning through
research, TED Talks
Project
1. Project 60 hours
Total Project 60 hours
Recommended by Board of Studies 08-06-2015
Approved by Academic Council 37 Date 16-06-2015
Total Practical Hours 60 hours
Mode of evaluation: Mini Project, Flipped Class Room, Lecture, PPT‟s, Role play, Assignments
Class/Virtual Presentations, Report and beyond the classroom activities
Recommended by Board of Studies 22-07-2017
Approved by Academic Council No. 47 Date 24.08.2017
PHY1701 Engineering Physics L T P J C
3 0 2 0 4
Pre-requisite None Syllabus version
V.2.1
Course Objectives:
To enable the students to understand the basics of the latest advancements in Physics viz.,
Quantum Mechanics, Nanotechnology, Lasers, Electro Magnetic Theory and Fiber Optics.

Expected Course Outcome: Students will be able to

1. Comprehend the dual nature of radiation and matter.
2. Compute Schrodinger‟s equations to solve finite and infinite potential problems.
3. Analyze quantum ideas at the nanoscale.
4. Apply quantum ideas for understanding the operation and working principle ofoptoelectronic
devices.
5. Recall the Maxwell‟s equations in differential and integral form.
6. Design the various types of optical fibers for different Engineering applications.
7. Explain concept of Lorentz Transformation for Engineering applications.
8. Demonstrate the quantum mechanical ideas

Module:1 Introduction to Modern Physics 6 hours

Planck‟s concept (hypothesis), Compton Effect, Particle properties of wave: Matter Waves,
Davisson Germer Experiment, Heisenberg Uncertainty Principle, Wave function, and Schrodinger
equation (time dependent & independent).

Module:2 Applications of Quantum Physics 5 hours

Particle in a 1-D box (Eigen Value and Eigen Function), 3-D Analysis (Qualitative), Tunneling
Effect (Qualitative) (AB 205), Scanning Tunneling Microscope (STM).

Module:3 Nanophysics 5 hours

Introduction to Nano-materials, Moore‟s law, Properties of Nano-materials, Quantum confinement,
Quantum well, wire & dot, Carbon Nano-tubes (CNT), Applications of nanotechnology in
industry.

Module:4 Laser Principles and Engineering Application 6 hours

Laser Characteristics, Spatial and Temporal Coherence, Einstein Coefficient & its significance,
Population inversion, Two, three & four level systems, Pumping schemes, Threshold gain
coefficient, Components of laser, Nd-YAG, He-Ne, CO2 and Dye laser and their engineering
applications.

Module:5 Electromagnetic Theory and its application 6 hours

Physics of Divergence, Gradient and Curl, Qualitative understanding of surface and volume
integral, Maxwell Equations (Qualitative), Wave Equation (Derivation), EM Waves, Phase
velocity, Group velocity, Group index , Wave guide (Qualitative)

Module:6 Propagation of EM waves in Optical fibers and 10 hours

Optoelectronic Devices
Light propagation through fibers, Acceptance angle, Numerical Aperture, Types of fibers - step
index, graded index, single mode & multimode, Attenuation, Dispersion-intermodal and
intramodal. Sources-LED & Laser Diode, Detectors-Photodetectors- PN & PIN - Applications of
fiber optics in communication- Endoscopy.

Module:7 Special Theory of Relativity 5 hours

Frame of reference, Galilean relativity, Postulate of special theory of relativity, Simultaneity,
length contraction and time dilation.

Module:8 Contemporary issues: 2 hours

Total Lecture hours: 45 hours

Text Book(s)
1. Arthur Beiser et al., Concepts of Modern Physics, 2013, Sixth Edition, Tata McGraw Hill.
2. William Silfvast, Laser Fundamentals, 2008, Cambridge University Press.
3. D. J. Griffith, Introduction to Electrodynamics, 2014, 4th Edition, Pearson.
4. Djafar K. Mynbaev and Lowell L.Scheiner, Fiber Optic Communication Technology,
2011, Pearson
Reference Books
1. Raymond A. Serway, Clement J. Mosses, Curt A. Moyer Modern Physics, 2010, 3rd Indian
Edition Cengage learning.
2. John R. Taylor, Chris D. Zafiratos and Michael A. Dubson, Modern Physics for Scientists
and Engineers, 2011, PHI Learning Private Ltd.
3. Kenneth Krane Modern Physics, 2010, Wiley Indian Edition.
4. Nityanand Choudhary and Richa Verma, Laser Systems and Applications, 2011, PHI
5. Learning Private Ltd.
S. Nagabhushana and B. Sathyanarayana, Lasers and Optical Instrumentation, 2010, I.K.
6. International Publishing House Pvt. Ltd.,
7. R. Shevgaonkar, Electromagnetic Waves, 2005, 1st Edition, Tata McGraw Hill
8. Principles of Electromagnetics, Matthew N.O. Sadiku, 2010, Fourth Edition, Oxford.
Ajoy Ghatak and K. Thyagarajan, Introduction to Fiber Optics, 2010, Cambridge University
Press.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Experiments
1. Determination of Planck‟s constant using electroluminescence process 2 hrs
2. Electron diffraction 2 hrs
3. Determination of wavelength of laser source (He -Ne laser and diode lasers of 2 hrs
different wavelengths) using diffraction technique
4. Determination of size of fine particle using laser diffraction 2 hrs
5. Determination of the track width (periodicity) in a written CD 2 hrs
6. Optical Fiber communication (source + optical fiber + detector) 2 hrs
7. Analysis of crystallite size and strain in a nano -crystalline film using X-ray 2 hrs
diffraction
8. Numerical solutions of Schrödinger equation (e.g. particle in a box problem) 2 hrs
(can be given as an assignment)
9. Laser coherence length measurement 2 hrs
10. Proof for transverse nature of E.M. waves 2 hrs
11. Quantum confinement and Heisenberg's uncertainty principle 2 hrs
12. Determination of angle of prism and refractive index for various colour – 2 hrs
Spectrometer
13. Determination of divergence of a laser beam 2 hrs
14. Determination of crystalline size for nanomaterial (Computer simulation) 2 hrs
15. Demonstration of phase velocity and group velocity (Computer simulation) 2 hrs
Total Laboratory Hours 30 hrs
Mode of evaluation: CAT / FAT
Recommended by Board of Studies 04-06-2019
Approved by Academic Council No. 55 Date 13-06-2019
CSE1003 DIGITAL LOGIC AND DESIGN L T P J C
3 0 2 0 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. Introduce the concept of digital and binary systems.
2. Analyze and Design combinational and sequential logic circuits.
3. Reinforce theory and techniques taught in the classroom through experiments in the laboratory.

Expected Course Outcome:

1. Comprehend the different types of number system.
2. Evaluate and simplify logic functions using Boolean Algebra and K-map.
3. Design minimal combinational logic circuits.
4. Analyze the operation of medium complexity standard combinational circuits like theencoder,
decoder, multiplexer, demultiplexer.
5. Analyze and Design the Basic Sequential Logic Circuits
6. Outline the construction of Basic Arithmetic and Logic Circuits
7. Acquire design thinking capability, ability to design a component with realistic constraints, to
solve real world engineering problems and analyze the results.

Module:1 INTRODUCTION 3 hours

Number System - Base Conversion - Binary Codes - Complements(Binary and Decimal)

Module:2 BOOLEAN ALGEBRA 8 hours

Boolean algebra - Properties of Boolean algebra - Boolean functions - Canonical and Standard
forms - Logic gates - Universal gates – Karnaugh map - Don‟t care conditions - Tabulation
Method

Module:3 COMBINATIONAL CIRCUIT - I 4 hours

Adder - Subtractor - Code Converter - Analyzing a Combinational Circuit

Module:4 COMBINATIONAL CIRCUIT –II 6 hours

Binary Parallel Adder- Look ahead carry - Magnitude Comparator - Decoders – Encoders -
Multiplexers –Demultiplexers.

Module:5 SEQUENTIAL CIRCUITS – I 6 hours

Flip Flops - Sequential Circuit: Design and Analysis - Finite State Machine: Moore and Mealy
model - Sequence Detector.

Module:6 SEQUENTIAL CIRCUITS – II 7 hours

Registers - Shift Registers - Counters - Ripple and Synchronous Counters - Modulo counters -
Ring and Johnson counters

Module:7 ARITHMETIC LOGIC UNIT 9 hours

Bus Organization - ALU - Design of ALU - Status Register - Design of Shifter - Processor Unit -
Design of specific Arithmetic Circuits Accumulator - Design of Accumulator.

Module:8 Contemporary Issues: RECENT TRENDS 2 hours

 Total Lecture hours: 45 hours

Text Book(s)
1. M. Morris Mano and Michael D.Ciletti– Digital Design: With an introduction to Verilog
HDL, Pearson Education – 5th Edition- 2014. ISBN:9789332535763.
Reference Books
1. Peterson, L.L. and Davie, B.S., 2007. Computer networks: a systems approach. Elsevier.
2. Thomas L Floyd. 2015. Digital Fundamentals. Pearson Education. ISBN: 9780132737968
3. Malvino, A.P. and Leach, D.P. and Goutam Saha. 2014. Digital Principles and Applications
(SIE). Tata McGraw Hill. ISBN: 9789339203405.
4. Morris Mano, M. and Michael D.Ciletti. 2014. Digital Design: With an introduction to
Verilog HDL. Pearson Education. ISBN:9789332535763
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Realization of Logic gates using discrete components, verication of truth 4.5 hours
table for logic gates, realization of basic gates using NAND and NOR gates
Implementation of Logic Circuits by verification of Boolean laws 3 hours
and verification of De Morgans law
Adder and Subtractor circuit realization by implementation of Half-Adder 4.5 hours
and Full-Adder, and by implementation of Half-Subtractor and Full-
Subtractor
Combinational circuit design i. Design of Decoder and Encoder ii. Design of 4.5 hours
Multiplexer and De multiplexer iii. Design of Magnitude Comparator iv.
Design of Code Converter
Sequential circuit design i. Design of Mealy and Moore circuit ii. 4.5 hours
Implementation of Shift registers iii. Design of 4-bit Counter iv. Design of
Ring Counter
Implementation of different circuits to solve real world problems: 4.5 hours
A digitally controlled locker works based on a control switch and two keys
which are entered by the user. Each key has a 2-bit binary representation. If
the control switch is pressed, the locking system will pass the difference of
two keys into the controller unit. Otherwise, the locking system will pass the
sum of the two numbers to the controller unit. Design a circuit to determine
the input to the controller unit.
Implementation of different circuits to solve real world problems: 4.5 hours
A bank queuing system has a capacity of 5 customers which serves on first
come first served basis. A display unit is used to display the number of
customers waiting in the queue. Whenever a customer leaves the queue, the
count is reduced by one and the count is increased by one if a customer joins
a queue. Two sensors (control signals) are used to sense customers leaving
and joining the queue respectively. Design a circuit that displays the number
of customers waiting in the queue in binary format using LEDs. Binary 1 is
represented by LED glow and 0 otherwise.
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 28-02-2017
Approved by Academic Council No. 46 Date 24-08-2017
CSE1004 NETWORK AND COMMUNICATION L TP J C
3 0 2 0 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To build an understanding among students about the fundamental concepts of computer
networking, protocols, architectures, and applications.
2. To help students to acquire knowledge in design, implement and analyze performance of OSI
and TCP-IP based Architectures.
3. To implement new ideas in Networking through assignments.

Expected Course Outcome:

1. Interpret the different building blocks of Communication network and its architecture.
2. Contrast different types of switching networks and analyze the performance of network
3. Identify and analyze error and flow control mechanisms in data link layer
4. Design subnetting and analyze the performance of network layer
5. Construct and examine various routing protocols
6. Compare various congestion control mechanisms and identify appropriate Transport layer
protocol for real time applications
7. Identify the suitable Application layer protocols for specific applications and its respective
security mechanisms

Module:1 Networking Principles and layered 6 hours

architecture
Data Communications and Networking: A Communications Model – Data Communications -
Evolution of network, Requirements , Applications, Network Topology (Line configuration, Data
Flow), Protocols and Standards, Network
Models (OSI, TCP/IP)

Module:2 Circuit and Packet switching 7 hours

Switched Communications Networks – Circuit Switching – Packet Switching – Comparison of
Circuit Switching and Packet Switching – Implementing Network Software, Networking
Parameters(Transmission Impairment, Data Rate and Performance)

Module:3 Data Link Layer 10 hours

Error Detection and Correction – Hamming Code , CRC, Checksum- Flow control mechanism –
Sliding Window Protocol - GoBack - N - Selective Repeat - Multiple access Aloha - Slotted Aloha
- CSMA, CSMA/CD – Multiple Access Networks (IEEE 802.3), Token Ring(IEEE 802.5) and
Wireless Networks (IEEE 802.11, 802.15)

Module:4 Network Layer 6 hours

IPV4 Address Space – Notations – Classful Addressing – Classless Addressing – Network Address
Translation – IPv6 Address Structure – IPv4 and IPv6 header format.

Module:5 Routing Protocols 4 hours

Routing-Link State and Distance Vector Routing Protocols- Implementation-Performance
Analysis- Packet Tracer.

Module:6 Transport Layer 7 hours

TCP and UDP-Congestion Control-Effects of Congestion-Traffic Management-TCP Congestion
Control-Congestion Avoidance Mechanisms-Queuing Mechanisms-QoS Parameters

Module:7 Application Layer 3 hours

Application layer-Domain Name System-Case Study : FTP-HTTP-SMTP-SNMP

Module:8 Recent Trends in Network Security 2 hours

Total Lecture hours: 45 hours

Text Book(s)
1. Computer Networks: A Systems Approach, Larry Peterson and Bruce Davie, 5th Ed, The
Morgan Kaufmann Series, Elsevier, 2011.
2. Computer Networking: A Top-Down Approach Featuring the Internet, J.F. Kurose and
K.W.Ross, 6th Ed., Pearson Education, 2012.
Reference Books
1. Data Communications and Networking, Behrouz A. Forouzan, McGraw Hill Education, 5th
Ed., 2012.
2. TCP/IP Protocol Suite, Behrouz A. Forouzan, McGraw-Hill Education, 4 Ed., 2009.
3. Data and Computer Communications, William Stallings, Pearson Education, 10th Ed, 2013.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1 Demo session of all networking hardware and Functionalities 3 Hours
2 Network configuration commands using Linux 3 Hours
3 Error detection and correction mechanisms 3 Hours
4 Flow control mechanisms 3 Hours
5 IP addressing Classless addressing 3 Hours
6 Observing Packets across the network and Performance Analysis 3 Hours
of Routing protocols
7 Socket programming(TCP and UDP) Multi client chatting 3 Hours
8 Simulation of unicast routing protocols 3 Hours
9 Simulation of Transport layer Protocols and analysis of 3 Hours
congestion control techniques in network
10 Develop a DNS client server to resolve the given host name or IP address 3 Hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 28-02-2017
Approved by Academic Council No. 46 Date 24-08-2017
CSE1007 JAVA PROGRAMMING L T P J C
3 0 2 0 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To impart the core language features of Java and its Application Programming Interfaces
(API).
2. To demonstrate the use of threads, exceptions, files and collection frameworks in Java.
3. To familiarize students with GUI based application development anddatabase
connectivity.

Expected Course Outcome:

1. Comprehend Java Virtual Machine architecture and Java Programming Fundamentals.
2. Design applications involving Object Oriented Programming concepts such as inheritance,
association, aggregation, composition, polymorphism, abstract classes and interfaces.
3. Design and build multi-threaded Java Applications.
4. Build software using concepts such as files, collection frameworks and containers.
5. Design and implement Java Applications for real world problems involving Database
Connectivity.
6. Design Graphical User Interface using JavaFX.
7. Design, Develop and Deploy dynamic web applications using Servlets and Java Server
Pages.

Module:1 Java Fundamentals 4 hours

Java Basics: Java Design goal - Features of Java Language - JVM - Bytecode - Java source file
structure basic programming constructs Arrays one dimensional and multi-dimensional enhanced
for loop String package

Module:2 Object Oriented Programming 5 hours

Class Fundamentals - Object Object reference array of objects constructors methods over- loading
this reference static block - nested class inner class garbage collection finalize() Wrapper classes
Inheritance types - use of super - Polymorphism abstract class interfaces packages and sub
packages.

Module:3 Robustness and Concurrency 6 hours

Exception Handling - Exceptions Errors - Types of Exception - Control Flow in Exceptions
- Use of try, catch, finally, throw, throws in Exception Handling - user defined exceptions -
Multithreading Thread creation sharing the workload among threads synchronization inter thread
communication deadlock.

Module:4 Files, Streams and Object serialization 7 hours

Data structures: Java I/O streams Working with files Serialization and deserialization of objects
Lambda expressions, Collection framework List, Map, Set Generics Annotations

Module:5 GUI Programming and Database 7 hours

Connectivity
GUI programming using JavaFX, exploring events, controls and JavaFX menus Accessing
databases using JDBC connectivity.
Module:6 Servlet 7 hours
Introduction to servlet - Servlet life cycle - Developing and Deploying Servlets - Exploring
Deployment Descriptor (web.xml) - Handling Request and Response - Session Tracking Man-
agement.

Module:7 Java Server Pages 7 hours

JSP Tags and Expressions - JSP Expression Language (EL) - Using Custom Tag - JSP with Java
Bean.

Module:8 Latest Trends 2 hours

Industry Expert talk

Total Lecture hours: 45 hours

Text Book(s)
1. Herbert Schildt, The Complete Reference -Java, Tata McGraw-Hill Education, Tenth
Edition, 2017.
2. Paul J. Deitel, Harvey Deitel ,Java SE8 for Programmers (Deitel Developer Series) 3rd
Edition, 2014
3. Y. Daniel Liang, Introduction to Java programming-comprehensive version-Tenth Edition,
Pearson ltd 2015
Reference Books
1. Paul Deitel Harvey Deitel ,Java, How to Program, Prentice Hall; 9th edition , 2011.
2. Cay Horstmann BIG JAVA, 4th edition, John Wiley Sons,2009
3. Nicholas S. Williams, Professional Java for Web Applications, Wrox Press, 2014.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Write a program to demonstrate the use of multidimensional arrays and 2 hours
looping constructs.
2. Write a program to demonstrate the application of String handling 2 hours
functions.
3. Write a program to demonstrate the use of Inheritance. 2 hours
4. Write a program to demonstrate the application of user-defined packages 2 hours
and sub-packages.
5. Write a program to demonstrate the use of Java Exception handling 2 hours
methods.
6. Write a program to demonstrate the use of threads in Java. 2 hours
7. Demonstrate with a program the use of File handling methods in Java. 2 hours
8. Demonstrate the use of Java collection frameworks in reducing application 2 hours
development time.
9. Build a GUI application using JavaFX 2 hours
10. Write a program to register students data using JDBC with MySQL 2 hours
Database.
11. Write a program that uses Servlets to perform basic banking tasks. 2 hours
12. Write a web application using JSP and demonstrate the use of http request 2 hours
and response methods.
13. Write a JSP program for an order management system. 2 hours
14. Write a JSP program that using JDBC and MySQL database to store the 2 hours
user data.
15. JSP with Java Bean 2 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 10-08-2018
Approved by Academic Council No. 52 Date 14-09-2018
CSE2001 COMPUTER ARCHITECTURE AND ORGANIZATION L T P J C
3 0 0 0 3
Pre-requisite CSE1003 Digital Logic Design Syllabus version
v1.0
Course Objectives:
1. To acquaint students with the basic concepts of fundamental component, architecture,
register organization and performance metrics of a computer.
2. To impart the knowledge of data representation in binary and understand implementation
of arithmetic algorithms in a typical computer.
3. To teach students how to describe machine capabilities and design an effective data path
design for instruction execution. To introduce students to syntax and semantics ofmachine
level programming.
4. To make students understand the importance of memory systems, IO interfacing
techniques and external storage and their performance metrics for a typical computer. And
explore various alternate techniques for improving the performance of a processor.

Expected Course Outcome:

1. Differentiate Von Neumann, Harvard, and CISC and RISC architectures. Analyze the
performance of machines with different capabilities.
2. Illustrate binary format for numerical and characters. Validate efficient algorithmfor
arithmetic operations.
3. Construct machine level program for given expression on n-address machine. Analyze and
calculate memory traffic for a program execution. Design an efficient data path for an
instruction format for a given architecture.
4. Explain the importance of hierarchical memory organization. Able to construct larger
memories. Analyze and suggest efficient cache mapping technique and replacement
algorithms for given design requirements. Demonstrate hamming code for errordetection
and correction.
5. Understand the need for an interface. Compare and contrast memory mapping and IO
mapping techniques. Describe and Differentiate different modes of data transfer. Appraise
the synchronous and asynchronous bus for performance and arbitration.
6. Understand the structure and read write mechanisms for different storage systems.
Illustrate and suggest appropriate use of RAID levels. Assess the performance of IO and
external storage systems.
7. Classify parallel machine models. Illustrate typical 6-stage pipeline foroverlapped
execution. Analyze the hazards and solutions.

Module:1 Introduction and overview of computer 3 hours

architecture
Introduction to computer systems - Overview of Organization and Architecture -Functional
components of a computer -Registers and register files-Interconnection of components-
Organization of the von Neumann machine and Harvard architecture-Performance of processor

Module:2 Data Representation And Computer 6 hours

Arithmetic
Fixed point representation of numbers-algorithms for arithmetic operations: multiplication
(Booths, Modified Booths) - division (restoring and non-restoring) - Floating point representation
with IEEE standards and algorithms for common arithmetic operations- Representation of non-
numeric data (character codes).
Module:3 Fundamentals of Computer Architecture 11 hours
Introduction to ISA (Instruction Set Architecture)-Instruction formats- Instruction types and
addressing modes- Instruction execution (Phases of instruction cycle)- Assembly language
programming-Subroutine call and return mechanisms-Single cycle Data path design-Introduction
to multi cycle data path-Multi cycle Instruction execution.

Module:4 Memory System Organization and 9 hours

Architecture
Memory systems hierarchy-Main memory organization-Types of Main memory-memory inter-
leaving and its characteristics and performance- Cache memories: address mapping-line size-
replacement and policies- coherence- Virtual memory systems- TLB- Reliability of memory
systems- error detecting and error correcting systems.

Module:5 Interfacing and Communication 7 hours

I/O fundamentals: handshaking, buffering-I/O techniques: programmed I/O, interrupt-driven I/O,
DMA- Interrupt structures: vectored and prioritized-interrupt overhead- Buses: Syn- chronous and
asynchronous- Arbitration.

Module:6 Device Subsystems 4 hours

External storage systems-organization and structure of disk drives: Electronic- magnetic and
optical technologies- RAID Levels- I/O Performance

Module:7 Performance Enhancements 4 hours

Classification of models - Flynns taxonomy of parallel machine models ( SISD, SIMD, MISD,
MIMD)- Introduction to Pipelining- Pipelined data path-Introduction to hazards

Module:8 Contemporary issues: Recent Trends 1 hour

Multiprocessor architecture: Overview of Shared Memory architecture, Distributed architecture.

Total Lecture hours: 45 hours

Text Book(s)
1. David A. Patterson and John L. Hennessy Computer Organization and Design-The
Hardware/Software Interface 5th edition, Morgan Kaufmann, 2013.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer organization, Mc Graw Hill,
Fifth edition, Reprint 2011.
Reference Books
1. W. Stallings, Computer organization and architecture, Prentice-Hall, 8th edition, 2013
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
CSE2004 DATABASE MANAGEMENT SYSTEM L T P J C
2 0 2 4 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To understand the concept of DBMS and ER Modeling.
2. To explain the normalization, Query optimization and relational algebra.
3. To apply the concurrency control, recovery, security and indexing for the real time data.

Expected Course Outcome:

1. Explain the basic concept and role of DBMS in an organization.
2. Illustrate the design principles for database design, ER model and normalization.
3. Demonstrate the basics of query evaluation and heuristic query optimizationtechniques.
4. Apply Concurrency control and recovery mechanisms for the desirable database problem.
5. Compare the basic database storage structure and access techniques including B Tree, B+
Tress and hashing.
6. Review the fundamental view on unstructured data and its management.
7. Design and implement the database system with the fundamental concepts of DBMS.

Module:1 DATABASE SYSTEMS CONCEPTS AND 5 hours

ARCHITECTURE
History and motivation for database systems -characteristics of database approach - Actors on the
scene - Workers behind the scene - Advantages of using DBMS approach– Data Models,
Schemas, and Instances– Three-Schema Architecture and Data Independence– The Database
System Environment– Centralized and Client/Server Architectures for DBMSs– Classification of
database management systems.

Module:2 DATA MODELING 4 hours

Entity Relationship Model : Types of Attributes, Relationship, Structural Constraints - Relational
Model, Relational model Constraints - Mapping ER model to a relational schema - Integrity
constraints

Module:3 SCHEMA REFINEMENT 6 hours

Guidelines for Relational Schema – Functional dependency; Normalization, Boyce Codd Normal
Form, Multi-valued dependency and Fourth Normal form; Join dependency and Fifth Normal
form.

Module:4 QUERY PROCESSING AND 5 hours

TRANSACTION PROCESSING
Translating SQL Queries into Relational Algebra - heuristic query optimization - Introduction to
Transaction Processing - Transaction and System concepts – Desirable properties of Transactions
- Characterizing schedules based on recoverability - Characterizing schedules based on
serializability

Module:5 CONCURRENCY CONTROL AND 4 hours

RECOVERY TECHNIQUES
Two-Phase Locking Techniques for Concurrency Control – Concurrency Control based on
timestamp – Recovery Concepts – Recovery based on deferred update – Recovery techniques
based on immediate update - Shadow Paging.
Module:6 PHYSICAL DATABASE DESIGN 3 hours
Indexing: Single level indexing, multi-level indexing, dynamic multilevel Indexing

Module:7 RECENT TRENDS - NOSQL 3 hours

DATABASE MANAGEMENT
Introduction, Need of NoSQL, CAP Theorem, different NoSQL data models: Key-value stores,
Column families, Document databases, Graph databases
Total Lecture hours: 30 hours
Text Book(s)
1. R. Elmasri S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 2015
2. Raghu Ramakrishnan,Database Management Systems,Mcgraw-Hill,4th edition,2015.
Reference Books
1. A. Silberschatz, H. F. Korth S. Sudershan, Database System Concepts, McGraw Hill, 6th
Edition 2010.
2. Thomas Connolly, Carolyn Begg, Database Systems: A Practical Approach to Design,
Implementation and Management,6th Edition,2012.
3. Pramod J. Sadalage and Marin Fowler, NoSQL Distilled: A brief guide to merging world of
Polyglot persistence, Addison Wesley, 2012.
4. Shashank Tiwari ,Professional NoSql,Wiley ,2011
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. DDL and DML 3 hours
2. Single row and aggregate functions 3 hours
3. Joins and Sub queries 3 hours
4. Anonymous blocks and control structures 3 hours
5. Iterations 3 hours
6. Cursors 3 hours
7. Functions and Procedures 3 hours
8. Exception Handling and triggers 3 hours
9. DBA Concepts 3 hours
10. XML, DTD, XQuery Representations 3 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
Course code Course Title L T P J C
CSE2005 OPERATING SYSTEMS 3 0 2 0 4
Pre-requisite Nil Syllabus version
v.x.x
Course Objectives:
1. To introduce the operating system concepts, designs and provide skills required to
implement the services.
2. To describe the trade-offs between conflicting objectives in large scale system design.
3. To develop the knowledge for application of the various design issues and services.

Expected Course Outcome:

1. Interpret the evolution of OS functionality, structures and layers.
2. Apply various types of system calls and to find the stages of various process states.
3. Design a model scheduling algorithm to compute various scheduling criteria.
4. Apply and analyze communication between inter process and synchronization techniques.
5. Implement page replacement algorithms, memory management problems and
segmentation.
6. Differentiate the file systems for applying different allocation and access techniques.
7. Representing virtualization and demonstrating the various Operating system tasks and the
principle algorithms for enumerating those tasks.

Module:1 Introduction 3 hours CO:1

Introduction to OS: Functionality of OS - OS design issues - Structuring methods (monolithic,
layered, modular, micro-kernel models) - Abstractions, processes, resources - Influence of security,
networking, and multimedia.

Module:2 OS Principles 4 hours CO:2

System calls, System/Application Call Interface – Protection: User/Kernel modes - Interrupts -
Processes - Structures (Process Control Block, Ready List etc.), Process creation, management in
Unix – Threads: User level, kernel level threads and thread models.

Module:3 Scheduling 9 hours CO:3

Processes Scheduling - CPU Scheduling: Pre-emptive, non-pre-emptive - Multiprocessor
scheduling – Deadlocks - Resource allocation and management - Deadlock handling mechanisms:
prevention, avoidance, detection, recovery.

Module:4 Concurrency 8 hours CO:4

Inter-process communication, Synchronization - Implementing synchronization primitives
(Peterson‘s solution, Bakery algorithm, synchronization hardware) - Semaphores – Classical
synchronization problems, Monitors: Solution to Dining Philosophers problem – IPC in Unix,
Multiprocessors and Locking - Scalable Locks - Lock-free coordination.

Module:5 Memory Management 7 hours CO:5

Main memory management, Memory allocation strategies, Virtual memory: Hardware support for
virtual memory (caching, TLB) – Paging - Segmentation - Demand Paging - Page Faults - Page
Replacement -Thrashing - Working Set.

Module:6 Virtualization and File System 6 hours CO:7

Management
Virtual Machines - Virtualization (Hardware/Software, Server, Service, Network - Hypervisors -
Container virtualization - Cost of virtualization - File system interface (access methods, directory
structures) - File system implementation (directory implementation, file allocation methods) - File
system recovery - Journaling - Soft updates - Log-structured file system - Distributed file system.

Module:7 Storage Management, Protection and 6 hours CO:6

Security
Disk structure and attachment – Disk scheduling algorithms (seek time, rotational latency based)-
System threats and security – Policy vs mechanism - Access vs authentication - System protection:
Access matrix – Capability based systems - OS: performance, scaling, future directions in mobile
OS.

Module:8 Recent Trends 2 hours CO:7

Total Lecture hours: 45 hours

Text Book(s)
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne-Operating System
Concepts, Wiley (2018).
Reference Books
1. Ramez Elmasri, A.Gil Carrick, David Levine, Operating Systems, A Spiral Approach -
McGrawHill Higher Education (2010).
2. Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Operating Systems, Three Easy
Pieces, Arpaci-Dusseau Books, Inc (2015).
3. Andrew S. Tanenbaum, Modern Operating Systems, Pearson, 4th Edition (2016).

4. William Stallings, Operating Systems: Internals and Design Principles, Pearson, 9th Edition (2018).

Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar

List of Experiments
1. Design a boot loader - to load a particular OS say TinyOS/ KolibriOS image - 3 hours
code to access from BIOS to loading the OS - involves little assembly code may
use QEMU/virtual machines for emulation of hardware.
2. Allocate/free memory to processes in whole pages, find max allocatable pages, 3 hours
incorporate address translation into the program.
3. Create an interrupt to handle a system call and continue the previously running 3 hours
process after servicing the interrupt.
4. Write a Disk driver for the SATA interface. Take care to check readiness of the 3 hours
controller, locked buffer cache, accept interrupts from OS during the period,
interrupting the OS again once done and clearing buffers.
5. Demonstrate the use of locks in conjunction with the IDE driver. 3 hours
6. Run an experiment to determine the context switch time from one process to 3 hours
another and one kernel thread to another. Compare the findings
7. Determine the latency of individual integer access times in main memory, L1 3 hours
Cache and L2 Cache. Plot the results in log of memory accessed vs average
latency.
8. Compare the overhead of a system call with a procedure call. What is the cost of 3 hours
a minimal system call?
9. Compare the task creation times. Execute a process and kernel thread, determine 3 hours
the time taken to create and run the threads.
10. Determine the file read time for sequential and random access based of varying 3 hours
sizes of the files. Take care not to read from cached data - used the raw device
interface. Draw a graph log/log plot of size of file vs average per-block time.
Total Laboratory Hours 30 hours
Mode of evaluation: Project/Activity
Recommended by Board of Studies 09-09-2020
Approved by Academic Council No. 59 Date 24-09-2020
Course code Data Structures and Algorithms L T P J C
CSE2011 3 0 2 0 4
Pre-requisite Nil Syllabus version
v. xx.xx
Course Objectives:
1. To understand the basic concepts of data structures and algorithms.
2. To differentiate linear and non-linear data structures and the operations upon them.
3. Ability to perform sorting and searchingin a given set ofdata items.
4. To comprehend the necessity of time complexity in algorithms.

Expected Course Outcome:

1. Understanding the fundamental analysis and time complexity for a given problem.
2. Articulate linear data structures and legal operations permitted on them.
3. Articulate non-linear data structures and legal operations permitted on them.
4. Applyinga suitable algorithm for searching and sorting.
5. Understanding graph algorithms, operations, and applications.
6. Understanding the importance of hashing.
7. Applying the basic data structures to understand advanced data structure operations and
applications.
8. Application ofappropriate data structures to find solutions to practical problems.

Module:1 Introduction to Algorithms and Analysis 6 hours CO:1

Overview and importance of algorithms and data structures. Fundamentals of algorithm analysis,
Space and time complexity of an algorithm, Types of asymptotic notations and orders of growth,
Algorithm efficiency – best case, worst case, average case, Analysis of non-recursive and recursive
algorithms, Asymptotic analysis for recurrence relation – Recursive Tree Method.

Module:2 Linear Data Structures 8 hours CO: 2,8

Array- 1D and 2D array , Stack - Applications of stack: Expression Evaluation - Conversion of
Infix to postfix and prefix expression, Tower of Hanoi.
Queue - Types of Queue: Circular Queue, Double Ended Queue (deQueue), Applications – Priority
Queue using Arrays - List - Singly linked lists – Doubly linked lists - Circular linked lists,
Applications -Polynomial Manipulation - Josephus problem(permutation)

Module:3 Sorting and Search Techniques 8 hours CO:4,8

Searching - Linear Search and binary search, Applications - Finding square root of ‗n‘-Longest
Common Prefix
Sorting – Insertion sort - Selection sort – Bubble sort – (Counting Sort) - Quick sort- Merge sort ,
Analysis, Applications - Finding the ‗n‘ closest pair‘s

Module:4 Non-linear Data Structures - Trees 6 hours CO:5,8

Tree - Terminology, Binary Tree – Terminology and Properties, Tree Traversals, Expression Trees –
Binary Search Trees – operations in BST – insertion, deletion, finding min and max, Finding the kth
minimum element in a BST, Applications – Dictionary

Module:5 Non-linear Data Structures - Graphs 6 hours CO:3,8

Graph – basic definition and Terminology – Representation of Graph – Graph Traversal: Breadth First
Search (BFS), Depth First Search (DFS) - Minimum Spanning Tree: Prim's, Kruskal's- Single Source
Shortest Path: Dijkstra‘s Algorithm.

Module:6 Hashing 4 hours CO:6,8

Hash functions, open hashing-separate chaining, closed hashing - linear probing, quadratic probing,
double hashing, random probing, rehashing, extendible hashing, Applications – Dictionary-
Telephone directory

Module:7 Heaps and Balanced Binary Search Trees 5 hours CO:7,8

Heaps - Heap sort, Applications -Priority Queue using Heaps
AVL trees – Terminology - basic operations(rotation, insertion and deletion

Module:8 Recent Trends 2 hours CO:8

Recent trends in algorithms and data structures
Total Lecture hours: 45 hours

Text Book(s)
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms ,
Third edition, MIT Press, 2009.

2 Mark A. Weiss,Data Structures & Algorithm Analysis in C++, 3rd edition, 2008, PEARSON.

Reference Books
1. Kurt Mehlhorn, and Peter Sanders – Algorithms and Data Sturctures The Basic Toolbox,
Springer-Verlag Berlin Heidelberg, 2008.
2. Horowitz, Sahni, and S. Anderson-Freed , Fundamentals of Data Structures in C
UNIVERSITIES PRESS,Second Edition,2008.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Experiments (Indicative) CO:3,4,5
1. Implementation of Stack and its applications 4 hours
2. Implementation of queue and its applications 4 hours
3. Linked List 4 hours
4. Searching algorithm 2 hours
5. Sorting algorithm – insertion, bubble, selection etc. 2 hours
6. Randomized Quick sort and merge sort 2 hours
7. Binary Tree traversals 2 hours
8. Binary search tree 2 hours
9. DFS, BFS 3 hours
10. Minimum Spanning Tree – Prim‘s and Kruskal‘s 3hours
11. Single source shortest path algorithm – Connected Components and finding 2 hours
a cycle in a graph
Total Laboratory Hours 30 hours
Mode of evaluation:
Recommended by Board of Studies 09-09-2020
Approved by Academic Council No. 59 Date 24-09-2020
Course code Design and Analysis of Algorithms L T P J C
CSE2012 3 0 2 0 4
Pre-requisite CSE2011 – Data Structures and Algorithms Syllabus version
v. xx.xx
Course Objectives:
1. To provide a mathematical foundation for analyzing and proving the efficiency of an
algorithm.
2. To focus on the design of algorithms in various domains of computer engineering.
3. To provide familiarity with main thrusts of work in algorithms sufficient to give some
context for formulating and seeking known solutions to an algorithmic problem.

Expected Course Outcome:

1. Ability to use mathematical tools to analyze and derive the running time of
algorithms and prove the correctness.
2. Explain and apply the major algorithm design paradigms.
3. Explain the major graph algorithms and their analyses.
4. Explain the major String Matching algorithms and their analysis.
5. Explain the major Computational Geometry algorithms and their analysis.
6. Provide algorithmic solutions to real-world problem from various domains.
7. Explain the hardness of real world problems with respect to algorithmic efficiency and
learning to cope with it.

Module:1 Algorithm Development 4 hours CO: 1

Stages of algorithm development for solving a problem: Describing the problem, Identifying a
suitable technique, Design of an algorithm, Proof of Correctness of the algorithm.

Module:2 Algorithm Design Techniques 10 hours CO: 2

Brute force techniques – Travelling Salesman Problem, Divide and Conquer - Finding a maximum
and minimum in a given array -Matrix multiplication: Strassen‘s algorithm, Greedy techniques
Huffman Codes and Data Compression -Fractional Knapsack problem, Dynamic programming - O/1
Knapsack problem-Matrix chain multiplication, LCS, Travelling Salesman Problem, Backtracking-
N-Queens Problem, Knights Tour on Chess Board.

Module:3 String Matching Algorithms 5 hours CO:1,4

Naïve String matching Algorithms, KMP algorithm, Rabin-Karp Algorithm
Module:4 Computational Geometry Algorithms 5 hours CO:1,5
Line Segments – properties, intersection; Convex Hull finding algorithms- Graham‘s Scan, Jarvis‘s
March Algorithm.

Module:5 Graph Algorithms 6 hours CO:1,3

All pair shortest path – Floyd-Warshall Algorithm. Network Flows - Flow Networks, Maximum
Flows – Ford-Fulkerson Algorithm, Push Re-label Algorithm, Minimum Cost Flows – Cycle
Cancelling Algorithm.

Module:6 Complexity Classes 7 hours CO:1,6

The Class P, The Class NP, Reducibility and NP-completeness – SAT (without proof), 3-SAT,
Vertex Cover, Independent Set, Maximum Clique.

Module:7 Approximation and Randomized Algorithms 6 hours CO:7

Approximation Algorithms - The set-covering problem – Vertex cover, K-center clustering.
Randomized Algorithms - The hiring problem, Finding the global Minimum Cut

Module:8 Recent Trends 2 hours CO:7

Total Lecture hours: 45 hours

Text Book(s)
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms ,
Third edition, MIT Press, 2009.

Reference Books
1. Jon Kleinberg, ÉvaTardos ,Algorithm Design, Pearson education, 2014
2. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, ―Network Flows: Theory,
Algorithms, and Applications‖, Pearson Education, 2014.

Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar

Assignment: Exploring Finite Automata and String Matching
List of Experiments ( Indicative) Total Hours: 30
1. Design and implement an algorithm that multiplies two 'n'
digit numbers faster than O(n3).

2. Design and implement an algorithm that will find the top and
the least scores of students from an online Quiz. Note: The
scores are stored in an array.

3. Design a solution for an Airline Customer on what to leave

behind and what to carry based on cabin baggage weight limits.
The Customer has to pack as many items as the limit allows
while maximizing the total worth. The data can be shared in a
CSV File.

1. Assume you have an unparenthesized arithmetic expression

with only + and - operators. You can change the value of
expression by parenthesizing at different positions. To keep it
simple, assume that parenthesis occur only before or
immediately after operands and not operators. Design an
algorithm that can take a maximum possible value the
expression can take in after adding the parenthesis.

2. About 14 historic sites in Tamilnadu is shown in

https://www.google.com/maps/search/historic+sites+in+tamilna
du/@10.7929896,78.2883573,7z/data=!3m1!4b1

Design a solution that identifies the shortest possible routes for

a traveler to visit these sites.

3. Design a solution to see if a content C = PGGA is plagiarized

in Text T = SAQSPAPGPGGAS.

4. You can find the schematics of Delhi Art Gallery (Ground

Floor) in:
https://www.archdaily.com/156154/delhi-art-gallery-re-design-
vertex-design/50151feb28ba0d02f0000302-delhi-art-gallery-re-
design-vertex-design-first-floor-plan
Design a model to install fewest possible Closed Circuit
Cameras covering all hallways and turns.

5. A maze has to be created and path has to be displayed which

will be taken by the rat by using backtracking concept.

6. Consider x=aabab and y=babb. Each insertion and deletion

has a unit 1) cost where as a change costs 2 units. Find a
minimum cost edit sequence that transforms x into y by using
suitable algorithm design technique.
7. Implement N-Queens problem and analyse its time
complexity using backtracking.

8. Write a program to find all the Hamiltonian cycles in a

connected undirected graph G(V,E) using backtracking

9. Design and implement a solution to find a subset of a given

set S = {Sl, S2,. ... ,Sn} of n positive integers whose SUM is
equal to a given positive integer d. For example, if S ={1, 2, 5,
6, 8} and d= 9,there are two solutions {1,2,6}and {1,8}.
Display a suitable message, if the given problem instance
doesn't have a solution.
Mode of evaluation:
Recommended by Board of Studies 09-09-2020
Approved by Academic Council No. 59 Date 24-09-2020
Course code Theory of Computation L T P J C
CSE2013 3 0 0 0 3
Pre-requisite Syllabus version
v. xx.xx
Course Objectives:
The objectives of this course are to learn
1. Types of grammars and models of automata.
2. Limitation of computation: What can be and what cannot be computed.
3. Establishing connections among grammars, automata and formal languages.

Expected Course Outcome:

After successfully completing the course the student should be able to
1.Compare and analyze different computational models
2. Apply rigorously formal mathematical methods to prove properties of languages, grammars and
automata.
3. Identify limitations of some computational models and possible methods of proving them.

Module:1 Introduction to Languages and Grammars 4 hours CO: 1

Recall on Proof techniques in Mathematics -Overview of a Computational Models - Languages
and Grammars - Alphabets - Strings - Operations on Languages, Overview on Automata

Module:2 Finite State Automata 8 hours CO: 2

Finite Automata (FA) - Deterministic Finite Automata (DFA) - Non-deterministic Finite Automata
(NFA) - NFA with epsilon transitions – NFA without epsilon transition, conversion of NFA to
DFA, Equivalence of NFA and DFA – minimization of DFA

Module:3 Regular Expressions and Languages 7 hours CO: 2

Regular Expression - FA and Regular Expressions: FA to regular expression and regular
expression to FA- - Pattern matching and regular expressions - Regular grammar and FA-
Pumping lemma for regular languages - Closure properties of regular languages.

Module:4 Context Free Grammars 7 hours CO: 3

Context-Free Grammar (CFG) – Derivations- Parse Trees - Ambiguity in CFG - CYK algorithm –
Simplification of CFG – Elimination of Useless symbols, Unit productions, Null productions -
Normal forms for CFG: CNF and GNF - Pumping Lemma for CFL - Closure Properties of CFL

Module:5 Pushdown Automata 5 hours CO: 2

Definition of the Pushdown automata - Languages of a Pushdown automata – Power of Non-
Deterministic Pushdown Automata and Deterministic pushdown automata
Module:6 Turing Machine 6 hours CO: 3
Turing Machines as acceptor and transducer - Multi head and Multi tape Turing Machines –
Universal Turing Machine - The Halting problem - Turing-Church thesis

Module:7 Recursive and Recursively Enumerable Languages 6 hours CO: 3

Recursive and Recursively Enumerable Languages, Language that is not Recursively Enumerable
(RE) – computable functions – Chomsky Hierarchy – Undecidable problems - Post‘s
Correspondence Problem

Module:8 Recent Trends 2 hours CO: 3

Total Lecture hours: 45 hours

Text Book(s)
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, ―Introduction to Automata Theory, Languages
and Computation‖, Third Edition, Pearson Education, India 2008. ISBN: 978-8131720479
2. Peter Linz, ―An Introduction to Formal Languages and Automata‖, Sixth Edition, Jones &
Bartlett, 2016. ISBN: 978-9384323219

Reference Books
1. K. Krithivasan and R. Rama, ―Introduction to Formal Languages, Automata and Computation‖, Pearson
Education, 2009. ISBN: 978-8131723562
2. Michael Sipser, Introduction of the Theory and Computation, Cengage; 3rd edition, 2014, ISBN: 978-
8131525296
3. Dexter C. Kozen, ―Automata and Computability‖, Springer; Softcover reprint of the original 1st ed. 1997
edition. 2012
4. John C Martin, ―Introduction to Languages and the Theory of Computation‖, McGraw Hill Publishing
Company, Fourth Edition, 2011.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
Mode of assessment:
Recommended by Board of Studies 09-09-2020
Approved by Academic Council No. 59 Date 24-09-2020
 CSE3002 INTERNET AND WEB PROGRAMMING L T P J C
2 0 2 4 4
Pre-requisite CSE2004-Database Management System Syllabus version
v1.0
Course Objectives:
1. To comprehend and analyze the basic concepts of web programming and internet
protocols.
2. To describe how the client-server model of Internet programming works.
3. To demonstrates the uses of scripting languages and their limitations.

Expected Course Outcome:

After successfully completing the course the student should be able to
1. Differentiate web protocols and web architecture.
2. Apply JavaScript, HTML and CSS effectively to create interactive and dynamic websites.
3. Implement client side scripting using JavaScript.
4. Develop applications using Java.
5. Implement server side script using PHP, JSP and Servlets.
6. Develop XML based web applications.
7. Develop application using recent environment like Node JS, Angular JS, JSON and AJAX.

Module:1 INTRODUCTION TO INTERNET 2 hours

Internet Overview- Networks - Web Protocols –– Web Organization and Addressing - Web
Browsers and Web Servers -Security and Vulnerability-Web System Architecture – URL -
Domain Name – Client-side and server-side scripting.

Module:2 WEB DESIGNING 4 hours

HTML5 – Form elements, Input types and Media elements, CSS3 - Selectors, Box Model,
Backgrounds and Borders, Text Effects, Animations, Multiple Column Layout, User Interface.

Module:3 CLIENT-SIDE PROCESSING AND 7 hours

SCRIPTING
JavaScript Introduction –Functions – Arrays – DOM, Built-in Objects, Regular Expression,
Exceptions, Event handling, Validation- AJAX - JQuery.

Module:4 SERVER SIDE PROCESSING AND 5 hours

SCRIPTING - PHP
Introduction to PHP – Operators – Conditionals – Looping – Functions – Arrays- Date and Time
Functions – String functions - File Handling - File Uploading – Email Basics - Email with
attachments.

Module:5 PHP SESSION MANAGEMENT and 3 hours

DATABASE CONNECTIVITY
Sessions-Cookies-MySQL Basics – Querying single and multiple MySQL Databases with PHP –
PHP Data Objects.

Module:6 XML 4 hours

XML Basics – XSL, XSLT, XML Schema-JSON.
Module:7 APPLICATION DEVELOPMENT 4 hours
USING NODE JS
Introduction to Node.js- Installing Node.js - Using Events, Listeners, Timers, and Callbacks in
Node.js – Introduction to Mongo DB- Accessing MongoDB from Node.js.

Module:8 Industry Expert Talk 1 hour

Total Lecture hours: 30 hours

Text Book(s)
1. Paul Deitel, Harvey Deitel, Abbey Deitel, Internet & World Wide Web - How to Program,
5th edition, Pearson Education, 2012.
2. Kogent Learning Solutions Inc, Web Technologies Black Book, Dream Tech press, 2013.
3. Brad Dayley, Brendan Dayley, and Caleb Dayley , Node.js, MongoDB and Angular Web
Development: The definitive guide to using the MEAN stack to build web applications,
2nd Edition, Pearson Education, 2018
Reference Books
1. Lindsay Bassett, Introduction to JavaScript Object Notation, 1st Edition, O‟Reilly Media,
2015
2. Fritz Schneider, Thomas Powell , JavaScript – The Complete Reference, 3rd Edition, Mc-
Graw Hill, 2017
3. Steven Holzener , PHP – The Complete Reference, 1st Edition, Mc-Graw Hill, 2017
4. Sandeep Kumar Patel, Developing Responsive Web Applications with AJAX and JQuery,
Packt Publications, 2014
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. HTML basic tags, HTML forms, table, list, HTML frames and CSS 4 hours
internal, external and inline
2. JavaScript validation, DOM and Ajax 6 hours
3. Java, Servlet and JSP 8 hours
4. PHP : Forms and File handling, Session Management and Cookies, 8 hours
Databases
5. XML 4 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 19-11-2018
Approved by Academic Council No. 53 Date 13-12-2018
EEE1001 Basic Electrical and Electronics Engineering L T P J C
2 0 2 0 3
Pre-requisite NIL Syllabus version
v. 1.0
Course Objectives:
1. To understand the various laws and theorems applied to solve electric circuits and networks
2. To provide the students with an overview of the most important concepts in Electrical and
Electronics Engineering which is the basic need for every engineer

Expected Course Outcome:

1. Solve basic electrical circuit problems using various laws and theorems
2. Analyze AC power circuits and networks, its measurement and safety concerns
3. Classify and compare various types of electrical machines
4. Design and implement various digital circuits
5. Analyze the characteristics of semiconductor devices and comprehend the variousmodulation
techniques in communication engineering
6. Design and conduct experiments to analyze and interpret data

Module:1 DC circuits 5 hours

Basic circuit elements and sources, Ohms law, Kirchhoff‟s laws, series and parallel connection of
circuit elements, Node voltage analysis, Mesh current analysis, Thevenin's and Maximum power
transfer theorem

Module:2 AC circuits 6 hours

Alternating voltages and currents, AC values, Single Phase RL, RC, RLC Series circuits, Power
in AC circuits-Power Factor- Three Phase Systems – Star and Delta Connection- Three Phase
Power Measurement – Electrical Safety –Fuses and Earthing, Residential wiring

Module:3 Electrical Machines 7 hours

Construction, Working Principle and applications of DC Machines, Transformers, Single phase
and Three-phase Induction motors, Special Machines-Stepper motor, Servo Motor and BLDC
motor

Module:4 Digital Systems 5 hours

Basic logic circuit concepts, Representation of Numerical Data in Binary Form- Combinational
logic circuits, Synthesis of logic circuits

Module:5 Semiconductor devices and Circuits 7 hours

Conduction in Semiconductor materials, PN junction diodes, Zener diodes, BJTs, MOSFETs,
Rectifiers, Feedback Amplifiers using transistors. Communication Engineering: Modulation and
Demodulation - Amplitude and Frequency Modulation

Total Lecture hours: 30 hours

Text Book(s)
1. 1. John Bird, „Electrical circuit theory and technology ‟, Newnes publications, 4 t h
Edition, 2010.
Reference Books
1. Allan R. Hambley, „Electrical Engineering -Principles & Applications‟ Pearson Education,
First Impression, 6/e, 2013
2. Simon Haykin, „Communication Systems‟, John Wiley & Sons, 5 t h Edition, 2009.
3. Charles K Alexander, Mathew N O Sadiku, „Fundamentals of Electric Circuits‟, Tata
McGraw Hill, 2012.
4. Batarseh, „Power Electronics Circuits‟, Wiley, 2003
5. H. Hayt, J.E. Kemmerly and S. M. Durbin, „Engineering Circuit Analysis‟, 6/e, Tata McGraw
Hill, New Delhi, 2011.
7. Fitzgerald, Higgabogan, Grabel, „Basic Electrical Engineering‟, 5t h edn, McGraw Hill, 2009.
8. S.L.Uppal, „Electrical Wiring Estimating and Costing ‟, Khanna publishers, NewDelhi, 2008.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Thevenin‟s and Maximum Power Transfer Theorems – Impedance 3 hours
matching of source and load
2. Sinusoidal steady state Response of RLC circuits 3 hours
3. Three phase power measurement for ac loads 3 hours
4. Staircase wiring circuit layout for multi storey building 3 hours
5. Fabricate and test a PCB layout for a rectifier circuit 3 hours
6. Half and full adder circuits. 3 hours
7. Full wave Rectifier circuits used in DC power supplies. Study the 3 hours
characteristics of the semiconductor device used
8. Regulated power supply using zener diode. Study the characteristics of the 3 hours
Zener diode used
9. Lamp dimmer circuit (Darlington pair circuit using transistors) used in cars. 3 hours
Study the characteristics of the transistor used
10. Characteristics of MOSFET 3 hours
Total Laboratory Hours 30 hours
Mode of assessment: CAT / Assignment / Quiz / FAT / Project / Seminar
Recommended by Board of Studies 29/05/2015
Approved by Academic Council 37th AC Date 16/06/2015
MAT1014 Discrete Mathematics and Graph Theory L T P J C
3 1 0 0 4
Pre-requisite Nil Syllabus Version
1.0
Course Objectives:
1. To address the challenge of the relevance of lattice theory, coding theory and algebraic
structures to computer science and engineering problems.
2. To use number theory, in particular congruence theory to cryptography and computer
science problems.
3. To understand the concepts of graph theory and related algorithm concepts.

Expected Course Outcome:

At the end of this course, students are expected to
1. form truth tables, proving results by truth tables, finding normal forms,
2. learn proof techniques and concepts of inference theory
3. understand the concepts of groups and application of group codes, use Boolean algebra for
minimizing Boolean expressions.
4. learn basic concepts of graph theory, shortest path algorithms, concepts of trees and
minimum spanning tree and graph colouring, chromatic number of a graph.
5. Solve Science and Engineering problems using Graph theory.

Module:1 Mathematical Logic and Statement Calculus 6 hours

Introduction-Statements and Notation-Connectives–Tautologies–Two State Devices and
Statement logic -Equivalence - Implications–Normal forms - The Theory of Inference for the
Statement Calculus.

Module:2 Predicate Calculus 4 hours

The Predicate Calculus - Inference Theory of the Predicate Calculus.

Module:3 Algebraic Structures 5 hours

Semigroups and Monoids - Groups – Subgroups – Lagrange‟s Theorem Homomorphism –
Properties-Group Codes.

Module:4 Lattices 5 hours

Partially Ordered Relations -Lattices as Posets – Hasse Digram – Properties of Lattices.

Module:5 Boolean algebra 5 hours

Boolean algebra - Boolean Functions-Representation and Minimization of Boolean Functions –
Karnaugh map – McCluskey algorithm.

Module:6 Fundamentals of Graphs 6 hours

Basic Concepts of Graph Theory – Planar and Complete graph - Matrix representation of Graphs
– Graph Isomorphism – Connectivity–Cut sets-Euler and Hamilton Paths–Shortest Path
algorithms.

Module:7 Trees, Fundamental circuits , Cut sets, 12 hours

Graph colouring, covering, Partitioning
Trees – properties of trees – distance and centres in tree –Spanning trees – Spanning tree
algorithms- Tree traversals- Fundamental circuits and cut-sets. Bipartite graphs - Chromatic
number – Chromatic partitioning – Chromatic polynomial - matching – Covering– Four Colour
problem.

Module:8 Contemporary Issues 2 hours

Industry Expert Lecture

Total Lecture hours: 45 hours

Tutorial • A minimum of 10 problems to be worked 15 hours
out by students in every Tutorial class.
• Another 5 problems per Tutorial Class to
be given as home work.
Mode of Evaluation
Individual Exercises, Team Exercises, Online Quizzes, Online, Discussion Forums

Text Book(s)
1. Discrete Mathematical Structures with Applications to Computer Science, J .P. Trembleyand
R. Manohar, Tata McGraw Hill-35th reprint, 2017.
2. Graph theory with application to Engineering and Computer Science, Narasing Deo, Prentice
Hall India 2016.
Reference Books
1. Discrete Mathematics and its applications, Kenneth H. Rosen, 8th Edition, Tata McGraw Hill,
2019.
2. Discrete Mathematical Structures, Kolman, R.C.Busby and S.C.Ross, 6th Edition, PHI, 2018.
3. Discrete Mathematics, Richard Johnsonbaugh, 8th Edition, Prentice Hall, 2017.
4. Discrete Mathematics, S. Lipschutz and M. Lipson, McGraw Hill Education (India) 2017.
5. Elements of Discrete Mathematics–A Computer Oriented Approach, C.L.Liu, Tata McGraw
Hill, Special Indian Edition, 2017.
6. Introduction to Graph Theory, D. B. West, 3rd Edition, Prentice-Hall, Englewood Cliffs, NJ,
2015.
Mode of Evaluation
Digital Assignments, Quiz, Continuous Assessments, Final Assessment Test
Recommended by Board of Studies 03-06-2019
Approved by Academic Council No.55 Date 13-06-2019
MAT3004 Applied Linear Algebra L T P J C
3 2 0 0 4
Pre-requisite MAT2002 Applications of Syllabus Version
Differential and Difference Equations
v1.0
Course Objectives
1. Understanding basic concepts of linear algebra to illustrate its power and utility through
applications to computer science and Engineering.
2. apply the concepts of vector spaces, linear transformations, matrices and inner product
spaces in engineering.
3. solve problems in cryptography, computer graphics and wavelet transforms

Expected Course Outcomes

At the end of this course the students are expected to learn
1. the abstract concepts of matrices and system of linear equations using decomposition
methods
2. the basic notion of vector spaces and subspaces
3. apply the concept of vector spaces using linear transforms which is used in computer
graphics and inner product spaces
4. applications of inner product spaces in cryptography
5. Use of wavelet in image processing.

Module:1 System of Linear Equations: 6 hours

Gaussian elimination and Gauss Jordan methods - Elementary matrices- permutation matrix -
inverse matrices - System of linear equations - - LU factorizations.

Module:2 Vector Spaces 6 hours

The Euclidean space and vector space- subspace –linear combination-span-linearly
dependent-independent- bases - dimensions-finite dimensional vector space.

Module:3 Subspace Properties: 6 hours

Row and column spaces -Rank and nullity – Bases for subspace – invertibility- Application in
interpolation.

Module:4 Linear Transformations and applications 7 hours

Linear transformations – Basic properties-invertible linear transformation - matrices of linear
transformations - vector space of linear transformations – change of bases – similarity

Module:5 Inner Product Spaces: 6 hours

Dot products and inner products – the lengths and angles of vectors – matrix representations of
inner products- Gram-Schmidt orthogonalisation

Module:6 Applications of Inner Product Spaces: 6 hours

QR factorization- Projection - orthogonal projections – relations of fundamental subspaces –
Least Square solutions in Computer Codes
Module:7 Applications of Linear equations : 6 hours
An Introduction to coding - Classical Cryptosystems –Plain Text, Cipher Text, Encryption,
Decryption and Introduction to Wavelets (only approx. of Wavelet from Raw data)

Module:8 Contemporary Issues: 2 hours

Industry Expert Lecture

Total Lecture hours: 45 hours

Tutorial • A minimum of 10 problems to be worked out 15 hours
by students in every Tutorial Class
• Another 5 problems per Tutorial Class to be
given as home work.
Text Book(s)
1. Linear Algebra, Jin Ho Kwak and Sungpyo Hong, Second edition Springer(2004).
(Topics in the Chapters 1,3,4 &5)
2. Introductory Linear Algebra- An applied first course, Bernard Kolman and David, R.
Hill, 9th Edition Pearson Education, 2011.
Reference Books
1. Elementary Linear Algebra, Stephen Andrilli and David Hecker, 5th Edition,
Academic Press(2016)
2. Applied Abstract Algebra, Rudolf Lidl, Guter Pilz, 2nd Edition, Springer 2004.
3. Contemporary linear algebra, Howard Anton, Robert C Busby, Wiley 2003
4. Introduction to Linear Algebra, Gilbert Strang, 5th Edition, Cengage Learning (2015).
Mode of Evaluation
Digital Assignments, Continuous Assessments, Final Assessment Test
Recommended by Board of Studies 25-02-2017
Approved by Academic Council No. 47 Date 05-10-2017
Course code Foundations of Artificial Intelligence L T P J C
CSE1014 2 0 2 4 4
Pre-requisite NIL Syllabus version
v. 1.0
Course Objectives:
1. Familiarize students with Artificial Intelligence principles and techniques
2. Introduce the facts of computational model and their applications
3. Explore problem-solving paradigms, search methodologies and learning algorithms

Expected Course Outcome:

1. Characterize different types of AI environments, transform a given real world problem to
state space problem, understand and identify the stages and issues in the development
expert system
2. Apply different searching algorithms and heuristic methodologies to reach the goal in
state-space problems.
3. Formulate a given real world problem formally using different knowledge representation
methods and draw inferences from it.
4. Implement appropriate searching strategies for few real world environments

Module:1 Introduction 6 hours

Definitions - Importance of AI, Evolution of AI - Applications of AI, Classification of AI systems
with respect to environment, Intelligent Agents, Different types of agents
Expert Systems‐ Stages in the development of an Expert Systems, Difficulties in Developing
Expert Systems‐Applications of Expert Systems

Module:2 Problem solving 7 hours

Problem solving by Search, Problem space - State space, Blind Search - Types, Performance
measurement - Informed search strategies, Heuristic functions, Local search strategies- Hill
climbing, simulated annealing.

Module:3 Adversarial Search 3 hours

Game playing – mini-max algorithm, Alpha-Beta Pruning.

Module:4 Logical systems 1 5 hours

Knowledge Based systems, Propositional Logic, syntax, semantics, inference, propositional
theorem proving, Resolution- Horn clauses, Forward chaining and backward chaining

Module:5 Logical systems 2 3 hours

First Order Logic -Representation, Syntax and semantics, quantifiers, Inference in First Order
Logic.

Module:6 Uncertainty and knowledge Reasoning 5 hours

Overview – Definition of uncertainty, Bayes Rule – Inference, Belief Network, Utility Based
System, Decision Network.

Module:7 Recent Trends 1 hours

Contemporary issues
 Total Lecture hours: 30 hours

Text Book(s)
1. Stuart Russell and Peter Norvig Artificial Intelligence - A Modern Approach, Prentice
Hall, 3rd edition, 2016.
D. Poole and A. Mackworth. Artificial Intelligence: Foundations of Computational Agents,
2. Cambridge University Press, 2010

Reference Books
3. 3. Elaine Ric, Kevin Knight and Shiv Shankar B. Nair, Artificial Intelligence, 3rd edition,
Tata McGraw Hill, 2009.
4. 4. George F. Luger, ―Artificial Intelligence-Structures and Strategies for Complex
Problem Solving‖, 6th edition, Pearson, 2008.
5. 5. R. Brachman, H. Levesque. Knowledge Representation and Reasoning, Morgan
Kaufmann, 2004.
6. 6. E. Alpaydin. Introduction to Machine Learning. MIT Press, 2nd edition, 2010
. 7. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998
8. 8. N.P.Padhy: Artificial Intelligence and Intelligent Systems, Oxford University Press, 2009.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. BFS 2 hours
2. Uniform cost search 2 hours
3. DFS 2 hours
4. Depth limited search 2 hours
5. A* algorithm implementation 2 hours
6. Getting acquainted with Prolog 10 hours

7. Develop a small KB using Prolog and answer simple queries 10 hours

Total Laboratory Hours 30 hours

Mode of assessment: Project review/evaluation, Tests, Assignments, Seminars
Recommended by Board of Studies 11-9-2019
Approved by Academic Council No. 56 Date 20/9/2019
Course code Machine Learning Essentials L T P J C
CSE1015 2 0 2 4 4
Pre-requisite Syllabus version
v. 1.0
Course Objectives:
1. To teach the theoretical foundations of various learning algorithms
2. To train the students better understand the context of supervised and unsupervised learning
through real-life examples
3. Apply all learning algorithms over appropriate real-time dataset
4. Evaluate the algorithms based on corresponding metrics identified

Expected Course Outcome:

1. Understand, visualize, analyze and preprocess the data from a real-time source.
2. Apply appropriate algorithm to the data.
3. Analyze the results of algorithm and convert to appropriate information required for the
real – time application.
4. Evaluate the performance of various algorithms that could be applied to the data and to
suggest most relevant algorithm according to the environment.

Module:1 Introduction to Machine Learning 3 Hours

Introduction to Machine Learning – Learning Paradigms – PAC learning – Basics of Probability –
Version Spaces.

Module:2 Supervised Learning – I 6 Hours

Linear and Non-Linear examples – Multi–Class & Multi-Label classification – Linear Regression
– Multilinear Regression – Naïve Bayes Classifier – Decision Trees – ID3 – CART – Error
bounds.

Module:3 Supervised Learning - II 6 Hours

K-NN classifier – Logistic regression – Perceptrons – Single layer & Multi-layer – Support Vector
Machines – Linear & Non-linear.

Module:4 Unsupervised Learning 5 Hours

Clustering basics (Partitioned, Hierarchical and Density based) - K-Means clustering – K-Mode
clustering – Self organizing maps – Expectation maximization – Principal Component Analysis.

Module:5 Evaluation Metrics 3 Hours

ROC Curves, Evaluation Metrics, Significance tests – Error correction in Perceptrons

Module:6 Ensemble Learning 3 Hours

Bagging and Boosting (Random forests, Adaboost, XG boost inclusive)

Module: Machine Learning in Practice 3 hours

7
Data collection – Preprocessing (Missing values, Normalization, Adopting to chosen algorithm
etc.,) – Outlier Analysis (Z-Score) - Model selection & evaluation – Optimization of tuning
parameters – Setting the environment – Visualization of results.
 Module:8 CONTEMPORARY ISSUES (To be handled 1 Hour
by experts from industry)

Total Lecture hours: 30 hours

Reference Books
1 Ethem Alpaydin,"Introduction to Machine Learning‖, MIT Press, Prentice Hall of India,
Third Edition 2014.
2 Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar "Foundations of Machine
Learning‖, MIT Press, 2012.
3 Tom Mitchell, ―Machine Learning‖, McGraw Hill, 3rd Edition,1997.
4 Charu C. Aggarwal, ―Data Classification Algorithms and Applications‖, CRC Press, 2014.
5 Christopher M. Bishop, ―Pattern Recognition and Machine Learning‖, Springer 2011
Edition.

*Above listed books are only references and the students are free to choose any recent
references.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1 Linear & Multi-Linear Regression 2 hours
2 Naïve Bayes classifier 2 hours
3 Decision trees – ID3 2 hours
4 Decision trees- CART 2 hours
5 Logistic regression 2 hours
6 Support Vector Machines – Linear 2 hours
7 Support Vector Machines – Non-linear 2 hours
8 Single Perceptron 2 hours
9 Multilayer Perceptron 2 hours
10 K-NN, K-Means & K-mode clustering 4 hours
11 Random – forest 2 hours
12 Adaboost, XGboost 2 hours
13 Principal component analysis 2 hours
14 Self – Organizing maps 2 hours
Total Laboratory Hours 30 hours
Project 60 hours
1. A team may include to a maximum of 4 members.
2. Concepts studied in the subject to be used.
3. Down to earth application and innovative idea should have been attempted.
4. Report in Digital format with all evaluations and analysis to be submitted.
5. Assessment on a continuous basis with a minimum of 3 reviews.

Sample project domains:

1. Healthcare
2. E-Learning
3. Smart village
4. Smart agriculture
Image recognition

Mode of assessment: Project review/evaluation, Tests, Assignments, Seminars

Recommended by Board of Studies 11-09-2019
Approved by Academic Council No. 56 Date 20-9-2019
Course code Deep Learning : Principles and Practices L T P J C
CSE1016 2 0 2 0 3
Pre-requisite Syllabus
version
v. 1.0
Course Objectives:
1. 1. Introduce major deep neural network frameworks and issues in basic neural networks.
2. To solve real world applications using Deep learning.

Expected Course Outcome:

1. Understand the methods and terminologies involved in deep neural network, differentiate the
learning methods used in Deep-nets.
2. Identify and apply suitable deep learning approaches for given application.
3. Design and develop custom Deep-nets for human intuitive applications.
4. Design of test procedures to assess the efficiency of the developed model.

Module:1 NEURAL NETWORKS 4 hours

Introduction of Artificial Neural Networks (ANN) - Functions in ANN – Activation function, Loss
function - L1, L2 - Function approximation, classification / clustering problems - Applications

Module:2 LEARNING IN DEEP NETWORKS 4 hours

Back propagation training, Learning the weights, Chain rule, Stochastic gradient descent, Sigmoid units
and vanishing gradient, Rectified Linear Unit (ReLU) and its variants - Cross entropy for classification
and activation, Batch learning.

Module:3 IMPROVING DEEP NEURAL NETWORKS 6 hours

Hyper-parameter tuning, Regularization - Dropouts, Minibatch gradient descent, Data Augmentation,
Stratification, Generalization Gap – Under-fitting Vs Over-fitting - Optimization – Momentum,
Learning rate schedules, AdaGrad, RMSProp and Adam optimization, Internal Co-variant and Batch
Normalization, Initialization – weights, Bias

Module:4 CONVOLUTION NEURAL NETWORKS 5 hours

CNN Operations, Pooling, Basic architecture, Variants of the Basic Convolution Model – Advanced
architectures : AlexNet, ResNet and others.

Module:5 RECURRENT NETWORKS 3 hours

Recurrent Neural Networks - Bidirectional RNNs, Encoder, Decoder, Sequence-to-Sequence
Architectures, Deep Recurrent Networks, Auto encoders

Module:6 RECURSIVE NEURAL NETWORKS 3 hours

The Challenge of Long-Term Dependencies, Echo State Networks, Long Short-Term Memory and Other
Gated RNNs, Optimization for Long-Term Dependencies, Explicit Memory

Module: 7 TRANSFER LEARNING, GENERATIVE 4 hours

ADVERSARIAL NETWORKS
Transfer Learning strategy, GAN and their variants, R-CNN , YOLO and SSD

Module:8 CONTEMPORARY ISSUES (To be handled 1 hour

 by experts from industry)

Total Lecture: 30 Hours

Text Book(s)
1. Deep Learning, Ian Goodfellow Yoshua Bengio Aaron Courville, MIT Press, 2017
2 Neural Networks and Deep Learning, Michael Nielsen,, Determination Press
Reference Books
1. Deep Learning Step by Step with Python, N D Lewis, 2016
2 Deep Learning: A Practitioner's Approach, Josh Patterson, Adam Gibson, O'Reilly Media,
2017
3 Applied Deep Learning. A Case-based Approach to Understanding Deep Neural Networks,
Umberto Michelucci, Apress, 2018.
4 Deep Learning with TensorFlow: Explore neural networks with Python, Giancarlo
Zaccone, Md. RezaulKarim, Ahmed Menshawy, Packt Publisher, 2017.
5 Deep Learning with Keras, Antonio Gulli, Sujit Pal , Packt Publishers, 2017.
6 Deep Learning with Python", Francois Chollet, Manning Publications, 2017.

Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar

List of Challenging Experiments (Indicative)
1. Demonstration and implementation of Shallow architecture, using Python, 10 hours
Tensorflow and Keras
 Google Colaboratory - Cloning GitHub repository, Upload Data,
Importing Kaggle's dataset, Basic File operations
 Implementing Perceptron,
 Digit Classification : Neural network to classify MNIST dataset
2. Hyper parameter tuning and regularization practice - 4 hours
 Multilayer Perceptron (BPN)
 Minibatch gradient descent,
3. Convolution Neural Network application using Tensorflow and Keras, 4 hours
 Classification of MNIST Dataset using CNN
 Face recognition using CNN
4. Object detection using Transfer Learning of CNN architectures 2 hours
5. Image denoising (Fashion dataset) using Auto Encoders 2 hours
 Handling Color Image in Neural Network aka Stacked Auto
Encoders (Denoising)
6 Text processing, Language Modeling using RNN 2 hours
7 Time Series Prediction using RNN 2 hours
8 Sentiment Analysis using LSTM 2 hours
9 Image generation using GAN 2 hours
 Total Laboratory Hours 30 hours
Mode of assessment:
Recommended by Board of Studies 11-09-2019
Approved by Academic Council No. 56 Date 20/9/2019
Course Code Course Title L T P J C
CSE3042 Machine Intelligence for Medical Image Analysis 2 0 0 4 3
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives (COB):
1. To understand the medical imaging modalities
2. To focus on the analysis of clinical parameters for the extraction of knowledge from medical
images
3. To integrate machine intelligence to automate the process in the medical imaging

Expected Course Outcomes (CO):

1. Understand the fundamentals of medical imaging system
2. Learn to extract, model, and analyse information from medical data
3. To develop applications to help diagnosis, treatment and monitoring of diseases through
machine intelligence algorithms
4. Understand the working of deep learning models for medical imaging

Module:1 Fundamentals of Medical Image Processing 5 hours

Principles of Image Formation – Coordinate System: Body – Scanner – Scene – Structure –
Display; Image Enhancement using Histogram Processing – Noise Suppression: Image Filtering:
Gaussian Filtering – Median Filtering – Unsharp Masking– Adaptive Filtering Edge Detection-
Image Quality Metrics – Image Artifacts – Linear Filtering – Convolution and Correlation-
Algorithms to remove noise

Module:2 Segmentation and Morphological Operations 3 hours

Image Segmentation – Region Based – Edge Based – Morphological Operations – Dilation –
Erosion – Chain code – Feature Extraction

Module:3 Radiography and Magnetic Resonance Imaging 4 hours

X-rays; interaction of x-ray beam with tissue; X-ray detectors; X-ray detectors in CT; Data
acquisition in CT; image reconstruction; spiral CT – MRI - Image acquisition and reconstruction;
interaction with tissue; slice selection; basic pulse sequences; 3D-imaging; fast imaging methods;
functional imaging

Module:4 Ultrasonic Imaging 3 hours

Physics of acoustic waves propagation in tissues; generation and detection of ultrasound; B-mode;
M-mode; TM-mode processing; date acquisition.- Types of noise – Noise Removal

Module:5 Nuclear Medical Imaging and Diagnosis 3 hours

Cancer Diagnosis – Monitor the effects of chemo therapy on tumor volume – Cardiovascular
disease – to examine the blood flow to the heart muscle – Neurological disorders – brain tumor
evaluation and early identification of recurrence

Module:6 Machine Intelligence 7 hours

Data labelling – Feature Computation and selection – The learning process – Neuronal
algorithms: Bayes Classifier, Linear Classifier, Decision trees , Random forests, Neural networks
to diagnose a wide variety of medical conditions such as screening for common cancers- classify
tumors in PET images/ –– Automated CT Scanners - Deep learning architectures for
segmentation – U-Net

Module:7 Future Trends in Medical Imaging 3hours

Optical Imaging – Optical Coherence Tomography – Diffuse Reflectance and Trans illumination
Imaging – Model Based and Multiscale Analysis- Diffusion Tensor Imaging – Thermography –
Microwave imaging

Module:8 Contemporary issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Biomedical Image Analysis, Rangaraj M. Rangayyan, 2004

Reference Books
1. Medical Image Analysis, A. Dhawan, Wiley 2003
2 Foundations of Medical Imaging, Cho, Jones, Singh, John Wiley & Sons, 1993
3 Fundamentals of Medical Imaging, Paul Suetens, Cambridge University, 2nd edition, 2009
4. Deep Learning for Medical Image Analysis, S. Kevin Zhou, Hayit Greenspan, Dinggang
Shen, Academic Press, ISBN: 9780128104095, 2017
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final
Assessment Test (FAT) / Seminar.
List of Project Titles (Indicative) :
1. Analysis on Chest CT on the impact of COVID-19
2. Tongue Image Analysis for the impact of COVID-19
3. Thermographic image analysis for the disease detection
4. Analysis on the improvement in absorption of medicine from the last screening
5. Diagnosing changes in the tumor size from the last screening

Mode of Evaluation:Reviews
Recommended by Board of studies 30/10/2020
Approved by Academic Council 60th AC Date 04/11/2020
Course Code Course Title L T P J C
CSE4038 Computer Vision in Healthcare Application 2 0 2 0 3
Pre-requisite CSE3042 Syllabus version
v. 1.0
Course Objectives:
It introduces the concept of computer vision foundations and applications, Image
formation and pre-processing, Computer vision in healthcare applications.

Expected Course Outcomes:

1. Implement fundamental image processing techniques required for computer vision
2. Implement the Image formation and Pre-processing
3. Implement object recognition, vision and motion related techniques

Module:1 Introduction to computer vision 3 hours

Brief history of Computer Vision – Image Processing, Machine Learning – Information Retrieval
– Neuroscience – Robotics – Speech – Cognitive Sciences – Graphics, Algorithms, Systems and
Theory – Pattern Recognition – Computer Graphics.

Module:2 Computer vision foundations 5 hours

Image Processing - Colour - Linear Algebra Primer - Pixels and Filters - Edge Detection -
Features and Fitting - Feature Descriptors - Image Resizing - Segmentation - Semantic
Segmentation - Clustering - Object recognition - Dimensionality Reduction - Face Identification -
Visual Bag of Words - Object Detection from Deformable Parts - Semantic Hierarchies and Fine
Grained Recognition - Motion - Tracking - Deep Learning

Module:3 Image formation 3 hours

Geometric primitives and transformations – Photometric image formation – The digital camera –
Point operators – Linear Filtering – More neighbourhood operators – Fourier transforms –
Pyramids and wavelets – Geometric transformations – Global optimization.

Module:4 Image pre-processing 3 hours

Feature detection and matching – Segmentation – Edge detection - 2D and 3D feature based
alignment – Pose estimation – Geometric intrinsic calibration – Triangulation – Two-Frame
Structure from motion – Factorization – Bundle adjustment – Constrained Structure and Motion –
Dense motion estimation.

Module:5 3d vision 4 hours

Methods for 3D Vision - 3D reconstruction – Image based rendering, Image Recognition – Object
Detection – Space, Instance and Category Recognition – Recognition Databases and test sets.

Module:6 Computer vision for assisting healthcare applications 6 hours

Computer Vision to see - Computer Vision for Cognition - Computer Vision for physical
rehabilitation and training - Computer Vision for CADsystems in surgery - Computer Vision for
human-machine interaction - Computer Vision for Ambient Assisted Living - Egocentric (first
person) vision.
Module:7 Health care applications 4 hours
Analysis of Medical Image - Computer Vision for Predictive Analytics and Therapy -
Fundamental Algorithms for Medical Images - Machine Learning Algorithms for Medical Images
– Deep learning approaches for healthcare applications.

Module:8 Contemporary issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Ranjay Krishna, "Computer Vision: Foundations and Applications", Stand ford University,
December 2017.
2. Richard Szeliski, ―Computer Vision: Algorithms and Applications‖, Springer 2011
Reference Books
1. Simon J. D. Prince, ―Computer Vision: Models, Learning, and Inference‖,
CambridgeUniversity Press, 2012.
2 Forsyth D A and Ponce J,―Computer Vision: A Modern Approach‖, Prentice Hall 2003
3 Mark Nixon and Alberto S. Aquado, ―Feature Extraction & Image Processing for Computer
Vision‖, Third Edition, Academic Press, 2012.
4 Forsyth D A and Ponce J,―Computer Vision: A Modern Approach‖, Prentice Hall 2003.
List of Challenging Experiments (Indicative): Hours
1 Write a program to display gray scale image using read and write operation 2 Hours
2 Write a program to identify the histogram value of a gray scale image and 2 Hours
colour image.
3 Write a vision program to demonstrate the edge detection process. 2 Hours
4 Write a vision program to discretize an image using Fourier transformation 2 Hours
5 Demonstrate the medical image classification using SVM. 8 Hours
6 Demonstrate various machine Learning Algorithms for Medical Images 8 Hours
7 Demonstrate various Deep Learning Algorithms for Medical Images 6 Hours
Total laboratory hours 30 Hours
Mode of Assessment: Continuous Assessment & Final Assessment Test (FAT)
Recommended by Board of Studies 30/10/2020
Approved by Academic Council 60th AC Date 04/11/2020
Course code Course Title L T P J C
CSE4039 Intelligent Embedded Systems 2 0 0 4 3
Pre-requisite CSE3042 Syllabus version
v.1.0
Course Objectives (COB):
1. To understand principles and algorithms for prototyping embedded systems with high level of
deduction and adaptation.
2. To provide students with holistic view and detailed knowledge of hardware – software co-design of
intelligent, real-time embedded systems

Expected Course Outcomes (CO):

1. Have in-depth understanding of the fundamental design paradigms, architectures, possibilities and
challenges for embedded systems from both hardware and software perspective
2. Be able to demonstrate understanding of methodological knowledge of the development of
intelligent embedded systems
3. Be capable of using recent methods and tools to carry out intelligent embedded system design in the
areas of health care

Module:1 Fundamentals of Embedded System 4 hours

Core of the embedded system, Memory, Sensors (resistive, optical, position, thermal) and Actuators
(solenoid valves, relay/switch, opto-couplers), Communication Interface, Embedded firmware
(RTOS, Drivers, Application programs), Power-supply (Battery technology, Solar), PCB and
Passive components, Safety and reliability, environmental issues. Ethical practice. Characteristics and
quality attributes (Design Metric) of embedded system. Real time system‘s requirements, real time
issues, interrupt latency

Module:2 Embedded Hardware Design 3 hours

Introduction to ARM-v7-M (Cortex-M3), ARM-v7-R(CortexR4) and comparison between them

Module:3 Embedded System Interfacing 3 hours

Study of basic communication protocols like SPI, SCI (RS232, RS485), I2C, CAN, Field-bus (Profibus),
USB (v2.0), Bluetooth, Zig-Bee, Wireless sensor network

Module:4 Learning in Embedded Systems 5 hours

Introduction, From Metrology to Digital Data, Uncertainty; Information and Learning Mechanisms,
Randomized Algorithms, Robustness Analysis , Embedded C-programming concepts (from embedded
system point of view): Optimizing for Speed/Memory needs, Interrupt service routines, macros,
functions, modifiers, data types, device drivers, Multithreading programming. Basic embedded C
programs/applications for ARM-v7, using ARM-GCC-tool-chain, Emulation of ARM-v7 (e.g. using
QEMU), and Linux porting on ARM-v7 (emulation) board
Module:5 Introduction to Embedded Systems in Health Care Domain 4 hours
Embedded System in Bio-medical applications: Criticality, Reactivity, Autonomy; Trends in medical
systems: Ambient Intelligence, Assistive technologies for procedures, In-Body devices, Treating
Machines, Monitoring/Imaging Systems, VR enhanced Reality systems

Module:6 Embedded Systems and Medical Applications 5 hours

Managing Chronic conditions, Wellness Management, Clinical Support, Specific Embedded
Architectures with grid service architectures, Privacy and Security Issues, Hybrid Electronic and
biological systems : Informatics and biologically active – augmentation with genetic data

Module:7 Intelligent Home Health Care Embedded Systems 4 hours

Autonomous health monitoring systems: Expert systems with updatable knowledge base, Fall detection
systems for elderly, Telemedicine: Quality of service, adaptability, web based access to field equipment,
Configuration of Remote Diagnosis, Bio-medical Feed back control system

Module:8 Contemporary issues 2 hours

Total Lecture hours: 30 hours

Reference Books
1. Introduction to Embedded Systems, Shibu K. V. TMH Publications, 2009.
2. Embedded System Design –A unified hardware and software introduction, Frank Vahid, Tony D.
Givargis, John Wiley Publications, 2000.
3. U-Healthcare Monitoring Systems: Volume 1: Design and Applications, Nilanjan Dey, ISBN-13:
978-0128153703, Academic Press Publication, 2018.
4. Internet of Things and Big Data Technologies for Next Generation Healthcare, Chintan Bhatt,
Nilanjan Dey, Amira S Ashour, Springer Publication, 2017.
5. Embedded microcontroller and processor design, Charles Greg Osborn,Pearson Publcation,
2010.
6. Embedded Microcomputer Systems –Real Time Interfacing –Jonathan W. Valvano; Cengage
Learning; Third edition, CENGAGE Learning Publication, 2012.
7. E-Health, Assistive Technologies and Applications for Assisted Living: Challenges and
Solutions, Carsten Röcker (RWTH Aachen University, Germany) and Martina Ziefle (RWTH
Aachen University, Germany), IGI Global Publication, 2011.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Project Titles (Indicative) :
1. Wireless sensor based health care system using genetic based bio metric security
2. Home based patient health monitoring system
3. Assistive Technology for Alzheimer‘s Disease
4. Intelligent wheelchair for disabled person controlled with hand gestures
5. Automatic fall detection and monitoring for old persons using wireless communication
6. Heartbeat Monitoring and Alarming system
7. Card based patient data monitoring system using microcontroller and data storage in SD card
8. Hand Gestures controlled Intelligent Wheelchair

Mode of Evaluation: Reviews

Recommended by Board of Studies 30/10/2020
Approved by Academic Council 60th AC Date 04/11/2020
Course Code Course Title L T P J C
CSE4040 Bioinformatics 2 0 0 4 3
Prerequisites CSE3042 Syllabus Version
V 1.0

Course Objectives (COB)

1. To provide students the fundamental concepts and methods of bioinformatics and structural
bioinformatics.
2. To understand methods of protein folding and protein structure prediction (homologous
modeling, threading and ab initio folding), and techniques of protein structure
determination (X-ray crystallography, NMR and cryo-EM).
3. To introduce the tools used in Bioinformatics such as BLAST
4. To develop the ability to design, predict, analyze and compare the protein structures as well
as predict the function of target proteins.
5. To introduce the role of bioinformatics in drug discovery

Expected Course Outcome (CO)

1. Understand the fundamental concepts of structural biology (chemical building blocks,
structure, superstructure, folding, etc.)..
2. Be able to understand the sequence and structure alignment, protein structure prediction,
protein folding, and protein-protein interaction.
3. Understand and use bioinformatics databases and understand protein design
4. Understand the current approaches in bioinformatics application
5. Understand the methodology of protein structure prediction and assessment
6. Be able to understand the role of bioinformatics in drug discovery
7. Be able to reach the frontier of bioinformatics and use bioinformatics tools to solve the
research problems

Module:1 Basics of Bioinformatics 4 hours

Introduction: What is bioinformatics, Principles of protein structure, Tertiary structure, Quaternary
structure, Similarity of ternary and quaternary structure; Bioinformatics databases: Introduction,
Nucleotide sequence databases, Protein sequence databases, Sequence motif databases, Protein
structure databases

Module:2 Sequence Alignment 3 Hours

Similarity and Homology, Types of divergence, Conserved regions, Methodological principles,

Substitution scores, Insertion/deletion scores, Statistical significance, Database search, Multiple
alignment, Structure alignment, Matching algorithms, Searching 3D Databases

Module:3 Protein Structure and Modeling 4 Hours

Protein secondary structure: Introduction, Hydrogen bond, Defining a secondary structure element,
Methods for predicting secondary structure; Experimental methods for protein structure
determination: X-ray crystallography, Nuclear magnetic resonance (NMR); Protein folding and
dynamic simulation
Module:4 Current Techniques 3 Hours
Bayesian Networks, Nearest neighborhood approach, Neural Networks, Genetic algorithms,
Ensemble learning

Module:5 Drug Discovery 4 Hours

Computer Aided Drug Designing (CADD): SBDD, LBDD, Drug discovery, Drug Target
Identification, Drug Target Validation

Module:6 Structural domains in protein 4 Hours

asics, First and second generation algorithms for domain assignments, domain assignment based on
graph theoretical methods, prediction of binding sites and characterization. Designing protein-
protein interfaces: Designing for affinity, Designing for specificity

Module: 7 Applied Bioinformatics Tools 5 hours

Entrez, ExPASy, BLAST: Online and Local BLAST, Motif Search: SMART Search, MEME Search,
HMM Search, Scoring Matrix, Dotlet

Module:8 Contemporary issues 2 Hours

Total Lecture: 30 Hours

Text Books:
1. Bioinformatics and Functional Genomics (2nd edition) by Jonathan Pevsner, Wiley-Liss,
ISBN# 978-0-470-08585-1.
2. Keedwell, Edward, and Ajit Narayanan. Intelligent bioinformatics: The application of artificial
intelligence techniques to bioinformatics problems. John Wiley & Sons, 2005.
3. Lesk, A.M. 2005, 2nd edition, Introduction to Bioinformatics. Oxford University Press.
References Books:
4. Structural Bioinformatics (2nd Edition), Jenny Gu (Editor), Philip E. Bourne (Editor)
5. D.W. Mount Bioinformatics: Genome and Sequence Analysis: (2001) Cold Spring Harbor
Laboratory
Press, Cold Spring Harbor, New York.
6. Bioinformatics: Databases and Systems, by Stanley I. Letovsky
7. Bioinformatics Databases: Design, Implementation, and Usage (Chapman & Hall/ CRC
Mathematical Biology & Medicine), by SorinDraghici
8. Basics of Bioinformatics: Lecture notes of the Graduate Summer School, Rui Jiang, Zhang,
Springer
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Project Titles (Indicative)
 6. Genome comparison
7. Predicting Cellular Localization
8. Genome rearrangements
9. Secondary structure prediction
10. Sequence alignment

Mode of Evaluation: Reviews

Recommended by Board of studies 30/10/2020
Approved by Academic Council 60th AC Date 04/11/2020
Course Code Course Title L T P J C
CSE4048 Soft Computing in Medical Diagnostics 2 0 0 4 3
Pre-requisite CSE3042 Syllabus version
v. 1.0
Course Objectives (COB):
1. To introduce advantages of soft computing over hard computing
2. To familiarize students with the basic techniques of soft computing such as Neural
Networks, Fuzzy Systems and Evolutionary algorithms
3. To illustrate the applications of soft computing in medical diagnosis

Expected Course Outcomes (CO):

1. Understand the advantages of soft computing over hard computing
2. Understand how evolutionary algorithms help in optimization and solving real-time
problems
3. Understand how fuzzy decision making helps to deal with uncertainty
4. Understand the architecture and training aspects of Neural Networks
5. Apply soft computing techniques for medical image processing and medical diagnosis

Module:1 Basics of Soft Computing 2 hours

Introduction to Soft Computing, Difference between Hard and Soft computing, Requirement
of Soft computing, Major Applications of Soft Computing

Module:2 Evolutionary Algorithms 6 hours

Genesis behind evolutionary algorithms, Genetic Algorithms (GA) and its variants, Particle
Swarm Optimization, Artificial Bee Colony Algorithm, Multi-objective optimization

Module:3 Fuzzy Systems 6 hours

Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation, Fuzzification, Defuzzification
Method, Fuzzy Logic, Fuzzy Rule based systems, Fuzzy Decision Making

Module:4 Neural Networks 6 hours

Review on Neural Networks, Radial Basis Function Networks, Associative Memory
Networks, Adaptive Resonance theory and Self Organizing Map, Hybrid Neural Networks:
Evolutionary Neural Networks: GA + ANN, FUZZY+ ANN

Module:5 Fuzzy methods for Medical Image Processing 3 hours

Fuzzy methods for Image enhancement, Image Segmentation and Fuzzy C-means
Clustering

Module:6 Soft Computing for Medical Diagnosis 3 hours

Artificial neural networks in medical diagnosis, Clinical Decision Support Systems, Genetic
algorithms for feature selection in computer-aided diagnosis

Module:7 Hybrid Methods for Medical Diagnosis 2 hours

Fuzzy-neural networks for medical diagnosis and disease classification, Combining
Evolutionary and Fuzzy techniques in medical diagnosis and disease classification

Module:8 Contemporary Issues 2 hours

 Total Lecture hours: 30 hours

Text Book(s)
1. S.N. Sivanandam, S.N. Deepa ―Principles of Soft Computing‖, 3rd Edition, Wiley, 2018.
2. Timothy J. Ross "Fuzzy Logic with Engineering Applications", 4th edition, Wiley, 2016.
3. Andries P. Engelbrecht, ―Computational Intelligence: An Introduction‖, 2nd Edition, John
Wiley & Sons, 2007.
4. Leszek Rutkowski,, ―Computational Intelligence Methods and Techniques‖, Springer,
2008.
Reference Books
1. Tamalika Chaira, ―Medical Image Processing: Advanced Fuzzy Set Theoretic
Techniques‖, CRC Press, 2015.
2. Manfred Schmitt, Horia-Nicolai TEODORESCU, Ashlesha Jain, Ajita Jain, Sandhya
Jain. "Computational Intelligence Processing in Medical Diagnosis", Springer Science &
Business Media, 2002..
3. Stephen L. Smith, Stefano Cagnoni "Genetic and Evolutionary Computation: Medical
Applications", John Wiley & Sons, 2011.
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment / Quiz / Final
Assessment Test (FAT) / Seminar
List of Project (Indicative)
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the
following (tentative domains). i.e.,
1. Fuzzy Image Segmentation in medical diagnosis
2. Medical Image Registration Using Evolutionary Computation
3. Medical Image Segmentation by Evolutionary Approach
4. Fuzzy C-means clustering of Medical Images
5. Clinical decision support system (DSS) in the diagnosis of malaria
Mode of Evaluation: Reviews
Recommended by Board of studies 8/2/2021
Approved by Academic Council 61st Date 18/2/2021
Course code Course title L T P J C
CSE3043 Video Analytics 2 0 0 4 3
Prerequisites Nil Syllabus Version
1.0
Course Objectives (CO):
1. To impart knowledge on the concepts of computer vision and intelligent video processing with
analytics to process massive video feed and derive insights with machine intelligence
2. To explore and demonstrate real time video analytics in solving practical problems of commercial
and scientific interests.

Expected Course Outcomes:

1. Understand basic image and video processing concepts
2. Explore both the theoretical and practical aspects of intelligent perception and understanding of
images.
3. Apply principles and techniques of video processing in applications related to intelligent and
automated visual system design and analysis.
4. Analyze techniques for action representation and recognition
5. Develop algorithms that can perform high-level visual recognition tasks on real-world images
and videos.

Module:1 Introduction 5 Hours

Basic steps of Image processing system, Pixel Relationship, Image Transforms, Image
Enhancement, Color Models, Digital Video, Sampling of video signal, Video Standards, Rate
control and buffering.

Module:2 Feature extraction and Dimensionality Reduction 5 Hours

Feature extraction - Binary object feature, Histogram-based (Statistical) Features, Intensity
features, Shape feature extraction, Motion compensated features, Texture Analysis - Concepts and
classification, statistical, structural and spectral analysis, SIFT - SURF, Content based features,
Convolutional features for visual recognition, PCA , LDA

Module:3 Object Recognition 5 Hours

Feature Selection and Boosting, Template-Matching, Scene and Object Discrimination, Object
Modeling, Saliency Map, Self supervised object detection, Object Classification with CNN

Module:4 Video Classification 3 Hours

Exploring Dataset, Convolutional Neural Network (CNN) + Long short-term memory network
(LSTM), Multi resolution CNN, Multi-modal fusion

Module:5 Intelligent Surveillance 4 Hours

Change Detection, Background modeling, Motion Estimation and Segmentation, Kalman Particle
Filter based tracking, Multi-target tracking

Module:6 Behaviour Analysis 4 Hours

Learning Based Analysis, Rule Based Analysis, Facial Analysis, Gesture Recognition, Human
Counting and Distribution – BLOB based, Feature based.
Module: 7 Scene Analysis 3 hours
Intelligent Context and Scene Understanding, Captioning using Neural Networks
Case Study : Surveillance - Advanced Driver Assistance System – Robotics

Module:8 Contemporary Issues 1 Hour

Total Lecture Hours: 30 Hours

Text Books:
1. Rafael C. Gonzalez and Richard E. Woods, ―Digital Image Processing‖, Third Ed., Prentice-
Hall, 2008.

2. A. Murat Tekalp, ―Digital Video Processing‖, Second Edition, Prentice Hall, 2015
3 Oge Marques, ‖Practical Image and Video Processing Using MATLAB‖, Wiley-IEEE
Press,2011

References Books:
1 Yu Jin Zhang, ―Image Engineering: Processing, Analysis and Understanding‖, Tsinghua
University Press, 2009
2 Yuyu Yujin Zhang, ―Image Understanding‖, Walter de Gruyter GmbH & Co KG, 2017
3 Boguslaw Cyganek,‖Object Detection and Recognition in Digital Images: Theory and
Practice‖,Wiley, 2013
4 Rajalingappaa Shanmugamani, ―Deep Learning for Computer Vision‖, Oreilly, 2018
5 Huihuan Qian, Xinyu Wu, Yangsheng Xu , ―Intelligent Surveillance Systems‖, Springer, 2011

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Projects (Indicative)
1. Sign language Interpreter
2. Anti-Cheating system
3. Lane And Vehicle Detection For Autonomous Vehicles
4. Movie recommendation system
5. Smart Video Surveillance
6. Live Video Analytics

Mode of Evaluation: Reviews

Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course code Course title L T P J C
CSE4041 Perception and Algorithm 2 0 0 4 3
Prerequisites CSE3043 Syllabus Version
1.0

Course Objectives (CO):

1. Introduce the concepts involved in designing an autonomous system
2. Design and implement modules that can be incorporated in an autonomous system
3. Understand the hardware and algorithmic perspective of an autonomous system

Expected Course Outcomes:

1. To introduce the different types of sensors required for perception of environment by an
autonomous system
2. To teach the basics of geometric representations and image transformation of objects
3. To understand object recognition using computer vision algorithm
4. To learn speech processing algorithms to understand speech and convert from text to speech
5. To understand the algorithms required for task analysis
6. To design systems that will be part of decision making modules of an autonomous system

Module:1 Introduction to Perception 3 Hours

Sensors - Levels of Processing - Simple Sensors - Passive vs. Active Sensors - Switches - Light
Sensors - Resistive Position Sensors

Module:2 Complex Sensors 5 Hours

Ultrasonic or Sonar Sensing - Laser Sensing - Visual Sensing - Cameras - Edge Detection - Model-
Based Vision - Motion Vision - Stereo Vision - Texture, Shading, Contours - Biological Vision -
Vision for Robots

Module:3 Geometric Representations and Transformations 4 Hours

Geometric Modeling - Semi-Algebraic Models - Rigid-Body Transformations - 3D Transformations

Module:4 Transforming Kinematic Chains of Bodies 4 Hours

A 2D Kinematic Chain - A 3D Kinematic Chain - Transforming Kinematic Trees - Nonrigid
Transformations

Module:5 Object Recognition Using Supervised Neural Networks 3 Hours

Image recognition training and deployment process – step by step - Convolution neural network
process

Module:6 Speech Recognition 3 Hours

Natural language processing - Reasoning from context - Understanding intent - Speech recognition -
Text to speech

Module: 7 Task analysis in Robots 6 Hours

Decision trees for robot movements - Pruning - Entropy - One hot encoding - Random forests - Grid
searching and A* (A-Star) - D* (Dynamic A* ) Algorithm

Module:8 Contemporary Issues 2 Hours

Total Lecture Hours: 30 Hours

Text Books:
1. Steven M. LaValle, Planning Algorithms Published by Cambridge University Press, 2009
2. Francis X. Govers, Artificial Intelligence for Robotics: Build intelligent robots that perform
human tasks using AI techniques, Packt Publishing, 2018

References Books:
1 Maja J Matarić, ―The Robotics Primer‖, The MIT Press Cambridge, Massachusetts London,
England
2 P. Corke, Robotics, Vision & Control , Springer Publishers, 2013
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Projects (Indicative)
1. Lane detection for ADAS
2. Pedestrian detection
3. Gesture detection
4. Recommendation system for music system
5. Classify audio
6. Question Answering system
7. Object detection in images
8. Distance of an object and navigation algorithms
Mode of Evaluation: Reviews
Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course Code Course Title L T P J C
CSE4042 Evolutionary Computation for Video Processing 2 0 0 4 3
Pre-requisite CSE3043 Syllabus version
v. 1.0
Course Objectives (COB):
4. To provide an in-depth introduction to technologies and techniques currently used in the video
processing
5. To understand video processing and application development
6. To understand the processes, mechanics, issues of evolutionary algorithms for video processing.
7. To determine the appropriate parameter settings to make evolutionary algorithms work well for
motion detection and video enhancement.
8. To design new evolutionary operators, representations and fitness functions for specific
applications.

Expected Course Outcomes (CO):

1. Understand the relations between the most important evolutionary algorithms presented in the
course
2. Understand the implementation issues and choose unique optimal video processing strategies.
3. Create new motion detection, video segmentation and enhancement techniques based on
present trends.
4. Apply evolutionary computation techniques for various video processing applications

Module:1 Introduction to Evolutionary Computation 3 hours

Biological and artificial evolution, Evolutionary computation and AI, Evolutionary Biology
background and terminology, Different branches of EC, A Simple evolutionary algorithm

Module:2 Genetic Algorithms 4 hours

Representation- operators- standard algorithm, Genetic Programming, Selection mechanisms,
Optimization using Genetic Algorithm

Module:3 Swarm Intelligence 4 hours

Ant Colony Optimization, Particle Swarm Optimization, Artificial Bee Colony Algorithm, Fitness
Optimization

Module:4 Motion Estimation 5 hours

Motion Detection, Motion Estimation, Motion Compensated Filtering, Evolutionary algorithms:
sparse matching, motion estimation, hierarchical block matching algorithm

Module:5 Video Segmentation 6 hours

Scene change detection, motion segmentation, video segmentation using evolutionary computation
algorithm, video abstraction using swarm optimization, Fast algorithm

Module:6 Video Enhancement and Restoration 6 hours

Noise Filtering, Blotch Detection and Removal, Intensity Flicker Correction, Scratch Removal,
Video Quality Assessment, Restoration, Super-resolution, Video Enhancement and Restoration
using evolutionary computation

Module:7 Tracking and Optimization 2 hours

Motion Tracking in Video- 2D and 3D Motion Tracking in Digital Video, Object tracking using
genetic algorithm, Multi-objective optimization with evolutionary algorithms, Exhaustive search,
phase correlation algorithm

Module:8 Contemporary Issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Banzhaf, Nordin, Keller and Francone,"Genetic Programming: An Introduction", Morgan-
Kaufmann, 1998
2. Yao wang, Joem Ostarmann and Ya – quin Zhang,‖ Video processing and communication ―,1st
edition , PHI , 2002
Reference Books
1. Eiben and Smith "Introduction to Evolutionary Computation", Springer, 2003
2. Alan C. Bovik, ‗The Essential Guide to Video Processing‘, Elsevier Science, edition 2, 2009
3. M. Tekalp ,‖Digital video Processing‖, Prentice Hall International, 2015
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment / Quiz / Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,
6. Motion detection using genetic algorithm
7. Video abstraction using ant colony optimization
8. Video Segmentation in genetic algorithm and particle swarm optimization
9. Video based frame clustering using swarm optimization
10. Video enhancement using evolutionary computation
Mode of Evaluation: Reviews
Recommended by Board of studies 30/10/2020
Approved by Academic Council 60th AC Date 04/11/2020
Course Code Course Title L T P J C
CSE4049 Speech and Language Processing using Deep Learning 3 0 2 0 4
Pre-requisite CSE3043 Syllabus
version
v. 1.0
Course Objectives (COB):
1. Be competent with fundamental concepts for natural language processing and automatic speech
recognition
2. To understand technologies involved in developing speech and language applications.
3. To demonstrate use of deep learning for building applications in speech and natural language
processing

Expected Course Outcomes (CO):

1. Describe ways to represent speech and words
2. Demonstrate the working of sequence models for text
3. Adapt a dialogue system to a specific domain
4. Use signal processing techniques to analyze/represent the speech signal
5. Execute trials of speech/language systems

Module:1 N-gram Language Models 5 hours

Overview of NLP - Understanding Words – Corpora – Bag of Words - Text normalization - N-
grams – Smoothing - Perplexity

Module:2 Word Embedding 5 hours

Lexical & word semantics – Words and vectors – Cosine similarity – Vector-Space models – TF-
IDF – Word2vec – Bias and embedding – Evaluating vector models

Module:3 Sequence Processing 7 hours

Text Classification – Sentiment Analysis – Recurrent neural networks – Context in RNNs –
Transformer networks – Machine translation – Encoder-decoder RNNs – Attention – Beam search –
Evaluation of translation.

Module:4 Dialogue Systems 5 hours

IR based question answering system – Entity linking – Knowledge based Q&A – Language models
for Q&A – Evaluation of systems – Chatbots – Human dialogue – Frame based dialogue – Dialogue
state architecture – Evaluating dialogue systems.

Module:5 Speech Production and Perception 5 hours

Fundamentals of speech production – Short-Term Fourier representation of Speech – Functions of
the ear – Perception of sound – Vocal tract model

Module:6 Speech Signal Processing 7 hours

Short-Time analysis of the signal – Energy – Zero crossing – Autocorrelation – Short time Fourier
analysis - Spectrogram – Filter-banks – Cepstrum – Linear Predictive Coding – Mel-Frequency
Cepstrum
Module:7 Automatic Speech Recognition 10 hours
Automatic Speech recognition formulation – HMM based speech recognition – Isolated word
recognition – Large vocabulary continuous speech recognition – Deep learning for language
modeling and automatic speech recognition – Evaluation metrics. Speaker recognition –
Alexa/Google assistant based application development.

Module:8 Contemporary Issues 2 hours

Total Lecture hours: 45 hours

Text Book(s)
1. Speech and Language Processing, 3rd Ed., Daniel Jurafsky & James H. Martin, 2020.
2. Theory and Applications of Digital Speech Processing, Lawrence R. Rabiner, Ronald W.
Schafe, 1st Edn. Pearson, 2010.
Reference Books
1. Digital Speech Processing Using Matlab, E. S. Gopi, Springer, 2014
2 Voice Applications for Alexa and Google Assistant, Dustin Coates, Manning Publications,
2019.
3 Speech and Audio Processing A MATLAB -based Approach, Ian Vince, McLoughlin,
Cambridge Press, 2016.
4. Natural Language Processing with TensorFlow, Thushan Ganegedara, Packt, 2018
5. An Introduction to Voice Computing in Python, Jim Schwoebel, NeuroLex, 2018
6. Text Analytics with Python, Dipanjan Sarkar, Apress, 2019
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment / Quiz / Final Assessment
Test (FAT) / Seminar

List of challenging Experiments – Indicative

Text preprocessing – Tokenization, handling special chars, Stemming,

1 Lemmatization 2 hours

2 Building N-gram language Model and testing its perplexity. 2 hours

3 TF-IDF model, document similarity 2 hours

Creating/using Word2vec and Glov2vec models and testing their
4 performance 2 hours

5 LSTM for generating prose 2 hours

Machine translation from German to English/ or Indian language to
6 English 2 hours

7 Creating a chatbot like a hostel help desk. 2 hours

8 Speech signal analysis- FFT, spectrogram, LPC, MFCC features 2 hours

9 HMM based Isolated word recognition 2 hours

10 Kaldi/ Sphinx Continous speech recognition 4 hours

11 Alexa speech enabled application development 4 hours

12 Google voice API based speech transcription. 4 hours

Total Laboratory Hours 30 hours

Mode of Assessment: Continuous Assessment Test(CAT) & Final Assessment Test (FAT)

Recommended by Board of studies 8-2-2021

Approved by Academic Council 61st Date 18-2-2021
Course Code Course title LT P J C
CSE4043 Audio/Video Forensics 3 0 0 4 4
Prerequisites CSE3043 Syllabus Version
1.0

Course Objectives (CO):

1. To learn introduction to Audio/ Video Forensic
2. To understand the various ways of recovering Graphic files
3. To comprehend the systematic process of acquiring, authenticating and analyzing digital evidence
using AI and machine learning
4. To perform forensic investigations in mobiles.

Expected Course Outcomes:

1. Understand digital (audio/ video) forensic basic concepts
2. Realize the potential ways to customize and authenticate audio/ video data for forensics
3. Examine the role of digital forensics in mobile phones
4. Learn about the forensic audio video analysis using AI and machine learning
5. Explore various tools to handle digital forensics.
6. Social problem solving to assess issues like safety, legal, cultural, etc., and engineering.

Module:1 Introduction 5 hours

Forensic Audio/ video Analysis: Authenticity, Enhancement, and Interpretation, Fundamentals of
Audio/video Signals and Systems, Handling Forensic Evidence, Audio/video Signal Enhancement,
Forensic Interpretation.

Module:2 Data Acquisition and tools 6 hours

Understanding Storage Formats for Digital Evidence, Raw Format, Proprietary Formats, Advanced
Forensic Format, Determining the Best Acquisition Method, Forensics Acquisition Tools - SnapBack
DatArrest, NTI SafeBack, DIBS USA RAID, ILook Investigator IXimager, ASRData SMART.

Module:3 Recovering Graphics files 8 hours

Recognizing a Graphics File, Understanding Bitmap and Raster Images, Vector Graphics, Graphics File
Formats, Camera File Formats, Data Compression, Locating and Recovering Graphics Files, Identifying
Graphics File Fragments, Repairing Damaged Headers, Reconstructing File Fragments, Identifying
Unknown File Formats. Analyzing Graphics File Headers, Tools for Viewing Images, Steganography in
Graphics Files, Using Steganalysis Tools.

Module:4 Conversion, Extraction and Authentication 8 hours

Spectrography –Conversion of different voice file formats in to forensic voice module formats. Various
types of spectrograms, spectrographic cues for vowels and consonants. Speech analysis in forensic
sciences. Speech synthesis by analysis, Speech recognition and speaker identification. Forensic
extraction of video files from DVR and other storage media. Forensic examination of DVR containing
video footages, its frame analysis. Forensic examination and authentication of meta data present in
video/audio files. Enhancement of video/ Photo and its comparison/authentication.
Module:5 Mobile Phone Forensics 5 hours
Mobile Hacking—SMS and Call Forging, Mobile Phone Forensics, Forensic Procedures, CIA Triad,
Software and Hardware Mobile Phone Tricks, Android Forensics, Mobile Forensic Tools.

Module:6 Forensics using AI 6 hours

Deductive Forensics- Anticipating Attacks and Precrime: Artificial Intelligence Techniques: Decision
Tree Techniques and Tools: Free and Shareware, Rule Generator Technique and Tools, The Streaming
Analytical Forensic Processes, Forensic Real-Time Modeling, Deductive Forensics for Precrime.

Module:7 Machine Learning Forensics 5 hours

Machine Learning Forensics for Cybersecurity, Deep Packet Inspection (DPI), Software Tools Using
DPI, Network Security Tools , Combating Phishing, The Foreign Threat-The CNCI Initiative Details,
Forensic Investigator Toolkit, Wireless Hacks, Incident Response Check-Off.

Module:8 Contemporary Issues 2 hours

Total Lecture Hours: 45 hours

Text Books:
1 ―Principles of Forensic Audio Analysis‖, Robert C. Maher, Springer, Cham,2018
2 ―Digital Forensics: The Fascinating World of Digital Evidence‖, Nilakshi Jain, Dhananjay R.
Kalbande, Wiley Publication. 2017
3 ―Guide to Computer Forensics and Investigations‖ 5th Edition, Nelson, Phillips, Steuart, Cengage
Learning, 2015

References Books:
1 ―Machine Learning Forensics for Law Enforcement‖, Security and Intelligence, Jesus Mena (2011),
CRC Press
2 "Mobile Forensic Investigations: A Guide to Evidence Collection, Analysis, and Presentation",
Reiber, L (2016) McGraw-Hill Education,
3 "Hands-on Activities in Digital Forensics",Robinson, M. (2015), CreateSpace Independent Publishing
Platform
4 "Cybercrime and Digital Forensics: An Introduction". Routledge, Holt, T (2017).
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Projects (Indicative)
# Generally a team project [5 to 10 members]
# Concepts studied in CPSXXX should have been used
# Down to earth application and innovative idea should have been attempted
# Report in Digital format with all drawings using software package to be submitted.
# Assessment on a continuous basis with a minimum of 3 reviews.
# Projects may be given as group projects.

Projects on audio / video analytics using software tools for forensic

1. E-mail related crimes,
 2. Internet relay,
3. Chat relating crimes,
4. Mobile related crimes,
5. Sale of illegal articles,
6. Online gambling,
7. Phishing,
8. Intellectual property crimes,
9. Web defacement,
10. DOS attack,
11. Cyber stalking, etc.,
Mode of Assessment: Reviews
Recommended by Board of 30/10/2020
studies
Approved by Academic No. 60 Date 04/11/2020
Council
Course Code Course Title L T P J C
CSE3045 IoT for Smart Cities 2 0 0 4 3
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives (COB):
1. To understand the requirement of Smart Cities
2. To develop applications for Smart Cities
3. To integrate various applications and modules with IoT Systems.

Expected Course Outcomes (CO):

1. Understand the working principles of IoT layers and their relation to OSI layers.
2. Understand the fundamentals of Smart City requirements
3. Learn to design an application for smart city application.
4. Identify the requirements of the stakeholders involved in the smart city application

Module:1 Introduction to IoT 5 hours

Introduction to IoT – Various IoT Layers - Various Communication models - Communication
technologies and Protocols for IoT – CoAP, MQTT, LoRa, Zig Bee, IEEE 802.15.4.

Module:2 Introduction to Smart Cities 3 hours

Smart City requirements – Definitions of Smart City - Key IoT challenges and solutions for Smart City
deployment – List of smart cities around the globe – Functionalities of Smart City Applications

Module:3 Smart Home Applications 4 hours

Introduction to Smart Homes – Smart Energy consumption – Sensors in energy consumption – Cloud
applications for storing data from/to home based IoT devices – Intrusion detection – Smart air quality
monitoring system – Thermostat applications

Module:4 Electric Vehicles and Vehicular Networks 3 hours

Architecture of Electric vehicles – Battery management – EV functional blocks – usage of EVs in
Indian Roads - Vehicular networks – Vehicle to Vehicle communication (V2V) – Vehicle to
infrastructure communication (V2I) –Sensors needed for Electric vehicles – Internet of Vehicles (IoV).

Module:5 Smart Grid 3 hours

Energy through grids – definition of smart grids – Solar and Wind energy deployment for the city –
structural health monitoring of grids – Prognostic health management of Smart Grids – Energy
harvesting.

Module:6 UAVs – Drones – Flying Adhoc Networks 7 hours

Introduction to Drones, UAVs or Flying Ad Hoc Networks (FANETs)– Challenges, features –
Mobility model, propagation model. Applications for FANETs– Disaster Mitigation and monitoring-
Search and rescue operations – Supply chain and Ecommerce product delivery, etc.

Module:7 Security and Privacy in Smart City Applications 3hours

Security Issues – Data integrity, confidentiality and authentication – trust and key management – denial
of service (DoS) – Big Data management like volume, velocity and variety of data handling in smart
city – Block chains for Smart City applications
Module:8 Contemporary Issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Intelligence in IoT-enabled Smart Cities, Fadi Al-Turjman, CRC Press 2019
Reference Books
1. Internet of Things for Smart Cities, Ejaz, Waleed, Anpalagan, Alagan, Springer Series, 2019
2 Security and Organization within IoT and Smart Cities, Kayhan Zrar Ghafoor, Kevin Curran,
Linghe Kong, Ali Safa Sadiq, CRC Press, 2021
3 IoT Technologies in Smart-Cities, Fadi Al-Turjman, Muhammad Imran, 2020. IET
4. Stephan Olariu, Michele C. Weigle, ―Vehicular Networks from Theory to Practice‖, CRC Press.
5 Selected journal papers on FANETs, VANETs, IoV and Smart Cities
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment Test
(FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles:
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,
1. Design of smart energy metering for smart homes
2. Implementation of UAV, Drones for Intrusion detection and surveillance
3. VANET simulation on Vehicle to Vehicle connectivity
4. CoAP and MQTT deployment for IoT application.
5. Smart Home application development
Mode of Evaluation: Reviews
Recommended by Board of studies 8-2-2021
Approved by Academic Council 61st Date 18/2/2021
Course Code Course Title L T P J C
CSE4064 Event Processing and correlation Systems 2 0 0 4 3
Pre-requisite CSE3045 Syllabus version
v. 1.0
Course Objectives (COB):
1. Explore event processing and correlation techniques.
2. Understanding the building blocks of event processing
3. Gain experience using tools and common processes in event processing

Expected Course Outcomes (CO):

1. Understand the building blocks and basic principles of event processing
2. Detect the event patterns for inference, optimization and further analysis of forthcoming patterns
3. Evaluate the event streams and event stream processing
4. Analyze the Complex Event Processing design patterns

Module:1 The Basics And Principles Of Event Processing 4 hours

Event-driven behavior and event-driven computing, Introduction to event processing, The business
value of an event processing platform, Principles of event processing, Events and event-based
programming, Main concepts of event processing

Module:2 The Building Blocks 4 hours

Defining the events, Event types, Header and Payload Attributes, Event representation in practice,
Producing the events
Event producer: concept and definition element, The various kinds of event producers, Consuming the
events,
Event consumer: concept and definition element, The various kinds of event consumers, Interfacing
with event consumers

Module:3 Event Processing 4 hours

The event processing network, Event processing agents, Event channels, Global state elements, Putting
events in context, Temporal context, Spatial context, State-oriented and Segmentation-oriented
context, Composite contexts, Filtering and transformation, Examples, Detecting event patterns

Module:4 Pragmatics 4 hours

Engineering and implementation considerations, Event processing programming in practice, Non-
functional properties, Performance objectives, Optimization types, Event processing validation and
auditing

Module:5 Event Streams And Unified Logs 4 hours

Introducing event streams, Exploring familiar event streams, Unifying continuous event streams,
Introducing use cases for the unified log : anatomy of an unified log, setting up of an unified log

Module:6 Event Stream Processing 4 hours

Event stream processing with Apache Kafka, Designing a stream-processing app, Writing a simple
Kafka worker, Writing a single-event processor

Module:7 Complex Event Processing 4 hours

The Event-Enabled Enterprise, Concepts, Complex Events, Complex Event Processing, CEP solution
Design Patterns, Variability in CEP architectures, Condition Detection, Situation Recognition, Track
and Trace, Business Process Timeliness Monitor, Situational Response, Decision as a Service,
Orchestrated Response, TIBCO Business Events

Module:8 Contemporary Issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Opher Etzion, Peter Niblett, ―Event Processing in Action‖, Manning, 2011.
Reference Books
1. Alexander Dean, Valentin Crettaz, ―Event Streams in Action real-time event systems with
kafka and kinesis‖, Manning, 2019.
2 Paul C. Brown ―Architecting Complex-Event Processing Solutions with TIBCO‖, Addison-
Wesley, 2014.
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment Test
(FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,
1. Event Programming using Java Esper
2. Event Processing using TIBCO
3. Complex Event Processing for Intrusion detection
4. Event Validation systems for abnormality detection
Mode of Evaluation: Reviews
Recommended by Board of studies 8/2/2021
Approved by Academic Council 61st Date 18/02/2021
Course code Course title L T P J C
CSE4051 Predictive Analysis and IoT 3 0 0 4 4
Prerequisite: CSE3045 Syllabus version
V 1.0
Course Objectives (COB):
1. This course will introduce predictive analytics using IoT sensor data.
2. The course objective :
3. To understand how predictive analytics can be applied in different domains.
4. To understand applications of Industrial IOT.
5. To understand the role of IOT in Smart cities.

Expected Course Outcomes (CO):

1. Understand the need of Analytics on IoT data.
2. Identify different data formats and applications of AI on IoT data.
3. Understand different domains like Personal healthcare, home, Industrial data and smart cities data.

Module:1 Principles and Foundations of IOT and AI 6 hours

IOT reference model – IOT platforms – IOT verticals – Big data and IOT- Infusion of AI, Data Science in IOT
– cross - industry standard for data mining – AI and IOT platforms
Module:2 Data Access and Distributed Processing for IOT 6 hours
Data formats: TXT, CSV, XLSX, JSON, HDF5, SQL, NO Sql, HDFS data formats – Spark ML for IoT data
Module:3 Personal IOT 6 hours
Personal IOT – super shoes by MIT – Continuous glucose monitoring – Hypoglycemia prediction using CGM
data – Heart Monitor – Digital assistants
Module:4 Home IOT 6 hours
IOT and smart homes – Human activity recognition – HAR using wearable sensors – HAR from videos –
smart lighting – Home surveillance
Module:5 AI for the Industrial IoT 6 hours
Introduction to AI- powered industrial IoT – Use Cases – predictive maintenance using AI, LSTM -
Advantages and disadvantages – Electrical load forecasting in industry- STLF using LSTM
Module:6 AI for smart Cities IoT 6 hours
Smart Cities – smart traffic management – parking – waste management – Policing – lighting governance –
Challenges and benefits.
Module:7 Use Cases 7 hours
Anomaly Detection using IOT – Web based mobile health app using ML – Predict equipment failure using IoT
sensor data – Analyze industrial equipment for defects – Detect change points in IoT sensor data – Detect
voltage anomalies in household IoT devices
Module:8 Contemporary Issues 2 hours

Total Lecture Hours 45 hours

Text Books:
1. Amita Kapoor, ― Hands-On Artificial Intelligence for IoT‖, Packet Publishing, 2019.
2. Andrew Minteer ―Analytics for Internet of Things‖ –– Packt Publishing, 2017.

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles
Generally a team project [3 to 4 members]. The project can cover some of the following
(tentative domains). i.e.,
1. Smart traffic management
2. Waste management
3. Smart Home Using sensors
Mode of Evaluation: Reviews
Recommended by Board of studies 8/2/2021
Approved by Academic Council 61st Date 18/02/2021
Course code Course title L T P J C
CSE4052 Smart Product Development 2 0 0 4 3
Pre-requisite CSE3045 Syllabus version
v. 1.0
Course Objectives (COB):
1. To learn the fundamentals of Product development and its processes.
2. To understand the how smart system processes and its functional elements
3. To learn the mapping for smart systems in Industry 4.0
4. To design & develop a Knowledgebase for Experts Systems
5. To apply Smart Product Development across multidisciplinary Engineering

Expected Course Outcome (CO):

1. Understand the processes in product design & development
2. Identify the key elements in smart product technologies in Industry
3. Understand the integration of knowledge based smart systems
4. Learn the existing smart systems and products in the industry
5. Design & Develop a Smart Expert System

Module:1 Product Development Processes 4 hours

Product Development Life Cycle, Process Models - Prototyping - Agile Models
New Product Development Processes – Knowledge based/driven development – Principal Issues
and Challenges.

Module:2 Smart Process Elements 4 hours

User and Customer Research – User observation – Customer interviews-Competitor landscape, Cost
Analysis – Product teardown-Analysis input mapping, Concept generation – Analysis wrapup –idea
generation-idea evaluation-concept formulation, Prototype Testing

Module:3 Smart Technologies in Industry 4.0 3 hours

Cloud Services, Bigdata & Analytics, Engineering Simulation, 3D printing, Additive
Manufacturing.

Module:4 Knowledge based System Development 4 hours

Knowledge Discovery, Knowledge Representation, Knowledge Catalogue, Knowledge Graphs,
Knowledge Visualization

Module:5 Deep QA processes 4 hours

Deep QA Architecture, Exploring Deep QA – Question Analysis-Primary Search-Hypothesis
Generation-Merging and Ranking, Microservices and Robust Tooling in DeepQA
Module:6 WATSON 4 hours
Watson Community Services and Watson Discovery Services, Watson Deep Learning, Chatbot,
Natural Language Classifier, Concept Expansion, Concept Insights, Language Identifications and
Translations, Visualization and Rendering

Module:7 Design of an Expert System 5 hours

Expert System Architectures, An analysis of some classic expert systems – WATSON, Deep expert
systems, Co-operating expert systems and the blackboard model

Module:8 Contemporary Issues 2 hours

 Total Lecture hours: 30 hours
Text Book(s)
1. Smart Product Design, Sendpoints Publications, 2017
2. Grega Jakus, Veljko Milutinovic, Sanida Omerovic, Saso Tomazic, ―Concepts, Ontologies,
and Knowledge Representation‖, Springer, 2013
3. Ronald J. Brachman and Hector J.Levesque, ―Knowledge representation and reasoning‖, 2nd
edition, Elsevier publications, 2004.
4. Simon Kendal, Malcolm Creen, ―An Introduction to Knowledge Engineering‖, Springer,
ISBN-13: 978-1846284755, 2007
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
Project
Sample Project Titles (Indicative) :
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e., Like IBM WATSON services students can develop their own
products in following domain for various applications
1. knowledge discovery
2. Natural language processing
3. Assistants/ chatbot
4. Vision
Mode of Evaluation: Reviews
Recommended by Board of Studies 8-2-2021
Approved by Academic Council No.61st Date 18-2-2021
Course Code Course Title L T P J C
CSE4053 Malware Analysis in Data Science 2 0 2 4 4
Pre-requisite CSE3046 Syllabus version
v. 1.0
Course Objectives (COB):
1. The objective of this course are:
2. To understand and analyse malware using static and dynamic analysis
3. To observe malware behaviour
4. To build and analyse Malware Networks
5. To identify adversary groups through shared code analysis
6. To catch vulnerabilities by building your own machine learning detector
7. To measure malware detector accuracy
8. To identify malware campaigns, trends, and relationships through data visualization

Expected Course Outcomes (CO):

1. Analyse malware behaviour and identify its adversary groups
2. Build your own machine learning detector system to catch vulnerabilities and to measure its
accuracy
3. Visualize malware threat data to reveal attack campaigns and trends

Module:1 Static and Dynamic Malware Analysis 4 hours

Basic Static Malware Analysis: Static Analysis Definition - Microsoft Windows PE format –
Dissecting PE format using PE file – Examining Malware images – Strings – Factors that Limit Static
Analysis
Introduction to Dynamic Analysis: Why use Dynamic Analysis – Dynamic analysis for data science –
Basic tools for dynamic analysis – Limitation of basic dynamic analysis

Module:2 Identifying Attacks 4 hours

Identifying Attack Campaigns using Malware Networks: Bipartite Networks – Building and
Visualizing Malware Networks – Building a shared image relationship network

Module:3 Shared Code Analysis 5 hours

Shared Code Analysis: Samples comparisons by extracting features – Jaccard Index to quantify
similarity – Evaluate Malware Shared Code estimation methods – Building a Similarity Graph –
Persistent Malware Similarity Search System

Module:4 Malware Detectors and Evaluation 8 hours

Machine Learning Based Malware Detectors : Steps for building detector – Understanding Feature
Spaces and Decision Boundaries – Overfitting and Underfitting – Major Types of Machine Learning
Algorithms: Logistic Regression – K-Nearest Neighbors – Decision Trees – Random Forest - Toy
Decision Tree based Detector – Real World Learning Detectors with sklearn – Industrial Strength
Detector
Evaluating Malware Detection System: Four possible Detection Outcomes – Considering base rates
in evaluation- Evaluating the Detector‘s performance

Module:5 Visualizing Malware 4 hours

Visualizing Malware Trends: Understanding our Malware Dataset – Using matplotlib to visualize data
– Using seaborn to visualize Data
Module:6 Deep Learning 3 hours
Deep Learning Basics - Building a Neural Network Malware Detector with Keras

Module:7 Contemporary issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Malware Data Science – Attack Detection and Attribution , Joshua Saxe and Hillary Sanders,
No Starch Press, 2018
Reference Books
1. Machine Learning and Security: Protecting Systems with Data and Algorithms, Clarence
Chio, David Freeman, 1st Edition, O‘Reilly Media, Feb 2018.
2 Mastering Malware Analysis: The complete malware analyst's guide to combating malicious
software, APT, cybercrime, and IoT attacks, Alexey Kleymenov, Amr Thabet, 1st Edition,
Packt publishing, 2019.
3 Practical Malware Analysis, Michael Sikorski, Andrew Honig, No Starch Press, 2012

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment / Quiz / Final Assessment
Test (FAT) / Seminar
List of Experiments (Indicative):
Tools: PEiD, FileAlyzer, PEView, DependencyWalker, HexEditor, Procmon, Process Explorer,
RegShot
1. Perform Dynamic Analysis and Static Analysis for the following malware samples:
 Mabezat
 Katar
 Tescrypt
 Rootkit
 DocIcon
 Autorun
 Dropper
 Downloader
 Banker
 FakeAV
2. Using Shared Code Analysis, compare two malware samples by estimating the percentage of
precompilation source code they share. Visualize malware relationships to better understand
code-sharing pattern between malware samples.
3. Build a Machine Learning based Malware Detectors by considering ‗N‘ number of benignware
sample dataset and malware sample dataset for training your own machine learning detection
system.
4. Create your own visualization for the malware samples of size ‗N‖ (here N is very huge in
size) that can lead to valuable insights like when it was first seen, how many anti-virus
products detected it, and what kind of malware it is (for example Trojan horse, ransomware
and so on).
5. Visualizing and classifying malware using image processing techniques [Use Malimg dataset
for images]

Mode of Evaluation: Continuous Assessment Test (CAT) & Final Assessment Test (FAT)
List of Projects (Indicative)
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,
1. The student can take samples for each type of malware and analyse the behavior of the
same and submit the pdf report covering the following aspects:
a. Preliminary setup
b. Malware execution
c. Malware Analysis
d. Malware Traces
e. Malware persistence
f. Unique Behavior
g. Removal procedure
h. Conclusion
2. Malware classification by string and function
3. Malware classification using Image representation [use Malimg dataset]
4. Malware analysis by mining API calls
5. Classification of malware by call graph clustering
6. Exploring multiple execution paths for malware analysis
7. Flow techniques for containment and malware analysis
8. Malware Detection based on analysing behaviour graphs using Deep Learning
9. Indicator of Compromise extraction
Method of Evaluation: Reviews
Recommended by Board of studies 8-2-2021
Approved by Academic Council No: 61st Date 18/2/2021
Course code Course title L T P J C
CSE4065 Modeling and Simulation of Digital Systems 2 0 2 0 3
Pre-requisite CSE3045 Syllabus version
v.1.0
Course Objectives (COB):
1. To analyze and design hierarchical digital systems
2. To model, simulate, and synthesize digital systems using hardware description languages (HDL)
3. To realize system design with programmable logic devices

Expected Course Outcome (CO):

1. Distinguish the principles and methodology of digital logic design at the logic level and gate
level
2. Design a digital system from problem specifications with optimal hardware and computational
time
3. Exhibit knowledge of HDL programming
4. Synthesize combinational and Sequential logic circuits and interpret the results

Module:1 Modeling and Simulation of Digital Systems 2 hours

Introduction: Modeling, Synthesis and Simulation – Logic Devices: Standard, Custom and
Programmable – Field Programmable Gate Arrays

Module:2 VHDL 4 hours

Hardware Description Languages – VHDL – Programming structure – Data Types – Operators –
Signal and Generate – Sequential Statements- Decision and Loop Statements – Subcircuit design –
Packages – Components

Module:3 Modeling 2 hours

Modeling a digital system - Types of Modeling: Dataflow, Behavioral, Structural ,

Module:4 Modeling Combinational Circuits 4 hours

Adder – Subtractor – Carry Ripple Adder – Decoder – Encoder – Multiplexer – Demultiplexer

Module:5 Modeling Sequential Circuits 7 hours

Latches – Flip-flops – Counters: Up, Down and Mod – Registers: Parallel, Shift – Finite State
Machine : Moore and Mealy Model

Module:6 Verilog 4 hours

Logic Elements – Expressions – Primitives – Operators – Statements – Decision and Loop
Statements – Module – Ports – Task- Function

Module:7 Modeling of PLDs and ASMs using Verilog 5 hours

Programmable Read only Memory – Programmable array logic and Programmable logic array –
Asynchronous Sequential Machine

Module:8 Contemporary Issues 2 hours

 Total Lecture hours: 30 hours

Text Book(s)
1. Mohammed Ferdjallah – Introduction to Digital Systems: Modeling , Synthesis and
Simulation using VHDL, Wiley India – 1st Edition- 2012, ISBN: 978-1-118-30348-1
2. Joseph Cavanagh – Verilog HDL Design Examples, CRC Press – 1st Edition-2017,
ISBN:978-1-138-09995-1
Reference Books
1. Zainalabedin Nawabi – VHDL – Analysis and Modeling of Digital Systems – McGraw-Hill
Professional- ISBN-13:978-0070464797
2. Charles H Roth.Jr, Lizy Kurian John, ByeongKil Lee- Digital System Design using Verilog,
Cengage Learning – 1st Edition 2016- ISBN-13: 9781285068374
3. K.C.Chang – Digital Systems Design with VHDL and Synthesis – An integrated approach,
Wiley-IEEE Computer Society –ISBN-13: 978-0769500232
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Challenging Experiments (Indicative)
1. Introduction to Active HDL and simulation of basic gates functionality 2 hours
2. VHDL Modeling, Simulation and Synthesis of Combinational Circuits
Adder and Subtractor 2 hours
Magnitude Comparator 2 hours
BCD-Seven Segment Decoder 2 hours
3. VHDL Modeling, Simulation and Synthesis of Sequential Circuits
Latches and Flip-Flops 2 hours
Universal Register/Counter 4 hours
Binary Up/Down Counter 4 hours
Parity Generator and Checker 4 hours
4. Verilog Modeling and Simulation of Combinational and Sequential Circuits
PROM based design 2 hours
PLA based design 2 hours
Protein Sequence Detector 4 hours

Total Laboratory Hours 30 hours

Mode of assessment: Continuous Assessment Test(CAT) & Final Assessment Test(FAT)
Recommended by Board of Studies 08-02-2021
Approved by Academic Council No. 61 Date 18-2-2021
Course Code Course Title L T P J C
CSE3046 Artificial Intelligence for Cyber security 3 0 0 4 4
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives (COB):
1. To learn the need of AI for Cyber Security
2. To learn the detection of DDOS using AI techniques
3. To learn the intrusion detection using Neural Networks
4. To learn the various applications of AI to detect cyber attacks

Expected Course Outcomes (CO):

1. Understand the cyber threats, attacks and vulnerabilities and its defensive mechanism
2. Understand and implement various AI techniques to detect cyber attacks
3. The recent challenges in AI related to cyber security and able to develop new security solutions to
the real time applications

Module:1 Fundamentals of AI 4 hours

Introduction – Problems that AI Solves – Why AI in Cyber security – Current Cyber Security
Solutions - Structured data, Unstructured data – Supervised learning – Unsupervised learning –
Reinforcement learning – classification problem - clustering problems – SVM – ANNs.

Module:2 AI and DDoS 7 hours

Time series – Types of Time series – Time Series analysis in Cyber Security – Detecting DDOS with
Time Series – Predicting DDOS attacks – Ensemble Techniques for Cyber security – Types of
Ensemble – Types of Ensemble Algorithms – Bagging, Boosting, Stacking, Bayesian Model -
Ensemble Method to detect Cyber attack.

Module:3 Detection of malicious web pages, URLs 7 hours

URL Blacklisting – Drive by download URL- Command and Control URLs – Phishing URLs – Using
Heuristics to detect Malicious Pages – Data for the analysis – Feature Extraction – Lexical Features –
Web Content based Features – Host based features – site Popularity features.

Module:4 CAPTCHA and Scan Detection 5 hours

Using AI to crack CAPTCHA – Types of CAPTCHA – ReCAPTCHA – Breaking a CAPTCHA –
Solving CAPTCHA with neural network - Machine Learning in Scan Detection - Machine-Learning
Applications in Scan Detection

Module:5 Context based Malicious event detection 6 hours

Context based Malicious event detection – Adware – Bots –Bugs – Ransomeware – Rootkit –
Spyware – Trojan horses – Viruses – Worms – Malicious Injections in Wireless networks.

Module:6 AI and IDS 7 hours

Architecture of IDS based on Neural networks – Intelligent flow based IDS - Multi-Agent IDS – AI
based Ensemble IDS – Machine Learning in Hybrid Intrusion Detection Systems - Machine-
Learning Applications in Hybrid Intrusion Detection: Anomaly - Misuse Sequence Detection System
- Parallel Detection System.

Module:7 AI and Mail Server 7 hours

Types of Mail Server – Data Collection from mail server – Naive Bayes theorem to detect spam –
Laplace smoothing – Featurization Techniques to covert text based emails to numeric values –
Logistic regression to spam filters - Anomaly detection techniques for SMTP and HTTP.

Module:8 Contemporary issues 2 hours

Total Lecture hours: 45 hours

Text Book(s)
1. Hands-On Machine Learning for Cyber Security: Safeguard your system by making your
machine intelligence using the python ecosystem, Soma Harder, Sinan Ozdemir, Packt
Publishing Ltd, 2018.
2. The state of the Art in Intrusion Detection System, AI-Sakib Khan Pathan, CRC Press,
Taylor & Francis Group, 2014

3. Data Mining and Machine Learning in Cyber Security, Sumeet Dua and Xian Du, CRC
Press, 2011.

Reference Books
1. Cybersecurity for Dummies, Brian Underdahl, Wiley, 2011
2 Cryptography and Network security, Behrouz A. Forouzan , Debdeep Mukhopadhyay, Mcgraw
Hill Education, 2nd Edition, 2011
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles :
Generally a team project [2 to 3 members].
The project should cover some of the following (tentative domains). i.e.,
1. Breaking CAPTCHA using machine learning algorithm
2. Detecting DDoS attack using Wireshark
3. Malicious event detection using Machine Learning approaches
4. Botnet and Traffic analysis using Machine learning
Mode of Evaluation: Reviews
Recommended by Board of studies 8/2/2021
Approved by Academic Council No: 61st Date 18/2/2021
Course code Course Title L T P J C
CSE4055 Cyber Threat Intelligence 1 0 4 0 3
Pre-requisite CSE3046 Syllabus version
v. 1.0
Course Objectives (COB):
1. Learn how to leverage intelligence to understand adversary behavior and make use of indicators of
compromise to detect and stop malware.
2. Identify and analyze the security problems and defend the cyber space
3. Understand and protect against attacks, threats and intrusions

Expected Course Outcome (CO):

1. Develop incidence response skills to combat network and system
2. Evaluate the security of network and system
3. Review and analyze threat intelligence logs and reports.
4. Discover and Respond to the threats

Student Learning Outcomes (SLO): 1,3,4

1. Having an ability to apply mathematics and science in engineering applications
3. Having an ability to be socially intelligent with good SIQ (Social Intelligence Quotient) and EQ
(Emotional Quotient)
4. Having Sense-Making Skills of creating unique insights in what is being seen or observed (Higher
level thinking skills which cannot be codified)

Module:1 Cyber – Attacks, Intrusions, Threats 2 hours

Introduction to cyber-attacks, attack model, Adversary Types, Vulnerability Types, Threat Types,
Attacks vs. Intrusion, DDoS, Types, Malware, malware Types, Introduction to Dark net, Cybercrimes.

Module:2 Cyber Threats and Intrusion Kill Chain 2 hours

Introduction to Advanced Persistent Threats, Intrusion Kill Chain, Zero days, Attack surface, Attack
vectors, Evasion techniques – Host and Network level evasions, Covert Communication: Infiltration
and Exfiltration, Advanced Evasion techniques

Module:3 Threat Intelligence 2 hours

Cyber Threat Intelligence (CTI), Overview of Threat Intelligence Lifecycle and Frameworks, CTI
types, generic threat actor, Indicators of Compromise (IoCs)

Module:4 Threat Intelligence Model 3 hours

Campaign analysis, Diamond model, Threat intel methodologies, Intrusion reconstruction, OSINT,
Challenges with detection intrusions.

Module:5 Security Operation Center (SoC) 3 hours

Introduction to SIEM, Threat Intelligence Data Collection, Threat Intelligence Collection
Management, Threat Intelligence data Feeds and Sources, Data Processing and analysis, Building
your own SOC, Visualizing the threat intelligence data.

Module:6 Reporting and Dissemination 2 hours

Threat Intelligence Reports: Baseline and Diff, Blacklists and Whitelists, Tracking, Integration
Module:7 Contemporary issues: 1 hour

Total Lecture hours: 15 hours

Text Book(s)
1 Wilson Bautista, Practical Cyber Intelligence: How Action-based Intelligence Can be an
Effective Response to Incidents, 2018, Packt publisher.
2 Arun E Thomas, Security Operations Center - SIEM Use Cases and Cyber Threat Intelligence,
2018.
Reference Books
1 Michael Hale Ligh , Andrew Case , Jamie Levy , Aaron Walters ,The Art of Memory
Forensics: Detecting Malware and Threats in Windows, Linux and Mac Memory, Wiley
Publisher.
2 Eoghan Casey, Digital Evidence and Computer Crime: Forensic Science, Computers, and the
Internet, Elsevier.
3 John Sammons, The Basics of Digital Forensics: The Primer for Getting Started in Digital
Forensics, Syngress publisher.

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment Test
(FAT) / Seminar
List of Challenging Experiments (Indicative)
1. a. Threat hunting using Sysinternals 2 hours
b. Open Source Intelligence – Information gathering (OSINT)
c. Deploying your own system defense using Wazuh/OSSEC

2. Vulnerability analysis using Wazuh/Nessus 2 hours

3. Deploying automated vulnerability management system using Wazuh 2 hours

4. Investigating malicious traffic using Wireshark 2 hours

5. Deploying your own system defense using Wazuh/OSSEC 2 hours

6. Deploying your own system defense using Wazuh/OSSEC 2 hours

7. Security and Log Data Analytics using Wazuh 2 hours

8. File Integrity Monitoring using Wazuh 2 hours

9. Configuration Assessment and Incident Response using Wazuh 2 hours

10 Regulatory Compliance using Wazuh 2 hours

11 Building your own Security Operation Center using ELK and Beats 2 hours
12 Integrating Wazuh with ELK stack 2 hours

13 Deploying Wazuh for cloud security monitoring 2 hours

14 Deploying Unified Security Management (USM) for security monitoring 2 hours

a. Threat detection

 Configure network IDS

 Configure host IDS through the Environment
screen
 Configure host IDS through the Assets screen
 Configure and perform vulnerability assessment

15 Generating Reports using USM 2 hours

 Describe the USM Appliance reporting system

 Run, schedule, and view a report
 Create custom reports
 Create custom layouts for your reports
 Create custom modules from security events and
logs

Total Laboratory Hours 30 hours

Mode of assessment: Continuous Assessment Test (CAT) & Final Assessment Test (FAT)
Recommended by Board of Studies 08-02-2021
Approved by Academic Council No. 61 Date 18-2-2021
Course Code Course Title L T P J C
CSE4054 Artificial Intelligence in Block chain 3 0 0 0 3
Prerequisite Artificial Intelligence for Cyber security Syllabus Version
Version: v.1.0
Course Objectives (COB):
The objective of this course is to:
1. to introduce the concept and the basics of blockchain technologies,
2. to provide knowledge on various applications of blockchain technologies
3. to comfortably discuss and describe the history, technology, and applications of Blockchain

Expected Course Outcomes (CO):

1. The students will be familiar with blockchain and cryptocurrency concepts.
2. The students will have practical knowledge on implementing blockchain ledgers
3. The students will be able to create an own Crypto token.

Module:1 Introduction to Blockchain 5 hours

Blockchain Introduction, history of blockchain, other technologies spawned from blockchain,
mechanism behind blockchain, limitations and challenges of blockchain.

Module:2 Applications of Blockchain 7 hours

Demystfying the blockchain, uses of blockchain, new components of blockchain, challenges in the
use of blockchain technology, more applications of blockchain technology.

Module: 3 Blockchain Consensus 7 hours

Distributed Consensus: Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn, Di_culty
Level, Sybil Attack, Energy utilization and alternate

Module:4 Blockchain and cryptocurrency 7 hours

Cryptocurrency: History, Distributed Ledger, Bitcoin protocols - Mining strategy and rewards,
Ethereum - Construction, DAO, Smart Contract, GHOST, Vulnerability, Attacks, Sidechain,
Namecoin

Module:5 AI in Blockchain 7 hours

The Blockchain as a Path to Artificial Intelligence, data collection, cleaning, and processing in AI
modelling, Smart Contract Advocates on Behalf of Digital Intelligence, Hyperledger

Module:6 Blockchain implementation 5 hours

Naive Blockchain construction, Memory Hard algorithm - Hashcash implementation

Module:7 Etherium 5 hours

Direct Acyclic Graph, Play with Go-ethereum, Smart Contract Construction, Toy application using
Blockchain, Mining puzzles

Module:8 Contemporary Issues 2 hours

Total Lecture Hours 45 hours

Text Book (s)
1. Blockchain for Beginners: The Complete Step by Step Guide to Understanding Blockchain
 Technology, Mark Watney, 2017
2. Blockchain: Step-By- Step Guide to Understanding and Implementing Blockchain
Technology, Paul Laurence, 2018
Reference Books
1 Ganesh Prasad Kumble , ―Hands-On Artificial Intelligence for Blockchain: Converging
Blockchain and AI to build smart applications for new economies‖ 2020
2 Kiran Garimella, Peter Fingar, Vint Cerf, ―AI + Blockchain‖ 2018
3 Stein Smith, Sean , Blockchain, Artificial Intelligence and Financial Services
Implications and Applications for Finance and Accounting Professionals, Springer, 2020

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
Recommended by board of studies 8-2-2021
Approved by academic council No:61st Date: 18-2-2021
Course Code Course Title L T P J C
CSE4444 Game Programming 2 0 2 4 4
Prerequisites Nil Syllabus
Version
1.0

Course Objectives (CO):

1. To provide an in-depth introduction to technologies and techniques currently used in the game
industry
2. To understand game design and development
3. To understand the processes, mechanics, issues in game design, and game engine development
4. To understand modeling, techniques, handling situations, and logic
5. To build and then integrate technologies such as multimedia, artificial intelligence, and physics
modeling into a cohesive, interactive game application.

Expected Course Outcomes:

1. Design, develop, test, evaluate, debug, and modify code to meet design specifications for
games.
2. Design unique gaming environments, levels and characters by choosing appropriate game
strategies and patterns based on an analysis of past and present trends.
3. Create and document the games by applying programming concepts using various tools to
meet requirements of the current marketplace.

Module:1 Introduction to Game Programming & Game engine architecture 3

Hours
Overview of game programming, Structure of a typical game team, game industry, game engine
history. Real Time Game Architecture, Engine Support: Subsystem Start-Up and Shut-Down,
Memory Management, Containers and Strings; Resource Management: File System, Resource
Manager.

Module:2 Basics of 2D & 3D Graphics and Mathematics in Gaming & Rendering 5

engine Hours
2D Graphics: Sprites, Tiled Images and Backgrounds; 3D Graphics: 3D Graphics Pipeline, 3D
Math, Coordinates and Coordinate Systems, Quaternion Mathematics, Transformations &
Geometry; The Rendering Engine: Triangle Rasterization, The Rendering Pipeline

Module:3 Lighting and Texturing Effects in game environment 6

Hours
Ray Tracing, Lighting in Computer Graphics, Types of Light Sources, Light Models; Materials:
Lambert Diffuse, Phong; Bump Mapping; Lighting Technique: Point Lights, Bloom; Shadows in
Games: Real-Time Versus Preprocessed Shadows, Types of Shadows, Texture mapping techniques,
Special Effects: Blurring, Particle Systems, Weapon Effects

Module:4 Game Physics 3

Hours
Basic Newtonian Mechanics: Forces: Gravitational Force, Friction, Centripetal Force, Energy:
Kinetic Energy, Potential Energy; Basic Kinematics: The Relationship Between Force, Acceleration,
Velocity and Location, Rigid Body Motion and Collision
Module:5 Introduction to Artificial Intelligence in Game 3
Hours
Why Games for Artificial Intelligence, Why Artificial Intelligence for Games; Game AI Panorama:
Methods (Computer) Perspective, End User (Human) Perspective, Player-Game Interaction
Perspective

Module:6 Solving search problems for Game move prediction and optimization 5
using AI Hours
Tree Search: Uninformed Search, Best-First Search, Minimax, Monte Carlo Tree Search;
Evolutionary Algorithms, Supervised Learning: Artificial Neural Networks, Support Vector
Machines
Module: 7 Game Design & Management 3
Hours
Game design, Differing game types, modes, and perspectives, scripting, audio engineering, Sound
and Music, level design; Game project management, Game design documentation, Rapid prototyping
and game testing

Module:8 Contemporary Issues 2

Hours

Total Lecture Hours: 30 Hours

Text Books:
1. Game Engine Architecture, 3rd Edition, Jason Gregory, A K Peters, 2019
2. Palmer G. Physics for game programmers. Berkeley: Apress; 2005
3 Artificial Intelligence and Games, Georgios N. Yannakakis and Julian Togelius, January 26,
2018, Springer

References Books:
1 Sherrod A. Game Graphic Programming. Cengage Learning; 2008.
2 McShaffry M. Game coding complete. Nelson Education; 2014
3 Akenine-Mo, T., Haines, E. and Hoffman, N., 2018. Real-time rendering
4 Fundamentals of Game Design, 3rd Edition, Ernest Adams, New Riders; 2013
5 Game Design Foundations, Second Edition, Roger E. Pedersen, Jones & Bartlett Learning;
2009
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Challenging Experiments (Indicative) Hours

1. Game engines - UNITY Basics/ Unreal/ Scratch, etc., 2 Hours

2. Model Creation – Unity/ MAYA 2 Hours
3. Create a 2D game - Ex. Flappy Bird Game 3 Hours
4. Create a 3D game –Ex. Ogre Game 3 Hours
5. Create a game environment to apply different types of light effects. 3 Hours
6. Create a physics based game play to realize all basic Newtonian effects 3 Hours
7. Create a Tilemap based Game 2 Hours
8. Apply Multiple Levels for any of the Games developed 2 Hours
9. AI as Player 3 Hours
10. AI as Non Player Character (NPC) – Navigation Mesh creation 3 Hours
11. Create a racing game 2 Hours
12. Create a board game 2 Hours
Total Laboratory Hours 30 Hours
Mode of Assessment: Continuous Assessment Test (CAT) / Final Assessment Test (FAT).
List of Projects (Indicative)
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,
1. Development of tile-based games
2. Development of a simple pinball-like game using game engines such as Unity3D
3. Development of puzzle games
4. Development of games such as Tetris
5. Development of games such as Othello
6. Development of board games
7. Development of action and racing games

Mode of Evaluation: Reviews

Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course code Course title L T P J C
CSE4044 AR / VR 2 0 2 4 4
Prerequisites Nil Syllabus Version

1.0

Course Objectives (CO):

1. To introduce the fundamentals of virtual reality systems, including geometric modelling,
transformations, graphical rendering, optics, and human vision.
2. To build a personal VR or AR application for their portfolio
3. To develop Virtual and Augmented Reality industry committed innovative technologies that can
be used in the development and production of immersive environments in the fields of
entertainment, education, training, medical and industrial innovation.

Expected Course Outcomes:

1. Design and develop framework for evaluating current and emerging immersive reality
technologies and applications
2. Understand the input, output devices, immersive surround sound, haptic and vibrotactile
devices, architecture and integrative immersive media platforms and VR programming
3. Analyze the best practices in VR, AR including design, prototyping and ethical code of conduct

Module:1 Design and Art Across Digital Realities 2 Hours

Introduction – How human interacts with computers – Modalities through Ages – New Modalities
– Types – Note on Hand Tracking and Hand Pose Recognition – Voice, Hands and Hardware
Inputs over Next Generation – Sensory Design – Sensory Principles.

Module:2 Introduction to Virtual Reality 4 Hours

A Brief History of Virtual Reality - The five Classic Components of a VR System - Reality,
Virtuality and Immersion -Virtual Reality for Art – VR for Animation – 3D Art Optimization –
Ideal Solution – Topology – Baking – Draw Calls – VR Tools to Create 3D Art – Acquiring 3D
models – Creating 3D models.

Module:3 Motion tracking, navigation and controllers in VR 5 Hours

Position and Motion Trackers - Magnetic, Mechanical and Ultrasonic Trackers - Navigation and
Manipulation Interfaces - Three-Dimensional Probes and Controllers - Data Gloves and Gesture
Interfaces - Human Perception and Cognition – Visual System – Auditory System – Physiology,
Psychology and Human experience - Effects of VR Simulations on Users - Cyber-sickness, before
and now - Guidelines for Proper VR Usage - User Centered Design, User Experience and an
Ethical Code of Conduct.
Module:4 Introduction to Augmented Reality 4 Hours

History of AR – Selection of AR Platform – Integrating Hardware and Software – Optical &

Inertial Calibration – Tracking – AR Computer Vision – Mapping – Platforms – Lightings.

Module:5 Creating Cross-Platform Augmented Reality and Virtual 5 Hours

Reality
Cross Platform Game Engines – Understanding 3D graphics – Virtual Camera – Degree of Freedom
– Virtual Reality Toolkit – Best Practices.

Module:6 Modeling Interactivity Sound in Immersive 5 Hours

Environments

Geometric Modeling - Kinematics Modeling - Physical Modeling - Behavior Modeling - Model

Management - Locomotion in VR and AR – Audio in VR & AR – Inventory for VR – Augmented
Reality Raycasts
Module: 7 Present and the Future of VR/AR 3 Hours

Immersive reality application areas - Entertainment , Education ,Training , Medical , Industrial ,

Military - Sensing to Rendering - VR, Immersive Tech and the Society - Impact on Professional
Life – Personal Life – Public life.

Module:8 Contemporary Issues 2 Hours

Total Lecture Hours: 30 Hours

Text Books:
1. Kelly S. Hale (Editor), Kay M. Stanney (Editor). 2014. Handbook of Virtual Environments:
Design, Implementation, and Applications, Second Edition (Human Factors and Ergonomics)
ISBN-13: 978-1466511842
2. Erin Pangilinan, Steve Lukas and Vasanth Mohan, ―Creating Augmented and Virtual Realities
Theory & Practice for Next-Generation Spatial Computing‖, O‘REILLY 2019
3 Alan B Craig, William R Sherman and Jeffrey D Will, ―Developing Virtual Reality
Applications: Foundations of Effective Design‖, Morgan Kaufmann, 2009.

References Books:
1 Gerard Jounghyun Kim, ―Designing Virtual Systems: The Structured Approach‖, 2005
2 Doug A Bowman, Ernest Kuijff, Joseph J LaViola, Jr and Ivan Poupyrev, ―3D User Interfaces,
Theory and Practice‖, Addison Wesley, USA, 2005.
3 Oliver Bimber and Ramesh Raskar, ―Spatial Augmented Reality: Meging Real and Virtual
Worlds‖, 2005.
4 Tony Parisi. 2015. Learning Virtual Reality ISBN: 9781491922828
5 Michael Madary and Thomas K. Metzinger. 2016. Real Virtuality: A Code of Ethical Conduct.
Recommendations for Good Scientific Practice and the Consumers of VR-Technology.
Frontiers in Robotics and AI 3, February: 1–23. http://doi.org/10.3389/frobt.2016.00003
6 Jason Jerald. 2015. The VR Book: Human-Centered Design for Virtual Reality. Association for
Computing Machinery and Morgan & Claypool Publishers
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Challenging Experiments (Indicative) Hours

1. VR/AR engines - UNITY Basics/ Google ARCore/ Vuforia, etc., 3 hours

2. Develop Active 3D environments 3 hours

3. Health care application using VR 3 hours

4. Human behaviour using VR 3 hours

5. VR exercise as a standalone treatment over traditional therapy 3 hours

6. VR with walking on treadmill 3 hours

7. Design a game in VR 3 hours

8. VR based teaching content 3 hours

9. AR model creation - Marker-based applications and Location-based application 3 hours

AR model for Motion Tracking, Environmental understanding , Light 3 hours
10.
estimation
Total Laboratory Hours 30 Hours
Mode of Assessment: Continuous Assessment Test (CAT) / Final Assessment Test (FAT).
List of Projects (Indicative)
Generally a team project [3 to 4 members]. The project should cover some of the following
(tentative domains). i.e.,

1. Develop a VR application that includes relation to immersion, presence, agency and

interactivity.
2. Design and develop an immersive environment in Unity-3D where an interactive
player can move around.
3. Develop a VR application that includes well-rounded multisensory action which
accommodates all senses, visual, auditory and tactile.
4. Develop a full body tracking using HTC Vive trackers and lkinema framework. Include
collision detection for moving objects.
5. Develop VR/AR prototype scenario for medical applications.
6. Develop a best practice professionally organised application with behavioural properties.
Enhance the look and feel of the environments.

Mode of Evaluation: Reviews

Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course Code Course Title L T P J C
CSE4045 Human Machine Interaction 2 0 2 0 3
Prerequisites Nil Syllabus Version
1.0

Course Objectives (CO):

1. To stress the importance of a good interface design.
2. To understand the importance of human psychology in designing good interfaces.
3. To evaluate applications of human machine interaction ensemble methods in the gaming domains
modeling into a cohesive, interactive game application.

Expected Course Outcomes:

1. Apply key concepts related to HMI in their day to day activities
2. Having an ability to design and conduct experiments, as well as to analyze and interpret data
3. Determine how HMI methods may be used in gaming

Module:1 HCI Foundations 4 Hours

Input–output channels, Human memory, Thinking: reasoning and problem solving, Emotion,
Individual differences, Psychology and the design of interactive systems, Text entry devices,
Positioning, pointing and drawing, Display devices, Devices for virtual reality and 3D interaction.

Module:2 Designing Interaction 4 Hours

Shneideman's eight golden rules, Norman's Seven principles, Screen Design - Visual Display
Layout, Information Structuring and Navigation, HCI in Software process, Design Rules, HCI for
Users with Disability, Mobile devices, Earcon design for aural interface

Module:3 Interaction Design Models 4 Hours

Model Human Processor - Working Memory, Long-Term Memory, Processor Timing, Keyboard
Level Model - Operators, Encoding Methods, Heuristics for M Operator Placement, What the
Keyboard Level Model Does Not Model, Application of the Keyboard Level Model, GOMS - CMN-
GOMS Analysis, Modeling Structure, State Transition Networks

Module:4 Interface in HCI 4 Hours

Visual Interface, Emotion in HCI, knowledge driven in HCI, Multi-user Interaction, Interface
Selection Options, Wire-Framing.

Module:5 Applying HCI in Game design 4 Hours

Introduction to game development life cycle, Key issues of HCI in gaming, Game interface design
goal, Basic design principles, method of presenting game user interface, Game design documents and
storyboarding,

Module:6 Game Design 4 Hours

 Augmented and Virtual Reality, Anthropology of games, Genres in video game, principle of game
design, the Game designer usability and gameplay

Module: 7 Validation And Advanced Concepts 4 Hours

Validations - Usability testing, Interface Testing, User Acceptance Testing , Heuristic evaluation,
Defining user experience, method to evevalue UE in gaming, HCI evolution technique for gaming

Module: 8 Contemporary Issues 2 Hours

Total Lecture Hours: 30 Hours

Text Books:
1. Gerard Jounghyun Kim, Human Computer Interaction – Fundamentals and Practice, – CRC
press, 2015.
2. Regina Bernhaupt , Game User Experience Evaluation-2015 Edition, Kindle Edition
3 Martin Helander, Handbook of Human-Computer Interaction-1988 Elsevier

References Books:
1 Julie A. Jacko, The Human–Computer Interaction Handbook: Fundamentals, Evolving
Technologies, and Emerging Applications, 3rd Edition, CRC Press (Taylor & Francis Group)
2012.
2 Ben Shneiderman, Catherine Plaisant, Maxine Cohen,Steven Jacobs, Designing the User
Interface: Strategies for Effective Human Computer Interaction, 5th Edition, Pearson, 2009.
3 Alan Dix, Janet E. Finlay, Gregory D. Abowd, Russell Beale, Human - Computer Interactio3rd
Edition, Pearson, 2003.
4 The Encyclopedia of Human-Computer Interaction, 2nd Ed. nteraction Design Foundation
5 Myounghoon Jeon ,Emotions and Affect in Human actors and Human–Computer Interaction-
2017Academic Press
6 Kevin mullet, Darvel sano,Designing Visual Interfaces: Communication Oriented
Techniques,Englewood Cliffs, NJ : SunSoft Press
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final Assessment
Test (FAT) / Seminar.
List of Challenging Experiments (Indicative) Hours

1. Design an User Interface for Multiplication and Addition of any two numbers 2 Hours
Design an user interface for assigning a grade to students based on the subjects
marks
 Make your buttons functional (e.g. compute/calculate, save, add, edit)
2. 2 Hours
 Add tool tip text or message box to guide your user
 Make sure your application is dynamic (ready for any changes from the
user)
3. Design an user interface for calculator 3 Hours
4. Design an user interface for displaying and changing of picture on the form 3 Hours
5. Design an user interface for To count the number of digits in a given number 3 Hours
6. Create a prototype design of your proposed application 3 Hours

7. Design an user interface for menu based program(menu, sub-menu, buttons, 3 Hours
labels, textboxes)
Design accessible crossword puzzle for visually impaired users, aiming to
8. 3 Hours
support word solving in a novel and usable way.
9. Design a Web Services accessible to people with disability 3 Hours
10. To design a system based on user-centered approach 3 Hours
11. To understand the principles of good screen design by heuristic evaluation. 2 Hours
Total Laboratory Hours 30 Hours
Mode of Assessment: Continuous Assessment Test (CAT) / Final Assessment Test (FAT).
Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course code Course title L T P J C
CSE4046 3D Graphics and Animation 3 0 0 4 4
Prerequisites Nil Syllabus Version
1.0
Course Objectives (COB)
 Goal is to describe and analyse how modelling and viewing transformations can be used to
compose 3D scenes
 To recognize the basic terminologies and mathematical functions being applied for 3D
Modelling, Rendering and Animation

Expected Course Outcomes (CO)

1. Describe and apply the mathematical basics of 3D graphics such as coordinate systems,
homogeneous coordinates, matrix operations and transformation matrices object translation,
projection and rendering methods.
2. Describe and apply data structures for 3D graphics applications from the computer graphics
theories they learn.
3. To recognize the meaning of computer graphics terminologies, differentiate methods.
4. To analyses and design interactive functions to simulate scenes using animation methods.

Module:1 Introduction to Computer Graphics 6 hours

Computer Graphics Pipeline, Raster Images, Coordinate-Reference Frames, Coordinate systems,
Graphics Output Primitives and algorithms.

Module:2 Interactive 3D Graphics Functions 8 hours

3D coordinate systems, Homogeneous Co-ordinate systems, 3D Linear transformations – Affine -
Rotation, Translation, Scale, Reflection and Shear; General Composite Transformations,
Transformations Between Coordinate Systems, 3D Viewing pipeline.

Module:3 3D Modeling - I 4 hours

The Camera Transformations - Orthographic, isometric, Perspective, and stereo-graphic views.
3D representation - Polygon, Plane Equations, Wire-frame, Curves - Splines and Bezier curves,
Boundary representation.

Module:4 3D Modeling - II 6 hours

Triangle Meshes, Constructing a torus, Procedural models, Fractal models, Grammar-based
models, Octrees, Sweep, Boundary representations – Splines, Bézier curve

Module:5 3D Rendering - I 6 hours

Back face detection, Z-buffer method, Painter's algorithm, scan-line algorithm, BSP-trees, Area
sub-division method, Basic illumination Models.

Module:6 3D Rendering - II 6 hours

Color models, Polygon- Rendering Methods, Shading, Flat, Phong and Gouraud, Virtual reality
rendering

Module: 7 3D Animation 8 hours

Principles of Animation, Design of Animation Sequences, Keyframing, Deformations, Character
Animation, Physics-Based Animation, Procedural Techniques,
Motion Specifications, Direct Motion Specification, Morphing

Module:8 Contemporary Issues 1 hour

Total Lecture Hours: 45 hours

Text Books:
1. John F. Hughes, Andries Van Dam, Morgan Macguire, David F. Sklar, James D. Foley,
Steven K. Feiner, Kurt Akeley, Computer Graphics; Principles and practice, Pearson - Third
edition, 2019.
2. Donald D. Hearn, Pauline Baker, Warren Carithers, Computer Graphics with Open GL:
Pearson New International 4 th Edition, 2013

References Books:
1 Fundamentals of Computer Graphics, Steve Marschner, Peter Shirley, 4th edition
A K Peters/CRC Press, ISBN 9781482229394
2 Computer Graphics: From Pixels to Programmable Graphics Hardware By Alexey Boreskov,
Evgeniy Shikin, Chapman and Hall/CRC, ISBN 9781439867303
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignments / Quiz / Final
Assessment Test (FAT) / Seminar.
List of Projects (Indicative)
Software requirement:
Python Graphics Library ,OpenGL (glu, glut) ,Sketch Up, Unity, QFlash, Open DiaLect, SigFig,
and etc.,
1. Advanced 3D Maps for Personal Digital Assistant
2. 3D surface modeling of a building and its projection
3. Panoramic images on the image plane of the Great Wall of China as a function of head
orientation.
4. Business data visualization for forecast analysis
5. Simulation of Hawk-eye view in LBW decision
6. Simulated Cartoon Shading
7. Scene recreation stages in butterfly life cycle
8. Creating a movable 3D skeletal stick of a human body and some simple tools to manipulate
the skeleton and perform key frame animation.
9. Custom view generation of Mysore Palace
10. Application development to Augmented and Virtual Reality - Health and Medicine, Human
Factor
Mode of Evaluation: Reviews
Recommended by Board of studies 30/10/2020
Approved by Academic Council No. 60 Date 04/11/2020
Course code Course Title L T P J C
CSE4056 Intelligent Multi Agent and Expert systems 2 0 0 4 3
Pre-requisite NIL Syllabus version
v.1.0
Course Objectives (COB) :
1. Comprehend the concept of agents, intelligent agent systems, design architectures, agent
communication, interaction protocols, key types of possible multi-agent system interaction and
agreement
2. Comprehend the concept of expert system, expert system architecture, production rules and
implementation tools
3. Apply the principles and methods of intelligent multi-agents and expert systems
4. Synthesize multi-agent expert systems to solve small or large scale real life problems
Expected Course Outcomes (CO):
Upon completion of the course, the students will be able to
1. Describe the notion of an agent, intelligent agent systems characteristics and the structure of
agents, how agents are distinct from other software paradigms (e.g. objects), and typical
applications of agent based technology
2. Design intelligent agents that can effectively cooperate in order to solve problems
3. Apply the concepts of agent communication, interaction protocols, multi-agent interactions and
agreements
4. Build agents capable of intelligent autonomous actions using appropriate methodologies
5. Describe the concept of expert system, models, production rules, implementation tools and
existing system models for developing an expert system
6. Develop novel applications using intelligent multi-agent expert systems to solve real life problems

Module:1 Introduction to Agents 4 hours

Agents and Environment; Performance measure; Nature of Environment; Abstract and Concrete
Architecture for intelligent agents; Problem solving and planning: Result sharing, Task sharing and
Distributed planning

Module:2 The design of Intelligent Agents 4 hours

Deductive reasoning agents: AgentO, Practical Reasoning Agents: HOMER architecture; Reactive
agents: Subsumption architecture; Hybrid agents: TouringMachines, InteRRaP.

Module:3 Agent Communication and Interaction Protocols 4 hours

Agent Communications: Knowledge Query and manipulation Language (KQML), Knowledge
Interchange Format (KIF), Ontology, Coordination protocols, Cooperation Protocols, Contract Net,
Blackboard Systems, Negotiation, Multi-agent Belief Maintenance, Market Mechanisms

Module:4 Multi-Agent System Interactions & Agreements 6 hours

Classifying multi-agent interactions: Multi-agent Encounters - Dominant Strategies and Nash
Equilibria - Competitive and zero-sum and other interactions; Cooperation: the Prisoner's dilemma
and Axelrod's experiments; Reaching Agreements: Interactions between self-interested agents-
auctions & voting systems – negotiation - Argumentation; Interactions between benevolent agents:
Cooperative Distributed Problem Solving (CDPS), partial global planning; coherence and
coordination

Module:5 Multi-agent Methodologies and Applications: 4 hours

Agent Methodologies- Mobile agents; Typical application areas of agent systems: Business Process
Management, Distributed Sensing, Information Retrieval and Management, Electronic Commerce,
Human-Computer Interfaces, Social Simulation etc.

Module:6 Introduction to Expert System Expert System Models 3 hours

Expert Systems: Introduction, Architecture, Production rules and inference, Basic forms of inference:
abduction; deduction; induction. Rule-based representations (with backward and forward reasoning);
logic-based representations (with resolution refutation)

Module:7 Expert System Implementation 3 hours

Implementation Tools: Prolog, CLIPS; Study of existing expert systems: MYCIN, DART and XCON

Module:8 Contemporary issues: 2 hours

Total Lecture hours: 30 hours
Text Book(s)
1. Michael Wooldridge, ―An Introduction to Multi Agent Systems‖, Second Edition, Wiley,
2009.
2. G. Weiss (ed.), ―Multi-Agent Systems - A Modern Approach to Distributed Artificial
Intelligence‖, (2nd Ed.). MIT Press, 2013.
3. Dan W. Patterson, ―Introduction to AI & Expert System‖, PHI, 2007
Reference Book(s)
1. Stuart Russell and Peter Norvig, ―Artificial Intelligence - A Modern Approach‖, 3rd edition,
Prentice Hall, 2011.
2. D. Poole and A. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖,
Cambridge University Press, 2010
3. Yoav Shoham and Kevin Leyton-Brown, ―Multiagent Systems: ‖, Cambridge University
Press, 2009.
4. Peter Jackson, "Introduction to Expert Systems", 3rd Edition, Pearson Education, 2007.
5. Dennis Merritt, ―Building Expert Systems in Prolog‖, Amzi! inc., 2000.
6. J. Giarratano and G. Riley, "Expert Systems - Principles and Programming". 4th Edition, PWS
Publishing Company, 2004.
7. Peter J.F. Lucas & Linda C. Van der Gaag, ―Principles of Expert Systems‖, Addison-Wesley,
1991
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative):
Projects may be computational, theoretical, experimental or empirical. Generally a team project [3 to
4 members]. The projects can cover the following tentative domains.
1. Design and development of intelligent multi-agent systems in Business Process Management,
Distributed Sensing, Information Retrieval and Management, Electronic Commerce, Human-
Computer Interfaces, Intelligent Tourist Information, Social Simulation, Library Management
System and E-learning management System
2. Analysis and Design of an Agent-Based Operating System
3. Simulation Robots like Agent based Fire Fighting Robot for Relief Operations
4. Design and development of Expert system in various areas
5. Other contemporary areas
Method of Evaluation: Reviews
Recommended by Board of Studies 08-Feb-2021
Approved by Academic Council 61st Date 18-2-2021
Course Code Course Title L T P J C
CSE4057 Network Science and Modeling 3 0 0 4 4
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives (COB):
1. To introduces network science to an interdisciplinary audience, from the internet to social
networks.
2. To understand the fundamentals of graph and network theory
3. To acquire knowledge on standard algorithms used for computing graph and network features
4. To understand the concept of correlation, cut-off, robustness failures, tolerance and its real time
applications.
5. To familiarize various kinds of communities

Expected Course Outcomes (CO):

1. Understand the fundamentals of network science and network theory
2. Extract, model, and analyse information from various network models
3. Develop applications to determine the insight existence with complex networks
4. Understand the various kinds of communities, complex network analysis and modelling

Module:1 Introduction 5 hours

Vulnerability Due to Interconnectivity, Networks at the Heart of Complex Systems, Two Forces
Helped the Emergence of Network Science, The Characteristics of Network Science, Societal
Impact, Scientific Impact.

Module:2 Networks and Graphs 7 hours

Degree, Average Degree and Degree Distribution, Adjacency Matrix, Real Networks are Sparse,
Weighted Networks, Bipartite Networks, Paths and Distances, Connectedness, Clustering
Coefficient.

Module:3 Random Networks 6 hours

Introduction, The Random Network Model, Number of Links, Degree Distribution, Real Networks
are Not Poisson, The Evolution of a Random Network, Real Networks are Supercritical, Small
Worlds, Clustering Coefficient.

Module:4 Evolving Networks 5 hours

Introduction, The Bianconi-Barabasi Model, Measuring Fitness, Bose-Einstein Condensation,
Evolving Networks, Initial Attractiveness

Module:5 Degree Correlation 6 hours

Introduction, Assortativity and Disassortativity, Measuring Degree Correlations, Structural Cut-
offs, Correlations in Real Networks, Generating Correlated Networks, The Impact of Degree
Correlations.

Module:6 Network Robustness 6 hours

Introduction, Percolation Theory, Robustness of Scale-free Networks, Attack Tolerance, Cascading
Failures, Modelling Cascading Failures, Building Robustness.

Module:7 Communities 8 hours

Introduction, Basics of Communities, Hierarchical Clustering, Modularity, Overlapping
Communities, Testing Communities, Characterizing Communities.
Spreading Phenomena – Introduction, Epidemic Modelling, Network Epidemics, Contact
Networks, Beyond the Degree Distribution, Immunization, Epidemic Prediction.

Module:8 Contemporary issues 2 hours

Total Lecture hours: 45 hours

Text Book(s)
1. Albert – Laszlo Barabasi, ―Network Science‖, Cambridge university press 2016, 1st Edition.

Reference Books
1. Mark Newman, Albert – Laszlo Barabasi and Duncan J. Watts, ―The Structure and Dynamics
of Networks‖, Princeton University Press, 2006.
2 Joseph Loscalzo, Albert-Laszlo Barabasi, And Edwin K. Silverman, ―Network Medicine:
Complex Systems in Human Disease and Therapeutics‖, Harvard University press, 2017.
3 Ernesto Estrada and Philip A. Knight, ― A First Course in Network Theory‖, Oxford
University Press, 2016.
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative):
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the
following (tentative domains). i.e.,

1. Social Network Analysis - Facebook community Structure, Communities deductions, Email

Network, Citation network, Collaboration network, Professional network, Sexual network
2. Complex network Analysis - Not a regular graph, but not random, not-trivial topology,
Scale-free networks and may have universal properties
Example: Internet, Political blogs, Financial Corporation Network – Financial trading
network and Petroleum trading network, Transportations Network,
3. Biology network - Bioinformatics Network Analysis - protein to protein interaction
network
4. Telecommunication Network – Wireless network – Mobil phone calls
5. Graph Clustering
6. Network on chip – Architecture Network

Mode of Evaluation: Reviews

Recommended by Board of studies 08-02-2021
Approved by Academic Council No:61st Date 18-2-2021
Course Code Course Title L T P J C
CSE4058 Business Intelligence 2 0 0 4 3
Pre-requisite Nil Syllabus Version
v.1.0
Course Objectives (COB):
1. To understand the effect of Business Intelligence(BI) on an organization
2. To understand the strategic advantage of BI, and
3. To acquire the skills necessary for the effective and strategic application of BI technology to
assist in the decision making process.
4. To develop real time application using BI

Expected Course Outcomes (CO):

On completion of this course, the students will be able
1. To gain knowledge of Business Intelligence
2. To understand the concepts and architectures of data warehousing.
3. To demonstrate the impact of business reporting, information visualization, and dashboards.
4. To apply business intelligence methods to various situations.
5. To develop business intelligence application for the real life scenario

Module:1 Business Intelligence – Introduction 4 hours

A Frame work for Business Intelligence (Bl)- The Architecture of Bl - Benefits of business
intelligence- how business intelligence differs from competitive intelligence and knowledge
management.

Module:2 Data Warehousing 4 hours

Characteristics of Data Warehousing- Data Marts- Data warehousing process- Data warehousing
Architectures – Data Integration and the Extraction, Transformation and Load (ETL) Process-
OLAP Versus OLTP- Data warehousing implementation issues – Real time data warehousing

Module:3 Business Reporting, Visual Analytics and Business Performance 3 hours

Management
Data and Information Visualization – Different types of Charts and Graphs- Emergence of Data
visualization and Visual analytics - Performance Dashboard - Balance Score Cards – Dashboards
Versus Scorecards - Six Sigma as a performance measurement system.

Module:4 Data mining – Supervised learning 4 hours

Data mining concepts and applications – Data mining process – Data mining methods –
Classification techniques – Decision trees , Case studies

Module:5 Data mining - Unsupervised learning 4 hours

Cluster Analysis – Partition and Hierarchical methods, Association rule mining –Data mining
software Tools - Case studies

Module:6 Text Analytics, Text Mining, and Sentiment Analysis 5 hours

Text analytics and Text mining concepts and definition – Text mining process – Text mining tools
– Sentiment analysis overview – Sentiment analysis applications – Sentiment analysis process.

Module:7 Web Analytics, Web Mining, and Social Analytics 4 hours

Web mining overview – Web content and Web structure mining – Search Engines - Search Engine
Optimization – Web usage mining – Web analytics maturity model and web analytics tools – Social
analytics and social network analysis.
Module:8 Contemporary issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Ramesh Sharda, Dursun Delen, Efraim Turban, Business Intelligence and Analytics, Pearson

10th edition, 2018

Reference Books
1. Ramesh Sharda, Dursun Delen, Efraim Turban, Business Intelligence, Analytics, and Data
Science: A Managerial Perspective, 4th Edition, Pearson, 2017

2. David Loshin Morgan, Kaufman, ―Business Intelligence: The Savvy Manager‟s Guide‖,
Second Edition, 2012.
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
Typical Projects
1. Develop a BI tool to predict the business needs such as streamline the customer experience,
retention of customer etc.
2. Develop a business intelligence tool for identifying user behavior for personalization and also
used for profiling buyers for advanced targeting.
3. Develop a dashboard to displays key metrics to visualize the patient experience in a healthcare
industry (to show how satisfied the patient was with their care, how long the average
appointment took, which department they visited, and more)
Mode of evaluation: Reviews
Recommended by Board of studies 8.2.2021
Approved by Academic Council 61st Date 18-2-2021
Course Code Course Title L T P J C
CSE4059 Cognitive Systems 2 0 0 4 3
Pre-requisite Nil Syllabus version
v.1.0
Course Objectives (COB):
1. To develop algorithms that use AI and machine learning along with human interaction and
feedback to help humans make choices/decisions.
2. To demonstrate and apply the principal aspects of cognitive science, methods and paradigms
3. To get the detailed about appealing new cognitive model for application development.
4. To understand how cognitive computing supports human reasoning by evaluating data in
context and presenting relevant findings along with the evidence that justifies the answers.

Expected Course Outcomes (CO):

1. Understand and discuss what cognitive computing is, and how it differs from traditional
approaches.
2. Use the primary techniques and tools associated with cognitive computing
3. Understand and discuss the cognitive development stages and review existing frameworks for
modeling memory and language
4. Design simulation models of cognition using different cognitive architectures/models for real-
world applications

Module:1 Introduction to Cognitive Systems 3 hours

The Nature of Cognition, Overview, Four Aspects of modeling cognitive systems. Levels of
abstraction in modeling cognitive systems - Marr‘s hierarchy of abstraction, Kelso‘s hierarchy of
abstraction. Paradigms of Cognitive Science- cognitivist paradigm, emergent paradigm

Module:2 Cognitive Architecture 5 hours

The cognitivist perspective, The emergent perspective- Desirable characteristics: Realism,
Behavioural characteristics, Cognitive characteristics, Functional capabilities, Development,
Dynamics - Anatomy – Types of Anatomy - Embodiment and Its Implications, Cognitive
architectures such as ACT-R, SOAR, OpenCog, CopyCat, Memory Networks, DeepQA
Architecture, Unstructured Information Management Architecture (UIMA), Structured
Knowledge,

Module:3 Modeling Paradigms 4 hours

Declarative/ logic-based computational cognitive modeling, connectionist models of cognition,
Bayesian models of cognition, a dynamical systems approach to cognition.

Module:4 Modeling Aspects of Cognition 4 hours

Classical models of rationality, symbolic reasoning and decision making; Formal models of
inductive generalization, causality, categorization and similarity; the role of analogy in problem
solving

Module:5 Cognitive Models of Memory and Language 5 hours

Memory – Types of memory , Computational models: episodic and semantic memory, modeling
psycholinguistics (with emphasis on lexical semantics), modeling the interaction of language,
memory and learning

Module:6 Cognitive Development 4 hours

Piaget- Vygotsky theory of cognitive development - Child concept acquisition, child language
learning, acquisition of arithmetic skills.

Module:7 Social Cognition 3 hours

Social interaction. Reading intentions and theory of mind, Business Implications, Building
Cognitive Applications, Application of Cognitive Computing and Systems.

Module:8 Contemporary Issues 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Vernon, David, Artificial Cognitive Systems: A Primer, (The MIT Press) 1st Edition,
2015.
2. The Cambridge Handbook of Computational Psychology, Ron Sun (ed.), Cambridge
University Press (2008)

Reference Books
1. Dawson, M.R.W. (2013) Mind, Body, World: Foundations of Cognitive Science. Athabasca
University Press: Edmonton
2 Peter Finger, Cognitive Computing: A Brief Guide for Game Changers, Meghan Kiffler
Press, 1st Edition, 2015, ISBN: 973-0-92965251-1
3 Kai Hwang, Cloud Computing for Machine Learning and Cognitive Applications, MIT
Press Publishers, June 2017 | ISBN: 9780262341110
4. Jay Friedenberg , Gordon Silverman ,Cognitive Science,An Introduction to the Study of
Mind, SAGE Publications, Inc, THIRD EDITION

Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the
following (tentative domains). i.e.,
1. Banking: Banking customer emotions and use it as customer service staff.
2. Employee: analyze employee e-mails to let them know what sort of leadership skills they
display on a daily basis.
3. Stock Analytics: enable retailers to uncover hidden demand triggers to deliver the best
customer experience and prevent out of stocks
4. Effect of trust on social conformity in Recognition Memory
5. NLP Question and Answering :Users can ask questions in plain English and the app uses
NLP to understand the questions and then sifts through the entirety of a database to
return a cited answer with relevant legislation

Mode of Evaluation: Reviews

Recommended by Board of studies 08-02-2021
Approved by Academic Council 61st Date 18-2-2021
Course code Course title L T P J C
CSE4060 Intelligent Robots and Drone Technology 2 0 0 4 3
Syllabus version
Pre-requisite NIL v.1.0

Course Objectives (COB):

1. modeling dynamic systems, measuring and controlling their behavior, and making decisions
2. deign and simulation of a neural network
3. apply AI that allows robots to explore complex environments
4. design intelligent controls for robotic systems that can grasp and manipulate objects
5. deign and simulation of any robotic device

Expected Course Outcomes (CO):

1. Understand the basic principles behind Robotics intelligence
2. Design practical robots using appropriate measures
3. Design and simulation of neural network for image recognition
4. Understand the fundamental concepts of drone technology
5. Understand and describe basic regulations applicable to UAV flight
6. Apply principles of robotics intelligence and drone technology for solving real world problems

Module:1 Robotics Paradigm 3 hours

Machine intelligence, History of Robotics, Types of Robots, Setting up your Robot: Technical
requirements, Robot anatomy, Subsumption architecture, Display devices, Software and Hardware setup

Module:2 Foundation for Advanced Robotics and AI 4 hours

The basic principle of robotics and AI, Sensing, Navigation, Planning, Uncertainty, Robot Control
system and a decision making framework, Robot Kinematics and Path Planning, Artificial Personality:
Emotion state machine, Creating a model of human behavior, Robot emotion engine, Human emotional
model

Module:3 Concept for a Practical Robot Design Process 5 hours

A systems engineering based approach to robotics: Cleaning up the environment; Use cases: The
problem Who, What, When and Where; Storyboards: Project goals, Decomposing hardware needs,
breaking down software needs, writing a specification; Task Analysis, Teaching the Robot arm:
Adaptive learning rate, Q-learning implementation, indexed states and actions, Genetic algorithms

Module:4 Object Recognition Using Neural Networks and Supervised Learning 5 hours
Image recognition training and deployment process, Artificial neurons, convolution, convolutional
neural network, Build the object detector

Module:5 Basic concepts of Drone 3 hours

Introduction to Drone, History of Drones, three terrains, anatomy of a Drone, Drones project example –
Quadcopter, Clothesline Racer, Radio-Controlled Blimp.

Module:6 Building a Quadcopter I 4 hours

Choosing an Airframe, Choosing Between Commercial Options, MakerBeam Airframe – Parts and
Steps

Module:7 Building a Quadcopter II 4 hours

Motors and Props, Choose Your Motors, Outrunner Versus Inrunner, Brushed Versus Brushless, AC
Versus DC, Choose Your Propellers, Prop Adapters, Steps for Attaching the Props and Motors

Module:8 Contemporary issues: 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. Francis X. Govers, Artificial Intelligence for Robotics, Packt Publishing, O‘Reilly, 2018
2. Robin R Murphy, Introduction to AI Robotics, MIT Press, 2019
3. John Baichtal, Building Your Own Drones: A Beginner‘s Guide to Drones, UAVs, and ROVs‖,
2015
Reference Book(s)
1. J. Craig, Introduction to Robotics Mechanics and Control, Pearson, 2018.
2. H. Asada and J.-J. Slotine, Robot Analysis and Control, J. Wiley & Sons, 1986.
3. H. Choset, Principles of Robot Motion, MIT Press, 2005.
4. G. Long, Fundamentals of Robot Mechanics, Quintus-Hyperion, 2015
5. ASA Test Prep. Remote Pilot Test Prep — UAS: Study & Prepare. Wellfleet Press, 2016. 978-
1577151326
6. Austin, Unmanned Aircraft Systems: UAVS Design, Development and Deployment. Wiley, 2010.
978-0- 470-05819-0
Mode of Evaluation : Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment Test
(FAT) / Seminar
List of projects (Indicative) :
Generally a team project [3 to 4 members]. The projects can cover the following tentative domains.
 1. Design and development of robots in Object detection, Business Process Management, E-
Commerce, Social Services like Robot for Relief Operations, Intelligent Tourist Information, E-
learning Systems, and Library Robot etc.
2. Controlling a Robot Hand in Simulation and Reality
3. Mobile Robot navigation techniques
4. Design and development of drones: assembling of drone, Mount Arduino/Raspberry PI board on
Drones, Application of drones such as surveillance, tracking, navigation, gesture control and
agriculture, Quadcopter Flying Training Simulator etc.
 Other contemporary areas

Mode of Evaluation: Reviews

Recommended by Board of Studies 08-02-21
Approved by Academic Council 61st Date 18-02-2021
Course code Course Title L T P J C
CSE4062 Knowledge Representation 2 0 0 4 3
Pre-requisite NIL Syllabus version
v.1.0
Course Objectives(COB):
1. To introduce basic concepts in knowledge representation, reasoning and its role in artificial
intelligence
2. To model simple application domains in a logic-based language and enable students to design
and apply knowledge-based systems
3. To learn the logics underlying ontology-based technologies and knowledge systems
4. To understand and apply the complexity of reasoning algorithms in Ontology based
knowledge systems and the notion of a reasoning service underlying current systems.

Expected Course Outcome(CO):

Use logic programming and knowledge representation languages for modelling simple application
domains in Artificial Intelligence;
Apply reasoning mechanisms in knowledge representation languages to test the correctness of
models and to formulate more expressive queries.
Design ontology based knowledge systems with reasoning mechanism; integrate with other
systems for building applications.
Understand the entire process of how to design, construct, and query a knowledge graph to solve
real-world problems.

Module:1 Propositional logic 2 hours

Principles of knowledge representation, Propositional Logic- Proof Systems, Natural Deduction,
Tableau Method, Resolution Method

Module:2 First order logic 4 hours

First Order Logic Syntax and Semantics, Unification, Forward Chaining, Horn Fragments of First
Order Logic

Module:3 Rule-based systems 4 hours

Rule based systems, The Rete Algorithm, Rete example, Programming Rule Based Systems

Module:4 Description Logic 4 hours

Description Logics, Reasoning in Description Logics, Structure Matching, Classification,
Extensions of DL, The ALC Language

Module:5 Ontology Representation languages 5 hours

Ontology Languages- RDF, RDFS-Rule Interchange Format

Module:6 Logic programming with OWL 5 hours

OWL-Building OWL ontology- SPARQL- RDF/OWL ontology processing using Graph databases

Module:7 Non monotonic logics 4 hours

Classical vs non-monotonic logic. Ways to achieve non-monotonicity-Stable Model Semantics
querying Semantic Nets and Frames.

Module:8 Contemporary Issues: 2 hours

 Total Lecture hours: 30 hours

Text Book(s)
1 An Introduction to Description Logic. Franz Baader, Ian Horrocks, Carsten Lutz, Uli Sattler
2 Knowledge Representation and Reasoning by Ronald Brachman & Hector Levesque, Morgan
Kaufmann 2004.
3 Handbook of Knowledge Representation. Frank van Harmelen, Vladimir Lifschitz and Bruce
Porter (Eds). Foundations of Artificial Intelligence, 2008.
4 Graph Databases, 2nd Edition,by Ian Robinson, Jim Webber, Emil Eifrem, Released June
2015, Publisher(s): O'Reilly Media, Inc.ISBN: 9781491930892
Reference Books
1. Foundations of Semantic Web Technologies. Chapman & Hall/ CRC Textbooks in
Computing. Pascal Hitzler, Markus Kroetsch, and Sebastian Rudolph, 2009.

2. Answer Set Solving in Practice by M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub.

Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool,
2012.
3 The Description Logic Handbook: Theory, Implementation, and Applications. F. Baader, D.
Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider. Cambridge University Press,
2003.
4 Logic for Computer Scientists. Uwe Schoning. Modern Birkäuser Classics, Reprint of the
1989 edition
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment / Quiz / Final Assessment
Test (FAT) / Seminar
List of Projects (Indicative)
Sample Project Titles :
Generally a team project of 2 members. The project should cover some of the following
(tentative domains). i.e.,
1. Building and querying the AWS COVID-19 knowledge graph.
2. Explicit semantic ranking for academic search via knowledge graph embedding.
3. Automated Ontology-based MCQ Generation
4. Detecting Arbitrary Relations for enriching Ontology of Linked Data.
5. Augmenting linked data ontologies with new object properties
Mode of Evaluation: Reviews
Recommended by Board of studies 08-02-2021
Approved by Academic Council 61st Date 18-2-2021
Course Code Course Title L T P J C
CSE4063 Reinforcement Learning 1 0 0 4 2
Pre-requisite Nil Syllabus version
v. 1.0
Course Objectives (COB):
1.To understand the main concepts related to reinforcement learning
2.To review real-world applications of reinforcement learning
3.To apply reinforcement learning to solve real-life problems

Course Outcomes (CO):

1. Define the key features of reinforcement learning (RL) that distinguishes it from AI and non-
interactive machine learning
2. Decide if an application problem should be formulated as a RL problem and state what
algorithm is best suited for addressing it
3. Describe and implement in code common RL algorithms

Module:1 Introduction 1 hour

Reinforcement learning, Examples, Elements of reinforcement learning, An extended example:
Tic-Tac-Toe, Limitations and Scope

Module:2 Tabular solution methods 2 hours

Multi-armed bandits, Gradient Bandit algorithms, Finite Markov Decision Processes, Optimal
Policies and Optimal Value Functions, Dynamic Programming and its efficiency

Module:3 Other tabular solution methods 2 hours

Monte Carlo methods, Monte Carlo Prediction, Temporal-difference learning, Temporal-
difference prediction, Sarsa, Q-learning, n-step bootstrapping

Module:4 Planning and Learning with Tabular Methods 3 hours

Models and Planning, Dyna: Integrated Planning, Acting, and Learning, Trajectory Sampling,
Real-time Dynamic Programming, Planning at Decision Time, Heuristic Search, Rollout
Algorithms, Monte Carlo Tree Search

Module:5 Approximate solution methods 1 hour

On-policy Prediction with Approximation, On-policy Control with Approximation, Policy
Gradient Methods

Module:6 Applications and case studies related to reinforcement learning 2 hours

TD-Gammon, Samuel‘s Checkers Player, Watson‘s Daily-Double Wagering, Optimizing
Memory Control, Human-level Video Game Play, Mastering the Game of Go, Personalized
Web Services, Thermal Soaring, Reinforcement learning in robotics
Module:7 Deep Reinforcement Learning 3 hours
Introduction to Deep Learning, Deep Q-Learning, Value-based Deep RL: Deep Q-network,
Policy-based Deep RL: REINFORCE, Asynchronous Methods for Deep RL: Advantage Actor-
Critic (A2C), Model-based Deep RL

Module:8 Contemporary Issues 1 hour

Total Lecture hours: 15 hours

Text Book(s)
1. Reinforcement Learning: An Introduction (Adaptive Computation and Machine Learning
series) 2nd edition, Richard S. Sutton and Andrew G. Barto, A Bradford Book; 2018,
ISBN 978-0262039246
Reference Books
1. Reinforcement Learning Algorithms: Analysis and Applications, Belousov, B.,
Abdulsamad, H., Klink, P., Parisi, S., Peters, J. (Eds.), Studies in Computational
Intelligence Series, Vol. 883, Springer 2021, ISBN 978-3-030-41187-9
2 Reinforcement Learning: Industrial Applications of Intelligent Agents , Phil Winder,
O'Reilly.2020, ISBN: 9781098114831
3 Learning to Play: Reinforcement Learning and Games, Aske Plaat, Springer 2020, ISBN
978-3-030-59237-0
4. Applied Reinforcement Learning with Python With OpenAI Gym, Tensorflow, and Keras,
Taweh Beysolow, Apress, 2019, ISBN 978-1-4842-5126-3

5. Reinforcement Learning With Open AI, TensorFlow and Keras Using Python, Abhishek
Nandy and Manisha Buiswas, Apress, 2018, ISBN 978-1-4842-3284-2

6. Reinforcement Learning for Cyber-Physical Systems with Cybersecurity Case Studies,

Chong Li and Meikang Qiu, Chapman and Hall/CRC, 2020, ISBN 9780367656638
7. AI Crash Course: A fun and hands-on introduction to machine learning, reinforcement
learning, deep learning, and artificial intelligence with Python, Hadelin de Ponteves, Packt,
2019 ISBN: 978-1838645359
8. Deep Reinforcement Learning with Python: Master classic RL, deep RL, distributional RL,
inverse RL, and more with OpenAI Gym and TensorFlow, Sudharsan Ravichandiran , 2nd
Edition, Packt, 2020, ISBN-13 : 978-1839210686
9. Reinforcement Learning: State-of-the-Art, Marco Wiering and Martijn van Otterlo (Eds.),
Springer, 2012, ISBN 978-3642276446
10. Deep Learning, Ian Goodfellow, Yoshua Bengio, and Aaron Courville, MIT Press, 2016,
ISBN: 978-0-262-03561-3
11 Deep Reinforcement Learning Fundamentals, Research and Applications, Dong, Hao,
Ding, Zihan, Zhang, Shanghang (Eds.), Springer 2020, ISBN 978-981-15-4094-3
12. Deep Reinforcement Learning: Frontiers of Artificial Intelligence, Mohit Sewak, Springer,
2019, ISBN 978-981-13-8287-1
13 Foundations of Deep Reinforcement Learning: Theory and Practice in Python, Laura
Graesser and Wah Loon Keng, Addison-Wesley Professional; 1st edition, 2019. ISBN:
 978-0135172384
Mode of Evaluation: Continuous Assessment Test (CAT) / Assignment/ Quiz/ Final Assessment
Test (FAT) / Seminar
List of Projects (indicative):
Sample Project Titles :
Generally a team project [3 to 4 members]. The project should cover some of the
following (tentative domains). i.e.
1. Transfer Learning Between Games to Improve Deep Reinforcement Learning Performance
and Stability
2. Mastering the game of Go
3. Reinforcement Learning for Traffic Signal Control
4. Online Learning for Causal Bandits
5. Using reinforcement learning to design RNA secondary structures
6. Reinforcement Learning and Health Care
7. Reinforcement Learning for Robotic Manipulation
8. Applying advanced deep RL algorithms to games such as Minecraft
9. Deep Q-Network to learn how to play Flappy Bird.
10. Reinforcement learning algorithms for simulating games

Mode of Evaluation: Reviews

Recommended by Board of studies
08-02-2021
Approved by Academic Council No:61 Date 18-2-2021
CSE3001 SOFTWARE ENGINEERING L T P J C
2 0 2 4 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To introduce the essential software engineering concepts involved
2. To impart skills in the design and implementation of efficient software systems across
disciplines
3. To familiarize engineering practices and standards used in developing software products
and components

Expected Course Outcome:

1. Apply the principles of the engineering processes in software development.
2. Demonstrate software project management activities such as planning,scheduling and Estimation.
3. Model the requirements for the software projects.
4. Design and Test the requirements of the software projects.
5. Implement the software development processes activities from requirements to validation
and verification.
6. Apply and evaluate the standards in process and in product.

Module:1 OVERVIEW OF SOFTWARE 5 hours

ENGINEERING
Nature of Software, Software Engineering, Software process, project, product, Process Models
Classical Evolutionary models, Overview of System Engineering

Module:2 INTRODUCTION TO SOFTWARE 3 hours

PROJECT MANAGEMENT
Planning scope, milestones deliverables, Risk Management, Metrics Measurement

Module:3 MODELLING REQUIREMENTS 6 hours

Requirements Engineering process Requirement Elicitation, System Modelling - Requirements
Specification and Requirement Validation

Module:4 SOFTWARE DESIGN 4 hours

Design concepts and principles - Abstraction - Refinement - Modularity Cohesion coupling,
Architectural design, Detailed Design Transaction Transformation, Refactoring of designs,
Object-oriented Design User-Interface Design

Module:5 VALIDATION and VERIFICATION 4 hours

Strategic Approach to Software Testing, Testing Fundamentals Test Plan, Test Design, Test
Execution, Reviews, Inspection Auditing

Module:6 SOFTWARE EVOLUTION 4 hours

Software Maintenance, Types of Maintenance, Software Configuration Management, Overview of
RE-engineering Reverse Engineering

Module:7 QUALITY ASSURANCE 2 hours

Product Process Metrics, Quality Standards Models ISO, TQM, Six-Sigma
Module:8 RECENT TRENDS 2 hours
Recent Trends in Software Design/Specialized Software Testing, Related Tools and Standards

Total Lecture hours: 30 hours

Text Book(s)
1. Roger Pressman, Software Engineering: A Practitioner‟s Approach, 7th Edition, McGraw-
Hill, 2010.
Reference Books
1. Ian Sommerville, Software Engineering, 9th Edition, Addision-Wesley, 2016
2. Pankaj Jalote, A Concise Introduction to Software Engineering, Springer, 2008
3. William E. Lewis , Software Testing and Continuous Quality Improvement, Third Edition,
Auerbach Publications, 2008
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Work Break-down Structure (Process Based, Product Based, Geographic 3 hours
Based and Role Based)
2. Estimations Cost and Schedule 3 hours
3. Entity Relationship Diagram, Context flow diagram, DFD (Structural 4 hours
Modeling and Functional Modeling)
4. State Transition Diagrams (Behavioral Modeling) 4 hours
5. System Requirements Specification 4 hours
6. UML diagrams for OO Design 4 hours
7. Tools for Version Control 3 hours
8. Black-box, White-box testing 3 hours
9. Non-functional testing 2 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
 CSE2006 MICROPROCESSOR AND INTERFACING L T P J C
2 0 2 4 4
Pre-requisite CSE1003-Digital Logic Design, Syllabus version
CSE2001-Computer Architecture and Organization
v1.0
Course Objectives:
1. Students will gain knowledge on architecture, accessing data and instruction from memory
for processing.
2. Ability to do programs with instruction set and control the external devices through I/O
interface
3. Generate a system model for real world problems with data acquisition, processingand
decision making with aid of micro controllers and advanced processors.

Expected Course Outcome:

1. Recall the basics of processor, its ways of addressing data for operation by instruction set.
2. Execute basic and advanced assembly language programs.
3. Learn the ways to interface I/O devices with processor for task sharing.
4. Recall the basics of co-processor and its ways to handle float values by its instruction set.
5. Recognize the functionality of micro controller, latest version processors andits
applications.
6. Acquire design thinking capability, abilityto design a component with realistic constraints,
to solve real world engineering problems and analyze the results.

Module:1 INTRODUCTION TO 8086 6 hours

MICROPROCESSOR
Introduction to 8086, Pin diagram, Architecture, addressing mode and Instruction set

Module:2 INTRODUCTION TO ALP 5 hours

Tools- Assembler Directives, Editor, assembler, debugger, simulator and emulator. E.g., ALP
Programs-Arithmetic Operations and Number System Conversions, Programs using Loops, If then
else, for loop structures

Module:3 Advanced ALP 2 hours

Interrupt programming using DOS BIOS function calls, File Management

Module:4 Introduction to Peripheral Interfacing-I 5 hours

PPI 8255, Timer 8253,Interrupt controller-8259

Module:5 Introduction to Peripheral Interfacing-II 4 hours

IC 8251 UART, Data converters (A/D and D/A Converter), seven segment display and key- board
interfacing

Module:6 Co-Processor 4 hours

Introduction to 8087, Architecture, Instruction set and ALP Programming

Module:7 Introduction to Arduino Boards 2 hours

Introduction to Microcontroller- Quark SOC processor, programming, Arduino Boards using
GPIO (LED, LCD, Keypad, Motor control and sensor), System design application and case study.
Module:8 Contemporary issues 2 hours
Architecture of one of the advanced processors such as Multicore, Snapdragon, ARM processor in
iPad

Total Lecture hours: 30 hours

Text Book(s)
1. A.K. Ray and K.M. Bhurchandi Advanced Microprocessors and Peripherals, third Edition,
Tata McGraw Hill, 2012.
2. Barry B Bray , The Intel Microprocessor 8086/8088, 80186,80286, 80386 and 80486
Arcitecture, programming and interfacing, PHI, 8th Edition, 2009.
Reference Books
1. Douglas V. Hall, SSSP Rao Microprocessors and Interfacing Programming and Hardware.
Tata McGraw Hill, Third edition, 2012.
2. Mohamed Rafiquazzaman, Microprocessor and Microcomputer based system design,
Universal Book stall, New Delhi, Second edition, 1995
3. K Uday Kumar, B S Umashankar, Advanced Micro processors IBM-PC Assembly Language
Programming, Tata McGraw Hill, 2002.
4. Massimo Banzi,Getting Started with Arduino , First Edition, pub. O‟Reilly, 2008.
5. John Uffenbeck and 8088 Family. 1997. The 80x86 Family: Design, Programming, and
Interfacing (2nd ed.). Prentice Hall PTR, Upper Saddle River, NJ, USA.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Arithmetic operations 8/16 bit using different addressing modes. 2.5 hours
2. Finding the factorial of an 8 /16 bit number. 2.5 hours
3. (a) Solving nCr and nPr (b) Compute nCr and nPr using recursive 2.5 hours
procedure. Assume that n and r are non-negative integers
4. Assembly language program to display Fibonacci series 2.5 hours
5. Sorting in ascending and descending order 2.5 hours
6. (a) Search a given number or a word in an array of given numbers. (b) 2.5 hours
Search a key element in a list of n 16-bit numbers using the Binary search
algorithm.
7. To find the smallest and biggest numbers in a given array. 2.5 hours
8. ALP for number system conversions. 2.5 hours
9. (a) String operations(String length, reverse, comparison, concatenation, 2.5 hours
palindrome)
10. ALP for Password checking 2.5 hours
11. Convert a 16-bit binary value (assumed to be an unsigned integer) to BCD 2.5 hours
and display it from left to right and right to left for specified number of
times
12. ALP to interface Stepper motor using 8086/ Intel Galileo Board 2.5 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
CSE3020 DATA VISUALIZATION LT PJ C
2 0 2 4 4
Pre-requisite CSE1015 Syllabus version
v. 1.1
Course Objectives:
1. To understand the various types of data, apply and evaluate the principles of data
visualization.
2. Acquire skills to apply visualization techniques to a problem and its associated dataset.
3. To apply structured approach to create effective visualizations thereby
buildingvisualizationdashboard to support decision making.

Expected Course Outcome:

1. Identify the different data types, visualization types to bring out the insight.
Relate thevisualization towards the problem based on the dataset.
2. Identify the different attributes and showcasing them in plots. Identify and
createvariousvisualizations for geospatial and table data.
3. Ability to visualize categorical, quantitative and text data. Illustrate the
integrationofvisualization tools with hadoop.
4. Ability to visualize categorical, quantitative and text data.
5. Design visualization dashboard to support the decision-making on large
scaledata.6.Match the knowledge gained with the industries latest technologies.
7. Ability to create and interpret plots using R/Python.

Module:1 Introduction to Data Visualization 4 hours

Overview of data visualization - Data Abstraction -Analysis: Four Levels for Validation- Task
Abstraction - Analysis: Four Levels for Validation

Module:2 Visualization Techniques 5 hours

Scalar and point techniques Color maps Contouring Height Plots - Vector
visualizationtechniques Vector properties Vector Glyphs Vector Color Coding Stream
Objects.

Module:3 Visual Analytics 3 hours

Visual Variables- Networks and Trees - Map Color and Other Channels- Manipulate View

Module:4 Visual Analytics 3 hours

Arrange Tables Geo Spatial data Reduce Items and Attributes

Module:5 Visualization Tools and Techniques 5 hours

Introduction to data visualization tools- Tableau - Visualization using R

Module:6 Diverse Types Of Visual Analysis 4 hours

Time- Series data visualization Text data visualization Multivariatedata visualization and case
studies

Module:7 Visualization Dashboard Creations 4 hours

Dashboard creation using visualization tools for the use cases: Finance-marketing-insurance-
healthcare etc.,
Module:8 Recent Trends 2 hours
Industry Expert talk

Total Lecture 30 hours

hours:
Text Book(s)
1. Tamara Munzer, Visualization Analysis and Design -, CRC Press 2014 AlexandruTelea,
Data Visualization Principles and Practice CRC Press 2014.
2 Paul J. Deitel, Harvey Deitel, Java SE8 for Programmers (Deitel Developer Series) 3rd
Edition, 2014.
3 Y. Daniel Liang, Introduction to Java programming-comprehensive version-Tenth Edition,
Pearson ltd 2015.
Reference Books
1. Paul Deitel Harvey Deitel ,Java, How to Program, Prentice Hall; 9th edition , 2011.
2. Cay Horstmann BIG JAVA, 4th edition,John Wiley Sons,2009
3. Nicholas S. Williams, Professional Java for Web Applications, Wrox Press, 2014.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Acquiring and plotting data 6 hours
2. statistical Analysis such as Multivariate Analysis, PCA, LDA, 4 hours
Correlation, regression and analysis of variance
3. Time-series analysis stock market 4 hours
4. Visualization on Streaming dataset 4 hours
5. Dashboard Creation 6 hours
6. Text visualization 6 hours
Total Laboratory Hours 30 hours
Mode of assessment: Project/Activity
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
CSE3021 SOCIAL AND INFORMATION LT PJ C
NETWORKS
3 0 0 4 4
Pre-requisite Data Mining CSE3019 Syllabus version
v. 1.0
Course Objectives:
1. Understand the components of social networks.
2. Model and visualize social networks.
3. Understand the role of semantic web in social networks.
4. Familiarize with the security concepts of social networks.
5. Find out various applications of social networks.

Expected Course Outcome:

1. Illustrate the basic components of social networks.
2. Analyze the different measurements and metrics of social networks.
3. Apply different techniques to detect and evaluate communities in social networks.
4. Apply various types of social network models.
5. Apply semantic web format to represent social networks.
6. Develop social network applications using visualization tools.
7. Usage of the security features in social and information networks for various
practicalapplications. .

Module:1 Introduction 4 hours

Introduction to social network analysis Fundamental concepts in network analysis social
networkdata notations for social network data Graphs and Matrices.

Module:2 Measures & Metrics 5 hours

Strategic network formation - network centrality measures: degree, betweenness, closeness,
eigenvector - network centralizationdensity reciprocity transitivity ego network measures for ego
network - dyadic network triadic network - cliques - groups- clustering search.

Module:3 Community networks 6 hours

Community structure - modularity, overlapping communities - detecting communities in social networks –
Discovering communities: methodology, applications - community measurement - evaluating communities –
applications.

Module:4 Models 7 hours

Small world network - WattsStrogatz networks - Statistical Models for Social Networks Net-
workevolution models: dynamical models, growing models - Nodal attribute model: expo-
nential
random graph models Preferential attachment - Power Law - random network model: Erdos-
Renyiand Barabasi-AlbertEpidemics - Hybrid models of Network Formation.

Module:5 Semantic Web 7 hours

Modelling and aggregating social network data developing social semantic application eval-
uation of web-based social network extraction Data Mining Text Mining in social network
Toolscase study.

Module:6 Visualization 8 hours

 Visualization of social networks novel visualizations and interactions for social networks ap-
plications of social network analysis tools - sna: R Tools for Social Network Analysis - Social
Networks Visualiser (SocNetV) - Pajek.

Module:7 Security & Applications 6 hours

Managing Trust in online social network Security and Privacy in online social network security
requirement for social network in Web 2.0 - Say It with Colors: Language-Independent
GenderClassification on Twitter - Friends and Circles - TUCAN: Twitter User Centric
ANalyzer.

Module:8 Recent Trends 2 hours

Industry Expert talk

Total Lecture 45 hours

hours:
Text Book(s)
1. Stanley Wasserman, Katherine Faust, Social network analysis: Methods and applications,
Cambridge university press, 2009.
2 John Scott, Social network analysis, 3rd edition, SAGE, 2013.
Reference Books
1. Borko Furht, Handbook of Social Network Technologies and applications, Springer, 2010.
2. Jalal Kawash, Online Social Media Analysis and Visualization (Lecture Notes in Social
Networks), 2015.
3. Charu Aggarwal, Social Network data analysis, Springer, 2011.
4. Easley and Kleinberg, Networks, Crowds, and Markets: Reasoning about a highly
connectedworld. Cambridge University Press, 2010.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
Recommended by Board of Studies 04-04-2014
Approved by Academic Council No. 37 Date 16-06-2015
CSE4001 PARALLEL AND DISTRIBUTED COMPUTING LT P J C
2 0 2 4 4
Pre-requisite NIL Syllabus version
v1.0
Course Objectives:
1. To introduce the fundamentals of parallel and distributed computing
architecturesandparadigms.
2. To understand the technologies, system architecture, and communication architecture
thatpropelled the growth of parallel and distributed computing systems.
3. To develop and execute basic parallel and distributed application using
basicprogrammingmodels and tools.

Expected Course Outcome:

Students who complete this course successfully are expected to:
1. Design and implement distributed computing systems.
2. Asses models for distributed systems.
3. Design and implement distributed algorithms.
4. Experiment with mechanisms such as client/server and P2P algorithms, remote
procedure calls (RPC/RMI), and consistency.
5. Analyze the requirements for programming parallel systems and critically evaluate
thestrengths and weaknesses of parallel programming models.
6. Differentiate between the major classes of parallel processing systems.
7. Analyze the efficiency of a parallel processing system and evaluate the types of
applicationfor which parallel programming is useful.

Module:1 Parallelism Fundamentals 2 hours

Motivation – Key Concepts and Challenges – Overview of Parallel computing – Flynn‟s
Taxonomy – Multi-Core Processors – Shared vs Distributed memory.

Module:2 Parallel Architectures 3 hours

Introduction to OpenMP Programming – Instruction Level Support for Parallel
Programming –SIMD – Vector Processing – GPUs.

Module:3 Parallel Algorithm and Design 5 hours

Preliminaries – Decomposition Techniques – Characteristics of Tasks and Interactions –
MappingTechniques for Load balancing – Parallel Algorithm Models.

Module:4 Introduction To Distributed Systems 4 hours

Introduction – Characterization of Distributed Systems – Distributed Shared Memory – Message
Passing – Programming Using the Message Passing Paradigm – Group Communication – Case
Study (RPC and Java RMI).

Module:5 Coordination 6 hours

Time and Global States – Synchronizing Physical Clocks – Logical Time and Logical Clock –
Coordination and Agreement – Distributed Mutual Exclusion – Election Algorithms –
Consensusand Related Problems.

Module:6 Distributed Transactions 6 hours

Transaction And Concurrency Control – Nested Transactions – Locks – Optimistic Concurrency
Control – Timestamp Ordering Distributed Transactions – Flat and Nested – Atomic – Two
PhaseCommit Protocol – Concurrency Control.

Module:7 Distributed System Architecture and 2 hours

itsVariants
Distributed File System: Architecture – Processes – Communication Distributed Web-based
System: Architecture – Processes – Communication. Overview of Distributed
ComputingPlatforms.

Module:8 Recent Trends 2 hours

Total Lecture 30 hours

hours:
Text Book(s)
1. George Coulouris, Jean Dollimore, Tim Kindberg, and Gordon Blair,
―DistributedSystems: Concepts and Design‖, 5th Edition, Pearson / Addison –
Wesley, 2012
2. Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar, ―Introduction to
ParallelComputing‖, Pearson, 2nd Edition, 2008.
Reference Books
1. Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and
Paradigms‖, Pearson, 2nd Edition, 2006
2. Pradeep K. Sinha, ―Distributed Operating System: Concepts and Design‖, PHI Learning
Pvt.Ltd., 2007
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. OpenMP – Basic programs such as Vector addition, Dot Product 2 hours
2. OpenMP – Loop work-sharing and sections work-sharing 2 hours
3. OpenMP – Combined parallel loop reduction and Orphaned parallel 2 hours
loopreduction
4. OpenMP – Matrix multiply (specify run of a GPU card, large scale 3 hours
data …Complexity of the problem need to be specified)
5. MPI – Basics of MPI 3 hours
6. MPI – Communication between MPI process 3 hours
7. MPI – Advanced communication between MPI process 3 hours
8. MPI – Collective operation with „synchronization‟ 3 hours
9. MPI – Collective operation with „data movement‟ 3 hours
10. MPI – Collective operation with „collective computation‟ 3 hours
11. MPI – Non-blocking operation 3 hours

Total Laboratory Hours 30 hours

Mode of assessment: Project/Activity
Recommended by Board of Studies 19-11-2018
Approved by Academic Council No. 53 Date 13-12-2018
Course Code Foundations of Data Analytics L T P J C

CSE3505 2 0 2 4 4
Pre-requisite NIL Syllabus version
v.1.0
Course Objectives:
1. To establish clearly the objectives and scope of the predictive analysis
2. Use R programming language to identify suitable data sources to agree the
methodological approach
3. Validate and review data accurately and identify anomalies
4. To appreciate the current trends in data analysis procedure
5. Carry out rule-based analysis of the data in line with the analysis plan
6. Apply statistical models to perform Regression Analysis, Clustering and
Classification
7. Present the results and inferences from your analysis using R tool
8. To improve document management and team work

Expected Course Outcome:

Students will be able to:
1. Understand R with Business Intelligence, Business Analytics, Data and Information
2. Contextually integrate and correlate information automatically to gain faster
insights
3. Implement statistical analysis techniques for solving practical problems.
4. Graphically interpret data and Find a meaningful pattern in data
5. Perform statistical analysis on variety of data.

Module:1 Introduction to Analytics 4 hours

Analytics life cycle - Business analytics - lending analytics- recommendation analytics-
Healthcare Analytics- financial analytics - sports analytics
Module:2 R programming Basics 5 hours
Introduction to R, R Studio (GUI): R Windows Environment, introduction to various data types,
Numeric, Character, date, data frame, array, matrix etc.,

Module:3 Working with datasets and files: 6 hours

Reading Datasets, Working with different file types .txt,.csv , R studio, Files, Datasets, Extracting
Datasets, Preparing datasets. Data Cleaning, Data imputation, Data conversion Analysis

Module:4 Introduction to statistical learning and R-Programming 6 hours

Basic statistics: mean, median, standard deviation, variance, correlation, covariance - Outliers,
Combining Datasets in R, Functions and loops. Summary Statistics - Summarizing data with R -
Correlation and Regression

Module:5 Document Creation and Knowledge Sharing: 3 hours

Access existing documents, language standards, templates and documentation tools from their
organization‘s knowledge base. Confirm the content and structure of the documents with
appropriate people, Create documents using standard templates and agreed language standards.
Review documents with appropriate people and incorporate their inputs

Module:6 Self and work Management: 3 hours

Establish and agree their work requirements with appropriate people - Keep their immediate
 work area clean and tidy - utilize their time effectively - Use resources correctly and efficiently -
Treat confidential information correctly - Work in line with organization‘s policies and
procedures - Work within the limits of their job role

Module:7 Team Work and Communication 3 hours

Communicate with colleagues clearly, concisely and accurately - Work with colleagues to
integrate their work effectively with them - Pass on essential information to colleagues in line
with organizational requirements - Work in ways that show respect for colleagues - carry out
commitments they have made to colleagues - Let colleagues know in good time if they cannot
carry out their commitments, explaining the reasons - Identify any problems they have working
with colleagues and take the initiative to solve these problems

Total Lecture hours 30 hours

Text Book(s)
1. Trevor Hastie and Rob Tibshirani, ―An Introduction to Statistical Learning with Applications
in R‖, Springer, 2017.
2. Mark van der Loo, Edwin de Jonge, ―Learning R Studio for R Statistical Computing‖, Packt
Publishing, 2012.
3. Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. ―Mining of Massive Datasets‖.
Cambridge University Press. 2014.
Reference Books
1. Hadley Wickham and Garrett Grolemund, ―R for Data Science: Import, Tidy, Transform,
Visualize, and Model Data‖, O‘Reilly, 2017.
2. Grolemund, Garrett. ―Hands-on programming with R‖, O‘ Reilly Media, Inc., 2014.
3. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schutze, ―Introduction to Information
Retrieval‖, Cambridge University Press, First South Asian Edition, 2008.
4. Trevor Hastie, Robert Tibshirani, Jerome Friedman, ―The Elements of Statistical Learning‖,
Springer, Second Edition, 2011.
5. https://www.sscnasscom.com/qualification-pack/SSC/Q2101/
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative) SLO:
1,2,5,9,12
1. Understanding of R System and installation and configuration of R- 3 hours
Environment and R-Studio, Understanding R Packages, their installation
and management
2. Understanding of nuts and bolts of R: 3 hours
a. R program Structure
b. R Data Type, Command Syntax and Control Structures
c. File Operations in R
3. Dataframes and lists 3 hours
4. Excel and R integration with R connector. 3 hours
5. Preparing Data in R 3 hours
a. Data Cleaning
b. Data imputation
c. Data conversion
6. Manipulating Matrices in R 3 hours
7. Outliers detection using R 3 hours
8. Correlation and N-Fold cross validation in R 3 hours
9. Debugging and Program Efficiency in R 3 hours
10. Visualizing data using R with different type of graphs and charts 3 hours

Total Laboratory Hours 30 hours

Mode of assessment: Assessment Examination, FAT Lab Examination
Recommended by Board of Studies 08-02-2020
Approved by Academic Council No. 58 Date 26-02-2020
Course Code Essentials of Data Analytics L T P J C
CSE3506 2 0 2 4 4
Pre-requisite NIL Syllabus version
v.1.0
Course Objectives:
9. To understand the concepts of analytics using various machine learning models.
10. To appreciate supervised and unsupervised learning for predictive analysis
11. To understand data analytics as the next wave for businesses looking for competitive
advantage
12. Carry out rule-based analysis of the data in line with the analysis plan
13. Validate the results of their analysis according to statistical guidelines
14. Validate and review data accurately and identify anomalies
15. To learn aspects of computational learning theory
16. Apply statistical models to perform Regression Analysis, Clustering and Classification

Expected Course Outcome:

6. Identify and apply the appropriate supervised learning techniques to solve real world
problems with labelled data.
7. Choose and implement typical unsupervised algorithms for different types of applications
with unlabelled data.
8. Implement statistical analysis techniques for solving practical problems.
9. Understand different techniques to optimize the learning algorithms.
10. Aware of health and safety policies followed in organization, data and information
management and knowledge & skill development.

Module:1 Regression Analysis 6 hours

Linear regression: simple linear regression - Regression Modelling - Correlation, ANOVA,
Forecasting, Autocorrelation

Module:2 Classification 6 hours

Logistic Regression, Decision Trees, Naïve Bayes-conditional probability - Random Forest - SVM
Classifier

Module:3 Clustering 4 hours

K-means, K-medoids, Hierarchical clustering
Module:4 Optimization 3 hours
Gradient descent - Variants of gradient descent - Momentum - Adagrad - RMSprop - Adam -
AMSGrad

Module:5 Managing Health and Safety 4 hours

Comply with organization‘s current health, safety and security policies and procedures - Report
any identified breaches in health, safety, and security policies and procedures to the designated
person - Identify and correct any hazards that they can deal with safely, competently and within
the limits of their authority - Report any hazards that they are not competent to deal with to the
relevant person in line with organizational procedures and warn other people who may be
affected.

Module:6 Data and Information Management 4 hours

 Establish and agree with appropriate people the data/information they need to provide, the
formats in which they need to provide it, and when they need to provide it - Obtain the
data/information from reliable sources - Check that the data/information is accurate, complete
and up-to-date

Module:7 Learning and Self Development 3 hours

Obtain advice and guidance from appropriate people to develop their knowledge, skills and
competence - Identify accurately the knowledge and skills they need for their job role - Identify
accurately their current level of knowledge, skills and competence and any learning and
development needs - Agree with appropriate people a plan of learning and development
activities to address their learning needs

Total Lecture hours 30 hours

Text Book(s)
1. Cathy O‘Neil and Rachel Schutt. ―Doing Data Science, Straight talk from the Frontline‖,
O‘Reilly. 2014.
2. Dan Toomey, ―R for Data Science‖, Packt Publishing, 2014.
3. Trevor Hastie, Robert Tibshirani and Jerome Friedman. ―Elements of Statistical Learning‖,
Springer , Second Edition. 2009.
4. Kevin P. Murphy. ―Machine Learning: A Probabilistic Perspective‖, MIT Press; 1st Edition,
2012.
Reference Books
1. Glenn J. Myatt, ―Making Sense of Data : A Practical Guide to Exploratory Data Analysis and
Data Mining‖, John Wiley & Sons, Second Edition, 2014.
2. G. K. Gupta, ―Introduction to Data Mining with Case Studies‖, Easter Economy Edition,
Prentice Hall of India, 2006.
3. Michael Berthold, David J. Hand, ―Intelligent Data Analysis‖, Springer, 2007.
4. Colleen Mccue, ―Data Mining and Predictive Analysis: Intelligence Gathering and Crime
Analysis‖, Elsevier, 2007.
5. R N Prasad, Seema Acharya, ―Fundamentals of Business Analytics‖, Wiley; Second edition,
2016.
6. https://www.sscnasscom.com/qualification-pack/SSC/Q2101/
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative) SLO: 1,2,4,
12, 14
1. Linear regression analysis 3 hours
2. Forecasting - weather dataset using R 3 hours
3. Gradient descend implementation using R 3 hours
4. Text Analytics – Sentiment Analysis using R, Word cloud analysis using R 3 hours
5. Time Series Components( Trend, Seasonality, Cyclicity and Level) 3 hours
6. Banking Sector: Understand customer spend & repayment behavior, along 3 hours
with evaluating areas of bankruptcy, fraud, and collections. Also, respond to
customer requests for help with proactive offers and service.
7. Retail Case Study: A retail store requires analyzing the day-to-day 3 hours
transactions and keeping a track of its customers spread across various
locations and their purchases/returns across various categories. The
 objective of the case study is to understand customer behavior in-terms of
purchase and returns through various Data Manipulation steps in R.
8 Movie Recommendation System: To understand the functioning of how a 3 hours
recommendation system works. Develop an Item Based Collaborative Filter
using Netflix dataset
9. Case study on Stock Market Analysis and applications. Stock data can be 3 hours
obtained from Yahoo! Finance, Google Finance. A team of students can
apply statistical modeling on the stock data to uncover hidden patterns. R
provides tools for moving averages, auto regression and time-series analysis
which forms the crux of financial applications.
10. Detect credit card fraudulent transactions - The dataset can be obtained 3 hours
from Kaggle. The team will use a variety of machine learning algorithms
that will be able to discern fraudulent from non-fraudulent one.
Total Laboratory Hours 30 hours
Mode of assessment: Assessment Examination, FAT Lab Examination
Recommended by Board of Studies 08-02-2020
Approved by Academic Council No. 58 Date 26-02-2020
Course Code Information Security Analysis and Audit L T P J C
CSE3501 Job Role: SSC/Q0901 2 0 2 4 4
Pre-requisite Computer Networks (CSE1004/ITE3001/SWE2002) Syllabus version
v.1.0
Objective of the course
1. To introduce system security related incidents and insight on potential defenses, counter measures
against common threat/vulnerabilities.
2. To provide the knowledge of installation, configuration and troubleshooting of information security
devices.
3. To make students familiarize on the tools and common processes in information security audits and
analysis of compromised systems.

Expected Outcome
After successfully completing the course the student should be able to
1. Contribute to managing information security
2. Co-ordinate responses to information security incidents
3. Contribute to information security audits
4. Support teams to prepare for and undergo information security audits
5. Maintain a healthy, safe and secure working environment
6. Provide data/information in standard formats
7. Develop knowledge, skills and competence in information security

1 Information Security Fundamentals 7 hours

Definitions & challenges of security, Attacks & services, Security policies, Security Controls, Access
control structures, Cryptography, Deception, Ethical Hacking, Firewalls, Identify and Access Management
(IdAM).

2 System Security 6 hours

System Vulnerabilities, Network Security Systems, System Security, System Security Tools, Web
Security, Application Security, Intrusion Detection Systems,
.
3 Information Security Management 3 hours
Monitor systems and apply controls, security assessment using automated tools, backups of security
devices, Performance Analysis, Root cause analysis and Resolution, Information Security Policies,
Procedures, Standards and Guidelines

4 Incident Management 5 hours

Security requirements, Risk Management, Risk Assessment, Security incident management, th ird
party security management, Incident Components, Roles.

5 Incident Response 4 hours

Incident Response Lifecycle, Record, classify and prioritize information security incidents using standard
templates and tools, Responses to information security incidents, Vulnerability Assessment, Incident
Analysis

6 Conducting Security Audits 3 hours

Common issues in audit tasks and how to deal with these, Different systems and structures that may need
information security audits and how they operate, including: servers and storage devices, infrastructure
and networks , application hosting and content management, communication routes such as messaging,
Features, configuration and specifications of information security systems and devices and associated
processes and architecture, Common audit techniques, Record and report audit tasks, Methods and
techniques for testing compliance.

7 Information Security Audit Preparation 2 hours

Establish the nature and scope of information security audits, Roles and responsibilities, Identify the
procedures/guidelines/checklists, Identify the requirements of information security, audits and prepare
for audits in advance, Liaise with appropriate people to gather data/information required for information
security audits.

8 Self and Work Management 2 hours

Establish and agree work requirements with appropriate people, Keep the immediate work area clean and
tidy, utilize time effectively, Use resources correctly and efficiently, Treat confidential information
correctly, Work in line with organization‘s policies and procedures, Work within the limits of their job
role.

Total Lecture hours: 30 hours

Text Book(s)
1. William Stallings, Lawrie Brown, Computer Security: Principles and Practice, 3rd edition, 2014.
2. Nina Godbole, Information Systems Security: Security Management, Metrics, Frameworks and Best
Practices, Wiley, 2017
3. Nina Godbole, Sunit Belapure, Cyber Security- Understanding cyber-crimes, computer forensics and
legal perspectives, Wiley Publications, 2016
4. Andrew Vladimirov Michajlowski, Konstantin, Andrew A. Vladimirov, Konstantin V. Gavrilenko,
Assessing Information Security: Strategies, Tactics, Logic and Framework, IT Governance Ltd,
O‘Reilly, 2010
Reference Books
1. Charles P. Pfleeger, Security in Computing, 4th Edition, Pearson, 2009.
2. Christopher J. Alberts, Audrey J. Dorofee , Managing Information Security Risks, Addison-Wesley
Professional, 2004
3. Peter Zor, The Art of Computer Virus Research and Defense, Pearson Education Ltd, 2005
4. Lee Allen, Kevin Cardwell, Advanced Penetration Testing for Highly-Secured Environments - Second
Edition, PACKT Publishers, 2016
5. Chuck Easttom , System Forensics Investigation and Response, Second Edition, Jones & Bartlett
Learning, 2014
6. David Kennedy, Jim O‘Gorman, Devon Kearns, and Mati Aharoni, Metasploit The Penetration
7 Tester‘s Guide, No Starch Press, 2014
8. Practical Malware Analysis by Michael Sikorski and Andrew Honig, No Starch Press, 2015
9. Ref Links:
https://www.iso.org/isoiec-27001-information-security.html
https://csrc.nist.gov/publications/detail/sp/800-55/rev-1/final
https://www.sans.org/reading-room/whitepapers/threats/paper/34180
https://www.sscnasscom.com/qualification-pack/SSC/Q0901/

List of Experiments (Indicative) SLO: 1,2,17

 Install and configure information security devices
 Security assessment of information security systems using automated
tools.
 Vulnerability Identification and Prioritization
 Working with Exploits
 Password Cracking
 Web Application Security Configuration
  Patch Management
 Bypassing Antivirus Software
 Static Malware Analysis
 Dynamic Malware Analysis
 Penetration Testing
 MySQL SQL Injection
 Risk Assessment
 Information security incident Management
 Exhibit Security Analyst Role

Total Laboratory Hours 30 hours

Recommended by Board of Studies 08-02-2020
Approved by Academic Council No. 58 Date 26-02-2020
Course Code Information Security Management L T P J C
CSE3502 Job Role: SSC/Q0901 2 0 2 4 4
Pre-requisite Computer Networks (CSE1004/ITE3001/SWE2002) Syllabus version
v.1.0
Objective of the course
4. To introduce system security related incidents and insight on potential defenses, counter
measures against common threat/vulnerabilities.
5. To provide the knowledge of installation, configuration and troubleshooting of information
security devices.
6. To make students familiarize on the tools and common processes in information security audits
and analysis of compromised systems.

Expected Outcome
After successfully completing the course the student should be able to
8. Contribute to managing information security
9. Co-ordinate responses to information security incidents
10. Contribute to information security audits
11. Support teams to prepare for and undergo information security audits
12. Maintain a healthy, safe and secure working environment
13. Provide data/information in standard formats
14. Develop knowledge, skills and competence in information security

1 Information Security Devices 5 hours

Identify And Access Management (IdAM), Networks (Wired And Wireless) Devices, Endpoints/Edge
Devices, Storage Devices, Servers, Infrastructure Devices (e.g. Routers, Firewall Services) ,
Computer Assets, Servers And Storage Networks, Content management, IDS/IPS

2 Security Device Management 6 hours

Different types of information security devices and their functions,
Technical and configuration specifications, architecture concepts and design patterns and how these
contribute to the security of design and devices.

3 Device Configuration 5 hours

Common issues in installing or configuring information security devices, Methods to resolve these
issues, Methods of testing installed/configured information security devices,

4 Information Security Audit Preparation 5 hours

Establish the nature and scope of information security audits, Roles and responsibilities, Identify the
procedures/guidelines/checklists, Identify the requirements of information security, audits and
prepare for audits in advance, Liaise with appropriate people to gather data/information required
for information security audits. Security Audit Review -
Organize data/information required for information security audits using standard templates and tools,
Audit tasks, Reviews, Comply with the organization‘s policies, standards, procedures, guidelines and
checklists, Disaster Recovery Plan
5 Team Work and Communication 2 hours
Communicate with colleagues clearly, concisely and accurately , Work with colleagues to integrate
their work effectively, Pass on essential information to colleagues in line with organizational
requirements, Identify any problems they have working with colleagues and take the initiative to
solve these problems, Follow the organization‘s policies and procedures for working with colleagues
6 Managing Health and Safety 2 hours
Comply with organization‘s current health, safety and security policies and procedures, Report any
identified breaches in health, safety, and Security policies and procedures, Identify, report and correct
any hazards, Organization‘s emergency procedures, Identify and recommend opportunities for
improving health, safety, and security.

7 Data and Information Management 3 hours

Fetching the data/information from reliable sources, Checking that the data/information is accurate,
complete and up-to-date, Rule-based analysis of the data/information, Insert the data/information into
the agreed formats, Reporting unresolved anomalies in the data/information.

8 Learning and Self Development 2 hours

Identify accurately the knowledge and skills needed, Current level of knowledge, skills and
competence and any learning and development needs, Plan of learning and development activities to
address learning needs, Feedback from appropriate people, Review of knowledge, skills and
competence regularly and appropriate action taken

Total Lecture hours: 30 hours

Text Book(s)
1. Information Systems Security: Security Management, Metrics, Frameworks and Best Practices,
Nina Godbole, Wiley, 2017
2. Rhodes-Ousley, Mark. Information Security: The Complete Reference, Second Edition, .
Information Security Management: Concepts and Practice. New York, McGraw-Hill, 2013.
3. Christopher J. Alberts, Audrey J. Dorofee , Managing Information Security Risks, Addison-
Wesley Professional, 2004
Reference Books
1. Andrew Vladimirov Michajlowski, Konstantin, Andrew A. Vladimirov, Konstantin V.
Gavrilenko, Assessing Information Security: Strategies, Tactics, Logic and Framework, IT
Governance Ltd, O‘Reilly 2010
2. Christopher J. Alberts, Audrey J. Dorofee , Managing Information Security Risks, Addison-
Wesley Professional, 2004
3. Chuck Easttom , System Forensics Investigation and Response, Second Edition, Jones & Bartlett
Learning, 2014
4. David Kennedy, Jim O‘Gorman, Devon Kearns, and Mati Aharoni, Metasploit The Penetration
5. Tester‘s Guide, No Starch Press, 2014
Ref Links:
https://www.iso.org/isoiec-27001-information-security.html
https://www.sans.org/reading-room/whitepapers/threats/paper/34180
https://csrc.nist.gov/publications/detail/sp/800-40/version-20/archive/2005-11-16
https://www.sscnasscom.com/qualification-pack/SSC/Q0901/

List of Experiments (Indicative) SLO: 1,2,17

1.  Install and configure information security devices
 Penetration Testing
 MySQL SQL Injection
 Information security incident Management
 Intrusion Detection/Prevention
 Port Redirection and Tunneling
 Exploring the Metasploit Framework
 Working with Commercial Tools like HP Web Inspect and IBM
 AppScan etc.,
 Explore Open Source tools like sqlmap, Nessus, Nmap etc
 Documentation with Security Templates from ITIL
 Carry out backups of security devices and applications in line with
information security policies, procedures and guidelines
 Information security audit Tasks - Procedures/guidelines/checklists for
the audit tasks

Total Laboratory Hours 30 hours

Recommended by Board of Studies 08-02-2020
Approved by Academic Council No. 58 Date 26-02-2020
ENG1002 Effective L TP J C
English
0 0 4 0 2
Pre-requisite Not cleared English Proficiency Test (EPT) Syllabus version
v.2.0
Course Objectives:
1. To enable students develop basic proficiency in Language Skills
2. To help students overcome communication barriers
3. To facilitate students communicate effectively in academic and social contexts

Expected Course Outcome:

1. Speak fluently in academic and social contexts
2. Listen for global and specific comprehension to improve study skills like
notetaking,summarizing, etc
3. Read and comprehend technical and general texts
4. Write grammatically correct creative and descriptive sentences and paragraphs
inspecific contexts
5. Enact on social contexts with a message, and communicate clearly and effectively in
formalandinformal contexts

Mode of Evaluation:Online Quizzes, Presentation, Role play, Group Discussions,

Assignments,Mini project.
List of Challenging Experiments (Indicative)
1. Speaking: Introduce yourself using Temperament Sorter 8 hours
2. Reading: Loud Reading with focus on pronunciation 4 hours
3. Writing: Descriptive Writing – 6 hours
Process Compare & Contrast –
Product description
4. Speaking: Just a Minute / Activities through VIT Community Radio 6 hours
5. Writing: Travelogue Writing - 25+ FAQs (Wh-questions) on a 10 hours
place theyhave visited – Pair work
6. Speaking: Discuss facts and opinions using question tags 6 hours
7. Writing: Formal Letter Writing focusing on Content 6 hours
8. Vocabulary: Correct spelling errors 4 hours
9. Speaking: Asking for and giving Directions/Instructions 6 hours
10. Writing: Story writing using prompts/pictures 4 hours
Total Laboratory Hours 60 hours
Text Books
1. Lewis Lansford and Peter Astley. Oxford English for Careers: Engineering 1: Student's Book.
2013. USA: Oxford University Press.
2. Jaimie Scanlon. Q: Skills for Success 1 Listening & Speaking. 2015. [Second Revised
Edition]. Oxford: Oxford University Press.
Reference Books
1. Sanjay Kumar and Puspalata. Communication Skills. 2015. [Second Edition] Print. New
Delhi: Oxford University Press.
2. John Seely. Oxford Guide to Effective Writing and Speaking. 2013. [Third Edition].New
Delhi: Oxford University Press.
3. Meenakshi Raman. Communication Skills. 2011. [Second Edition]. New Delhi:
OxfordUniversity Press.
4. Terry O‟Brien. Effective Speaking Skills. 2011. New Delhi: Rupa Publishers.
5. BarunMitra. Effective Technical Communication: AGuide for Scientists and Engineers.
2015.New Delhi: Oxford University Press.

Mode of evaluation: Online Quizzes, Presentation, Role play, Group Discussions, Assignments,
Mini project.
Recommended by Board of 22-07-2017
Studies
Approved by Academic Council No. 46 Date 24-08-2017