Department of Computer Science and Engineering

CURRICULUM AND SYLLABUS

(2020-2024)
B.Tech. Computer Science and Engineering
Computer Science and Engineering

B.Tech. (CSE)

CURRICULUM AND SYLLABUS

Vision Statement of University
Be an internationally acclaimed University recognised for its excellent teaching, research, innovation,
outreach and creating top class technocrats and professionals who can serve the mankind as multi
skilled global citizen.
Mission Statement of University
 Establish state-of-the-art facilities for world class education and research.
 Conduct scholarly research and creative endeavours that impact quality of life.
 Attract quality staff and students to cater for diverse needs and preferences and widen
participation.
 Build a foundation for students to be successful at all levels through high-quality, innovative
programs.
 Collaborate with institute, industry, and society to address current issues through research and
align curriculum.
 Involve in societal outreach programs to identify concerns and provide sustainable ethical
solutions.
 Encourage life-long learning and team-based problem solving through an enabling
environment.
Vision of the Department:
Inculcate the innovative thinking in Computer Science and Engineering graduates with domain
knowledge and skills to address contemporary industrial and social requirements.
Mission of the Department:
1. Provide an environment to the students to learn with passion and equip with proper skill set to
address current problems.
2. Provide maximum exposure to innovative techniques available to cater industrial needs by
maintain the best Industry- Academia relation.
3. Imparting best problem-solving strategies in students to work in a team.
4. Develop leadership qualities in Computer Science graduates to work for the society.
5. Attract experienced and expert faculty members and create an enthusiastic academic
environment.
 Department of Computer Science and Engineering

Program Education Objectives (PEOs)

PEO01 Provide strong theoretical foundations to work with cutting edge computing
technologies and design solutions to complex engineering problems to work in
any competitive environments.
PEO02 Impart skills such as team building, inter-personal skills, and leadership
qualities in order to effectively communicate with engineering community and
with society at large.
PEO03 Promote research culture through internships, industry trainings, research-
oriented projects, sponsored collaborative research and enable them to pursue
higher studies in computer and related fields.
PEO04 Create ethically strong, professionally, and globally competent employees and
entrepreneurs.
 Department of Computer Science and Engineering
PROGRAMME OUTCOMES (POs)
PO01
Engineering knowledge: Apply the knowledge of mathematics, science,
engineering, fundamentals, and an engineering specialization to the solution
PO02 Problem analysis: Identify, formulate, review, research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences
PO03 Design / development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
PO04 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.
PO05 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.
PO06 The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
PO07 Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate
the knowledge of, and need for sustainable development.
PO08 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO09 Individual and teamwork: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.

PO10 Communication: Communicate effectively on complex engineering activities

with the engineering community and with society at large, such as, being able
 to comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply these
to one’s own work, as a member and leader in a team, to manage projects and
in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for and have the preparation and ability
to engage in independent and life-long learning in the broadest context of
technological change.
 Department of Computer Science and Engineering

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO01 Ability to understand the principles and working of computer systems and a
good knowledge about the hardware and software aspects of computer systems.

PSO02 Ability to work in multidisciplinary teams in small- and large-scale projects by

utilizing modern software engineering tools and emerging technologies.

PSO03 Ability to design and develop computer programs and understand the structure
and development methodologies of software systems.
PSO04 Ability to apply their skills in the field of the specialization AI, Data Science,
Web Technology, Networking and Cloud Computing web design, cloud
computing and data analytics.
 Choice Base Credit System Scheme of B.Tech CSE (2020 Batch)

SEMESTER I
Sr.
Course Code Courses L T P Credit
No.
1 EN3BS01 Engineering Mathematics-I 3 1 0 4
2 EN3BS05 Engineering Physics 3 1 2 5
3 EN3ES01 Basic Civil Engineering 3 0 2 4
4 EN3ES03 Basic Mechanical Engineering 3 1 2 5
5 EN3ES05 Basic Computer Engineering 3 0 0 3
6 EN3ES07 Documentation and Presentation 0 0 2 1
7 EN3HS01 History of Science & Technology 2 0 0 2
8 EN3HS03 Environmental Sciences 2 0 0 2
Total 19 3 8 26
Total Contact Hours 30

SEMESTER II
Sr.
Course Code Courses L T P Credit
No.
1 EN3BS02 Engineering Mathematics-II 3 1 0 4
2 EN3BS04 Engineering Chemistry 3 0 2 4
3 EN3ES02 Engineering Graphics 3 0 2 4
4 EN3ES04 Basic Electrical & Electronics Engineering 3 1 2 5
5 EN3ES06 Computer Programming 2 0 2 3
6 EN3ES08 Engineering Workshop 0 0 2 1
7 EN3HS02 Communication Skills 2 0 2 3
Total 16 2 12 24
Total Contact Hours 30

SEMESTER – III
Sr.
Course Code Courses L T P Credit
No.
1 CS3BS03 Discrete Mathematics 3 1 0 4
2 CS3CO23 Object Oriented Programming 3 1 2 5
3 CS3CO21 Data Structures 3 1 2 5
4 CS3CO22 Computer System Architecture 3 1 2 5
5 CS3CO29 Digital Electronics 3 1 2 5
6 EN3MC09 Soft Skills-II 2 0 0 0
Total 17 5 8 24
Total Contact Hours 30
SEMESTER – IV
Sr.
Course Code Courses L T P Credit
No.
1 CS3EXXX Elective-1 3 0 0 3
2 CS3CO10 Theory of Computation 3 1 0 4
3 CS3CO28 Data Communication 3 0 0 3
4 CS3CO25 Database Management Systems 3 1 2 5
5 CS3CO08 Computer Programming - II 2 0 2 3
6 CS3CO09 Operating Systems 3 1 2 5
7 CS3ES12 Software Workshop-I 0 0 2 1
8 EN3MC01 Open Learning Courses 1 0 0 0
Total 18 3 8 24
Total Contact Hours 29

Scheme of B.Tech -Computer Science &Engineering 2020

SEMESTER – V
Sr.
Course Code Courses L T P Credit
No.
1 CS3CO24 Computer Graphics & Multimedia 3 1 2 5
2 CS3CO26 Software Engineering 3 1 2 5
3 CS3CO12 Computer Networks 3 1 2 5
4 OE000XX Open Elective-1 3 0 0 3
5 CS3EXXX Elective-2 3 0 0 3
6 EN3MC15 Universal Human Values & Professional Ethics 2 0 0 0
7 EN3MC10 Soft Skills-III 2 0 0 0
8 CS3ES13 Software Workshop-II 0 0 2 1
Total 19 3 8 22
Total Contact Hours 30

SEMESTER – VI
Sr.
Course Code Courses L T P Credit
No.
1 CS3CO13 Design and Analysis of Algorithms 3 1 2 5
2 CS3CO15 Object Oriented Analysis and Design 3 1 2 5
3 CS3CO27 Compiler Design 3 0 2 4
4 CS3EXXX Elective-3 3 0 0 3
5 CS3EXXX Elective-4 3 0 0 3
6 CS3ES14 Software Workshop-III 0 0 2 1
7 OE000XX Open Elective-2 3 0 0 3
Total 18 2 8 24
Total Contact Hours 28
Scheme of B.Tech -Computer Science &Engineering
SEMESTER – VII
Sr.
Course Code Courses L T P Credit
No.
1 CS3ELXX Elective-5 3 0 0 3
2 CS3ELXX Elective-6 3 0 0 3
3 OE000XX Open Elective-3 3 0 0 3
Fundamentals of Management, Economics &
4 EN3HS04 3 0 0 3
Accountancy
5 CS3PC01 Project Work I 0 0 8 4
6 CS3PC03 Industrial Training 0 2 0 2
Total 12 2 8 18
Total Contact Hours 22

SEMESTER VIII
Sr.
Course Code Courses L T P Credit
No.
1 CS3PC02 Project Work II 0 0 28 14
Total 0 0 28 14
Total Contact Hours 28

Total Credits 176

Summary of Credits 176

Credits as per
Total Credits
S.NO Course Work Modal
(CS)
scheme (176)
10-15% (18-
21
1 Basic Sciences (BS) 26)
15-20% (27-
29
2 Engineering Sciences (ES) 35)
3 Humanities and Social Sciences (HS) 10 5-10% (9-17)
30-40%(53-
69
4 Professional Subjects-Core (PC) 70)
10-15%(18-
18
5 Professional Subjects – Electives (PE) 26)
6 Open Subjects- Electives (OE) 9 5-10%(9-17)
10-15%(18-
20
7 Project Work, Seminar 26)
8 Mandatory Courses (MC) 7 Units 7 Units
176
SEMESTER I
Sr.
Course Code Courses L T P Credit
No.
1 EN3BS01 Engineering Mathematics-I 3 1 0 4
2 EN3BS05 Engineering Physics 3 1 2 5
3 EN3ES01 Basic Civil Engineering 3 0 2 4
4 EN3ES03 Basic Mechanical Engineering 3 1 2 5
5 EN3ES05 Basic Computer Engineering 3 0 0 3
6 EN3ES07 Documentation and Presentation 0 0 2 1
7 EN3HS01 History of Science & Technology 2 0 0 2
8 EN3HS03 Environmental Sciences 2 0 0 2
Total 19 3 8 26
Total Contact Hours 30
 Hours per Week Total
Course Code Course Name
L T P Hrs. Credits
EN3BS01 Engineering Mathematics-I 3 1 0 4 4

Course Learning Objectives (CLOs):

CLO01 To impart analytical ability using concepts of matrices in various fields of engineering

CLO02 To equip the students with the knowledge of Differential Calculus.

CLO03 To equip the students with the knowledge of Integral Calculus.

CLO04 To impart analytical ability in solving Ordinary Differential Equations of first and Higher
order.

CLO05 To impart analytical ability in solving Second Order Differential Equations and to understand
the concept of series solutions about an ordinary point.

Unit 1 Matrices and Linear Systems

Rank and Nullity of a Matrix by reducing it into Echelon & Normal Forms, Solution of Simultaneous
equations by elementary transformation methods, Consistency and Inconsistency of Equations, Eigen
Values and Eigen Vectors, Cayley- Hamilton Theorem, Applications in Translation and Rotation.

Unit 2 Differential Calculus

Geometrical interpretation of first order derivative, Rolle’s theorem, Mean value theorem, Leibnitz
theorem, Taylors and Maclaurin’s series expansions. Functions of Several variables, Partial
differentiation, Geometrical interpretation of partial derivatives, Total Derivative, Differentiation of
Composite and Implicit functions, Euler’s Theorem, Maxima and Minima of function of two variables.

Unit 3 Integral Calculus

Definite Integrals as a limit of a sum, its application in summation of series, Beta and Gamma functions
(Definitions, Relation between Beta and Gamma functions, Duplication formula, Applications of Beta
and Gama Functions). Curve tracing (curves in Cartesian and polar form with standard curve). Multiple
Integral (Double and Triple Integrals), Change the Order of Integration, Applications of Multiple
Integral in Area, Volume, Surfaces and Volume of Solid of Revolution about X-Axis and Y-Axis.

Unit 4 Ordinary Differential Equations

First order differential equations (Separable, Exact, Homogeneous, Linear), Linear differential
Equations of second and higher order with constant coefficients, Homogeneous linear differential
equations, Simultaneous linear differential equations.
Unit 5 Second-Order Linear Differential Equations with Variable Coefficients

Solution by method of undetermined coefficients, by known integral, Removal of the first derivative,
Change of independent variable and Variation of parameters. Series Solution about ordinary point.

Course Outcomes:

CO01: The students will be able to apply the tools of matrices in solving the system of simultaneous
equations and apply the knowledge in translation and rotation of matrices.
CO02: The students will be able to apply the tools of differential calculus to relevant fields of
engineering and understand the concept of several variables
CO03: The students will be able to apply the tools of integral calculus to relevant fields of
engineering and understand the concept of multiple integrals in finding area of regions and
volume of solids
CO04: The students will be able to solve Ordinary Differential Equations using different methods.
CO05: The students will be able to solve Second order differential equations using different methods
and will able to find series solution about an ordinary point.

Text Books:

1 B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, New Delhi.

2 H.K.Dass, Higher Engineering Mathematics ,S. Chand & Company Pvt LTD., New Delhi

References:

1. B.V. Ramana, Higher Engineering Mathematics, Tata McGraw Hill Publishing Company Ltd.,
New Delhi.
2. .Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons .
3. .R.K. Jain and S.K. Iyengar, Advanced Engineering Mathematics, Narosa Publishing House, New-
Delhi.

Web Source:

1. http://nptel.ac.in/courses/111108066/
2. http://nptel.ac.in/courses/111104085/

Open Learning Source:

1. https://swayam.gov.in/courses/public
2. http://nptel.ac.in/course.php
 Hours per Week
Course Code Course Name
L T P Credits
EN3BS05 Engineering Physics 3 1 2 5

Course Learning Objectives (CLOs):

CLO01 To discuss various physical phenomenon through engineering physics..
CLO02 To explain students about the usage and significance of laser operation and optical
fibre in industries.
CLO03 To develop the understanding of optics and their application in various areas of day to
day life.
CLO04 To describe and solve the quantum mechanics problems and explain the basics of
crystal structure.
CLO05 To implement the knowledge of Newtonian Mechanics in various applications.
CLO06 To identify various engineering problems related to acoustics and explain the basics of
Superconductivity.

Unit-1 Laser and Fibre Optics:

Spontaneous and Stimulated emission of radiation, Population inversion, Einstein’s A
& B co-efficient, Optical resonator and Condition necessary for active Laser action,
Ruby Laser, He-Ne Laser, Properties and applications of lasers.
Optical Fibre - Core and cladding, total internal reflection, Classification of fibre,
Calculation of numerical aperture and acceptance angle, losses in the fibre,
applications, V-number.
Unit-2 Optics:
Interference: Conditions for sustained interference, double slit as an example. Spatial
and Temporal Coherence, Fresnel’s biprism, Newton’s ring experiment and
applications.
Diffraction of light: Fresnel and Fraunhofer class, Fraunhofer diffraction for single
slit, Intensity distribution, N-slits, and plane transmission grating. Missing orders and
Rayleigh criterion of Resolution.
General concept of Polarization, Plane of vibration and plane of polarization, Malus’s
law, Brewster’s law, Double refraction (birefringence) - Ordinary and Extra-ordinary
rays, Polaroid, Nicol prism.
Unit-3 Quantum Mechanics and Crystal Physics:
Quantum mechanics: Inadequacies of Classical Mechanics, Duality nature of
electromagnetic radiation, De Broglie hypothesis for matter waves, Phase and group
velocity. Heisenberg’s uncertainty principle with its elementary proof, Compton
scattering, wave function, Schrodinger’s wave equation, Particle confinement in 1D
box (Infinite Square well potential).
Crystal Physics: Crystal directions, Planes and Miller indices, Symmetry elements,
packing factor.
Unit-4 Mechanics:
Newton’s laws of motion and its explanation, pseudo forces (e.g.
Centrifugal force), Coriolis force and its applications, Motion under a central force,
Gravitational law and field, Potential due to a spherical shell, System of particles,
centre of mass and reduced mass, Conservation of linear and angular momentum,
elastic and inelastic collisions.
Unit-5 Acoustics and Superconductivity:
Acoustics: Reverberation time, absorption coefficient, Sabine’s and Eyring’s formulae, Applications -
Designing of hall for speech, concert, and opera;
Superconductivity: Superconductivity, Zero resistance, persistent currents, superconducting transition
temperature (Tc), Type-I and Type-II superconductors, Meissner effect

Text Books
1. Textbook of Optics: S. Chand Publications.
2. Gaur and Gupta, Engineering Physics, Dhanpat Rai Publications.
3. Beiser Concepts of Modern Physics, TMH.
References:
1. Dr. M N Avadhanulu , Dr. R. S. Hemne, An Introduction to Lasers-Theory and
Applications. Chand Publications.
2. K. Thyagarajan, Ajoy Ghatak, Lasers: Fundamentals and Applications,

Springer Science and Business Media.

3. Ghatak and Thyagrajan, An Introduction to Fiber Optics, Cambridge
University Press.

Web Resources:
1. https://phet.colorado.edu/en/simulations.
2. http://nptel.ac.in/courses/122103011/39.
Course Outcomes (COs):

After completion of this course students shall be able to:

CO01 Describe the different mechanism in laser and optical fiber.
CO02 Explain the working of different types of lasers and optical fiber.
CO03 Construct different project models based on principles of lasers and fibre.
CO04 Discuss the various phenomena of wave optics and their applications.
CO05 Compare the basic concept of classical mechanics with quantum physics.
CO06 Classify different types of crystal structure.
CO07 Illustrate the different types of equations of motion.
CO08 Apply the different types of forces in real world and day to day life.
CO09 Outline the different types of basic terms used in acoustic physics.

Suggested List of Practicals:

1. To determine the thickness of wire using diode laser.
2. To determine the radius of curvature of Plano convex lens using Newton’s ring
experiment.
3. To determine the wavelength of given sodium vapour lamp using Fresnel’s Bi
prism.
4. To find the wavelength of spectral lines of mercury vapor lamp using help of
transmission grating
5. To measure the numerical aperture of an optical fiber by scanning method.
6. Determination of Planck’s constant (h) using light emitting diode (LED).
7. To find the frequency of AC mains using Melde’s method in Longitudinal /
Transverse arrangement.
8. To determine the specific optical rotation of sugar solution by biquartz
Polarimeter.
9. To determine the value of acceleration due to gravity (g) using compound
pendulum.
10. To determine the Standard deviation of any one of the following, by algebraic
formula
a) Thickness of the given scale by Vernier calipers
b) Diameter of the wire by Screw gauge\
11. Mini Project
 Hours per Week
Course Code Course Name
L T P Credits
EN3ES01 Basic Civil Engineering 3 0 2 4

Course Learning Objectives (CLOs):

CLO01
To give the knowledge of various building and general construction materials such as bricks,
stones, timber, cement, steel and concrete & their properties and application.
CLO02 To provide basic understanding of the forces and its components, stresses, strains and the
modulus of elasticity of the different construction materials.
CLO03 To understand the components of the building such as beams, columns, foundations, slabs
and different types of soils and their bearing capacities.
CLO04
To provide basic knowledge about principles of surveying for a location, and its application
in execution of engineering projects, various instruments used for surveying such as chains,
tapes, compass, theodolite and auto level.
CLO05 To understand various aspects of structural members and application of loads, shear force
& bending moment in the field of civil engineering.

Unit-I Building Construction Material

Role of Civil Engineer in the construction of buildings, dams, expressways and infrastructure
projects for 21st century. Importance of an inter- disciplinary approach in engineering Building
Materials: Bricks composition, classifications, properties and uses. Stone classification of rocks,
quarrying, and Dressing properties uses. Timber properties uses ply wood. Cement : grades
,types, properties, uses. Steel: types, mild steel, medium steel, hard steel, properties, uses, market
forms. Concrete: grade designation, properties, uses.

Unit-II Forces & Properties of Material

Forces and its components, Resolution and summation of forces, Lami’s Theorem, Stress, Strain
types, Hook’s law, Three moduli of elasticity, poisons ratio, relationship, factor of safety.

Unit-III Building Components

Site selection, General Classification and building components. Soils: types and bearing capacity
of soils, Foundation: functions and classifications. Flooring: requirements and selection types,
Roof - types and requirements.

Unit-IV Surveying and leveling

Surveying-classification, general principles of surveying–Basic terms and definitions of chain,
Chain survey, Compass survey and Leveling, Uses of surveying , Contours their characteristics
and uses.

Unit-V Shear force and Bending moment

Introduction of shear force and bending moment and their sign conventions, Types of load, Types
of beams, Types of supports; Shear force and bending moment diagrams for simply supported,
overhang and cantilever beams subjected to any combination of point loads, uniformly
distributed load and point moment; Relationship between load, shear force and bending moment.

Text Books:
1. S.C. Rangwala, Building materials, Charotar Publishing House, Pvt. Limited.
2. S.Ramamrutham , Basic Civil Engineering and Engineering Mechanics, Dhanpat Rai.
3. K.K.Dwivedi & K.K. Shukla, Basic Civil Engineering & Engineering Mechanics, Dhanpat Rai
& Co.(Revised).

References:
1. I.K.V.B. Raju and P.T. Ravichandran, Basics of Civil Engineering, Ayyappa Publications,
Chennai.
2. S.Gopi, Basic Civil Engineering, Pearson Publishers.
3. M.S. Palanichamy, Basic Civil Engineering, Tata Mc Graw Hill

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Students will be able to recognize the civil engineering works and conversant about different
construction materials and their uses.
CO02 Student will be able to differentiate force, pressure and stresses.
CO03 Students will be able to know the different building component and its importance.
CO04
Students will be conversant about vertical and horizontal variation of different terrains.
CO05 Students will be able to apply the theoretical knowledge about structural elements in practical
manner.

List of Experiments
1. To determine particle size distribution & fineness modulus of coarse and fine aggregates.
2. To determine standard consistency of cement paste. -
3. To determine initial and final setting times for cement by using Vicat's apparatus.
4. To determine the workability of fresh concrete of given proportion by slump cone test.
5. To determine the area of land by chain surveying.
6. To perform traverse surveying with prismatic compass check for local attraction and determine
corrected bearing and to balance the traversing by Bowditch'srule.
7. To perform levelling by height of Instrument method.
8. To perform levelling by rise and Fall method.
9. To perform Plane Table Surveying work by (A) Radiation method and (.B) Intersection
methods.
10. To measure horizontal and vertical angle sin the field by using Theodolite.
 Hours per Week Total
Course Code Course Name
L T P Hours Credits
EN3ES03 Basic Mechanical Engineering 3 1 2 6 5

Course Learning Objectives (CLOs):

CLO01 To understand the properties of materials and their behavior with variation in temperature
and Load. To understand different measuring instruments used in engineering
applications.
CLO02 To understand the basic laws of thermodynamics and their applications in engineering,
refrigeration cycles and properties of refrigerants.
CLO03 To understand Construction and Working of I. C. Engines.
CLO04 To understand Construction and Working of Steam Generators
CLO05 To understand the concepts of Centroid & Moment of Inertia and of plane areas and
different theorems of moment of Inertia
Unit-1 Materials & their mechanical properties
Classification of Engineering material and their mechanical properties, Composition of cast iron and
carbon steels and their application. Stress-strain diagram, Hooks law and modulus of elasticity.Tensile,
shear, hardness, and fatigue testing of materials.

Unit-2 Thermodynamics
Thermodynamic properties and systems, First of thermodynamics, thermal processes at constant
pressure, volume. Second law of thermodynamic, enthalpy, entropy, heat engine, heat pump,
refrigerator and their numerical.

Unit-3 I.C. Engines

Description and working of four stroke petrol engines, two stroke petrol engines, four stroke diesel
engines and two stroke diesel engines, and its efficiency relative merits and demerits.

Unit-4 Steam generators

Definition, Classification, general study of Cochran, Lancashire and Locomotive boilers, boilers
mountings and accessories. Steam properties and boiler performance. Draught Classification,
Calculation of Chimney height, boiler efficiency and numerical. Unit V: Centroid & Moment of Inertia
Location of centroid and Moment of Inertia of plane areas, Perpendicular Axis and Parallel Axis
theorems.

Unit 5 Centroid & Moment of Inertia

Location of centroid and Moment of Inertia of plane areas, Perpendicular Axis and Parallel Axis
theorems.

Textbooks:
1. R.K. Rajput, Basic Mechanical Engineering, Laxmi Publication.
2. P.K. Nag, Engineering Thermodynamics, McGraw Hill.
3. R.K. Bansal, Engineering Mechanics, Laxmi publications.
References:
1. Anand K Bewoor, Vinay A Kulkarni, Ist edition, Metrology & Measurement, McGraw Hill.
2. Cengel and Boles, Thermodynamic, An Engineering Approach in S.I Unit, McGraw Hill.
S.S. Bhavikatti and K.G.Rajashekarappa, Engineering Mechanics, New age international limited.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO01 Students will be able to understand the engineering materials, their properties, Iron-
Carbon Diagram and Stress-Strain Curve, Measuring Equipment’s and Testing Machines.
CO02 Student will be thorough with the basic laws of thermodynamics and their applications in
engineering also know about Refrigeration cycles and properties of refrigerants.
CO03 Students will be able to understand the construction and working of I.C. Engines .
CO04 Students will be able to understand the construction and working of Steam Generators
CO05 Students will be able to determine the Centroid & Moment of Inertia of areas/composite
sections.
List of Experiments
1. Measurements using Vernier calliper & micrometer.
2. Measurements using dial gauges and combination set.
3. Measurements using slip gauges & sine-bar.
4. Tensile Testing of standard mild steel specimen on UTM.
5. To determine the hardness number by using Brinell Hardness Testing Machine.
6. Study of 2-stroke petrol and diesel engine.
7. Study of 4-stroke petrol and diesel engine.
8. Study of different type of boilers.
9. Study of different type of boilers mounting & accessories.
10. To find the centroid of different plane laminas.
Subject Hours per Week Total Total
Subject Name
Code L T P Hrs. Credits
EN3ES05 Basic Computer Engineering 3 0 0 3 3

