TABLE OF CONTENTS

Page Number
Foreword xxix
Programme Educational Objectives and Programme Outcomes xxxi
Curriculum Structure xxxii
Course Contents
I YEAR - I SEMESTER
19HS103 - Engineering Mathematics- I(C) 03
19HS113 - Engineering Physics-A 07
19EE101 - Basics of Electrical & Electronics Engineering 11
19ME104 - Engineering Graphics and Design 15
19CS103 - Programming for Problem Solving - I 17
19CS104 - Basics of Computer & Internet 23
19PC001 - Physical Fitness, Sports & Games-I
I YEAR - II SEMESTER
19HS109 - Engineering Mathematics II(C) 27
19CS106 - Discrete Mathematical Structures 31
19HS117 - Engineering Chemistry I (A) 33
19CS105 - Programming for Problem Solving-II 35
19HS122 - English Proficiency and Communication Skills 43
19HS124 - Constitution of India 47
19ME103 - Workshop 49
19HS123 - Technical English Communication 51
19PC002 - Physical Fitness, Sports & Games-II
II YEAR - I SEMESTER
19HS203 - Probability and Statistics 57
19CS202 - Data Structures 59
19CS204 - Digital Logic Design 63
19CS203 - Database Management Systems 65
19IT201 - OOPs through JAVA 69
19HS204 - Environmental Studies 75
19PC003 - Life Skills - I
19PC004 - Technical Seminar-I
19PC005 - Intra-Disciplinary Projects-I 79
19PC006 - Physical Fitness, Sports & Games-III
II YEAR - II SEMESTER
19IT212 - Formal Languages & Automata Theory and Compiler Design 83
19CS214 - Computer Organization & Architecture 85
19IT229 - Operating Systems 87
19IT211 - Python Programming 91
19IT213 - Web Technologies 95
19MS304 - Principles of Management & Organizational Behaviour 99
19PC007 - Life Skills-II
19PC008 - Technical Seminar-II
19PC009 - Intra-Disciplinary Projects-II 101
III YEAR - I SEMESTER
19IT311 - Data Communications and Networking 107
19CS302 - Software Engineering 109
19IT302 - Design & Analysis of Algorithms 113
- Departmental Elective -I
- Open Elective- I
19HS205 - Soft Skills Lab 117
19PC010 - Employability Skills-I
19PC011 - Inter-Departmental Projects-I 121
19PC012 - Modular Course
III YEAR - II SEMESTER
19CS301 - Data Mining Techniques 125
19IT301 - Internet of Things 129
19CS314 - Competitive Coding
- Departmental Elective -II
- Open Elective-II
19HS206 Professional Communications Lab 133
19HS301 - Human Values, Professional Ethics & Gender Equity 135
19PC013 - Employability skills-II
19PC014 - Inter-Departmental Projects-II 137
IV YEAR - I SEMESTER
19IT401 - Cryptography & Network Security 141
19CS433 - Bigdata & Analytics 143
Departmental Elective-III
Departmental Elective-IV
- Open Elective-III
19PC015 - Societal-Centric and Industry Related Projects 147
IV YEAR - II SEMESTER
19PC016/17 - Internship / Project Work

DEPT. ELECTIVES
19CS335 - R Programming 153
19IT331 - Mobile Application Devlopment 157
19CS313 - Artificial Intelligence 159
19CS337 - Cloud Computing 163
19CS332 - Embedded Systems 167
19CS336 - Network Programming 171
19CS334 - Fundamentals of Image Processing 175
19CS338 - Advanced Data Mining 179
19IT431 - Multimedia Computing 183
19CS333 - Open Source Web Technologies 187
19IT438 - Machine Learning 191
19IT432 - Block Chain Technologies 195
 FOREWORD
Information Technology (IT) is transforming our world, in a myriad ways. Recent developments in IT tech-
nologies such as Artificial Intelligence, Bigdata Analytics, Internet of Things, Cyber security, Cloud computing
and Black Chain Technologies are becoming part of many engineering applications used in day to day life.
It is changing the way we do business, the way we learn, the way we communicate, and even the way we
entertain ourselves. The discipline of Information Technology addresses the integration, design, deploy-
ment, management of computing, networking resources and services, as well as the development of
technology infrastructures in organizations. The Indian IT industry has undergone a rapid evolution, as it has
kept abreast of what the global markets require in terms of products and services. The country has now
positioned itself as an IT hub, a sourcing destination for IT products and services that spell trust, high quality,
and cost-effectiveness. The IT industry has shaped itself into a process-oriented, Best Practices-focused
and skill-rich entity that has found favor with global customers. IT specialists solve complex software and
hardware problems that require fundamental knowledge, competencies and utilize the processes of needs
assessment, technology transfer, and user support.
B. Tech. in Information Technology prepares students for a variety of careers extending into diverse facets of
the information-age economy. At the undergraduate level, students can focus on various aspects of IT
ranging from Problem Solving, Full scale Web and mobile application development, Data science, and
Networking. The program requires completion of a common IT core, specialization in courses of student’s
choice, additional electives, and five projects. R19 curriculum includes skill-oriented activities to enable the
students to acquire handson experience of technology to make them industry ready.
R19 curriculum comprises of:
• Six months Industry Internship to make students industry ready
• Five Projects of intra disciplinary, inter disciplinary, Industry and societal centric nature
• More emphasis on Problem solving skills
• One modular courses with industry support
• Enhanced skill based courses for improving employment opportunities
• Advanced courses like Artificial Intelligence, Cloud Computing, Big Data Analytics and Internet of Things
• Laboratory sessions embedded into as many courses as possible.
In R19 curriculum, every care has been taken to accommodate the knowledge and skill requirements of
industry through practicing of proper activities. While making the graduates work ready, it also enables them
to be successful in competitive examinations.
The focus area of each unit in every course is clearly defined. Topics of contemporary relevance such as the
Hardware, Computing devices, software related to Smart Phones, Electronic Controllers, Home Appliances,
Automobiles and Medical Devices etc., are included.
The Board of Studies consisting eminent personalities along with experienced faculty members of the
university have designed the curriculum to offer knowledge and skill of information technology on the above
mentioned areas. The curriculum includes concepts with skill based tasks through integrated laboratory
and activities combined with theory. The department aims to make graduates ready for the industrial needs.
External BoS Members:
1. Dr.C.Raghavendra Rao, Professor, University of Hyderabad, Hyderabad
2. Dr. R.B.V. Subramanyam, Professor & HOD, Department of CSE, NIT Warangal
3. Dr. Salman Abdul Moiz, Professor, Department Computer Science in the School of Computer and
Information Sciences, University of Hyderabad
4. Mr. Chilli Anil Kumar, Scientist –E, CAIR DRDO, C V Raman Nagar, Bengaluru
5. Dr. Adi Maheswara Reddy, Manger Software Engineering, Parexel International Pvt. Ltd, Hyderabad-
500081
I thank all the BOS Members, Academic Council Members and University authorities especially Dean Aca-
demics, Rector and honourable Vice Chancellor for encouraging and supporting us in designing this inno-
vative curriculum for IT students.
Dr. K.V. Krishna Kishore
HOD, IT
 VISION
To evolve into a Centre of Excellence in Science & Technology through
creative and innovative practices in teaching – learning, towards promoting
academic achievement and research excellence to produce internationally
accepted, competitive and world class professionals who are
psychologically strong & emotionally balanced, imbued with social
consciousness & ethical values.

MISSION
To provide high quality academic programmes, training activities, research
facilities and opportunities supported by continuous industry - institute
interaction aimed at promoting employability, entrepreneurship, leadership
and research aptitude among students and contribute to the economic
and technological development of the region, state and nation.

Department of
INFORMATION TECHNOLOGY

VISION
To contribute to the society through excellence in technical and knowledge-
based education utilizing the potential of Emerging Technologies in the
field of Information Technology with a deep passion for wisdom, culture
and values.

MISSION
• Impart modern teaching methodologies to provide quality education to the
students
• Identify industrial requirements and produce employable engineers
• Engage students and faculty members in research to meet the
requirements of IT industry
 B.Tech. INFORMATION TECHNOLOGY
Programme Educational Objectives (PEOs)
PEO1: To provide students with a solid foundation in mathematics, engineering, basic science fundamen-
tals required to solve computing problems.
PEO2: To expose students to tools and techniques of Computer Science and Information Technology so
that they can comprehend, analyze, design and create innovative computing products and solutionsfor
real life problems.
PEO3: To inculcate in students multi-disciplinary approach, professional attitude and ethics,communication
and teamwork skills, and ability to relate computer engineering issues with social awareness.
PEO4: To develop professional skills in students that prepares them for immediate employmentand for
lifelong learning in advanced areas of computer science and related fields.

Programme Specific Outcomes (PSOs)

PSO1: To be proficient with analytical and logical skills for the design, development, testing and mainte-
nance of software.
PSO2: To use cutting-edge technologies for devising cost-effective solutions and skills acquired will be
useful for both industry and society.
Programme Outcomes (POs)
The graduates of Information Technology will be able to:
PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamen-
tals, and an engineering specialization to the solution of complex engineering problems.
PO2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sci-
ences, and engineering sciences.
PO3: Design/development of solutions: Design solutions for complex engineering problems and de-
sign system components or processes that meet the specified needs with appropriate consider-
ation for the public health and safety, and the cultural, societal, and environmental considerations.
PO4: Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
PO6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess soci-
etal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
PO7: Environment and sustainability: Understand the impact of the professional engineering solutions
in societal and environmental contexts, and demonstrate the knowledge of, and need for sustain-
able development.
PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice.
PO9: Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
PO10: Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports
and design documentation, make effective presentations, and give and receive clear instructions.
PO11: Project management and finance: Demonstrate knowledge and understanding of the engineer-
ing and management principles and apply these to one’s own work, as a member and leader in a
team, to manage projects and in multidisciplinary environments.
PO12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
 B.Tech.

IT
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

I YEAR

I Year I Semester
Course Code Course Title L T P C

19HS103 Engineering Mathematics I(C) 3 - 2 4

19HS113 Engineering Physics (A) 3 - 2 4

19EE101 Basics of Electrical & Electronics Engineering 3 - 2 4

19ME104 Engineering Graphics and Design 1 - 2 2

19CS103 Programming for Problem Solving -I 3 - 4 5

19CS104 Basics of Computer & Internet 1 - 2 2

19PC001 Physical Fitness, Sports & Games-I - - 3 1

Total 14 - 17 22

I Year II Semester

Course Code Course Title L T P C

19HS109 Engineering Mathematics II(C) 3 - 2 4

19CS106 Discrete Mathematical Structures 3 - - 3

19HS117 Engineering Chemistry (A) 2 - - 2

19CS105 Programming for Problem Solving-II 3 - 4 5

19HS122 English Proficiency and Communication Skills - - 2 1

19HS124 Constitution of India 1 - - 1

19ME103 Workshop 1 - 2 2

19HS123 Technical English Communication 2 - 2 3

19PC002 Physical Fitness, Sports & Games-II - - 3 1

Total 15 - 15 22

L : Lecture Hours/week ; T : Tutorial Hours/week ;

P : Practical Hours/week ; C : Credits of the Course

VFSTR XXXII
 B.Tech.

IT
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

II YEAR

II Year I Semester

Course Code Course Title L T P C

19HS203 Probability and Statistics 3 1 - 4

19CS202 Data Structures 3 - 2 4

19CS204 Digital Logic Design 3 - - 3

19CS203 Database Management Systems 3 - 2 4

19IT201 OOPs through JAVA 3 - 4 5

19HS204 Environmental Studies 1 - - 1

19PC003 Life Skills - I - - 2 -

19PC004 Technical Seminar - I - - 2 1

19PC005 Intra-Disciplinary Projects - I - - 2 1

19PC006 Physical Fitness, Sports & Games - 3 - - 2 1

Total 16 1 16 24

II Year II Semester

Course Code Course Title L T P C

19IT212 Formal Languages & Automata Theory and Compiler Design 3 - - 3

19CS214 Computer Organization & Architecture 3 - - 3

19IT229 Operating Systems 3 - 2 4

19IT211 Python Programming 2 - 4 4

19IT213 Web Technologies 3 - 2 4

19MS304 Principles of Management & Organizational Behaviour 3 - - 3

19PC007 Life Skills - II - - 2 1

19PC008 Technical Seminar - II - - 2 1

19PC009 Intra-Disciplinary Projects - II - - 2 1

Total 17 0 14 24

VFSTR XXXIII
 B.Tech.

IT
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

I YEAR

III Year I Semester

Course Code Course Title L T P C

19IT311 Data Communications and Networking 3 - - 3

19CS302 Software Engineering 3 - 2 4

19IT302 Design & Analysis of Algorithms 2 - 4 4

Departmental Elective-I 3 - 2 4

Open Elective-I 3 - - 3

19HS205 Soft Skills Lab 1 - - 1

19PC010 Employability Skills - I - - 2 -

19PC011 Inter-Departmental Projects - I - - 4 2

19PC012 Modular Course - - - 1

Total 15 0 14 22

III Year II Semester

Course Code Course Title L T P C

19CS301 Data Mining Techniques 3 - 2 4

19IT301 Internet of Things 3 - 2 4

19CS314 Competitive Coding - - 2 1

Departmental Elective-II 3 - 2 4

Open Elective-II 3 - - 3

19HS206 Professional communications Lab - - 2 1

19HS301 Human Values, Professional Ethics & Gender Equity 2 - - 2

19PC013 Employability Skills - II - - 2 1

19PC014 Inter-Departmental Projects - II - - 4 2

Total 14 0 16 22

VFSTR XXXIV
 B.Tech.

IT
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

II YEAR

IV Year I Semester

Course Code Course Title L T P C

19IT401 Cryptography & Network Security 3 - 2 4

19CS433 Bigdata Analytics 3 - 2 4

Departmental Elective - III 3 - 2 4

Departmental Elective - IV 3 - 2 4

Open Elective -III 3 - 0 3

19PC015 Societal Centric and Industry Related Projects - - 6 3

Total 15 - 14 22

IV Year II Semester

Course Code Course Title L T P C

19PC016 /17 Internship / Project work - - 24 12

Total - - 24 12

In addition to L,T, P, C the following information in hours/semester is also provided for each course.
WA/RA : Writing Assignment / Reading Assignment
SSH/HSH : Self Study Hours / Home Study Hours
CS : Case Study and Example
SA : Skills Activity
S : Seminar
BS : Beyond Syllabus

VFSTR XXXV
 B.Tech.
R-19 CURRICULUM
IT
I YEAR
(Applicable for students admitted into First Year from academic year 2019-20onwards)

DEPARTMENT ELECTIVES COURSES

Course Code Course Title L T P C

19CS335 R PROGRAMMING 3 - 2 4

19IT331 MOBILE APPLICATION DEVELOPMENT 3 - 2 4

19CS313 ARTIFICIAL INTELLIGENCE 3 - 2 4

19CS337 CLOUD COMPUTING 3 - 2 4

19CS332 EMBEDDED SYSTEMS 3 - 2 4

19CS336 NETWORK PROGRAMMING 3 - 2 4

19CS334 FUNDAMENTALS OF IMAGE PROCESSING 3 - 2 4

19CS338 ADVANCED DATA MINING 3 - 2 4

19IT431 MULTIMEDIA COMPUTING 2 - 2 3

19CS333 OPEN SOURCE WEB TECHNOLOGIES 3 - 2 4

19IT438 MACHINE LEARNING 3 - 2 4

19IT432 BLOCK CHAIN TECHNOLOGIES 3 - 2 4

VFSTR XXXVI
 B.Tech.
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)
IT
II YEAR

OPEN ELECTIVE COURSES

Course Code Course Title L T P C

19AE521 Basic Automobile Engineering 3 - - 3

19AE531 On Road and Off-road Vehicles 3 - - 3

19AE532 Safety systems in Automobiles 3 - - 3

19AE541 Vehicle Maintenance and pollution Norms 3 - - 3

19BI521 Community Informatics 3 - - 3

19BI531 Health Informatics 3 - - 3

19BI532 Software Tools for Sustainable Biodiversity 3 - - 3

19BM521 Basic Clinical Sciences 3 - - 3

19BM522 Assist Devices and Implant Technology 3 - - 3

19BM531 Clinical Instrumenatation 3 - - 3

19BM532 Biomaterial and Artificial Organs 3 - - 3

19BM533 Biomedical Equipments 3 - - 3

19BM541 Medical Imaging Techniques 3 - - 3

19BM542 Medical Physics 3 - - 3

19BT521 Elements of Biotechnology 3 - - 3

VFSTR XXXVII
 B.Tech.
R-19 CURRICULUM
IT
I YEAR
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

OPEN ELECTIVE COURSES

Course Code Course Title L T P C

19BT531 Community Medicine and Public Health 3 - - 3

19BT532 Biodiversity Economics, Trade and Commerce 3 - - 3

19BT533 Bioplastics and Biocomposites engineering 3 - - 3

19CE521 Environmental Pollution & Control 3 - - 3

19CE522 Building Technology 3 - - 3

19CE531 Disaster Management 3 - - 3

19CE532 Solid Waste Management 3 - - 3

19CE533 Remote Sensing & Geographical Information System 3 - - 3

19CE541 Environmental Impact Assessment 3 - - 3

19CS531 Python Programming 3 - - 3

19CS532 R Programming 3 - - 3

19CS533 Data Structures 3 - - 3

19CS534 Database Management Systems 3 - - 3

19CS535 Operating Systems 3 - - 3

VFSTR XXXVIII
 B.Tech.
R-19 CURRICULUM
(Applicable for students admitted into First Year from academic year 2019-20 onwards)
IT
II YEAR

OPEN ELECTIVE COURSES

Course Code Course Title L T P C

19CS541 Data Mining Techniques 3 - - 3

19CS542 Internet of Things 3 - - 3

19EC521 Embedded Linux 3 - - 3

19EC531 Embedded Systems and RTOS 3 - - 3

19EC532 Microcontrollers for Embedded Systems 3 - - 3

19EC541 Design of IOT Systems (IOT) 3 - - 3

19EE521 Solar PV Technologies-I 3 - - 3

19EE531 Solar PV Technologies-II 3 - - 3

19EE532 Design & Economics of PV plants 3 - - 3

19EE541 Solar Thermal Conversion Systems 3 - - 3

19FT521 Introduction of Food Laws and Regulation 3 - - 3

19FT531 Food Quality and Evaluation 3 - - 3

19FT532 Subjective and Objective Evaluation in Food Products 3 - - 3

19FT541 Food Safety and Public Health 3 - - 3

19HS521 Modern Indian History and Indian Culture 3 - - 3

VFSTR XXXIX
 B.Tech.
R-19 CURRICULUM
IT
I YEAR
(Applicable for students admitted into First Year from academic year 2019-20 onwards)

OPEN ELECTIVE COURSES

Course Code Course Title L T P C

19HS531 Polity and Governance in India 2 - - 2

19HS532 Economic and Social Development in India 2 - - 2

19HS541 Geography of India 2 - - 2

19IT521 OOPs through JAVA 3 - - 3

19IT541 Data Science using Python 3 - - 3

19MS521 Business Environment and Ethics 3 - - 3

19MS522 Managerial Economics 3 - - 3

19MS531 Marketing and HR Management 3 - - 3

19MS532 Finance for Engineers 3 - - 3

19MS541 Production and Operations Management 3 - - 3

19ME521 Biomechanics & Kinesiology 3 - - 3

19ME522 Basics in Robotics 3 - - 3

19ME531 Advances in Robotics 3 - - 3

19ME532 Reliability Engineering 3 - - 3

19ME533 Field and Service Robots 3 - - 3

19ME534 Energy Audit & Management 3 - - 3

19ME535 Supply Chain Management 3 - - 3

19TT531 Fashion Product Development 3 - - 3

19TT532 Costing of Fashion and Apparel Production 3 - - 3

19TT541 Fashion Marketing and Visual Merchandising 3 - - 3

Note : Students should not choose open electives offered by their branch.

VFSTR XL
 II
Y Y E E AA RR
INFORMATION
TECHNOLOGY

B.Tech.
I SEMESTER
 19HS103 - Engineering Mathematics I(C)
 19HS113 - Engineering Physics (A)
 19EE101 - Basics of Electrical & Electronics Engineering
 19ME104 - Engineering Graphics and Design for Software Engineers
 19CS103 - Programming for Problem Solving -I

 19CS104 - Basics of Computers and Internet

 19PC001 - Physical Fitness, Sports & Games-1

II SEMESTER
 19HS109 - Engineering Mathematics II(C)
 19CS106 - Discrete Mathematical Structures
 19HS117 - Engineering Chemistry (A)
 19CS105 - Programming for Problem Solving-II
 19HS122 - English Proficiency and Communication Skills
 19HS124 - Constitution of India
 19ME103 - Workshop
 19HS123 - Technical English Communication
 19PC002 - Physical Fitness, Sports & Games-2

COURSE CONTENTS
I SEM AND II SEM
 19HS103 ENGINEERING MATHEMATICS I (C)
LINEAR ALGEBRA & ORDINARY DIFFERENTIAL
EQUATIONS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
Source:
3 - 2 4 45 - 30 20 45 - 10 - 5
https://
www.google.co.in/
search?q=mathematics+
COURSE DESCRIPTION AND OBJECTIVES: pictures&source=lnms&
tbm=isch&sa=X&ved=
To acquaint students with principles of Mathematics through matrices, differential equations 0ahUKEwiQ-
and numerical methods that serves as an essential tool in several Engineering applications. 837lvXiAhVPVH0
KHe56CVEQ_
AUIECgB#imgrc=
COURSE OUTCOMES: leEr3WUOPHnmSM:

Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Determine rank, eigenvalues and eigenvectors of a matrix 1, 2

and solution of a system of linear equations.

2 Find inverse of a matrix and powers of a matrix. 1, 2

3 Solve differential equations using analytical methods. 1, 2

. 4 Solve differential equations using numerical methods. 1, 2

5 Use software tools to obtain and verify the solutions. 5

SKILLS:
Find rank of a matrix using different methods.

Compute the eigen values and eigen vectors of a matrix.

Find numerical solution of a differential equation using appropriate method.

VFSTR 3
 I Year I Semester

ACTIVITIES: UNIT – I L-9

MATRICES : Rank of a matrix, Normal form, Triangular form, Echelon form; Consistency of system
o Differentiate
of linear equations, Gauss-Jordan method, Gauss elimination method, Gauss-Seidel method.
the method to
find rank of a
matrix. UNIT – II L-9

o Differentiate EIGEN VALUES AND EIGEN VECTORS : Eigen values, Eigen vectors, Properties (without proofs);
the method to Cayley-Hamilton theorem (without proof), Power of a matrix, Diagonalisation of a matrix.
solve given
differential
UNIT – III L-9
equation.
FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS : Basic Definitions, Variable separable,
o Compute Homogeneous differential equations, Linear differential equations, Bernoulli’s differential equations,
numerical
solution to D.E Exact and non-exact differential equations.
and compare
with the output UNIT – IV L-9
obtained by
softwares. HIGHER ORDER ORDINARY DIFFERENTIAL EQUATIONS : Linear differential equations with constant
coefficients, Homogeneous differential equations of second and higher order, Methods to find
particular integral when RHS is of the form : eax , sin ax, cos ax and xn.

UNIT – V L-9
NUMERICAL METHODS TO SOLVE ORDINARY DIFFERENTIAL EQUATIONS : Taylor series method,
Picard’s method, Euler’s and modified Euler’s method, Runge-Kutta method.

VFSTR 4
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Mathematical Preliminaries in WX maxima.

2. Basics of Matrix Algebra.
3. Determine the Rank of a matrix.
4. Reduce into Triangular & Echelon form of a matrix.
5. Solve system of equations using Direct method.
6. Solve system of equations using Cramer’s rule.
7. Solve system of equations using Matrix inversion method.
8. Solving system of equations using Gauss-Jordan method, Gauss elimination method.
9. Calculate the Eigen values and Eigen vectors of a given matrix.
10. Cayley-Hamilton theorem applications for square matrixes.
11. Modal Matrix, Diagnolization of matrix.

TEXT BOOKS :
1. H. K. Dass and Er. Rajanish Verma, “Higher Engineering Mathematics”, 3rd edition,
S.Chand & Co., 2015.
2. B. S. Grewal, “Higher Engineering Mathematics”, 44th edition, Khanna Publishers, 2018.

REFERENCE BOOKS :
1. John Bird, “Higher Engineering Mathematics”, Routledge (Taylor & Francis Group), 2018.
2. Srimanta Pal and Subodh C. Bhunia, “Engineering Mathematics”, Oxford Publications,
2015.
3. B. V. Ramana, “Advanced Engineering Mathematics”, TMH Publishers, 2008.
4. N. P. Bali and K. L. Sai Prasad, “A Textbook of Engineering Mathematics I, II, III”, Universal
Science Press, 2018.
5. T. K.V. Iyengar et al., “Engineering Mathematics, I, II, III”, S. Chand & Co., 2018.

VFSTR 5
 I Year I Semester

VFSTR 6
 19HS113 ENGINEERING PHYSICS (A)

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 0 2 4 45 0 30 20 15 0 10 2 3

Source: https://
www.deccanchronicle.com/

COURSE DESCRIPTION AND OBJECTIVES:

This course is aimed at imparting knowledge on Crystal physics, principles of Quantum
Mechanics and Electron theory of metals. This course throws light on semiconductor physics
and Optoelectronic devices along with photonics. Further it highlights the principles and
concepts of electrical properties in the perspective of Engineering.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Compute the crystal geometry in terms of crystal planes and defects. 1

2 Apply the principles of quantum mechanics to learn the dynamics 2

of free electrons in metal.

3 Compute carrier concentration in semiconductors and to 4

understand carrier transport mechanism in semiconductors.

4 Evaluate electron dynamics in the presence of electric and 2

magnetic fields.

5 Recognise the importance of photonic devices relevant to 3

engineering domains.

SKILLS:
Analyze crystal structures.

Compute the crystal geometry in terms of crystal planes and defects.

Compute carrier concentration in semiconductors and hence conductivity.

Analyze band structure and classify materials based on band structure and
calculate band gap for semiconductors.

Compute electric and magnetic field in materials based on fundamental

principles.

Calculate photoconductivity, responsivity and sensitivity of various photo

conducting materials such as photodiodes and photo resistors.

Calculate the efficiency and fill factor of solar cell.

VFSTR 7
 I Year I Semester

ACTIVITIES : UNIT - I L-9

INTRODUCTION TO SOLIDS:
o Construction of
various crystal Bonding in Solids (Types); Crystalline and amorphous solids; Lattice points and Space lattice,
models.
Basis, Crystal structure, Unit cell, Primitive cell and Lattice parameters; Crystal systems and Bravais
lattices; Packing factor for SC, BCC and FCC; Miller indices, Distance of separation between
o Identification of
crystal structure successive (h k l) planes; X-ray diffraction, Bragg’s law, Powder crystal method; Classification of
from XRD defects, Point defects.
pattern.
UNIT - II L-10
o Determination
of Hall QUANTUM MECHANICS:
coefficient.
Introduction to Quantum mechanics-wave and particle duality of radiation, deBroglie’s concept of
o Measurement of matter waves, electron diffraction; Heisenberg’s uncertainty principle; Schrodinger’s time independent
height of the wave equation, Eigen values and Eigen functions of a particle confined to one dimensional infinite
building by
square well (potential well).
using Laser.
FREE ELECTRON THEORY OF METALS:
o Finding out the
grating constant Classical and Quantum free electron theory of metals, Fermi-Dirac distribution, Density of states,
by known wave Bloch’s theorem (Qualitative), Kronig - Penny Model (Qualitative), Classification of solids based on
length of laser. energy bands.

o Frequency of
laser by using UNIT - III L-9
diffraction
SEMICONDUCTOR PHYSICS:
grating.
Introduction, Classification of Semiconductors, Direct and indirect band gap semiconductors, Intrinsic
o Determination
semiconductors; Variation of Intrinsic carrier concentration with temperature, Fermi level and
of efficiency of
solar cell when conductivity; Extrinsic semiconductor, Effect of temperature on carrier concentration in extrinsic
two solar cells semiconductors, Band diagrams of extrinsic semi conductors; Hall effect.
are connected
in parallel and
UNIT - IV L-9
in series.
ELECTROMAGNETICS:

Electrostatics : Vector analysis; Computation of electric field and potential in specific cases, Electric
flux density, Divergence, Gauss law, Differential form of Gauss law, Derivation of Coulomb’s law from
Gauss law, Applications of Gauss law, Electric Displacement vector; Applications of Maxwell’s
equations.

Magnetostatics: Gauss law of magnetism, Biot-Savart’s law, Ampere’s law, Faraday’s law of induction
in integral form; Lenz’s law, Maxwell’s equations in integral form.

UNIT - V L-8
OPTOELECTRONICS:
Introduction; Classification of optoelectronic devices; PN Junction diode, Photo detectors, PIN and
Avalanche photo diodes, Photo voltaic cell, LED, Semiconductor diode laser.

VFSTR 8
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS:30

1. Laser - Determination of wavelength.
2. Optical fibre – Determination of Numerical aperture – Acceptance angle.
3. Determination of planck’s constant.
4. Melde’s Experiment - determination of the frequency of tuning fork.
5. Determination of wavelength of given light source using diffraction grating method.
6. Determination of resistivity of metal using 2 probe / 4 probe method.
7. Determination of Energy Band gap of p-n junction diode.
8. Hall Effect - Determination of Hall coefficient.
9. Stewart & Gee’s Experiment- Study of magnetic field along the axis of a current carrying
coil.
10. Verification of Tangent law.
11. Solar cell – Determination of Fill factor & efficiency.
12. LED - Study of V-I characteristics.

TEXT BOOKS:
1. S.O.Pillai, “Solid State Physics”, 8th edition, New Age International Publishers, 2018.
2. H. P. Myers, “Introduction to Solid State Physics”, Taylor & Francis, 2009.

REFERENCE BOOKS:
1. D. Halliday, R. Resnick and J. Walker, “Fundamentals of Physics”, 6th edition, John Wiley
and Sons, 2001.
2. Charles Kittel, “Introduction to Solid State Physics”, 7th edition, Wiley, 2007.
3. Donald A. Neamen, “Semiconductor Physics and Devices:Basic Principle”, 4th edition,
Mc Graw-Hill, 2012.
4. David J. Griffiths, “Introduction to Electrodynamics”, 3rd edition, Prentice Hall of India,
2012.
5. Neil W. Ashcroft and David Mermin, “Solid State Physics”, International Student Edition,
Holt, Rinehort & Winston Publishers, 2008.

LABORATORY MANUALS:
1. Dr.Ruby Das, C.S.Robinson, Rajesh Kumar and Prasanth Kumar “A text book of
Engineering Physics Practical”, 1st edition, Sahu University Science Press, 2010.
2. Jayaraman, “Engineering Physics Laboratory Manual”, 1st edition, Pearson Education,
2014.

VFSTR 9
 I Year I Semester

VFSTR 10
 19EE101 BASIC ELECTRICAL AND
ELECTRONICS ENGINEERING

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 40 - 8 5 5

Source:
https://engineering
interview questions.com

COURSE DESCRIPTION AND OBJECTIVES:

This course provides an in-sight into the functioning of basic electrical components like
resistor, inductor and capacitor. It deals with the constructional and operational details of
both DC & AC machines. It also deals with the basic electronic components like P-N junction
diode, Zener diode, Transistor and their characteristics.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyse the resistive circuits with independent sources and find 1, 2, 3

its solution.

2 Solve the AC (single and three phase) and DC circuits using 1, 2, 3

different methods.

3 Familiarize the concepts of electromagnetism and it’s 1, 2

applications.

4 Explain the types of electrical equipment, machines and 1, 2

its applications.

5 Acquire the knowledge about the characteristics and working 1, 2

principles of semiconductor diodes, transistor.

SKILLS:
Distinguish between linear and nonlinear elements by looking at VI characteristics.

Develop a simple loop generator.

Design a voltage regulator using Zener diode.

Design a half and full wave rectifiers using PN junction diode.

VFSTR 11
 I Year I Semester

UNIT – I L-9
ACTIVITIES:
FUNDAMENTALS OF ELECTRIC CIRCUITS: Concept of network, Active and passive elements, Voltage
o Decoding the and current sources, Concept of linearity and linear network, Unilateral and bilateral elements, R, L
value of
and C as linear elements, Ohm’s Law, Kirchhoff’s Laws, Application to simple series, Parallel
resistors.
circuits, Mesh and nodal analysis of resistive circuits with DC source (Simple numerical problem).
o Design and
fabricate a UNIT – II L-9
simple loop
permanent FUNDAMENTALS OF AC CIRCUITS : Generation of AC voltage, Frequency, Average value, R.M.S.
magnet value, Form factor, Peak factor for sinusoidal only; Analysis of single-phase ac circuits consisting of
generator. R, L, C, RL, RC (series and parallel) (simple numerical problems).
o Design and BALANCED THREE PHASE SYSTEMS: Relation between phase and line quantities of voltages and
fabricate a currents in star and delta connected systems (Elementary treatment only).
simple air
cored
transformer. UNIT – III L-9
FUNDAMENTALS OF ELECTROMAGNETISM: Concepts of Magneto motive force, Reluctance, Flux
o Fabricate full
and half wave and flux density, Concept of self inductance and mutual inductance, Coefficient of coupling (only
rectifiers elementary treatment and Simple numerical problems).
using PN
junction TRANSFORMERS: Principle of operation of single phase transformer, Constructional features, EMF
diodes. equation (simple numerical problems).

o Fabricate a
UNIT – IV L-9
voltage
regulator using DC MACHINES: Constructional details of a DC Machine, DC Generator, Principle of operation, EMF
Zener diode. equation (simple numerical problems); DC Motor, Principle of operation, Torque equation (simple
numerical problems).

AC MACHINES: Principle of operation of three phase induction motor, Slip ring and squirrel cage
motors, Torque equation; Constructional details of synchronous machine.

UNIT – V L-9
SEMICONDUCTOR DEVICES: Classification of semiconductors, P-N junction diode - operation and
its characteristics, Half wave rectifier - operation, efficiency; Full wave rectifiers - types, operation,
efficiency; Zener diode and its characteristics, Zener diode as Voltage regulator, Bi polar junction
transistor- operation, types (NPN & PNP).

VFSTR 12
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS:30

1. Verification of Ohm’s law.
2. Verification of Kirchhoff’s current law.
3. Verification of Kirchhoff’s voltage law.
4. Measurement of Energy in single phase resistive load circuit.
5. Measurement of Power in single phase resistive load circuit.
6. Transformation ratio of a single phase transformer at different loads.
7. Determination of R.M.S. Values of sinusoidal waveform.
8. Determination of impedance in complex AC circuits.
9. Verification of PN junction diode characteristics under both forward and reverse bias.
10. Verification of Zener diode characteristics under reverse bias.

TEXT BOOKS:
1. V. K. Mehta, “Principles of Electrical Engineering and Electronics”, 3rd edition, S. Chand &
Co., New Delhi, 2010.
2. D. P. Kothari, “Basic Electrical and Electronics Engineering”, 1st edition., TMH, New Delhi,
2014.

REFERENCE BOOKS:
1. Millman and Halkias, “Integrated Electronics”, Mc Graw Hill, 1979.
2. A. K. Thereja and B.L. Thereja, “Electrical Technology”, Vol.–II, S. Chand & Co., 2007.
3. U. Bakshi and A. Bakshi, “Basic Electrical Engineering”, 1st edition, Technical
Publications, Pune, 2005.

VFSTR 13
 I Year I Semester

VFSTR 14
 19ME104 ENGINEERING GRAPHICS AND
DESIGN

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
1 - 2 2 15 - 30 20 15 - - - 3

Source:
www.gettyimage.in

COURSE DESCRIPTION AND OBJECTIVES:

Engineering graphics is the language of engineers and is the most effective way of
communicating and sharing technical ideas in the form of pictures/drawings. The objective
of this course is to familiarize the students with the conventional concepts of engineering
drawing and computer aided drawing.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Communicate the technical ideas in the form of drawings. 1

2 Apply the drawing skills in representing various geometrical features. 1

3 Develop orthographic projections and isometric views of various objects. 2

4 Estimate the lateral surface area of regular geometrical solids. 2

5 Sketch simple objects and their pictorial views using AutoCAD. 5

SKILLS:
Convert isometric views of objects into orthographic views and vice versa.

Visualize the shape of 3D components.

Create pictorial views by using AutoCAD.

Understand projections by visualization.

VFSTR 15
 I Year I Semester

UNIT - I L-3, P-6

ENGINEERING CURVES: Types of lines; Lettering; Dimensioning; Geometric construction - lines,
polygons (Angle, ARC, General and Inscribe in circle method), conical curves (General method),
ellipse by Oblong method.

UNIT - II L-3, P-6

ORTHOGRAPHIC PROJECTIONS OF POINTS & LINES: Principles of projection; Projections of points;
Projection of straight lines - inclined to one plane, inclined to both planes.

UNIT - III L-3, P-6

PROJECTION OF PLANES: Projection of planes inclined to one reference plane - triangle, square,
circle, regular pentagon and hexagon.

PROJECTIONS OF SOLIDS: Projection of solids axis inclined to one reference plane - prism, pyramid,
cylinder and cone.

UNIT - IV L-3, P-6

DEVELOPMENT OF SURFACES: Development of lateral surfaces of simple solids - prisms, pyramids,
cylinder and cone.

ORTHOGRAPHIC VIEWS: Conversion of pictorial views into orthographic views.

UNIT - V L-3, P-6

DRAFTING USING COMPUTER PACKAGE: Introduction to 2D modelling software - AutoCAD; Conversion
of Isometric view into Orthographic views of simple castings; Conversion of Orthographic views into
Isometric view of simple solids - prisms, pyramids, cylinders and cones.

TEXT BOOKS:
1. N. D. Bhatt, “Engineering Drawing”, 53rd edition, Charotar Publication, 2014.
2. Basant Agrawal and C.M.Agrawal “Engineering Drawing”, 2nd edition, Tata McGraw-Hill,
2014.

REFERENCE BOOKS:
1. J. Hole, “Engineering Drawing”, 2nd edition, Tata McGraw-Hill, 2008.
2. K. L. Narayana, “Engineering Drawing”, 2nd edition, Scitech Publications, 2008.

VFSTR 16
 19CS103 PROGRAMMING FOR PROBLEM
SOLVING - I

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 4 5 45 - 60 5 30 5 20 5 5

Source:
http://
www.trytoprogram
.com/images
COURSE DESCRIPTION AND OBJECTIVES:
This course is aimed to impart knowledge on basic concepts of C programming language
and problem solving through programming. It covers basic structure of C program, data types,
operators, decision making statements, loops, functions and static data structures. At the end
of this course students will be able to design, implement, test and debug modular C programs.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

COs Course Outcomes POs

1 Understanding of how to write simple, but complete, C programs 3

2 Identification of suitable data type for operands and design of 2

expressions having right precedence.

3 Application of decision making and iterative features of C 1

Programming language effectively.

4 Selection of problem specific data structures and suitable accessing 2

methods.

5 Design and development of non- recursive and recursive functions 3

and their usage to build large modular programs.

6 Development of C programs that are understandable, debuggable, 3

maintainable and more likely to work correctly in the first attempt.

SKILLS:
Analysis of the problem to be solved.
Design of algorithm/solution for a given problem.
Identification of suitable data types for operands.
Application of suitable control statements for decision making.
Design of non-recursive and recursive functions to perform different tasks.
Selection of static data structures for a given problem and manipulation of data
items.
Development of C programs that are understandable, debuggable, maintainable
and more likely to work correctly in the first attempt.

VFSTR 17
 I Year I Semester

ACTIVITIES: UNIT - I L- 9

o Analysis of a INTRODUCTION TO ALGORITHMS AND PROGRAMMING LANGUAGES: Basics of algorithms; Flow

given problem. charts; Generations of programming languages.

o Design of Introduction to C: Structure of a C program - pre-processor statement, inline comments, variable

algorithm/ declaration statements, executable statements; C Tokens - C character set, identifiers and keywords,
solution. type qualifiers, type modifiers, variables, constants, punctuations and operators.

o Implementation
(coding and unit UNIT - II L- 9
testing) of
algorithm. DATA TYPES AND OPERATORS: Basic data types; Storage classes; Scope of a variable; Formatted
I/O; Reading and writing characters; Operators - assignment, arithmetic, relational, logical, bitwise,
o System testing. ternary, address, indirection, size of, dot, arrow, parentheses operators; Expressions - operator
precedence, associative rules.

UNIT - III L- 9
CONTROL STATEMENTS: Introduction to category of control statements; Conditional branching
statements - if, if– else, nested-if, if – else ladder, switch case; Iterative statements - for, while, do -
while, nested loops; Jump statements - break, jump, go to and continue.

UNIT - IV L- 9
ARRAYS: Introduction; Types of arrays; Single dimensional array - declaration, initialization, usage,
reading, writing, accessing, memory representation, operations; Multidimensional arrays.

UNIT - V L- 9
FUNCTIONS: User-defined functions; Function declaration - definition, header of a function, body of a
function, function invocation; Call by value; Call by address; Passing arrays to functions; Command
line arguments; Recursion; Library Functions.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS:60

Experiment 1:
(a) Write a C program to display a simple text on the standard output device using puts ().
(b) Every character holds an ASCII value (an integer number in the range of 0 to 255) rather
than that character itself, which is referred to as ASCII value. Likewise, for a given input
whether it is character or digit or special character or lower case or upper case letter, find
corresponding ASCII value.
Example: ASCII value of ‘A’ is 65.
Experiment 2:
(a) For the given Basic salary, compute DA, HRA and PF using the following criteria and find
out the Net Salary of an Employee by deducting PF and IT.
DA = (Basic salary *25)/1000
HRA= (Basic salary * 15)/100
Gross salary = Basic salary + DA + HRA

VFSTR 18
 PF = Gross salary * 10/100
IT= Gross salary * 10/100
Net Salary = Basic Salary + DA + HRA – (PF + IT)
(b) Write a C program to swap the two integers with and without using additional variable.
Example: Before swapping values of a =4, and b = 5 and after swapping a = 5, and b = 4.
Experiment 3:
(a) Write a C program to check whether a given character is a vowel or consonant.
Hint: Read input from the user, and check whether it is an alphabet or not. If it is an
alphabet, then check whether it is a vowel or a consonant. Otherwise display it is not an
alphabet.

(b) The marks obtained by a student in ‘n’ different subjects are given as an input by the
user. Write a program that calculates the average marks of given ‘n subjects and display
the grade. The student gets a grade as per the following rules:

Average Grade
90-100 O
80-89 E
70-79 A
60-69 B
50-59 C
<50 F

Experiment 4:
(a) Write a C program to find HCF and LCM of the given two numbers.
Hint: Highest Common Factor (HCF) is also known as the greatest common divisor
(GCD).
Example: HCF of the 9, 24 is 3, and LCM is 72.
(b) Write a C Program to find the greatest factor of a given input other than itself.
Example: Consider, 30 is the given input, its greatest factor is 15.
Experiment 5:
(a) Write a C program to check whether a given number is an Armstrong number or not.
Hint: An Armstrong number is a number which is equal to the sum of digits raise to the
power total number of digits in the number.
Example: Consider the Armstrong numbers are: 0(01), 1(11), 2(21), 3(31),
153(13+53+33=153), 370(33+73+03), 407(43+03+73), etc.
(b) Write a C Program to print the series of prime numbers in the given range.
Hint: The given number is prime if it is divisible only by one and itself.
Example:if the range is 5 and 15, return 5, 11 and 13 as the series of prime numbers in

VFSTR 19
 I Year I Semester

the given range.

Experiment 6:
(a) Write a C Program to print Floyd triangle for the user given number of rows. If the user
entered 4 rows, then the output follows:
1
23
456
7 8 9 10
(b) Write a C Program to print the * for the given number of times in a rows to form a
diamond shape. For the User Input 5, the output is
*
***
*****
***
*
(c) Write a C Program to print Pascal triangle for the given number of rows. If the user
entered 5 rows, then the output follows:
1
1 1

1 2 1
1 3 3 1
1 4 6 4 1

Experiment 7:
(a) Write a C Program to check whether the given number is a palindrome or not.
Hint: To check whether a number is a palindrome or not, reverse the given number and
compare the reversed number with the given number, if both are same then the number
is palindrome otherwise not.
Example: Given Number = 121, Reversed number = 121. Hence, given number is
palindrome.
(b) Write a C Program to calculate sum of the individual digits for the given number.
Hint: To find the sum of the digits of a given number, use modulus operator (%) to extract
individual digits of a number and keep on adding them.
Example: Given number is 9875. Sum of the given number “9875” is 9+8+7+5 = 29

Experiment 8:
Write a program to search for a given number in the given list of numbers.
Example: Read set of numbers L={2,4,6,1}. Search whether 4 is present in the given list
or not.

Experiment 9:
Write a program to perform the following operations on a given list of elements.
(a) Insert the given element at the beginning of the list and at the end of the list.
Example: The given list is L={1,2,3,8}. Insert ‘0’ at the beginning of the list and at the end

VFSTR 20
 of the list. Hence the resultant list is L={0,1,2,3,8,0}
(b) Delete an element at the beginning of the list and at the end of the list.
Example: The given list is L={1,2,3,8}. Delete an element at the beginning of the list and
at the end of the list. Hence the resultant list is L={2,3}
Experiment 10:
Write a C program to perform the following operations on a list.
(a) Find the maximum or the largest element in a given list.
(b) Find the minimum or the smallest element in a given list.
Hint: Choose one dimensional array data structure.
Experiment 11:
Write a C program for the following:
(a) Calculate and print the sum of the elements in a one dimensional array, keeping in mind
that some of those integers may be quite large.
Input Format:
The first line of the input consists of number of data items in the array.
The next line contains n space-separated integers contained in the array and
print the sum of the elements in the array.
Example:
Enter 4 integers: 1000000001 1000000002 1000000003 1000000004. The sum of the
given list is: 4000000010
(b) Write a program to reverse the given list, of size n.
Example: If the list, L=[1,2,3], after reversing it, the list should be, L=[3,2,1]
Experiment 12:
Write a C program to perform addition, subtraction, multiplication operations on the two
given matrices using functions.
Experiment 13:
Consider the below code segment which allows local and global variables. Find the
local and global variables in this code segment. Write the output of this code segment.
#include<stdio.h>
int i;
void main()
{ int j=60;
i=50;
f(i,j);
printf(“i=%d j=%d “, i,j); }
f(int x, int y)
{ i=100;
x=10;
y=y+i; }
Experiment 14:
(a) Write a C program to compute the factorial of a given number using recursion.
Hint: Factorial is represented using ‘!’ and it is calculated as n! = n*(n-1)*(n-

VFSTR 21
 I Year I Semester

2)*…*3*2*1.As a function factorial(n)=n*factorial(n-1). Note: 0!=1.

(b) Write a C program to swap two numbers using call by value and call by reference.
Experiment 15:
Write a C program that accepts a decimal number and outputs the binary representation
of that number using user defined function.
Hint: Use the available built in functions if necessary.
Example: Enter the decimal number: 5. The binary representation for 5 is: 101

TEXT BOOKS :

1. Behrouz A. Forouzan, Richard F.Gilberg, “Programming for Problem Solving”, 1st edition,
Cengage publications, 2019.
2. Ajay Mittal, “Programming in C - A practical Approach”, 1st edition, Pearson Education,
India, 2010.

REFERENCE BOOKS:
1. Reema Thareja, “Computer Fundamentals and Programming in C”, 1st edition, Oxford
University Press, India, 2013.
2. Herbert Schildt, “C: The Complete Reference”, 4th edition, Tata McGraw-Hill, 2017.
3. Byron S Gottfried, “Programming with C”, 4th edition, Tata McGraw-Hill, 2018.

VFSTR 22
 19CS104 BASICS OF COMPUTERS AND
INTERNET

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
1 - 2 2 158 - 30 5 40 5 8 5 5

source:
https://
images.vexels.com/
media
COURSE DESCRIPTION AND OBJECTIVES:
The objective of this course to give an explosure to the students about components associated
with Computers and Internet. Students will get exposure to building blocks of Computers,
Operating Systems, Application software, Networking, Internet, World Wide Web, Security,
Maintenance of Information Systems.

COURSE OUTCOMES:

Upon completion of the course, student will be able to achieve the following outcomes :

COs Course Outcomes POs

1 Demonstrate the disassembling and assembling of a 1

personal computer system.

2 Install the operating system and other software required in 1,2

a personal computer system.

3 Analyze and visualize the data using various operations 3

in Excel.

4 Identify the various threats to users and data. 4

SKILLS:
Assemble and disassemble the personal computer system. Install different
types of desktop operating systems.

Use the basic text processing software, simple data analysis and data
presentation tools. Configure network parameters.

Secure the personal computer and information from various external threats.

Detection and removal of virus from the system.

VFSTR 23
 I Year I Semester

UNIT - I L- 3
COMPUTING SYSTEMS I : Introduction to computer; Importance of computers; Parts of computer
system- input and output devices.

UNIT - II L- 3
COMPUTING SYSTEMS II : Processors; Storage Devices; Memory Hierarchy; Number systems;
Concepts of OS; Types of operating systems; User interfaces.

UNIT - III L- 3
COMPUTER SOFTWARE: Software-types of software; Programming languages and translators;
Introduction to DBMS.

UNIT - IV L-3
COMPUTER NETWORKS: Networking basics; Types of networks; Network hardware; Network
topologies.

UNIT - V L-3
INTERNET AND SECURITY: Internet and services; World wide web; Using search engine; Domain
name system; Email; The need of computer security; Basic security concepts.

VFSTR 24
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS-30

1. Demonstrate the Personal Computer Peripherals and their functions.
2. Demonstrate the Personal computer assembling procedure.
3. Install different flavors of open source operating systems.
4. Demonstrate Network Interface Card (NIC) configuration and get a report on networking
devices.
5. Demonstrate the following experiments Using Office automation tools.
a. Text formatting and table.
b. Mathematical equations.
c. Preparation of a report in IEEE format.
e. Using Analysis tool.
d. Calculate student mark details.
e. Create four types of charts.
f. Import external data, sort & filter.
g. Using Power Point tool.
h. Create text and images with effects.
i. Two presentations on any topic.
6. Demonstrate the installation of anti-virus software to detect different types of virus
programs.
7. Demonstrate a profile webpage by using Hyper Text Markup Language.

TEXT BOOK :
1. Peter Norton, “Introduction to Computers”, 7th edition, Tata-McGrawHill, 2010.

REFERENCE BOOKS:
1. ITL Education Solution Limited, “Introduction to Computer Science”, 2nd edition, Pearson
Education, 2011.
2. Eric Maiwald, “Fundamentals of Network Security”, 3rd edition, Tata-McGrawHill, 2004.

VFSTR 25
 I Year I Semester

VFSTR 26
 19HS109 ENGINEERING MATHEMATICS II (C)
CALCULUS & NUMERICAL METHODS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 20 45 10 0 5

https://
www.google.co.in/

COURSE DESCRIPTION AND OBJECTIVES:

To provide students with solid foundation in Mathematical fundamentals such as numerical
methods, interpolation, partial differentiation, vector differentiation, Fourier series required for
different branches of engineering.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Demonstrate the technique of numerical methods to 1, 2

the compute integrals.

2 Illustrate the methods of interpolation to find functional values. 1, 2

3 Apply the concepts of partial differentiation in Engineering 1, 2

problems.

4 Illustrate the concepts of gradient, divergence and curl 1, 2

of a given function.

5 Use software tools to obtain and verify the solutions. 5

SKILLS:
Compute maxima and minima of a given function of two variables.

Compute integration by appropriate numerical method.

Determine the fourier and half range fourier series of a given function.

VFSTR 27
 I Year II Semester

UNIT – I L–9
NUMERICAL METHODS – I : Numerical Integration : Trapezoidal rule, Simpson’s 1/3 rule, Simpsons
3/8 rule; Solutions of algebraic and transcendental equations : Introduction, Bisection method,
Iteration method, Newton-Raphson method.

UNIT – II L–9
INTERPOLATION : Introduction, Finite differences, Forward differences, Backward differences,
Newton’s formulae for interpolation, Gauss forward and backward interpolation formulae; Interpolation
with unevenly spaced points, Lagrange’s interpolation formula.

UNIT – III L–9

PARTIAL DIFFERENTIATION AND APPLICATIONS : Partial derivatives, Partial derivatives of higher
order, Homogeneous function, Euler’s theorem, Total differential coefficient.

Maxima and Minima of a function of two variables, Conditions for extreme values, Lagrange method
of undetermined multipliers.

Jacobians - definition, properties, Jacobian of implicit functions.

UNIT – IV L–9
VECTOR DIFFERENTIATION : Review of Vector Algebra (Not for testing); Vector Function, Differentiation,
Scalar and Vector point functions, Gradient, Normal, Directional Derivate, Divergence, Curl, Vector
identities.

UNIT – V L–9
FOURIER SERIES : Periodic Functions, Fourier series, Dirichlet’s conditions, Fourier series for
discontinuous functions, Fourier series for function defined in two or more sub-ranges, Fourier
series for even and odd functions, Half-range series, Change of interval and functions having arbitrary
period.

VFSTR 28
 LABORATORY EXPERIMENTS ACTIVITIES:
o Interprete
interpolation
LIST OF EXPERIMENTS TOTAL HOURS:30 techniques to
estimate the
1. Differentiation of functions of one or two variables.
functional
2. Integration of functions. values.

3. Differential Equations. o Compute

4. Euler’s method. normal to the
surface , angle
5. Runge-Kutta method. between the
surfaces and
6. Lagrange’s interpolation. directional
7. Basic rules of Vector algebra. derivative

8. Gradient of Scalar point function. o Write the fourier

series of a
9. Divergence of Vector point function.
given function.
10. Curl of Vector point function.
11. Fitting suitable Curve for given data.
12. Plotting of graphs for functions of one variable.

TEXT BOOKS:
1. H. K. Dass and Er. Rajanish Verma, “Higher Engineering Mathematics”, 3rd edition, S.
Chand & Co., 2015.
2. B. S. Grewal, “Higher Engineering Mathematics”, 44th edition, Khanna Publishers, 2018.

REFERENCE BOOKS:
1. John Bird, “Higher Engineering Mathematics”, Routledge (Taylor & Francis Group), 2018.
2. Srimanta Pal and Subodh C. Bhunia, “Engineering Mathematics”, Oxford Publications,
2015.
3. B. V. Ramana, “Advanced Engineering Mathematics”, TMH Publishers, 2008.
4. N. P. Bali and K. L. Sai Prasad, “A Textbook of Engineering Mathematics I, II, III”, Universal
Science Press, 2018.
5. T. K.V. Iyengar et al., “Engineering Mathematics, I, II, III”, S. Chand & Co., 2018.

VFSTR 29
 I Year II Semester

VFSTR 30
 19CS106 DISCRETE MATHEMATICAL
STRUCTURES

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - - 3 45 - - 5 5 30 20 5 5

https://
www.thenake
dscientists.com

COURSE DESCRIPTION AND OBJECTIVES:

This course is aimed to improve the logical thinking and problem solving skills. This course
enhances the students ability to reason and to present the argument. Throughout the course,
students will be expected to demonstrate analytical and combinatorial methods such as
propositional logic, set theory, relations, functions, recurrence relations and graph theory etc.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply propositional logic, predicate logic and Boolean functions 1

to express the mathematical properties.

2 Analyze the basic mathematical objects such as sets and 1,2

relations to verify the mathematical properties.

3 Identify the solutions for various problems using recurrence 3

relations.

4 Design and Develop solutions for various combinatorial and 3, 4

Graph based problems.

SKILLS:
Design of logical gates using propositions.

Prove the basic mathematical theorems through direct or indirect proofs.

Solving various types of problems on sets & relations.

Understand some basic Properties of trees, graphs and related discrete

structures.

Solving a problem in recursive manner and estimation of time complexity.

VFSTR 31
 I Year II Semester

UNIT– I L- 9
PROPOSITIONAL LOGIC: Propositional logic - applications of propositional logic, propositional
equivalences; Predicates and quantifiers - nested quantifiers; Rules of inference - introduction to
proofs, proof methods and strategy.

UNIT – II L- 9
SET THEORY: Sets - set operations, Functions - sequences and summations; Cardinality of sets,
Counting - the basics of counting, the pigeonhole principle.

UNIT – III L- 9
RECURRENCE RELATIONS: Applications of recurrence relations - solving linear recurrence relations,
Divide-and-conquer algorithms and recurrence relations; Generating functions; Inclusion–exclusion;
Applications of inclusion–exclusion.

UNIT – IV L- 9
RELATIONS: Relations and their properties - n-ary relations and their applications, representing
relations, closures of relations, cquivalence relations; Partial orderings.

UNIT - V L- 9
GRAPHS: Graphs and graph models - graph terminology, special types of graph, representing,
graphs and graph isomorphism, connectivity; Euler and hamilton paths; Shortest-path problems;
Planar graphs; Graph coloring.

TEXT BOOK:
1. Kenneth H. Rosen, “Discrete Mathematics and Its Applications with Combinatorics and
Graph Theory”, 7th edition, MGH, 2012.

REFERENCE BOOKS:
1. Thomas Koshy, “Discrete Mathematics with Applications”, 1st edition, Elsevier, 2003.
2. Tremblay J. P. and Manohar R., “Discrete Mathematical Structures”, MGH, 1997.
3. Bernand Kolman, Roberty C. Busby and Sharn Cutter Ross, “Discrete Mathematical
Structures”, 2nd edition, Pearson Education/Prentice Hall India, 2013.
4. Garry Haggard, “Discrete Mathematics for Computer science”, 1st edition, Thomson,
2007.
5. J.L. Mott, A. Kandel and T.P. Baker, “Discrete Mathematics for Computer Scientists and
Mathematicians”, 2nd edition, Prentice Hall India, 2009.
6. Grass Man and Trembley, “ Logic and Discrete Mathematics”, 2nd edition, Pearson
Education/Prentice Hall India, 2013.

VFSTR 32
 19HS117 ENGINEERING CHEMISTRY (A)

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
2 - - 2 30 - - - 15 10 - - 05

Source: Koya
Prabhakara Rao. et
al., Chem.
Commun., 2011,47,
Course Description and Objectives : 2330-2332 80

The course aims to cover the importance of Chemistry and its applications in engineering
disciplines among the students by imparting knowledge on the basic concepts of bonding,
water technology, electrochemistry and construction of a battery etc. Besides, it also generates
awareness on some contemporary advanced topics such as nanomaterials and their
characterization using advanced instrumental techniques.

Course Outcomes:

Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply the molecular orbital theory for various types of chemical 1,2
compounds.

2 Analyze the quality of the water and design a suitable water 1,2,3
purification mechanism.

3 Apply the principle of electrochemistry for designing various 2,3,4

batteries and fuel cells.

4 Apply the electromagnetic radiation to the spectroscopic 3,4,5

methods for the analysis of engineering materials.

5 Evaluate the concept of “Nanomaterials” to the applications 2,3

of electronic engineering.

SKILLS:
Analyze the total hardness of water sample.

Construction and working of reference electrodes.

Characterize chemical compound by using UV and IR spectroscopic techniques.

Synthesize nanomaterials like carbon nanotubes, fullerenes.

VFSTR 33
 I Year II Semester

UNIT – I L-6
CHEMICAL BONDING AND WATER TECHNOLOGY:
Chemical Bonding - Crystal field splitting of octahedral and tetrahedral complexes; Molecular orbital
theory of diatomic molecules (O2 and CO), Molecular orbital energy diagram of octahedral complex,
Ex: Hexamine Cobalt (II) complex.

Water Technology - Hardness of water, Determination of hardness by EDTA method and numerical
problems; Softening of water by ion-exchange process.

UNIT - II L-6
ELECTRO CHEMISTRY: Redox reactions, Electrode potential, EMF of an electrochemical cell,
Electrochemical series; Nernst equation; Reference electrodes - standard hydrogen electrode,
calomel electrode; pHmetric and potentiometric titrations.

UNIT – III L-6

BATTERIES: Primary cell and secondary cells, Construction, Working and applications of lead-acid
storage cell, Nickel-cadmium batteries, lithium ion battery; Fuel cells – construction, working and
applications of methanol-oxygen and hydrogen-oxygen fuel cell.

UNIT - IV L-6
INSTRUMENTAL TECHNIQUES:
Electronic Spectroscopy - Beer-Lambert’s law and its derivation, Applications of Beer-Lambert’s
law, instrumentation of UV-visible spectrophotometer.

IR Spectroscopy - Types of vibrations, Instrumentation of IR spectrophotometer and the applications.

UNIT – V L-6
NANO MATERIALS: Introduction, Classification, Properties, Synthesis - top down and bottom up;
Synthesis, Properties & potential applications of carbon nanotubes, Fullerenes and graphene.

EXT BOOKS:
1. Shashi Chawala, “A Text book of Engineering Chemistry Engineering Materials and
Applications”, 3rd edition, Dhanpat Rai Publications, 2015.
2. P.C Jain and Monica Jain, “Engineering Chemistry”, 17th edition, Dhanpat Rai
Publications, 2010.
3. K.S. Maheswaramma and Mridula chugh, “Engineering Chemistry”, 1st edition, Pearson
Publications, 2015.

REFERENCE BOOKS:
1. H. W. Wilard and Demerit, “Instrumental methods of Analysis”, 7th edition, CBS
Publications, 1986.
2. Gurudeep Raj and Chatwal Anand, “Instrumental Methods of Analysis”, 5th edition,
Himalaya Publications, 2007.
3. T. Pradeep, “Nano:The Essentials: Understanding Nanoscience and Nanotechnology”
Tata McGraw-Hill, 2012.
4. Shikha Agarwal, “Engineering Chemistry: Fundamentals and Applications”, 2nd edition,
Cambridge Publications, 2019.

VFSTR 34
 19CS105 PROGRAMMING FOR PROBLEM
SOLVING - II

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 4 5 45 - 60 5 30 5 20 5 5

source :
https://
programskills.
wordpress.com
PREREQUISITE COURSE : Programming for Problem Solving - I
COURSE DESCRIPTION AND OBJECTIVES :
This course is aimed to impart knowledge on advanced concepts of C programming language
and problem solving through programming. It covers strings, pointers, static and dynamic
data structures, and also file manipulations. At the end of this course, students will be able to
design, implement, test and debug complex programs using advanced features.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Design and implementation of string manipulation functions. 3

2 Creation of data structure using dynamic memory and manipulation. 3

3 Creation of text files with different access permissions and 2

manipulations.

4 Application of suitable formatting for I/O data. 1

5 Development of C programs that are understandable, debuggable, 3

maintainable and more likely to work correctly in the first attempt.

SKILLS:
Analysis of the problem to be solved.

Selection of static or dynamic data structures for a given problem and

manipulation of data items.

Application of various file operations effectively in solving real world problems.

Development of C programs that are understandable, debuggable,

maintainable and more likely to work correctly in the first attempt.

VFSTR 35
 I Year II Semester

UNIT - I L-9
STRINGS: Character array, Reading string from the standard input device, Displaying strings on the
standard output device, Importance of terminating a string, Standard string library functions.

UNIT - II L-9
POINTERS: Declaration, Initialization, Multiple indirection, Pointer arithmetic, Relationship between
arrays and pointers, Scaling up - array of arrays, array of pointers, pointer to a pointer and pointer to
an array; Dynamic memory allocation functions.

UNIT - III L-9

STRUCTURES: Defining a structure, Declaring structure variable, Operations on structures, Pointers
to structure - declaring pointer to a structure, accessing structure members using pointer; Array of
structures, Nested structures, Passing structures to functions - passing each member of a structure
as a separate argument, passing structure variable by value, passing structure variable by reference/
address; Typedef and structures.

UNIT - IV L-9
UNIONS: Defining a union - declaring union variable, operations on union; Pointers to union - declaring
pointer to a union, accessing union members using pointer; Array of union, Nested union, Typedef
and union, Enumerations, Bit-fields.

UNIT - V L-9
FILES: Introduction to files, Streams, I/O using streams – opening a stream, closing stream; Character
input, Character output, File position indicator, End of file and errors, Line input and line output,
Formatted I/O, Block input and output, File type, Files and command line arguments.

VFSTR 36
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 60

Experiment 1:
(a) Write a C program to convert the given text into uppercase text.
Hint: Read a line of text character – by – character and store the characters in a char-type
array. Read input characters until end-of-line (EOL) character has been read.
If the character is uppercase ignore it, otherwise convert it into uppercase using the
library function toupper().
Example:
Hello Vignan
HELLO VIGNAN
(b) A C Program contains the following array declaration char text[80]; Suppose the following
string has been assigned to text as “Programming with C is a creative and challenging
activity for engineering graduates”.
Notify the significance of execution of the following command lines in printf():
a) printf(“%s”,text); d) printf(“%18.7s”,text);
b) printf(“%18s”text); e) printf(“%-18.7s”,text);
c) printf(“%.18s”,text);
Experiment 2:
(a) Write a C program to read string using gets() function and print the contents of the string.
(b) Write a C program to copy a given string into another string without using standard
string handling library function strcpy().
Hint: Read one string as an input and then with the help of loop copy the content of given
string into the new string. If the storage space allocated to the new string is less than the
given string, entire string will not be copied into the new string.
Example: Consider storage space allocated to new string is 20 and given string length
is 30. In this case, your program can only copy 20 characters from given string into the
new string.
(c) Write a C program to concatenate two strings without using standard string handling
library function strcat().
Experiment 3:
Write a C program to concatenate the characters of the two given strings alternatively.
Hint: If the length of the two strings is equal then concatenate the two strings alternatively
otherwise concatenate the remaining characters of the higher length string at the end.
Concatenated string is different from the given two strings.
Example: If “hi” and “vignan” are two strings then the concatenated string is “hviignan”.
Experiment 4:
(a) Write a C program to reverse a string without using standard string handling library
function and, do not use another array to store the reversed string.
Hint: If a user enters a string “hello”, then on reversing it will be displayed as “olleh”.

VFSTR 37
 I Year II Semester

(b) Write a C program to find whether the given two strings are same or not.
Hint: User need to enter two strings s1 and s2 and check whether the two strings are
same or not. For example: s1=hello, s2=hello output: YES
Experiment 5:
Write a C program to remove blank spaces in the given string.
Input: Hello world
Output: Helloworld
Hint: Read the input through command line arguments. Removal of spaces should be
performed on the given string itself.
Experiment 6:
Write a C program for the following:
Given a string S consisting of uppercase and lowercase letters, change the case of each
alphabet in this string. That is, all the uppercase letters should be converted to
lowercase and all the lowercase letters should be converted to uppercase.
Input: Vignan University
Output: vIGNAN uNIVERSITY
Experiment 7:
Lilly joined a social networking site to stay in touch with her friends. The signup page
required the input as name and password. However, the password must be strong. The
website considers a password to be strong if it satisfies the following criteria:
a. Its length is at least 6.
b. It contains at least one digit.
c. It contains at least one lowercase/ uppercase English character.
d. It contains at least one special character. The special characters are:
!@#$%^&*()-+
She typed a random string of length n in the password field but wasn’t sure if it was
strong. Given the string she typed, can you find the minimum number of characters she
must add to make her password strong?
Note: Here’s the set of types of characters in a form you can paste in your solution:
Digits = “0123456789”
Lower_case = “abcdefghijklmnopqrstuvwxyz”
upper_case = “ABCDEFGHIJKLMNOPQRSTUVWXYZ”
special_characters = “!@#$%^&*()-+”
Input Format
The first line contains an integer n denoting the length of the string.
The second line contains a string consisting of n characters, the password typed by
Louise.
Each character is either a lowercase/uppercase English alphabet, a digit, or a
special character.
Sample Input 0
3
Ab1