Course Learning Objectives (CLOs):

Students will able to understand Computer system components and basics of data
CLO01
Structure.

Students with able to understand the fundamental concepts of Data Base Design,
CLO02
Data Models, Different Data Base Languages such as SQL/Oracle

Students will able to understand the difference between different types of modern
CLOO3
operating systems, their implementation and their applications.

Students will able to understand different models used for study of computer
CLO04
networks and ability to identify different designs.

Students will able to learn about various programming languages, hardware &
CLO05
Software.

Unit-1 Introduction to Computers

Basic Computer Operations, Classification of Computers, Components of Computer Hardware, Bus
Architecture and Instruction Set, I/O devices, Software, Application of Computers, Number Systems,
Primary Memory, Secondary Memory.
Basics of Data Structures: Introduction to data Structures, Defining an Array, Stack, Queue, Linked
List as Data Structure.

Unit-2 Database Management System

Introductions to DBMS, File based approach and Database Approach, The Evolution of Data Models,
Three level Architecture of DBMS, Data Independence, Data Dictionary, Database Administrator,
Database Languages, Introduction to SQL.

Unit-3 Introduction to Operating System

Role of Operating System, Types of Operating Systems, Functions of Operating Systems, Process
Management, File Management, Device Management, Security, Deadlocks, MS DOS, UNIX
operating system, Linux Operating System, Windows Operating System.

Unit-4 Introduction to Computer Networks

Definition and Purpose of Computer Network, Open System Interconnection, Types of Networks,
Topologies in Network Design, Switching Techniques, TCP?IP Network Model, Basic Networking
Devices, Introduction to Internet, Introduction to WWW and Network Security.
Unit-5 Computer Languages and Software
Introduction to Computer Languages, Evolution of Programming Languages, Classification and
Generation of Programming Languages, Features of good Programming Language, Selection of
Programming Language, Software Definition, Relationship between Software and Hardware, Software
Categories, System Software Application Software.

Text Books:
1. A.H.F. Silberschatz, Data Base System Concepts, McGraw -Hill.
2. A.S. Tanenbaum, Modern Operating Systems, Pearson Education.
3. A.S. Tanenbaum, Computer Networks, Pearson Education.
4. R. Mall, Fundamentals of Software Engineering , PHI

Course Outcomes
After completion of this course the students shall able to:

CO01 Student will understand the basic terminology used in computer Systems and Data
Structures.
CO02 Students will learn How to write, compile and debug programs in programming
language.
CO03
Students will learn about various operating systems and their features and functionality.

CO04
Students will understand concepts of database management system and its usage.

CO05 Students will understand Computer Networks Models , Network Devices and Internet
Services.
Subject Hours per Week Total Total
Subject Name
Code L T P Hrs. Credits
EN3ES07 Documentation and Presentation 0 0 2 2 1

Course Learning Objectives

CLO01 Students will learn to use Microsoft Word to produce professional-looking documents.

CLO02 They will learn how to create, print and publish properly formatted document.

CLOO3 Students will get sufficient knowledge to create real-world slide shows.

CLO04 Features of Libre office and Comparison and compatibility with MS office

CLO05 To learn about Ubuntu software for documentation and presentation

Unit-1 Introduction to Windows based documentation software

a) File handling in Windows environment.
b) Analysis of applicability and suitability of tools like MS Word in document preparation.
c) To study features like opening word, page layout, format options, document naming, setting for
automatic save, spell and grammar check, tabulation, print preview, final save and print in MS
word.
d) Writing technical letters and reports.

Unit-2 Introduction to Windows based database management software

a) Analysis of applicability and suitability of MS Excel in database management.
b) Construction of worksheet and inserting data in MS Excel
c) Use of mathematical formulas and functions in MS Excel.
d) Presentation in the form of charts and graphs in MS Excel.

Unit-3 Introduction to Windows based presentation software

a) Analysis of applicability and suitability of MS Power Point as presentation software.
b) Creating, Opening and Saving Presentation in Power point.
c) Study of different Views in power point.
d) Working with Slides, Adding and Formatting Text, Making Notes, Pages and Handouts.
e) Designing Slides show, Running and controlling presentation,
f) Printing Presentations.
g) Use of Multimedia in Presentation: Meaning, Graphics, Animation, Audio Images, Video
Survey and Text.

Unit-4 Introduction to documentation on Ubuntu

a) Introduction to Libra Office
b) Text formatting using Libra Office (Writer).
 c) Spread sheets in Libra Office (Calc).
d) Presentation in Libra Office (Impress).
e) Comparison and compatibility with MS office

Text Books:
1. G.B. Shelly, T.J. Cashman, M.E. Vermaat, Microsoft Office word 2007: Complete Concepts and
Techniques, Cengage Learning Inc.
2. C. Skintik ,Learning Microsoft Power point 2007, Pearson Education.
3. LibreOffice 4.2 User Guide, Available at: https://www.libreoffice.org/get-help/documentation/

Course Outcomes
After completion of this course the students shall able to:

CO01 Student will understand the basic working with the Computer system.

CO02 Students will be able to draft well formatted letters

CO03 Students will learn to prepare all types of calculated sheets

CO04 Students will able to prepare presentation on any topic

 Course Code Course Name Hours per Week Total Total
L T P Hrs. Credits
EN3HS01 History of Science and Technology 2 0 0 2 2

Course Learning Objectives (CLOs):

CLO01 To know the historical perspective of science and technology in India, its roots and its
role.
CLO02 To know how research and development field is progressing in India.
CLO03 To know what were the policies and plans are proposed after independence to be
technologically sound.
CLO04 To Know what were the developments done in major areas of science & technology.
CLO05 To know the relationship between the technologies.

Unit-1
Historical Perspective

Nature of science and technology, Roots of science and technology in India, Role of Science and
Scientists in society, Science and Faith.

Unit-2
Research and Development (R&D) in India

Science and Technology Education, Research activities and promotion of technology development,
Technology mission, Programs aimed at technological self reliance, activities of council of scientific
and industrial research (CSIR).

Unit-3
Policies and Plans after Independence

Nehru’s vision of science for independent India, Science and technologcaly developments in the
new era, science and technology developments during the Five Year Plan Periods and science and
technology policyresolutions.

Unit-4
Science and Technological Developments in Major Areas

Space – Objectives of space programs, Geostationary Satellite Services – INSAT system and INSAT
services remote sensing applications, Launch Vehicle Technology. Ocean Development
– Objectives of ocean development, marine research. Biotechnology - Applications of
biotechnology in medicine, agriculture, food and fuel. Energy – Research and development in the
field of nonconventional energy resources, India’s nuclear energyprogram.
Unit-5
Nexus between Technologies

Transfer of Technology – Types, Methods, Mechanisms, Process, Channels and Techniques,

Appropriate technology, Technology assessment, Technological forecasting, Technological
innovations and barriers of technological change.

TextBooks:

 K. Rajaram, Science and Technology in India, Published and Distributed by Spectrum

Books (P) Ltd., NewDelhi.
 M. Srinivasan, Management of Science and Technology (Problems & Prospects), East-
West Press (P) Ltd., NewDelhi.
 G.R. Kohili, The Role and Impact of Science and Technology in the Development of
India,
SurjeetPublications.
 Government of India, Five Year Plans, Planning Commission, NewDelhi.
 K.D. Sharma, and M.A. Qureshi, Science, Technology and Development, Sterling
Publications (P) Ltd., NewDelhi.

References:

1. Suvobrata Sarkar , History of Science, Technology, Environment, and Medicine in India,

Published by Routledge India.
2. Sabareesh P.A. , A Brief History Of Science In India. Published by Garuda Prakashan.
3. G. Kuppuram, K. Kumudamani, History of Science and Technology in India, Published by
Sundeep Prakashan.

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO01 Student will be aware about the ancient India & the existence of science & technology
in that era & how it is reciprocated.
CO02 Student will be aware about the upliftment done in the field of R & D after
independence.
CO03 Student will come to know about the plans and policies that brought about radical
changes for the growth of science in India.
CO04 Student will come to know about the major areas of the applied science and their
existence. And can set the relationship between the technologies.
CO05 Students will understand the need of technology transfer, its types and processes.
 Hours per Week
Course Code Course Name
L T P Credits
EN3HS03 Environmental Sciences 2 0 0 2

Course Learning Objectives (CLOs):

CLO01
To impart knowledge of Environment and its basic components.
CLO02 To build basic understanding of various effects of human activities to the environment.
CLO03 To understand concepts of water pollution
CLO04
To understand function of solid waste management
CLO05 To learn concepts of disaster management

Unit 1: Environmental Communication and Public Awareness

Multidisciplinary nature of environmental studies: Scope and Significance of environmental education;
Concept of sustainability and sustainable development – Principles, imperatives and threats; three E’s
to optimize sustainable development, Sustainable Agriculture and Organic Farming.
An Introduction to Environmental laws in India: Environmental Impact Assessment and
Environmental Auditing. Polices for Disaster preparedness programs, Rehabilitation measures and long
term reconstruction, Psychosocial care provision during the different phases of disaster

Unit 2: Domestic and Global Environmental Concerns

Domestic environmental concerns: Disaster management – Introduction, types, disaster management
cycle; Case studies of terrorist incidence, Bomb threat; Solid Waste management: Introduction, types
of solid waste, methods to manage; Deforestation; Urbanization and Energy requirements
Global environmental concerns: Global Challenges - climate change and global warming, Kyoto
Protocol, Greenhouse Gases, Ways to reduce Greenhouse gases emissions, Carbon Footprint, ways to
reduce carbon footprint, Carbon Trading; Ozone layer depletion, Acid rain and impacts on human
communities and agriculture.

Unit 3: Natural resources and Environmental Pollution

Natural Resources: Land resources and land use change; Land degradation, soil erosion, salinization
and desertification. Water: Use and over exploitation of surface and ground water,; Forest Resources;
Food resources. Case studies on natural disaster: Earthquake, floods, cyclone, volcanoes; Energy
resources: Renewable and nonrenewable energy sources, use of alternate energy sources.
Environmental pollution: types, causes, effects and control of; Air, water, soil and noise pollution;.

Unit 4: Ecosystem and Biodiversity

Ecosystem: Structure and function of ecosystem; Energy flow in an ecosystem: food chains, food webs
and ecological succession.
Biological diversity: types of biodiversity; its significance, threats and conservation.
Unit 5: Sustainable habitat and Green Technology
Sustainable Habitat: Concept of Green Building and its rating systems, Volatile Organic
Compounds (VOC), Heating Ventilation and Air Conditioning (HVAC) systems.
Green Technology: Hybrid Vehicle Technology, Industrial ecology, Green Technology, Green
Business, Green Computing, Green Chemistry.

Case Studies:
 Case studies of terrorist incidence, Bomb threat, Earthquake, floods, cyclone, volcanoes,
Bhopal Gas tragedy, Fukushima Daichii Nuclear disaster

Text Books
1. Surinder Deswal, Environmental Science, Dhanpat Rai & Co. publication
2. R. Rajgopalan , Environmental Studies, Oxford IBH Publication.
3. Daniel D. Chiras, Environmental Science , Jones & Bartlett Ltd

Reference Books
1. G. M. Masters, Introduction to Environmental Science and Engineering, Pearson
Education Pvt. Ltd.
2. A.K. De, Environmental Chemistry, New Age International,1996.
3. G.J. Rau and C.D. Wee ten, "Environmental Impact Analysis” Hand book, McGraw
Hill.
4. Petts Judith, Handbook of environmental impact assessment. Vol. 1, Blackwell Science

Web Source:
1. http://www.circularecology.com/sustainability-and-sustainable-
development.html#.WwOcRkiFPIU
2. http://markdiesendorf.com/wp-content/uploads/2015/09/CorpSust2000.pdf
3. http://www.fao.org/docrep/005/v9933e/v9933e02.htm
4. http://www.yourarticlelibrary.com/essay/disaster-management-in-india-
classification-policies-and-other-details/25006
5. https://ndma.gov.in/en/
6. https://www.conserve-energy-future.com/sources-effects-methods-of-solid-waste-
management.php
7. https://beeindia.gov.in/sites/default/files/1Ch9.pdf
8. https://www.ugc.ac.in/oldpdf/modelcurriculum/Chapter2.pdf
9. http://download.nos.org/333courseE/10.pdf
10. http://download.nos.org/333courseE/5.pdf
11. http://www.unesco.pl/fileadmin/user_upload/pdf/BIODIVERSITY_FACTSHEET
12. .pdf
13. http://www.nistads.res.in/images/ISTIP/report/green%20technology.pdf

Open Learning Source:

1.https://swayam.gov.in/courses/public
2 http://nptel.ac.in/course.php
Course Outcomes (COs):
After completion of this course the students shall be able to:

CO01 Gain knowledge of Ecosystem & Biodiversity.

CO02 Develop basic understanding of air pollution and its control method
CO03 Develop basic understanding of water pollution and its control method
CO04 Gain knowledge of Solid waste management and its importance.
CO05 Gain knowledge of Disaster Management.
SEMESTER II
Sr.
Course Code Courses L T P Credit
No.
1 EN3BS02 Engineering Mathematics-II 3 1 0 4
2 EN3BS04 Engineering Chemistry 3 0 2 4
3 EN3ES02 Engineering Graphics 3 0 2 4
4 EN3ES04 Basic Electrical & Electronics Engineering 3 1 2 5
5 EN3ES06 Computer Programming 2 0 2 3
6 EN3ES08 Engineering Workshop 0 0 2 1
7 EN3HS02 Communication Skills 2 0 2 3
Total 16 2 12 24
Total Contact Hours 30
 Hours per Week Total
Course Code Course Name
L T P Hrs. Credits
EN3BS02 Engineering Mathematics-II 3 1 0 4 4

Course Objectives.
CLO01 Equip the students with the knowledge of Laplace Transform and its applications.

CLO02 Equip the students with the knowledge of Fourier series and Fourier Transform.

CLO03 Equip the students with the knowledge of Partial Differential Equations and its application.

CLO04 Impart the knowledge of Vector Calculus.

CLO05 To understand the concept of Probability and Probability Distribution.

Unit 1
Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary
functions, properties of Laplace Transform, Inverse Laplace transform and its properties,
Convolution theorem, Applications of Laplace Transform to solve the Ordinary Differential
Equation, Laplace transform of Unit step function and Impulse function.
Unit 2
Fourier series and Fourier Transform: Introduction of Fourier series, Fourier series for
Discontinuous functions, Fourier series for Even and Odd function, Half range series, Fourier
Transform, definition and properties of Fourier Transform, Sine and Cosine Transform.
Unit 3
Partial Differential Equations: Definition, Formulation, Solution of Partial Differential
Equations ( By Direct Integration Method & Lagrange’s Method), Non-Linear Partial Differential
Equations of First order {Standard form I, II, III & IV), Charpit’s method. Partial Differential
Equations with Constant Coefficients (Higher Orders Homogeneous and Non- Homogeneous
equations), Method of Separation of Variables, Application to heat and wave equations (one
dimension).
Unit 4
Vector Calculus: Scalar and Vector fields, Vector Differentiation, Laplacian operator, Gradient,
Divergence and Curl, Line and surface integrals, Green’s theorem, Gauss Divergence theorem,
Stoke’s theorem.
Unit 5
Probability: Elementary concepts of Probability, Discrete and Continuous random variable,
Probability distribution functions, Binomial, Poisson and Normal Distribution, Exponential
Distribution.
Text Books / References:
1. B.S. Grewal, Higher Engineering Mathematics, Edition-43, Khanna Publishers, New Delhi,
2014.
2. B.V. Ramana, Higher Engineering Mathematics, Tata McGraw Hill Publishing Company
Ltd., New Delhi, 2006.
3. R.K. Jain and S.K Iyengar, Advanced Engineering Mathematics, Narosa Publishing House,
New- Delhi, 2006.
4. G.Paria, Partial Differential equation, Scholars Publishing House, 1981.
5. Shanti Narayan, A text book of Vector Calculus, S. Chand & Co., New Delhi.
6. S.P. Gupta, Statistical Methods, Sultan Chand & Sons, Delhi,2014.
7. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons 1999.

Web Source:
1. nptel.ac.in/courses/111103021/15
2. nptel.ac.in/courses/111105035/22
3. nptel.ac.in/courses/117101055/34
4. nptel.ac.in/courses/115101005/3

Open Learning Source:

a. https://swayam.gov.in/courses/public
b. http://nptel.ac.in/course.php

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01:Students can apply their knowledge in solving and developing mathematical models
involving ordinary and partial differential equations with given boundary conditions which is
helpful in all engineering & research work.

CO02:Understand the general mathematical concepts required for the field regarding Laplace
and Fourier transform.

CO03:Understand Importance of partial differential equations in physical problems, Able to

solve IVP.

CO04:Students can find derivatives of vector-valued functions, gradient functions, Evaluate

integrals of functions or vector-related quantities over curves, surfaces, and domains in two
and three-dimensional space.
CO05:Understand Discrete and continuous probability density functions and special
probability distributions.
 Course Code Course Name Hours per Week Total
L T P Credits
EN3BS04 Engineering Chemistry 3 0 2 4

Course Learning Objectives (CLOs):

CLO01 To gain fundamental knowledge of the principles related to, so as to meet the
challenging requirements of students in chemistry studies
CLO02
To attain awareness in students about current & new issues in the fields of chemistry
CLO03 To make students understand about the present needs without compromising on the
ability of future generations to meet their own needs for proper engineering, relevant
education
CLO04 To increaseefficient management
curiosity of resources
and give them awareness about practical knowledge of various
laboratory methods among the students regarding the course

Unit 1
Water and its Industrial Applications: Sources, Impurities, Hardness & its units,
Industrial water characteristics, softening of water by various methods (External & Internal
treatment), Boiler trouble causes, effect & remedies, Characteristics of municipal water &
its treatment, Numerical problems based on softening methods.
Water Analysis Techniques: Alkalinity, hardness (Complexometric), Chloride, Free
chlorine, DO, BOD and COD, Numerical problems based on above techniques.

Unit 2
Fuels & Combustion: Definition, Classification - Calorific Value (HCV and LCV) and
Numerical Problems on Calorific Value -Combustion of Fuels, Numerical Problems on
Combustion - Solid Fuels: Coal and Coke - Liquid Fuels: Petroleum and its Distillation,
Cracking, Octane and Cetane Values of Liquid Fuels, Synthetic Petrol, Power Alcohol -
Bio-Gas
Unit 3
Lubricants: Introduction, Mechanism of lubrication, Classification of lubricants,
Properties and Testing of lubricating oils, Numerical problems based on testing methods.
Polymer: Introduction, Natural & Synthetic Rubber; Vulcanization of Rubber, Preparation,
Properties & uses of the following- Polythene, PVC, Teflon, Nylon 6:6, Silicone Resin,
Biopolymers, Biodegradable polymers.

Unit 4
Cement & Refractories: Manufacture, IS-code, Setting and hardening of cement.
Refractory: Introduction, classification and properties of refractories.
New Engineering Materials: (Brief Idea of Following): Superconductors and its
applications, Fullerenes, Optical Fiber, Nanomaterials-Carbon nanotubes, Nanowires and
their applications

Unit 5
Instrumental Techniques in Chemical Analysis: Introduction, Principle, Electromagnetic
 spectrum,
Instrumentation and applications of IR, UV, Visible, Gas Chromatography, Lambert's and
Beer's Law and its limitations.

Electrochemical Systems: Electrochemical cells and EMF, Applications of EMF

measurements.

Text Books:
1. Preeti Jain, Anjali Soni, JeetendraBhawsar, A text book of Engineering Chemistry,
1st edition, Manthan Publication
2. Preeti Jain, S L Garg, Engineering Chemisty, 4th edition, Variety Publication
3. Shashi Chawla, Engineering Chemistry, 11th edition, Dhanpat RaiPublications

References:
1. P C Jain , MonkaJain, Engineering Chemistry, Dhanpat Rai Publications.
2. S. S. Dara, A Text Book of Engineering Chemistry, S. Chand & Company.
3. B.Joseph, Environmental Studies, Tata McGraw Hill.
4. A.K. De, Environmental Chemistry, New Age International.
5. Shashi Chawla, Engineering Chemistry, Dhanpat Rai Publications.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Understand the practical approach of water analysis methods to decide its industrial and
domestic application.
CO02 Know the utility and power generating ability of fuels and its recent development
towards eco-friendliness
CO03 Will acquire betterment in lifestyle and will understand the need of biopolymers are the
current scenario
CO04 Will get a knowledge of using instrumental techniques which helps in getting details of
new discovered compounds
CO05
Will get familiarise with new engineering materials, refractories and cement.
List of Practicals :
Volumetric Analysis:
1. To determine Hardness of given water sample by Complexometric titration.
2. To determine total and mixed Alkalinity of given water sample using
phenolphthalein and methyl orange as indicator.
3. To determine strength of unknown FAS solution by redox titration using
N- Phenyl anthranilic acid as internal indicator.
4. To determine strength of unknown CuSO4 solution by iodometric titration
using Starch as internal indicator.
5. To determine Chloride content of water sample by Mohr’s method
(Argentometric titration).
Fuel Testing:
1. To determine moisture content in given sample of coal by proximate analysis.
2. To determine volatile content in given sample of coal by proximate analysis.
3. To determine ash content in given sample of coal by proximate analysis.
4. To determine percentage carbon content of coal by proximate analysis.
5. To determine penetration number of grease by Cone Penetrometer apparatus.
6. To determine flash and fire point of given oil sample by Cleveland’s open
cup apparatus.
7. To determine flash point of given oil sample by Penskey Marten’s close
cup apparatus.
8. To determine flash point of given oil sample by Abel’s Close cup apparatus.
9. To determine Steam emulsification number of given lubricant.
10. To determine Aniline point of given oil sample.
11. To determine Cloud and Pour point of given lubricating sample.
12. To study rate of change of viscosity with temperature of the given
lubricating oil by means of Redwood Viscometer no.1
13. To study rate of change of viscosity with temperature of the given
lubricating oil by means of Redwood Viscometer no.2.
Kinetics:
Effect of concentration and temperature on the rate of reaction between sodium
thiosulphate and hydrochloric acid.

Electrochemistry:
Variation of cell potential in Zn/Zn2+//Cu2+/Cu with change in concentration of
electrolytes (CuSO4 or ZnSO4) at room temperature.
 Total Hours per week Total
Course Code Course Name
L T P Hours Credits

EN3ES02 Engineering Graphics 3 0 2 5 4

Course Learning Objectives (CLOs):

CLO01 To familiarize with the construction of geometrical figures.

CLO02 To familiarize with the projection of 1D, 2D and 3D elements
CLO03 To familiarize with the projection and sectioning of solids.
CLO04 To familiarize with the Preparation and interpretation of building drawing.
CLO05 To familiarize with the Upgraded Drawing Software and their use.

Unit -1
Drawing scales: Engineering scale, graphical scale, plain scale, diagonal scale, scale of chord.
Orthographic Projections: Reference planes, types of orthographic projections–First angle
projections, Third angle projections.

Unit-2
Projections of points: Including points in all four quadrants
Projections of lines: Line parallel to reference plane, perpendicular to reference plane, inclined
to one reference plane, inclined to both reference planes, traces of line.

Unit-3
Projections of Planes: Projections of Planes in different Positions, Auxiliary planes, Auxiliary
Vertical Plane (AVP), Auxiliary Inclined Plane (AIP)
Projection of Solids: Classification of solid. Projections in simple and complex positions of the
axis of the solid.

Unit-4
Sections of Solids: Sectional views and true shape of the section.
Isometric Projections: Isometric view, Isometric scale to draw Isometric projection, non-
Isometric lines, construction of isometric view from given orthographic views and to construct
Isometric view of a Pyramid, Cone, Sphere.
Unit 5
Computer Aided Drawing (CAD): Introduction to AutoCAD ,2D & 3D Basics, Modify & Draw
Commands Using AutoCAD, Points, Lines planes and Solids and their projections.
Textbooks:
1. N.D. Bhatt, Elementary Engineering Drawing, Chartor Publishing House.
2. D. N. Johle, Engineering Drawing, Tata McGraw-Hill Publishing Co.Ltd.
3. P.S. Gill, Engineering Graphics, S.K. Kataria andSons.
4. Warren J. Luzzader, Fundamentals of Engineering Drawing, Prentice Hall of India,
New Delhi.
5. F. E. Giesecke, A. Mitchell & others, Principles of Engineering Graphics, Maxwell
McMillan Publishing.
6. K.C. John, Engineering Graphics for Degree, PHI Learning Pvt. Ltd.