VFSTR 38
 Sample Output 0
Password is not strong:
Length should be more than 6
Sample Input 1
12
#HelloVignan
Sample Output 1
Password is not strong:
Password should consists atleast one numeral
Experiment 8:
Write a C program to insert a given character at the beginning and end of the given
string.
Hint: If the input string is “C program” and the given character to insert is “g”.
Input: “C program”
Output: “gC programg”
Experiment 9:
Write a C Program to find the frequency of occurrence, of a given character in the given
string.
Hint: Read a string and a character to be checked. Then count how many times that the
given character has been repeated in the given string.
Example: The given string is: Chinthu, find the frequency of the occurrence of character
‘h’ in the given string. The frequency of occurrence ‘h’ in the given string is 2.
Experiment 10:
Write a C program to insert a character in a specified location of the given string.
Hint: Traverse the string upto the specified location, move the remaining characters back
by one position and insert the given character at the specified location.
Example: If given string is ‘Vignan, insert a character at 1st location and the given
character is ‘c’. Then the expected output is ‘cVignan’.
Experiment 11:
(a) Write a C program to access the elements of the array using pointers.
Hint: Declare a pointer variable and assign the base address of the array to it and print
the values of an array using pointer variable.
(b) Write a C program to count the number of vowels and consonants in a string using
pointers.
Hint: Use pointers to read the content of string.
(c) Declare a character array to hold the input string and declare a character pointer. Assign
the character array base address to the pointer and then display the every element of the
character array.
Hint: Increment the pointer in loop.

VFSTR 39
 I Year II Semester

Experiment 12:
Create a jagged array (adjacency list representation of a graph) with no of rows and no of
columns in each row as specified by the user
Hint: Use Dynamic memory allocation (malloc() or calloc())
Input:
Enter no of rows: 3
Enter no of columns Row in 1: 3
Enter no of columns Row in 2: 5
Enter no of columns Row in 3: 2
Enter the elements row wise:
865
84697
92
Output:
865
84697
92
Experiment 13:
Write a C program for the following:
Ram wanted to increase his typing speed to participate in programming contests. His
friend suggested that type the sentence “The quick brown fox jumps over the lazy dog”
repeatedly. This sentence is known as a pangram because it contains every letter of the
alphabet.
After typing the sentence several times, Ram became bored with it so he started to look
for other pangrams.
For this task, read a sentence from the user and store it in a character array ‘s’
Hint: Allocate memory for the string using dynamic memory allocation and determine
whether the given string is a pangram or not. Ignore upper or lower cases.
Experiment 14:
Write a C program to implement the following:
Define a structure named ‘Complex’ consisting of two floating point members called
“real and imaginary”. Let c1 and c2 are two Complex structure variables; compute the
sum of two variables.
Experiment 15:
Write a C program for the following:
Customer billing system is a structure, having customers_name, street_address, city,
state, account_number, payment_status(paid/ not_paid), payment_date(current date/
due_date), and amount as members. In this example, payment_date is also structure
includes month, day and year as members. So, every customer record can be
considered as an array of structures. Display the payment status of each customer.
Hint: Use nested structure concept.

VFSTR 40
Experiment 16:
Write a C program to read the contents character by character from the given text file and
display the contents on the standard output device.
Hint: The program makes use of the library functions getc() and putchar() to read and
display the data.
Experiment 17:
Write a C program to find whether the given word is present in the given file or not.
Example: The content of the file is “Computer programming. Computer can do
computations”.
Input: Computer
Output: ‘Computer’ is found at two locations
Experiment 18:
(a) Write a C program to count the number of characters, number of lines and number of
words in a given file.
Hint: Open a text file in read mode and count number of characters, number of lines and
number of words in that file.
(b) Write a C program store the data in a text file.
Hint: Open a text file in write mode and read name, roll no and marks of n number of
students from user and store the above details in the text file.
Experiment 19:
Write a C program to merge two files.
Hint: To merge two files in C programming, first open two files and start copying the
content of the first file into the third file(target file) after this start appending the content of
the second file into the third file (target file).

TEXT BOOKS:
1. Ajay Mittal, “Programming in C - A practical Approach”, 1st edition, Pearson Education
Publishers, India, 2010.
nd
2. Reema Thareja, “Introduction to C Programming”, 2 edition, Oxford University Press
India, 2015.

REFERENCE BOOKS:
1. Behrouz A. Forouzan and Richard F.Gilberg, “Programming for Problem Solving”. 1st
edition, Cengage Publishers, 2019.
2. Byron S Gottfried, “Programming with C”, 4th edition, Tata McGraw-Hill Publishers, 2018.
th
3. Herbert Schildt, “C: The Complete Reference”, 4 edition, Tata McGraw-Hill, 2017.

VFSTR 41
 I Year II Semester

VFSTR 42
 19HS122 ENGLISH PROFICIENCY AND
COMMUNICATION SKILLS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
- - 2 1 - - 30 15 15 - 10 - -

Source:
www.google.com/

COURSE DESCRIPTION AND OBJECTIVES:

The course will provide students an exposure on a wide range of language used in everyday
situations. They will read, analyze, and interpret material from a variety of general topics and
practice reading, writing, listening and speaking skills in English, to use it confidently in their
professional and social contexts.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Read and grasp the content and significance 9,10

of news, articles and reports on a wide range of general topics
connected with their interests.

2 Apply suitable strategies to achieve comprehension, like 9,10

listening for main points; checking comprehension by using
contextual clues etc.

3 Follow lectures or talks on topics within their own field, 9,10

and well structured presentations outside their field.

4 Apply their knowledge of functional English to communicate 9,10

effectively in real life situations and demonstrate good
presentation skills in classroom situations.

SKILLS:
Reading strategies for global meaning and for specific details.

Writing with a purpose.

Listening for drawing inferences.

Speaking fluently with appropriate stress and intonation.

VFSTR 43
 I Year II Semester

UNIT - I P-6
INTRODUCING SELF / OTHERS (SWOT ANALYSIS), EXPRESSING NEEDS/FEELINGS/OPINIONS:

Skill Focus:

· Reading – Understanding factual information.

· Writing – Understanding word order and sentence formation.

· Listening – Decoding for meaning following elements of stress, intonation and accent.

· Speaking – Articulating individual sounds/syllables clearly, speaking fluently with intelligibility.

· Vocabulary – Discerning use of right word suiting the context, Preliminary English Test (PET)
word list.

· Grammar – Spellings, Use of Nouns, Adjectives, Verbs, Prepositions.

Practice: Units 1 – 6 in the Text Book, Objective PET.

UNIT - II P-6
DESCRIBING PEOPLE AND THINGS:

Skill Focus:

· Reading – Drawing inferences from sentences and short messages(True/False statements).

· Writing – Rewording, Sentence transformation, Convincing.

· Listening –Understanding short messages and conversations.

· Speaking – Role-plays, Short conversations.

· Vocabulary / Grammar – Use of Adjectives/Adverbs, Comparatives and Superlatives.

Practice: Units 7 – 12 in the Text Book, Objective PET.

UNIT - III P-6

DESCRIBING PLACES AND PROCESSES, SPATIAL AND TEMPORAL ASPECTS, GIVING DIRECTIONS/
INSTRUCTIONS:

Skill Focus:

· Reading – Reading between the lines, Drawing inferences, True/False.

· Writing –Developing hints, Writing short messages/paragraphs.

· Listening – Searching for factual information, Gap filling.

· Speaking – Snap Talks, JAM, Elocution.

· Vocabulary / Grammar – Prepositions, Phrasal Verbs, PET word list.

Practice: Units 13 – 18 in the Text Book, Objective PET.

VFSTR 44
UNIT - IV P-6
NARRATING, PREDICTING, NEGOTIATING, PLANNING:

Skill Focus:

· Reading – Reading for comprehension, evaluation and appreciation.

· Writing – Letters, E-mails, 7 C’s.

· Listening – Following long conversations / Interviews.

· Speaking – Participating in Group Discussions, Debates, Mini-presentations.

· Vocabulary / Grammar – Modals, Conditionals, Verb forms (Time and Tense).

Practice: Units 19 – 24 in the Text Book, Objective PET.

UNIT - V P-6
REQUESTING, DENYING, SUGGESTING, PERSUADING:

Skill Focus:

· Reading – Understanding factual information.

· Writing – Short stories, Explanatory paragraphs.

· Listening – Inferring information from long speeches/conversations.

· Speaking – Making announcements, Presentations.

· Vocabulary / Grammar - Punctuation, Cloze tests.

Practice: Units 25 – 30 in the Text Book, Objective PET.

TEXT BOOK:
1. Louise Hashemi and Barbara Thomas, “Objective PET”, Student’s Book with answers,
2nd edition, Cambridge University Press, 2015.

REFERENCE BOOK:
1. Annette Capel and Rosemary Nixon, “Introduction to PET”, Oxford University Press, 2009.

VFSTR 45
 I Year II Semester

VFSTR 46
 19HS124 CONSTITUTION OF INDIA

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
1 - - 1 15 - - 2 12 1 2 - -

Source:
www.livemint.com

COURSE DESCRIPTION AND OBJECTIVES:

To provide students with a basic understanding of Indian Polity and Constitution and make
them understand the functioning of government at the centre and state besides local self
government, in order to equip the them with knowledge on fundamental rights and duties of
a citizen in democracy.

COURSE OUTCOMES:
Upon completion of the course, the students will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyze the major articles and provisions of Indian Constitution. 6,8

2 Understand the constitution and its role in safeguarding individual 6,8

rights.

3 Understand the functioning of organs of the State in a democracy. 6,8

4 Understand the relationship between rights and duties of citizens. 6,8

SKILLS
Understanding of the basics of Indian Constitution.

Awareness on fundamental rights, duties and DPSP.

Knowledge of the functioning of various institutions in democracy.

VFSTR 47
 I Year II Semester

UNIT - I L-7
PHILOSOPHY OF INDIAN CONSTITUTION: Meaning of the constitution law and constitutionalism;
Historical perspective of the Constitution of India; Salient features and characteristics of the
Constitution of India.

Scheme of the fundamental rights; Scheme of the fundamental right to equality; Scheme of the
fundamental right to certain freedom under article 19; Scope of the right to life and personal liberty
under article 21; The scheme of the fundamental duties and its legal status; The directive principles
of state policy; Its importance and implementation

UNIT - II L-8
WORKING OF INDIAN CONSTITUTION: Federal structure and distribution of legislative and financial
powers between the union and the states; Parliamentary form of Government in India; The constitution
powers and status of the President of India; emergency provisions: National emergency, President
rule, Financial emergency.

Amendment of the constitutional powers and procedure; The historical perspectives of the
constitutional amendments in India; Local self-government; Constitutional scheme in India

TEXT BOOK:
1. P.M.Bhakshi, “Constitution of India”, 15th edition, Universal Law Publishing, 2018.

REFERENCE BOOK:
1. Subhash Kashyap, “Our Constitution” 2nd edition, National Book Trust, India, 2011.

VFSTR 48
 19ME103 WORKSHOP

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
1 0 2 2 15 - 30 10 20 - - - -

http://
woodtech.weebly.com/
lesson-1—hand-
tools.html
COURSE DESCRIPTION AND OBJECTIVES:
This course deals with different workshop trades and tools and also introduction of CNC
machines. The objective of this course is to provide hands on experience in carpentry, fitting,
tinsmith, black smithy, house wiring and welding.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Identify various tools connected to the carpentry, fitting, tinsmith, 1

black smithy, house wiring and welding.

2 Fabricate different models using workshop trades. 2

3 Develop methodology as per specifications of the product. 2

4 Understand various advance machine tools and its components. 1,3

SKILLS:
Understand the concepts of making various wooden joints for house hold
purpose.

Design and develop various sheet metal products.

Fabricate various agriculture tools by using forging technique.

Create products by using different trades for Industrial applications.

VFSTR 49
 I Year II Semester

ACTIVITIES: UNIT- I L-3

ENGINEERING MATERIALS: Introduction, Classification, Ferrous & non ferrous metals and alloys,
o To make
Physical, Electrical, Optical & Mechanical Properties.
wooden joints
like Mortise
and Tenon UNIT- II L-3
joint, T-lap
Joint which are CARPENTRY: Introduction, Classification of wood, Marking tools, Measuring tools, Holding tools,
used to Cutting tools & supporting tools, Classification of joints, Safety precautions.
prepare a
wooden UNIT- III L-3
furniture.
FITTING: Introduction, Vices, Try square, Files, Hacksaw.
o To prepare TIN SMITHY: Introduction, Metals used in sheet metal work, Classification of tools.
metal joints
and metal
sheet products UNIT- IV L-3
like V-Joint FORGING: Introduction, Tools and equipment used in forging; Smith’s forge or hearth.
and trays by
using mild HOUSE WIRING: Concepts of basic electricity, Single phase and three phase circuits, Knowledge of
steel flats and different electrical wirings-residential, offices, hospitals, godowns.
Galvonised
iron sheets. UNIT- V L-3

o Trials on WELDING: Concepts of welding, Arc welding, Gas welding, Soldering and Brazing.
electrical CNC: Introduction, Components of CNC, Types of CNC systems.
circuit
connections.
LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Fabrication of Mortise and Tenon joint using carpentry tools.
2. Fabrication of T-lap joint using carpentry tools.
3. Fabrication of V-fit using fitting tools.
4. Fabrication of U-fit using fitting tools.
5. Fabrication of truncated cylinder using tin smith tools.
6. Fabrication of square tray using tin smith tools.
7. Forging of S shape using black smith technique.
8. Forging of square to round cross section using black smith technique.
9. Peformance of 1 lamp controlled by one way switch using house wiring.
10. Performance of 2 lamp controlled by one way switch using house wiring.
11. Demonstration of CNC and welding operations.

TEXT BOOKS:
1. S.K Hazra Choudhury, “Elements of Work Shop Technology”, 11th edition, Media
Promoters, 1997.
2. Venkatachalapathy, V.S, “First year Engineering Workshop Practice”, Ramalinga
Publications, 2014.

REFERENCE BOOKS:
1. T.V.Gopal, T.Kumar and G. Murali, “A first Course on Workshop Practice: Theory, Practice
and Work Book”, Suma Publication, 2005.
2. K.V.N.Pakirappa, “Workshop Technology”, Radiant Publishing House, 5th edition, 2011.

VFSTR 50
 19HS123 TECHNICAL ENGLISH
COMMUNICATION

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
2 - 2 3 30 - 30 13 15 - 13 - 6
Source:
www.google.com

COURSE DESCRIPTION AND OBJECTIVES:

The course will introduce students to the specific use of English for Technical Communication.
In this course students will read, analyze, and interpret material from general and technical
fields, and will practice reading, writing, listening and speaking skills on a variety of
contemporary topics.

COURSE OUTCOMES :
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand and interpret a wide range of materials on technology. 9,10

2 Apply a variety of strategies to achieve comprehension, including 9,10

listening for main points; checking comprehension using
contextual clues etc.

3 Apply functional/academic language and grammar to express 9,10

clearly while speaking and make short presentations on
general/technical topics.

4 Apply functional/academic language and grammar to write clearly

on topics related to technology and writing in the workplace. 9,10

SKILLS:
Oral communication skills to make presentations.

Paraphrasing and summarizing skills.

Etiquette in interpersonal communication.

Language competence to work in international environments.

VFSTR 51
 I Year II Semester

UNIT - I L-6
ENVIRONMENTAL CONSCIOUSNESS:
READING: Reading for comprehension (general/technical articles); Reading subskills: predicting,
skimming, scanning, reading for inference; Reading and note making (Reading Texts: 1) Is a Global
Agreement the Only Way to Tackle Climate Change? 2) How to Regain Green Cover 3) Solution to
Plastic Pollution).

Writing: Precis writing; Paraphrasing; Functional grammar [articles, prepositions of time, place,
direction and movement, verb; tense, subject; verb agreement]; Glossary of 25 words from the texts
studied.

Listening: Anupam Mishra; TED Talk on Water Harvesting (LC); Answering comprehension based
Qs; Listening to improve pronunciation

Speaking: Functional English(LC); Introducing oneself; Speaking of likes & dislikes/hobbies;

Speaking of daily/weekly routine; Speaking of past and present habits/ activities/events; Speaking of
future plans.

UNIT - II L-6
SPACE TREK:
READING: Reading for global understanding; Reading for specific information; Guessing meanings
from context; Inter-textual (extrapolative) reading;

Reading Texts: 1) The Hubble Telescope 2) Genesis of ISRO 3) A Home in the Sky

Writing: Writing formal and informal letters; Functional grammar; Modals[Receptive practice of modals
like can, could, will, would, shall, should, may, might, must, ought to, used to; Receptive practice of
modals for habit, advice, ability, permission, obligation and possibility]; Framing questions: Open
ended & Close ended

Listening: Listening to a debate on “Colonising the Moon” (LC); Listening subskills; Listening for
global understanding; Listening for specific information; Note Making

Speaking: (LC) Making mini presentations on general topics; Sharing information about ISRO /
NASA/ Elon Musk

UNIT - III L-6

TRAVEL AND TOURISM:
READING: Reading for specific information; Reading with a focus to learn new words; Reading
critically for the narrative tone; 50 most commonly used collocations; (Reading Texts: 1) Ten Reasons
Why Travel is a Waste of Time 2) Southern Splendour 3) Tourism in India: Role in Conflict and
Peace.)

Writing: Paragraph writing [writing a topic sentence, supporting sentences, effective introductions &
conclusions, cohesive devices]; Stages of writing: planning /organising /writing /editing /rewriting;
Functional grammar [relative pronouns, comparative adjectives, adverbs of time, frequency, place &
manner, speaking of the future/ simple future using will and am/is/are + going to]

Listening: (LC) Listening to a Song; Listening for global meaning; Listening for getting at the nuances
and the mood of the singer.

Speaking: (LC) Telephonic Skills; Participating in an interactive video or telephone talk.

VFSTR 52
UNIT - IV L-6
ENERGY:
READING: Reading for factual information; Reading for extrapolation; Reading for understanding
author’s stance; (Reading Texts: 1) In Search of Our Energy Solution 2) Wind Energy 3) How pertinent
is the nuclear option).

Writing: Current modes of communication; Writing an E-mail; Fax texting; SMS texting for Mobile

Speaking: Group Discussion (LC) – Language functions; initiating a discussion; expressing one’s
opinion; leading a discussion; agreeing/ disagreeing to someone’s view; cutting into a speech;
(G.D Topics: Dumping of nuclear wastes, Exploring eco-friendly energy options, Lifting subsidies on
petrol, diesel, LPG, etc).

Listening: Listening to an Interview (LC) related to the text ; Listening critically for understanding the
attitude/tone of the speaker.

UNIT – V L-6
MEDIA MATTERS:
READING: Reading for factual understanding; Reading for specific information; Reading for inferring
words/phrases from context; Reading for summarizing the main ideas/points in a diagrammatical
form; Reading for extrapolation; Reading Texts: 1) The Evolution of Media 2) The Top Ten Developments
in Journalism in the 2000s 3) Criminal Cases and the Media.

Writing: Drafting a report/proposal (LC); Using graphic tools [tables, pie & bar charts; Writing an
abstract; Leveraging ICT for communication; Preparing a Ppt (LC).

Speaking: Making short presentations [individual/team] with the aid of Ppt (LC); Physical appearance,
body language & voice modulation; Making impromptu presentations

Listening: Listening to a radio program (LC); Watching a movie scene (LC); Subskills: Listening to
understand one’s viewpoint; Listening to understand speaker’s intention; Listening for local
understanding.

VFSTR 53
 I Year II Semester

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Note making while reading a technical/general article.
2. Paraphrasing.
3. Paragraph writing.
4. Note taking while listening to a technical/general talk.
5. Precis writing/Summarising.
6. Preparing an outline for developing a report.
7. Writing a Short Report.
8. Making a Ppt and Mini presentations with the aid of a Ppt.
9. Using Language Functions suiting the context.
10. Team presentations/Group Discussion.
11. Using Collocations.
12. Speaking face to face/on the telephone with appropriate stress and intonation.

TEXT BOOKS:
1. Elango, Ket.al., “Mindscapes: English for Technologists and Engineers”, Orient
Blackswan, 2014.

REFERENCE BOOKS:
1. M. Balasubramanyam, “Business Communication” Vani Educational Books, 1985.
2. T. Balasubramanian, “A Text book of Phonetics for Indian Students”, Orient Longman,
1989.
3. N. Krishnaswamy and Sriraman, T., “Current English for Colleges”, Macmillan India Ltd.
1995.
4. Mohan Krishna and Meera Banerjee, “Developing Communication Skills”, Macmillan
India Ltd.,1990.
5. V.R.Narayanaswamy, “Strengthen your Writing”, Orient Longman, 1979.
7. B. Jean Naterop and Rod Revell., “Telephoning in English”, Cambridge University Press,
1997.

VFSTR 54
II
Y E A R
INFORMATION
TECHNOLOGY

B.Tech. I SEMESTER
 19HS203 - Probability and Statistics
 19CS202 - Data Structures
 19CS204 - Digital Logic Design
 19CS203 - Database Management Systems
 19IT201 - OOPs through JAVA
 19HS204 - Environ mental Studies
 19PC003 - Life Skills - I
 19PC004 - Technical Seminar - I
 19PC005 - Intra-Disciplinary Projects - I
 19PC006 - Physical Fitness, Sports & Games - III

II SEMESTER
 19IT212 - Formal Languages & Automata Theory and
Compiler Design
 19CS214 - Computer Organization & Architecture
 19IT229 - Operating Systems
 19IT211 - Python Programming
 19IT213 - Web Technologies
 19MS304 - Principles of Management & Organizational
Behaviour
 19PC007 - Life Skills - II
 19PC008 - Technical Seminar - II
 19PC009 - Intra-Disciplinary Projects - II

COURSE CONTENTS
I SEM AND II SEM
 19HS203 PROBABILITY AND STATISTICS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 1 - 4 45 15 - 20 45 - 10 - 5

SOURCE: https://
encrypted-
tbn0.gstatic.com/
COURSE DESCRIPTION AND OBJECTIVES:
To provide students with foundation in elementary topics of statistics and probability such
as descriptive statistics, correlation, regression, probability, random variables, distributions,
test of hypothesis required for various engineering applications.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Determine values of various descriptive measures. 2

2 Learn the concept of curve fitting process and apply it in

correlation and regression. 2

3 Appreciate the use of concept of probability in real life situations. 2

4 Apply various probability distributions and their properties to 2

a given situation.

5 Analyse a given hypothesis for acceptance or rejection. 3

SKILLS:
9 Analyse the data using measures of central tendency.

9 Fit an appropriate curve for a given set of data.

9 Test the statistical data for rejection or acceptance.

VFSTR 57
 II Year I Semester

UNIT – I L-9, T-3

DESCRIPTIVE STATISTICS: Basic Definitions, Frequencies, Graphical Representation, Histogram,
Ogive curves; Measures of Central tendency, Arithmetic mean, Median, Mode, Mean deviation, Standard
deviation; Symmetry and Skewness, Karl Pearson’s Coefficient of skewness.

UNIT – II L-9, T-3

CURVE FITTING, CORRELATION, REGRESSION: Least squares method, Curve fitting (straight line,
parabola, exponential curve only).

Covariance; Correlation, Types, Pearson’s Coefficient of correlation, Rank correlation, Spearman’s

rank correlation; Regression, Regression lines.

UNIT – III L-9, T-3

PROBABILITY: Introduction, Definition (Classical and Axiomatic approach), Addition theorem,
Conditional probability, Multiplication theorem, Total probability, Bayes theorem.

UNIT – IV L-9, T-3

RANDOM VARIABLES, DISTRIBUTIONS: Random variables, Discrete and Continuous variables,
Introduction to distributions.

Binomial distribution : Definition, Mean and Standard deviation, Recurrence relation, Applications,
Fitting of binomial distribution.

Poisson Distribution: Definition, Mean and Standard deviation, Recurrence relation, Poisson
Distribution is an approximation of Binomial distribution, Applications, Fitting of Poisson distribution.

Normal Distribution : Definition, Normal curve, Mean and Standard deviation, Median, Mode, Normal
distribution applications.

UNIT – V L-9, T-3

TEST OF HYPOTHESIS: Population and Sampling, Parameters and Statistics, Types of sampling.

Test of hypothesis: Null hypothesis, Errors, Level of significance, Confidence Limits, Testing large
samples, one mean, two means, one proportion, two proportions.

Test of significance: t-distribution for small sample, difference between means of small sample,

Chi square test for goodness of fit, Chi square test for testing of independence of attribites.

TEXT BOOKS:
1. H K Dass and Er. Rajanish Verma, “Higher Engineering Mathematics”, 3rd edition,
S. Chand & Co., 2015.
2. S. C. Gupta and V. K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand &
Sons, 2012.

REFERENCE BOOKS:
1. P. R. Vittal, “Mathematical Statistics”, Margham Publications, Chennai, 2018.
2. Kishore S. Trivedi, “Probability and Statistics with Realiability, Queueing and Computer
Science Applications”, 2nd edition, Wiley Student edition, 2008.
3. A. Singaravelu, “Probability and Statistics”, 22nd edition, Meenakshi Agency, 2015.

VFSTR 58
 19CS202 DATA STRUCTURES

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5
https://
www.udemy.com/
javascript-
datastructures/
PREREQUISITE COURSES: Programming for Problem Solving I & II
COURSE DESCRIPTION AND OBJECTIVES:
This course is aimed at offering fundamental concepts of data structures and explains how to
implement them. It begins with the basic concepts of data, data structures and then introduces
the primitive and non-primitive data structures in detail. It forms the basis for understanding
various ways of representing data and its usage in different computing applications.

COURSE OUTCOMES:

Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the organization of several ADTs and the manipulation 1

(searching, insertion, deletion, traversing) of data stored in various
data structures.

2 Apply different data structures to solve a given problem. 1

3 Analyze the efficiency of using different data structures and choose 2

the efficient data structure for solving a given problem.

4 Develop new algorithms to solve various problems. 3

SKILLS:
9 Analyze the data structure required for various applications.

9 Handling collisions.

9 Implement array or linked list for a given problem.

9 Describe Pros & Cons of each data structure.

9 Usage of trees and graphs.

VFSTR 59
 II Year I Semester

UNIT– I L- 9
DATA STRUCTURES BASICS: Basic terminology - data, information, data type; Data structures-
introduction, storage structures - sequential and linked storage representations; Classification of
data structures; Applications of data structures.

SORTING: Selection sort, Bubble sort, Insertion sort, Quick sort, Merge sort.

SEARCHING: Linear search and binary search.

UNIT – II L- 9
LINKED LISTS: Introduction, Types of linked list -singly linked list, doubly linked list and circular linked
list, representation of linked list, operations of linked list; Traverse forward/ reverse order, searching,
insertion into, deletion from linked lists; Multi lists; Applications of linked lists.

UNIT – III L- 9
STACKS AND QUEUES: Stacks - introduction, array and linked representations, implementation and
their applications; Queues - introduction, array and linked representations, implementation and
their applications;Types - linear, circular and doubly ended queues-operations; Applications of queues.

UNIT – IV L- 9

TREES: Introduction, Properties, Binary tree - introduction, properties, array and linked
representations; Tree traversals and their implementation; Expression trees; BST- definition and
operations; AVL trees - definition and construction of AVL trees; Applications of binary trees.

UNIT - V L- 9

GRAPHS: Introduction, Properties, Graphs representations - adjacency matrix, adjacency list, set
representation; Traversals - breath first search and depth first search; Applications of graphs.

Hashing: Introduction, Different hash functions, Collision-collision avoidance, handling methods.

VFSTR 60
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Write a C program to implement the following sorting methods to arrange a given list of
data items (number of data items >=5000) in ascending/descending order:
a) Selection Sort.
b) Insertion sort.
c) Bubble Sort.
d) Measure the performance of each of the above sorting technique and compare with
their theoretical time complexities.
2. Write a C program to implement the following sorting methods to arrange a given list of
data items( number of data items >=5000) in ascending/ descending order:
a) Quick sort.
b) Merge sort.
c) Measure the performance of each of the above sorting technique and compare with
their theoretical time complexities.
3. Write a C program to implement the following searching techniques on a given list of
data items organized in the form of array:
a) Linear search.
b) Binary search.
c) Analyze the performance of each searching technique and write down your
observations.
4. Write a C program to perform the following operations on Singly Linked List:
a) Create a Singly linked list.
b) Count the number of nodes in SLL.
c) Insertion and Deletion operations at Front, at end and at a given position.
d) Traversal.
e) Search a given element (KEY) in SLL.
5. Write a C program to perform the following operations on Doubly Linked List:
a) Create a Doubly linked list.
b) Count the number of nodes in DLL.
c) Insertion and Deletion operations at Front, at end and at a given position.
d) Traversal.
e) Search a given element (KEY) in DLL.
6. Write a C program to implement the STACK using an array and linked list and perform.
following operations:
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Demonstrate how Stack can be used to check given string is Palindrome
d. Demonstrate Overflow and Underflow situations on Stack

VFSTR 61
 II Year I Semester

7. Write a C program to evaluate POSTFIX expression using STACK.

8. Write a C Program to implement Queue by using an array and linked list and perform
following operations:
a) Enqueue: add element to end of queue.
b) Dequeue: remove element from front of queue.
c) IsEmpty: check if queue is empty.
d) IsFull: Check if queue is full.
9. Write a C Program to implement following operations on Binary Search Tree(BST).
a) Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2.
b) Traverse the BST in In order, Preorder and Post Order.
c)Search a given element (KEY) in BST and report the appropriate message.
10. Write C programs for implementing the following graph traversal techniques:
a)Depth first search traversal.
b)Breadth first search traversal.
c) Measure the time required to perform each traversal operation.

TEXT BOOK:
1. D. Samantha, “Classic Data Structures”, 2nd edition, Eastern Economic Prentice-hall
Private limited Press, 2000.

REFERENCE BOOKS:
1. Ellis Horowitz and Sartaj Sahni,“Fundamentals of Data Structures”, Illustrated edition,
Computer Science Press, 2006.
2. Mark Allen Weiss, “Algorithms, Data Structures, and Problem Solving with C++
Illustrated”, 2nd edition, Addison-Wesley Publishing Company, 2002.
3. R.G. Dromey and Pearson, “How to Solve it by Computer”, 2nd edition, Impression
Education, 1998.

VFSTR 62
 19CS204 DIGITAL LOGIC DESIGN

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - - 3 45 - - 5 5 30 20 5 5

Source:
https://
cdn.sparkfun.com/

COURSE DESCRIPTION AND OBJECTIVES: assets/

This course introduces the basic knowledge on number systems, analysis and design of
combinational and sequential circuits. The course mainly focuses on designing digital circuits
in optimized manner by using components like decoders, encodes, multiplexers. It also
deals with design of sequential circuits and Programmable logic devices.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the basic digital logic fundamentals such as number 1

system, binary codes and complements.

2 Apply Boolean algebra rules and karnaugh map method to reduce 1

the Boolean functions.

3 Design various types of combinational and sequential circuits 3

and improve the performance by reducing the complexities.

4 Analyze and differentiate various types of Programmable Logic 2

Devices.

SKILLS:
9 Design of logical circuits using all types of gates.

9 Minimizing of Boolean functions.

9 Design of simple logical circuits.

9 Design of different types of counters.

VFSTR 63
 II Year I Semester

UNIT– I L- 9
DIGITAL SYSTEMS AND BINARY NUMBERS: Digital systems; Binary numbers; Number base
conversions; Octal and hexa decimal numbers; Complements of numbers; Signed binary numbers;
Binary codes; Boolean algebra - basic definitions; Axiomatic definition of boolean algebra; Basic
theorems and properties of boolean algebra.

UNIT – II L- 9
LOGIC GATES AND GATE-LEVEL MINIMIZATION: Boolean functions; Canonical and standard forms;
Other logic operations; Digital logic gates; The map method - four variable K map; POS and SOP
simplification; Don’t care conditions; NAND and NOR implementation;Other two level
implementations.

UNIT – III L- 9
COMBINATIONAL LOGIC: Introduction - combinational circuits analysis, design procedure; Binary
adder subtractor; Binary increment; Decimal adder; Binary multiplier; Magnitude comparator;
Decoders; Encoders; Multiplexers; De-Multiplexer.

UNIT – IV L- 9
SYNCHRONOUS SEQUENTIAL LOGIC: Sequential circuits; storage elements - latches, flip flops;
Analysis of sequential circuits; Design procedure; Flipflop conversion; Registers; Ripple counters;
Synchronous counters.

UNIT - V L- 9
MEMORY AND PROGRAMMABLE LOGIC: Intraduction; Random access memory; Memory decoding;
Read only memory; Programmable logic array; Programmable array logic.

TEXT BOOK:
1. M Morris Mano and Michael D. Ciletti, “Digital Design”, 5th edition, Pearson Education,
2013.

REFERENCE BOOKS:
1. H Taub and D Schilling, “Digital Integrated Electronics”, 2nd edition, TataMc Graw-Hill,
2004.
2. Z. Kohavi, “Switching and Finite Automata Theory”, 2nd edition, Tata McGraw-Hill, 2008.

VFSTR 64
 19CS203 DATABASE MANAGEMENT
SYSTEMS

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

Source:
https:cdn.sparkfun.com/
assets/

COURSE DESCRIPTION AND OBJECTIVES:

This course presents an introduction to database management systems with an emphasis

on how to organize, maintain and retrieve data efficiently from a relational database. It also
focuses on requirements gathering and conceptual, logical, physical database design. The
objective of the course is to enable the student to understand database design, exprssing
queries using SQL, query optimization and transaction processing.

Course Outcomes:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Develop an E-R model for real life applications. 2,10

2 Design and normalize databases for real time applications. 1, 3

3 Devise queries using Relational Algebra, Relational Calculus 1

and SQL.

4 Evaluate and optimize queries 4

5 Express queries using database tools like Oracle, 5, 10

DB2, MYSQL, Mongo DB.

SKILLS:
9 Understand functional components of the DBMS.

9 Devise queries using Relational Algebra and SQL.

9 Develop E-R model for real life applications.

9 Design of relational databases for real world applications.

9 Evaluate and optimize queries.

9 Understand Transaction Processing, Concurrency control and recovery

techniques.

VFSTR 65
 II Year I Semester

UNIT– I L- 8
DATABASES AND DATABASE USERS: Introduction; Characteristics of the database approach; Actors
on the scene; Advantages of using DBMS approach.
DATABASE SYSTEM CONCEPTS AND ARCHITECTURE: Data models, Schemas and instances; Three-
Schema architecture and data Independence; Database languages and interfaces; The database
system environment; Centralized and Client - Server architectures for DBMS.
CONCEPTUAL DATA MODELING AND DATABASE DESIGN: Entity types, Entity sets, Attributes and
keys; Relationship types, Relationship sets, Roles and structural constraints; Weak entity types;
Relationship types of degree higher than two.
ENHANCED ENTITY RELATIONSHIP (EER) MODEL: Subclasses, Superclasses and inheritance,
Specialization and generalization, Constraints and characteristics of specialization and generalization
hierarchies.

UNIT – II L- 12
RELATIONAL DATABASE DESIGN BY ER- AND EER-TO-RELATIONAL MAPPING: Relational database
design using ER-to-Relational mapping; Mapping EER model constructs to relations.
THE RELATIONAL DATA MODEL AND RELATIONAL DATABASE CONSTRAINTS: Relational model
concepts; Relational model constraints and Relational database schemas. Basic SQL: SQL data
definition and data types; Specifying constraints in SQL, Basic retrieval queries in SQL; INSERT,
DELETE, and UPDATE statements in SQL.
MORE SQL: COMPLEX QUERIES, TRIGGERS, VIEWS: More complex SQL retrieval queries; Specifying
constraints as assertions and actions as triggers; Views (virtual tables) in SQL.
RELATIONAL ALGEBRA : Unary relational operations - SELECT and PROJECT; Relational algebra
operations from set theory; Binary relational operations - JOIN and DIVISION.

UNIT – III L- 9
BASICS OF FUNCTIONAL DEPENDENCIES AND NORMALIZATION FOR RELATIONAL DATABASES:
Informal design guidelines for relation schemas; Functional dependencies-inference rules,
equivalence and minimal cover; Normal forms based on primary keys; Boyce-Codd normal form;
multivalued dependency and 4NF; Join dependencies and 5NF; Properties of relational
decompositions.
QUERY PROCESSING AND OPTIMIZATION: Phases of query processing; Translating SQL Queries
into Relational Algebra and other operators; Query trees and Heuristics for query optimization.

UNIT – IV L- 10
INTRODUCTION TO TRANSACTION PROCESSING CONCEPTS AND THEORY: Introduction to
transaction processing; Transaction and system concepts; Desirable properties of transactions;
Characterizing schedules based on serializability.
CONCURRENCY CONTROL TECHNIQUES: Two-phase locking techniques for concurrency control;
Concurrency control based on timestamp ordering.
DATABASE RECOVERY TECHNIQUES: Recovery concepts; Shadow paging; The ARIES recovery
algorithm.

UNIT - V L- 6
INDEXING STRUCTURES FOR FILES AND PHYSICAL DATABASE DESIGN: Single level and multi level
indexing; Dynamic multi level indexing using B trees and B+ trees.
NOSQL DATABASES AND BIG DATA STORAGE SYSTEMS: Introduction to NoSQL systems; Document-
based NoSQL systems and MongoDB.

VFSTR 66
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Design Conceptual database schema using ER Modeling Software Tools.
2. Development of Relational Database schemas for Company/Student/Sailors/ using
DDL constructs of SQL.
3. Specifying various DML Commands such as select, insert, update etc. of SQL on
Relational Database.
4. Specifying various DCL and TCL constructs of SQL on Relational Database.
5. Development of Relational Database schemas by specifying different types of
Constraints
6. Specifying queries using Relational Database operators (Arithmetic, Logical &
comparison) and string matching constructs of SQL.
7. Expressing queries using Aggregate Functions of SQL on Relational Database.
8. Queries on Relational Database using GROUP BY, HAVING and ORDER BY clauses
of SQL.
9. Design and Development of company database and expressing Nested queries using
SQL.
10. Design and Development of sailors database and specifying queries using different
types of JOINs.
11. Creation and dropping of VIEWS.
12. Implementation of PL/SQL programs with Control Structures.
13. Implementation of PL/SQL programs with Procedures.
14. Implementation of PL/SQL programs with Function.
15. Implementation of PL/SQL programs with Triggers.

TEXT BOOK:
1. Ramez, Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”,
7th edition, Pearson Education, 2016.

REFERENCE BOOKS:
1. Raghu Rama Krishnan and Johannes Gehrke, “Database Management Systems”,
3rd edition, Tata McGraw Hill, 2013.
2. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, “Database System Concepts”,
6th edition, Tata McGraw Hill, 2010.

VFSTR 67
 II Year I Semester

VFSTR 68
 19IT201 OBJECT ORIENTED PRGRAMMING
THROUGH JAVA

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 4 5 45 - 60 5 30 5 20 5 5

SOURCE:
https:/
cdncontribute.
PRE REQUISITE COURSES: Programming for Problem Solving, Data Structures geeksforgeeks.
org wp-content/
COURSE DESCRIPTION AND OBJECTIVES: uploads
OOPs Concepts.jpg
This course deals with the fundamentals of Object Oriented Programming (OOP) Concepts
and OOP based software development methodology. Java as a class-based and pure OOP
language is used to demonstrate and implement appropriate concepts and techniques. The
students are exposed to the concepts, fundamental syntax, and the thought processes behind
object oriented programming. By the end of course, students will acquire the basic knowledge
and skills necessary to implement object oriented programming techniques through Java in
software development.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Define, understand, differentiate the Object Oriented concepts 1

and Java Programming concepts.

2 Apply Object Oriented concepts on real time scenarios. 2

3 Use Exception handling and Multithreading mechanisms to 3

create efficient software applications.

4 Utilize modern tools and collection framework to create Java 5

applications to solve real world problems.

5 Design and develop GUI based applications using applets and 4

swings for internet and system based applications.

SKILLS:
9 Analyze and develop algorithms for real life problems using Java.

9 Experience with developing and debugging programs in different IDEs.

9 Develope Multithreaded applications.

9 Create web applications.

VFSTR 69
 II Year I Semester

UNIT– I L- 9

INTRODUCTION: History of Java, Byte code, JVM, Java buzzwords, OOP Principles, Data types,
Variables, Scope and life time of variables, Operators, Control statements, Type conversion and
casting, Arrays.

Concepts of classes and objects, Introducing methods, Method overloading, Constructors,

Constructor overloading, Usage of static with data and methods, Access control, This key word,
Garbage collection, String class.

UNIT – II L- 9

INHERITANCE, PACKAGES AND INTERFACES : Inheritance basics, Types of inheritance, Member

access rules, Usage of super key word, Method overriding, Usage of final, Abstract classes, Defining
an interface, Differences between abstract classes and interfaces, Implementing interface, Applying
interfaces, Variables in interface and extending interfaces; Defining, creating and accessing a Package,
Importing packages, Access control in packages.

UNIT – III L- 9

EXCEPTION HANDLING&MULTITHREADING: Concepts of exception handling, Types of exceptions,

Usage of Try, Catch, Throw, Throws and Finally Keywords, Built-in exceptions, Creating user defined
exception; Concepts of multithreading, Differences between process and thread, Thread life cycle,
Creating multiple threads using thread class and runnable interface, Synchronization, Thread priorities,
Inter thread communication.

UNIT – IV L- 9

COLLECTION FRAMEWORK : Collections overview, Collection interfaces - list, set, collection classes
- array list, linked list, hash set, treeset, accessing a collection via an iterator, The legacy classes
and interfaces- Dictionary, Hashtable, StringTokenizer.

UNIT - V L-9

GUI PROGRAMMING WITH SWING: Applet Class, Applet skeleton, Simple Applet; The Delegation
event model - Events, Event sources, Event Listeners; Event classes, Handling mouse and keyboard
events.

Exploring Swing Controls- JLabel and Image Icon, JText Field, JButton, JCheckBox, JRadioButton,
JTabbed Pane, JList, JCombo Box.

VFSTR 70
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 60

Exercise-1
BASIC PROGRAMS :
a. Write a Java program to print “Welcome”.
b. Write a java program to read the different types of data from the user and display that
data using Scanner class.
c. Write a java program to read the different types of data from the user and display that
data using command line arguments.
d. Write a Java program to illustrate type conversions.
e. Write a java program to observe the effects of various bitwise operators.
Exercise-2
DECISION MAKING STATEMENTS:
a. Write a Java program to find the largest number out of 3 numbers using nested if.
b. Raju’s parents are celebrating their marriage anniversary. They have arranged a small
party tonight. They are expecting their colleagues and Raju’s friends to attend the party.
They have planned to serve ‘Coke’ and ‘Badam Milk’ to these guests. But they would like to
serve ‘Badam Milk’ to teenagers and ‘Coke’ to adults. Please help them in finding teenagers
and adults based on age. Write a Java program to find out the adults and teenagers based
on their age.
Note: Teenagers are those whose age is between 13 and 19 (both inclusive).
Step by Step guide
Read the age as input from the user
Check the age with the conditions mentioned
Display the appropriate messages (Eg: Adult or Teenager) and also a messageregarding the
drink (Eg: Badam Milk or Coke)
c. There is a telecommunication company called “PoweredAir” who have approached you
to build their Interactive Voice Response (IVR) system. You should write a Java program
and be able to provide the following menu (given below):
Note: User should provide an input for each menu display. Welcome to Powered Air Service. What
would you like to do?
Know my balance
Know my validity date
Know number of free calls available
More
Prepaid Bill Request
Customer Preferences
GPRS activation
Special Message Offers
Special GPRS Offers
3G Activation
Go back to Previous menu

VFSTR 71
 II Year I Semester

If user types in 7 the first menu should be displayed. You are free to display your own
messages in this IVR
Exercise-3
LOOPING STATEMENTS:
a. Write a Java program that prompts the user for an integer and then prints out all prime
numbers up to that integer.
b. Write a java program to find the sum of even numbers upto 100.
c. Write a java program to print the following output.
1
23
456
7 8 9 10

d. Write a program in Java to print the Floyd’s Triangle.

1
01
101
0101
10101
e. Write a Java program to print Fibonacci series using for loop.
f. Write a Java program to check whether given number is Armstrong or not using while loop.

Exercise-4
ARRAYS:
a. Write a Java program to read 10 numbers from user and store it
in a array. Display the maximum and minimum number in the array.
b. Write a java program to sort the given list of elements in an array.
c. Write a Java program to search a given element in the array.
d. Write a Java program to calculate multiplication of 2 matrices.

Exercise-5
STRINGS:
a. Write a java program to check weather given string is palindrome or not.
b. Write a Java Program that reads a line of integers, and then displays each integer, and
the sum of all the integers (use StringTokenizer class)
c. Write a Java program for sorting a given list of names in ascending order.
d. Write a Java program that displays the number of characters, lines and words in a text
file.
Exercise-6

VFSTR 72
CLASS, OBJECTS AND METHODS:
a. Create a class Rectangle. The class has attributes length and width. It should have
methods that calculate the perimeter and area of the rectangle. It should have read
Attributes method to read length and width from user.
Hint: Area of rectangle = length * widthPerimeter of rectangle = 2*(length+width)
b. Design a class “Company” which has as attributes yearOfEstablishment,
annualTurnover, annualSales, etc., Moreover, these details need to be available to the
outside world. Have appropriate methods for displaying these details. You will also need
to calculate the profitability of this company (if annualTurnover/annualSales > 1 then
profitability is high; <0.5 then profitability is low; between 0.5 and 1 then profitability is
medium).
c. Write a java program that implements method overloading.
Exercise-7
INHERITANCE, POLYMORHISM AND INTERFACES:
a. Write a java program to implement various types of inheritance.
i. Single ii. Multi-Level iii. Hierarchical iv. Hybrid
b. Create an abstract class Media (id, description). Derive classes Book (pagecount) and
CD (playtime). Define parameterized constructors. Create one object of Book and CD
each and display the details.
c. Write a java program to implement runtime polymorphism
d. Define an interface, operations which has method area(), volume(). Define a constant PI
having value 3.14. Create class a Cylinder which implements this interface (member-id,
height). Create one object and calculate area and volume.

Exercise-8
PACKAGES:
Write a java program to implement the following
a. Creation of simple package
b. Accessing a package
Exercise-9
EXCEPTION HANDLING:
a. Write a java program which accepts withdraw amount from the user and throws an
exception “In Sufficient Funds” when withdraw amount more than available amount.
b. Write a java program to illustrate finally block.
Exercise-10
THREADS:
a. Write a java program to create three threads and that displays “good morning”, for every
one second,”hello” for every 2 seconds and “welcome” for every 3 seconds by using
extending Thread class.
b. Write a Java program that creates three threads. First thread displays “OOPS”, the
second thread displays “Through” and the third thread Displays “JAVA” by using
Runnable interface.

VFSTR 73
 II Year I Semester

Exercise -11
COLLECTIONS:
a. Write a Java program to create a new array list, add some colors (string) and print out the
collection
b. Write a Java program to shuffle elements in a array list
c. Write a Java program to iterate through all elements in a linked list
d. Write a Java program to iterate through all elements in a hash list
e. Write a Java program to create a new tree set, add some colors (string) and print out the
tree set
Exercise-12
EVENT HANDLING:
a. Implement a Java program for handling mouse events when the mouse entered, exited,
clicked, pressed, released, dragged and moved in the client area.
b. Implement a Java program for handling key events when the key board is pressed, re
leased, typed.
Exercise-13
APPLETS AND SWINGS:
a. Develop an Applet program to accept two numbers from user and output the sum,
difference in the respective text boxes.
b. Write a java swing program that reads two numbers from two separate text fields and
display sum of two numbers in third text field when button “add” is pressed.
c. Write a JAVA program to design student registration form using Swing Controls. The form
which having the following fields and button SAVE
Form Fields are: Name, RNO, Mailid, Gender, Branch ,Address

TEXT BOOK:
1. Herbert Schildt, “Java The Complete Reference”, 9th edition, McGraw Hill
Education (India) Pvt. Ltd., 2014.

REFERENCE BOOKS:
1. P. Radha Krishna, “Object Oriented Programming Through Java”, 1st edition, Universities
Press, 2007.
2. R. A. Johnson, “Java Programming and Object Oriented Application Development”,
1st edition, Cengage Learning, 2006.

VFSTR 74
 19HS204 ENVIRONMENTAL STUDIES

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
1 - - 1 15 - - 10 15 5 - - 5

Source:
https://
stock.adobe.com/uk/
COURSE DESCRIPTION AND OBJECTIVES:
This is a multidisciplinary course which deals with different aspects using a holistic approach.
The major objective of the course is to plan appropriate strategies for addressing
environmental issues. The course also brings awareness of nature and judicious use of
natural resources for long term sustenance of life on this planet. The course also enables
the students to understand their responsibility required to react effectively to natural, man-
made and technological disasters.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the importance of environment and natural resources. 6,7

2 Gain the concept on protection of biodiversity and maintain healthy

environment. 7,8

3 Analyze the sources of pollutants and their effects on atmosphere. 4,8

4 Identify the evidence of global warming, ozone depletion and 7

acid rain.

5 Develop a basic understanding of prevention, mitigation, 7,8

preparedness, response and recovery.

SKILLS:
9 Acquire fieldwork techniques to study, observe and prepare documents, charts,
PPTs, Models etc.

9 Understand how natural resources should be used judiciously, to protect

biodiversity and maintain ecosystem.

VFSTR 75
 II Year I Semester

ACTIVITIES: UNIT - I L-3

o Painting INTRODUCTION TO ENVIRONMENTAL STUDIES AND NATURAL RESOURCES

contests on
Environmental Studies: Multidisciplinary nature of environmental studies - definition, scope and its
environmental
importance; Concept of sustainability and sustainable development; Natural resources: Deforestation-
issues and
causes and impacts; Water resources-use and over exploitation of surface and ground water, Conflicts
themes.
over water; Heating of earth and circulation of air; Air mass formation and precipitation; Energy
o Models of resources-renewable and non-renewable energy sources; Land resources-soil erosion and
energy desertification.
resources,
Pollution and
UNIT - II L-3
Solid Waste
Management- ECOSYSTEMS AND BIODIVERSITY
3R strategy.
Ecosystem: Structure and functions of an ecosystem; Energy flow - food chains, food webs and
ecological succession; Forest, Grassland, Desert and Aquatic ecosystems (ponds, rivers, lakes,
streams, ocean, estuary).

Biodiversity: Genetic, species and ecosystem diversity; Biogeography zones of India; Biodiversity
patterns and global biodiversity; India as a mega diversity; Endangered and endemic species of
India;Hotspots of biodiversity; Threats to biodiversity; Conservation of biodiversity.

UNIT - III L-3

ENVIRONMENTAL POLLUTION

Pollution: Air, Water, Soil, Chemical and Noise pollution; Nuclear hazards and human health risks;
Solid waste Management, Control measures of urban and industrial wastes; Pollution case studies.

UNIT - IV L-3
ENVIRONMENTAL POLICIES AND PRACTICES: Climate change, Global warming, Acid rain, Ozone
layer depletion and impacts on human communities and agriculture; Environmental laws - Wildlife
protection act, Water (pollution prevention and control) act, Forest conservation act, Air (pollution
prevention and control) act, Environmental protection act; Tribal populations and rights; EIA -
introduction, definition of EIA; EIS - scope and objectives.

UNIT - V L-3
HUMAN COMMUNITIES AND THE ENVIRONMENT:

Human population growth: Impacts on environment, human health and welfare; Resettlement and
Rehabilitation of project affected persons: Case Studies; Disaster management - floods, earthquake,
landslides and cyclones; Environmental communication and public awareness, Case studies (C.N.G
Vehicles in Delhi).

Field work/Environmental Visit: Visit to a local area to document environmental assets–river/ forest
/ grassland / hill /mountain; Visit to a local polluted site; Study of local environment - common plants,
insects, birds; Study of simple ecosystems – pond, river, hill slopes; Visit to industries/ water
treatment plants/effluent treatment plants.

VFSTR 76
TEXTBOOKS:
1. A. Kaushik and C. P. Kaushik, “Perspectives in Environmental Studies”, 5th edition, New
Age International Publishers, 2016.
2. Y. Anjaneyulu, “Introduction to Environmental Science”, B. S. Publications, 2015.
3. B. Joseph, “Environmental Studies”, 2nd edition, Mc Graw Hill Education, 2015.
4. S. Subash Chandra, “Environmental Science”, New Central Book Agency, 2011.

REFERENCE BOOKS:
1. Mahua Basu and S.Xavier, “Fundamentals of Environmental Studies”, Cambridge
University Press, 2016.
2. K. Mukkanti, “A Textbook of Environmental Studies”, S. Chand & Company Ltd., 2009.
3. M. Anji Reddy, “A Textbook of Environmental Science and Technology”, B. S. Publications,
2008.
4. K. Joseph and R. Nagendram, “Essentials of Environmental Studies”, Pearson
Education Pvt. Ltd., 2007.
5. M. Chandrasekhar, “A Textbook of Environmental Studies”, Hi-tech Publications, 2006.
6. C. S. Rao, “Environmental Pollution Control Engineering”, New Age International
Publishers, 2001.

VFSTR 77
 II Year I Semester

VFSTR 78
 19PC005 INTRA-DISCIPLINARY PROJECTS-I

Hours Per Week : Total Hours :

L T P C L T P
0 0 2 1 - - 30

Source:
https:cdn.sparkfun.com/
assets/
DESCRIPTION AND OBJECTIVES:
These projects arise from a combination of courses. The major objective of these projects is
to enable students understand the relationship between the courses.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Map different courses to gain the knowledge of 1

intra-disciplinary engineering.

2 Function effectively as an individual and as a member or 9

leader in diverse teams.

3 Comprehend and write effective reports and make effective 10

presentations.

LIST OF INTRA-DISCIPLINARY PROJECTS

z Car pooling system.
(Combination of courses: OOPs through Java and Data Base Management System).
z Travel and Tourism Management.
(Combination of courses: OOPs through Java and Data Base Management System).
z Booking Photography.
(Combination of courses: OOPs through Java and Data Base Management System).
z E-Farming.
(Combination of courses: OOPs through Java and Data Base Management System).
z E-Learning.
(Combination of courses: OOPs through Java and Data Base Management System).
z Online submission of Assignments and Materials uploading.
(Combination of courses: OOPs through Java and Data Base Management System).
z Farmers Buddy.
(Combination of courses: OOPs through Java and Data Base Management System).
z City Life.
(Combination of courses: OOPs through Java and Data Base Management System).
z National Parks of India.
(Combination of courses: OOPs through Java and Data Base Management System).

VFSTR 79
 II Year I Semester

z Online Counseling System.

(Combination of courses: OOPs through Java and Data Base Management System).
z Mobile service provider operations portal.
(Combination of courses: OOPs through Java and Data Base Management System).
z Inventory Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Patient Tracker.
(Combination of courses: OOPs through Java and Data Base Management System).
z Employee Attendance System by Barcode Scanner.
(Combination of courses: OOPs through Java and Data Base Management System).
z Bike Store and Blog.
(Combination of courses: OOPs through Java and Data Base Management System).
z Online Loan Application and Verification.
(Combination of courses. OOPs through Java and Data Base Management System).
z Car Sales and Inventory Store.
(Combination of courses: OOPs through Java and Data Base Management System).
z Question Paper Generation.
(Combination of courses. OOPs through Java and Data Base Management System).
z Build an application for University Information System.
(Combination of courses. OOPs through Java and Data Base Management System).
z Build an application for Library Information System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an e-commerce Application to Buy and Sell The Products.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Hospital Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Time Table Generation System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Faculty Invigilation Schedule System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Faculty Leave Information system.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Employee Salary Calculation.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an Application for Students Academics Information System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Medical Stock Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Student Complaint Management system.
(Combination of courses: OOPs through Java and Data Base Management System).
z Student Attendance Management system.
(Combination of courses: OOPs through Java and Data Base Management System).
z Modern Municipal Corporation.
(Combination of courses: OOPs through Java and Data Base Management System).
z Hotel Management Systems.
(Combination of courses: OOPs through Java and Data Base Management System).
z Event Management System.
(Combination of courses: OOPs through Java and Data Base Management System).

VFSTR 80
z Exam Registration System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Application to Process Credit Card.
(Combination of courses: OOPs through Java and Data Base Management System).
z BPO Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Conference Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build a Java application to perform e-Ticketing.
(Combination of courses: OOPs through Java and Data Base Management System).
z Online Recruitment System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Build an application for student information system.
(Combination of courses: OOPs through Java and Data Base Management System).
z e-Book Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Software Personnel Management System.
(Combination of courses:OOPs through Java and Data Base Management System).
z Citizen Card System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Free Courier Management.
(Combination of courses: OOPs through Java and Data Base Management System).
z Free Dairy Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Apartment Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Blood Bank Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Insurance Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Human Resource Management.
(Combination of courses: OOPs through Java and Data Base Management System).
z Bus Prediction System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Hostel Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Pre-Intimation of Birthdays(Students).
(Combination of courses: OOPs through Java and Data Base Management System).
z Online Marks Allocation.
(Combination of courses: OOPs through Java and Data Base Management System).
z Plantation Management System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Equipement Maintance System.
(Combination of courses: OOPs through Java and Data Base Management System).
z Student Feedback System.
(Combination of courses: OOPs through Java and Data Base Management System).

NOTE: The afore - mentioned list is not exhaustive and the objective is to provide an idea of some
of the projects that can be executed by students arising from a combination of courses.
Students are given full flexibility to choose any projects of their choice under the supervision
of faculty Mentors.

VFSTR 81
 II Year I Semester

VFSTR 82
 19IT212 FORMAL LANGUAGES &
AUTOMATA THEORY AND
COMPILER DESIGN
Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - - 3 45 - - 5 5 30 20 5 5

source:
https://en.
PREREQUISITE COURSES: Data Structures; Discrete Mathematical Structures wikipedia.org/wiki
Chomsky_hierarchy
COURSE DESCRIPTION AND OBJECTIVES:

This course introduces the concepts of design Deterministic finite Automata, Non-
Deterministic finite Automata, lexical analyzer, parser, code generation and code optimization
techniques. The objective of this course is to enable the student to acquire the knowledge of
various automata’s and various phases of compiler.

COURSE OUTCOMES:

Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply different finite state machines for solving a given language. 1

2 Understand the different phases of compiler with various examples. 1

3 Apply different Parsing and optimization techniques in the 1,5

design of compiler.

4 Analyze and compare various translators to select optimum. 1,2

5 Design a compiler for simple programming languages. 2,5,8,9,10

SKILLS:
9 Design automata, regular expressions and context free grammars for accepting or

generating a certain language.

9 Transform between equivalent deterministic and non-deterministic finite automata,

and regular expressions.

9 Design various parsers using top-down and bottom-up approaches.

9 Construction of automata for regular expressions.

9 Analyze recognizer for programming language.

9 Usage of generators like LEX and YACC.

VFSTR 83
 II Year II Semester

UNIT– I L-9

INTRODUCTION: Alphabets, Strings and languages, Automata and grammars, Regular languages,
Deterministic finite automata (DFA)-formal definition, simplified notation, state transition graph,
transition table, language of DFA; Nondeterministic finite Automata (NFA), NFA with epsilon transition,
Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata.

REGULAR EXPRESSION: Definition, Algebraic laws for regular expressions, Operators of regular
expression and their precedence,

UNIT– II L-9

INTRODUCTION TO COMPILING: Compilers, Analysis of the source program, Cousins of the compiler,
Phases of compiler, Grouping of phases, compiler construction tools, Role of Lexical analysis,
Specifications of Tokens, Lexical analyzer generator –LEX tool.

UNIT– III L-9

SYNTAX ANALYSIS: The Role of the parser and Context-free grammars. Top-Down parsing- Recursive
Descent parsing, Predictive parsing, Bottom-Up parsing, Shift-Reduce parsing and Operator-
precedence parsing; LR Parsers, SLR parser, CLR parser, and LALR Parser; YACC automatic
parser generator.

UNIT– IV L-9

SEMANTIC ANALYSIS: Intermediate forms of source programs – abstract syntax tree, Polish notation
and three address codes; Attributed grammars, Syntax directed translation, Conversion of popular
Programming languages, Constructs into Intermediate code forms, Declarations, Assignment,
Statements, Boolean expressions.

UNIT– V L-9

CODE OPTIMIZATION: Basic blocks and flow graphs, The Principal sources of optimization,
Optimization of basic blocks, Introduction to global data flow analysis, Global optimization.

Code Generation: Issues in the design of code generator, The target machine, A simple Code
generator, DAG representation of basic blocks, Peephole optimization.

TEXT BOOKS:
1. Hopcroft and Ullman, “Introduction to Automata Theory, Languages and Computation”,
2nd edition, Pearson/Prentice Hall India, 2007.
2. Aho, Ullman and Ravisethi, “Compilers Principles, Techniques and Tools”, 2nd edition,
Pearson Education, 2014.
3. Sipser, “Introduction to Theory of computation”, 2nd edition, Thomson, 2016.

REFERENCE BOOKS:
1. Andrew W. Appel, “Modern Compiler Construction in C” , 1st edition, Cambridge
University Press, 2004.
2. Anand Sharma, “Theory of automata and formal languages”, 2nd edition,Laxmi
Publications, 2015.

VFSTR 84
 19CS214 COMPUTER ORGANIZATION
AND ARCHITECTURE

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - - 3 45 - - 5 5 30 20 5 5

Source:
https://
naoreenchowdhury.files.
PREREQUISITE COURSE: Digital Logic Design. Wordpress.com/

COURSE DESCRIPTION AND OBJECTIVES:

This course covers the basics of modern Computer Organization and Architecture. The
emphasis is on understanding the design of computer and its components. The student will
learn the concepts of data representation, micro operations, memory organizations and input
output organization. Case study of 8086 helps the students to visualise the basic concepts of
the course.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Distinguish computer organization and computer architecture; 2

structure and function of computer components; Understand the
instruction execution cycle, Understand 8086 architecture.

2 Design and develop different digital circuits required to perform the 3

micro operations.

3 Design interface circuits for memory and peripheral, DMA and 3

communication devices. Compare various modes of data transfer.

4 Develop solutions using assembly level language. 3,4

5 Evaluate the performance of processor and memory in terms of 2

speed, size and cost.

SKILLS:
9 Learn different data representations.

9 Design digital circuitry for implementing different operations.

9 Identify the types of memories and their uses.

9 Study various data transfer mechanisms in digital computer and I/O.

VFSTR 85
 II Year II Semester

UNIT– I L- 9
INTRODUCTION, RTL & DATA REPRESENTATIONS: Introduction- organization and architecture,
Structure and function; RTL - Register transfer language, Register transfer, Bus and memory transfers;
Data representations - fixed point representation and floating point representation; Overflow.

UNIT – II L- 9
MICRO OPERATIONS: Arithmetic micro operations; Logic micro operations; Shift micro operations;
Arithmetic logic shift unit.

CASE STUDY: Register organization of 8086; Architecture of 8086.

UNIT – III L-9

BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes; Computer registers; Computer
instructions; Instruction cycle; Memory reference instructions; Register reference instructions, Input-
output; Interrupt.

CASE STUDY: Addressing modes of 8086, Instruction set of 8086.

UNIT – IV L- 9
MEMORY ORGANIZATION: Memory hierarchy; Main memory; Associative memory; Cache memory;
Virtual memory.

CASE STUDY: Interfacing semiconductor memory with 8086.

UNIT - V L- 9
INPUT- OUTPUT ORGANIZATION: Peripheral devices; Input-output interface; Asynchronous data
transfer; Modes of transfer; Priority interrupt; Direct memory access.

CASE STUDY: Interfaces- (8251) USART, (8257) DMA Controller, (8255) programmable peripheral
interface.

TEXT BOOKS:
1. M.Moris Mano, “Computer Systems Architecture”, 3rd edition, Pearson/Prentice Hall
India, 2007.
2. William Stallings, “Computer Organization and Architecture”, 6th edition, Pearson/Prentice
Hall India, 2007
3. A. K.Ray and K. M. Burchandi, “Advanced micro processor and peripherals-TMH”, 3rd
edition, 2000.

REFERENCE BOOKS:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, “Computer Organization”, 5th edition,
Tata McGraw Hill, 2007.
2. Vincent P. Heuring and Harry F Jordan, “Computer Systems Design and Architecture”,
2nd edition, Pearson/Prentice Hall India, 2004.
3. David A Patterso and John L Hennessy, “Computer Organization and Design - The
Hardware/ Software Interface, ARM edition”, 5th edition, Elsevier, 2009.

VFSTR 86
 19IT219 OPERATING SYSTEMS

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source:
https://
www.proprofs.com/
PREREQUISITE COURSE: Data Structures

COURSE DESCRIPTION AND OBJECTIVES:

This course aims at imparting concepts and principles of Operating Systems. The course
impart overall responsibility in acting as an interface between the system’s hardware
components and the user. Further, it also helps students to understand the different scheduling
policies, process synchronization mechanisms, deadlock handling mechanisms and
memory management techniques.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand, classify the basic concepts of operating system and -

Real time operating system.

2 Apply the concepts of process scheduling algorithms and 1

process synchronization techniques to derive the efficiency
of resource utilization .

3 Analyze the requirements for attempting operating systems 2

principles.

4 Design the various memory management schemes for a given 3

scenario.

5 Simulate the operating systems principles using simulation 5

tools and programming in Unix.

SKILLS:
9 Install/ remove an operating system in a computer.

9 Manage open source operating systems like Ubuntu, Fedora etc.

9 Understand the concepts of Processes scheduling and File Systems.

9 Analyze the various algorithms used for Memory management.

9 Identification of different disk scheduling methodologies.

VFSTR 87
 II Year II Semester

UNIT– I L- 9
INTRODUCTION: What Operating System do; Operating System structure; Process concept - overview,
process scheduling, operations on process; Threads; Inter process communication; Process
scheduling - scheduling criteria, scheduling algorithms; Multiple-Processor scheduling; Case study-
process scheduling in Linux.

UNIT – II L- 9
PROCESS SYNCHRONIZATION: The critical-section problem; Peterson’s solution; Synchronization
hardware; Semaphores; Monitors; Classical problems of synchronization.

DEADLOCKS: Deadlock characterization; Methods of handling deadlocks; Deadlock prevention;

Deadlock avoidance; Deadlock detection and recovery.

UNIT – III L- 9
MEMORY MANAGEMENT: Continuous memory allocation; Paging; Structure of the page table;
Segmentation; Demand paging; Page replacement algorithms.

UNIT – IV L- 9
SECONDARY STORAGE STRUCTURE: Overview of mass-storage structure, disk structure, disk
scheduling; File Systems - file concept, access methods, directory structure, file system mounting,
file sharing protection; File-system structure, file system implementation, directory implementation,
allocation methods, free space management.

UNIT - V L- 9
FUNDAMENTALS OF REAL-TIME SYSTEMS: Concepts and misconceptions; Multidisciplinary design
challenges; Birth and evolution of real-time systems.

REAL TIME OPERATING SYSTEMS: From pseudo kernels to operating systems; Theoretical
foundations in scheduling; System services for application programs.

VFSTR 88
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Execution of various file/directory handling commands.