References:
1. Engineering Drawing- Basant Agarwal, TMH
2. D. M. Kulkarni, A. P. Rastogi, and A. K. Sarkar (2009), Engineering Graphics with
AutoCAD, PHI Learning Private Limited, New Delhi
3. Venugopal (2010), Engineering Drawing and Graphics, 2nd edition, New Age
Publications, New Delhi.
4. Trymbaka Murthy (2007), Computer Aided Engineering Drawing, I.K. International
Publishers, New Delhi.
5. R.B. Choudary (2005), Engineering graphics with Auto CAD, Anuradha Publishers, New
Delhi

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Familiarize with different drawing equipment’s and technical standards and Know
purpose, procedures, materials and conventional symbols used. Create and read an
engineering drawing using standard views and have ability to Convert pictorial (3D)
drawings to orthographic (2-D) drawings and vice versa
CO02 Understand the projection of points, straight lines and have the ability to convert the
practical problems in to projections
CO03 To understand and apply concepts of the projection of simple planes & solids.
CO04 Understand and apply the concepts of Projection & Sections of solids & development
of surfaces
CO05 Convert simple 2D orthographic projections into 3D isometric projections with the help
of auto cad commands

List of Experiments
Preparation of drawing sheets containing the drawings for topics covered in theory.
List of Drawing Sheets (Manual)
1. Orthographic Projections
2. Projections of points & Projections of straight lines
3. Projections of planes & Projections of solids
4. Projections of sections of solids & isometric projections
5. Drawing scales

List of CAD Sheets

1. To study about special features, advantages and applications of CAD in detail.
2. To study and practice basic draw commands, modifying commands exist in the CAD.
3. To construct a diagonal scale.
4. To draw orthographic projection of given pictorial views.
5. To construct the isometric views of given geometries.
 Hours per
Course Total Total
Course Name Week
Code
L T P Hrs. Credits
EN3ES04 Basic Electrical & Electronics Engineering 3 1 2 6 5

Course Learning Objectives (CLOs):

CLO01 To introduce fundamental concepts and analysis techniques in electrical engineering to

students across all disciplines.
CLO02 To impart basic knowledge of electrical quantities such as current, voltage, power,
energy and frequency to understand the impact of technology in a global and societal
context.
CLO03 To provide knowledge about the basic DC and AC electric circuits and magnetic circuits.
CLO04 To introduce the concepts of generators, motors, transformers and their applications.
CLO05 To provide basic knowledge about working of semiconductor diodes, Bipolar Junction
Transistor and introduction to digital circuit.

Unit-1 Fundamental of Circuit Theory:

Introduction to DC and AC circuits, Active and passive two terminal elements, Voltage-
Current relations for resistor, inductor, capacitor, Kirchhoff's laws, Mesh analysis, Nodal
analysis, Ideal and practical sources, equivalent resistor, current division, voltage division.
Introduction to magnetic circuits- Simple magnetic circuits, Faraday's laws, induced emfs and
inductances.

Unit-2 Circuit Analysis

Circuit Theorems: Superposition, Thevenin’s, Norton’s, Reciprocity, Maximum Power
Transferand Millman’s Theorem. Star-Delta Transformation. RL, RC and RLC circuits (series
and parallel), Phasor representation, Q-factor, Bandwidth.

Unit-3 Transformers and Rotating Machines

Ideal Transformer, Single Phase Transformers: Principle of Operation of a Single Phase
Transformer, EMF equation, Phasor diagram, Equivalent Circuit, Determination of Equivalent
Circuit Parameters, Regulation and Efficiency of a single phase transformer. Operating
principle of autotransformer. Introduction to rotating machines e.g. Dc motor, Induction motor,
synchronous machines and their characteristics (with derivation).

Unit-4 Diodes and Transistors

Band theory of solids, qualitative discussion of Kronig-Penny Model, effective mass, Fermi-
Dirac function, statistical destruction, Semiconductor Diode, Zener Diode, Rectifier Circuits,
Wave Shaping Circuits, Bipolar Junction Transistors, JFET, MOSFET.
 Unit-5 Digital System

Number Systems and Codes, Logic Gates, Boolean Theorems, De-Morgan’s Theorems,
NAND and NOR gate Latches, S-R Flip-Flop, J-K Flip-Flop, Binary Addition, 1’s and 2’s
ComplementSystem, Full Adder.

Text Books
1. D.P. Kothari and I.J,Nagrath, Basic Electrical Engineering, Second edition, Tata
McGraw - Hill.
2. S.K. Bhattacharya, Basic Electrical and Electronics Engineering, First edition,
PearsonEducation.
3. V.C.Deltoro, Electrical Engineering Fundamentals, Second Edition, PHI.
4. V.N. Mittal & Mittle, Basic Electrical Engineering, Tata McGraw - Hill
5. E. Fitzerald ,D.E. Hingumbotham and A. Grabel, Basic Electrical Engineering,
McGraw-Hill.
6. J. Millman & C.C. Halkias, Integrated Electronics, Tata McGraw-Hill Education.
7. R. Boylestad, L. Nashelsky, Electronic Devices And Circuit Theory, Seventh
Edition,PHI.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Demonstrate an understanding of the basic knowledge of electrical quantities such

as current, voltage, power, energy, and frequency to understand the impact of
technology in a global and societal context.
CO02 Demonstrate an understanding of basic concepts of analysis of simple DC and AC
circuits used in electrical engineering.
CO03 To acquire the knowledge about the working principle of single phase transformer,
D.C motor, single phase induction motor, with analysis of single phase transformer.
CO04 To acquire the knowledge about the characteristics of semiconductor diodes,
Bipolar Junction Transistor ; analysis of single phase centre tapped rectifier circuit.
CO05 To get an insight about the basic introduction of digital electronics.

List of Practicals

1. To verify KCL and KVL.

2. To verify Thevenin’s theorem.
3. To verify Superposition theorem.
4. To verify Norton’s theorem.
5. To perform short circuit test on a single phase transformer.
6. To perform open circuit test on a single phase transformer.
7. To verify V-I characteristic of Semiconductor diode.
8. To verify V-I characteristic of Zener diode.
9. To verify Input and Output waveform of Half wave Rectifier.
10. To verify Input and Output waveform of Bridge Rectifier.
11. To verify Input and Output characteristic of BJT in CB and CE configurations.
12. Implementation of basic logic gates using Universal gates (NAND, NOR).
13. Verify Truth Table of R-S and J-K Flip-flop using NAND gate.
 Course Hours per Week Total Total
Course Name
Code L T P Hrs. Credits
EN3ES06 Computer Programming 2 0 2 4 3

Course Learning Objectives (CLOs):

Use programming terminology correctly in discussion of course topics & identify the need for a
CLO 1
variable and select the appropriate primitive data representation.
CLO 2 Design programs involving decision structures, loops and functions.

CLO 3 Use different data types & data structures and create/update basic data files.

CLO 4 Write, compile and debug programs in C language using pointers & various data types.

CLO 5 Understand the file handling concepts in context of programming.

Unit-1 Problem Solving Methodology

Problem statement, Analysis, Design a solution, Implement/Coding the solution, Test the
solution, Design tools (Algorithm, Flow-chart, Pseudo-code)- Develop algorithms for simple
problems .
Programming Languages: Types and generation of programming languages- Compiler –
Interpreter-Linker –Loader Execution of Program

Unit 2 Basics of Language

Character set, Identifier, Keywords, Constants, Data Types, Variables and declaration,
Operators and Expressions : Operator precedence and associativity, Expression Evaluation
(Simple Examples) , Input and output functions , Simple computational problems involving
the above constructs.
Control Statements: Selection, Conditional operator, Iteration (for, while, do-while),
Branching (switch, break, continue, goto), Nesting of control statements- Problems using
control statements.

Unit-3 Arrays and Strings

1D and 2D arrays, Searching (Linear and Binary), Sorting (Bubble, Selection), Matrix
manipulation programs, Strings and basic operations on strings, Strings functions, Programs
on string manipulation
Functions: Definition, Calling Declaration, Parameter Passing (by value and by reference),
Recursion, Library functions, Programs based on functions

Unit-4 User defined data types

Structure, Union, Enumerated data type, Programs involving structure and union.
Pointers: Declaration, Initialization, Pointers and arrays, Pointers and structures, Pointers and
functions, Command line arguments, Dynamic memory allocation, Operations on pointers,
 Programs involving the above concepts

Unit-5 Files
File concept , File pointer, File handling operations (open, close, read, write etc) on
sequentialand random access files. Programs on file manipulations using fgetc(), fgets), fseek.

Text Books:
1. Herbert Schildt, C: The complete Reference, Fourth Edition, Mc-Graw Hill.
2. R. Sethi, Programming Language Concepts and Constructs, Pearson Education
3. V. Rajaraman, Computer Programming in ‘C’ , PHI.
4. M. Sprankle, Programming and Problem Solving , Pearson Education
5. R.G. Dromey, How to solve it by Computer , Pearson Education.
6. E. Balguruswamy, Programming in ANSI C by, Tata Mc-Graw Hill
References:
1. Kernighan and Ritchie , The ‘C’ programming language, PHI
2. Programming With C, Schaum Series.
3. A. N. Kamthane, Programming with ANSI and Turbo C, Pearson Education

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Student will understand the basic terminology used in computer programming.

CO 02 Students will able to write, compile and debug programs in programming language.
CO 03 Students will able to effectively choose the data structures that efficiently model the
information in a problem.
CO 04 Students will able to formulate problems and implement algorithms in C

List of Practicals
1. Fibonacci series, Generation of Prime, Sum of Series
2. Matrix Addition, Subtraction and Multiplication
3. Sort by Name and Short by Number
4. Bitwise Operations
5. Case Conversion, Encoding and Decoding
6. String Operations
7. Array of Structures
8. Make Patterns
9. Implementation of Structures using Pointers
10. Pointers to Functions
11. Pointers to Pointers
12. Stack using Macros, header - size.h
13. Case Checking using Macros, Hearer - checck.h
14. File Handling
 Total Hours per week Total
Course Code Course Name L T P Hours Credits

EN3ES08 Engineering Workshop 0 0 2 2 1

Course Learning Objectives (CLOs):

CLO01 To familiar with Lathe, Drilling, Milling and shaping machines.
CLO02 The basic law of physics and their utilization in engineering.
CLO03 To understand different primary manufacturing process.
CLO04 To understand different metal joining process.
CLO05 To identify different tools used in basic manufacturing process.

Unit-1 Introduction and Demonstration: - Introduction to various shops / sections and

workshop layouts. Safety norms to be followed in a workshop.
Carpentry Shop: Introduction of Tools & operations, Types of woods & their applications,
Types of Carpentry tools and their u ses, Carpentry Joints, carpentry operations such as
marking, sawing, planning, chiseling, grooving, boring, joining, types of woods and carpentry
hardware.
Unit-2 Fitting Shop: Introduction of Tools & operations, Types of Marking tools & their uses, Types
of fitting cutting tool & their uses, fitting operations such as chipping, filing, scraping, grinding,
sawing, marking, drilling, tapping

Unit-3 Foundry Shop: Pattern Making: Study of Pattern materials, pattern allowances and types
of patterns. Core box and core print. Use and care of tools used for making wooden patterns.
Molding: Properties of good mould & Core sand, Composition of Green, Dry and Loam sand.
Methods used to prepare simple green sand mould using single piece and split patterns.
Black Smithy Shop: Use of various smithy tools. Forging operations: Upsetting, drawing down,
Fullering Swaging and Cutting down.

Unit-4: Welding Shop: Study and use of tools used for Brazing, Soldering, Gas & Arc welding.
Preparing Lap & Butt joints using gas and arc welding methods, Study of TIG & MIG welding
processes. Safety precautions.

Unit 5: Machine Shop: Study of machine tools in particular Lathe machine (different parts, different
operations, study of cutting tools). Demonstration of different operations on Lathe machine, Practice
of Facing, Plane Turning, step turning, taper turning, knurling, and parting. Demonstration and
applications of drilling machine, Demonstration of CNC Machines
 Textbooks:
1. B.S. Raghuwanshi, Workshop Technology Vol. I & II, Dhanpath Rai & Sons.
2. R.S. Khurmi, Workshop Technology, S. Chand and Co.
3. S.K. Hajra Choudhary, A.K. Hajra Choudhary and Nirjhar Roy, Elements of Workshop
Technology, vol. I Media promoters and Publishers Pvt. Ltd
4. R.K. Bansal, Engineering Mechanics, Laxmi publications.

References:

1. W. A.J. Chapman, Workshop Technology, 1998, Part -1, 1st South Asian Edition,
Viva Book Pvt. Ltd.
2. P.N. Rao, 2009, Manufacturing Technology, Vol.1, 3rd Ed., Tata McGraw Hill
Publishing Company.
3. Dr. S.K. Sinha , CNC programming –– Golgotia publication.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO01 Understand the engineering materials, their properties, and their utilization in
manufacturing tool and other equipment’s.
CO02 Understand the primary manufacturing process.
CO03 Understand the basic operation involve in casting.
CO04 Understand the basic process of forging.
CO05 Basic knowledge of simple cutting, holding. Marking and striking tool.
 Course Code Course Name Scheme Credits

EN3HS02 Communication Skills 2-0-2 3

Course Learning Objectives (CLOs):

CLO01 To develop, enhance and demonstrate LSRW Skills.

CLO02 To enable students to acquire oral presentation skills.
CLO03 To prepare students to become more confident and active participants in all aspects
of their undergraduate programs
CLO04 To enable students to distinguish between general and technical communication and
understand its importance.

Unit-1
Grammar and Vocabulary Development: Applied Grammar and usage, Parts of Speech, Articles,
Tenses, Subject-Verb Agreement, Prepositions, Active and Passive Voice, Clauses, modals,
Reported Speech: Direct and Indirect, Sentence Structure, Punctuations, common errors.
Unit-2
Using Dictionaries and Thesaurus, Synonyms, Antonyms, Homophones, One Word Substitution,
Affixation: Prefixes & Suffixes, Basic Grammar & Vocabulary Practice, Synonyms, Antonyms,
Analogies, Sentence Completion, Correctly Spelt Words, Idioms, Proverbs, and Derivation from
root words, Jargon, Scientific Jargon, Vocabulary Practice.
Unit-3
Developing Reading and Listening Skills: Reading Comprehension, Process, Active & Passive
Reading, Reading Speed Strategies, Benefits of effective reading, notemaking, note - taking,
Reading comprehension of technical material and SQ3R reading technique. Listening Skills:
Meaning, process hearing and listening, types, barriers, importance.
Unit-4
Developing Writing Skills: Planning, Drafting & Editing, Writing with style, rightwords selection,
writing effective sentences, developing logical paragraphs, art of condensation, précis, essay,
technical definition and technical description. Formal and Informal Letters: Letter to the Editors,
Municipal corporation, Bank Managers etc.
Unit-5
Speaking Skills Oral Presentation: Preparation, Delivery using Audio – Visual Aids with stress on
body language and voice modulations. (Topics to be selected by the Instructor.) Phonetic Symbols,
Pronunciations.

Text Books:
1. P.C,Wren and N.D.V. Prasada Rao, High School English Grammar & Composition, S Chand
and Co Pvt Ltd.
2. S. Kumar and P. Lata, English for Effective Communication, Oxford UP, New Delhi.
3. A.J. Thompson and A. V. Martinet, A Practical English Grammar,Oxford UP, New Delhi.
4. U. S. Rai and S.M, Rai, Effective Communication, Himalaya Publishing House.
References:
1. A.C. Gimson, An introduction to the Pronunciation of English, ELBS.
2. S. Greenbaum, Thw Oxford English Grammer, Oxford University Press.
3. K.Mohan and M. Raman, Effective English Communication, Tata Mc-Graw Hill.

List of Practicals:
 JAM
 Debates
 Role plays
 GDs
 Extempore
 Story writing
 Picture description
 Symposium
 Oral presentation
 Phonetics practice
 Book Reviews
SEMESTER – III
Sr.
Course Code Courses L T P Credit
No.
1 CS3BS03 Discrete Mathematics 3 1 0 4
2 CS3CO23 Object Oriented Programming 3 1 2 5
3 CS3CO21 Data Structures 3 1 2 5
4 CS3CO22 Computer System Architecture 3 1 2 5
5 CS3CO29 Digital Electronics 3 1 2 5
6 EN3MC09 Soft Skills-II 2 0 0 0
Total 17 5 8 24
Total Contact Hours 30
 Hours per Week
Course Code Course Name
L T P Credits
CS3BS03 Discrete Mathematics 3 1 0 4

Course Learning Objectives (CLOs):

CLO 01
To understand the concepts of sets and functions and to distinguish different types of
functions and identify & describe various types of relations and their graphs.
CLO 02 To understand Boolean algebra and its applications to Computer Sciences including
Mathematical Logic and to describe Lattices and Posets and their uses.
CLO 03 Equip the students with the knowledge of group theory and its application in computer science
as coding theory.
CLO 04
To study the concepts of various graphs and apply Graph theory and trees in Computer
Science and formulate computational problems.
CLO 05 To develop the ability to solve the recurrence relations by using various methods.

UNIT-1
Sets, sub-sets & operations on sets, Finite and infinite sets, principle of inclusion and exclusion
Relations & Properties of relations – equivalence relation, Functions: Definition, Classification of
functions, Composition of functions, Growth of Functions, Pigeon hole principle.

UNIT-2
Partial order relation, Poset, least upper bound, greatest lower bound, maximal and minimal
elements of a poset – Definition & example of Boolean algebra – Lattices, Distributive laws in
lattices – Complemented lattices – Propositional Calculus – Boolean functions, minimum &
maximum terms, simplification of Boolean function with Karnaugh map & Quiane Mc Clusky
method. Applications in computer Science.

UNIT-3
Binary composition, algebraic structure, Semi group, Monoid, Groups, Abelian Group, properties
of groups, Coset Decomposition, Subgroup, Cyclic Group, Normal subgroup, Rings and Fields
(definition and standard results). Applications in Computer Science.

UNIT-4
Trees : Definition , Binary tree , Binary tree traversal , Binary search tree. .Graphs: Definition and
terminology , Representation of graphs , Multigraphs , Bipartite graphs , Planar graphs ,
Isomorphism and Homeomorphism of graphs , Euler and Hamiltonian paths , Graph coloring.
Application in Computer Science.

UNIT –5
Recurrence Relation & Generating function: Recursive definition of functions, Recursive
algorithms, Method of solving recurrence relation. Combinatorics: Introduction, Counting
Techniques -Basic theorems on permutations & combinations. Applications in Computer Science.
Text books :
1. Liu and Mohapatra, Elements of Distcrete Mathematics , McGraw Hill
2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application to
Computer Science, McGraw-Hill
3. R.P. Grimaldi, Discrete and Combinatorial Mathematics, Addison Wesley,
Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill,
4. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, PHI

References:
1. Rings, Fields and Groups: An Introduction to Abstract Algebra (2nd Ed): Reg Allenby
2. First look at graph theory (1st Ed): John Clark & Derek Allan Holton, Allied Publishers
3. Elements of Discrete Mathematics (1st Ed): L CL Liu, McGraw-Hill
4. Discrete Computational Structures (2nd Ed): Robert R. Korfhage , Academic Press

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Understand the concepts of sets and functions and to distinguish different types of
functions and identify & describe various types of relations and their graphs.
CO 02 Understand Boolean algebra and its applications to Computer Sciences including
Mathematical Logic and to describe Lattices and Posets and their uses.
CO 03 Equip the students with the knowledge of group theory and its application in computer
science as coding theory.
CO 04
Study the concepts of various graphs and apply Graph theory and trees in Computer
Science and formulate computational problems.
CO 05 Develop the ability to solve the recurrence relations by using various methods.
 Hours per Week
Course Code Course Name
L T P Credits
CS3CO23 Object Oriented Programming 3 1 2 5

Course Learning Objectives (CLOs):

CLO Understand the concepts of Object Oriented Programming.

01

Underst CLO
UndersUnderstand the concepts of Objects and Classes.
02

CLOUnUnderstand the concept of relationships between classes.

03

CLOUnUnderstand the concept of inheritance and polymorphism.

04

CLOUnUnderstand the concept of container classes.

05

Unit-1
Introduction to object oriented programming, Characteristics, Applications, difference between
object oriented and procedure based programming, object oriented programming languages,
Object oriented concepts: Abstraction, Encapsulation, Polymorphism, Inheritance and
Information Hiding.
Unit-2
Abstract data types, Objects and classes, Attributes and Methods, Objects as software units,
Encapsulation and Information hiding, Objects instantiations and interactions, Object lifetime,
Static and dynamic objects, global and local objects, Metaclass
Unit-3
Relationships between classes, Association of objects, Types of Association, Recursive
Association, Multiplicities, Navigability, Named association, Aggregation of objects. Types of
Aggregation, Delegation, Modeling Association and Aggregation.
Unit-4
Inheritance and Polymorphism, Types of polymorphism, Static and dynamic polymorphism,
Operator and Method overloading, Inherited methods, Redefined methods, the protected interface,
Abstract methods and classes, Public and protected properties, Private operations, Disinheritance,
Multiple inheritance.
Unit-5
Template Classes and Functions, Container Classes, Container types, typical functions and
iterator methods, Heterogeneous containers, Persistent objects, stream, and files, Object oriented
programming languages.
Text Books:
1. David Parsons; Object oriented programming with C++; BPB publication
2. Robert Lafore, Object-oriented programming in Turbo C++, Galgotia Publication.
3. E. Balaguruswami, ”Object Oriented Programming in C++”, TMH.
4. Scott W Amber, The Object Primer , 3/e, Cambridge 2004.
5. Timothy Budd, Object Oriented Programming, 3/e, Pearson Education 2002.
References:
1. Schildt H., Teach Yourself C++, Tata McGraw Hill.
2. Hubbard J. R., Schaum’s Outline of Programming with C++, McGraw Hill.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Differentiate between OO Programming vs Procedural Programming.

CO 02 Understand the OO Programming with its properties.
CO 03 Understand the object-oriented programming paradigm specifically including
abstraction, encapsulation, inheritance and polymorphism.
CO 04 Describe and explain the factors that contribute to a good object-oriented solution,
reflecting in your own experiences and drawing upon accepted good practices.
CO 05 Learn the preliminaries of Object-Oriented modelling and how it helps in software
development.

List of Experiments:
1. Write a program to find out the largest number using function.
2. Write a program to find the area of circle, rectangle and triangle using function
overloading.
3. Write a program to implement complex numbers using operator overloading and type
conversion.
4. Write a program using class and object to print bio-data of the students.
5. Write a program which defines a class with constructor and destructor which will count
number of object created and destroyed.
6. Write a program to implement single and multiple inheritances taking student as the sample
base class.
7. Write a program to add two private data members using friend function.
8. Write a program using dynamic memory allocation to perform 2x2 matrix addition and
subtraction.
9. Write a program to create a stack using virtual function.
10. Write a program that store five student records in a file.
11. Write a program to get IP address of the system.
12. Write a program to shut down the computer system.
 Hours per Week
Course Code Course Name
L T P Credits
CS3CO21 Data Structures 3 1 2 5

Course Learning Objectives (CLOs):

CLO 01 To impart the basic concepts of Data structure and algorithm

CLO 02 To understand concept about Linked lists and and their types.
CLO 03 To understand concept about stacks, and Queue and recursion function
CLO 04 To know various Searching and sorting algorithm with all its complexity and
favourable cases and to understand about hash function and storage management
techniques
CLO 05 To understand about Tree and graph representation
CLO 06 To understanding about writing algorithms and step by step approach in solving
problems with the help of fundamental data structures

Unit -1
Definitions and Types of Data Structures, Concept of Linear and Non Linear, Static and Dynamic,
Primitive and Non Primitive, Persistent and Non Persistent Data structure, Overview of array, one
dimensional array and multidimensional array, Pointers, Recursive functions

Unit -2
Concept of Linked List organization, Singly List, Doubly List, Circular list and doubly circular
Linked List Operations: Linked list implementation of stack and queue, Applications of Linked
List data structure

Unit -3
Stack, Primitive Stack operations, Array Implementation of Stack, Multiple Stack, Application of
stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion, Tower of
Hanoi Problem, Queue, Overview of Queue, Operations on Queue, Circular Queues, Array
implementation of Queues, Dequeue and Priority Queue

Unit -4
Searching and Sorting, Sequential search, Binary Search, Internal and external Sort , Bubble Sort,
Selection Sort, Insertion Sort, Shell Sort, Radix Sort, Quick Sort and Merge Sort. Hashing: Hash
Function, Collision Resolution Strategies, Storage Management: Garbage Collection and
Compaction

Unit -5
Trees, Basic terminology, Binary Trees, Binary Tree Representation, Complete Binary Tree,
Algebraic Expressions, Extended Binary Trees, Array and Linked Representation of Binary trees,
Tree Traversal, Threaded Binary trees, AVL tree, Heaps

Graphs, Basic terminology and types of Graph, Representations of Graphs, Graph Traversal
Text Books:
1. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and Algorithms
2. Tenebaum, Langsam & Augenstein, Data Structures Using C, Pearson
3. Debasis Samanta, Classic Data Structures, PHI learning

References:
1. Horowitz and Sahani, “Fundamentals of data Structures”, University Press
2. Trembley and Sorenson , “Data Structures”, TMH Publications
3. Venkatesan , Rose, “Data Structures” Wiley India Pvt.Ltd
4. Seymour Lipschutz, Data Structures, Schaum’s Outlines Series, TMH