2. Simple shell script for b asic arithmetic and logical calculations.
3. Shell scripts to check various attributes of files and directories.
4. Write a Shell script that accepts a filename, starting and ending line numbers as
arguments and displays all the lines between the given line numbers.
5. Write a Shell script that deletes all lines containing a specified word in one or more files
supplied as arguments to it.
6. Write a Shell script that displays list of all the files in the current directory to which the
user has read, Write and execute permissions.
7. Write a Shell script that receives any number of file names as arguments checks if every
argument supplied is a file or a directory and reports accordingly. Whenever the
argument is a file, the number of lines on it is also reported.
8. Write a Shell script that accepts a list of file names as its arguments, counts and reports
the occurrence of each word that is present in the first argument file on other argument
files.
9. Write a Shell script to list all of the directory files in a directory.
10. Write a Shell script to find factorial of a given integer.
11. Write a Shell script to count the number of lines in a file that do not contain vowels.
12. Write an awk script to find the number of characters, words and lines in a file.
13. Write a C Program that makes a copy of a file using standard I/O and system calls.
14. Write in C the following Unix commands using system calls
a.cat b.mv
12. Write a C program to list files in a directory.
13. Write a C program to emulate the Unix ls-l command.
14. Write a C program to list for every file in a directory, its inode number and file name.
15. Write a C Program that demonstrates redirection of standard output to a file .EX: ls>f1.

VFSTR 89
 II Year II Semester

TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 9th edition, John Wiley & Sons Inc, 2013.

REFERENCE BOOKS:
1. Richard. Stevens and Stephen A Rago, “Advanced Programming in the Unix
Environment”, 3rd edition, Addison-Wesley, 2013.
2. William Stallings, “Operating Systems: Internals and Design Principles”, 6th edition,
Prentice Hall, 2005.
3. Andrew S Tanenbaum ,”Modern Operating Systems”, 3rd edition, Prentice India, 2007
4. N.Matthew and R.Stones,”Beginning Linux Programming”, 4th edition, (Wrox) Wiley
Publishing Inc., 2008
5. N.B.Venkateswarlu, “Advanced Unix Programming”, 1st edition, BS Publications, 2008.
6. M.G.Venkatesh Murthy,”Introduction to Unix & Shell Programming”, 1st edition, Pearson
Education, 2005.

VFSTR 90
 19IT211 PYTHON PROGRAMMING

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
2 - 4 4 30 - 60 5 40 5 20 5 2

SOURCE:
https://
blog.internshala.com/
PREREQUISITE COURSES: Programming for Problem Solving - I, II; Data Structures 2018/02/learn-
python-
COURSE DESCRIPTION AND OBJECTIVES: programming-
gamers-and-coders-
of-the-world-unite/
This course is aimed at offering the fundamental concepts of Python scripting language to the
students. It starts with the basics of Python programming and deals with lists, dictionaries,
functions, exceptions and files. The objective of this course is to enable the students to
develop the applications using the concepts of Python.

COURSE OUTCOMES:

Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand different python programming concepts and apply 1

them to develop programs.

2 Analyze the usage of different data structures for practical and 1,2
contemporary applications for solving a given problem.

3 Develop functional, reliable and user friendly Python programs 3

for a given problem application.

4 Design solutions using the concepts of object oriented 2

programming paradigm.

5 Develop programs to solve data stored in files. 4

SKILLS:
9 Identify suitable data types and data structures required for an application

9 Design structured and Object oriented programming solutions

9 Design reliable applications for a given problem

VFSTR 91
 II Year II Semester

UNIT - I L- 7

INTRODUCTION: History of Python, Features of Python, Python Installation on Windows & LINUX,
Installing python packages via PIP, Running python commands using the REPL(Shell), Running
Python Scripts, Variables, Assignment, Keywords, Input-Output, Indentation; Basic data types -
integers, booleans etc.

OPERATORS AND EXPRESSIONS: Operators- Arithmetic Operators, Comparison (Relational)

Operators, Assignment Operators, Logical Operators, Bitwise Operators, Membership Operators,
Ldentity Operators; Expressions and order of evaluations.

UNIT - II L- 7

CONTROL STRUCTURES-CONDITIONAL CONTROL STRUCTURES: if, elif, else; Loop control

structures: for, while, for... else, while..else, nested lo ops, break, continue, pass.

Python Data Structures: Lists, Tuples, Dictionary: Creation, Accessing, Basic operators and
methods.

UNIT - III L-6

OTHER DATA STRUCTURES: Strings- creation, accessing, operators, methods; Sets- creation,
accessing, operators, methods; List Comprehensions.

Functions - Defining functions, Calling functions, Passing arguments, Keyword arguments, Default
arguments, Variable-length arguments, Anonymous functions (lambda), fruitful Functions (Function
Returning Values), Scope of the variables in a function - global and local Variables.

UNIT - IV L- 5

MODULES: Creating modules, import statement, from. Import statement, name spacing.

Error and Exceptions Difference between an error and Exception, Handling Exception, Try except
block, Raising Exceptions, User defined exceptions.

File processing: Reading and Writing Files- Creating a New File- Writing to a File- Reading Files as
Text, Opening and Closing files, Reading and writing, tell (), seek(), rename ().

UNIT - V L- 5

OBJECT ORIENTED PROGRAMMING IN PYTHON: Classes, ‘self variable’ Methods, Constructor

Method, Inheritance, Overriding Methods, Datahiding.

VFSTR 92
 LABORATORY EXPERIMENTS
LIST OF EXPERIMENTS TOTAL HOURS: 60

1. a) Installation of python and relevant packages in windows.

b) Installation of python and relevant packages in Linux.
c) Practice Execution of python statements in REPL(shell).
2. a) Implement a python program to display all the python keywords and display each of them
in separate lines.
b) Develop a python program to read two integers and perform all possible arithmetic
operations on those two numbers.
3. a) Develop a program to accept three numbers as command line arguments and find
biggest, smallest and average of those three numbers.
b) Implement a python program to find first n Prime Numbers.
c) Implement a program that prints the decimal equivalents of 1/2, 1/3, 1/4, . . . ,1/n.
d) Implement a python program to read n and find sum of even and odd numbers.
4. Write python code to achieve the following
a) to remove vowels in the given string using control transfer statements.
b) to count number of uppercase and lowercase letters in the given string.
c) to remove all punctuation characters from given string.
5. Implement python code to illustrate the following on Lists and Tuples
a) Creation b) Accessing elements c) apply operators d) Usage of different methods
6. Implement python code to illustrate the following on Sets and Dictionary
a) Creation b) Accessing elements c) apply operators d) Usage of different methods
7. a) Implement python code to illustrate the following
i) Positional arguments ii) Keyword arguments
iii) Default arguments iv) Variable length arguments
b) Implement a function to find nth Fibonacci number.
c) Develop a recursive function to find the factorial of a given number.
d) Implement function to compute GCD, LCM of two numbers (use Lambda function).
8. a) Develop a python code to handle the following built-in exceptions
i) ValueError ii) ZeroDivisionError iii) TypeError iv) NameErrror
b) Implement python code to handle multiple exceptions.
c) Implement Python code to raise an exception.
9. a) Implement python code to read contents of a file and write the contents to another file.
b) Create a class called Student and perform operations such as display, Calculate
percentage, add, delete and modify student data.
c) Design python code to depict the following oops concepts:
i) Datahiding ii) Inheritance iii) Overriding

VFSTR 93
 II Year II Semester

10. Develop python code to calculate the following statistical parameters using python ‘numpy’.
a) Mean b) Hormonic Mean c) Meadian d) Mode
e) Standard Deviation f) Variance g) Percentile
11. Design python code to illustrate the following plots using ‘matplotlib’ package
a) Line plot b) Bar plot c) Histogram d) Scatter Plot
12. Implement python program for the following problems on Pandas DataFrame
a) Write a Pandas program to create and display a DataFrame from a specified dictionary
data which has the index labels.
Sample Python dictionary data and list labels:
exam_data = {‘name’: [‘Anastasia’, ‘Dima’, ‘Katherine’, ‘James’, ‘Emily’, ‘Michael’,
‘Matthew’, ‘Laura’, ‘Kevin’, ‘Jonas’],
‘score’: [12.5, 9, 16.5, np.nan, 9, 20, 14.5, np.nan, 8, 19],
‘attempts’: [1, 3, 2, 3, 2, 3, 1, 1, 2, 1],
‘qualify’: [‘yes’, ‘no’, ‘yes’, ‘no’, ‘no’, ‘yes’, ‘yes’, ‘no’, ‘no’, ‘yes’]}
labels = [‘a’, ‘b’, ‘c’, ‘d’, ‘e’, ‘f’, ‘g’, ‘h’, ‘i’, ‘j’]
b) Write a Pandas program to select the ‘name’ and ‘score’ columns from the following
DataFrame.
c) Write a Pandas program to select the specified columns and rows from a given data
frame.
d) Write a Pandas program to select the rows where the number of attempts in the
examination is greater than 2.
e) Write a Pandas program to count the number of rows and columns of a DataFrame.
f) Write a Pandas program to change the name ‘James’ to ‘Adhvik’ in name column of the
DataFrame.

TEXT BOOKS:
1. Vamsi Kurama, “Python Programming: A Modern Approach”, 1st edition, Pearson
Publishers, 2018.
2. Mark Lutz, “Learning Python”, 2nd edition, O'Reilly Media, 2003.

REFERENCE BOOKS:
1. Allen Downey,” Think Python”, 2nd edition, Green Tea Press, 2016.
2. Ashok Namdev Kamthane, Amith Ashok Kamthane, “ Programming and Problem Solving
With Python”, 1st Edition, McGraw Hill Education, 2016.
3. W.J. Chun, “Core Python Programming” , 3rd Edition, Pearson publishers, 2013.

VFSTR 94
 19IT213 WEB TECHNOLOGIES

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 40 5 20 5 2
SORUCE:https:/
/www.restapi
example.com/
tag/types-of-
PREREQUISITE COURSES: OOP’s through Java; Programming for Problem Solving- I,II web-services/

COURSE DESCRIPTION AND OBJECTIVES:

This course offers the basic concepts used to develop static web pages and it also provides
knowledge of Internet programming concepts, Web Servers and Application Servers, Design
Methodologies with concentration on Object-Oriented concepts. The objective of this course
is to build web applications using JSP, PHP and client side script technologies to build
applications that span multiple domains.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Develop web components with the concepts of HTML, CSS and 1,2
Java Script.

2. Apply Javascript features for form validation and JDBC concepts to 2,3,4,5
perform database operations from web pages.

3. Analyse the suitability of Servlet and JSP technologies to build 9,10,11

solutions for real-world problems.

4 Evaluate the performance of web application developed using 4,5,

SP, Servlet and PHP. 9,10, 11

5 Design and develop three-tier web applications using JSP, 3,4,5,8

Servlet and PHP. 9,10,11

SKILLS :
3 Perform client side validation using Java script.

3 Store and retrieve data using JDBC.

3 Generate dynamic contents using Servlets.

3 Generate dynamic webpages using JSPs and PHP.

3 Develop a web application or website for any real-time requirements.

VFSTR 95
 II Year II Semester

UNIT- I L-9
HISTORY AND EVOLUTION OF INTERNET. INTRODUCTION TO WWW, SERVERS AND WEB
APPLICATIONS;HTML: Common tags, Block Level and Inline Elements, Lists, Tables, Images,
Forms, Frames; Cascading Style sheets, CSS Properties; Java Script: Introduction to Java Script,
Variables, Data types, Operators, Functions, Objects in Java Script, Dynamic HTML with Java Script.

UNIT-II L-9
JDBC DATABASE: Database schema, A brief overview of the JDBC process, JDBC driver types,
JDBC packages, Database connection, Creating, Inserting, Updating and deleting data in Database
tables, Result set, Metadata.

UNIT-III L-9
JAVA SERVLETS: Introduction to servlets, Basic servlet structure, Simple servlet generating plain
text, Lifecycle of a servlet, The servlet API, Reading servlet parameters, Reading initialization
parameters, Context parameters, Handling http request & http responses, Using cookies session
tracking, Servlet with JDBC.

UNIT - IV L-9
JSP TECHNOLOGY: The Problem with servlet. The anatomy of a JSP page, JSP processing; JSP
Application Development: Generating dynamic content, Using scripting elements, Implicit JSP
objects, Declaring variables and methods, Sharing data between JSP pages, Users passing control,
JSP application design with JDBC, JSP application design with MVC.

UNIT - V L-9
PHP: Introduction to PHP: Origins and uses of PHP, Overview of PHP, General syntactic characteristics
,Primitives, Operations, and Expressions - Control statements, Arrays, Functions, Form handling, E-
mail, PHP and MySQL, Session tracking.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1) Create a HTML page having four frames named
a. top
b. center
c. bottom
d. left
The top frame should contain company logo and title. The bottom frame should contain copy
right information. The left frame should contain various links like Home, Products, Services,
Branches, About us, etc. When clicked on those links, the contents should appear in the
display on to center frame.
2) Create a HTML document to demonstrate Form Elements that includes Form, input-text,
password, radio, checkbox, hidden, button, submit, reset, label, text area, select, option, file
upload.
3) Write a HTML program with at least two <h1>, two images, two buttons and appropriate CSS to
display,
a) All <h1> with font-size 12pt, and bold in Verdana font using Inline CSS.
b) All <img> with border color yellow, thickness 10px using Document Level CSS
c) All <input type=’button’> should change background color to red on mouse over
them using External CSS.

VFSTR 96
4) Design a HTML page having a text box and four buttons viz Factorial, Fibonacci, Prime, and
Palindrome. When a button is pressed an appropriate java script function should be called to
display the following:
a) factorial of that number
b) fibonacci series up to that number
c) prime numbers up to that number
d) is it palindrome or not?
5) Write Java script programs to demonstrate the following objects with atleast five methods:
a) Math
b) String
c) Array
c) Date
6) Write a Java script program to display message on OnBlur and OnFocus events.
7) Write a Java program to connect to a database server using JDBC and insert 10 students
information of user choice in to student table.
8) Write a Java program to display all records in the student table.
9) Develop a simple Servlet to display Welcome to Servlet.
10) Develop a Servlet to validate user name and password with the data stored in Servlet
configuration file. Display authorized user if she/he is authorized else display unauthorized
user.
11) Develop a Servlet to validate user name and password stored in the database. Display
authorized user is she/he is authorized else display unauthorized user.
12) Write a Servlet program to store student details sent from registration form in to the database.
13) Write JSP Program to store student information sent from registration page into database.
14) Develop a program to validate username and password that are stored in database using JSP.
15) Write an appropriate JSP page to insert, update and delete data in student table in a single
application with proper linking of JSP pages and session management.
16) Write PHP Program to store registration information sent from registration page into database.
17) Develop a program to validate username and password that are stored in database using
PHP.
18) Write an appropriate PHP page to insert, update and delete data in registration user table in
a single application with proper linking of PHP pages and session management.

TEXT BOOKS:
1. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet & World Wide Web How to Program”,
5th edition, Pearson Education, 2012. (UNIT – I).
2. Jon Duckett, “Beginning Web Programming with HTML, XHTML, and CSS”, 2nd edition,
Wiley India Pvt. Ltd, 2008. (UNIT –II).
3. Marty Hall and Larry Brown, “Core Servlets and Java Server pages Vol. 1: Core
Technologies”, 2nd edition, Pearson, 2004. (UNIT – III and IV).
4. Larry Ullman, “PHP for the Web: Visual QuickStart Guide”, 4th edition, Pearson Education,
2011. (UNIT – V).

REFERENCE BOOK :
1. Robert W Sebesta, “Programming the World Wide Web”, 4th edition, Pearson, 2006.

VFSTR 97
 II Year II Semester

VFSTR 98
 19MS304 PRINCIPLES OF MANAGEMENT &
ORGANIZATIONAL BEHAVIOR

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - - 3 45 - - 10 40 - 8 5 5

Source :
www.goricastani
sic .fi
COURSE DESCRIPTION AND OBJECTIVE:
This course deals with human behavior in organizations, conceptual frameworks, case
discussions, and skill-oriented activities applied to course topics which include: motivation,
group dynamics, leadership, communication, diversity, organizational design, and culture.
Class sessions and assignments are intended to help participants acquire skills and concepts
to improve organizational relationships and effectiveness.

COURSE OUTCOMES:
Upon completion of the course, student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Differentiate personality traits, job attitudes of people. 1,4

2 Understand person-organization fit. 1,4

3 Apply group decision making techniques. 1,8

4 Analyze the effectives of various communication channels. 2,5,8

5 Aware of challenges of OB. 3

SKILLS / ACTIVITIES
3 Study organizational structures of any 10 companies and classify them into
different types of organizations which are studied in Unit 2 and justifying why
such structures are chosen by those organizations.

3 Prepare the leadership profiles of any 5 business leaders and study their
leadership qualities and behaviors with respects to the trait, behavioral and
contingency theories studied.

3 Identify any five job profiles and list the various types, abilities required for
those jobs and also the personality traits/attributes required for the jobs
identified.

VFSTR 99
 II Year II Semester

UNIT - I L-9
INTRODUCTION TO OB: Management functions, Roles, Skills, Organizational behavior: Disciplines
that contribute to the OB field; Diversity in organizations; Attitudes: Components, Major job attitudes.

UNIT - II L-9
EMOTIONS, MOODS & VALUES: Emotions and Moods: Functions & sources of emotions and moods,
Emotional intelligence; Personality: The MBTI, The big five personality models, Other personality
traits relevant to OB; Values: Importance, Terminal, Instrumental and generational values.

UNIT - III L-9

PERCEPTION & MOTIVATION: Perception - meaning, Factors that Influence perception, Person
perception, Common shortcuts in judging others; Motivation - early theories of motivation,
Contemporary theories of motivation.

UNIT - IV L-9
THE GROUP: Defining and classifying groups, Stages of group development, Group properties:
Roles, Norms, Status, Size, and cohesiveness; Diversity – Group decision making: Group think and
group shift, Group decision-making techniques; Work teams: Differences between groups and
teams, Types of teams; Creating effective teams; Context, Composition, Processes.

UNIT - V L-9
COMMUNICATION: Communication: Functions, Process, Direction, Interpersonal communication,
Organizational communication, Choice of communication channel, Persuasive communication,
Barriers to effective communication – Organization structure: Designs – Organizational culture:
Functions.

TEXT BOOKS:
1. Robbins, Judge, and Vohra, “Essentials of Organizational Behavior”, 15th edition,
Pearson Education India, 2014.

REFERENCE BOOKS :
1. Fred Luthans, “Organisational Behavior”, 12th edition, McGraw-Hill, 2010.
2. Debra L. Nelson and James C. “Quick : ORGB”, 4th edition, Cengage Learning, 2014.
3. John R. Schermerhorn, “Organizational Behavior”, 12th edition, John Wiley & Sons, 2011.

VFSTR 100
 19PC009 INTRA-DISCIPLINARY PROJECTS-II

Hours Per Week : Total Hours :

L T P C L T P
0 0 2 1 - - 30

DESCRIPTION AND OBJECTIVES:

These projects arise from a combination of courses. The major objective of these projects is
to enable students understand the relationship between the courses.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Map different courses to gain the knowledge of 1

intra-disciplinary Engineering.

2 Function effectively as an individual and as a member or 9

leader in diverse teams.

3 Comprehend and write effective reports and make effective 10

presentations.

LIST OF INTRA-DISCIPLINARY PROJECTS

• Selection Of A Connected Component.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Serialize And Deserialize A Binary Tree.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Rat In A Maze Problem.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Huffman Encoding.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Binary Heap.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Fleury’s Algorithm.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Cuckoo Hash Table.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).

VFSTR 101
 II Year II Semester

• Scape-Goat Tree.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Double Hash Table.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Cyclic Double Linked List.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Fizz Buzz & Pig Latin.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Lazy Deletion Tree.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Cloning A Linked List.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Quadtrees.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Quadratic Hash Function.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Weighted Graph.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Topological Sort.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Mealy Machine.
(Combination of courses: Formal Languages & Automata Theory & Design and Analysis of
Algorithms).
• Moore Machine.
(Combination of courses: Formal Languages & Automata Theory & Design and Analysis of
Algorithms).
• Push Down Automata.
(Combination of courses: Formal Languages & Automata Theory & Design and Analysis of
Algorithms).
• Pattern Recognizer For Regular Expression.
(Combination of courses: Formal Languages & Automata Theory & Design and Analysis of
Algorithms).
• Snakes And Ladders Game.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Quiz Game.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Sudoku.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Tic Tac Toe Game.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• How Many Islands?
(Combination of courses: Data Structures & Design and Analysis of Algorithms).

VFSTR 102
• Hangman Game.
(Combination of courses: Data Structures & Design and Analysis of Algorithms).
• Breaking Paragraphs Into Lines.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Xor Of Xors Of All Sub-Matrices.
(Combination of courses: C++, Design and analysis of algorithms, Data Structures).
• Write And Implement An Algorithm For Hi-Q Game.
(Combination of courses: C++, Graph theory, Basic programming).
• Implement Fibonacci Heaps. Compare Its Performance With Binary Heaps.
(Combination of courses: C++, Graph theory, Basic programming).
• Satellite Location Tracker Using Boyer-Moore Search Algorithm.
(Combination of courses: C++, Design and analysis of algorithms, Data Structures).
• Magic Square.
(Combination of courses: C++, Design and analysis of algorithms).
• Radix Trees.
(Combination of courses: C++, Design and analysis of algorithms).
• Activity Selection Problem.
(Combination of courses: C++, Design and analysis of algorithms).
• Tug Of War.
(Combination of courses: C++, Design and analysis of algorithms).
• The Knight’s Tour Problem.
(Combination of courses: C++, Design and analysis of algorithms).
• Egg Dropping Puzzle.
(Combination of courses: C++, Design and analysis of algorithms).
• Minimum Number Of Platforms Required For A Railway/Bus Station.
(Combination of courses: C++, Design and analysis of algorithms).
• K Centers Problem.
(Combination of courses: C++, Design and analysis of algorithms).
• Longest Common Subsequence.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Dna Sequence Alignment Using Dynamic Programming Algorithm.
(Combination of courses: Design and Analysis of Algorithms, JAVA).
• Use Greedy Algorithms To Solve Genome Rearrangement Problem.
(Combination of courses: Design and Analysis of Algorithms, JAVA).
• Zips Up The Given Files Into A Zip File.
(Combination of courses: Design and Analysis of Algorithms, JAVA).
• Compare Different Sorting Techniques.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Descending Kruskal’s Algorithm.
(Combination of courses: Design and Analysis of Algorithms, C++).

VFSTR 103
 II Year II Semester

• Longest Simple Path In A Directed Acyclic Graph.

(Combination of courses: Design and Analysis of Algorithms, C++).
• Minimum Spanning Tree (Mst) In Sparse Graphs.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Total Number Of Paths In A Directed Acyclic Graph.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Bitonic Shortest Paths.
(Combination of courses: Design and Analysis of Algorithms, Java).
• Longest Palindrome Subsequence.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Edit Distance.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Breaking A String.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Coin Changing.
(Combination of courses: Design and Analysis of Algorithms, Java).
• Scheduling To Minimize Average Completion Time.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Articulation Points, Bridges, And Biconnected Components.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Second Best Minimum Spanning Tree.
(Combination of courses: Design and Analysis of Algorithms, C++).
• Creating Avl Tree And Performing Its Operations.
(Combination of courses: C++, Data structure, Design and analysis of algorithms).
• Job Assignment Problem Using Branch And Bound.
(Combination of courses: C++, Data structure, Design and analysis of algorithms).
• Median Finding, Order Statistics And Quick Sort.
(Combination of courses:C++, Design and analysis of algorithms).
• BLACK TREES SHARED MEMORY DE-DUPLICATION.
(Combination of courses: C++, Design and analysis of algorithms, Data Structures).
• Minimum Spanning Tree: Solving Tsp For Metric Graphs Using Mst Heuristic.
(Combination of courses: C++, Design and analysis of algorithms, Data Structures).
• Network Flow: Task Allocation Using Bipartite Graph.
(Combination of courses: C++, Design and analysis of algorithms, Data Structures).
• String Matching: Simple Plagiarism Detection Using String Matching Algorithms.
(Combination of courses: Design and analysis of algorithms, JAVA).
NOTE: The afore - mentioned list is not exhaustive and the objective is to provide an idea of
some of the projects that can be executed by students arising from a combination of courses.
Students are given full flexibility to choose any projects of their choice under the supervision of
faculty Mentors.

VFSTR 104
III
Y E A R
INFORMATION
TECHNOLOGY

B.Tech. I SEMESTER
 19IT311 - Data Communications and Networking
 19CS302 - Software Engineering
 19IT302 - Design & Analysis of Algorithms
 19HS205 - Soft Skills Laboratory
 19PC010 - Employability Skills - I
 19PC011 - Inter-Departmental Projects - I
 19PC012 - Modular Course
 - Department Elective - I
 - Open Elective - I

II SEMESTER

 19CS301 - Data Mining Techniques

 19IT301 - Internet of Things
 19CS314 - Competitive Coding
 19HS206 - Professional communications Lab
 19HS301 - Human Values, Professional
Ethics & Gender Equity
 19PC013 - Employability Skills - II
 19PC014 - Inter-Departmental Projects - II
 - Department Elective - II
 - Open Elective - II

COURSE CONTENTS
I SEM AND II SEM
 19IT311 DATA COMMUNICATIONS &
NETWORKING

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 40 5 20 5 2

SOURCE:
https://nizamtaher.
wordpress.com/topics/
topic-1-introduction-
PREREQUISITE COURSES: Data Structures; Operating Systems. of-computer-network/

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on imparting knowledge about the aspects of data communication and
computer network systems. It also provides essential knowledge about the OSI/ISO reference
model and TCP/IP model. In addition, it gives good solid foundation on network communication
system layers being the physical, data link, network, transport and application layers.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1. Analyse, define, and explain the design issues of layers in 1

the communication system used in computer networks.

2 Apply the routing algorithms for given network scenario. 2

3 Analyse the best fitting logical addressing for the requirements 3

from the organization.

4 Evaluate the protocols for given situation to achieve the more 4

channel utilization.

SKILLS :
9 Establish local area networks with different topologies.

9 Evaluate various routing protocols.

9 Network trouble shooting such as installing network interface card

drivers, setting IP.

9 Addresses, and subnet masking etc.

VFSTR 107
 III Year I Semester

UNIT- I L-9
DATA COMMUNICATION AND NETWORKS: Data communications, Networks, The Internet, Protocols
and standards, Network models, Layered tasks, The OSI model, Layers in the OSI model, TCP/IP
protocol suite, Addressing, Physical layer and media, Data and signals, Analog and digital, Periodic
analog signals, Digital signals, Transmission impairment, Data rate limits.

UNIT -II
L-9
ERROR CODES AND MEDIUM ACCESS:Error detection and correction, Data link control, Framing,
flow and error control, Multiple access, Random access, Aloha, Controlled access, Channelization,
IEEE standards, Standard ethernet, Fast ethernet, Gigabit ethernet, IEEE 802.11, Bluetooth.

UNIT-III L-9
NETWORK LAYER: Logical addressing, IPv4 addresses, IPv6 addresses,Internet protocol,
Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6, Address mapping, Error reporting and
multicasting, Address mapping, ICMP, IGMP, ICMPv6,Delivery, Forwarding and routing, Delivery,
forwarding, Unicast routing protocols, Multicast routing protocols.

UNIT-IV
L-9
TRANSPORT LAYER: Process-Process Delivery, UDP, TCP and SCTP, Process-to-Process delivery,
user datagram protocol (UDP), TCP, SCTP, Congestion control and quality of service, Data traffic,
congestion, Congestion control, Two examples, Quality service, Techniques to improve QoS,
Integrated services, Differentiated services, QoS in switched networks.

UNIT-V
L-9
APPLICATION LAYER: Domain name system, Name space, Domain name space, Distribution of
name space, DNS in the internet, Resolution, DNS messages, Types of records, Registrars, dynamic
domain name system (DDNS), Encapsulation, Remote logging, Electronic mail and file transfer,
Remote logging, Telnet, Electronic mail, File transfer.

TEXT BOOK:
Behrouza A. Forouzan, “Data Communications and Networking”, 4th edition, TMH, 2007.

REFERENCE BOOKS:
1. Andrew S Tanenbaum, “Computer Networks”, 5th edition, Pearson Education, 2014.
2. William Stallings, “Data and Computer Communications”, 10th edition, Pearson Educa-
tion, 2017.

VFSTR 108
 19CS302 SOFTWARE ENGINEERING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

Scource:
https://
www.computer
PREREQUISITE COURSES: Data Base Management Systems; Oops through Java hope.com

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on the concepts of software development life cycle, role of process
models and methods to prepare software requirement specification document. In addition
to that, it also imparts knowledge of design, development and testing of software. The
objective of this course is to enable the student to develop defect free and efficient software
as per the given requirements.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the basic concepts of software engineering. 1, 11

2 Compare different process models and identify appropriate 2,4

process model based on project requirements.

3 Build Software Requirement Specification (SRS) document for 3, 5

any software product.

4 Design of solution using UML diagrams like use case, sequence 3,4,5
diagrams etc.

5 Design suitable architectural that meets all non functional 5

requirements.

6 Apply different testing techniques to ensure bug free software and 4,5,11
measure metrics such as software size and quality of the product.

SKILLS:
9 Understand the software requirements and find out various ways to gather and
specify them.

9 Choose a process model for developing software solutions without schedule/

effort overruns and good quality.

9 Analyse and model (diagramitical representations) a software product.

VFSTR 109
 III Year I Semester

UNIT– I L- 9
INTRODUCTION TO SOFTWARE ENGINEERING: The evolving role of software; Software; Changing
nature of software; Software myths.

GENERIC VIEW OF PROCESS: Software Engineering - a layered technology; A process framework;

Software Development Life Cycle(SDLC); The Capability Maturity Model Integration(CMMI); Process
assessment.

PROCESS MODELS: Waterfall model; Incremental process models; Evolutionary process models
(Spiral and Prototype models).

UNIT – II L- 9
AN AGILE VIEW OF PROCESS: Agile process models - unified process model, extreme programming;
Scrum.

REQUIREMENTS ENGINEERING: Inception, Elicitation, Elaboration, Negotiation, Specification (SRS

document; IEEE standards for SRS), Validation, Requirements management; Feasibility study.

BUILDING THE ANALYSIS MODEL: Data modeling - data objects, attributes, relationships, cardinality
and modality; Class based modeling - identify analysis classes, specify attributes, define operations.

UNIT – III L- 9
DESIGN ENGINEERING: Design concepts; The design model.

CREATING AN ARCHITECTURAL DESIGN: Software architecture; Data design; Architectural styles

and patterns; Architectural design.

PERFORMING USER INTERFACE DESIGN: Golden rules; User interface analysis and design; Interface
analysis; Interface design steps; Design evaluation.

UNIT – IV L- 9
PRODUCT METRICS: Software quality; Metrics for analysis model; Metrics for design model;
Architecture metrics and Object oriented metrics; Metrics for source code; Metrics for testing; Metrics
for maintenance.

TESTING STRATEGIES: A strategic approach to software testing; Test strategies for conventional
software; Validation testing; System testing.

TESTING TACTICS: Black-Box and White-Box testing.

UNIT - V L- 9
RISK MANAGEMENT: Reactive vs Proactive risk strategies; Software risks; Risk identification; Risk
projection; Risk refinement; RMMM; RMMM plan.

QUALITY MANAGEMENT: Quality concepts; Software quality assurance; Software reviews; Formal
technical reviews; Statistical software quality assurance; Software reliability; The ISO 9000 quality
standards.

VFSTR 110
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

Laboratory session of this course is designed in such a way that the student should
complete three projects of the given type by performing the below experiments.
1. Identifying the Requirements from Problem Statements.
2. Estimation of Project Metrics.
3. Modeling UML Use Case Diagrams and Capturing Use Case Scenarios.
4. Statechart and Activity Modeling.
5. Modeling UML Class Diagrams and Sequence diagrams.
6. Estimation of Test Coverage Metrics and Structural Complexity.
7. Design of Test Cases.

TEXT BOOKS:
1. Roger S. Pressman, “Software Engineering, A practitioner’s Approach”, 6th edition,
McGrawHill International edition, 2008.
2. Booch G., Rumbaugh J. and Jacobsons I, “The Unified Modeling Language User Guide”,
2nd edition, Addison Wesley, 2005.

REFERENCE BOOK:
1. Simon Sennet, Steve McRobb and Ray Farmer, “Object Oriented Systems Analysis and
Design, 2nd edition, 2004.

VFSTR 111
 III Year I Semester

VFSTR 112
 19IT302 DESIGN AND ANALYSIS OF
ALGORITHMS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
2 - 4 4 30 - 60 5 40 5 20 5 2

SOURCE:https://
www.tes.com/
lessons/
rcrxkMCBbphf4w/
PREREQUISITE COURSES: cape-cs1m2-4-
ways-of-
Data Structures; C/ C++/ Python/ Java/ Any one Programming language
representing-
algorithms
COURSE DESCRIPTION AND OBJECTIVES:
This course offers insight into the time and space complexities of various algorithms, designof
algorithms using divide and conquer, greedy, dynamic, branch and bound, and backtracking
approaches. The objective of this course is to design and analyse the algorithms for their time
and space complexities and to understand problems such as 0/1 knapsack,shortest path,
minimum spanning tree, matrix multiplication, graph coloring, n-queens and travelling
salesman problem.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand different algorithmic design strategies like divide -

& conquer,Greedy, dynamic programming and backtracking etc.

2 Apply various design algorithms to solve a given problem. 1,9

3 Analyze the efficiency of a given algorithm using time and 2,9

space complexity theory.

4 Investigate which algorithm is efficient to solve a given novel 4,9

problem.

5 Synthesize new algorithms for solving given problems based on 3,9

different design strategies like divide and conquer, greedy,
dynamic programming and backtracking techniques and
analyze them.

SKILLS:

Develop algorithms for solving problems using divide and conquer, greedy,

dynamic programming and backtracking techniques.

Analyze the given algorithm with respect to space and time complexities and

compare with other algorithms.

Application of existing algorithms to solve real world problems.

VFSTR 113
 III Year I Semester

UNIT - I L-6
INTRODUCTION: Algorithm, Pseudo-code for expressing algorithms, Performance analysis - Space
and Time complexity; Asymptotic notation - Big oh notation, Omega notation, Theta notation and Little
oh notation; Analysis of recursive algorithms through recurrence relations: Substitution method,
Recursion tree method, Masters theorem.

DIVIDE AND CONQUER: General method, Applications - Binary search, Quick sort, Merge sort, and
Stassen’s matrix multiplication.

UNIT - II L-6
GREEDY METHOD: Applications - Job sequencing with deadlines, Knapsack problem, Minimum cost
spanning trees, Single source shortest path.

Disjoint sets - Disjoint set operations, Union and find algorithms, Graph representations. Connected
components and Bi-connected components.

UNIT - III L-6

DYNAMIC PROGRAMMING: General method, Applications - Optimal binary search trees, Matrix chain
multiplication, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person
problem.

UNIT - IV L-5
BACKTRACKING: General method, Applications – n-queen problem, Sum of subsets problem, Graph
coloring, Hamiltonian cycles.

UNIT - V L-7
BRANCH AND BOUND PROBLEMS: General method, Applications - Traveling sales person problem,
0/1 knapsack problem, LC Branch and Bound solution, FIFO Branch and Bound solution.

P, NP, NP - Hard and NP-Complete: Basic concepts, Non deterministic algorithms, NP – Hard and NP
complete classes, Cook’s theorem, Randomized algorithms.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 60

Language: C / C++ / Java / Python / Any other programming language of student’s choice.
1. Sort a given set of elements using the following methods and determine the time
required to sort the elements. Repeat the experiment for different values of n, the number
of elements in the list to be sorted and plot a graph of the time taken versus n. The
elements can be read from a file or can be generated using the random number
generator.
a.Quick sort b. Merge sort c. Bubble sort
2. Search for a given element/ elements using the following methods and determine the
time required to search the given element. Repeat the experiment for different values of
n. The elements can be read from a file or can be generated using the random number
generator.
a.Linear Search b. Binary Search

VFSTR 114
 3. Implement the following:
a. Represent the given graph using sequential representation.
b. Find the degree of all the vertices.
c. List all the isolated vertices.
4. Implement the following using divide and conquer approach
a.To multiply two given square matrices.
b.To multiply two given square matrices using starssen’s matrix multiplication.
5. State the problem of Job sequencing with deadlines and write a program to solve it
using Greedy method.
6. State Knapsack problem and write a program to solve the knapsack problem using
Greedy approach.
7. Define minimum spanning tree and write a program to find minimum spanning tree for a
given undirected graph using any algorithm of your choice.[ Prims/ Krushkals].
8. State all pairs shortest path problem and write a program to solve it using dynamic
programming.
9. Explain optimal binary search tree using an example and Write a program to find optimal
binary search tree using dynamic programming.
10. State the problem of Matrix chain multiplication and write a program to find optimal order
of matrix chain multiplication problem using dynamic programming.
11. State n-queens problem and write a program to solve the same using backtracking
approach.
12. State the problem of sum of subsets and write a program to solve it using backtracking
approach.
13. Write a program to solve knapsack problem using Branch and Bound.

TEXT BOOKS:
1. Ellis Horowitz, Satraj Sahni and Rajasekharam, “Fundamentals of Computer Algo-
rithms”, 2nd edition, Galgotia publications, 2006.
2. Thomas H.Coremen,Charles E.Leiserson and Ronald L.Rivest, “ Introduction to Algo-
rithm”, 2nd edition, Clifford Stein, 2014.

REFERENCE BOOKS:
1. Anony Levitin, “Introduction to Design and Analysis of Algorithms”, 3rd edition, Pearson
Education, 2016.
2. Donald E.knuth, “The Art of Computer Programming”, Volume 3, 2nd edition,
Addisonwesley Longman Inc,1998.
3. Ronald L.Graham,Donald E.Knuth and Oren Patashnik, “Concrete Mathematics”,
2nd edition, Addison-wesley Publishing Company,1998.

VFSTR 115
 III Year I Semester

VFSTR 116
 19HS205 SOFT SKILLS LABORATORY

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
- - 2 1 - - 30 25 - - 20 - 2
Source:
https//
5.imimg.com

COURSE DESCRIPTION AND OBJECTIVES:

To impart students employability skills like resume preparation and facing interviews. To
enable trainees to develop interpersonal and leadership skills. To train them on work place
skills like making presentations, participating in group discussions etc.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Introspect on individual strengths and weaknesses, and 12

emerge as a balanced personality with improved self-awareness
and self-worth for their future.

2 Prepare a resume and gain the confidence to communicate 10

effectively.

3 Possess the interpersonal skills to conduct himself/herself effectively 8

in everyday professional and social contexts.

4 Adopt professionalism into daily activities. 8

5 Observe gender sensitive language and workplace etiquette in his 8

professional life.

SKILLS:
9 Balance social and emotional intelligence quotients though SWOC, JOHARI etc.
activities.

9 Prepare tailor made resume and face various job interviews with enriched
personality traits.

9 Plan personal and professional goals.

9 Solve personal and professional life hiccups with confidence and maturity.

VFSTR 117
 III Year I Semester

ACTIVITIES: UNIT - I P-6

Soft Skills: Need for soft skills, professionalism, employability skills - Communication: Need for
o Formal and
Informal effective communication - the process of communication, levels of communication, flow of
Communication. communication, choice of diction and style with reference to setting (formal, semi-formal or informal)
-communication networks, barriers to communication, miscommunication, noise and ways to
o SWOT overcome the barriers. Career Planning: Job vs. career, goal setting, SWOT analysis, planning and
Analysis.
prioritization, time management : four quadrant system, self-management, stress-management.
o Stephen Covey Activities: Johari Window for SWOT analysis; Setting a SMART goal using the provided grid; Writing
Time a Statement of Purpose (SOP) - Stephen Covey’s Time Management matrix.
Management
Matrix.
UNIT - II P-6
o Stress
Management Vocabulary Building: Word etymology, roots, prefixes & suffixes, synonyms & antonyms, collocations,
Technique. one-word substitutes, analogies, idioms and phrases, contextual guessing of unfamiliar words,
task-oriented learning (50 words). Functional English: Situational dialogues, Role plays (including
o Vocabulary small talk), Self introduction, Opening and closing a telephonic conversation, Making an appointment,
Flashcards. Making a query, Offering/Passing on information, Communicating with superiors, Expressing
agreement/objection, Opening bank account (combination of prepared and impromptu situations
o Group
Discussions. given to each student). Group Discussion: Articulation and flow of oral presentation, dynamics of
group discussion, intervention, summarizing and conclusion, voice modulation, content generation,
o Resume Key Word Approach (KWA), Social, Political, Economic, Legal and Technical Approach (SPELT), View
Preparation. Point of Affected Part (VAP), language relevance, fluency and coherence.

o Mock- Activities: Making a flash card (one per day by each student) – vocabulary exercises with hand-outs
Interviews. – Vocabulary quiz - Viewing a recorded video of GD & Mock sessions on different types of GD topics-
controversial, knowledge, case study (including topics on current affairs).
o Reading
Comprehension
Activities. UNIT - III P-6
Resume preparation: Structure and presentation, defining career objective, projecting one’s strengths
o Listening
Comprehension and skill-sets, summarizing, formats and styles and covering letter. Facing Interviews: Interview
Activity by process, understanding employer expectations, pre-interview planning, opening strategies,
Watching impressive self-introduction, answering strategies, other critical aspects such as body language,
American grooming, other types of interviews such as stress-based interviews, tele- interviews, video interviews,
Accent Video.
frequently asked questions (FAQs) including behavioural and HR questions and the aspect looked
at by corporate during interviews.

Activities: Appraising some samples of good and bad resumes, preparing the resume, writing an
effective covering letter- writing responses and practicing through role plays and mock interviews on
the FAQs including feedback.

UNIT - IV P-6
Reading Comprehension: Reading as a skill, techniques for speed reading, understanding the
tone, skimming and scanning, appreciating stylistics, impediments for speed reading, eye fixation,
sub-vocalization, critical reading, reading based on purpose, reading for information, reading for
inference- Listening Comprehension: Listening as a skill, different types of listening, active and
passive listening, top-down approach, bottom-up approach, understanding the non verbal cues of
communication; intonation and stress.

Activities: Reading comprehension exercises with texts drawn from diverse subject areas. (Hand-
outs) -Narration of a story, Speech excerpts with different accents (Indian, British, American), listening
comprehension exercises with audio and video excerpts.

VFSTR 118
UNIT - V P-6
Paper Presentation: Selection of a topic, preparing an abstract, gathering information, organizing
the information, drafting the paper, citing reference sources – writing striking introductions, discussing
the methodology used, developing the argument, presentation style, language, presenting the paper
and spontaneously answering audience questions. Mind your language - How Language Reflects
Personality: Gender sensitive language in MNCs, Seven essential skills for a team player; attentive
listening, intelligent questioning, gently persuading, respecting other’s views, assisting others,
sharing, participating actively.

Activities- Watching & discussing videos on corporate etiquette- Presenting a paper - Quiz on
corporate etiquette.

REFERENCE BOOKS:
1. Edward Holffman, “Ace the Corporate Personality”, McGraw Hill, 2001.
2. Adrian Furnham, “Personality and Intelligence at work”, Psychology Press, 2008.
3. John Adair Kegan Page, “Leadership for Innovation” 1st edition, Kogan, 2007.
4. Krishna Mohan and NP Singh, “Speaking English Effectively” 1st edition, Macmillan, 2008.
5. Dr. S.P. Dhanvel, “English and Soft Skills”, Orient Blackswan, 2011.
6. Rajiv K. Mishra, “Personality Development”, Rupa & Co. 2004.

VFSTR 119
 III Year I Semester

VFSTR 120
 19PC011 INTER- DEPARTMENTAL
PROJECTS - I

Hours Per Week : Total Hours :

L T P C L T P
0 0 4 2 - - 60

DESCRIPTION AND OBJECTIVES:

These projects are aimed at enabling students to understand the relationship between the
courses of various engineering programs. Students will get an idea of how new technologies
or solutions, prototype or working model can be developed by culmination of technologies
from courses of different programs.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Map different courses to gain the knowledge of 1

inter-disciplinary Engineering.

2 Function effectively as an individual and as a member or 9

leader in diverse teams.

3 Comprehend and write effective reports and make effective 10

presentations.

LIST OF INTER-DEPARTMENTAL PROJECTS

• Wireless Network Based Wireless SCADA.
(Combination of courses from the branches of IT, CSE, ECE & EEE).
• Efficient Protection of Palms from RPW Larvae using Wireless Sensor Networks.
(Combination of courses from the branches of IT, CSE & ECE).
Biometric Authentication Using Near Infrared Images of Palm Dorsal Vein Patterns.
(Combination of courses from the branches of IT, CSE & ECE).
• Medical Image Fusion Based On Joint Sparse Method.
(Combination of courses from the branches of IT, CSE & BM).
• Research on the Rice Counting Method Based on Connected Component Labeling.
(Combination of courses from the branches of IT, CSE & ECE).
• Forensic analysis of social networking applications on mobile devices.
(Combination of courses from the branches of IT, CSE & IT).
• A Robust Wireless Mesh Access Environment For Mobile Video Users.
(Combination of courses from the branches of IT, CSE & ECE).
• Secure File Storage on Cloud Using Hybrid Cryptography.
(Combination of courses from the branches of IT, ECE & CSE).

VFSTR 121
 III Year I Semester

•
z IoT Weather Monitoring System Using Cloud Computing.
(Combination of courses from the branches of IT, CSE & ECE).
• Understanding the Performance of Low Power Raspberry Pi Cloud for Big Data.
(Combination of courses from the branches of IT, ECE, EEE & CSE).
• Cloud Computing Smart Building Using IoT Project.
(Combination of courses from the branches of IT, CSE & ECE).
• Remote Monitoring and Control System for DC Motor using Zigbee Protocol.
(Combination of courses from the branches of IT, ECE, EEE & CSE).
• Detecting Data Leaks via Sql Injection Prevention on an E-Commerce.
(Combination of courses from the branches of IT, CSE, ECE & MBA).
• G-Netadmin-A Network Management System.
(Combination of courses from the branches of IT, CSE & ECE).
• Cell Phone Accident Avoidance System While Driving.
(Combination of courses from the branches of IT, CSE & ECE).
• M- Muster Using GPS.
(Combination of courses from the branches of IT, CSE & ECE).
• eFresh – A Device to Detect Food Freshness.
(Combination of courses from the branches of IT, CSE, ECE & FT).
• Panoramio -A Mobile Application Based on Android.
(Combination of courses from the branches of IT, CSE & ECE).
• GSM based Matrix LED — Rolling display.
(Combination of courses from the branches of IT, CSE & ECE).
• SMS Based Device Control.
(Combination of courses from the branches of IT, CSE & ECE).
• RFID Based Attendance System.
(Combination of courses from the branches of IT, CSE & ECE).
• RFID Based Security System.
(Combination of courses from the branches of IT, CSE & ECE).
• RFID Based Highway Toll Tax Collection System.
(Combination of courses from the branches of IT, CSE & ECE).
• Touch Screen Based Wireless Food Ordering System For Hotels.
(Combination of courses from the branches of IT, CSE & ECE).
• Home Appliance Control Using Touch Screen With Wireless Communication.
(Combination of courses from the branches of IT, CSE & ECE).
• Arduino And IOT Based Patient Health Monitoring System Project.
(Combination of courses from the branches of IT, CSE & ECE).
• SMS Based Alcohol Detection With Vehicle Controlling Using GSM Technology.
(Combination of courses from the branches of IT, CSE & ECE).
• Blind Aid : Travel Aid For Blind.
(Combination of courses from the branches of of IT, CSE & ECE).
• Trace Length Calculation on PCBS.
(Combination of courses from the branches of IT, CSE, ECE, Mech & EEE).
• Breast milk Monitoring with Android Based On IOT.
(Combination of courses from the branches of IT, CSE, ECE & Bio-Medical).
• Krishi-Mitra:- An ICT Enabled Interface For Farmers.
(Combination of courses from the branches of IT, CSE, ECE & Agriculture).
• Traffic Info with Pothole Detection and Warning System.
(Combination of courses from the branches of IT, CSE & ECE).

VFSTR 122
• Smart Asthma Inhaler.
(Combination of courses from the branches of IT, CSE, ECE, Medical & BT).
• Driver and Vehicles Documents Authentication System Using Android, WebServer and MYSQL.
(Combination of courses from the branches of IT, CSE & ECE).
• One Touch Information.
(Combination of courses: IT, CSE, ECE & EEE).
• GPS Tracker For Blind People Using GSM Technology.
(Combination of courses from the branches of IT, CSE & ECE).
• Home Appliances Controlling using Android Mobile via Bluetooth.
(Combination of courses from the branches of IT, CSE & ECE).
• Touch Screen And SMS Based Industrial Security System.
(Combination of courses from the branches of IT, CSE & ECE).
• Arduino and IOT Based Patient Health Monitoring System Project.
(Combination of courses from the branches of IT, CSE & ECE).
• Android Mobile Controlled Door Security Locking System.
(Combination of courses from the branches of IT, CSE & ECE).
• IOT Based Fire Alerting System Project.
(Combination of courses from the branches of IT, CSE & ECE).
• Office Cab Tracking System Using GPS and GSM Technology.
(Combination of courses from the branches of IT, CSE & ECE).
• Android Controlled Electronic Notice Board Using Matrix LED Rolling Display.
(Combination of courses from the branches of IT, CSE & ECE).
• Speed Control of DC Motor Using Android Mobile.
(Combination of courses from the branches of IT, CSE & ECE).
• ATmega16A Based GPS Receiver.
(Combination of courses from the branches of IT, CSE & ECE).
• PC-Based GPS Receiver.
(Combination of courses from the branches of IT, CSE & ECE).
• Automatic Off Timer Circuit.
(Combination of courses from the branches of IT, CSE & ECE).
• Doorbell Cum Visitor Indicator.
(Combination of courses from the branches of IT, CSE & ECE).
• Sonar Water-Level Meter.
(Combination of courses from the branches of IT, CSE & ECE).
• Audio Controlled Running Light.
(Combination of courses from the branches of IT, CSE & ECE).
• Infrared Electronic Shooting Game.
(Combination of courses from the branches of IT, CSE & ECE).
• Numeric Display Digital Dice.
(Combination of courses from the branches of IT, CSE & ECE).
• Sixth-Sense Media Player.
(Combination of courses from the branches of IT, CSE & ECE).
• Quiz Game Controller.
(Combination of courses from the branches of IT, CSE & ECE).
NOTE: The afore - mentioned list is not exhaustive and the objective is to provide an idea of
some of the projects that can be executed by students arising from a combination of courses.
Students are given full flexibility to choose any projects of their choice under the supervision of
faculty Mentors.

VFSTR 123
 III Year I Semester

VFSTR 124
 19CS301 DATA MINING TECHNIQUES

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source:
https://
c1.sfdcstatic.
PREREQUISITE COURSES: Probability and Statistics; Database Management Systems. com/
content/
COURSE DESCRIPTION AND OBJECTIVES:
This course introduces the basic concepts, principles, methods, implementation techniques,
and applications of data mining, with a focus on three major data mining functions: (1)
Association rule mining (2) Classification and (3) cluster Analysis. In the first part of the course
student will learn why Association rule mining. In classification student will learn basic concepts
of classification and methodologies used for classification. This includes KNN, Naive Bayes,
Decision tree and Neural Network based methods. In clustering students will learn different
clustering methods. It also focuses on issues relating to the feasibility, usefulness, effectiveness
and scalability of techniques for the discovery of patterns hidden in large data sets.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Investigate various patterns that can be extracted from

different types of data. 4

2 Apply various pre-processing techniques and classification

algorithms on different domains of data. 1

3 Build decision making systems using data mining algorithms for a 3

given real time data set.

4 Construct models using modern tools such as WEKA, R and 5

python etc.

SKILLS:
9 Pre-process the given data.

9 Find the correlation among the attributes.

9 Apply classification, association rule mining and clustering algorithms on data

sets.

9 Evaluate the performance of classification and clustering methods.

VFSTR 125
 III Year II Semester

UNIT– I L- 9
INTRODUCTION: What is data mining?; Why Data mining?; What kinds of data can be mined?; What
kinds of patterns can be mined?; Which technologies are used?; What kinds of applications are
targeted?; Major issues in data mining; Data objects and attribute types; Basic statistical descriptions
of data, Data matrix versus dissimilarity matrix.

UNIT – II L- 9
DATA PREPROCESSING: Overview - data quality, major tasks in data preprocessing; Data cleaning
- missing values, noisy data; Data Integration - entity identification problem, redundancy and correlation
analysis tuple duplication; Data value conflict detection and resolution; Data reduction - PCA, attribute
subset selection, regression and log linear models; Histogram; Data transformation - data
transformation by normalization; Discretization by binning; Histogram Analysis.

UNIT – III L- 9
MINING FREQUENT PATTERNS, ASSOCIATIONS AND CORRELATIONS: Market basket analysis;
Frequent Item sets; Closed item sets and association rules; Frequent Item set Mining Methods -
apriori algorithm, generating association rules, improving apriori, FP growth method, vertical format
method; Which patterns are interesting?; Pattern evaluation method; Pattern Mining in multilevel
multidimensional space.

UNIT – IV L- 9
CLASSIFICATION BASIC CONCEPTS: What is classification?, General approach to classification,
Decision tree induction - attribute selection measures; Tree pruning; Bayes Classification methods
- Bayes theorem; Naïve Bayesian classification; Classification by back propagation - a multilayer
feed forward neural network; Defining a network topology; Back propagation; K nearest neighbor
classifier; Support vector machine, Linearly separable and inseparable cases, Model evaluation
and selection; Techniques to improve classification accuracy; Other classification methods - KNN;
generic algorithms; Fuzzy algorithm.

UNIT - V L- 9
CLUSTER ANALYSIS: Partition methods - K means and K medoid; Hierarchical methods;
Agglomerative and divisive method; Density based methods - DBSCAN; Optics; Grid based methods-
STING; Cluster evaluation methods; Clustering high dimensional data; Problems, Challenges and
major methodologies.

VFSTR 126
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

The Students pursue the following experiments by using the open source analytical tools such as R,
Python, Weka, Rapid Miner etc.
Students experiment the following on UCI/ Kaggle/ NCBI data repository.

1. Apply the following data pre-processing techniques on a given dataset to illustrate the need of
the pre-processing in data mining.
a) Data Cleaning
b) Data Normalization
c) Data Discretization
d) Computation of correlation coefficient to analyze the data behaviour
e) Dimensionality reduction using PCA and Wavelets

2. Evaluate the need of feature selection on a given dataset using Information Gain as a metric.

3. Write a program to extract the interesting association rules from a given dataset using Apriori
and Frequent Pattern growth algorithms.

4. Apply the following classifiers on a given dataset and analyze their performance.
a) J48 and visualize the decision tree
b) Naive Bayes
c) Support Vector Machine
d) Multi Layer Perceptron

5. Evaluate the performance of partitioning and hierarchical based clustering algorithms on a

given dataset.

TEXT BOOK:
1. Jiawei Han, Micheline Kamber and Jian Pei, “Data mining Concepts and Techniques”,
3rd edition, Morgan Kaufmann. 2012.

REFERENCE BOOKS:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”,2nd
edition, Pearson, 2018
2. Jure Leskovec, Anand R aja raman and Jeffrey D Ullman, “Mining of Massive Datasets”,
5th edition, Stanford University, 2014.

VFSTR 127
 III Year II Semester

VFSTR 128
 19IT301 INTERNET OF THINGS

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 40 5 20 5 2

SOURCE:
https://taazaa.com/
the-technologies-that-
enable-the-internet-
COURSE DESCRIPTION AND OBJECTIVES: of-things/

Students will be explored to the concepts and applications of Internet of Things,

interconnection and integration of the physical world and the cyberspace. They are also able
to design & develop IOT Devices and applications.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyze the application areas of IOT 2

2 Realize the revolution of Internet in Mobile Devices, Cloud & 3

Sensor Networks.

3 Analyze the building blocks of Internet of Things and characteristics. 2

4 Design and develop IoT applications for given specific problem 4

statement

SKILLS:
9 Case studies on IoT applications.

9 Writing Python scripts for IoT circuits.

9 Utilizing the general purpose pins of suitable IoT supported COB.

VFSTR 129
 III Year II Semester

Unit- I L-9
INTRODUCTION & CONCEPTS: Introduction to Internet of Things, Physical design of IOT, Logical
design of IOT, IOT Enabling Technologies, IOT Levels.

Unit - II L-9
DOMAIN SPECIFIC IOTS: Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture,
Industry, Health & Life Style.

UNIT -III L-9

Installing Python, Python Data Types & Data Structures, Control Flow, Functions, Modules, Packages,
File handling, Date/ time Operations, Classes, Python packages

UNIT - IV L-9
M2M & System Management with NETCONF-YANG: M2M, Difference between IOTand
M2M, SDN and NFV for IOT, Software defined Networking, Network function virtualization, Need for
IOT systems management, Simple network management protocol,
Limitations of SNMP, Network Operator Requirements, NETCONF, YANG.

UNIT - V L-9
IOT Design Methodology, Case study using weather monitoring; IOT Physical Devices & Endpoints-
What is an IOT Device? exemplary Device, board, Linux on Raspberry Pi, interfaces, and programming
of IOT devices.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. a. Demonstration and study of Raspberry Pi board, GPIO Pins and familiarity of various sensors
b. Demonstration and study of other Hardware board of IoT such asArduino Uno and NodeMCU
2. Design and Implementation of controlling LED using Python in Raspberry Pi board.
3. Design and Implementation of sensing light through LDR using Python in Raspberry Pi board.
4. Design and Implementation of controlling LED through switch using Python in Raspberry Pi
board.
5. Design and Implementation to find obstacles through sensor using Python in Raspberry Pi
board.
6. Design and Implementation of sensing and display temperature using Python in Raspberry
Pi board.
7. Design and Implementation of detecting noise through microphone sensor using Python in
Raspberry Pi board.
8. Design and Implementation of output devices through relay using Python in Raspberry Pi
board.
9. Design and Implementation of vibration sensor using Python in Raspberry Pi board.
10. Design and Implementation of uploading sensor data into cloud using Python.

TEXT BOOK:
1 Vijay Madisetti, ArshdeepBahga,” Internet of Things A Hands-On- Approach”, 1st edition,
Orient Blackswan Private Limited,2014.

REFERENCE BOOKS:
1. Adrian McEwen, “Designing the Internet of Things”, 1st edition, Wiley Publishers, 2013.
2. Daniel Kellmereit, “The Silent Intelligence: The Internet of Things”,1st edition, DND
Ventures LLC, 2013.

VFSTR 130
19HS206 PROFESSIONAL
COMMUNICATION LABORATORY

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
- - 2 1 - - 30 15 10 - 10 - -

Source:
https://
encrypted

COURSE DESCRIPTION AND OBJECTIVES:

To improve the overall communication skills (LSRW) of students and prepare them for their
profession as engineers and managers. To provide them exposure to conventions of corporate
communication and training them on how to function in the business world.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Communicate effectively both in their academic as well as 10

professional environment.

2 Grasp the register of business language. 8

3 Possess the ability to write business reports and proposals clearly 12

and precisely to succeed in their future.

4 Make effective presentations and participate in formal 10

meetings.

SKILLS:
9 Articulate effective spoken and listening abilities needed for professional and
social success in interpersonal situations, group interactions, and personal and
professional presentations.

9 Explore specific functions and vocabulary in a business context.

9 Produce short business reports, proposals and correspondence.

9 Write various business documents through reading techniques.

VFSTR 131
 III Year II Semester

ACTIVITIES: UNIT - I P-6

Business English Vocabulary: Glossary of most commonly used words (formal and informal usage)
o Paraphrasing
an article or a Elements of Technical Writing: Sentence structure, reducing verbosity, arranging ideas logically,
video in own building coherence, cohesive devices and transitional words.
words and
finding topic Mechanics of Writing: Stylistic elements, the purpose, the reader’s viewpoint (audience), elementary
sentence in rules of grammar, choice of diction, elementary principles of composition, matters of form, punctuation,
newspaper conventions of business communication, language and professional tone, code of conduct (not
articles.
sending illegal, offensive, disparaging personal remarks or comments) in written business
o Finding out communication.
new words Activity: Basic grammar practice, framing paragraphs on topics allocated, paraphrasing an article
from a
professional or a video, finding topic sentences in newspaper articles, finding out new words from a professional
view point and viewpoint and understanding the meaning and its usage.
understanding
the meaning
UNIT - II P-6
and its usage.
Business Correspondence: E-mail: nature and scope, e-mail etiquette, clear call for action, common
o Reviewing errors in composing e-mails, office communication such as meeting agenda and minutes of the
samples of
meeting, notice, circular and memo.
well prepared
proposals and Letter-Writing: Formal and informal letters, structure of formal letters, expressions of salutations,
reports. different types of letters [such as sales letter, complaint letter, response to the complaint letter
(dispute resolution), letter of permission, letter of enquiry, claim letter – letter of apology], introductory
o Drafting
different and concluding paragraphs and clear call for action.
proposals /
Professional Proposal/Report: Differentiating proposals and reports, Drafting formal business
reports on
assigned proposals, types of reports such as factual reports, feasibility reports and survey reports, parts of a
topics. report (such as title page, declaration, acknowledgements, table of contents, abstract, introduction,
findings, conclusion and recommendations).
o Classroom
activities of Activity: Perusing samples of well-prepared business emails, memo, letter writing and short
team and proposals and reports, students will draft business correspondence writing tasks and different
individual proposals/reports on topics assigned.
presentations.

o Finding UNIT - III P-6

missing Speaking: Speaking in business context, assertiveness, politeness, making requests, queries and
appropriate
sentence in the questions, negotiations, asking for information, offering suggestions, conflict resolution, contacting
text. clients, initiating, addressing delegates (in public), features of a good power-point presentation
(making PPT), delivering the presentation effectively, telephone etiquettes, delivering seminar/
o Using proposal/report effectively, team meeting etiquettes (face to face and conference call), making effective
vocabulary in one minute presentations.
context.
Activity—watching videos/listening to audios of business presentations, classroom activities of
team and individual presentations, using PPTs, mock exercises for BEC speaking, presenting
(speaking) the written components completed in Unit 1.

UNIT - IV P-6
Reading: Reading and comprehending business documents, learning business register, regularizing
the habit of reading business news, suitable vocabulary, skimming and scanning text for effective
and speedy reading and dealing with ideas from different sectors of corporate world in different
business contexts.

VFSTR 132
Activity- Hand-outs; matching the statements with texts, finding missing appropriate sentence in
the text from multiple choice, using right vocabulary as per the given context and editing a paragraph.

UNIT - V P-6
Listening: Specific information in business context, listening to telephonic conversations/messages
and understanding the intended meaning, understanding the questions asked in interviews or in
professional settings, summarizing speaker’s opinion or suggestion.

Activity- Working out BEC/TOEFL/IELTS listening exercises with hand-outs; matching the statements
with texts, finding missing appropriate sentence in the text from multiple choices, using right vocabulary
in context-editing a paragraph, listening to a long conversation such as an interview and answer
MCQs based on listening.

REFERENCE BOOKS:
1. Guy Brook Hart, “Cambridge English Business Bench Mark: Upper Intermediate”,
2nd edition, Cambridge University Press, 2014.
2. CUP, Cambridge: BEC VANTAGE Practice Papers, Cambridge University Press, 2002.
3. Schnurr, “Exploring Professional Communication: Language in Action”. London:
Routledge, S 2013.
4. Seely John, “The Oxford Guide to Effective Writing and Speaking”. Oxford University
Press, 2005.

VFSTR 133
 III Year II Semester

VFSTR 134
 19HS301 HUMAN VALUES, PROFESSIONAL
ETHICS & GENDER EQUITY

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
2 - - 2 30 - - 6 6 7 - - 10

SOURCE:
https://
www.google.com/
COURSE DESCRIPTION AND OBJECTIVES: search?q=professional
+ethics&client
The course will provide students with an understanding on Engineering Ethics and the
nature of moral issues and dilemmas faced by engineers in their professional lives. It will
give them an awareness on professional rights and responsibilities of an engineer and
acquaint them on the Code of Conduct and Ethics prescribed by professional bodies like
IEEE, ASME etc for its members.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes.

COs Course Outcomes POs

1 Engage in an informed critical reflection on the nature of 6, 7

professionalism and ethical challenges inherent in engineering 8,9,12
profession.

2 Apply awareness of professional rights and responsibilities of 6,7,8

an engineer to conduct themselves ethically within an organization. 9,12

3 Apply understanding of safety norms to highlight ethical issues 6,7,8

in risky situation. 9,12

4 Understand the role of professional bodies, and the code of 6,7,8

ethics and industrial standards prescribed for engineers. 9,12

SKILLS:
9 Safety & Environment consciousness.

9 Ethical behaviour and decision-making at workplace.

9 Work in large teams.

9 Emotional intelligence for workplace.

VFSTR 135
 III Year II Semester

UNIT – I L-6
Introduction to professional ethics; Morals, values and ethics; Civic virtue; Respect for others, Living
peacefully; Caring; Sharing; Honesty; Valuing time; Co-operation; Commitment, Empathy; Self-
confidence; Courage, Character; Spirituality; Service learning; Introduction to Engineering Ethics;
Profession; Professionalism.

UNIT – II L-6
Nature of moral issues; Moral dilemmas (Problem of Vagueness, Conflicting Reasons &
Disagreement); Types of inquiry (Normative, Conceptual & Factual); Moral autonomy; Kohlberg’s &
Carol Gilligan’s theory; Impediments to responsible action; Theories of right action (Bentham’s
Theory of Utilitarianism, Theory of Consequentialism etc.).

UNIT – III L-6

Engineering as social experimentation; Engineers’ responsibility for safety; Assessment of safety
and risk; Testing for safety; Risk benefit analysis; Reducing risk; Government regulator’s approach
to risk; A balanced outlook on law; Discussion of case studies: Challenger disaster / Chernobyl
disaster; Code of ethics; Professional societies; Sample code of ethics like ASME, ASCE, IEEE etc.

UNIT – IV L-6
Rights and responsibilities at workplace; Organizational complaint procedures; Whistle blowing;
Environment and the workplace; Gender equity; Understanding gender; Organizational policies
regarding gender; Gender roles; Looking beyond stereotypical generalizations; Service rules; Conflict
of interest; Prevention of sexual harassment; Women rights under labour laws.

UNIT – V L-6
Ethics in a Global Context; Multinational Corporations; Intellectual Property Rights; Business ethics;
Transparency & fair practices; Discussion of case study - Enron-Dhabol project; Environmental
Ethics; Challenge of sustainable development; UN Conventions & protocols on environment;
Discussion of case studies: Bhopal gas tragedy, Pacific gas & Electric company Vs. Environmental
activist, Erin Brockovich; Computer ethics; Automation & artificial intelligence; Cyber security & Cyber
laws; Case study; Wiki leaks; Role in technological development; Weapons development.

TEXT BOOKS:
1. Martin Mike and Schinzinger Roland, “Introduction to Engineering Ethics”, 2nd edtion,
McGraw-Hill Higher Education, 2010.
2. M. Govindarajan, S.Natarajan and V. S. Senthil Kumar, “Engineering Ethics”, Prentice Hall
of India, Reprint 2013.
3. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins, “Engineering Ethics:
Concepts and Cases”, 4th edition, Wadsworth Thompson Learning, 2009.

REFERENCE BOOKS:
1. Charles B. Fleddermann, “Engineering Ethics”, 4th edition, Pearson Education/Prentice
Hall, 2014.
2. Edmund G. Seebauer and Robert L. Barry, “Fundamentals of Ethics for Scientists and
Engineers”, Oxford University Press, 2008.
3. “A Comprehensive Guide to Women’s Legal Rights”, Prepared by Majlis Legal Centre for
IIT-Kanpur, 2018.

VFSTR 136
 19PC014 INTER-DEPARTMENTAL
PROJECTS - II

Hours Per Week : Total Hours :