NPTEL Reference:

1. http://nptel.ac.in/courses/106102064/
2. http://nptel.ac.in/courses/106106133/
3. http://nptel.ac.in/courses/106106127/

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Understanding to analyze linear and non linear data structures and its application in
computers science.
CO 02 Evaluate the linked list implementation of stacks and queue.
CO 03 Understanding the concept of Stack and Queue data structure and how they are
implemented and how we can apply their concepts in computer science field as well as
in real life.
CO 04 Understand ing the searching and sorting techniques and he can describe the hash
function and concepts of collision and its resolution methods
CO 05 Analyzing the knowledge of tree and graphs concepts and Solve problem involving
graphs, trees.

Tentative List of Programs:

1. Write the algorithm and program for matrix multiplication of n x n.

2. Write the algorithm and program to Copy Elements of Array in another Array.
3. Write the algorithm and program to insert, delete and search an element in an Array.
4. Write the algorithm and program using pointers to read in an array of integers and print
its elements in reverse order.
5. Write the algorithm and program to implement Stack and perform PUSH and POP
Operation.
6. Write the algorithm and program to reverse the string using stack.
7. Write the algorithm and program to implement circular queue through array.
8. Write the algorithm and program to insert and delete an element into the Queue.
9. Write the algorithm and program to implement Singly Linked List and Doubly Link List.
10. Write the algorithm and program to sort N numbers in ascending order using
a. Bubble sort
b. Insertion sort
c. Selection sort
d. Quick sort
e. Merge sort
f. Radix Sort

11. Write the algorithm for implementing trees and its operations.
12. Write the algorithm and program to represent graphs and its traversal.
13. Write the program to implement travelling salesperson problem.
14. Think of solving a 2x2x2 Rubik’s Cube.
15. Make a list of cities close to Indore for a pilgrimage trip and assign the distances between
the cities. Make a travel plan to cover these cities in minimum distance.
16. Make a study of keeping the library cards of issued books in the library. How do we define
the data structure for it and its efficiency to find the card in minimum time.
 Hours per Week
Course Code Course Name
L T P Credits
CS3CO22 Computer System Architecture 3 1 2 5

Course Learning Objectives (CLOs):

CLO 01 To understand the structure, function and characteristics of computer system

CLO 02 To understand the design of the various functional units and components of
computers
CLO 03 To identify the elements of modern instructions sets and their impact on processor
design.
CLO 04 To explain the function of each element of a memory hierarchy
CLO 05 To identify and compare different methods for computer I/O.

Unit-1
Difference Between Computer Organization and Computer Architecture, Computer Types, Functional
Units, Basic Operational Concepts: Bus Structures, Generation of computer, Introduction to computer
operation with a simple 8bit -instruction computer illustrating assembly and machine language. Register
Transfer language. Register Transfer Bus and memory transfers, Arithmetic Microoperations, logic micro
operations, shift micro operations, Arithmetic logic shift unit.

Unit-2
Instruction codes, Registers, Buses, Design of computer Instructions, Timing and control, Instruction
Cycle, Memory-Reference Instructions, Input-Output Interrupt, Design of Basic Computer, Accumulator
logic. Programming the basic Computer-Machine Language, Assembly Language, Assembler. Address
Sequencing, Microprogram Instructions Format, Addressing Modes.

Unit- 3
Computer Arithmetic- Addition and Subtraction with signed magnitude, Multiplication and Division
Algorithms, Divide Overflow Booth Multiplication Algorithm, Hardware implementation for signed -
Magnitude and hardware algorithms.

UNIT-4
Input -Output Organization. Input-Output Interface, Synchronous vs Asynchronous Data Transfer, Modes
of Transfer- Interrupt and its Priority, DMA. Memory Hierarchy- Main Memory, Auxiliary Memory,
Associative Memory, Cache Memory, Virtual Memory, Memory Management Hardware.

Unit-5
Flynn’s Classification, RISC and CISC Processor, Pipelining and Vector Processing, Parallel Processing,
Array processor, Multiprocessor Architectures Organization, Multi-core Architectures, Inter-processor
Communication, System-on-Chips.

Text Books:
1. Computer System Architecture-M.Morris Mano- Pearson Education III Edition.
2. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, McGraw-Hill.
3. William Stallings, Computer Organization and Architecture – Designing for Performance, Pearson
Education.

Problem and Assignments Book:

1. Nicholas Carter and Raj Kamal, Computer Architecture and Organization, 2nd Edition, Schaum
Outlines, Tata McGraw-Hill Ed., Second Edition.

References:
1. John P.Hayes, Computer Architecture and Organization, McGraw Hill, 3rd Edition.
2. David A.Patterson and John L.Hennessy, Computer Organization and Design: The hardware
software interface, Morgan Kaufmann, 3rd Edition.

Web Resources
 http://www.cs.mcgill.ca/~mhawke1/cs208/02a-ComputerStructureNotes.pdf
 http://www.stat.auckland.ac.nz/~dscott/782/Computers.pdf
 www-csag.ucsd.edu/teaching/cse141-w00/lectures/Introduction.pdf –
 www.cise.ufl.edu/~prabhat/Teaching/cda5155-su09/lecture.html
 www.ecl.incheon.ac.kr/courses/ca6/ca00.syllabus.pdf

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Student will understand the Evolution of Computers and Computer Generations,

Measuring Computer, Technology Trends, Measuring Computer Performance, MIPS.
CO 02 Students will learn about Fundamental concepts of– Execution of a complete instruction
Design of Basic computer, addressing modes, Instruction formats, stack organization.
CO 03 Students will be able solve questions on Number systems, Arithmetic operations on
binary numbers, Floating Point Representation.
CO 04 Students will able to understand basics of Storing data and Program in Memory, Memory
Hierarchy in a Computer, Semiconductor RAMs–ROMs, Cache memories, and virtual
memory.
CO 05 Students will able to understand pipelining, vector processing, Multiprocessor
Architecture organization, Performance, characteristics of Multiprocessors

List of Practical

1. Hardware configuration of Desktop-case, Power Supply, Motherboard- Processor,

Memory, Drive Controllers, Monitor, Keyboard, Mouse, Dismantling and assembly of
Desktops.
2. Detailed study of motherboard-Memory Slot, RAM, Expansion Slot, CPU Socket,
Processor, Heat Sink, Processor FAN, SATA Connectors, North Bridge and South Bridge
chip, ROM BIOS, CMOS Battery, I/O Controller, Chipsets, FDD Header, IDE Header,
AGP Slot, PCI Slot,
3. Types of RAM-SDR, DDR-1, DDR-2, DDR-3, DDR-4. Expansion Slot,
4. Instructions of 8085 microprocessor, Address, opcode, operand, Hex code.
5. Simulation of ALU using C/C++.
6. a)Write a program using 8085 microprocessor assembly language for decimal,
hexadecimal addition and subtraction of two number. Store the result at memory location
XXXX.
b) Write a program using 8085 microprocessor assembly language to find the largest no in
a given array. Store the result at memory location XXXX.
 c) Write a program using 8085 microprocessor assembly language to find the
smallest no. in a given array. Store the result at memory location XXXX.
7. a)Write a program using 8085 microprocessor assembly language to arrange the given
array in ascending and descending order.
b) Write a program using 8085 microprocessor assembly language to find no. of 1’s in
given data byte. Store the result at memory location XXXX.
8. a)Write a program using 8085 microprocessor assembly language to calculate the sum of
series of even number. Store the result at memory location XXXX.
b) Write a program using 8085 microprocessor assembly language to convert binary to
ASCII Hex code. Store the result at memory location XXXX and XXXX+1 location.
c) Write a program using 8085 microprocessor assembly language to multiply two 8 bit
numbers and Store the result at memory location XXXX and XXXX+1 location.
9. a) Write a program using 8085 microprocessor assembly language to add and subtract
numbers in BCD. Store the result at memory location XXXX and XXXX+1 location.
b) Write a program using 8085 microprocessor assembly language to divide and multiply
16 bit no. Store the result at memory location XXXX and XXXX+1 location.
10. Write a program to Implement Booth’s Multiplication Algorithm for Multiplication of 2
signed Numbers in C/C++.
 Hours per Week
Course Code Course Name
L T P Credits
CS3CO29 Digital Electronics 3 1 2 5

Course Learning Objectives (CLOs):

CLO01 To understand the concept of number systems and Boolean Algebra. To learn
minimization of Boolean function by different methods.
CLO02 To understand the concept of Logic gates and other Combinational circuits and their
designing.
CLO03 To learn about Sequential circuits and their implementation using concept of State
machine and To gain awareness of digital circuits and its applications in day to day
life.
CLO04 To learn about Programmable Logic Devices & Memory: Architecture and
characteristics and Analyse, design, and evaluate digital circuits of medium
complexity that are based on SSIs, MSIs, and programmable logic devices.
CLO05 To understand the concept of Logic families. Relation between them with respect to
advancement in technology.

Unit-I: Number System Introduction to binary numbers, data representation, binary, octal,
hexadecimal number system and their conversion, various coding schemes such as BCD codes,
Excess-3 code, Gray code. Binary arithmetic, Boolean Algebra, Basic Theorems and properties
of Boolean Algebra, Boolean Functions, Canonical and Standard forms, minimization techniques,
Sum of products and Product of Sums Simplification, Karnaugh's map method, Quine Mecluskey
method.

Unit-II: Logic Gates and Combinational Logic

Digital Logic Gates such as AND,OR, NAND,NOR, EX-OR,EX-NOR. Realization of Boolean
functions using logic gates. Adders, substractors, BCD adder, magnitude comparator, decoders
and encoders, multiplexers and demultiplers, code converters. Analysis and design of
combinational circuits. Implementation of combinational logic using multiplexers, decoders etc.

Unit-III: Sequential Circuits

Introduction, comparison of sequential and combinational circuits. Various types of flip-flops and
their conversions, triggering of flip flops, timing issues, setup and hold times, registers, counters,
ring, johnson, asynchronous and synchronous. Finite state machines, Moore and Mealy, design of
synchronous sequential circuits.

Unit-IV: Memories
ROM, PLA and PAL. Memories: organisation and construction of RAM, SRAM, DRAM, ROM,
PROM, EPROM, EEPROM.

Unit-V Logic Families

DTL, RTL, TTL, IIL, PMOS, NMOS and CMOS logic families, interfacing between TTL and
MOS vice-versa.
Text Books:
1. D Roy Chudhury, Digital Circuits,Vol-I & II, Eureka Publication.
2. M. Mano, Digital and Computer Design, Pearson Education.

References:
1. Leach and Malvino, Digital Principles and Applications, TMH.
2. Millman and Taub, Pulse, Digital and Switching Waveforms, MGM.
3. A. Anand Kumar: Digital Circuits, PHI.
4. Salivahanam and Ari Vahagan: Digital Circuits and Design, Vikas Publishing House.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Have a thorough understanding of the fundamental concepts and techniques used in
digital electronics.
CO02 To understand and examine the structure of various number systems and its application
in digital design.
CO03 The ability to understand, analyze and design various combinational and sequential
circuits using programmable logic.
CO04 Ability to identify basic requirements for a design application and propose a cost
effective solution.
CO05 To develop skill to build and troubleshoot digital circuits.
 Course Hours per Week
Course Name
Code L T P Credits
EN3MC09 Soft Skills-II 2 0 0 0

UNIT 1
Body Language and professionalism: To make participants aware of the importance of Body
language trains them to project a better outlook of themselves. This helps in presenting themselves
in Personal interview and Group discussions. Grooming and presenting oneself are the main focus.
Interview dress code, facial expressions, body language, hand shake etiquettes etc., are dealt in
the session. Worksheets, anecdotes, videos and role-plays are some of the important components
of the session.
Interpersonal skills: Effective interpersonal skills are crucial to increase employment
opportunities and to compete in the business environment. This session makes the participants
understand different barriers to proper interpersonal communication and to tackle them head-on.
Activities are an integral component of the session.
Reporter: The aim of the session is to make every student ask rational questions and make
diplomatic replies. The session is a press- meet like group activity session.
UNIT 2
Team Building: • To make every student intermingle within a team and contribute to the team’s
success. To make them understand the importance of working as a team. Importance of
complimentary skill sets, and synergy effects of a team are proved using real-life examples and
classroom activities.
Picture connector: To make the students participate in group interactions, create dialogue and
present on the stage. Students link various pictures from newspaper to come up with a pictorial
representation of a story or idea and narrate/present the same. Creativity and presentation skills
are concentrated. Students also learn to connect various variables and come up with concrete ideas.
UNIT 3
Time and work: Work with different efficiencies, Pipes and cisterns, Work equivalence, Division
of wages
Goal Setting: • To make students goal oriented and to help them realise and sketch their personal
and professional goals. SMART goal technique for goal setting is taught and explained using
examples. Students will be encouraged to set a personal and career goal based on the SMART
technique. Tactics to deal with hurdles for attaining the goals are dealt. Famous goal setting
success stories are shared to boost confidence.
UNIT 4
Time Management: To make students understand the value of time and effective management of
their time. Paper tower activity helps students practically experience the importance of managing
time and to improve at it. Time management grid helps students understand the importance of
prioritizing.
Tourism pitch: The session makes students present and promotes their choice of tourist spot or
their favourite city in order to convince the client (trainer) to visit the city. Presentation skills are
enhanced. Teamwork is practised during the preparation phase of the activity.

UNIT 5
Shopping role play: To enable students to frame dialogues for their day-to-day life scenarios. A
shopping scenario has to be mimicked by the students with impromptu conversation. This helps
them in practising speaking in English in their daily conversations. Sample everyday conversations
are presented for practical learning.
Shipwreck: The main objective of this is to enhance the skill capacity of the students to think out
of the box and try to enhance the cognitive thinking capability.
Play teacher: The session makes students understand the different values and virtues like
empathy- by which they will try to enact the scenario given to them try solving the problem like
an adviser.
SEMESTER – IV
Sr.
Course Code Courses L T P Credit
No.
1 CS3EXXX Elective-1 3 0 0 3
2 CS3CO10 Theory of Computation 3 1 0 4
3 CS3CO28 Data Communication 3 0 0 3
4 CS3CO25 Database Management Systems 3 1 2 5
5 CS3CO08 Computer Programming – II 2 0 2 3
6 CS3CO09 Operating Systems 3 1 2 5
7 CS3ES12 Software Workshop-I 0 0 2 1
8 EN3MC01 Open Learning Courses 1 0 0 0
Total 18 3 8 24
Total Contact Hours 29
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3ED06 Data Science
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO01 : To know about Data Science.
CLO02 :Basic principles of implementing Data Science techniques.
CLO03 :Knowledge of EDA and other pre-processing.
CLO04 :Broad perspective of Hybrid machine learning techniques
and 3D visual information.
CLO05 :Dealing with python tool.

Unit I
Introduction to Data Science, Definition and description of Data Science, history and
development of Data Science, terminologies related with Data Science, basic framework and
architecture, importance of Data Science in today’s business world, primary components of
Data Science, users of Data Science and its hierarchy, overview of different Data Science
techniques.
Unit II
Sample spaces, events, Conditional probability and independence. Random variables.
Discrete and continuous random variables, densities and distributions, Normal distribution
and its properties, Introduction to Markov chains, random walks, Descriptive, Predictive and
prescriptive statistics, Statistical Inference, Populations and samples, Statistical modeling,
Unit III
Exploratory Data Analysis and the Data Science Process - Basic tools (plots, graphs and
summary statistics) of EDA - Philosophy of EDA - The Data Science Process - Case Study:
Unit IV
Data Visualization: Basic principles, ideas and tools for data visualization, Examples of
inspiring (industry) projects, Exercise: create your own visualization of a complex dataset.
Unit V
NoSQL, use of Python as a data science tool, Python libraries: SciPy and sci-kitLearn,
PyBrain, Pylearn, Matplotlib, challenges and scope of Data Science project management.
Text books
1. Data Science from Scratch: First Principles with Python 1st Edition by Joel Grus
2. Principles of Data Science by Sinan Ozdemir, (2016) PACKT.

Reference Books
1. Data Science For Dummies by Lillian Pierson (2015)
2. Data Science for Business: What You Need to Know about Data Mining and Data-Analytic
Thinking by Foster Provost, Tom Fawcett

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO01 Understand the interactive Data Science Technology.
CO02 Fundamentals of Conditional probability and independence.
CO03 Knowledge of Philosophy of EDA - The Data Science Process.
CO04 Broad perspective of Data Visualization.
CO05 Dealing with Statistical Inference and python programming.
List of Experiments
1. Installation, configure and run R Complier.
2. a) Write a Program to Calculate Mean of a given dataset using R.
2. b) Write a Program to Calculate Mode of a given dataset using R.
2. c) Write a Program to Calculate Median of a given dataset using R.
3. a) Perform cleaning of a given data set (EDA) using R.
3. b) Perform transformation of a given data set (EDA)
using R. 4.PerformData Visualization using Pie Chart
Plotting Framework using R .
5. Perform Data Visualization using Bar Chart Plotting Framework using R.
6. Perform Data Visualization using Boxplot Plotting Framework using R.
7. Perform Data Visualization using Histogram Plotting Framework using R.
8. Perform Data Visualization using Line Graph Plotting Framework using R.
9. Perform Data Visualization using Scatterplot Plotting Framework using R.
10. Perform reading data using Pandas library of Python.
11. . Perform any operation of Numpy library of Python.
12. . Perform data Visualization using Matplotlib library of Python.
10. Case study to realize storage of big data using H base, Mongo DB.
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3EW01 Internet and Web Technology
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO01 Describe how protocol work in website .
CLO02 Describe Application which are used in daily life regarding website
CLO03 Describe web design tools
CLO04 Website Creation Tool
CLO05 Use of XML and its importance
CLO06 Describe PHP and their function
CLO07 Describe Java and their application
CLO08 Describe security over the internet
Unit – I Introduction: Concept of WWW, HTTP Protocol: Request and Response, Web browser
architecture and Web servers and Application server, Features of Web 2.0, Internetworking with
TCP/IP, basics of DNS, SMTP, POP3.
Unit - II Web Design: Concepts of effective web design, Planning and publishing website,
Introduction to web architecture, HTML: list, tables, images, frames, forms, Document type
Definition (DTD), Document Object Model (DOM), Cascading Style Sheets and their types,
Java Script: Introduction, documents, forms, statements, functions, objects.
Unit - III Introduction to XML, XML vs HTML uses of XML, simple XML, XML key
components, DTD and Schemas, embedding XML into HTML documents, Transforming XML
using CSS, XSL and XSLT.
Unit - IV PHP: working with variables and constants, controlling program flow, working with
functions, arrays, files and directories, working with forms and databases, Introduction to
Servlet, Lifecycle, API, and Servlet Packages.
Unit - V Introduction to Java Server Page (JSP), JSP Application Design, JSP objects,
Conditional Processing, Declaring variables and methods, sharing data between JSP pages,
Sharing Session and Application Data, Database Programming using JDBC, web application
framework, MVC framework, Introduction to bootstrap, angular JS.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO01 Analyse the requirements for a website creation
CO02 Analyse the application that uses in daily life
CO03 Knowledge of website creating tools
CO04 Creating website by tool
CO05 Collaborate the website by using XML
CO06 Perform some online services which are used in website creation by PHP
CO07 Analysis about technology which are used in websites
CO08 Analysis Security function of website and their tools.
 Course Code Course Name Hours Per Week
L T P Credits
CS3EA01 Artificial Intelligence
3 0 0 3

Course Learning Objectives (CLOs):

CLO01 Introduce Artificial Intelligence and various search algorithms

CLO02 To teach the fundamentals of knowledge representation (logic-based, frame-based,
semantic nets), inference and theorem proving
CLO03 To teach reasoning and learning in AI
CLO04 To teach the fundamentals of AI to solve real world problems.
CLO05 To demonstrate Game Playing Strategies.
CLO06 To introduce basics of Machine Learning and Deep Learning .

Unit 1: Introduction to artificial intelligence, various types of production systems,

Characteristics of production systems, Study and comparison of breadth first
search and depth first search techniques.
Unit 2: Optimization Problems: Hill-climbing search Simulated annealing like
hill Climbing, Best first Search. A* algorithm, AO* algorithms etc, and various
types of control strategies, Heuristic Functions, Constraint Satisfaction Problem.

Unit 3: Knowledge Representation, structures, Predicate Logic, Resolution,

Refutation, Deduction, Theorem proving, Inferencing,Semantic networks,
Scripts, Schemas, Frames, Conceptual dependency.

Unit 4: Uncertain Knowledge and Reasoning, forward and backward

reasoning,monotonic and nonmonotonic reasoning, Probabilistic reasoning,
Baye’s theorem, Decision Tree, Understanding, Common sense, Planning.

Unit 5: Game playing techniques like minimax procedure, alpha-beta cut-offs

etc, Study of the block world problem in robotics.
Text Book:
1. Elaine Rich, Kevin Knight and Nair, Artificial Intelligence, TMH

2. S. Russel, Peter Norvig, Artificial Intelligence: A Modern Approach,

Pearson.
References:

1. Saroj Kausik, Artificial Intelligence, Cengage Learning 4

2. Padhy, Artificial Intelligence and Intelligent Systems, Oxford University

Press,

3. Nils Nilsson, Artificial Intelligence: A New Synthesis, Morgan Kaufmann.

Course Outcomes (COs):
After completion of this course the students shall be able to:

CO01 To understand strategies for solving various search problems in AI

CO02 To get familiar with algorithms in AI.
CO03 To understand the fundamentals of knowledge representation in AI
CO04 To understand working knowledge of reasoning in the presence of incomplete and/or
uncertain information
CO05 To apply knowledge representation, reasoning, and natural language techniques to
robotics problems.
CO06 To understand the game theory and apply it in various applications
 Course Code Course Name Hours Per Week
Theory of Computation L T P Credits
CS3CO10
3 1 0 4

Course Learning Objectives (CLOs):

CLO 01 To define mathematical methods of computing devices, called abstract machines,

namely Finite Automata, Pushdown Automata, and Turning Machines

CLO 02 Employ finite state machines to solve problems in computing.

CLO 03 Identify different formal language classes and their relationships

CLO 04 Determine the decidability and intractability of computational problems

CLO 05 Comprehend the hierarchy of problems arising in the computer sciences.

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO The student will be able to explain the application of machine models and descriptors to
01

compiler theory and parsing

CO Students will be able to relate practical problems to languages, automata, computability,
02

and complexity
CO Students will be able to apply mathematical and formal techniques for solving problems
03

in computer science.
CO Students will demonstrate an increased level of mathematical sophistication.
04

CO Students will be able to explain the relationship among language classes and grammars
05

with the help of Chomsky Hierarchy.

CO The student will be able to demonstrate abstract models of computing, including
06

deterministic (DFA), non-deterministic (NFA), Push Down Automata (PDA) and Turing
(TM) machine models and their power to recognize the languages