L T P C L T P
0 0 4 2 - - 60

DESCRIPTION AND OBJECTIVES:

These projects are aimed at enabling students to understand the relationship between the
courses of various engineering programs. Students will get an idea of how new technologies
or solutions, prototype or working model can be developed by culmination of technologies
from courses of different programs.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Map different courses to gain the knowledge of 1

inter-disciplinary Engineering.

2 Function effectively as an individual and as a member or 9

leader in diverse teams.

3 Comprehend and write effective reports and make effective 10

presentations.

LIST OF INTER - DEPARTMENTAL PROJECTS

• TV Show Popularity Analysis Using Data Mining.

(Combination of courses from the branches of IT, CSE & ECE).
• License Plate Recognition.
(Combination of courses from the branches of IT, CSE, ECE & Mechanical).
• Infant Cry Analysis And Detection.
(Combination of courses from the branches of IT, CSE & EEE).
• Biometric Authentication Using Near Infrared Images of Palm Dorsal Vein Patterns.
(Combination of courses from the branches of IT, CSE & ECE).
• Medical Image Fusion Based On Joint Sparse Method.
(Combination of courses from the branches of IT, CSE & BM).
• Research on the Rice Counting Method Based on Connected Component Labeling.
(Combination of courses from the branches of IT, CSE & ECE).

VFSTR 137
 III Year II Semester

• Forensic Analysis Of Social Networking Applications On Mobile Devices.

(Combination of courses from the branches of IT, CSE & IT).
• A Menu-Based Universal Control Protocol.
(Combination of courses from the branches of IT, CSE & IT).
• Online DVD Rental System Java Project.
(Combination of courses from the branches of IT, CSE & IT).
• Free Download Online Shopping System.
(Combination of courses from the branches of IT, CSE & IT).
• Attendance Management System.
(Combination of courses from the branches of IT, CSE & IT).
• E-Bug Tracker – Bug Tracking System Project.
(Combination of courses from the branches of IT, CSE & ECE).
• E-Learning Platform using Cloud Computing.
(Combination of courses from the branches of IT, CSE, Education & ECE).
• Digitalized Certificate Generation of Emission Test.
(Combination of courses from the branches of IT, CSE, ECE, Automobile & Mech).
• Portable H2O Quality Monitoring and Cloud Reporting System.
(Combination of courses from the branches of IT, CSE, ECE & Chemical).
• Hand bone Age Estimation Using Energy Based Segmentation.
(Combination of courses from the branches of IT, CSE, ECE & Bio-medical).
• Panoramio -A Mobile Application Based on Android.
(Combination of courses from the branches of IT, CSE & ECE).
• Identifying the Amount of Fertilization Required for Rice Crops Using Image Processing
System.
(Combination of courses: IT, CSE, ECE, Agriculture & Mech.).
• Facial Expression Recognition.
(Combination of courses from the branches of CSE, IT, Bio Informatics & ECE).

NOTE : The afore - mentioned list is not exhaustive and the objective is to provide an idea of
some of the projects that can be executed by students arising from a combination of courses
from various branches. Students are given full flexibility to choose any projects of their choice
under the supervision of faculty mentors from a combination of different departments.

VFSTR 138
IV
Y E A R
INFORMATION
TECHNOLOGY

B.Tech.
I SEMESTER

 19IT401 - Cryptography & Network Security

 19CS433 - Bigdata & Analytics
 19PC015 - Societal-Centric and Industry Related Projects
- Department Elective - III
- Department Elective - IV
- Open Elective - III

II SEMESTER
 19PC016 - Internship
 19PC017 - Project Work

COURSE CONTENTS
I SEM AND II SEM
 19IT401 CRYPTOGRAPHY & NETWORK
SECURITY

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source
https://
en.wikipedia.org/
PREREQUISITE COURSE: Computer Networks.

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on the modern concepts of network security using various cryptographic
algorithms and underlying network security applications. It enables to understand various
symmetric and asymmetric cryptographic techniques. It focuses on security implementation
in practical applications such as e-mail functioning, web security and secure electronic
transactions protocol and system security.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply cryptographic techniques in various security service solutions 1

effectively in everyday professional and social contexts.

2 Analyse various network security essentials, classical and modern 2

encryption techniques, the network security model, principles
of symmetric and asymmetric cryptosystems, protocols and its
usage in network, web and system security.

3 Design of cryptographic mechanisms using the algorithms for 3, 6

providing the needed services.

4 Investigate various network security and system security scenarios 4, 6

for real time applications.

SKILLS:
9 Design various security services for appropriate applications.

9 Identify appropriate firewall, password management and anti-virus models for

specific applications.

VFSTR 141
 IV Year I Semester

UNIT– I L- 7
INTRODUCTION TO NETWORK SECURITY: Security attacks, Security services, Security mechanisms,
A model for network security.

CLASSICAL ENCRYPTION TECHNIQUES: Symmetric cipher model, Substitution techniques,

Transposition techniques, Rotor machines and steganography.

UNIT – II L- 9
BLOCK CIPHERS AND DATA ENCRYPTION STANDARD: Block cipher principles, Data encryption
standard, Strength of DES, Differential and linear cryptanalysis, Block cipher design principles.

ADVANCED ENCRYPTION STANDARD: Evaluation criteria of AES, AES cipher, More on symmetric
ciphers, Multiple encryption and triple DES, Block cipher modes of operation, RC4.

UNIT – III L- 11
PUBLIC-KEY ENCRYPTION AND HASH FUNCITONS: Principles of public key cryptosystems, RSA
algorithm, Key management.

MESSAGE AUTHENTICATION AND HASH FUNCTIONS: Authentication requirements, Authentication

functions, Message authentication, Hash functions, Security of hash functions and MACs.

DIGITAL SIGNATURES: Authentication protocols and digital signature standard.

UNIT – IV L- 9
NETWORK SECURITY APPLICATIONS: Kerberos, X.509 authentication service, Public key
infrastructure, Pretty good privacy, S/MIME.

IP SECURITY OVERVIEW: IP security architecture, Authentication header, Encapsulating security

payload, Combining security associations and key management.

UNIT – V L- 9
WEB SECURITY: Secure socket layer and transport layer security, Secure electronic transaction.

SYSTEM SECURITY: Intruders, Intrusion detection, Password management, Malicious software,

Firewalls and trusted systems.

TEXT BOOK:
1. William Stallings, “Cryptography and Network security”, 4th edition, Pearson Education,
2010.

REFERENCE BOOKS:
1. William Stallings “Network Security Essentials Applications and Standards”, 2nd edition,
Pearson Education, 2009.
2. Eric Malwald, “Fundamentals of Network Security”, 4th edition, Pearson Education, 2010.
3. Buchmann, “Introduction to Cryptography”, 2nd edition, Pearson Education, 2009.

VFSTR 142
 19CS433 BIG DATA & ANALYTICS

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 3 45 - 30 5 5 30 20 5 5

source:
https://www.smartdata
collective.com/

PREREQUISITE COURSES: Databases; Design and Analysis of Algorithms.

COURSE DESCRIPTION AND OBJECTIVES:

This course gives an overview of Big Data, i.e.storage, retrieval and processing of big data.The
focus will be on the “technologies”, i.e., the tools/algorithms that are available for storage and
processing of Big Data and a variety of “analytics”.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand Big Data and its analytics in the real world. 1

2 Use the Big Data frameworks like Hadoop and NOSQL to

efficiently store and process Big Data to generate Analytics. 2

3 Design of Algorithms to solve Data Intensive problems using 3

Map Reduce Paradigm.

4 Design and Implementation of Big Data Analytics using Pig and 4

Spark to solve Data Intensive problems and to generate analytics.

5 Analyse Big Data using Hive. 5

SKILLS:
9 Build and maintain reliable, scalable, distributed systems with Apache
Hadoop.

9 Develop Map-Reduce based Applications for Big Data.

9 Design and build applications using Hive and Pig based Big data Applications.

9 Learn tips and tricks for Big Data use cases and solutions.

VFSTR 143
 IV Year I Semester

UNIT– I L- 9
INTRODUCTION TO BIG DATA: Data, Characteristics of data and types of digital data, Sources of
data, Working with unstructured data, Evolution and definition of big data, Characteristics and need
of big data, Challenges of big data.

BIG DATA ANALYTICS: Overview of business intelligence, Data science and analytics, Meaning and
characteristics of big data analytics, Need of big data analytics, Classification of analytics, Challenges
to big data analytics, Importance of big data analytics, Basic terminologies in big data environment.

UNIT – II L-9
INTRODUCTION TO HADOOP : Introducing hadoop, Need of hadoop, Limitations of RDBMS, RDBMS
versus hadoop, Distributed computing challenges, History of hadoop , Hadoop overview, Use case
of hadoop, Hadoop distributors, HDFS (Hadoop distributed file system), Processing data with
hadoop, Managing resources and applications with hadoop YARN (yet another nesource negotiator),
Interacting with hadoop ecosystem.

UNIT – III L- 9
INTRODUCTION TO MAPREDUCE PROGRAMMING: Introduction-mapper, reducer, combiner,
partitioner, searching, sorting, compression, real time applications using mapreduce, combiner,
artitioner, matrix multiplication using mapreduce and page rank algorithm using mapreduce.

UNIT – IV L-9
INTRODUCTION TO PIG: The anatomy of pig, Pig on hadoop, Pig philosophy, Usecase for pig, ETL
processing, Pig latin overview, Data types in pig, Running pig, Execution modes of pig, HDFS
commands, Relational operators, Piggy bank, Word count example using pig, Pig at Yahoo.

INTRODUCTION TO HIVE: Introduction to hive, Hive architecture, Hive data types, Hive file format,
Hive query language (HQL).

UNIT - V L- 9
HIVE: Partitions and bucketing, RCFile Implementation, working with XML files, User-defined Function
(UDF) in Hive, Pig versus Hive.

SPARK: Introduction, features of spark, components of spark, programming with Resilient Distributed
Datasets (RDD).

VFSTR 144
 LIST OF EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. HDFS basic command-line file operations.
2. HDFS monitoring User Interface.
3. WordCount Map Reduce program using Hadoop.
4. Implementation of word count with combiner Map Reduce program.
5. Practice on Map Reduce monitoring User Interface.
6. Implementation of Sort operation using MapReduce.
7. MapReduce program to count the occurrence of similar words in a file by using
partitioner.
8. Design MapReduce solution to find the years whose average sales is greater than 30.
input file format has year, sales of all months and average sales.
Year Jan Feb Mar April May Jun July Aug Sep Oct Nov Dec Average.
9. MapReduce program to find Dept wise salary.
Empno EmpName Dept Salary.
10. Install and Run Pig then write Pig Latin scripts to sort, group, join, project and filter the
data.
11. Implementation of Word count using Pig.
12. Creation of Database and tables using Hive query language.
13. Creation of partitions and buckets using Hive.
14. Practice of advanced features in Hive Query Language: RC File & XML data processing.
15. Implement of word count using spark RDDs.
16. Filter the log data using Spark RDDs.

TEXT BOOKS:
1. Seema Acharya and Subhashini Chellappan, “Big Data and Analytics”, 1st edition, Wiley,
Publishers, 2015.
2. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge,
University Press, 2012.
3. Holden Karau, Andy Konwinski, Patrick Wendell and Matei Zaharia,”Learning Spark”,
1st edition, Oreilly, 2015.

REFERENCE BOOKS:
1. Boris lublinsky, Kevin t. Smith and AlexeyYakubovich, “Professional Hadoop Solutions”,
1st edition, Wiley, 2015.
2. Chris Eaton and Dirkderoosetal, “Understanding Big data “, 1st edition, McGraw Hill,
2012.
3. Tom White, “HADOOP: The definitive Guide”, 1st edition, O Reilly 2012.
4. Vignesh Prajapati, “Big Data Analytics with R and Haoop”,1st edition, Packet Publishing,
2013.

VFSTR 145
 IV Year I Semester

VFSTR 146
 19PC015 SOCIETAL-CENTRIC AND
INDUSTRY RELATED PROJECTS

Hours Per Week : Total Hours :

L T P C L T P
0 0 6 3 - - 90

DESCRIPTION AND OBJECTIVES:

The major objective of the societal-centric projects is to connect students to society through
their technical knowledge. The prerequisite to start the project is to submit a report pertaining
to the Societal-centric or industry related problem in the preceeding semester.

COURSE OUTCOMES:
Upon completion of the course, student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Study the problems which are related to the society in their 2

production / occupational activities.

2 Work on technology applications which can either solve the 3

problems or make the activities less stenuous.

3 Design an implement or process to achieve the second outcome. 4

LIST OF SOCIETAL-CENTRIC AND INDUSTRY RELATED

PROJECTS

• Quiz Conduction by Smart Phone.

(Java and Oracle, Windows and Android OS).
• Dynamic Hybrid Topology Design for Integrated Traffic Support in WDM Mesh Networks.
(Computer Networks and Network Programming).
• Improving Data Delivery in Wide Area and Mobile Environments.
(Computer Networks and Java with NOS).
• Securing Network Connected Applications with Proposed Security Models.
(Computer Networks and Use any Programming language with NOS in windows).
• Mind Reading Machines: Automated Inference of Cognitive Mental States from Video.
(Computer Networks and Use any Programming language with NOS in windows).
• On-Board Diagnostic (OBD) System.
(Computer Networks and Sensors for detecting and Knowledge on Programming
Languages).
• On GSM Based ECG Tele-Alert System.
(Computer Networks and GSM Mobile and .NET or JAVA Programming Language).

VFSTR 147
 IV Year I Semester

• Bluetooth Energy Meter.

(Computer Networks, Micro Controller, Bluetooth enabled device and Knowledge on
Programming languages).
• Mobile Based Robot.
(Computer Networks and Assembly Language, Android device and Robot).
• Wireless for Monitoring Mine Safety System.
(Computer Networks, Sensors and Knowledge on any Programming language with NOS in
windows / LINUX).
• Light Fidelity Data Transmission.
(Computer Network Concepts and Knowledge on wireless Transmission media with Light
Emitting Device).
• Mini Weather Station Using Arduino.
(Fundamentals of Image Processing, IoT).
• IOT Based Street Light Control.
(Fundamentals of Image Processing, IoT).
• Wordpress server Using Raspberry Pi.
(Data Mining, DBMS, IoT).
• GPS Based Location Tracker Using Raspberry Pi.
(Fundamentals of Image Processing, IoT).
• IOT Based Solar Power Monitoring System.
(Machine Learning, IoT).
• Messaging with GSM and Raspberry Pi.
(CN, IoT).
• CAN Protocol Implementation Using Arduino.
(CN, IoT).
• Remote control of Home appliances Using Mobile Phones.
(IoT and ES).
• An Intelligent Sensing follower Cart.
(IoT and AI).
• Thumb Based Smart e-voting System.
(IoT and Basic electronics).
• Vehicle based Intensity Controlled Street Lighting System.
(IoT and ES).
• Occupancy Based Street Lighting System
(IoT and Basic electronics).
• Moniterization of Alexa Smart fan.
(IoT and ES).
• Power Generation from Footpaths.
(IoT and ES).
• Smart Trash Can Using Internet of Things.
(IoT and Data Mining).
• Automatic Smart Parking System Using IoT.
(IoT and DBMS).
• Smart Energy Distribution System Using Arduino.
(WSN, CN and IoT).

VFSTR 148
• Agriculture robot Using Arduino.
(Fundamentals of Image Processing).
• Wireless Surveillance Using Rasberry Pi.
(Fundamentals of Image Processing, IoT).
• IoT Based Health Monitor Using Arduino.
(Computer Networks, IoT).
• IoT Based Air Pollution Using Arduino.
(IoT and Programming Languages).
• Heart Disease Prediction Project.
(Data Mining algorithms and Big data Analytics).
• Data Mining For Improved Customer Relationship Management.
(Data Mining algorithms and Big data Analytics).
• Online book recommendation system using Collaborative filtering.
• Cancer Prediction Using Data Mining.
(Data Mining algorithms and Big data Analytics).
• Personality Prediction System Through CV Analysis.
(Data Mining algorithms and Big data Analytics).
• Filtering political sentiment in social media from textual information.
(Data Mining algorithms and Big data Analytics).
• Detecting Fraud Apps Using Sentiment Analysis:
(Data Mining algorithms and Big data Analytics).
• Social Media Community Using Optimized Clustering Algorithm.
(Data Mining algorithms and Big data Analytics).
• Crime Rate Prediction Using K Means.
(Data Mining algorithms and Big data Analytics).
• Surveillance of malicious discussions on online fourms using Data Mining.
(Data Mining algorithms and Big data Analytics).
• Number Plate Scanner Using MATLAB.
(Fundamentals of Image Processing).
• Surveillance Monitoring Using Android Phone.
(Fundamentals of Image Processing and IoT).
• Smart mirror for Smart life.
(Fundamentals of Image Processing, IoT and Python).
• Ball Tracking Robot Using Raspberry Pi.
(Fundamentals of Image Processing, IoT and Python).
• Wireless Surveillance Using Rasberry Pi.
(Fundamentals of Image Processing and IoT).
• Surveillance Robot.
(Fundamentals of Image Processing, IoT and Python).
• Weather Monitoring Using Raspberry Pi.
(IoT and Python).
• Weight sensing automatic gate.
(Fundamentals of Image Processing, IoT and Python).
• PI Phone.

VFSTR 149
 IV Year I Semester

(CN, IoT and Python).

• Remote Monitoring and Controlling of Industry Using IoT.
(CN, IoT and Python).
• Biometric Attendance System with IoT.
(IoT and DBMS).

NOTE: The afore - mentioned list is not exhaustive and the objective is to provide an idea of
some of the projects that can be executed by students pertaining to societal or indus try related
problems. Students are given full flexibility to choose any project of their choice under the
supervision of faculty mentor.

VFSTR 150
 DEPARTMENT
ELECTIVES

B.Tech.
 19CS335 - R PROGRAMMING
 19IT331 - MOBILE APPLICATION DEVELOPMENT
 19CS313 - ARTIFICIAL INTELLIGENCE
 19CS337 - CLOUD COMPUTING
 19CS332 - EMBEDDED SYSTEMS
 19CS336 - NETWORK PROGRAMMING
 19CS334 - FUNDAMENTALS OF IMAGE PROCESSING
 19CS338 - ADVANCED DATA MINING
 19IT431 - MULTIMEDIA COMPUTING
 19CS333 - OPEN SOURCE WEB TECHNOLOGIES
4 19IT438 - MACHINE LEARNING
 19IT432 - BLOCK CHAIN TECHNOLOGIES

COURSE CONTENTS
 19CS335 R PROGRAMMING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source:
https://
d3njjcbhbojbot.
cloudfront.net/api/
COURSE DESCRIPTION AND OBJECTIVES:
R is a programming language that is capable of handling mathematical and statistical
manipulations. It has its own programming language as well as built in functions to perform any
specialized task. After taking the course, students will be able to familiar with the use of the R
interactive environment, Understand the different data types, data structures, analyze the data
by using different techniques. In addition to this the student will be able to display the data by
using different graphics.

COURSE OUTCOMES:

Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply different data structures for solving a program. 1

2 Analyze the data by applying both linear and non linear regression
techniques. 2

3 Investigate results obtained for a given data set by using different 4

plots.

4 Design and develop a program for a given scenario. 3,5,8,9,10

SKILLS:
9 Perform basic matrix operations such as addition, subtraction, dot product and
multiplication on matrices.

9 Write programs for a given scenario.

9 Predict the things by using classification techniques.

VFSTR 153
 Electives

UNIT– I L- 9
INTRODUCTION: Install R & R studio, opening R, The R user interface; Objects; Functions; Sample
with replacements; Writing your own functions - The function constructor, arguments, scripts.

R Objects: Atomic vectors; Attributes; Matrices; Arrays.

UNIT – II L- 9
R OBJECTS & R NOTATIONS: Class; Coercion; Lists; Data frames; Loading data; Saving data.

R Notation: Selecting values; Dollar signs and double brackets.

UNIT – III L- 9
MODIFYING VALUES & PROGRAMS AND LOOPS: Changing values in place; Logical sub setting -
logical tests, Boolean operators; Missing information - na.rm, is.na;

Programs: Strategy; Sequential steps; Parallel cases; If statements; Else statements, Lookup tables;
Code comments.

Loops: Expected values; Expand. grid; For loops; While loops; Repeat loops.

UNIT – IV L- 9
GRAPHICS: Creating graphs; The workhorse of R base graphics; The plot() Function; Customizing
Graphs; Saving graphs to files.

R Packages & Loading and Saving Data in R: R packages - installing packages, loading packages;
Loading and saving Data in R; Data sets in base R; Working directory.

UNIT - V L- 9
REGRESSION: Linear models; Simple linear regression; Multiple regression; Generalized linear models
- logistic regression, poisson regression; Other generalized linear models; Survival analysis;
Nonlinear models; Splines; Decision; Random forests.

VFSTR 154
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. (a) Installation of R.
(b) Implement R program for finding the factorial of a given number.
2. (a)Implement R program to read two integers and perform all possible arithmetic
operations and display the results.
(b)Write R program to create a vector which contains 10 random integer values between -
50 and +50.
(c) Write R program to create three vectors having numeric data, character data and
logical data. Display the content of the vectors and their type.
3. Write R program to create data frame which contain details of employees such as name,
salary and date of birth. Display statistics of the data on salary and date of birth.
4. Write R program to create and print a list of elements using vectors, matrices.
5. Write R program to create and print list of heterogeneous data, which include character,
numeric and logical vectors.
6. Write R program to read CSV file and perform the following preprocessing operations:
(a)Display the contents of CSV file.
(b) Find the missing values in a dataset.
(c) How to remove missing values in a data set.
7. Write R program to find frequent item sets for a data set using Apriori algorithm.
8. Write R program for clustering of given data sets using the following clustering algorithms
and compare their performance
(a)K means (b) K Medoids
9. Write R program for classification of a given datasets using the following classification
algorithms and compare the classification accuracy.
(a) KNN (b) Naive Bayes (c) Decision tree
10. Implement R program to import packages and create a bar plot and bell curve of a random
normal distribution for a given data.

11. Write R program to predict the value of dependent variable for a given independent
variable data and find out the relationship among the variables using regression.

TEXT BOOKS:
1. Garrett Grolemund, “Hands-on Programming with R”, 1st edition, O’Reilly Press, 2014.
2. Norman Matloff, “The Art of R Programming”, 1st edition, No Starch Press, 2017.
3. Johannes Ledolter, “Data Mining and Business Analytics with R”, 1st edition, Wiley
Publishers, 2014.

REFERENCE BOOK:
1. Michael J, Crawley, “The R Book”, 1st edition, Wiley Publishers, 2012.

VFSTR 155
 Electives

VFSTR 156
 16CS350
19IT331 MOBILE APPLICATION
DEVELOPMENT

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 40 8 5 2

Source:
https://
www.indiamart.com/
PRE-REQUISITE COURSES: OOP’s through JAVA; Programming and Problem Solving - I, II. proddetail/mobile-app-
development-android-
ios-15261360433.html
COURSE DESCRIPTION AND OBJECTIVES:
This course helps a student to design effective mobile applications using the Android
development environment. The main objective of this course is to create user-friendly applications
that involve design of layout, windows components, and multiple screens with one- touch
options.

COURSE OUTCOMES:
Upon completion of the course the student will be able to achive the following outcomes

COs Course Outcomes POs

1 Define, explain and understand the android mobile application -

design models and styles.

2 Apply activities, dialog boxes, fragments, intents, views and layouts 1

to android apps.

3 Analyze various mobile applications during the design of 2

mobile apps.

4 Create user-friendly mobile user interfaces and views. 3

5 Design and develop mobile apps for given real time scenario 5,10
using modern tool android studio.

SKILLS:
9 Write mobile applications for user requirements.

9 Use various components of Android operating system.

9 Utilize activities, intents, layouts and views for content.

VFSTR 157
 Electives

UNIT – I L-9
GETTING STARTED WITH ANDROID: Android introduction, Versions of android, Features of android,
Architecture, Devices in the market, Developer community.

UNIT – I L-9
ACTIVITIES, FRAGMENTS, INTENTS:Understanding activities, Linking activities using intents,
Fragments, Calling built in apps using intents.

UNIT –II L-8

GETTING TO KNOW ANDROID UI:Understanding the components of screen - Views and view groups,
Liner layout, Absolute layout, Table layout, Relative layout, Frame layout, Scroll view

UNIT – IV L-8
DISPLAY ORIENTATION: Anchoring views, Resizing and repositioning views, Managing changes to
screen orientation, Utilizing the action bar, Creating UI programmatically.

UNIT – V L-8
DESIGNING UI WITH VIEWS:Using basic views - Text view, Button, Image Button, Edit text, check
Box, Toggle button, Radio button, and Radio group views, Progress bar view and Auto complete text
view.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Installation of Android studio, its required tools and Android Virtual Device (Emulator).
2. Displaying the welcome message in AVD.
3. Creating a basic Activity and applying themes, styles to it.
4. Displaying various types of Dialog objects.
5. Linking activities with Intents.
6. Passing data using intent object.
7. Usage of Fragments and adding them dynamically to the application.
8. Communication between fragments.
9. Creating various layouts.
10. Displaying Action bar.
11. Handling view events.

TEXT BOOK :
1. Wei-Meng Lee, “Beginning Android Application Development”, 1st edition, John Wiley &
Sons, Inc., 2012.

REFERENCE BOOKS:
1. RaimonRefolsMontane, Laurence Dawson, “Learning and Android Application
Development”, 1st edition, PACKT Publishing, 2016.
2. Reto Meier, “Professional Android 4 Application Development”, 3rd edition, Wrox, 2012.
3. Adam Gerber and Clifton Craig, “Learn Android Studio”, 1st edition, Apress, 2015.

VFSTR 158
 19CS313 ARTIFICIAL INTELLIGENCE

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

Source:
https://
quarkmag.com/
will-artificial-
PREREQUISITE COURSES: Programming for Problem Solviing - I,II; Data Structures; Design intelligence-be-
the-next-social-
& Analysis of Algorithms; Discrete Mathematics; Probability and Statistics. crisis-
bfef841e34ab
COURSE DESCRIPTION AND OBJECTIVES:
The primary objective of this course is to introduce the basic principles, techniques, and
applications of Artificial Intelligence. In addition to this, student will understand the building
blocks of AI such as search, knowledge representation, inference, logic and learning. This
course enables the students to develop a small AI system for real time problems.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply AI search Models and Generic Search strategies for problem 1

solving.

2 Inspect and analyze Logic for representing Knowledge and 2

Reasoning of AI systems.

3 Apply and evaluate the searching strategies to achieve the goalfor a 3

given situation.

4 Design different learning algorithms for improving the performance 4

of AI systems.

5 Conduct investigation and implement project using AI learning 5

techniques.

SKILLS:
9 Analyze Intelligent systems.

9 Apply problem solving techniques.

9 Interface various knowledge representation.

9 Create a dynamic planning.

VFSTR 159
 Electives

UNIT– I L- 5
INTELLIGENT SYSTEMS: What is AI; The foundations for AI; The history of AI; The state of the art;
Intelligent agents and environments, The concept of rationality, The nature of environments, The
structure of agents.

UNIT – II L- 12
PROBLEM SOLVING: Solving problems by searching-problem solving agents, searching for solutions;
Uninformed Search Strategies-BFS, DFS, UCS, IDS, BS; Informed Search Strategies-best first search,
greedy search, A*, AO* algorithms, hill climbing; Adversarial Search-games, optimal decisions in games,
alpha beta pruning.

UNIT – III L- 12
KNOWLEDGE REPRESENTATION: Logical Agents- knowledge based agents, the wumpus world,
logic, propositional logic, propositional theorem proving, agents based on propositional logic; First-
order logic-representation- revisited, syntax and semantics, knowledge engineering in first order logic;
Inference in FOL-propositional vs FOL, unification and lifting, forward chaining, backward chaining,
resolution.

UNIT – IV L- 6
PLANNING: The Planning problem- planning with state space search; Partial order planning; Planning
graphs; Planning with propositional logic; Analysis with planning approaches.

UNIT – V L- 10
LEARNING: Forms of learning- supervised learning, unsupervised learning, reinforcement learning,
ensemble learning, learning decision trees; Artificial Neural networks; Expert Systems; Machine
Learning; Natural language processing.

VFSTR 160
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Write a PROLOG program to implement Vacuum Cleaner Agent.

2. Write a PROLOG program to implement BFS, DFS.
3. Writea PROLOG program to implement 8-Puzzle problem using A* algorithm.
4. Write a PROLOG program to implement n queens problem.
5. Write a PROLOG program to implement MIN-MAX algorithm.
6. Write a PROLOG program to represent simple fact for a statement.
7. Write a PROLOG program to represent a graph and apply BFS on it.
8. Write a PROLOG program for backward and forward reasoning.
9. Write a PROLOG program containing facts related to following predicates
Location (city, state)
Stays (person, city)
Display: (i) list of persons, state and city (ii) Given person, find the state in which he is
staying.
10. Write a PROLOG program that answers about family members and relationships. Include
predicates & clauses which define sister, brother, father, mother, Grandchild, grandfather
and uncle. The program should be able to answer question such as following.
a. Father (X, bob)
b. Grandson (X, Y)
c. Uncle (bill, Sue)
d. Mother (marry, X)
11. Write a PROLOG program to implement an inductive learning algorithm for decision
trees.

TEXT BOOKS:
1. Stewart Russell and Peter Norvig, “Artificial Intelligence-A Modern Approach”, 3rd edition,
Pearson Education/ Prentice Hall, 2010.
2. Ivan Bratko, “Prolog Programming for Artificial Intelligence”, 4th edition, Addison Wesley,
2011.
3. Saroj Kaushik, “Logic And Prolog Programming”, 1ST edition, New Age International
Publishers, 2002.

REFERENCE BOOKS:
1. Elaine Rich, Kevin Knight and Shivashankar B Nair, “Artificial Intelligence” 3rd edition, Tata
MCGraw, 2013.
2. George F Luger, “Artificial Intelligence”5th edition, Pearson Education, 2009.
3. Dan W Patternson, “Introduction to Artificial Intelligence and Expert systems”, 2nd edition,
PHI learning, 2005.

VFSTR 161
 Electives

VFSTR 162
 19CS337 CLOUD COMPUTING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 0 2 4 45 - 30 5 5 30 20 5 5

SOURCE:
https://www.morl
ingglobal.in/
PREREQUISITE COURSES: Operating Systems: Computer Networks.

COURSE DESCRIPTION AND OBJECTIVES:

This course deals with computing model, which enables information, software, and shared
resources to be provisioned over the network as services in an on-demand manner. The
objective of this course is to enable the student to understand parallel and distributed computing,
virtualization, architecture of cloud, aneka, task programming.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyze the trade-offs among deploying of applications in the 2

cloud and the local infrastructure.

2 Evaluate the concepts of various virtualization technologies. 4

3 Deploy applications over commercial cloud computing infrastructures. 5

4 Identify security and privacy issues in cloud computing. 6, 8

SKILLS:
9 Gain knowledge of different types of Cloud Service Providers.

9 Explore basic design issues of Cloud Applications.

9 Compare & evaluate the optimum costs in the data transmissions.

VFSTR 163
 Electives

UNIT– I L- 9
INTRODUCTION: Definition, Historical developments, Computing platforms and technologies.

PRINCIPLES OF PARALLEL AND DISTRIBUTED COMPUTING: Parallel versus distributed computing,

Elements of parallel computing, Elements of distributed computing, Technologies for distributed
computing.

UNIT – II L- 9
VIRTUALIZATION: Introduction, Characteristics, Virtualization techniques, Virtualization and cloud
computing, Pros. and cons. of virtualization, Technology examples.

CLOUD COMPUTING ARCHITECTURE: Introduction, Cloud reference model, Types of clouds,

Economics of clouds, Open challenges.

UNIT – III L- 9
ANEKA: Cloud application platform, Framework overview, Anatomy of the Aneka container, Building
Aneka clouds, Cloud programming and management.

HIGH THROUGHPUT COMPUTING- TASK PROGRAMMING: Task computing, Task - based

application models, Aneka task - based programming.

UNIT – IV L- 9
CLOUD PLATFORMS IN INDUSTRY: Amazon web Services, Google app engine, Microsoft Azure.
CLOUD APPLICATIONS: Scientific applications in healthcare, biology, geo-science; Business
applications in– CRM and ERP, productivity, social networking, media applications, multiplayer online
gaming.

UNIT - V L- 9
ADVANCED TOPICS IN CLOUD COMPUTING: Energy efficiency in clouds, Market based management
of clouds, Federated clouds / Inter Cloud, Third party cloud services.

VFSTR 164
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Launch Amazon Linux EC2 Instance and connect windows client to it.
2. Launch Windows EC2 instance in AWS and connect windows client to it..
3. Configure Web Server on Amazon Linux instance with Elastic IP.
4. Manage Elastic Block Storage (EBS).
5. Configure Amazon Simple Storage Service (Amazon s3).
6. Configure Amazon S3 Glacier.
7. Configure Amazon EFS.
8. Configure Amazon Virtual Private Cloud (VPC).
a) Create your own VPC.
b) Create public subnet.
c) Create private subnet.
d) Create a Internet gateway and attach to your VPC.
e) Create Pubic Routing Table, associate subnet and add routing rules.
f) Create Private Routing Table, associate subnet and add routing Rules.
g) To launch Windows instance in Public subnet.
9. Configure Amazon Elastic Load Balancer.
10. Configure Relational Database Service (RDS).

TEXT BOOK:
1. Raj Kumar Buyya, C Vecchiola and S TSelvi , “Mastering Cloud Computing”, 1st edition,
Tata McGraw Hill Education (India), 2013.

REFERENCE BOOKS:
1. RajKumar Buyya, Broberg J and GoscinskiA, “Cloud Computing - Principles and
Paradigms”, 1st edition, Wiley, 2011.
2. Rittinghouse J W, and Ransome J F, “Cloud Computing - Implementation, Management,
and Security”, 1st edition, CRC Press, 2009.
3. Michael Wittig and Andreas Wittig, “Amazon Web Services in Action”, 2nd edition, Manning
Publications, 2015.

VFSTR 165
 Electives

VFSTR 166
 19CS332 EMBEDDED SYSTEMS

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source:
https://
5.imimg.com/

PREREQUISITE COURSES: Operating Systems; Computer Organization.

COURSE DESCRIPTION AND OBJECTIVES:

This course emphasizes on comprehensive treatment of embedded hardware and real time
operating systems along with case studies, in tune with the requirements of Industry. The
objective of this course is to enable the students to understand embedded-system programming
and apply that knowledge to design and develop embedded solutions.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the concept of embedded system, microcontroller 1

and Real-time operating system.

2 Differentiate various components of microcontroller and their 2

interactions.

3 Make use of programming environment in ARM to develop 3,10,12

embedded solutions.

4 Deployment of embedded software into target system. Graph 3,5

based problems.

SKILLS:
9 Programming the ARM processors.

9 Design of microcontroller based embedded system.

9 Interface of various peripherals with ARM processors.

9 Expertise in writing multiple tasks under RTOS environment.

9 Handle shared data issues in RTOS environment.

VFSTR 167
 Electives

UNIT– I L- 8
INTRODUCTION TO EMBEDDED SYSTEMS: Definition; Applications of ES; Embedded hardware
units and devices; Embedded Software; Design process - design metrics in ES, challenges in ES
design.

UNIT – II L- 10
ARCHITECTURE OF 8051: 8051 Micro controller hardware; Input/output ports and circuits; External
memory; Counter and timers; Serial data input/output; Interrupts.

UNIT – III L- 9
ARM- EMBEDDED PROCESSOR: History; Architecture; Interrupt vector; Programming the ARM -
ARM assembly language; Instruction set, Conditional execution; Arithmetic and logical compare.

UNIT – IV L- 10
ARM PROGRAMMING: Assembly programming; General structure of assembly language; Writing
programs; Branch instructions; Loading constrains; Load and store instructions; Read-only and read/
write memory; Multiple register load and store.

UNIT - V L- 8
REAL TIME OPERATING SYSTEMS: RTOS introduction; Tasks and task states; Tasks and data;
Reentrancy; Semaphores and shared data; Embedded software development tools - host and target
machines, linker/locators for embedded software, getting embedded software into the target system.

VFSTR 168
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Write a program to:
a. implement arithmetic and logical operations.
b. perform control operations.
c. find sum of n natural numbers.
d. evaluate the value of the given series.
e. count 0’s and 1’s in a given register.
f. perform 24-bit shift.
g. arrange values of n registers in ascending and descending order.
2. Identify the status of switches using I/O interface.
3. Write a program for serial communication.
4. Write a program for encryption/ decryption.
5. Write a program to process the data provided by the sensors using 8051 and display
thedata on PC monitor.
6. Port RTOS (MuCOS) on to 89C51 board and verify.
7. 4-digit, 7-segment LED display on ESA MCB 51.
8. Stepper motor on ESA MCB 51.
9. Traffic lights on ESA MCB 51.
10. Simulate an elevator movement using RTOS on 89C51 board.
11. Familiarization of ARM programming model using ARM kit.
12. Take parallel input from port P1 convert it into serial and send it via PO.

TEXT BOOKS:
1. Raj Kamal, “Embedded Systems”, Tata McGraw Hill, 2nd edition, 2009.
2. Lyla B Das, “Embedded Systems an Integrated Approach”, Pearson Education,
1st edition, 2012.
3. David E. Simon, “An Embedded Software Primer”, Pearson Education,1st edition, 2008.

REFERENCE BOOKS:
1. Wayne Wolf, “Computers as Components-Principles of Embedded Computer System
Design”, Elseveir, 1st edition, 2009.
2. Labrosse, “Embedding System Building Blocks”, 2nd edition, CMP Publishers, 2007.

VFSTR 169
 Electives

VFSTR 170
 19CS336 NETWORK PROGRAMMING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source:
http://docs.
idris-lang.org/
PREREQUISITE COURSE: Computer Networks.

COURSE DESCRIPTION AND OBJECTIVES:

This course will cover the practical aspects of computer network programming, with emphasis
on the Internet. The goal of this course is to introduce the students to the basics of computer
networks and Internet programming.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Identify the various standards of networking models to express 1

the mathematical properties.

2 Develop the underlying Inter Process Communication and Remote 2

Login.

3 Identify different protocols of each OSI layer. 3

4 Compare the conventional sockets with UDP sockets process. 4

5 Analyse TCP Client and Server process code concepts with I/O 3
Multiplexing and sockets Operations.

SKILLS:
9 Establish local area networks with different topologies.

9 Evaluate various routing protocols.

9 Concentrate on Unix Inter Process Communication.

9 Network trouble shooting such as installing network interface card drivers, setting
IP addresses, and subnet masking etc.

9 Apache web server administration.

VFSTR 171
 Electives

UNIT– I L- 9
INTRODUCTION TO NETWORK PROGRAMMING: OSI model, Unix standards, TCP and UDP, TCP
connection establishment and format, Buffer sizes and limitation, Standard internet services, Protocol
usage by common internet application.

UNIT – II L- 9
SOCKETS: Address structures, Value - result arguments, byte ordering and manipulation function
and related functions; Elementary TCP sockets - socket, connect, bind, listen, accept, fork and exec
function, concurrent servers; Close function and related function.
TCP client server: Introduction, TCP Echo server functions, Normal start-up, terminate and signal
handling server process termination, Crashing and rebooting of server host, shutdown of server
host.

UNIT – III L- 9
I/O MULTIPLEXING AND SOCKET OPTIONS: I/O Models, Select function, Batch input, Shutdown
function, Poll function, TCP Echo server - getsockopt and setsockopt functions; Socket states, Generic
socket option, IPV6 socket option, ICMPV6 socket option, IPV6 socket option and TCP socket options.

UNIT – IV L- 9
ELEMENTARY UDP SOCKETS: Introduction UDP Echo server function, Lost datagram, Summary of
UDP example, Lack of flow control with UDP, Determining outgoing interface with UDP; Elementary
name and address conversions - DNS, get host by name function, resolver option, function and IPV6
support, uname function, other networking information.

UNIT - V L- 9
IPC: Introduction, File and record locking, Pipes, FIFOs streams and messages, Name spaces, System
IPC, Message queues, Semaphores; Remote login - terminal line disciplines, pseudo-terminals, terminal
modes, control terminals, rlogin overview, RPC transparency Issues.

VFSTR 172
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Implement the following forms of IPC.
a) Pipes b) FIFO
2. Implement file transfer using Message Queue form of IPC.
3. Write a Program to create an integer variable using Shared Memory concept and
increment the variable simultaneously by two processes. Use Semaphores to avoid Race
conditions.
4. Design TCP iterative Client - Server application to reverse the given input sentence.
5. Design TCP concurrent Client - Server application to reverse the given input sentence.
6. Design TCP Client - Server application to transfer file.
7. Design a TCP concurrent Server to convert a given text into upper case using multiplexing
system call “select”.
8. Design a TCP concurrent Server to echo given set of sentences using Poll functions.
9. Design UDP Client - Server application to reverse the given input sentence.
10. Design UDP Client Server application to transfer a file.
11. Design using Poll Client Server application to multiplex TCP and UDP requests for
converting a given text into upper case.
12. RPC application to add and subtract a given pair of integers.

TEXT BOOKS:
1. W R Stevens, “Unix Network Programming, Inter Process Communication”, 2nd edition,
Prentice Hall of India/Pearson, 2014.
2. W R Stevens, “Unix Network Programming, the Sockets Networking API”, 3rd edition,
Prentice Hall of India/Pearson, 2012.
3. Andrew S Tanenbaum, “Computer Networks”, 5th edition. Pearson Education, 2014.

REFERENCE BOOKS:
1. N Matthew, R Stones and Wrox, “Beginning Linux Programming”, 4th edition, Wiley India,
2008.
2. Robert Love, “Linux System Programming”, 2nd edition, O’Reilly, 2013.
3. Graham Glass and King Ables, “Unix for Programmers and Users”, 3rd edition, Pearson
Education, 2003.

VFSTR 173
 Electives

VFSTR 174
 19CS334 FUNDAMENTALS OF IMAGE
PROCESSING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 0 2 4 45 - 30 5 5 30 20 5 5

Source:
http://www.
e2matrix.com/
PRE-REQUISITE COURSES : Engineering Mathematics; Probability and Statistics.

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on imparting knowledge about the aspects of Image Processing and its
applications. The main objective of the course is to learn digital image fundamentals, image
transforms, image enhancement, restoration and compression, morphological image processing,
representation and description.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply various compression techniques to reduce image size and 1

morphological operations to extract features.

2 Analyse images in the frequency domain using various 2

transforms.

3 Evaluate the techniques for image enhancement and image

restoration. 4

4 Interpret Image compression standards, segmentation and 4

representation techniques.

SKILLS:
9 Apply knowledge of science and engineering principles to image related
problems.

9 Undertake image problem identification and formulate solutions.

VFSTR 175
 Electives

UNIT– I L- 9
FUNDAMENTALS OF IMAGE PROCESSING: Fundamental steps in digital image processing,
Components of image processing system, A simple image formation model, Image sampling and
quantization, Basic relationships between pixels, Introduction to Fourier Transform and DFT – properties
of 2D Fourier Transform, FFT.

UNIT – II L- 9
IMAGE ENHANCEMENT IN THE SPATIAL AND FREQUENCY DOMAINS: Basic gray - level
transformations, Histogram processing, Basics of spatial filtering, Smoothing spatial filters, Sharpening
spatial filters, The basics of filtering in the frequency domain, Image smoothing in frequency domain
filters, Image sharpening in frequency domain filters.

UNIT – III L- 9
IMAGE SEGMENTATION: Fundamentals, Point, Line and edge detection, Thresholding, Region-based
segmentation, Segmentation using morphological watersheds, The use of motion in segmentation.

UNIT – IV L- 9
IMAGE COMPRESSION: Fundamentals, Huffman coding, Golomb coding, LZW coding, Run-length
coding, Bit-plane coding, Block transform coding, Predictive coding, Wavelet coding, Image compression
standards.

UNIT - V L- 9
MORPHOLOGICAL IMAGE PROCESSING: Erosion, Dilation, Opening, Closing, The hit-or-miss
transformation; Basic morphological algorithms - boundary extraction, hole filling, extraction of connected
components, thinning, thickening, skeletons, pruning.

Representation and description: Chain codes, Polygonal approximation, Signature, Boundary

segments, Skeletons, Boundary descriptors, Regional descriptors.

VFSTR 176
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Program to enhance image using image arithmetic and logical operations.
2. Program for an image enhancement using pixel operation.
3. Program for gray level slicing with and without background.
4. Program for image enhancement using histogram equalization.
5. Program to filter an image using averaging low pass filter in spatial domain and
median filter.
6. Program to sharpen an image using 2-D laplacian high pass filter in spatial domain.
7. Program for detecting edges in an image using Roberts cross gradient operator and sobel
operator.
8. Program for smooth an image using low pass filter in frequency domain.
(Butterworth lpf).
9. Program for smooth an image using high pass filter in frequency domain.
(Butterworth hpf).
10. Program for morphological image operations-erosion, dilation, opening & closing.
11. Program for image compression.
12. Program for image restoration.
13. Program for image segmentation.

TEXT BOOK:
1. Rafeal C Gonzalez and Richard E.Woods, “Digital Image Processing”, 3rd edition, Pearson
Education/ PHI, 2008.

REFERENCE BOOKS:
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and Machine
Vision”, 4th edition, Cengage, 2015.
2. Alasdair McAndrew, “Introduction to Digital Image Processing with Matlab”, Thomson
Course Technology, 2004 Course Technology Press, Boston, MA, United States, 2004.
3. William K. Prat, “Digital Image Processing”, 4th edition, Wiley-Interscience, A John Wiley &
Sons, Inc., Publication, 2007.

VFSTR 177
 Electives

VFSTR 178
 19CS338 ADVANCED DATA MINING

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 0 2 4 45 - 30 5 5 30 20 5 5

source:
https://pdi.fbk.eu/

COURSE DESCRIPTION AND OBJECTIVES:

This course enables the students with the advanced data mining techniques such as semi-
supervised learning, web mining, social network mining and time series analysis. This course
includes both theoretical and sill components. The theoretical part shares the methodological
and algorithmic knowledge. Whereas the skill part encompasses with data analytics aids to
solve real world problems.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Comprehend advanced Data Mining paradigms in semi-super 1

vised learning.

2 Analyze the algorithmic constructs in web and sentiment mining. 2

3 Apply the advanced data mining techniques for crucial decision 1

making.

4 Investigate the extracted patterns for web usage mining. 4

5 Evaluate the performance of data mining models on various kinds 4

of data.

SKILLS:

9 Pre process the given data.

9 Find the correlation among the attributes.

9 Apply classification, association rule mining and clustering algorithms on data.

9 Evaluate the classification and clustering methods performance.

VFSTR 179
 Electives

UNIT– I L- 9
SEMI-SUPERVISED LEARNING: Learning from labeled and unlabeled Examples, EM algorithm
with naïve bayesian classification; Co-training; Self-training; Transductive support Vector Machines;
Graph-based methods; Learning from positive and unlabeled examples, Applications of PU learning,
Theoretical foundation; Building classifiers-two-step approach; Building classifiers; Biased-SVM,
Building classifiers: Probability estimation.

UNIT – II L- 10
WEB MINING: Text pre-processing, Basic concepts of information retrieval, Information retrieval models;
Relevance feedback, Evaluation measures, Text and Web page pre-processing, Inverted Index and
Its compression, Latent Semantic indexing, Web Search, Meta-Search, Web Spamming.

UNIT – III L- 8
SOCIAL NETWORK ANALYSIS AND OPINION, SENTIMENT MINING: Social Network Analysis, Co-
citation and bibliographic coupling, PageRank, HITS, Community discovery, Opinion mining and
sentiment analysis, The problem of opinion mining, Document sentiment classification, Sentence
subjectivity and sentiment classification, Aspect-based opinion mining.

UNIT – IV L- 8
WEB USAGE MINING: Web usage mining - data collection and pre-processing; Data modeling for
Web usage Client - Server mining; Discovery and analysis of web usage patterns; Recommender
systems and collaborative filtering; Query log mining.

UNIT - V L- 10
TIME SERIES ANALYSIS: Time series regression and exploratory data analysis, ARIMA models,
Spectral analysis and filtering.

VFSTR 180
 LABORATORY OF EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

The Students pursue the following experiments by using the open source analytical tools such as R,
Python, Weka, Rapid Miner etc. The following experiments enable the students to gain expertise in
the fields of Natural Language Processing, Web Mining and Time Series Mining. Students experiment
the following on UCI/ Kaggle/ NCBI data repository.
1) Classification on the following datasets with limited labels.
a) Frauds and faults. b) Health care data.
2) Perform POS tagging, Named entity recognition (NER) and text summarization on news
articles data.
3) Develop a recommender system to detect top K Communities in a social network
community data.
4) Perform sentiment analysis/ opinion mining on twitter Data.
5) Demonstration of intrusion detection.
6) Extract hidden patterns by analyzing ECG and EEG datasets.
7) Develop a recommender system for the following:
a) Finding of top trending movies b) Analysis of health care data.
8) Prediction on growth of a share value in a Stack exchange data.

TEXT BOOKS:
1. Bing Liu, “Web Data Mining”, 2nd edition, Spinger, 2011.
2. Robert H. Shumway and David S. Stoffer, “Time series Analysis and Its Applications
with R examples”, 4th edition, Springer, 2011.

REFERENCE BOOKS:
1. Jiawei Han, Micheline Kamber and Jian Pei, “Data Mining: Concepts and Techniques”,
3rd edition, Morgan Kaufmann Publishers, 2011.
2. Bing Liu, “Sentiment Analysis and Opinion Mining”, 2nd edition, Morgan & Claypool
Publishers, 2012,
3. Jure Leskovec, Anand Raja Raman and Jeffrey D Ullman, “Mining of Massive Datasets”,
5th edition, Stanford University, 2014.

VFSTR 181
 Electives

VFSTR 182
 19IT431 MULTIMEDIA COMPUTING

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 30 5 20 5 5

SOURCE:
https://
www.amazon.com/
Multim edia-
COURSE DESCRIPTION AND OBJECTIVES: Computing-Gerald-
Friedland-ebook/
To provide the foundation knowledge of multimedia computing, e.g. media characteristics, dp/B00KL8CDHO
compression standards, multimedia representation, data formats, multimedia technology
development.

COURSE OUTCOMES:

Upon completion of the course, the student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyze the characteristics of diffrent media:understand the 2

representations of diffrent multimedia data.

2 Different data formats; be able to take into considerations in 3

multimedia system designs.

3 Design techniques and implementation of multimedia. 2,3,5

4 Design and develop multimedia systems according to the 3,4

requirements of multimedia applications.

5 Develop Program multimedia data and be able to design and 2,3,6

implement media applications.

VFSTR 183
 Electives

UNIT–I L-9
FUNDAMENTAL CONCEPTS IN TEXT AND IMAGE: Multimedia and hypermedia, World wide web,
overview of multimedia software tools. Graphics and image data representation graphics/image
data types, file formats, Color in image and video-color science, color models in images, color
models in video.

UNIT–II L-9

FUNDAMENTAL CONCEPTS IN VIDEO AND DIGITAL AUDIO: Types of video signals, analog video,
digital video, digitization of sound, MIDI, quantization and transmission of audio.

UNIT–III L-9

MULTIMEDIA DATA COMPRESSION I: Lossless compression algorithm: Run-Length Coding, Variable

length Coding, Dictionary based coding, Arithmetic coding, Lossless Image compression,

UNIT–IV L-9

MULTIMEDIA DATA COMPRESSION II: Lossy compression algorithm: Quantization, Transform Coding,
Wavelet-Based Coding, Embedded Zerotree of Wavelet Coefficients Set Partitioning in Hierarchical
Trees (SPIHT).

UNIT–V L-9

BASIC VIDEO COMPRESSION TECHNIQUES: Introduction to video compression, Video Compression

based on motion compensation, search for motion vectors, MPEG, Basic audio compression
techniques.

VFSTR 184
 LABORATORY OF EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Animations including motions,shapes,mouse events
a. Moving object from one place to another place (motion).
b. Extending the object from one shape to another shape (shape).
c. Creating an object and working with mouse events.
d. Create the shadow of the Text.
2. Create an animation with following features
a. To represent the growing moon.
b. To indicate a ball bouncing on steps.
c. To stimulate movement of cloud.
d. To stimulate ball hitting another ball.
3. Text to shapes/number conversion
a. Create a text field and convert it to shapes.
b. Create a text field and display random numbers.
c. Create and animated cursor using StartTag.
d. Create a text field and display language, version and operating system.
4. Create a text field and make a motion tween as follows
a. Jumping of letters.
b. Applying alpha to letters.
c. Enlarging a text.
d. Practice section on motion tween.
5. Create the following by using adobe photoshop
a. Student ID Card.
b. Test book Cover Page.
c. Visiting card with atleast one graphic.
6. Create the following by using adobe photoshop
a. Adjust brightness and contrast of image.
b. Make some part of image black and white.
c. Extract the image.
7. Write an action script to display the given array and arrange them according to alphabetic
order.
8. Write an action script to display the given array and arrange them on reverse order.
9. Write an action script for drawing a rectangle in flash.
10. Design a Calculator.
11. Design a game/application in flash.
12. Convert BMP file to JPG file using any programming language.
13. Construction of website using pictures, videos, audio etc with proper layout in any language.

TEXT BOOK:
1. Ze-Nian Li and Mark S. Drew, “Fundamentals of Multimedia”, 2nd edition, Pearson Education,
2014.

REFERENCE BOOKS:

1. Nigel chapman and jenny chapman, “Digital Multimedia”, 3rd edition, Wiley-Dreamtech,
2009.

2. David Vogeleer and matheus Pizzi, “Macromedia Flash MX Professional Unleashed”,

1st edition, Pearson, 2004.

VFSTR 185
 Electives

VFSTR 186
 19CS333 OPEN SOURCE WEB
TECHNOLOGIES

Hours Per Week : Total Hours :

L T P C L T P CS WA/RA SSH SA S BS
3 - 2 4 45 - 30 5 5 30 20 5 5

source :
http://www. comval.in/

PREREQUISITE COURSES: Web Technologies; Database Management System.

COURSE DESCRIPTION AND OBJECTIVES:

This course introduces the concepts pertaining to open source technologies such as LINUX,
MySQL, PHP, Apache web server and various other tools used to develop web applications.
The objective of this course is to offer insight into various open source technologies to develop
web applications.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

COs Course Outcomes POs

1 Analyze various open source and commercial products. 2

2 Design dynamic web pages, Web services using PHP. 3

3 Apply HTML5 tags for web page design. 1

4 Develop web based applications. 3

SKILLS:

9 Develop web applications using open source technologies.

9 Develop web applications for Linux.

9 Generate dynamic contents using PHP programming language.

9 Design and develop database oriented application using PHP and MySQL.

9 Apache web server administration.

VFSTR 187
 Electives

UNIT– I L- 9
OPEN SOURCE: Introduction, Open source operating System, Nature of open sources, Advantages,
Application of open sources.

Open Source Programming Languages: Introduction to dynamic web content, Setting up a

development server, Introduction to PHP, Expressions and control flow in PHP, PHP functions and
Objects, PHP arrays, Practical PHP.

UNIT – II L- 9
OPEN SOURCE DATABASE: Introduction to MySQL, Mastering MySQL, Accessing MySQL using
PHP-querying a MySQL database with PHP, Practical MySQL, Preventing hacking attempts, Using
MySQL procedure.

UNIT – III L- 9
FORM HANDLING: Form Handling building forms, Retrieving submitted data, An example program,
Cookies, Sessions and authentication using cookies in PHP, HTTP authentication, Using sessions.

UNIT – IV L- 9
HTML5: Introduction to HTML5, The HTML5 Canvas, HTML5 audio and video, Bringing it all together-
designing a social networking site.

UNIT - V L- 9
ANGULAR JS: The basics of AngularJS, Introduction MVC, Filters and modules, Directives, Working
with forms, Services and server communication, Organizing views, Angular JS animation, Deployment
considerations.

VFSTR 188
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Study of LINUX operating system and Web Servers in detail.
2. Write a PHP program:
a. To print Hello World.
b. To add two numbers.
c. To Swap two numbers.
d. To print Even and Odd Numbers.
3. Write a PHP program:
a. To print factorial of a number.
b. To print Armstrong number.
c. To print Palindrome.
d. To print Prime numbers.
e. To print Fibonacci numbers.
f. To print Reverse of a number and String.
g. To print Table.
4. Write a PHP program to perform PHP string methods.
5. Write a PHP program to perform user defined functions and arrays.
6. Write a PHP program to create user registration form and include validations.
7. Write a PHP program to demonstrate using COOKIES and SESSIONS using forms.
8. Write a PHP program to demonstrate data manipulation using PHP & MySQL.
9. Write a PHP program to demonstrate data manipulation using PHP & MySQL.
10. Develop a Social Networking site with security options.
11. Develop a Search Engine (use MySQL as backend, HTML5 as a frontend and PHP as a
middleware).
12. Develop a web application using AngularJS.

TEXT BOOKS:
1. Robin Nixon, “Learning PHP, MySQL & JavaScript WITH JQUERY, CSS & HTML5”,
4th edition, O’Reilly, 2015.
2. Andrew Grant, “Beginning Angular JS”, 1st edition, Apress, 2014.

REFERENCE BOOKS:
1. Steve Prettyman, “Learn PHP 7 Object Oriented Modular Programming using HTML5,
CSS3, JavaScript, XML, JSON, and MySQL”, 1st edition, Apress, 2015.
2. Adrian W. West and Steve Prettyman, “Practical PHP 7, MySQL 8, and MariaDB Website
Databases: A Simplified Approach to Developing Database-Driven Websites”, 1st edition, A
Press, 2018.

VFSTR 189
 Electives

VFSTR 190
 19IT438 MACHINE LEARNING

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 30 - 10 15 - - - -

source:
https://
www.healthc
COURSE DESCRIPTION AND OBJECTIVES: atalyst.com/

This course provides a broad introduction to machine learning, datamining, and statistical
pattern recognition. Topics include(i) Supervised learning (parametric/non-parametric
algorithms, support vector machines, kernels, neural networks). (ii) Unsupervised learning
(clustering, dimensionality reduction, recommender systems, deep learning). (iii) Best practices
in machine learning (bias/variance theory; innovation process in machine learning and AI).
The course will also draw from numerous case studies and applications, so that students’ can
also learn how to apply learning algorithms to build smart robots (perception, control), text
understanding (web search, anti-spam), computer vision, medical informatics, audio, database
mining, and other areas.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Apply a wide variety of learning algorithms such as supervised 2

and unsupervised on different kinds of data.

2 Analyze the performance of parametric and non-metric approaches 3

on different kinds of data.

3 Evaluation of different learning algorithms and model selection. 4

4 Design/Construct a model to realize the solutions for real-world 5

problems.

SKILLS:
9 Implement symmetric and asymmetric encryption techniques.

9 Identify the appropriate firewall, password management and anti-virus models for
specific applications.

VFSTR 191
 Electives

UNIT – I L- 9
INTRODUCTION- What is machine learning?; Examples of machine learning applications; Learning
associations; Classification; Regression; Unsupervised learning; Reinforcement learning.

SUPERVISED LEARNING- Learning a class from examples; Vapnik-Chervonenkis (VC) dimension;

Probably approximately correct (PAC) learning; Noise, learning multiple classes; Regression; Model
selection and generalization; Dimensions of a supervised machine learning algorithm.

UNIT – II L- 9
BAYESIAN DECISION THEORY: Introduction; Classification; Losses and risks; Discriminant functions;
Association rules.

PARAMETRIC METHODS: Maximum likelihood estimation; Bernoulli density; Multinomial density;

gaussian (normal) density; Evaluating an estimator; Bias and variance.

THE BAYES’ ESTIMATOR: Parametric classification; Regression; Tuning model complexity; Bias/
variance dilemma; Model selection procedures.

UNIT – III L- 9
MULTIVARIATE METHODS: Multivariate data; Parameter estimation; Estimation of missing values
multivariate normal distribution; Multivariate classification; Tuning complexity; Discrete features;
multivariate regression.

DIMENSIONALITY REDUCTION: Subset selection; Principal components analysis; Feature

embedding; Factor analysis; Singular value decomposition and matrix factorization; Multidimensional
scaling; Linear discriminant analysis.

UNIT – IV L- 9
CLUSTERING: Mixture densities; Expectation-maximization algorithm; Mixtures of latent variable
models; Supervised learning after clustering; Spectral clustering; Hierarchical clustering.

NONPARAMETRIC METHODS: Nonparametric density estimation; Histogram estimator; Kernel

esnimator; k-nearest neighbor estimator; Generalization to multivariate data; Nonparametric
classification; condensed nearest neighbor; Nonparametric regression; Smoothing models; Running
mean smoother; Kernel smoother; Running line smoother; How to choose the smoothing parameter.

UNIT - V L- 9
LINEAR DISCRIMINATION : Generalizing the linear model; Geometry of the linear discriminant; Two
classes; Multiple classes; Pairwise separation; Parametric discrimination revisited; Gradient descent;
Logistic discrimination; Two classes; Multiple classes; Discrimination by regression.

MULTILAYER PERCEPTRON: Understanding the brain; Neural networks as a paradigm for parallel
processing; The perceptron; Training a perceptron; Learning boolean functions; Multilayer perceptrons;
As a universal approximator; Backpropagation algorithm; Nonlinear regression; Two-class
discrimination; Multiclass discrimination; Multiple hidden layers; Training procedures; Improving
convergence; Overtraining; Structuring the network.

VFSTR 192
 LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Implement and demon stratethe FIND-Salgorithm for finding the most specifichypothesis based
on a given set of training data samples. Read the training data from a.CSV file.

2. For a given set of training data examples stored in a .CSV file, implement anddemonstrate the
Candidate-Elimination algorithm to output a description of the setof all hypotheses consistent
with the training examples.

3. Write a program to demonstrate the working of the decision tree based ID3algorithm. Use an
appropriate data set for building the decision tree and apply thisknowledge toclassify a new sample.

4. Build an Artificial Neural Network by implementing the Back propagation algorithm and test the
same using appropriate data sets.

5. Write a program to implement the naïve Bayesian classifier for a sample trainingdata set stored
as a .CSV file. Compute the accuracy of the classifier, considering fewtest data sets.

6. Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier
model to perform this task. Built-in Java classes/API can be used to writethe program. Calculate
the accuracy, precision, and recall for your data set.

7. Write a program to construct a Bayesian network considering medical data. Use thismodel to
demonstrate the diagnosis of heart patients using standard Heart DiseaseData Set. You can use
Java/Python ML library classes/API.

8. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same dataset for clustering
using k-Means algorithm. Compare the results of these twoalgorithms and comment on the quality
of clustering. You can add Java/Python MLlibrary classes/API in the program.

9. Write a program to implement k-Nearest Neighbour algorithm to classify the irisdata set. Print
both correct and wrong predictions. Java/Python ML library classes canbe used for this problem.

10. Implement the non-parametric Locally Weighted Regression algorithm in order tofit data points.
Select appropriate data set for your experiment and draw graphs.

TEXT BOOK:
1. Ethem Alpaydin, “Introduction to Machine Learning”, 3rd edition, The MIT Press, 2014.

REFERENCE BOOKS:
1. Tom M Mitchell, “Machine Learning”, 1st edition, McGraw Hill.
2. Shai Shalev Shwartz and Shai Ben David, “Understanding Machine Learning: From
Theory to Algorithms”, Cambridge University Press, 2010.
3. Aurélien Géron, “Hands-on Machine Learning with Scikit Learn and Tensor Flow”, O’reilly,
2017.

VFSTR 193
 Electives

VFSTR 194
 19IT432 BLOCK CHAIN TECHNOLOGY

Hours Per Week : Total Hours :

L T P C L T P WA/RA SSH/HSH CS SA S BS
3 - 2 4 45 - 30 5 30 5 20 5 5

SOURCE:
https://
www.ivedix.com/the-
enormous-potential-of-
PRE-REQUISITE COURSES: Programming for Problem Solving-I,II; Data Structures. blockchain-technology/
COURSE DESCRIPTION AND OBJECTIVES :
This course gives an overview of BVitcoin and cryptocurrencies.The objective of this course is to
enable students to learn new concepts in Block chain technology and its applications.

COURSE OUTCOMES:
Upon completion of the course, student will able to achieve the following outcomes:

COs Course Outcomes POs

1 Understand the basic concepts of Bitcoin and cryptocurrencies 1

in Block chain technology.

2 Analyze and differentiate various types of Block chain technologies. 2,3

3 Demonstrate the process of interacting with a contract using mist 2,3,5,6

wallet, smart contract examples, smart contract patterns.

4 Examine the key components Consensus on Block chain 3,5

network and Mining

SKILLS:
9 Design real time block chain for relevant application area.

9 Analyze the challenges in the block chain technology.

9 Devlop the block chain using open source framework.

VFSTR 195
 Electives

UNIT – I L-9
BLOCK CHAIN CONCEPTS: Block chain evolution, Block chain structure, Block chain characteristics,
Block chain application example, Block chain stack, From web 2.0 to the next generation decentralized
web, Domain specific Block chain applications, Block chain benefits and challenges.

UNIT – II L-9
BLOCK CHAIN APPLICATION TEMPLATES: Block chain application components, Design
methodologies for block chain applications. Block chain components and applications: Ethereum clients,
Ethereum languages, Test RPC. Mist ethereum wallet, Meta mask, Web3 java script API, Truffle.

UNIT – III L-9

ETHEREUM ACCOUNTS: Ethereum Accounts, key pairs, working with EOA accounts, working with
contract accounts.

UNIT – IV L-9
SMART CONTRACTS: Smart contract, structure of a contract, Setting up and interacting with a contract
using geth client, Setting up and interacting with a contract using mist wallet, Smart contract examples,
Smart contract patterns.

UNIT – V L-9
MINING: Consensus on Block chain network, Mining, Block validation, Setting up mining node, State
storage in Ethereum.
Whisper: Whisper protocol, Whisper routing approaches, Whisper API.

LABORATORY EXPERIMENTS

LIST OF EXPERIMENTS TOTAL HOURS: 30

1. Basic Cryptographic primitives used in Blockchain – Secu re, Collison-resistant hash
functions, digital signature, public key cryptosystems, zero-knowledge proof systems.
2. Basic Distributed System concepts – distributed consensus and atomic broadcast,
Byzantine fault-tolerant consensus methods.
3. Basic Blockchain (Blockchain 1.0) – concepts germane to Bitcoin and contemporary proof-
of-work based consensus mechanisms, operations of Bitcoin blockchain, crypto-currency
as application of blockchain technology.
4. Blockchain 2.0 – Blockchains with smart contracts and Turing complete blockchain
scripting – issues of correctness and verifiability, Ethereum platform and its smart contract
mechanism.
5. Blockchain 3.0 – Plug-and-play mechanisms for consensus and smart contract evaluation
engines, Hyperledger fabric platform.
6. Beyond Cryptocurrency – applications of blockchain in cyber security, integrity of
information, E-Governance and other contract enforcement mechanisms.
7. Limitations of blockchain as a technology, and myths vs. reality of blockchain technology.

TEXT BOOK:
1. Arshdeep Bahga and Vijay Madisett, “Block Chain Applications A Hands-on Approach,”
1st edition, VPT, 2017.

REFERENCE BOOKS:
1. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder,
“Bitcoin and Cryptocurrency Technologies”, 1st edition, Princeton University Press, 2016.
2. Andreas Antonopoulos and Gavin Wood, “Mastering Ethereum”, 1st edition, Oreilly
Publications, 2018.

VFSTR 196