Prerequisite:
Students should have a background in discrete mathematics, data structures, and programming languages.
COURSE CONTENTS
Unit-I: Finite Automata and Regular Languages
Motivation for studying theory of computation, Notion of formal languages and grammars, Kleene’s
Closure, Regular Expressions and Regular languages, closure properties of regular languages, Finite
Automata. Finite Automata with output: Mealy and Moore machines, applications.
Unit-II: Nondeterminism and Minimization
Nondeterministic Finite Automata, Acceptance condition. Kleene’s Theorem, Myhill-Nerode relations,
Minimization Algorithm, Non-Regular languages, Pumping Lemma for regular languages.
Unit-III: Grammars and Context-Free Languages
Grammars and Chomsky Hierarchy, Context-Free Grammars, Context-Free Languages (CFLs), Inherent
Ambiguity of CFLs, closure properties of CFLs, Eliminating useless symbols; null-productions; and unit
productions, Chomsky Normal Form, Greibach Normal Form, Cock-Younger-Kasami(CYK) Algorithm,
Applications to Parsing.
Unit-IV: Pushdown Automata
Pushdown Automata (PDAs), PDAs vs CFLs. Deterministic PDAs and CFLs, applications, notion of
acceptance for PDAs: acceptance by final states, and by empty stack; the equivalence of the two notions,
Proof that CFGs generate the same class of languages that PDAs accept, Pumping Lemma for CFLs.
Unit-V: Turing Machines and Computability
Introduction to Turing Machines, Configurations, Halting vs Looping, Turing computability,
Nondeterministic, multitape and other versions of Turing machines. Church`s thesis, Universal Turing
Machines, Linear Bounded Automata (LBAs) and context-sensitive languages, Recursive and Recursively
enumerable languages, Undecidability of Halting Problem and unsolvable problems about Turing
Machines, the diagonalization language and proof that it is not Recursively enumerable.
Text Books:
1. Peter Linz, An Introduction to Formal Languages and Automata, Jones & Bartlett Learning, Canada.
2. John C. Martin, Introduction to Languages and the Theory of Computation, Tata McGrawHill.

Reference Books:
1. J.E. Hopcroft, Rajeev Motwani and J.D.Ullman, Introduction to Automata, Languages and ‘
Computation, Pearson Education, Asia.
2. Daniel I.A. Cohen, Introduction to Computer Theory, John Wiley.
3. H.R. Lewis and C.H.Papadimitrou, Elements of the Theory of Computation, Prentice Hall Inc.
 Course Code Course Name Hours Per Week
L T P Credits
CS3CO28 Data Communication
3 0 0 3

Course Learning Objectives (CLOs):

CLO 01 To understand technologies related to Data Communication.

CLO 02 To understand how to encode and compress the data.
CLO 03 To get familiar with various switching techniques. This may cover old, new and
existing techniques.
CLO 04 To get introduced with various models and their basic functions. Also to know the
layering concept of such models.
CLO 05 To understand functions of Data Link Layer, how flow and error control gets
managed in networking.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Understand the fundamental concepts of data communications and networking and the
functioning of physical layer, its components and techniques.
CO02 Comprehendthemselves various coding, bandwidth spreading and multiplexing
techniques.
CO03 Understand various network switching techniques and network topologies.
CO04 Acquaint themselves with various layered network models and its services to
understand the working of internet.
CO05 Acquaint themselves with various error control and flow control mechanisms.

UNIT-I:
Introduction to digital communications, Components, Data Representation, Data Flow. Analog and Digital
Signals and their representation, Transmission Impairment, Data Rate Limits- Nyquist's theorem,
Shannon's theorem, Signal propagation, Signal types, Transmission mode and techniques, Transmission
Media-Guided and Non-Guided, Noise.

UNIT-II:-
Encoding of Signals -Analog to Digital Conversion, Digital to Digital conversion, - Unipolar, Polar, Bipolar
line & block codes, Digital to Analog, Analog to Analog conversion, Spread Spectrum-FHSS, DHSS,
CDMA. Modulation and Demodulation of Signals. Multiplexing: FDM, TDM, and WDM, QAM.
Data compression-Frequency dependant codes, Run length encoding, Relative encoding, LZ Compression.

UNIT-III
Switched Communication Networks: Circuit, Message, Packet & Hybrid Switching, Data Gram Network,
Connection oriented services Vs Connectionless services. Public Switching Telephone Network, Digital
Subscriber Line, ADSL, HDSL, SDSL, VDSL. Study of various types of topology and their comparative
study.

UNIT-IV
Reference model- OSI and TCP/IP model and its comparison, Layers in the model and its requirement,
critiques of OSI and TCP/IP model, Use of Computer Networks. Architecture of Internet. Addressing-
Physical, Logical, Port. Various Networking devices, Peer to Peer Protocols and service model.

UNIIT-V
Data Link Layer:-Transmission Errors : Content Error ,Error detection & Error correction ,Bit error rate ,
Error detection methods: Parity checking , Checksum Error Detection ,CRC ,Hamming code . Framing,
Flow error Control - ARQ, Sliding Window Protocol, HDLC and PPP. L-2 Switches, Bridges.

Text Book:
1. Andrew S.Tannenbaum, Computer Networks, Pearson Education.
2. William Stallings, Data and Computer Communication, Pearson Education.
3. Behrouz A.Fourouzan, Data Communication and Networking, Mc Graw Hill Publication.
4. Alberto Leon-Garcia, Indra Widjaja, Communication Networks-Fundamental concepts and key
Architecture, TMH.

Reference Books:
1. Aftab Ahmad, Data Communication Principles for fixed and wireless networks, Kluwer Academic
Publishers.
2. Gilbert Held, Data Communications Networking Devices:-Operation, Utilization, Lan and Wan
Interworking, John Wiley and Sons.
 Hours per Week
Course Code Course Name L T P Credit

CS3CO25 Database Management System 3 1 2 5

Course Learning Objectives (CLOs):

CLO 01 Have a broad understanding of database concepts and database management system
software
CLO 02 Have a high-level understanding of major DBMS components and their function
CLO 03 Be able to model an application’s data requirements using conceptual modeling tools
like ER diagrams and design database schemas based on the conceptual model.
CLO 04 Be able to write SQL commands to create tables and indexes, insert/update/delete
data, and query data in a relational DBMS.
CLO 05 Be able to program a data-intensive application using DBMS APIs.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Identify the basic concepts and various data model used in database design ER
modelling concepts and architecture use and design queries using SQL
CO 02 Apply relational database theory and be able to describe relational algebra expression,
tuple and domain relation expression from queries.
CO 03 Recognize and identify the use of normalization and functional dependency, indexing
and hashing technique used in database design.
CO 04 Recognize/ Identify the purpose of query processing and optimization and also
demonstrate the basic of query evaluation.
CO 05 Apply and relate the concept of transaction, concurrency control and recovery in
database.
CO 06 Understanding of recovery system and be familiar with introduction to web database,
distribute databases, data warehousing and mining.

Unit-1
Basic Concepts: Data Vs Information, Definition of Database, Advantages of Database Systems,
Components of DBMS, DBMS Architecture and Data Independence, Data modeling, Entity
Relationship Model, Relational, Network, Hierarchical and Object Oriented Models. Data
Modeling Using The Entity Relationship Model.

Unit-2
Relational Database: Relational Databases, Relational Algebra, Relational Algebra Operation,
Tuple Relational Calculus, Domain Relational Calculus. Data Definition with SQL, Inserts, Delete
and Update Statements in SQL, Views, Data Manipulation with SQL, PL/ SQL constructs:
Triggers, Cursors etc.

Unit-3
Database Design: Design Guidelines, Key concepts, Relational Database Design, Integrity
Constraints, Domain Constraints, Referential Integrity, Functional Dependency, decomposition,
Normalization Using Functional Dependencies: Normal Forms, First, Second and Third Normal
Forms. Boyce Codd Normal Form, Multivalued Dependencies and Forth Normal Form, Join
Dependencies and Fifth Normal Form, Decomosition in 2NF, 3NF and BCNF.

Unit-4
Database Transactions Processing: Introduction to Transaction Processing, Transaction Concepts,
Desirable Properties of Transactions, Schedules, Concepts of Recoverability and Serializability,
Concurrency control: introduction, locking protocols.

Unit-5
Query Processing and Optimization, File organization and indexes, hashing techniques, B tree, B+
tree etc. Introduction to advanced databases: Distributed databases, Object oriented databases,
mobile and web databases, Introduction to data warehousing and mining.

Text Books:
1. F.R. Mcfadden, J. Hoffer, M.Prescott, Modern Database Management, Addison Wesley.
2. Elmasri, Navathe, Fundamentals of Database System, Pearson Education Asia.

References:
1. C.J. Date, An Introduction to Database Systems, Pearson Education Asia.

2. Henry F Korth, Abraham Silbershatz, Database System Concepts, Mc Graw Hill .

List of lab Experiments done in lab based on above objectives:

1. SQL Basics:Apply SQL SELECT statements on “Employees” table.

2. Apply Following Compound condition and use relational operators (IN, BETWEEN, LIKE,
NULL, NOT NULL etc) in SQL statements on “Employees” and “Department” table.
3. Creating new tables, Adding data, updating data, altering tables, deleting data.
4. . Implementation of different integrity constraints like Referential Integrity Constraint, entity
integrity constraint and domain Constraints.
5. Perform operations like Natural Join, equijoin, left outer join, right outer join, full outer join,
intersection, union, union all and minus on given relations.
6. Sub-queries: Single-Row Sub-queries, Multiple row Sub-queries, Scalar Sub-queries, Sub
queries in other DML statements., nested queries.
7. Creating views, modifying views, dropping views, inserting and updating data using views.
8. Introduction to PL/SQL:
1. Print ‘Hello World’ in PL/SQL.
2. learn how to declare a character type variable.
3. Insert data to a table using character type variable.
 4. Update the data value of a table.
5. Delete the data value of a table.
9. Design a database of a car insurance company and perform the SQL queries on that database
also Construct an E-R diagram for the same.
Express the following queries in SQL:
1. Find the total number of people who owned cars that were involved in accidents in 1989.
2. Find the number of accidents in which the cars belongs to ‘Johns Smith’ were involved.
3. Add a new accident to the database, assume any values for required attributes.
4. Delete the Toyota belonging to ‘John Smith’. (hint: here model is not the key of the car relation.)
5. Update the damage amount for the car with license number ‘AABB2000’ in the accident with
report number ‘AR2197’ to $3000.

10. Introduction to PL/SQL triggers and cursors

 Course Code Course Name Hours Per Week
L T P Credits
CS3CO08 Computer Programming-II Java
2 0 2 3

Course Learning Objectives (CLOs):

Underst CLO
Understand the fundamental programming concepts of Java.
01

Underst CLO
Understand the object oriented programming concepts.
02

CLOUnderstand the concept of multiprogramming and run time problems (exception).

03

CLOUnderstand the basic of graphical programming using AWT.

04

CLOUnderstand graphical programming using Swing and desktop application development.

05

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Understand the fundamental programming concepts and programming logic building.

CO 02 Understand the OO Programming with its properties.
CO 03 Understand the concept of multiprogramming and handling of exceptions.
CO 04 Design the graphical program to understand the GUI programming.
CO 05 Develop the graphical user interface forms to perform basic operations like Arithmetic,
click event etc.

Unit I: Basics of JAVA: Overview of Java, History and Evolution of Java, Feature of Java,
Difference between Java, C++ and C, Structure of java program, Basics of JDK, JRE and JVM,
Installation of JDK, Simple Java Program, Compilation and Execution of Java program. Elements
of Java: keywords, data types, variable, declaration and initialization of a variable, the scope and
life time of variable, constants, literals, identifiers, operators, types of java statements, Unicode
System, Naming Convention, Comments, Arrays, type conversion and casting.
Unit II: Dynamic Method Dispatch: Garbage Collection, static and dynamic binding, Inheritance
and its types, Interfaces. Java Packages: Definition of package, types of package, differentiate
package from header file, importing package, creating package.
Unit III: String in Java: Overview of string, Immutable String, String Comparison, String
Concatenation, Substring, Methods of String class, String Buffer class, Creating Immutable class
to_String method.
Unit IV: Exception Handling: Defining exception, types of exception, exception class, try and
catch block, multiple catch blocks, Nested try, finally block, throw keyword, Exception
Propagation, throws Keyword. Multithreading: Overview of thread, thread types, Life Cycle of a
thread, Creating thread, Sleeping a thread, joining a thread, thread Priority, Daemon thread.
Unit V: I/O Handling: File Output Stream & File Input Stream, Buffered Output Stream &
Buffered Input Stream, Input from keyboard by Input Stream Reader, Input from keyboard by
Console, Input from keyboard by Scanner, Print Stream class. Java Applets: Applet Basics, the
Applet Class, Applet Architecture, Applet Initialization and Termination, the HTML APPLET
Tag, Passing Parameters to Applets. Introducing the AWT: Introduction to Windows, Graphics,
and Text, AWT Classes, Window Fundamentals, Component, Container, Panel, Frame.
Text Books:
2. E. Balagurusamy, Programming with java A Primer, McGraw-Hill.
3. Herbert Schildt, The Complete Reference Java 2, Tata McGraw-Hill.
4.
References:
1. Horstmann & Cornell, Core Java 2 (Vol I & II), Pearson.
2. Sharanam Shah, Core Java 8 for Beginners, Shroff Publisher.
3. Joshua Bloch, Effective Java, Sun Microsystems.

List of Experiments:
1. Write a program that accepts two numbers from the user and print their sum.
2. Write a program to calculate addition of two number using prototyping of methods.
3. Program to demonstrate function overloading for calculation of average.
4. Program to demonstrating overloaded constructor for calculating box volume.
5. Program to show the detail of students using concept of inheritance.
6. Program to demonstrate package concept.
7. Program to demonstrate implementation of an interface which contains two methods
declaration square and cube.
8. Program to demonstrate exception handling in case of division by zero error.
9. Program to demonstrate multithreading.
10. Program to display “Hello World” in web browser using applet.
11. Program to add user controls to applets.
12. Write a program to create an application using concept of swing.
 Hours per Week
Course Code Course Name L T P Credit

CS3CO09 Operating Systems 3 1 2 5

Course Learning Objectives (CLOs):

CLO To understand the fundamental operating system such as Batch, Time sharing, parallel
01

and System software.

CLO Analyze important algorithm like process scheduling and to understand the deadlock
02

management techniques.
CLO Categories the operating system’s memory management techniques.
03

CLO To gain knowledge of virtual memory and get familiar with operating system security
04

aspects.
CLO Demonstrate the significance of disk scheduling algorithm, file system and to
05

understand the ability to perform operating system tasks.

Unit-1 Introduction Language Processors, Language Processing Activities and Language

Processors Development Tools, Assemblers, Compiler, Macros and Macro Processors, Linkers,
Introduction to OS. Operating system functions, evaluation of O.S., Different types of O.S.: Batch,
Multi-Programmed, Time-Sharing, Real-Time, Distributed, Parallel.

Unit-2 Process: Concept of Processes, Process Scheduling, Operations on Processes, Cooperating

Processes, Inter-Process Communication. Precedence Graphs, Critical Section Problem,
Semaphores, Threads. CPU Scheduling: Scheduling Criteria, Preemptive & Non-Preemptive
Scheduling, Scheduling Algorithms, Algorithm Evaluation, Multi-Processor Scheduling,
Deadlock: Deadlock Problem, Deadlock Characterization, Deadlock Prevention, Deadlock
Avoidance, Deadlock Detection, Recovery From Deadlock, Methods for Deadlock Handling.

Unit-3 Memory Management: Concepts of Memory Management, Logical and Physical Address
Space, Swapping, Fixed and Dynamic Partitions, Best Fit, First Fit and Worst Fit Allocation,
Paging, Segmentation, and Paging Combined With Segmentation.

Unit-4 Concepts of Virtual Memory, Cache Memory Organization, Demand Paging, Page
Replacement Algorithms, Allocation of Frames, Thrashing, Demand Segmentation, Role of
Operating System in Security, Security Breaches, System Protection, and Password Management.

Unit 5 Disk Scheduling, File Concepts, File Manager, File Organization, Access Methods,
Allocation Methods, Free Space Managements, Directory Systems, File Protection, File
Organization & Access Mechanism, File Sharing Implement Issue, File Management in Linux,
Introduction to Distributed Systems.

Text Books:
 1. Silberschatz, Galvin, Operating Systems Concepts, Wiley Publications.
2. Andrew S. Tenenbaum, Modern Operating Systems, Pearson Education Asia / PHI.

References:

1. Terrence Chan, UNIX System Programming Using C++, Prentice Hall India.
2. W. Richard Stevens, Advanced Programming in UNIX Environment, Pearson Education.
3. William Stallings, Operating Systems, Pearson Education Asia.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Master the basic concept related to operating system and system software.
CO02 Analyze the basic concept of process management and evaluate
performance of process
scheduling algorithm and apply the concept of synchronization and
Deadlock.
CO03 To apply the concept of memory management techniques.
CO04 To apply virtual memory concepts and understand the system security
aspects.
CO05 To analyze the techniques of disk scheduling.
 Course Code Course Name Hours Per Week

L T P Credits
CS3ES12 Software Workshop-I
0 0 2 1

This course has been associated with program electives of corresponding semesters. The lab
experiments of respective program electives will be performed during the lab hours for respective
students.

Course Learning Objectives (CLOs):

CLO01 To study and discuss various techniques and algorithms of AI used in general problem
solving, optimization problems, constraint satisfaction problems, and game
programming.
CLO02 To familiarize students with PROLOG.
CLO03 to introduce PROLOG language, Data Objects and basic
concepts (Atoms, Variables, Structures, Predicate, Facts, Clauses, Queries and Rules)
used in prolog.
to introduce PROLOG language, Data Objects and basic
concepts (Atoms, Variables, Structures, Predicate, Facts, Clauses, Queries and Rules)
used in prolog.
to introduce PROLOG language, Data Objects and basic
concepts (Atoms, Variables, Structures, Predicate, Facts, Clauses, Queries and Rules)
used in prolog.
To introduce Prolog language, and basic concepts and Constructs used in prolog.
CLO04 To enable students to work on various AI tools.
CLO05 To familiarize students with various sub-areas of AI, such as expert systems, natural
language processing and machine learning.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Understand the application of AI.

CO02 Implement the basic searching Techniques.
CO03 Be aware of AI Tools
CO04 Be aware of Logical Programming and its Constructs.
CO05 Implement the program in Prolog.
SEMESTER – V
Sr.
Course Code Courses L T P Credit
No.
1 CS3CO24 Computer Graphics & Multimedia 3 1 2 5
2 CS3CO26 Software Engineering 3 1 2 5
3 CS3CO12 Computer Networks 3 1 2 5
4 OE000XX Open Elective-1 3 0 0 3
5 CS3EXXX Elective-2 3 0 0 3
Universal Human Values & Professional
6 EN3MC15 2 0 0 0
Ethics
7 EN3MC10 Soft Skills-III 2 0 0 0
8 CS3ES13 Software Workshop-II 0 0 2 1
Total 19 3 8 22
Total Contact Hours 30
 Hours per Week Total
Course Code Course Name L T P Credit
Computer Graphics &
CS3CO24 3 1 2 5
Multimedia

Course Learning Objectives (CLOs):

CLO 01 To know about basic of computer graphics and graphics techniques

CLO 02 Basic principles of implementing computer graphics primitives and transformations
CLO 03 Knowledge of display systems, image synthesis, shape modelling, viewing,
transformations, and interactive control of 3D computer graphics applications
CLO 04 Get perspective of modern computer system with modelling, analysis and
interpretation of 2D and 3D visual information
CLO 05 Understanding of multimedia (audio, video etc.) and animation

Unit-1
Introduction to Raster Scan Displays, Pixels, Frame Buffer, Vector & Character Generation,
Random Scan Systems, Display Devices, Scan Conversion Techniques, Line Drawing: Simple
DDA, Bresenham’s Algorithm, Circle Drawing Algorithms: Midpoint Circle Drawing and
Bresenham’s Algorithm, Polygon Fill Algorithm: Boundary-Fill and Flood-Fill Algorithms.

Unit-2
2-D Transformation: Translation, Rotation, Scaling, Shearing, Reflection. Inverse
Transformation, Homogenous Coordinate System, Matrices Transformation, Composite
Transformation. Windowing & Clipping: World Coordinate System, Screen Coordinate System,
Viewing Transformation, Line Clipping & Polygon Clipping Algorithms.

Unit-3
3-D Transformations: Translation, Rotation and Scaling. Parallel & Perspective Projection: Types
of Parallel & Perspective Projection, Hidden Surface Elimination: Depth Comparison, Back Face
Detection Algorithm, Painter’s Algorithm, and Z-Buffer Algorithm.

Unit-4
Curve Generation, Bezier and B-spline Methods. Basic Illumination Model: Diffuse Reflection,
Specular Reflection, Phong Shading, Gouraud Shading, Ray Tracing, Color Models like RGB,
YIQ, CMY, HSV.

Unit-5
Multimedia: Characteristics of a Multimedia Presentation, Multimedia Architecture, Text –Types,
Unicode Standard, Text File Formats, Audio- Components of an Audio System, Digital Audio,
Digital Audio Processing, Audio File Formats, Video- Digital Video, Digital Video Processing,
Video File Formats.
Animation: Uses of Animation, Principles of Animation, 3D Animation, Animation File
Formats, Animation Software, MPEG Standards.
Text Book:
1. Donald Hearn and M.P. Becker Computer Graphics Pearson Pub.
 2. Vaughan, Tay. Multimedia: Making it work. Tata McGraw-Hill Education.
References:
1. Parekh, Principles of Multimedia, Tata McGraw Hill.
2. Rogers, "Procedural Elements of Computer Graphics", Tata McGraw Hill.
3. Maurya, Computer Graphics with Virtual Reality System, Wiley India.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Understand the interactive computer graphics architecture

CO 02 Fundamentals of graphics objects and algorithms.
CO 03 Knowledge of display systems, image synthesis, shape modelling, viewing,
transformations, and interactive control of 3D computer graphics applications
CO 04 Broad perspective of modern computer system with modelling, analysis and
interpretation of 2D and 3D visual information.
CO 05 To know about multimedia and animation.
 Course Code Course Name Hours Per Week
Software Engineering L T P Credits
CS3CO26
3 1 2 5

Course Learning Objectives (CLOs):

Knowledge of basic SW engineering methods and practices, and their appropriate

CLO01 application. Along with general understanding of software process models such as the
waterfall and evolutionary models
CLO02 Understanding of software requirements and the SRS documents.
Describe data models, object models, context models and behavioural models with
CLO03
Understanding of different software architectural styles.
Understanding of software testing approaches such as unit testing and integration
CLO04
testing. Describe software measurement and software risks.
Understanding on quality control, software metrics and how to ensure good quality
CLO05
software.

Unit 1
Software Engineering – Definition, Process, Evolution and Myths, Generic Process Model,
Framework, Process Models – Waterfall, Incremental, Evolutionary, Spiral, Component Based
Model, Rational Unified Process
Unit 2
Requirement Analysis, Stakeholders, Elicitation Techniques, Requirement Modelling - Use
Cases, Activity Diagrams, Swimlane Diagrams, Data Modelling, Data Flow Diagram, Overview
of Class Based Modelling, requirement Tracking
Unit 3
Principles of Software Design, Design Concepts – Abstraction, Architecture, Modularity,
Relationships, Design Model, Component Design, User Interface Design, Configuration
Management
Unit 4
Software Quality, Approaches for Quality Assurance, Software Testing, Verification and
Validation, Types of Testing, Risk Assessment, Risk Mitigation, Monitoring and Management
Unit 5
Software Metrics, Process Metrics, Product Metrics, Function Oriented Metrics, Software
Project Estimations, Function Point Based Metrics, COCOMO Models, Project Scheduling,
Effort Distribution
Text Book:
1. Roger S. Pressman, Software Engineering: A Practitioner’s Approach, McGraw-Hill.
2. Ian Sommerville, Software Engineering, Pearson Education Inc., New Delhi
References:
1. Fundamentals of Software Engineering by Rajib Mall, – PHI

Course Outcomes (COs): After completion of this course the students shall be able to:

Students will have thorough understanding of the basic structure and operation of
CO01 software & various SDLC models.
Students will be able to trace out requirements of a software to be build and also learn
CO02
to
prepare SRS.
CO03 They will be able to draw the different types design models (UML Diagrams).
CO04 Students will be able to understand the role & importance of SQA & software testing.
CO05 They learnt different ways of maintenance in software and measuring project.
 Course Code Course Name Hours Per Week
CS3CO12 Computer Networks L T P Credits
3 1 2 5

Course Learning Objectives (CLOs):

CLO 01 Describe how computer networks are organized with the concept of layered approach.
CLO 02 Implement a simple LAN with hubs, bridges and switches
CLO 03 Describe how packets in the Internet are delivered
CLO 04 Analyze the contents in a given Data Link layer packet, based on the layer concept.
CLO 05 Design logical sub-address blocks with a given address block
CLO 06 Describe how routing protocols work and decide routing entries given a simple
example of network topology

Unit-1
MAC Sublayer: Static and Dynamic Chanel Allocation in LAN, MAC protocols-ALOHA and
SlottedALOHA,CSMA, CSMA/CD, CSMA/CA, Collision Free protocols, Limited Contention
Protocols. Ethernet-Ethernet Cabling, Frame Format, Binary Exponential Back-off Algorithm,
Ethernet Performance, Fast and Gigabit Ethernet,MAC address.

Unit-2
Internetworking, Tunnelling, Fragmentation and Reassembly. IP protocol, IPv4 Addresses, Subnet
Addressing, Subnet Mask, SupernettingCIDR, NAT, ICMP-header, message type, trace route,
ARP & RARP, BOOTP and DHCP: Address allocation, configuration & packet format, OSPF
and BGP,Comparative study of IPv4 & IPv6.

Unit-3
Network Layer: Design issues, Routing algorithms:Dijkstra's algorithm, Bellman-ford algorithm,
Link State Routing, Hierarchical Routing,Congestion Control Algorithms: General Principles of
Congestion control, Prevention Policies, Congestion Control in Virtual-Circuit Subnets,
Congestion Control in Datagram subnets. QOS-techniques for achieving good QOS, Traffic
Management, Integrated and Differentiated Services. RSVP

Unit-4
Transport Layer: Design Issues, Transport Service Primitives, Socket Programming, TCP:
Connection Management, Reliability of Data Transfers, TCP Flow Control, TCP Congestion
Control, TCP Header Format, TCP Timer Management. UDP: Header Format, RPC, RTP, Session
layer: Authentication, Authorization, Session layer protocol (PAP, SCP, H.245).

Unit-5
Presentation layer: Data conversion, Character code translation, Presentation layer protocol.
Application Layer: WWW Architectural Overview, URL-Static and Dynamic Web, FTP, SSH,
Email- Architecture and Services, SMTP, DNS-Name System, Resource Records, Name Servers,
Network Management (SNMP).

Text Books:
 1. Computer Networks-V Edition, Andrew S. Tanenbaum-Pearson Education (Chapter No.4-
7).
2. Data and Computer Communication-VIII Edition, William Stallings-Pearson
Education(Part-3-6)

3. Data Communication and Networking- V Edition, Behrouz A.Fourouzan- Mc Graw Hill

Publication (Part-3-6).
4. Communication Networks-Fundamental concepts and key Architecture, Alberto Leon-
Garcia &IndraWidjaja-TMH (Unit1,2,7,8,10,12)
Practical Understanding
1. Data Communication Principles for fixed and wireless networks-Aftab Ahmad, Kluwer
Academic Publishers.
2. Data Communications Networking Devices:-Operation, Utilization, Lan and Wan
Interworking-IV Edition, Gilbert Held-John Wiley and Sons.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Analyse the requirements for a given organizational structure and select the most
appropriate networking architecture and technologies
CO 02 Understanding of the use of various networking devices such as L-2 switch , L-3 Switch
and Routers.
CO 03 Understanding of data link layer protocols, multi-channel access protocols and IEEE 802
standards for LAN
CO 04 Apply the routing and congestion in network layer with routing algorithms using
simulators and classify IPV4 and IPV6 addressing scheme
CO 05 Describe the elements and protocols of transport layer .
CO 06 Understanding of network security and define various protocols such as FTP, HTTP,
Telnet, DNS
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
OE00018 Python Essentials
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO 01 To understand why Python is a useful scripting language for developers.

CLO 02 To learn how to use lists, tuples, dictionaries, indexing and slicing to access data in
Python programs.
CLO 03 To learn how to read and write files in Python.
CLO 04 To learn how to design object‐oriented programs with Python classes.
CLO 05 To learn how to use exception handling in Python applications for error handling

Unit-1 Basic Introduction

Introduction to Python, History, Features, command interpreter and development environment-
IDLE, Application of Python, Python 2/3 differences, Basic program structure-quotation and
indentation, Operator, Basic data types and In-built objects.

Unit-2 Function and Sequence

Functions: definition and use, Arguments, Block structure, scope, Recursion, Argument
passing, Conditionals and Boolean expressions, Lambda Function, inbuild functions
(str(),globals(),locals(),vars(),eval(),exec(),execfile(),repr(),ascii()) Sequences: Strings,
Tuples, Lists Iteration, looping and control flow, String methods and formatting.

Unit-3 File Operation & OOPS concepts

Reading config files in python, Writing log files in python, Understanding read functions,
read(), readline() and readlines(), Understanding write functions, write() and
writelines(), Manipulating file pointer using seek.

Unit-4 OOPS Concepts

Object Oriented concepts- Encapsulation, Polymorphism, Classes, Class instances,
Constructors & Destructors__init__, __del__, Multiple inheritance, Operator overloading
Properties, Special methods, Emulating built-in types.

Unit-5 Mutable data types, Exception and Standard modules

Dictionaries, Sets and Mutability, Exceptions, List and Dict Comprehensions, Standard
Modules-math, random Packages.

Text Book:
1. Dr.R.Nageswara Rao, Core Python Programming, dreamtech press.
2. Paul Barry, Head First Python, O’REILLY.

References:
1. Mark Luiz, Learning Python, O’REILLY.
2. Jamie Chan, Learn Python in One Day, LCF Publishing.
Course Outcomes (COs):
After completion of this course the students shall be able to:

CO 01 Describe the Numbers, Math functions, Strings, List, Tuples and Dictionaries in Python
CO 02 Express different decision making statements and Function
CO 03 Interpret Object oriented programming in Python
CO 04 Understand and summarize different File handling operations
CO 05 Student will be able to distinguish between mutable and immutable data types.
CO 06 Students are able to work with standard libraries and pre define module.

List of Experiments (if applicable)

WAP to find product of two numbers using command line arguments?

WAP to Given the string 'hello', give an index command that returns 'e’.
WAP to Reverse the string 'hello' using slicing.
WAP to Given the string ‘hello’, give two methods of producing the letter 'o' using indexing.
WAP to Ask the user for a string and print out whether this string is a palindrome or not.
(A palindrome is a string that reads the same forwards and backwards.)
WAP to create a byte type array, read and display the elements of the array.
WAP to accept a numeric digit from keyboard and display in words.
WAP to display a group of messages when the condition is true?
WAP to accept a number from keyboard and test whether a number is even or odd.
WAP to test whether a given number is in between 1 and 10.
WAP to display even numbers between m and n
WAP to display characters of a string using for loops
WAP to display odd numbers from 1 to 10 using range ().
WAP to display and sum of a list of numbers using loop.
WAP to display the stars in an equilateral triangular form using a loop.
WAP to display numbers from 1 to 100 in a proper format
WAP to search for an element in the list of elements.
WAP to display prime number series.
WAP to generate Fibonacci number series.
Write a Python program to combine each line from first file with the corresponding line in
second file
Write a Python program to copy the contents of a file to another file
WAP to define Student class and create an object to it. Also, we will call the method and
display the student’s details.
WAP to create a static method that counts the number of instances created for a class.
WAP to create a Bank class where deposits and withdraw can be handled by using instance
methods.
WAP showing single inheritance in which two sub classes are derived from a single base
class.
WAP to implement multiple inheritance using two base classes.
WAP to show method overloading to find sum of two or three numbers.
WAP to Create a 3×3 numpy array of all True’s
WAP to Replace all odd numbers in arr with -1
a. Input ([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
WAP to Convert a 1D array to a 2D array with 2 rows
a. Input: np. arrange (10)
WAP to Get the common items between a and b
Input:
a = np. array ([1,2,3,2,3,4,3,4,5,6])
b = np. array ([7,2,10,2,7,4,9,4,9,8])
Desired Output:
array ([2, 4])
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3EL10 Cloud Computing
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO Describe how Cloud Computing are organized.
01

CLO Describe Application which are used in daily life regarding cloud
02

CLO Describe virtualization with cloud

03

CLO Relation of SLA

04

CLO Data analysis in cloud

05

CLO Describe AWS and its Services

06

CLO Describe platform of cloud development

07

CLO Describe general application and tools of cloud

08

Unit-1 Introduction to cloud computing, characteristics of cloud computing as per NIST, cloud
reference model, application of cloud computing ECG analysis, protein structure prediction,
cloud deployment models.

Unit-2 Virtualization, virtualization advantages, Full virtualization, para-virtualization,

hypervisors. Cloud interoperability, cloud service management, cloud analytics, Cloud broker,
Capex, Opex, cloud architecture.
Unit-3 Platform as a service, Infrastructure as a service, software as a service, Desktop as a service,
Backup as a service, DRaaS, Introduction to SLA, SLA lifecycle, SLA management, Business
continuity plan.
Unit-4 Cloud security fundamentals, vulnerability assessment, security architecture, identity
management and access control, data at rest, data in flight, data in motion, security in
virtualization.
Unit-5 Cloud application development platforms, Xen hypervisor, AWS, Google app engine, open
stack.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO Analyse the requirements for a given organizational structure and select the most
01

appropriate cloud service provider

CO Analyse the application which are used in general life like ECG , protein structureetc..
02

CO Working with virtualization with AWS services

03

CO Analyse, specify and design structure of service level agreement between user and
04

corporation
CO Have a working knowledge of data and their stat
05

CO Perform some online services which are used in AWS ,that can be produce the
06

knowledge of latest technology

CO Perform some services in different Cloud development platform
07

CO Implement Subnet ,Internet Gateway ,Routing, data Collection in Cloud function

08
 Course Code Course Name Hours Per Week

L T P Credits
CS3EA07 Machine Learning
3 0 0 3

Course Learning Objectives (CLOs):

CLO 01 To introduce machine learning with some of its problems and its types
CLO 02 To provide detailed knowledge about classification technique under supervised
learning
CLO 03 To explore different unsupervised learning algorithms to solve any problem
CLO 04 To study various ensemble methods including statistical learning theory
CLO 05 To study advance type of machine learning including deep learning techniques

Unit-1 Introduction to machine learning, Applications, Classification; Supervised Learning:

Linear Regression: Cost function, Gradient descent; Logistic Regression, Nearest-
Neighbors, Gaussian function.

Unit-2 Overfitting and Underfitting, Regularization, Bias and Variance, Decision Trees, Naı̈
ve Bayes, Support Vector Machines, Kernel Methods .

Unit-3 Unsupervised Learning: Clustering: K-means, Dimensionality Reduction: PCA, Matrix

Factorization and Matrix Completion, Ranking, Recommender System.

Unit-4 Introduction to Neural Network, Perceptron, Feed forward, Back Propagation,

Recurrent Neural Network. Introduction to Python machine learning libraries: Keras,
Tensorflow and Theano.

Unit-5 Evaluating Machine Learning algorithms and Model Selection, Ensemble

Methods: Boosting, Bagging, Random Forests, Deep learning Semi-supervised Learning,
Reinforcement Learning.

Text Book:

1. Machine Learning, Tom Mitchell, McGraw Hill.

2. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical
Learning, Springer (freely available online)
Reference Books:
4. Christopher Bishop, Pattern Recognition and Machine Learning, Springer.
5. Hal Daumé III, A Course in Machine Learning (freely available online)
6. Sebastian Raschka,Vahid Mirjalili, Python Machine Learning: Machine Learning
and Deep Learning with Python, scikit-learn, and TensorFlow, Packt Publishing.
Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Analyze the problems where machine learning can be used effectively.
CO 02 Understand various classification techniques and where it can be used
CO 03 Understand the unsupervised learning including clustering algorithms
CO 04 Understanding the concept of Neural Networks and its application areas
CO 05 Understanding various ensemble methods and advance machine learning methods
including deep learning
 Hours per Week Total
Course Code Course Name
L T P Credits
Universal Human Values and Professional
EN3MC15
Ethics
2 0 0 0

Course Learning Objectives (CLOs):

CLO 01 Student will able to understand about the process of value education.
CLO 02 Student will able to understand harmony in human being.
CLO 03 Student will able to understand Harmony in the Family and Society
CLO 04 Student will able to understand Harmony in the Nature and Existence
CLO 05 Student will able to understand Holistic Understanding of Harmony

Unit-1
Introduction-Need, Basic Guidelines, Content and Process for Value Education
Understanding the need, basic guidelines, content and process for Value Education, Self-
Exploration – what is it ?-its content and process; ‘Natural Acceptance’ and Experiential
Validation- as the mechanism for self - exploration, Continuous Happiness and Prosperity-A look
at basic Human Aspirations, Right understanding, Relationship and Physical Facilities-the basic
requirements for fulfilment of aspirations of every human being with their correct priority,
Understanding Happiness and Prosperity correctly- A critical appraisal of the current scenario,
Method to fulfil the above human aspirations: understanding and living in harmony at various
levels.

Unit-2
Underst anding Harmony in the Human Being-Harmony in Myself
Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’,
Understanding the needs of Self (‘I’) and ‘Body’- Sukhand Suvidha, Understanding the Body as
an instrument of ‘I’(I being the doer, seer and enjoyer), Understanding the characteristics and
activities of ‘I’ and harmony in ‘I’, Understanding the harmony of I with the Body: Sanyamand
Swasthya; correct appraisal of Physical needs, meaning of Prosperity in detail, Programs to ensure
Sanyam and Swasthya.

Unit-3
Underst anding Harm ony in the Family and Society-Harmony in Human- Human
Relationship
Understanding harmony in the Family- the basic unit of human interaction, Understanding values
in human -human relationship ;meaning of Nyayaand program for its fulfilment to ensure Ubhay-
tripti; Trust (Vishwas) and Respect (Samman) as the foundational values of relationship,
Understanding them eaning of Vishwas; Difference between intention and competence,
Understanding the meaning of Samman ,Difference between respect and differentiation ;the other
salient value in relationship, Understanding the harmony in the society(society being an extension
of family ):Samadhan, Samridhi, Abhay, Sah-astitvaas comprehensive Human Goals, Visualizing
a universal harmonious order in society-Undivided Society (AkhandSamaj), Universal Order
(SarvabhaumVyawastha)-from family to world family!.
Unit-4
Underst anding Harmony in the Nat ure and Existence-Whole existence as Co-existence
Understanding the harmony in the Nature, Inter connectedness and mutual fulfilment among the
four orders of nature –recyclability and self-regulation in nature, Understanding Existence as Co-
existence(Sah-astitva) of mutually interacting units in all-pervasive space, Holistic perception of
harmony at all levels of existence.

Unit-5
Implications of t he above Holistic Understandi ng of Harmony on P rofessional Ethics
Natural acceptance of human values, Definitiveness of Ethical Human Conduct, Basis for
Humanistic Education, Humanistic Constitution and Humanistic Universal Order, Competence
in Professional Ethics:

a) Ability to utilize the professional competence for augmenting universal human order,
b) Ability to identify the scope and characteristics of people- friendly and eco-friendly production
systems, technologies and management models, Case studies of typical
holistictechnologies,managementmodelsandproductionsystems,Strategyfor transition from the
present state to Universal Human Order:
a) At the level of individual: as socially and ecologically responsible engineers, technologists and
managers,
b) At the level of society :as mutually enriching institutions and organizations.

TextBooks:
1. R R Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in Human
Values and Professional Ethics.

References:
1. IvanIllich,1974,Energy & Equity, The Trinity Press, Worcester, and Harper
Collins, USA
2. E.F.Schumacher,1973, Smallis Beautiful: a sudy of economics as if people
mattered, Blond & Briggs, Britain.
3. SussanGeorge,1976,HowtheOtherHalfDies,PenguinPress.Reprinted 1986, 1991
4. Donella H .Meadows, DennisL. Meadows,JorgenRanders, WilliamW.
BehrensIII, 1972, Limits to Growth–Club of Rome’s report, UniverseBooks.
5. ANagraj, 1998, JeevanVidyaEkParichay, DivyaPathSansthan, Amarkantak.
6. PLDhar, RRGaur,1990,Science and Humanism,Commonwealth Publishers.
7. A NTripathy, 2003, Human Values, New Age International Publishers.
SubhasPalekar, 2000, How to practice Natural Farming, Pracheen(Vaidik)
KrishiTantraShodh, Amravati.
8. EGSeebauer&RobertL.Berry,2000,FundamentalsofEthicsforScientists&Engine
ers , Oxford University Press
9. MGovindrajran,SNatrajan&V.S.SenthilKumar,EngineeringEthics(includingHu
manValues),EasternEconomyEdition,PrenticeHallofIndia Ltd.
10. BP Banerjee,2005, Foundations of Ethics andManagement, Excel Books.
BLBajpai,2004,IndianEthosandModernManagement,NewRoyal Book Co.,
Lucknow. Reprinted 2008.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO Students get knowledge about the process of value education.
01

CO Understand human being as a co-existence

02

CO Understanding values in human -human relationship

03

CO Understanding Existence as Co-existence(Sah-astitva) of mutually interacting units in

04

all-pervasive space
CO Understanding Natural acceptance of human values
05
 Hours per Week
Course Code Course Name
L T P Credits

EN3MC10 Soft Skills-III 2 0 0 0

Unit-1
Introducing your friend: This session involves icebreaker activities to orient the students for the
entire program. The activity is to try using as many adjectives as possible to describe one’s friend.
Students are encouraged to speak about their friends on the stage. Also, students will learn and
practice introducing them (Self introduction) as self-introduction is usually the first question in
any personal interview. Also, the appropriate way to introduce oneself is taught.
Who gets the heart? To improve reasoning, convincing and speaking skills of students. Student
groups are provided with specific case of an individual in requirement of a heart along with the
profile of the person. Student will advocate why the person they represent deserves to get the heart
over others. This imparts the needed convincing skills for group discussions and personal
interview where students need to convincingly put forth their opinion and views.
Debate: The objective of the session is to strengthen students’ skills in the areas of leadership,
interpersonal characteristics, influence over others, problem analysis, solution and presentation.
Students are given topics and are made to debate on it. Cross-questioning is encouraged.
Unit-2
Sentence correction: Subject-Verb Agreement, Modifiers, Parallelism
Vocabulary: Vocabulary Demystified, Synonyms and Antonyms, Word Analogy, Miscellaneous
Vocabulary
Unit-3
Sentence completion and Para- jumbles: Pro-active thinking, Reactive thinking (signpost
words, root words, prefix suffix, sentence structure clues), Fixed jumbles, Anchored jumbles
Time and work: Work with different efficiencies, Pipes and cisterns, Work equivalency, Division
of wages

Unit-4
Data arrangements and blood relations: Linear Arrangement, Circular Arrangement, Multi-
dimensional Arrangement, Blood Relations.
Reading comprehension: Speed Reading Strategies, RC - Types and Tackling Strategies.
Unit-5
Story Mason: To make the students participate in group interactions, create dialogue and present
on stage as a group. This activity allows introverts or students with stage fear to present a narration
along with the group mates on the stage. This slowly helps those students to come out of their
inhibition to speak in-front-of an audience.
Ratio and Proportion: Ratio, Proportion, Variation, Simple equations, Problems on Ages.
Articles, Prepositions and Interrogatives: Definite and Indefinite Articles, Omission of
Articles, Prepositions, Compound
 Hours per Week Total
Course Code Course Name
L T P Credits

CS3ES13 Software Workshop-II 0 0 2 1

This course has been associated with program electives of corresponding semester. The lab
experiments of respective program electives will be performed during the lab hours for respective
students.

Course Learning Objectives (CLOs):

CLO 01

Make use of Data sets in implementing the machine learning algorithms.

CLO 02 Implement the machine learning concepts and algorithms using Weka Software tool.
CLO 03 to make students understand the concept and statistical methods to solve real world
problems.
CLO 04 To inculcate fundamental concepts that provide the foundation of machine learning.
CLO 05 to make students understand the usage of supervised and unsupervised machine
learning algorithms in real world scenarios.

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO Understand the implementation procedures for the machine learning algorithms.
01

CO Implement and Design various Learning algorithms using Weka Tool.

02

CO 03

Apply appropriate data sets to the Machine Learning algorithms to solve supervised
machine learning problems.
CO Apply appropriate data sets to the Machine Learning algorithms to solve unsupervised
04

machine learning problems.

CO 05

Identify and apply Machine Learning algorithms to solve real world problems
SEMESTER – VI
Sr.
Course Code Courses L T P Credit
No.
1 CS3CO13 Design and Analysis of Algorithms 3 1 2 5
2 CS3CO15 Object Oriented Analysis and Design 3 1 2 5
3 CS3CO27 Compiler Design 3 0 2 4
4 CS3EXXX Elective-3 3 0 0 3
5 CS3EXXX Elective-4 3 0 0 3
6 CS3ES14 Software Workshop-III 0 0 2 1
7 OE000XX Open Elective-2 3 0 0 3
Total 18 2 8 24
Total Contact Hours 28
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3CO13 Design and Analysis of Algorithms
3 1 2 6 5

Course Learning Objectives (CLOs):

CLO01 Teach to analyse algorithms with respect to time and space. Teach techniques for
effective problem solving in computing.

CLO02 Demonstrate various computational models (e.g. divide and conquer), order notation
and various complexity measures (e.g., running time, disk space) to analyse the
complexity/performance of different algorithms.

CLO03 Teach to apply important algorithmic design paradigms & methods of analysis and to
synthesize efficient algorithms in common engineering design situations.

CLO04 Introduce concept of P, NP, NP Complete and NP Hard problems to the students and
to bring the capability of proving the belongingness of some problems in P/NP sets

Unit-1 Introduction to Algorithms

Algorithms, Analysis, Performance issues: Time and Space complexity; Asymptotic Notations.
Mathematical preliminaries: functions & their growth rates; Recurrence relations, Methods for
solving recurrences. Elementary Sorting techniques and its analysis: Selection, Bubble, Insertion
sort

Unit-2 Sorting and Divide & Conquer

Advance sorting techniques and its analysis: Heap sort, Radix sort and Bucket sort, Divide and
Conquer techniques and its analysis - Binary search, Merge Sort, Quick sort, Strassen’s Matrix
multiplication.

Unit-3 Greedy Algorithms

Greedy problems and its complexity analysis: Optimal merge patterns, Huffman coding,
Minimum spanning trees, Knapsack problem, Job sequencing with deadlines, Single source
shortest path problem - Dijkstra’s Algorithm

Unit-4 Dynamic Programming

Dynamic programming problems and its complexity analysis: 0/1 Knapsack, Multistage graph,
Bellman Ford Algorithm, Reliability design, Floyd-Warshall algorithm, Matrix Chain
Multiplication, Longest Common subsequence.

Unit-5 Backtracking and Branch & Bound

Backtracking Approach: N-Queen’s problem, Hamiltonian cycle, Graph coloring problem, Sum
of Subset problem. Introduction to branch & bound method, examples of branch and bound
method like15 puzzle traveling salesman problem, 0/1 knapsack. An introduction to P, NP, NP
Complete and NP hard problems.

Text Books:
1. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein, Introduction
toAlgorithms, Second Edition, MIT Press/McGraw-Hill
2. E. Horowitz, S. Sahni, S Rajasekaran, Computer Algorithms, Galgotia Publications

References:
1. Saara Base, Computer Algorithms: Introduction to Design and Analysis, Addision Wesley.
A V Aho, J E Hopcroft & J D Ullman, The Design and Analysis of Computer
Algorithms,Addison Wesley.

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO Analyse best case, worst-case and average running times of algorithms using asymptotic
01

analysis.
CO Compare and analyse various sorting techniques and to find the efficient sorting
02

technique with respect to specific case

CO Derive and solve recurrences for recursive algorithms. Apply various recurrence solving
03

techniques depending upon specific cases

CO Understand the divide-and-conquer paradigm and will have knowledge, when an
04

algorithmic design situation calls for it. Synthesize divide-and-conquer algorithms and
analyse them.
CO Understand the greedy paradigm and will have knowledge, when an algorithmic design
05

situation calls for it. Synthesize greedy algorithms and analyse them.
CO Understand the dynamic-programming paradigm and will have knowledge, when an
06

algorithmic design situation calls for it. Synthesize dynamic-programming algorithms

and analyse them.
CO Understand the backtracking and branch & bound strategy and will have knowledge,
07

when an algorithmic design situation calls for it. Synthesize algorithms for both and
analyse them.
CO Understand concept of P, NP, NP Complete and NP hard problems. Prove some problems
08

NP complete or not.

S No. Experiment List

1 To implement the following using array as data structure and analyse its time complexity:
a. Insertion sort
b. Selection sort
c. Bubble sort
d. Quick sort
e. Merge sort
f. Bucket sort
g. Shell sort
h. Radix sort
i. Heap sort
2 To implement Linear and Binary search and analyze its time complexity
3 To implement Matrix Chain Multiplication and analyze its time complexity
4 To implement Longest Common Subsequence problem and analyze its time complexity
5 To implement Optimal Binary Search Tree problem and analyze its time complexity
6 To implement Huffman coding and analyze its time complexity
7 To implement Dijkstra’s algorithm and analyze its time complexity
8 To implement Bellman Ford algorithm and analyze its time complexity
9 To implement DFS and BFS and analyze their time complexities.
10 To implement string matching algorithms and analyze time complexities
 Course Course Name Hours Per Week
Code
L T P Credits
CS3CO15 Object Oriented Analysis and Design
3 1 2 5

Course Learning Objectives (CLOs):

CLO01 Introduction to Structure of Complex Systems & Object-Oriented Development

Methods.
CLO02 Understand Models, Concepts in UML & Structural and Behavioural Models.
CLO03 Describe State Machine View &Activity Views related to the model.
CLO04 Understanding Modelling System and Subsystems.
CLO05 Understanding Object Oriented Testing.

Unit -1
Structure of Complex Systems, Object Oriented Development Methods, Characteristics of
Objects, Fundamental Concepts of Object orientation, UML- Overview, RUP and its Phases
Unit-2
Models, Concepts in UML, Structural and Behavioral Models, Use Cases and functional
Requirements, Use Case Descriptions, Classes, Relationships, Association, Generalization,
Realization, Dependencies, Constraints
Unit-3
State Machine View, Activity View, Interaction View, Sequence Diagram, Collaboration
Diagram, Interaction Diagrams
Unit-4
Physical View, Component Diagram, Deployment Diagram, Package, Dependencies on
Packages, Modelling System and Subsystems, Patterns and Types of Patterns, Applying
Patterns
Unit-5
Object Oriented Testing, Types of Testing, Quality Assurance Methods, Reusability, Reverse
Engineering, Case Studies

Text Book:
1. Grady Booch, Object Oriented Analysis and Design with Applications, Addison Wesley
2. James Rambaugh, Ivar Jacobson, Grady Booch, The Unified Modelling Language Reference
Manual, Addison Wesley

References:
1. Design Patterns - Elements of Reusable Object-Oriented Software, Gamma, et. al., Addison-
Wesley.
2. Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
Iterative Development, by Craig Larman, Pearson Education.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO01 Student will understand the RUP & Its Phases.
CO02 Students will able to write model concept in UML.
CO03 Student will understand different views related to the software Models.
CO04 Student will able to draw different diagram related to UML design.
CO05 Student will be able to do testing related to the models.

List of Experiments (if applicable)

1) Requirement analysis SRS OF YOUR PROJECT.
2) Draw the USE CASE diagram for your project.
3) Draw the CLASS diagram for your project.
4) Draw the OBJECT diagram for your project.
5) Draw the SEQUENCE diagram for your project.
6) Draw the ACTIVITY diagram for your project.
7) Draw the COMPONENT diagram for your project.
8) Draw the COLLABORATION diagram for your project.
9) Draw the ACTIVITY diagram for your project.
10) Draw the INTERACTION diagram for your project.
11) Draw the DEPLOYMENT diagram for your project.
12) Draw the PACKAGE diagram for your project.
 Course Code Course Name Hours Per Week
L T P Credits
CS3CO27 Compiler Design
3 0 2 4

Course Learning Objectives (CLOs):

CLO 01 To teach the design of a compiler including all its phases and components.

CLO 02 To develop a large, complex, but well-structured software system that implements
various phases of a compiler such as the scanner, parser, code generator, and optimizer.

CLO 03 To identify the similarities and differences among various parsing techniques and
grammar transformation techniques.

CLO 04 To provide knowledge about current developments in compiler design and

implementation.

CLO 05 To develop an understanding of the compilation process

Unit-1
Compiler structure: Pass Structure of compiler, Translators, Interpreter, Assembler, Phases of Compilers,
Symbol Table, Error Handling, Lexical Analyzer: Role of Lexical Analyzer, Specification of tokens,
Recognition of tokens and input Buffering, The Syntactic Specification of Programming Languages, Cross
Compiler, bootstrap Compiler.
Unit-2
Ambiguous Grammar, LL(0) and LL(1) grammar, Parsing, Basic Parsing Techniques: Top Down parsers,
Recursive Descent Parsers, First() and Follow(), Recursive and Non- Recursive Predictive Parsers.
Unit-3
LR Grammar, Operator Grammar, Bottom Up Parsing: Operator precedence parsing, LR(0) parsers,
Construction of SLR, Canonical LR and LALR parsing tables.
Unit-4
Syntax Directed Definition, Translation Scheme, Synthesized and inherited attributes, dependency graph,
Construction of syntax trees, S-attributed and L-attributed definitions, Three address codes, quadruples,
triples and indirect triples, Translation of assignment statements.
Unit-5
Storage organization, activation trees, activation records, allocation strategies, Parameter passing symbol
table, dynamic storage allocation, Basic blocks and flow graphs, Optimization of basic blocks, Loop
optimization, Global data flow analysis, Loop invariant computations.
Text Book:
1. Alfred V. Aho, and J.D. Ullman, Principle of Compiler Design, Narosa Publication.
2. A.Barret William and R.M. Bates, Compiler construction (Theory and Practice), Galgotia Publication.

References:
1. A.C. Holub, Compiler design in C, PHI.
2. O.G. Kakde, Compiler Design, Laxmi Publications

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO 01 Specify and analyse the lexical, syntactic and semantic structures of advanced language
features
CO 02 Separate the lexical, syntactic and semantic analysis into meaningful phases for a
compiler to undertake language translation
CO 03 Write a scanner, parser, and semantic analyser without the aid of automatic generators
CO 04 Turn fully processed source code for a novel language into machine code for a novel
computer
CO 05 Know about techniques for intermediate code and machine code optimisation

S. No. Experiment List

1 Write a program to Design Lexical Analyzer to recognize keyword
2 Write a program to Design Lexical Analyzer to recognize identifier.
3 Write a program to compute First of a CFG
4 Write a program to compute Follow of a CFG
5 Write a program for implementation of Predictive
Parsing Table for LL (1) grammar.
6 Write a program for implementation of Predictive Parser
7 Write a program to develop an operator precedence
parser.
8 Write a program to design LALR Bottom-up Parser.
9 Write a program for generating various intermediate
code forms-Polish notation:
a. Infix to prefix
b. Infix to postfix
10 Write a program to perform heap storage allocation
strategies such as –
• Creation
• insertion
• Deletion
• Display
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3ED04 Big Data Engineering
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO 01 To understand the basic concepts of evolution of Big Data.
CLO 02 To understand the importance of Distributed algorithm design.
CLO 03 To understand the importance of Big Data storage, processing, analysis and
visualization methodologies and tools.
CLO 04 To understand the different algorithms for distributed computing just like Map Reduce.
CLO 05 To understand the concept of ETL and Batch Processing
CLO 06 To understand the concepts of Data Warehousing and its relevance for Big Data
CLO 07 To understand the concepts of ingesting Big Data into Big Data Platforms, processing
real time and streaming Big Data

Unit -1
Foundations of Big Data Systems
Introduction to Big Data and its Applications Data Abstraction Linear data structures like
Hashtables, Hashmaps, Bloom Filters Non-linear data structures like Binary Search Trees, KD
Trees Distributed Algorithm Design Algorithm Design using MapReduce

Unit -2
Platforms for Big Data
Distributed Computing Environment for Big Data NoSQL databases for Big Data Storage
Applications (HBase) Distributed Processing of data using MapReduce & Pig In-memory
distributed processing using Apache Spark Data Storage on Cloud (Amazon S3 & Dynamo
DB)

Unit-3
Processing Big Data – ETL & Batch Processing
Performing ETL Operations Concepts in Data Warehousing and its relevance for Big Data
Ingesting data into Big Data Platforms using Sqoop & Flume Workflow management for
Hadoop using OOZIE Batch Processing on Cloud

Unit-4
Processing of Real Time Data & Streaming Data
Applications of Streaming Data in Industry Sourcing Streaming data using Apache Flume
Building real-time data pipelines using Apache Storm Streaming on Apache Spark

Unit-5
Big Data Analytics
Regression, Clustering & Classification using Spark MLLib Building visualizations using Big
Data Case Studies on applications of Big Data Analytics

Text Books
1. Mayank Bhushan, Big Data and Hadoop- Learn by Example, BPB Publications
2. Erl/Khattak/Buhler, Big Data Fundamentals: Concepts Drivers and Techniques, Prentince
Hall
References
1. Jeffrey Aven , Hadoop in 24 Hours, Sams Teach Yourself, SAMS Publications.
2. DT Editorial Services, Big Data, Black Book: Covers Hadoop 2, MapReduce, Hive, YARN,
Pig, R and Data Visualization, Dream Tech Publications
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO 01 Understand the different Big Data tools and techniques.
CO 02 Understand the importance of Distributed computing.
CO 03 Understand the applications and components of Big Data.
CO 04 Understand the architecture of Big Data.
CO 05. Understand the concept of Real Time and Streaming data processing,
 Hours per Week
Course Code Course Name
L T P Credits
CS3EA06 Natural Language Processing 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 How key concepts from NLP are used to describe and analyze language
CLO02 Describe the formal language and their representation using grammars.
CLO03 POS tagging and context free grammar for natural language (english).

CLO04 Understanding semantics and pragmatics of natural language(english) for processing.

CLO05 Writing programs in Python to carry out natural language processing
.
Unit-1 Introduction
Human languages, Main approach of NLP, Knowledge in speech and language processing,
Ambiguity, Models and algorithms, Formal language and Natural Language, Regular Expression
and automata.
Unit-2 Text Pre-processing
Text Pre-processing, Tokenization, Feature Extraction from text, Morphology: Inflectional and
Derivational, Finite state morphological parsing, Finite state transducer
Part of Speech Tagging: Rule based, Stochastic POS, Transformation based tagging.
Unit-3 Speech Processing
Speech and phonetics, Vocal organ, Phonological rules and Transducer, Probabilistic models:
Spelling error, Bayesian method to spelling, Minimum edit distance, Bayesian method of
pronunciation variation.
Unit-4 N-Grams
Simple N-Gram, perplexity, Smoothing, Backoff, Entropy, Parsing: Statistical Parsing,
Probabilistic parsing, TreeBank.
Unit-5 Application
Sentiment analysis, Spelling correction, Word sense disambiguation, Machine translation, Text
Classification, Question answering system
Text Books:
1. Daniel Jurafsky and James H. Martin, “Speech and Language Processing”, Pearson
Education.
2. James Allen, “Natural Language Understanding”, Pearson Education.
References:
4. Christopher D. Manning and Hinrich Schutze, “Foundation of statistical Natural
Language Processing”, MIT Press.
5. Mary Dee Harris “Introduction to Natural language Processing” ,Reston

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO01 Understand natural language processing and to learn how to apply basic algorithms in
this field.
CO02 To get acquainted with the algorithmic description of the main language levels:
morphology, syntax, semantics, and pragmatics
CO03 Understand various resources of natural language data – corpora and word net.
CO04 To conceive basics of model representation of natural language.
CO05 Apply NLP concepts in different applications.
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3EA03 Soft Computing
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO 01 Understand the concepts of Soft Computing.
CLO 02 Understand the concepts of Neural Network Architectures.
CLO 03 Understand the concept of Fuzzy Logic.
CLO 04 Understand the Genetic Algorithms.
CLO 05 Understand the concept of Hybrid Systems.

Unit- 1 Concept of Computing Systems, Introduction to Soft Computing, Soft Computing vs.
Hard Computing, Components of Soft Computing, Neural Networks: Structure and function of
Biological Neuron and Artificial Neuron, Definition and characteristics of ANN, Training
techniques in different ANNs, Activation functions, Different ANNs architectures,
Introduction to basic ANN architectures: McCulloch & Pitts model, Perceptron Model, Linear
separability, ADALINE and MADALINE.
Unit-2 Neural Network Architectures: Supervised Learning: Backpropagation Network
architecture, Backpropagation algorithm, Limitation, Characteristics and Application of EBPA,
Bidirectional associative memories (BAM), Unsupervised Learning: Hebbian Learning,
Generalizd Hebbian learning algorithm,e Competitive learning, Self- Organizing
Computational Maps: Kohonen Network, Applications of ANN to solve real world’s problems.
Unit-3 Fuzzy Logic: Introduction to Fuzzy logic, Fuzzy sets and membership functions,
Operations on Fuzzy sets, Fuzzy relations, rules, propositions, implications and inferences,
Defuzzification techniques, Fuzzy logic controller design, Some applications of Fuzzy logic.
Unit-4 Genetic Algorithms: Concept of "Genetics" and "Evolution" and its application to
probabilistic search techniques, Basic GA framework and different GA architectures, GA
operators: Encoding, Crossover, Selection, Mutation, etc, solving single-objective optimization
problems using GAs.
Unit-5 Hybrid Systems: Genetic Algorithm based Backpropagation Network, Fuzzy –
Backpropagation, Fuzzy Logic Controlled Genetic Algorithms. Case studies. Case studies in
Engineering
Text Book:
1. Sinha, N.K. and Gupta, M. M.: “Soft Computing and Intelligent Systems - Theory and
Applications”, Academic Press.
2. S. Rajasekaran and G. A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis, and Applications” , Prentice Hall of India, 2007.

References:
1. D. K. Pratihar, “Soft Computing”, Narosa, 2008.
2. Jang, J-S. R., Sun,C-T, Mizutani, E.: “Neuro–Fuzzy and Soft Computing”, Prentice Hall of
India.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CLO 01 Understand the concepts of Soft Computing.

CLO 02 Understand the concepts of Neural Network Architectures.
CLO 03 Understand the concept of Fuzzy Logic.
CLO 04 Understand the Genetic Algorithms.
CLO 05 Understand the concept of Hybrid Systems.
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3ED01 Database Application and Tools
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO01 To understand the concept of database Environment and Database Development Process.
CLO02 To learn fundamental concepts of database design, data Models and Enhanced ER Modelling.
CLO03 Ability to develop logical database design.
CLO04 To gain knowledge of Normalization.
CLO05 To gain knowledge of modern technologies such as Data Mining, Data Warehousing.

Unit-1
Database Environment: Data versus information, traditional file processing,
disadvantages,
database approach, range of database application, advantages of database approach. Cost and
risk factors, components of database environment, evolution of database system.
Database Development Process: Information engineering, information architecture,
enterprise data model, planning, SDLC, CASE etc. Steps of planning, strategic planning
factors, corporate planning objects. Developing preliminary data model, and use of
planning matrices, SDLC steps, CASE role, people in database development, three-
schema architecture for database development. Examples to demonstrate the
development process.

Unit-2
Modeling Data in the Organization: Modeling of the rules of organization, data names
and definitions, ER model constructs entities and its types, attributes, relationships, degree,
unary, binary, ternary, n-ary, cardinalities constraints, ER modeling examples.
Enhanced ER modeling: supertype, subtypes, specialization, generalization, specifying
constraints in EER models, completeness, Disjointness, discriminators, defining super/sub
type hierarchies, EER modeling examples, live demos modelling for few scenarios.

Unit-3
Logical database design: and relational model development, Relational model properties,
keys, primary, secondary, composite, properties of relations. Codd’s rules, integrity
constraints, creating relational tables, Transform EER diagrams into relations, seven
different steps for mapping EER model into relations.

Unit-4
Introduction to normalization: steps, functional dependencies, basic normal forms,
definition of first, second, third normal form and removing anomalies from the relations. De-
normalization and merging relations.

Unit- 5
 Special Topics (Overview): Data Warehousing, Data Mining, Distributed Databases,
Object oriented modeling, definitions, activities in phases of model development, advantages
of OOM, UML class diagrams, Example of a model development.

Text Book:
1. Hoffer, Prescott, “Modern Database Management”, Seventh Edition, McFadden Pearson
Education.
References:
1. Thomas M. Connolly, Carolyn E. Begg, “Database Systems”, Pearson Education.
2. Raghu R and Johannes G., “Database management Systems”, Mc Hill 3 rd Edition,
3. Elmasri R, Navathe S, “Fundamentals of Database Systems”, Addison Wesley 4 th
Edition.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01
Understand the basic concepts of databases and learn the database development process.
CO02
Apply knowledge to develop different database models and EER model on practical databases.
CO03 Apply design principles for logical design of databases.
CO04 Understands how to apply normalization technique on different databases and develop a database
application system
CO05 Learns modern technologies such as data mining and warehousing, distributed databases.
 Course Code Course Name Hours Per Week
L T P Hrs. Credits
CS3EA09 Graph Theory
3 0 0 3 3

Course Learning Objectives (CLOs):

CLO01 To understand the importance and applications of Graph Theory in Computer Science &
Engineering
CLO02 To improve the proof writing skills and solve recurrence relation.
CLO03 To apply graph theory based approaches in solving practical problems
CLO04 Ability to use the concepts like isomorphism, coloring etc concepts in multidisciplinary
fields

Unit 1
Introduction: Graphs- Introduction, Sub Graphs, Walks, Paths, Circuits, Connectedness,
Components, Isomorphism, Euler Graphs, Hamiltonian Paths and Circuits, Trees- Properties of
Trees, Distance and Centers in Tree, Rooted and Binary Trees. Special Classes of Graphs:
Bipartite Graphs, Line Graphs, Chordal Graphs.

Unit 2
Spanning Trees: Definition, Spanning Trees in a Weighted Graph, Cut Sets: Properties of Cut
Set, All Cut Sets, Fundamental Circuits and Cut Sets, Connectivity and Separability, Network
Flows, 1-Isomorphism, 2-Isomorphism, Combinational and Geometric
Graphs, Planer Graphs, Different Representation of a Planer Graph.

Unit 3
Chromatic Number, Chromatic Partitioning, Chromatic Polynomial, Matching, Covering, Greedy
Coloring Algorithm, Four Color Problem, Directed Graphs -Types of Directed Graphs, Digraphs
and Binary Relations, Directed Paths and Connectedness, Euler Graphs.

Unit 4
Fundamental Principles of Counting, Permutations and Combinations, Binomial Theorem,
Combinations with Repetition, Combinatorial Numbers, Principle of Inclusion and
Exclusion, Derangement.

Unit 5
Generating Functions, Partitions of Integers, Exponential Generating Function, Summation
Operator, Recurrence Relations, First Order and Second Order, Non-homogeneous Recurrence
Relations, Method of Generating Functions.

Text Books:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice
Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison
Wesley, 1994.
3. Clark J. And Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
References:

1. Mott J.L., Kandel A. And Baker T.P. “Discrete Mathematics for Computer Scientists and
Mathematicians”, Prentice Hall of India, 1996.
2. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.
3. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO01 Understand the importance and applications of Graph Theory in Computer Science &
Engineering
CO02 Implement proof writing skills and recurrence relation in Graph Theory
CO03 Apply graph theory based approaches in solving practical problems
CO04 Use the concepts like isomorphism, coloring etc concepts in multidisciplinary areas
CO05 The students will be able to solve combinatorics problem in Mathemaatics
 Course Code Course Name Hours Per Week
L T P Credits
CS3EA04 Pattern Recognition
3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To understand the process of pattern recognition system, behaviours and interactions
into pattern by using statistical pattern recognition methods.
CLO02 To understand the mathematical basis of parameter estimation methods.
CLO03 To study the dimensionality reduction problem and Non parametric techniques for
Pattern Recognition.
CLO04 To understand the Unsupervised learning and clustering approaches for pattern
recognition.
CLO05 To study the supervised learning method and to apply the pattern recognition
methodologies to real world applications in activity modelling and decision making.

Unit- 1
Overview of pattern recognition, Supervised learning, Bayes Decision Theory: Minimum-error-
rate classification, Classifiers, Decision surfaces, discriminant function; Decision trees: CART,
Bayesian Belief Network.

Unit- 2
Parameter Estimation Methods: Maximum-Likelihood estimation: Gaussian case; Bayesian
parameter estimation: Gaussian case, Gibbs Algorithm, Hidden Markov Models (HMMs)

Unit- 3
Dimensionality reduction: Problems of Dimensionality, Principal component analysis; Fisher
discriminate analysis, Non Parametric Technique: Parzen windows, k-nearest neighbour
estimation.

Unit- 4
Unsupervised learning: Algorithms for clustering: K-Means, Unsupervised Bayesian learning,
Criterion functions for clustering; Hierarchical, partitional and online clustering methods.

Unit-4 5
Support Vector Machines, Pattern recognition applications: Image analysis, Biometrics: Face and
speech recognition, OCR.

Text Book:

1. Richard O. Duda, Peter E. Hart and D G. Stork, “Pattern Classification”, Wiley.

2. SergiosTheodoridis and Konstantinos Koutroumbas, “Pattern Recognition”, Academic Press.

References:

1. Tou and Gonzales, “Pattern Recognition Principles”, Wesley Publication Company.

2. Earl Gose, Richard Johnsonbaugh, Steve Jost “Pattern Recognition and Image Analysis”, PHI
Learning.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Analyze the fundamental concepts of a pattern recognition system by using statistical
pattern models and Implement simple pattern classifiers.
CO02 Evaluate the mathematical concepts of parameter estimation techniques
CO03 Categorize various Non parametric techniques and dimensionality reduction problems.
CO04 Explain the concept of Unsupervised learning and clustering approaches for pattern
recognition.
CO05 Analyze the supervised learning methods for pattern recognition to real-world
application such as Biometric and image analysis.
 Course Code Course Name Hours Per Week
CS3EL06 Internet of Things L T P Credits
3 0 0 3

Course Learning Objectives (CLOs):

CLO01 Describe IOT, its applications

CLO02 Make a small working model of Project based on IOT
CLO03 Different Communication Models of IoT and the API’s available
CLO04 Analyze the different levels of IOT like FunctionalView/ Operational View.
CLO05 Describe about the security issues in IOT and layer attack model in IOT
CLO06 Describe how the IOT helps the human being by easing life.

Unit-1
Introduction : Definition, Characteristics of IoT, IoT Architectural view, Physical design of
IoT, IoT Protocols, Communication Models of IoT, IoT Communication APIs, IoT Enabling
Technologies.

Unit-2
IoT and M2M: Machine-to-Machine (M2M), Difference between M2M and IoT, SDN
(Software Defined Networking) and NFV (Network Function Virtualization) for IoT, Data
Storage in IoT, IoT Cloud Based Services.
Unit –3
IoT Platform Design Methodology: Specifications of Purpose and Requirement, Process,
Domain Model, Information Model, Service, IoT Level, Functional View, Operational View,
Device and Component Integration, Application Development.
Unit –4
Security issues in IoT: Introduction, Vulnerabilities, Security requirements and threat analysis,
IoT security Tomography, layered attacker model, identity management and establishment,
access control.
Unit-5
Application areas of IoT: Home Automation, smart lighting, home intrusion detection, smart
cities, smart parking, environment, weather monitoring system, agriculture.

Text Books:
1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”,
Universities Press.
 2. Rajkamal,”Internet of Things”, Tata McGraw Hill publication

References:
1. Olivier Hersent, David Boswarthick, Omar Elloumi , “The Internet of Things – Key
applications and Protocols”, Wiley
2. Donald Norris “The Internet of Things: Do-It-Yourself at Home Projects for Arduino,
Raspberry Pi and BeagleBone Black”, McGraw Hill publication.
Open Learning Source:
1. https://nptel.ac.in/courses/106105166/
2. https://github.com/connectIOT/iottoolkit

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Analyse the requirements of an IOT and M2M.

CO02 Understanding of the use of various sensors/ actuators and micro-controllers

CO03 Understanding layered architecture of the IOT model.

CO04 Apply the different views of the IOT Model.

CO05 Describe the layered attack model of IOT and security issues.
CO06 Understanding the application areas of IOT.
 Hours per Week
Course Code Course Name
L T P Credit

CS3EL11 Statistical Analysis 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To illustrate with the basic knowledge of measure of central tendency and
dispersion.
CLO02 Elaborate the concept of random variables and distributions.
CLO03 Apply the knowledge of different distribution to find mean and variance.
CLO04 To prioritize the concept of correlation, regression and curve fitting.
CLO05 To illustrate with the concept of testing of hypothesis and its applications.

Unit -1 Summarizing Data using Statistical Measures:

Descriptive Statistics – Measure of central tendency - Mean: Arithmetic mean, Geometric mean
and Harmonic mean with its Mathematical properties, Properties of mean, Median and mode,
Relationship among mean, median and mode, Measure of dispersion – standard deviation,
Variance, Covariance and its properties, Coefficient of variation, Quartiles, Quartile deviation
and Mean deviation.

Unit -2 Theory of Random variables and Probability:

Random variables- Discrete and Continuous random variables, Mass and Density function
(pmf, pdf), Cumulative Distribution function, Expectation of a random variables, Expectation
of random variable in terms of variance, Introduction to probability theory, Trial and Event,
law of probability theory, Introduction to Conditional probability.

Unit-3 Probability Distribution:

Discrete Distribution: Binomial, Poisson distribution with mean variance, Moment generating
function.

Continuous Distribution: Normal and Exponential Distribution with mean variance, Moment
generating function.

Unit -4 Curve fitting, Correlation, Regression:

Curve fitting (Method of Least Square), linear and nonlinear curves, Correlation, Karl
Pearson’s Coefficient of Correlation, Spearman’s Rank Correlation Coefficient, Linear
Regression, Regression coefficients, Properties of regression curve.
 Unit -5 Testing of Hypothesis and Analysis of variance:

Introduction to testing of hypothesis, Statistical assumptions, Level of significance, Confidence

level, Type I Error, Type II error, Critical value, Power of the test, sampling distribution, Chi-
Square test, small sample test – t test for one and two sample mean, F test, Fisher Z test of
population variance, Introduction to one way and two way analysis of variance (ANOVA).

Text Books:
1. S.C. Gupta and V.K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand
& Sons Publication.
2. Probability and Statistics, Ravichandran, Wiley India.

References:
1. Sheldon M. Ross, “Introduction to Probability Models”, Elsevier Publication, Academic
Press, UK
2. Sheldon M. Ross, “Introduction to Probability and Statistics for Engineers and Scientists”,
Elsevier Publication, Academic Press, UK

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Understanding the basic concept of central tendency, dispersion, and probability
distribution for discrete and continuous random variable and remembering the formula
for correlation, regression and testing of hypothesis.

CO02 Apply the theoretical methods for testing and comparison of the sample and population
for mean, variance, standard deviation.

CO03 Analyze and organize the statistical data to examine the facts under view.

CO04 Evaluate the mean, median, mode on the basis of observation and compare it with the
theoretical distribution and evaluate the relation between the different variates on the
basis of correlation, regression.
List of Experiments:
1. Getting and using R and rstudio
2. Write a R program to take input from the user (name and age) and display the values.
Compare the different forms of data types.
3. What do you mean by type conversion. Write a R program to implement datatype
conversion.
4. Write a R program to create a vector of a specified type and length.- Create vector of
numeric, complex, logical and character types of length 10.
5. Write a R program to create three vectors a,b,c with 3 integers. Combine the three vectors
to become a 3×3 matrix where each column represents a vector. Print the content of the
matrix.
6. Write a R program to create a 5 x 4 matrix , 3 x 3 matrix with labels and fill the matrix by
rows and 2 × 2 matrix with labels and fill the matrix by columns.
7. Write R script to create and display list object of stores items having:
{Fruits:{orange,mango,apple,watermelon,banana}Juices:{appy,fruty,slice}
Milkshakes:{Mango, papaya, sapota,pineapple}}.
8. Write R program with the implementation of base package functions.
9. Name some functions available in “dplyr” package? (minimum 5 with syntax and
implementation).
10. Write about the following with example:
a)Mean b)Max c)Median d)Cumulative Sum e)Cumulative Max
f)Cumulative Min g)Cumulative Product
11. How we can implement Conditional statements in R. Write a R script with IF-ELSE
implementation.
12. Write a R program to draw an empty plot and specify the axes limits of the graphic with
limiting values 60 and 40.
13. Write a R program to create a simple bar plot of five subjects marks.
14. How to plot the word (text) data based on frequency of words.
15. Describe barplot() of iris$petal length attribute. Specify the observations of plot.
16. Draw a pie chart for the following data: with( main, sub , legend attribute)

Section I, II, III , IV, V

No.of workers 220,370, 190, 70, 250
17. Create correlogram for mtcars dataset by using all three methods
18. Apply linear regression on iris data set.
19. Apply hypothesis testing (T test ) in data.
20. Apply hypothesis testing (Chi Squre test ) in data.
21. Study various normal distribution functions in R with implementation.
 Hours per Week
Course Code Course Name
L T P Credits
CS3ES14 Software Workshop-III 0 0 2 1

(NLP)

Course Learning Objectives (CLOs):

CLO01 How key concepts from NLP are used to describe and analyze language
CLO02 Describe the formal language and their representation using grammars.
CLO03 POS tagging and context free grammar for natural language (english).

CLO04 Understanding semantics and pragmatics of natural language(english) for processing.

CLO05 Writing programs in Python to carry out natural language processing
.
Unit-1 Introduction
Human languages, Main approach of NLP, Knowledge in speech and language processing,
Ambiguity, Models and algorithms, Formal language and Natural Language, Regular Expression
and automata.
Unit-2 Text Pre-processing
Text Pre-processing, Tokenization, Feature Extraction from text, Morphology: Inflectional and
Derivational, Finite state morphological parsing, Finite state transducer
Part of Speech Tagging: Rule based, Stochastic POS, Transformation based tagging.
Unit-3 Speech Processing
Speech and phonetics, Vocal organ, Phonological rules and Transducer, Probabilistic models:
Spelling error, Bayesian method to spelling, Minimum edit distance, Bayesian method of
pronunciation variation.
Unit-4 N-Grams
Simple N-Gram, perplexity, Smoothing, Backoff, Entropy, Parsing: Statistical Parsing,
Probabilistic parsing, TreeBank.
Unit-5 Application
Sentiment analysis, Spelling correction, Word sense disambiguation, Machine translation, Text
Classification, Question answering system
Text Books:
 1. Daniel Jurafsky and James H. Martin, “Speech and Language Processing”, Pearson
Education.

2. James Allen, “Natural Language Understanding”, Pearson Education.

References:
1. Christopher D. Manning and Hinrich Schutze, “Foundation of statistical Natural
Language Processing”, MIT Press.
2. Mary Dee Harris “Introduction to Natural language Processing” ,Reston

Course Outcomes (COs):

After completion of this course the students shall be able to:
CO01 Understand natural language processing and to learn how to apply basic algorithms in
this field.
CO02 To get acquainted with the algorithmic description of the main language levels:
morphology, syntax, semantics, and pragmatics
CO03 Understand various resources of natural language data – corpora and word net.
CO04 To conceive basics of model representation of natural language.
CO05 Apply NLP concepts in different applications.

S.No Experiment List

1 To learn about morphological features of a word by analyzing it.
2 To generate word forms from root and suffix information
3 Understanding the morphology of a word by the use of Add-Delete table
4 To learn how to calculate bigrams from a given corpus and calculate probability of a
sentence.
5 To learn how to apply add-one smoothing on sparse bigram table.
6 To know the importance of context and size of training corpus in learning Parts of
Speech.
7 To understand the concept of chunking and get familiar with the basic chunk tagset
8 To know the importance of selecting proper features for training a model and size of
training corpus in learning how to do chunking.
9 To study Natural language processing library in python: NLTK / any other.
10 To study Natural language processing corpus/ Treebank (e.g. Wordnet) / any other.
 (XML LAB)

CLO01 Define Basics and history of XML and how to write your own XML
documents

CLO02 Convert a valid XML document based on a DTD

CLO03 Write valid XML documents based on a XML Schema.

CLO04 Transform XML documents using XSLT.

CLO05 Construct and Display XML documents using XPATH

Experiment 1 :-create a simple xml document to display the address book.

Experiment 2: to create an xml program for internal dtd (document type definition) creation.
Experiment 3:to create an xml program for external dtd (document type definition) creation.
Experiment 4 : to create a program for xml schema creation and display elements and
attributes.
Experiment 5: Create an HTML table for XML file
Experiment 6: To create a simple XSLT transformation from XSL to XML
Experiment 7 : To create a xml document and database for importing xml document into
database.
Experiment 8: To create a parsing XML document using DOM (Document Object Model)
parser. Store the information of students in XML file, validate it using XML schema and display
the information of students in HTML using XSLT with proper formatting and conditions.
Experiment 9: To create a xml document and database for importing xml document into
database using (data tab.).
Experiment 10: Store the information of students in XML file, validate it using XML schema
and display the information of students in HTML using XSLT with proper formatting and
conditions like having enrolment number, name start with, having CGPA between, in sorted
order.
Course Outcomes (COs):
After completion of this course the students shall be able to:
CO01
Student will construct an XML Document

CO02
Student will Illustrate DTD for a given XML Document

CO03
Student will Apply XML Schema to any XML Document
CO04
Student will Construct XSLT for XML Document

CO05
Student will Use X-Path for XML Document
 Hours per Week
Course Code Course Name
L T P Credits
OE00015 Agile Development 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To Introduce the concept of development agility and the Agile Manifesto
and to learn how and why agile practices centred around small, cross-
functional teams that self-organize to work collaboratively.
CLO02 To understand how both time boxed (Scrum) agile methods increasethroughput
and decrease cycle time, Understand how Scrum can be
used to deliver quality products
CLO03 To Understand how agile methods reduce risk via incremental learning and
delivery
CLO04 To understand the levels of planning and how agile practices shift the focus from
managing to a plan to planning continuously and steering toward results.
CLO05 To understand how agile’s inspect and adapt cycles continuously improve both product
and process.

Unit-1
Understanding Agile: Introduction to Agile Project Management, Agile Manifesto,
Agile Principles, Agile Benefits: Product Development and customers,
Development teams etc.

Unit-2
Agile Frameworks: Agile approaches, reviewing the big three: Lean, Extreme
programming and Scrum. Putting Agile in action: Environment, Behaviours- Agile
roles, New values, Team philosophy.

Unit-3
Working in Agile: Planning in Agile, product vision, creating the product
roadmap, refining requirement and estimates, release planning and Sprint
planning.

Unit-4
Managing in Agile: Managing Scope and procurement, managing time and cost,
team dynamics and communication, managing quality and risk

Unit-5
Ensuring Agile Success: Building a foundation- Commitment, choosing the right
project team members-Development team, scrum master etc. Being a change
agent, Key benefits and key resources for agile project management.
Text Books:
1. Mark C. Layton, Agile Project Management For Dummies, Wiley publishers
2. Jim Robert Highsmith, Agile Project Management: Creating
Innovative Products,Pearson education
3. Hitzler, Markus, Rudolph , Foundations of Semantic Web
Technologies, Chapman &Hall/CRC
4. Allemang , Hendler , Semantic Web for the working Ontologist, Elsevier Pub

References:
1. Charles G. Cobb, Making Sense of Agile Project Management:
Balancing Control andAgility, Wiley
2. Mike Cohn, Agile Estimating and Planning, Pearson
3. Liz Sedley and Rachel Davies, Agile Coaching, The Pragmetic Bookshelf

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Distinguish between agile software development and traditional software development and
Appraise the business value of adopting Agile approaches and development practices.
CO02 Design and provide measurement, metrics necessary for problems involving agile software
development and apply a thorough understanding of Agile principles and specific practices
CO03 Suggest agile software development approaches for any real-time problem, Select the most
appropriate way to improve results for a specific circumstance or need.
CO04 Integrate best practices of traditional and agile software development and use in real-time
problem solving
CO05 Evaluate likely successes and formulate plans to manage likely risks or problems.
 Hours per Week
Course Code Course Name
L T P Credits
OE00073 Cyber Security Fundamentals 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 Exhibit knowledge to secure corrupted systems, protect personal data, and secure
computer networks in an Organization
CLO02 Analyse the cyber security needs of an organization
CLO03 Understand key terms and concepts in Cryptography and Learn to apply Cyber Security
with Public key encryption and Hash function.
CLO04 Develop cyber security strategies and policies
CLO05 Understand principles of web security and to guarantee a secure network by monitoring
CLO06 Analysing the nature of attacks through cyber/computer forensics software/tools.
CLO07 Practice with an expertise in academics to design and implement security solutions.

Unit-1
Symmetric Ciphers
Symmetric Cipher model, Substitution techniques, Transposition techniques,
Steganography, Block cipher principles, Data Encryption Standard, Confidentiality using
symmetric encryption: Potential locations for confidentiality attacks, Link versus End-to-
End Encryption.
Unit-2
Public key encryption and HASH functions
Public key Cryptosystems: Principles, applications and requirements, RSA algorithm Key
Management: Distribution of Public keys and Secret keys, Diffie-Hellman key exchange.
Message Authentication: Authentication requirements, Authentication Functions like
Message Encryption, Message Authentication code and Hash Function. Requirement for a
Hash function, simple hash function, Block chaining techniques, Brute-force attack.
Unit-3
Cybercrimes-I
Introduction and classification of Cybercrimes, Cyberattack and its types viz Passive
attacks, Active attacks, Type of Malware and malware attack, Vulnerability and threads:
Classification of Vulnerability( Technology weakness, Configuration weakness, Security
policy weakness ) , Types of threat ( Unstructured, structured, external, internal etc),
common cyber attack terms: Hacker, Cracker, Phreaker, Spammer, Phisher, white hat,
black hat etc.

Unit-4
 Cybercrimes-II
Proliferation of mobile and wireless devices, attacks on mobile phone, Security challenges
in mobile devices, Registry setting and RAS security for Mobile devices, Credit card fraud.
Tools and Methods used in cybercrimes: Proxy anonymizers, Phishing, Password
creaking, Keyloggers, Spywares, Virus, worms, Trojan Horses, Backdoors.

Unit-5
Cyberlaws and Forensics
Need of cyber laws, Basic Indian IT Act-2000 and its various sections, Amended IT Act-
2000, Digital signature, Public key certificate . Digital forensics : Basics, investigation
methods, reporting and management of evidence.

Text Books:
1. William Stallings, “Cryptography and Network Security – Principles and
Practices”, Prentice Hall
2. Mark Rhodes- Ousley, “Information Security: The Complete Reference”, Tata McGraw
Hill

References:
1. Rajkumar Buyya, James Broberg and Anderzej Goscinski, “Cloud Computing Principles
and Paradigms”, Willey
2. Behrouz A. Forouzan and Debdeep Mukhopadhyay, “Cryptography and Network
Security”, Tata McGraw Hill

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Analyse and evaluate the cyber security needs of an organization

CO02 Determine and analyse software vulnerabilities and security solutions to reduce the risk
of exploitation.
CO03 Design and develop a security architecture for an organization.
CO04 Measure the performance and troubleshoot cyber security systems.
CO05 Design operational cyber security strategies and policies
CO06 Implement cyber security solutions and use of cyber security, information assurance,
and cyber/computer forensics software/tools
 Hours per Week
Course Code Course Name
L T P Credits
OE00051 R-Programming 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To understand importance and advantages of R Programming and IDE for programming.
CLO02 To understand and implement program on various data Structures in R.
CLO03 To understand basic programming fundamentals like Objects, Classes, Functions in R,
debugging tools etc
CLO04 Work with the Data Sets of various formats, Training algorithms and plotting.
CLO05 To become proficient in writing a fundamental program and perform Data Analytics with R wit
use of R strings, date etc.

Unit 1 - R basics
Introduction: Basic features of R, advantages of using R, Limitations, R resources, Arithmetic
and objects, Math, Variables, and Strings, Vectors and Factors, Vector operations.

Unit 2 - Data structures in R

Data types, Arrays, Tables, Matrices: operations, Lists: operations, Data frames: creation,
factors, reading.

Unit 3 - R programming fundamentals

Conditions and loops, Functions in R, Objects and Classes, Recursion, Debugging

Unit 4 - Working with data in R

Reading CSV and Excel Files, Reading text files, Writing and saving data objects to file in R,
Reading in larger, Datasets, Exporting data. Interface to outside world.

Unit 5 – String & Dates in R, Graphics

String operations in R, Regular Expressions, Dates in R, Time in R, Graphics: one dimension
plot, legends, function plot, box plot.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Implement basics of R Programming using built-in functions..

CO02 Understand fundamentals and Data Structures used in R Programming.
CO03 apply fundamentals and Data Structures , functions , debugging tools in writing R-script
CO04 Work with the Data Sets of various formats, Training algorithms and plotting.
CO05 R-Programming languages for different applications like Machine Learning, Data
Science etc.
Course Learning Objectives (CLOs):

CLO01 Students with understand the fundamental concepts of Block Chain

CLO02 They will able to understand the difference between Crypto currency and Blockchain.
CLO03 They will able to understand of various Consensus algorithms
CLO04 Students will apply their technical knowledge and skills to develop and implement
Blockchain
CLO05 Students will learn about various Applications and methods used for Blockchain

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Student will understand the basic terminology used in Blockchain and Bitcoin.
CO02 Students will be able to explore Blockchain and classification of various
cryptocurrency.
CO03 Students will learn about various Consensus algorithms.
CO04 Students will able to understand basic Blockchain Architecture.
CO05 Students will able to use and understand application of Blockchain.
SEMESTER – VII
Sr.
Course Code Courses L T P Credit
No.
1 CS3ELXX Elective-5 3 0 0 3
2 CS3ELXX Elective-6 3 0 0 3
3 OE000XX Open Elective-3 3 0 0 3
Fundamentals of Management, Economics &
4 EN3HS04 3 0 0 3
Accountancy
5 CS3PC01 Project Work I 0 0 8 4
6 CS3PC03 Industrial Training 0 2 0 2
Total 12 2 8 18
Total Contact Hours 22
 Hours per Week
Course Code Course Name
L T P Credits
CS3ED03 Data Visualization 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To understand and learn about basics of data visualization, Data sources, principles of
visualization as well as basic approaches to visually map data on to aesthetics in
visualization.
CLO02 To Learn about Methods of Non linear Magnification and Abstraction in computer
graphics.
CLO03 To learn types of visualization, Encoding of data and To identify appropriate data
visualization tools for a particular scenario. To learn various techniques given particular
requirements imposed by the data.
CLO04 To learn Textual and Temporal Data visualization, To Learn Interactive 3D illustrations
with text and images.
CLO05 To understand the various abstraction mechanisms and common Visualization Idioms.

Unit-1: FOUNDATIONS FOR DATA VISUALIZATION

Introduction to data visualization, Look at Data, Data source, Visualizing data:
Mapping data onto aesthetics, Data visualization: basic principles, Coordinate
systems and axes, time series, and statistical data graphics.

Unit-2: COMPUTER VISUALIZATION

Computer Visualization: Exploring Complex Information Spaces , Fisheye Views –
Applications, Comprehensible Fisheye Views ,Fisheye Views for 3D data, Non Linear
Magnification , Comparing Visualization of Information Spaces , Abstraction in Computer
Graphics , Abstraction in User Interfaces.

Unit-3: MULTIDIMENSIONAL VISUALIZATION AND USING COLOR,

SIZE INVISUALIZATION

Visualization in 1D, 2D, 3D , Trees , Web Works , Data Mapping , Encoding Data using
Color , Encoding Data using Size, Data Visualization tools and its Applications, Stacked
& Grouped Bar Chart , Stacked Area Chart & Streamgraph , Line Chart with Multiple
Lines.

Unit-4: TEXTUAL AND TEMPORAL DATA VISUALIZATION

Words and text visualization , Document visualization , Interactive 3D illustrations
with Images and Text, Consistency of rendered – Images and their Textual labels
, Zoom Techniques for Illustration Purpose, Interactive Handling of Images and
Text, Continuous time-series visualization , Discrete event visualization.
 Unit-5: ABSTRACTION IN TIME AND COMMON VISUALIZATION IDIOMS
Introduction to D3 Scales , Loading and Parsing Data with D3.js , Encoding Data
with Marks and Channels , Rendering Marks and Channels with D3.js and
SVG(Scalable Vector Graphics) , Reusable Dynamic Components using the
General Update Pattern , Reusable Scatter Plot , Common Visualization Idioms
with D3.js , Bar Chart, Vertical & Horizontal , Pie Chart and Coxcomb Plot, Line
Chart , Area Chart.

Text books:
1. Tamara Munzner , Visualization Analysis & Design (ISBN 9781466508910)
2. Thomas Strothotte, Computer Visualization–Graphics Abstraction and Interaction
Reference:
1. Scott Murray , Interactive Data Visualization for the Web
2. Colin Ware ―Information Visualization Perception for Design, Morga.
3. Stuart.K. Card, Jock.D. Mackinlay and Ben Shneiderman, ―Readings
in InformationVisualization Using Vision to Think, Morgan Kaufmann
Pub.
4. Elijah Meeks , D3.js in Action
5. Jacques Bertin , Semiology of Graphics
6. Leland Wilkinson , The Grammar of Graphics
7. Hadley Wickham , ggplot2: Elegant Graphics for Data Analysis

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 To know about basic principles of Data visualization and mapping of data on to
aesthetics
CO02 To Understand the working of non linear magnification, principles of Abstraction.
CO03 To Apply data visualization best practices to their work, including choosing the right
chart type for the situation and avoiding visualization techniques that can mislead an
audience
CO04 To understand document and interactive 3D visualization with images and text, Learn
interactive handling of images and text.
CO05 To know about encoding of data with marks, visualization idioms
 Hours per Week
Course Code Course Name
L T P Credits
CS3EL05 Adhoc Network 3 0 0 3

Course Learning Objectives (CLOs):

CLO01 To Analyse about Introduction to Ad hoc networks.

CLO02 Students able to understand Medium access protocol MAC.
CLO03 Knowledge of apply Routing protocols for Ad hoc Network.
CLO04 To understand Transport layer and security protocols for Ad hoc Network.
CLO05 Understanding how to Secure routing is done in Ad hoc network.

Unit-1
Introduction to Ad hoc networks, Definition, characteristics features, applications,
characteristicsof wireless channel, architecture of Ad hoc network.

Unit-2
Medium access protocol MAC, design issues, goals, classification, contention
based protocols,IEEE standards 802.11, 802.15 and HIPERLAN.
Unit-3
Routing protocols for Ad hoc Network, Design issues, classifications, Table
driven routingprotocol,
Destination Sequenced Distance-Vector Routing Protocol, Cluster-Head Gateway
switch routingprotocol, On Demand routing protocol, Dynamic source routing
protocol, Ad hoc On Demand Distance Vector Routing Protocol.

Unit-4
Transport layer and security protocols for Ad hoc Network, design issues, goals,
classifications, security in Ad hoc network, issues and challenges in security
provisioning, Network security attacks.

Unit -5
Secure routing in Ad hoc network, requirement, security aware Ad hoc routing
protocols, Introduction to wireless sensor network, Applications of sensor
network, comparison with Adhoc wireless network.

Text Books:
1. C. Siva Ram Murthy and B.S. Manoj, Ad Hoc Wireless Networks Architectures and
Protocols,, Prentice Hall
2. Charles E. Perkins, “Ad hoc Networking,”
Addison-Wesley
References:
1. Carlos de Morais Cordeiro and Dharma Agrawal, Ad Hoc and Sensor
Networks: Theory and Applications, World Scientific
2. Mohammad Ilyas, The Handbook of Ad hoc Wireless Networks, CRC Press
3. C. K. Toh, Adhoc Mobile Wireless Protocol: Protocols and Systems, Pearson

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Students should be able to understand the Introduction to Ad hoc networks.

CO02 Students will be able to learnMedium access protocol MAC.
CO03 Students will be able to make command on Routing protocols for Ad hoc Network.
CO04 Students will be able to know the Transport layer and security protocols for Ad hoc
Network.
CO05 Students will be able to understand how to Secure routing in Ad hoc network.
 Hours per Week
Course Code Course Name
L T P Credits
Fundamentals of Management,
EN3HS04 3 0 0 3
Economics and Accountancy

Course Learning Objectives (CLOs):

CLO01 To introduce with the Fundamental knowledge of Management.

CLO02 To give knowledge about the Marketing and Human Resource Management.
CLO03 To provide basic information of Applied Economics.
CLO04 To get acquainted with the knowledge of Financial Accounting.
CLO05 To give sufficient knowledge of Financial Management.

Unit-1 Concepts of Management

Definition, characteristics and importance of management; Management:
Science or Art, Difference between Management and Administration,
Levels of management, Functions of Management, Managerial Roles,
Managerial skills and competencies; Decision Making: Definition, process
and types; Decision making under certainty, uncertainty and risk; Cross
cultural issues in management and challenges

Unit-3 Fundamentals of Marketing and Human Resource Management

Introduction to Marketing: Definition, importance, function and scope of
marketing, Core Concepts of marketing, Marketing concepts and
orientations, Marketing environment, Marketing-mix, Holistic marketing
concept, Customer Relationship Management (CRM).
Introduction to Human Resource Management (HRM): Nature, Scope,
Objectives and Functions; Role of HR manager, Process and need for
Human Resource Planning, Human resource policies, Changing role of
Human Resource in India, Globalization and its impact onHuman Resource.

Unit-3 Fundamentals of Economics

Introduction to Economics: Definition, nature, scope and significance;
Difference between microand macro economics; Time value of money, Law
of diminishing marginal utility; Theory of Demand and Supply, Price
elasticity of demand; Meaning and types of costs, Law of variable proportions;
Types of market structure; National income and related aggregates; Meaning
and types of Inflation; Meaning and phases of business cycle.

Unit-4 Basic Accounting Principles

Accounting Principles and Procedure, Double entry system, Journal,
Ledger, Trail Balance, Cash Book; Preparation of Trading, Profit and Loss
Account; Balance sheet; Cost Accounting: Introduction, Classification of
costs, Methods and Techniques of costing, Cost sheet and preparation of cost
sheet; Breakeven Analysis: Meaning and its application.
Unit -5 Fundamentals of Financial Management
Introduction of Business Finance: Meaning, Definition of Financial
Management, Goals of Financial Management (Profit Maximization and
Wealth Maximization), Modern approaches to Financial Management —
(Investment Decision, Financing Decision and Dividend Policy Decisions).

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Students will be able to understand Basics of Management Theory.

CO02 Student will be gaining knowledge of Marketing & Human Resource Management.
CO03 Students will be able to understand basic information for Economics.
CO04 Students will be able to get acquainted with the Financial Accounting System.
CO05 Students will be able gain sufficient knowledge of Financial Management
 Course Course Hours per
Total
Code Name Week
L T P Credits
CB3PC02 Projetc-I 0 0 4 2

Course Learning Objectives (CLOs):

CLO01 Ability to defined objective of real life problems, plan, design, develop and execute.

CLO02 Ability to work in team at component level, system level and troubleshoot of problems.

CLO03 Ability to reuse, integrate with existing components.

CLO04 Ability to derive performance metrics and assess quantitatively the performance of system.

CLO05 Ability to report and present the findings in standard formats.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Able to defined objective of real life problems, plan, design, develop and execute.

CO02 Able to work in team at component level, system level and troubleshoot of problems.

CO03 Able to reuse, integrate with existing components.

CO04 Able to derive performance metrics and assess quantitatively the performance of system.

CO05 Able to report and present the findings in standard formats.

SEMESTER VIII
Sr.
Course Code Courses L T P Credit
No.
1 CS3PC02 Project Work II 0 0 28 14
Total 0 0 28 14
Total Contact Hours 28
 Course Course Hours per
Total
Code Name Week
L T P Credits
CS3PC02 Project Work II 0 0 28 14

Course Learning Objectives (CLOs):

CLO01 Ability to defined objective of real life problems, plan, design, develop and
execute.
CLO02 Ability to work in team at component level, system level and troubleshoot of
problems.
Ability to reuse, integrate with existing components to develop the solution for
CLO03
different client to help the society.

CLO04
Ability to derive performance metrics and assess quantitatively the performance
of system.
CLO05 Ability to prepare the report and present the findings to the customer.

Course Outcomes (COs):

After completion of this course the students shall be able to:

CO01 Able to defined objective of real life problems, plan, design, develop and execute.
CO02 Able to work in team at component level, system level and troubleshoot of
problems.
Able to reuse, integrate with existing components to develop the solution for
CO03
different client to help the society.
CO04 Able to derive performance metrics and assess quantitatively the performance of
system.
CO05 Able to report and present the findings to the customer.