Curriculum For B.E.

VI Semester 2021 - 2022

CURRICULUM
FOR THE ACADEMIC YEAR 2021-2022

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

B.E. VI SEMESTER

POOJYA DODDAPPA APPA COLLEGE OF ENGINEERING

(An autonomous college under VTU)
KALABURAGI

Department of Computer Science & Engineering Page 1

 Curriculum For B.E. VI Semester 2021 - 2022

SCHEME OF TEACHING FOR VI SEMESTER - 2021-2022

B.E. (COMPUTER SCIENCE AND ENGINEERING)
Code No. Course Teaching Hours/Week Examination
Self
Lecture Tutorial Practical CIE SEE Total Credits
Study
Entrepreneurship,
19HU61 3 0 0 0 50 50 100 3
Management and Finance
19CS62 Computer Networks 3 0 0 0 50 50 100 3
19CS63 Machine Learning 4 0 1 0 50 50 100 4
19CS64X Professional Elective- I 3 0 0 0 50 50 100 3
19CS65X Industrial Elective 3 0 0 0 50 50 100 3
19CS6OE Open Elective- I 3 0 0 0 50 50 100 3
Recruitment Process
19HU02 2 0 0 0 50 50 100 1
Training-II
19CSL61 Computer Networks Lab 0 0 0 2 50 50 100 1
19CSL62 Machine Learning Lab 0 0 0 2 50 50 100 1
19CSMP63 Mini-project 0 0 0 2 50 50 100 2
Total 21 0 1 6 500 500 1000 24

ELECTIVES OFFERED:

Professional Elective- I

19CS641 Internet of Things

19CS642 Advanced Data Structures
19CS643 Parallel Computing
19CS644 Digital Image Processing

Industry Elective
Building Enterprise
19CS651
Applications
19CS652 Web Services
19CS653 Data Analytics
Robotic Process
19CS654
Automation

Open Elective -1

19CS6OE Java Programming

Department of Computer Science & Engineering Page 2

 Curriculum For B.E. VI Semester 2021 - 2022

AUTONOMOUS SYLLABUS FOR B.E VI SEMESTER 2021-2022

Course Title :ENTREPRENEURSHIP, MANAGEMENT AND FINANCE

Subject Code :19HU61 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites:
Course Objectives :
To enable the students to obtain the basic knowledge about Entrepreneurship and Management and
finance in the following topics:-
 The Meaning, Functions, Characteristics, Types, Role and Barriers of Entrepreneurship,.
Government Support for Entrepreneurship
 Management – Meaning, nature, characteristics, scope , functions, role etc and Engineers
social responsibility and ethics
 Preparation of Project and Source of Finance
 Fundamentals of Financial Accounting
 Personnel and Material Management, Inventory Control
MODULES Teaching Hours
Module I
ENTREPRENEUR : Meaning of Entrepreneur; Functions of an Entrepreneur;
Characteristics of an entrepreneur , Types of Entrepreneur; Intrapreneurs – an
emerging class ; Role of Entrepreneurs in economic development; Barriers to 8 Hrs
entrepreneurship, Government Support for Innovation and Entrepreneurship in
India - Startup-India, Make-in-India, PMMY, AIM , STEP, BIRAC, Stand-up
India, TREAD
Module II
MANAGEMENT: Introduction – Meaning – nature and characteristics of
Management, Scope and functional areas of management, Roles of 8 Hrs
Management, Levels of Management, Henry Fayol - 14 Principles to
Management , Engineers Social responsibility and Ethics
Module III
PREPARATION OF PROJECT AND SOURCE OF FINANCE:

PREPARATION OF PROJECT: Meaning of project; Project Identification;

Project Selection; Project Report; Need and Significance of Report; Contents; 8 Hrs
SOURCE OF FINANCE: Long Term Sources(Equity, Preference, Debt
Capital, Debentures, loan from Financial Institutions etc) and Short Term
Source(Loan from commercial banks, Trade Credit, Customer Advances etc)
Module IV
FUNDAMENTALS OF FINANCIAL ACCOUNTING: Definition, Scope
and Functions of Accounting , Accounting Concepts and Conventions: Golden 9 Hrs
rules of Accounting, Final Accounts - Trading and Profit and Loss Account,
Balance sheet

Department of Computer Science & Engineering Page 3

 Curriculum For B.E. VI Semester 2021 - 2022

Module V
PERSONNEL MANAGEMENT, MATERIAL MANAGEMENT AND
INVENTORY CONTROL:

PERSONNEL MANAGEMENT: Functions of Personnel Management,

Recruitment, Selection and Training, Wages, Salary and Incentives 9 Hrs
MATERIAL MANAGEMENT AND INVENTORY CONTROL: Meaning,
Scope and Objects of Material Management. Inventory Control- Meaning and
Functions of Inventory control ; Economic Order Quantity(EOQ) and various
stock level ( Re-order level, Minimum level, Maximum level, Average level
and Danger level)
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Develop Entrepreneurship skills
Apply the concepts of management and Engineers Social responsibility & Ethics
CO2 practice
19HU61 CO3 Prepare project report & choose different Source of Finance.
CO4 Apply Fundamentals of Financial Accounting and interpret the final accounts

CO5 Apply personnel management skills, Material and inventory control techniques

Department of Computer Science & Engineering Page 4

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: COMPUTER NETWORKS

Subject Code : 19CS62 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Data Communication.
Course Objectives:
 Review the underlying concepts of data communication and computer network
 Gain knowledge about functions of data link layer and related protocols and Describe
working of simple LAN with hubs, bridges and switches
 Learn Internetworking with emphasis on routing protocols, architectures, and implementation
issues
 Learn functions of transport layer, study congestion control mechanisms and build network
applications using TCP/IP model.
MODULES Teaching Hours
Module I
Review of Basic Concepts& Direct Link Networks: Building a Network;
Requirements-Connectivity, Cost-Effective Resource Sharing, support for
08 Hrs
Common Services; Network Architecture-Layering and Protocols, OSI
Architecture, Internet Architecture; Performance-Bandwidth and Latency,
Delay × Bandwidth Product, High-Speed Networks. ; Encoding (NRZ, NRZI,
Manchester, 4B / 5B), Framing: (BISYNC,PPP,DDCMP),HDLC,SONET

Module II
Packet Switching: Two dimensional parity, internet checksum algorithm,
CRC, Reliable transmission: stop and wait, sliding window, concurrent logical
channels Ethernet & multiple access networks(802.3): physical properties, 08 Hrs
access protocol, experience with Ethernet,Wireless:802.11/Wi-Fi, Bluetooth ,
cell phone technologies, Switching and Bridging –Datagrams , Virtual Circuit
Switching, Source Routing; Bridges and LAN Switches.
Module III
Internetworking : Basic Internetworking: What is an internetwork, service
model, global addresses, datagram forwarding in IP, subnetting & classless
addressing Address Translation(ARP), Host configuration(DHCP),Error 08 Hrs
Reporting(ICMP), Virtual Networks and Tunnels, Routing, Network as a
Graph, distance Vector(RIP), Link State(OSPF), Metrics, Global Internet
Routing areas, Interdomain routing (BGP),IP Version 6(IPv6).

Department of Computer Science & Engineering Page 5

 Curriculum For B.E. VI Semester 2021 - 2022

Module IV
End–to-End Protocols& Resource Allocation: Simple demultiplexer(UDP);
Reliable byte stream(TCP)–End-to-End Issues, Segment Format, Connection 08 Hrs
Establishment and Termination, Sliding Window Revisited, Triggering
Transmission, Adaptive Retransmission, record Boundaries, Issues in resource
allocation–Network Model, Taxonomy, Evaluation Criteria; Queuing
disciplines.
Module V
Congestion Control & Application: TCP Congestion Control–Additive 10 Hrs
Increase/Multiplicative Decrease, Slow Start, Fast Retransmit and Fast
Recovery; Congestion-Avoidance mechanisms–DECbit, Random Early
Detection(RED), Source-Based Congestion Control. Traditional applications–
Electronic Mail (SMTP, MIME, IMAP), World Wide Web(HTTP),
Multimedia application: session and call control Infrastructure Services:Name
Service (DNS), Network management (SNMP) Quality of Service.

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
TEXT BOOKS:
1. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 5th
Edition, Elsevier, 2010.
REFERENCE BOOKS:
1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw Hill,
2006.
2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.
3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts
and Key Architectures, 2nd Edition Tata McGraw-Hill, 2004.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Explain architectural concepts of layering , error control
techniques and analyze data link protocols their analysis
CO2 Illustrate the working of LAN , bridges and switches
CO3 Apply principles of internetworking and illustrate internet
19CS62 routing protocols
CO4 Demonstrate working of transport layer protocols and resourceallocation

CO5 Explore TCP congestion control techniques and application layerprotocols

Department of Computer Science & Engineering Page 6

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: MACHINE LEARNING

Subject Code : 19CS63 Credits :4 CIE: 50
Number of Lecture Hours/Week 4 Hrs Self-Study : 1Hrs SEE: 50
Total Number of Lecture Hours 52 SEE Hours: 03
Prerequisite: Probability and statistics, knowledge of any programming language.
Course Objectives:
 Acquiring the fundamentals concepts machine learning
 Study various learning methods to develop an intelligent machine.
Modules Teaching Hours
Module – I
Introduction: Well posed learning problems, Designing a Learning system,
Perspective and Issues in Machine Learning.
Concept Learning: Concept learning task, Concept learning as search, Find-
10 Hrs
S algorithm, Version space, Candidate Elimination algorithm, Inductive Bias.
Module - II
Decision Tree Learning: Decision tree representation, Appropriate problems
for decision tree learning, Basic decision tree learning algorithm, hypothesis 10 Hrs
space searching decision tree learning, Inductive bias in decision tree learning,
Issues in decision tree learning.
Module - III
Artificial Neural Networks: Introduction, Neural Network
representation, Appropriate problems, Perceptron, Multilayer networks and the 10 Hrs
Back-propagation algorithm.
Module - IV
Evaluating Hypothesis: Motivation, Estimating hypothesis accuracy,
Basics of sampling theorem, General approach for deriving confidence
intervals, Difference in error of two hypothesis, Comparing learning
algorithms. 11 Hrs
Reinforcement Learning: Introduction, The Learning Task, Q Learning,
Nondeterministic Rewards and Action, Temporal Difference Learning.
Instance Based Learning: Introduction, k-nearest neighbor learning, locally
weighted regression, radial basis function, cased-based reasoning.
Module – V
Bayesian Learning: Introduction, Baye’s theorem, Bayes theorem and
concept learning, ML and LS error hypothesis, ML for predicting 11 Hrs
probabilities, MDL principle, Naive Bayes classifier, Bayesian belief
networks, EM algorithm.

Department of Computer Science & Engineering Page 7

 Curriculum For B.E. VI Semester 2021 - 2022

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text book:
1. Tom M. Mitchell, Machine Learning, Indian Edition Paperback 2017, McGraw Hill
Education.
Reference Books:
1. Trevor , The Elements of Statistical Learning, 2ndedition, 2017, Springer series in statistics.
Hastie, Robert Tibshirani, Jerome Friedman
2. Ethem Alpaydın, “Introduction to machine learning”, Third Edition, PHI Learning Pvt. Ltd.
2016
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Identify the problems for machine learning.

CO2 Implement decision algorithm for CO1

CO3 Apply concepts of ANN for machine designing.

19CS63
CO4 Compare different learning modules and demonstrate alternative modes.
Estimate target function using instance based learning
CO5 Illustrate Bayians learning laws and its application.

Department of Computer Science & Engineering Page 8

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: Internet of Things (IoT)

Subject Code : 19CS641 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Microprocessor and microcontroller
Course Objectives:
 Acquire the data with sensors and perform data analysis

MODULES Teaching Hours

Module I
What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence of 8 Hrs
IT and IoT, IoT Challenges, IoT Network Architecture and Design, Drivers
Behind New Network Architectures, Comparing IoT Architectures, A
Simplified IoT Architecture, The Core IoT Functional Stack, IoT Data
Management and Compute Stack.

Module II
8 Hrs
Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects,
Sensor Networks, Connecting Smart Objects, Communications Criteria, IoT
Access Technologies.
Module III
IP as the IoT Network Layer, The Business Case for IP, The need for 8 Hrs
Optimization, Optimizing IP for IoT, Profiles and Compliances, Application
Protocols for IoT, The Transport Layer, IoT Application Transport Methods.

Module IV
Data and Analytics for IoT, An Introduction to Data Analytics for IoT, Machine
Learning, Big Data Analytics Tools and Technology, Edge Streaming 8 Hrs
Analytics, Network Analytics, Securing IoT, IOT AND M2M,Introduction,
difference between IoT and m2m,SDN and NFV for IOT. IoT Physical Devices
and Endpoints - Arduino UNO: Introduction to Arduino, Arduino UNO,
Installing the Software, Fundamentals of Arduino Programming.
Module V

IoT Physical Devices and Endpoints - RaspberryPi: Introduction to

RaspberryPi, About the RaspberryPi Board: Hardware Layout, Operating
Systems on RaspberryPi, Configuring RaspberryPi, Programming RaspberryPi 10 Hrs
with Python, Wireless Temperature Monitoring System Using Pi, DS18B20
Temperature Sensor, Connecting Raspberry Pi via SSH, Accessing

Department of Computer Science & Engineering Page 9

 Curriculum For B.E. VI Semester 2021 - 2022

Temperature from DS18B20 sensors, Remote access to RaspberryPi, Smart and

Connected Cities, An IoT Strategy for Smarter Cities, Smart City IoT
Architecture,

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome Henry,"IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of Things”,
1st Edition, Pearson.
2. Srinivasa K G, “Internet of Things”, CENGAGE Leaning India, 2017 .
3. Internet Of Things A hands on Approach , Arashdeep Bhaga,Vijay Madiseeti
Reference Books:
1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands -on-Approach)”, 1 st Edition, VPT, 2014.
2. Raj Kamal, “Internet of Things: Architecture and Design Principles”, 1 st Edition, McGraw Hill Education,
2017.
Course CO # Course Outcome (CO)
Code
Illustrate the impact and challenges posed by IoT networks leading to new
CO1
architectural models.
Compare and contrast the deployment of smart objects and the technologies to
CO2
connect them to network.
19CS641 CO3 Demonstrate the role of IoT protocols for efficient network communication.
CO4 Describe the need for Data Analytics and Security in IoT.
Analyze different sensor technologies for sensing real world entities and
CO5
identify the applications of IoT in Industry.

Department of Computer Science & Engineering Page 10

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: Advanced Data Structures

Subject Code : 19CS642 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Pre-requisites: Data structures, Analysis and Design of Algorithms.
Course objectives:
 Understand advanced data structures to solve complex problems in various domains.
 Build the logic to use appropriate data structure in logical and computational solutions.
 Develop modern applications using Advanced data structures.
MODULES Teaching Hours
Module –I

Introduction: Data Structure, Design of Data Structure, Analysis of Data

Structure, 08 Hrs
Amortized Complexity, Computational Models, RAM model, Word RAM
model, Cell-probe model of computation, Bounds of Fundamental Data
Structures, Lazy Delete, O(1) Search by Hashing : Basic Hashing, Perfect
Hashing, Universal Hashing, Cuckoo Hashing, Bloom Filters, Locality-
Sensitive Hashing.
O(log(n)) Ordered Search (Trees and Lists): Balanced Binary Search Trees
(BSTs), Randomized BSTs, Splay Tree, Tango Tree, Skiplists, Static and
Dynamic Optimality.
Module-II

Findset, Find Min, and Find Word: Disjoint Sets, Binomial Heap, Fibonacci
Heaps, Tries, Inverted Index.
Evolving Paradigms of Data Structures: Geometric Queries, I/O 08 Hrs
Complexities, Communication Complexities, Large Data Problem.
Module-III

Spatial Data Structures: Range Search Trees, KD Trees, Quadtree, R Tree.

Temporal Data Structures: Partial Persistence, Retroactivity. 09 Hrs
External Memory Data Structures: Input/Output (I/O) Model, Cache
Oblivious Algorithms, B, B+ Tree, (a,b) Tree, Buffer Tree.
Module- IV
Distributed Data Structures (DDSs): Descriptions of Structures, Distributed
Hashing, Distributed Trees, Skip Graphs. 08 hrs
Synopsis Data Structures: Data Synopsis, Sampling, Sketching, Fingerprint,
Wavelets.
Module – V

Recent Applications: Introduction to Applications: Various Domain

Applications, Project.
Applications to Cryptography : MD5, Secure Socket Layers (SSLs), Block
Chains, Digital Signature, Projects.

Department of Computer Science & Engineering Page 11

 Curriculum For B.E. VI Semester 2021 - 2022

Application to IR and WWW: Crawl Frontier, Posting List Intersection, Text

Retrieval from Inverted Index, Auto Complete Using Tries, Projects.
Applications to Data Science: Heavy Hitters and Count-Min Structures,
Approximate Nearest Neighbor Searches, Low Rank Approximation by
Sampling, Near-Duplicate Detection by Min Hashing. Projects.
Application to Network and IOT: Click-Stream Processing Using Bloom 09 Hrs
Filters, GBF Algorithm, Fast IP-Address Lookup Using Tries, Integrity
Verification: Cloud and IOT Data, Projects.
Applications to Systems: Queue Spilling, Completely Fair Schedulers in
Kernels, CFS internals, Distributed Caching, Data Structures for Building File
Systems, Projects.
Applications to Databases: Database Problems, B and B+ Trees for Database
Creation and Block Search, CouchDB, Bloomjoins. Projects.
Applications to Images and Graphics: R Trees for Map Searches, Spatial
Proximity in GIS, Ray Shooting, Data Structures Used in Ray Shooting.
Projects.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text books:
1. Suman saha, Shailendra shukla, ”Advanced Data Structures Theory and Applications”, CRC
Press, Tailor and Francis, publication, Jun 2019, ISBN: 9781138592605
2. https://www.tutorialspoint.com/advanced_data_structures
Reference Books:

1. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford .” Introduction
to Algorithms (3rd ed.).” MIT Press and McGraw-Hill.ISBN 0-262-03384-4. 1320 pp., 5
printings up to 2016
1. 2. Peter Brass, “Advanced data structures”, Cambridge University Press, 1 st edition, sep 2008,
2. 2008,ISBN: 978-0521880374
3. 3. Marcello Ra Rocca, “Advanced algorithm and data structures”, Manning publications, May
4. 2021
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Demonstrate, design and analysis of data structures, hashing, ordered
search.
CO2 Illustrate heaps, tries and I/O complexities.
19CS642 CO3 Apply spatial, temporal and external memory data structures to large
volume of data.
CO4 Demonstrate Distributed and synopsis data structures .
CO5 Develop various domains real world applications .

Department of Computer Science & Engineering Page 12

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: PARALLEL COMPUTING

Subject Code : 19CS643 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Pre-requisite: Data Structure, Analysis and design of algorithms, Operating System
Course Objectives:
 To introduce the major concepts and ideas in parallel computing and its applications
 To help understand various model of parallelism and their strength and limitations.
 To introduce bottle necks in parallel computing
 Basic knowledge to write simple MPI parallel programs.
MODULES Teaching Hours
Module –I

Introduction to Parallel Computing & Parallel Programming Platforms:

Motivating Parallelism, Scope of Parallel Computing, Implicit Parallelism: 08 Hrs
Trends in Microprocessor Architectures, Limitations of Memory System
Performance, Dichotomy of Parallel Computing Platforms, Physical
Organization of Parallel Platforms, Communication Costs in Parallel Machines,
Routing Mechanisms for Interconnection Networks, Impact of Process-
Processor Mapping and Mapping Techniques.
Module-II

Principles of Parallel Algorithm Design: Preliminaries, Decomposition

Techniques, Characteristics of Tasks and Interactions, Mapping Techniques for
Load Balancing, Methods for Containing Interaction Overheads, Parallel 08 Hrs
Algorithm Models.
Module-III

Analytical Modeling of Parallel Programs : Sources of Overhead in Parallel

Programs, Performance metrics for parallel systems, The effect of Granularity 08 Hrs
on performance, Scalability of Parallel Systems, Minimum execution time and
minimum cost optimal execution time, Asymptotic analysis of Parallel
programs, Other Scalability Metrics.
Module- IV

Programming Using the Message Passing Paradigm: Principles of Message 08 hrs

– Passing Programming, The Building Blocks, MPI: The Message passing
Interface, Overlapping Communication with Computation, Collective
Communication and Computation Operations, Groups & Communicators.

Module – V

Pthreads and Synchronization: Thread Basics, POSIX Thread API,

Synchronization Primitives in Pthreads, Controlling Thread and

Department of Computer Science & Engineering Page 13

 Curriculum For B.E. VI Semester 2021 - 2022

Synchronization Attributes, Thread Cancellation, Composite Synchronization

Constructs. 10 Hrs

OpenMP : Open MP programming model, Specifying tasks in openMP,

Synchronization constructs in open MP, Data handling in OpenMP, Open MP
library functions, Environment variables in OpenMP, Explicit Thread versus
OpenMP based programming. .

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text books:
1. Ananth Grama, George Karypis, Vipin Kumar and Anshul Gupta, Introduction to Parallel
Computing, Second Edition, Pearson Education, 2014
Reference Books:
1. Michael Quinn, Parallel Computing Theory and Practice, Tata McGraw Hill, 2003.
2. Michael Quinn, Parallel Programming in C with Mpi and openMP, McGrawHill, 2017
3. Peters S Pacheco, An introduction to Parallel Programming, Morgan Kaufmann Publishers
Course outcomes:
On completion of the course, the student will have the ability to:
CO # Course Outcome (CO)
Course Code
CO1 Explain Parallel computing, parallel programming Platforms, its
scope and routing mechanisms for interconnection networks
CO2 Apply Principles of Parallel Algorithm Design through use of
mapping techniques for load balancing
CO3 Analyze Parallel Programs and evaluate various performance metrics
19CS643
Granularity, Scalability, execution time and cost
CO4 Discuss message Passing interface, Communication and
Computation Operations.
CO5 Illustrate parallel programming through implementation of Pthreads
and Synchronization and describe the OpenMP programming model.

Department of Computer Science & Engineering Page 14

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: DIGITAL IMAGE PROCESSING

Subject Code : 19CS644 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Pre-requisite: Mathematics
Course Objectives:
 To comprehend the relation between human visual system and machine perception and
processing of digital images.
 To provide a detailed approach towards image processing applications like enhancement,
segmentation, and compression.
 
MODULES Teaching Hours
Module –I
Introduction : Fundamental Steps in Digital Image Processing, Components of
an Image Processing System, Sampling and Quantization, Representing Digital
Images (Data structure), Some Basic Relationships Between Pixels- Neighbors
and Connectivity of pixels in image, Applications of Image Processing: Medical
imaging, Robot vision, Character recognition, Remote Sensing. 09Hrs

Module-II

Image Enhancement In The Spatial Domain: Some Basic Gray Level

Transformations, Histogram Processing, Enhancement Using Arithmetic/Logic
Operations, Basics of Spatial Filtering, Smoothing Spatial Filters, Sharpening 08 Hrs
Spatial Filters, Combining Spatial Enhancement Methods.
Module-III

Image Segmentation: Introduction, Detection of isolated points, line detection,

Edge detection, Edge linking, Region based segmentation- Region growing, 08 Hrs
split and merge technique, local processing, regional processing, Hough
transform, Segmentation using Threshold
Module- IV
09 hrs
Image Compression: Introduction, coding Redundancy , Inter-pixel
redundancy, image compression model, Lossy and Lossless compression,
Huffman Coding, Arithmetic Coding, LZW coding, Transform Coding, Sub-
image size selection, blocking, DCT implementation using FFT, Run length
coding.
Module – V

Representation and Description: Representation, Boundary 08 Hrs

descriptors.Region descriptions.Application using MATLAB or Python on
Shape and texture descriptors

Department of Computer Science & Engineering Page 15

 Curriculum For B.E. VI Semester 2021 - 2022

Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
 Digital Image Processing – Rafael C. Gonzalez, Richard E. Woods, 3rd Edition, Pearson, 2008
 Digital Image Processing- S Jayaraman, S Esakkirajan, T Veerakumar- MC GRAW HILL
EDUCATION, 2010.
Reference Books:

 Digital Image Processing and Analysis-Human and Computer Vision Application with using
CVIP Tools – Scotte Umbaugh, 2nd Ed, CRC Press, 2011
 Digital Image Processing using MATLAB – Rafael C. Gonzalez, Richard E Woods and Steven
L. Eddings, 2nd Edition, MC GRAW HILL EDUCATION, 2010.
 Digital Image Processing and Computer Vision – Somka, Hlavac, Boyle- Cengage Learning
(Indian edition) 2008.
 Introductory Computer Vision Imaging Techniques and Solutions- Adrian low, 2008, 2nd
Edition
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Explore the fundamentals of digital images and its representations

CO2 Elaborate understanding on image enhancement techniques.

19CS644 CO3 Apply and Discuss image segmentation techniques
CO4 Justify the need for compression and evaluate the basic
compression algorithms.
CO5 Implement boundary and texture descriptors

Department of Computer Science & Engineering Page 16

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: BUILDING ENTERPRISE APPLICATIONS

Subject Code : 19CS651 Credits :3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Pre-requisites: Basics of software Engineering.
Course Objectives:
 To familiarize with different application frameworks.
 To acquire knowledge about software architecture and design at enterprise level
 To get practical aspects of planning and estimation in enterprise application rollout.
 To get acquainted with code review, code analysis and build process.

MODULES Teaching
Hours
Module I
Introduction to enterprise applications and their types, software engineering
methodologies, life cycle of raising an enterprise application, introduction to
skills required to build an enterprise application, key determinants of successful
enterprise applications, and measuring the success of enterprise applications.

Inception of enterprise applications, enterprise analysis, business modeling,

requirements elicitation, use case modeling, prototyping, non functional
requirements, requirements validation, planning and estimation. 09 Hrs

Architecture, Views and Viewpoints: Enterprise Application: An Enterprise

Architecture Perspective, Enterprise Triangle and Enterprise Architecture,
Enterprise Architecture frameworks, Blueprint of an Enterprise Application.

Module II
Logical Architecture: Technical Architecture and Design: Mapping Logical
Architecture to Technical Architecture, Object-Oriented Analysis and Design,
Infrastructure Services Layer, Presentation Layer, Business Layer, External 08 Hrs
Systems Layer, Integration Layer, Technical Solution Ecosystem.
Module III
Data Architecture Design: Relational Data modeling, XML modeling , other
Structured data representation, unstructured data representation . Infrastructure
Architecture and Design: Infrastructure Architecture and Design, Networking,
Internetworking , Internetworking and Communication Protocols, IT Hardware
and Software, Middleware, Policies for Infrastructure Management Deployment
Strategy, Architecture and Design Documentation: System Architecture
08 Hrs
Documentation, System Architecture Documentation , Design Documentation.
Construction Readiness: Defining a
Construction Plan, Defining a Package Structure, Setting Up a Configuration
Management Plan, Setting Up a Development Environment.

Department of Computer Science & Engineering Page 17

 Curriculum For B.E. VI Semester 2021 - 2022

Module IV
Introduction to Software Construction Map, Constructing the Solution
Layers: Infrastructure Services Layer Components, Presentation Layer 08 Hrs
Components, Business Layer Components, Data Access Layer Components,
Integration Layer Components.
Code Review: Objectives, Process. Static Code Analysis: Coding Style,
Logical Bugs, Security Vulnerabilities, Code Quality. Building Process and
Unit Testing: Building Process, Unit Testing. Dynamic Code Analysis: Code
Profiling, Code Coverage.
Module V
Testing and Rolling Out Enterprise Applications: Testing Enterprise
Applications: Types and Methods of Testing, Testing Levels, Testing
Approach, Enterprise Application Environments, Integration Testing. 09 Hrs

System Testing: Performance Testing, Penetration Testing Usability Testing,

Usability Testing, Globalization Testing, And Interface Testing. User
Acceptance Testing. Rolling Out Enterprise Applications.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text book:
1. Raising Enterprise Applications, Anubhav, Pradhan, Satheesha B Nanjappa, Senthi K
Nallasamy, Veerakumar Esakimuthu,, John Wiley, 2015
Reference Books:
1. Software Requirements: Styles & Techniques – published by Addison –
Wesley Professional.
2. Software Systems Requirements Engineering in Practice – published by McGraw-
Hill/Osborne Media.
3. Managing Software Requirements: A use Case Approach, 2/e – published by person.
4. Software Architecture : A Case based Approach – published by Pearson
5. Building Java Enterprise Applications – Published by O‘Reilly Media authored by Brett
McLaughlin
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Illustrate Enterprise Applications and its architecture.
CO2 Demonstrate the design of Logical and Technical architecture.
CO3 Discuss design of data and infrastructure architecture.
19CS651 CO4 Devolop Construction plan and Perform Code review, Code
analysis.
CO5 Employ testing methods and develop applications through enterprise
concepts

Department of Computer Science & Engineering Page 18

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: WEB SERVICES

SubjectCode:19CS652 Credits:3 CIE:50
Number of Lecture Hours/Week 3 Hrs SEE:50
Total Number of Lecture Hours 42 SEEHours:03
 Pre-Requisite: Web Technology
Course objectives:
 Define and explain Web Services and its architectures..
 Gain working knowledge of designing scalable web services.

MODULE Teaching Hours

MODULE-I
The Programmable Web and Its Inhabitants: Kinds of Things on the
Programmable Web4 HTTP: Documents in Envelopes, Method Information,
Scoping Information, The Competing Architectures, Technologies on the
Programmable Web, Leftover Terminology, Writing Web Service Clients: Web
Services Are Web Sites, delicious, The Sample Application Making the Request: 09 Hrs
HTTP Libraries, Processing the Response: XML Parsers, JSON Parsers:
Handling Serialized Data, Clients Made Easy with WADL
Module– II
RESTful Services: Introducing the Simple Storage Service Object-Oriented
Design of S3, Resources, HTTP Response Codes, An S3 Client, Request
Signing and Access Control, Using the S3 Client Library, Clients Made
Transparent with ActiveResource, Parting Words, The Resource-Oriented
Architecture, Resource-Oriented URIs, Addressability, Statelessness, 08 Hrs
Representations, Links and Connectedness, The Uniform Interface, That’s It!
Module-III

Designing Read-Only Resource-Oriented Services: Resource Design, Turning

Requirements Into Read-Only Resources,Figure Out the Data Set, Split the Data 08 Hrs
Set into Resources, Name the Resources, Design Your Representations, Link the
Resources to Each Other, The HTTP Response, Conclusion, Designing
Read/Write Resource-Oriented Services, User Accounts as Resources, Custom
Places, A Look Back at the Map Service.
Module-IV

A Service Implementation: A Social Bookmarking Web Service, Figuring Out

the Data Set, Resource Design, Design the Representation(s) Accepted from the
Client, Design the Representation(s) Served to the Client, Connect Resources to 09 Hrs
Each Other, What’s Supposed to Happen, What Might Go Wrong? ,Controller
Code, Model Code, What Does the Client Need to Know? , REST and ROA
Best Practices :Resource-Oriented Basics, The Generic ROA Procedure,
Addressability, State and Statelessness, Connectedness , The Uniform Interface,
This Stuff Matters, Resource Design, URI Design, Outgoing Representations,

Department of Computer Science & Engineering Page 19

 Curriculum For B.E. VI Semester 2021 - 2022

Incoming Representations, Service Versioning, Permanent URIs Versus

Readable URIs, Standard Features of HTTP, Faking PUT and DELETE, The
Trouble with Cookies, Why Should a User Trust the HTTP Client.
Module-V
The Building Blocks of Services: Representation Formats, Prepackaged Control
Flows, Hypermedia Technologies, The Resource-Oriented Architecture Versus
Big Web Services, What Problems Are Big Web Services Trying to Solve? 08 Hrs
,SOAP, WSDL, UDDI, Security, Reliable Messaging, Transactions, BPEL, ESB,
and SOA, Conclusion.
Question paper pattern:
The question paper will have ten questions.
There will be questions from each module, covering all the topics from a module.
The students will have to answer 5fullquestions, selecting one full question from each module.
Text Books:
1. Leonard Richardson and Sam Ruby Beijing Cambridge Farnham Köln Sebastopol Tokyo “RESTful
Web Services”, First Edition ,Copyright © 2007 O’Reilly Media. Printed in the United States of
America. Published by O’Reilly Media, Inc., 1005 Gravenstein Highway North, Sebastopol.
Refer the above mentioned text book for Module 1,2,3, 4 & 5
Reference Books:
1. RESTful Java with JAX-RS 2.0: Designing and Developing Distributed Web Services 2nd Edition,
ISBN-13978-1449361341,Edition,PublisherO'Reilly Media, Publication date12 November 2013.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO# Course Outcome(CO)
Code
CO1 Identify the fundamentals of Web service architectures
CO2 Explore the RESTful Services.
19CS652 CO3 Design the Read-Only Resource-Oriented Services

CO4 Implementation of web Services and best practices.

CO5 Illustrate Building Blocks Of Web Services

Department of Computer Science & Engineering Page 20

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: DATA ANALYTICS

Subject Code :19CS653 Credit : 3 CIE: 50
Number of Lecture Hours/Week 3 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Data Base Management System
Course Objectives : Introduce student to data analytic on distributed platform
MODULES Teaching Hours
Module I
Big data processing and Distributed architectures -Types of data:
Structured, semi structured, unstructured , Data Pre-processing: Data cleaning,
Data Integration, Data Reduction, Data Transformation and discretization, data 08 Hrs
cleaning, validation, modifications, enhancements.
Distributed Architectures : Hadoop, spark, HPCC Systems VsHadoop
Module II
HPCC Systems architecture :HPCC System functions, Data Lake
Architecture, The HPCC Systems design, Thor Vs ROXIE
ECL the programming language &Structures :ECL Watch, ECL Cloud IDE
/ VS Code, Simple ECL programs and Data Types explained, Data flow graphs 09 Hrs
(diagrams), Declarative programming, Declarative vs Imperative programming,
the ECL Compiler, The ECL program deployment and execution.
Module III
ECL the programming language &Structures :An Activity, An Activity
Declaration, A Record Declaration, Schema on Read (RECORD) explained, A
Function Declaration, A MODULE, ECL File(s), Importing files, Spraying and
Reading a file 09 Hrs
Data Shaping (Transforming) :Function, Module And Project, Iterate And
Rollup ,Sort, Join And Dedup ,Normalize And Denormalize ,Distribute And
Reading The Execution Graph
Module IV
Data Aggregation
GROUP and functions (SUM, AVE, COUNT…), TABLE and AGGREGATE
HPCC Systems Machine Learning Library- Part I 08 Hrs
ML_Core, PBblas- Parallel Block Linear Algebra Subsystem, Supervised
Learning Bundles- Linear Regression, Logistic Regression, Support Vector
Machines, Learning Trees
Module V
HPCC Systems Machine Learning Library- Part II
Supervised Learning Bundles- GLM, Generalized Neural Network,
Unsupervised Learning Bundles- K-Means, DBSCAN, Natural Language 08 Hrs
Processing Bundles-TextVectors
Question paper pattern
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.

Department of Computer Science & Engineering Page 21

 Curriculum For B.E. VI Semester 2021 - 2022

The students will have to answer 5 full questions, selecting one full question from each module.

TEXT BOOKS:
1. Big Data and Analytics, Seema Acharya and Subhashini C, 1 st Edition Wiley India Private Limited, 2015,
ISBN 978-8126554782. Module 1
2. Detailed handouts with references to material available on the web will be handed out every week.
https://hpccsystems.com/training/documentation/learning-ecl
https://github.com/hpcc-systems/Solutions-ECL-Training, Module 2 and 3
3. Data Mining – Concepts and Techniques, Jiawei Han and Micheline Kamber, Jian Pei, 3 rd Edition,
Morgan Kaufmann, 2012, ISBN 978-0-12-381479-1. module 1, module 4 & 5
4. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar:, Pearson Education,
2007, ISBN 978-81-317-1472-0.
REFERENCE BOOKS:
1. Paulraj Ponnaiah John Wiley & Sons, “Data Warehousing Fundamentals –Inc “, Student
Edition, 2001.
2. Margaret H Dunham, “Data Mining Introductory and advanced topics” –Pearson education,
2003.
3. Arun K Pujari, “Data Mining Techniques” –University Press, Private Limited, 2013.
4. C.C. Aggarwal, “Data Mining” Springer International Publishing Switzerland 2016.
5. Douglas Eadline,"Hadoop 2 Quick-Start Guide: Learn the Essentials of Big Data Computing in
the Apache Hadoop 2 Ecosystem", 1stEdition, Pearson Education, 2016. ISBN: 978- 9332570351
6. Joey Echeverria, Ben Spivey, “Hadoop Security”, O'Reilly Media, Inc., 2016.ISBN:
981491900987
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Understand and explore the concepts of data processing, distributed systems

CO2 Explore HPCC systems, ECL processing languages and structures

19CS653 CO3 Apply ECL processing and structure and process of data shaping
CO4 Describe data and analysis and machine algorithm on HPCC platform

CO5 Implement HPCC systems machine learning library

Department of Computer Science & Engineering Page 22

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: Robotic Process Automation

Subject Code : 19CS654 Credit : 3 CIE: 50
Number of Lecture Hours/Week 42 Hrs SEE: 50
Total Number of Lecture Hours 3 SEE Hours: 03
Prerequisites: Problem Solving with Programming , Object Oriented Programming with Java and
Operating Systems .
Course Objectives:
1. Discuss the concepts of Robotics Process automation
2. Describe the sequence, flowchart and control flow in automation tool
3. Demonstrate the data manipulation techniques
4. Demonstrate the usage of UI Explorer and Screen scraping.
MODULES Teaching Hours
Module I
What Is Robotic Process Automation: Scope and techniques of automation,
Robotic process automation, About UiPath, Future of Automation. Record and
Play: UiPath stack, Downloading and installing UiPath Studio, Learning 9 Hrs
UiPath Studio, Task recorder, Step-by-step examples using the recorder.

Module II
Sequence. Flowchart and Control Flow:Sequencing the Workflow,
Activities, Control Flow, various types of loops, and decision making, Step-by-
9 Hrs
step example using Sequence and Flowchart, Step-by-step example using
Sequence and Control Flow

Module III
Data Manipulation: Variables and Scope, Collections, Arguments-Purpose
8 Hrs
and use, Data table usage and examples, Clipboard management, File operation
with step-by-step example, CSV/Excel to data table and vice versa with a step-
by-step example

Module IV
Taking Control of the Controls: Finding and attaching windows, Finding the
control, Techniques for waiting for a control, Act on controls-mouse and 8 Hrs
keyboard activities
Module V
Working with UI Explorer, Handling events, Screen Scraping, When to use
OCR, Types of OCR available, How to use OCR.
8 Hrs
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
TEXT BOOKS:
1. Learning Robotic Process Automation Alok mani tripathi Kindle Edition, Published rch by Packt
Publishing .
2.E. Turban, R. Sharda, D. Delen, David King, Business Intelligence, 2nd ed. Pearson India, 2010.

Department of Computer Science & Engineering Page 23

 Curriculum For B.E. VI Semester 2021 - 2022

REFERENCES:
1. Marlon Dumas et. al., Fundamentals of Business Process Management, Springer, ebook, 2012.
2. Van der Aalst, Process Mining: Discovery, Conformance and Enhancement of Business Processes, Third
edition, 2011.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Identify the Robotics Process automation tools

CO2 Implement the sequence, flowchart and control flow in UiPath Studio
19CS654 Implement the data manipulation techniques in UiPath Studio
CO3

CO4 Discuss the UI Explorer and Screen scraping techniques

CO5 Implement the concepts learnt for real world applications

Department of Computer Science & Engineering Page 24

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: JAVA PROGRAMMING

Subject Code : 19CS6OE Credit : 03 CIE: 50
Number of Lecture Hours/Week 03 Hrs SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: C programming
Course Objectives: Learn the Java Programming to develop applications, understanding concepts of
multithreading and Exception Handling , creating GUI with applets and Event Handling.
MODULES Teaching Hours
Module I
Java Programming fundamentals– The Java Language, The Key attributes of
Object-Oriented Programming, The Java Development Kit, Handling Syntax
Errors, The Java Keywords, Identifiers in Java, The Java Class Libraries.
Introducing Data Types and Operators: Why Data types Are Important, Java
Primitive Types , Literals, A Closer Look at Variables, The Scope and Lifetime
of Variables, Operators, Arithmetic Operators, Relational and Logical Operators,
Short-Circuit Logical Operators, The Assignment Operator, Shorthand
Assignments, Type Conversion in Assignments, Using a Cast, Operator 10 Hrs
Precedence, Expressions.
Control Statements, String Handling- String Fundamentals, The String
Constructors, Three String-Related Language Features, The Length() Method,
Obtaining the Characters within a String, String Comparison, Using indexOf()
and lastIndexOf(), Changing the Case of Characters Within a String.
Module II
More Data Types and Operators – Arrays, Multidimensional Arrays,
Alternative Array Declaration Syntax, Assigning Array References, Using the
Length Member, The For-Each Style for Loop, Strings, The Bitwise Operators.
Introducing Classes, Objects, and Methods-Class Fundamentals, How
Objects are created, Reference Variables and Assignment, Methods, Returning 08 Hrs
from a Method, Returning a value, Using Parameters, Constructors,
Parameterized Constructors, The new Operator Revisited, Garbage Collection
and Finalizers, The this Keyword.

Module III
A Closer Look at Methods and Classes - Controlling Access to Class Members,
Pass Objects to Methods, How Arguments are passed, Returning Objects,
Method Overloading, Overloading Constructors, Recursion, Understanding
Static, Introducing Nested and Inner Classes, Varargs
Inheritance- : Inheritance Basics, Member Access and Inheritance, Constructors 08 Hrs
and Inheritance, Using super to Call Superclass constructors, Using super to
Access Superclass Members, Creating a Multilevel Hierarchy, When are
Constructors Executed, Superclass References and Subclass Objects, Method
Overriding, Overridden Methods support polymorphism, Using Abstract
Classes, Using final, The Object Class.
Module IV
Interfaces: Interface Fundamentals, Creating an Interface, Implementing an
Interface, Using Interface References Implementing Multiple Interfaces,
Constants in Interfaces, Interfaces can be extended, Nested Interfaces, Final
Thoughts on Interfaces.
Packages: Packages: Package Fundamentals, Packages and Member Access

Department of Computer Science & Engineering Page 25

 Curriculum For B.E. VI Semester 2021 - 2022

Importing Packages, Static Import.

Exception Handling :The Exception Hierarchy, Exception Handling 08 Hrs
Fundamentals, The Consequences of an Uncaught Exception, Exceptions Enable
you to handle errors gracefully, using Multiple catch clauses, Catching subclass
Exceptions, try blocks can be nested, Throwing an Exception, A Closer look at
Throwable, using finally, using throws, Java’s Built-in Exception, New
Exception features added by JDK 7, Creating Exception Subclasses.
Module V
Applets: Applet basics, A complete Applet Skeleton, Applet Initialization and
Termination, A key Aspect of an Applet Architecture, Requesting Repainting,
using the status window, Passing parameters to Applets.
Event Handling- Two Event Handling Mechanisms.
The Delegation Event Model- Events: Event Sources, Event Listeners.
Event Classes: The ActionEvent Class, The Adjustment Event Class, The
ComponentEvent Class, The Container Event Class,TheFocus 08 Hrs
EventClass,TheInputEvent Class, The ItemEvent Class, The KeyEvent Class,
The MouseEvent Class, The MouseWheelEvent Class, The
TextEventClass,TheWindowEvent Class.Using the Delegation Event Model-
Handling Mouse Events, Handling Keyboard Events, Adapter Classes, Inner
Classes, Anonymous Inner Classes
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Java Fundamental: A comprehensive Introduction by Herbert schildt, Dale Skrien. Tata McGraw
Hill Edition 2013
2. Herbert Schildt, The Complete Reference, JAVA 7th /9th Edition, Tata McGraw Hill,2013.
3. Java 6 Programming Black Book, Dreamtech Press.2012
Reference Books:
1. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education,2004.
2. Uttam K Roy, Advanced JAVA programming, Oxford University press, 2015.
Course CO # Course Outcome (CO)
Code
Apply the concepts of programming and implement programs using Java
CO1
constructs.
CO2 Create classes and demonstrate object oriented programming concepts

19CS6OE CO3 Develop program using method overloading and inheritance.

Demonstrate applications using interfaces and run-time errors through exception

CO4
handling.
CO5 Design GUI application program using Applets and event handling.

Department of Computer Science & Engineering Page 26

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: COMPUTER NETWORKS LAB

Subject Code : 19CSL61 Credit : 1 CIE: 50
Number of Practical Hours/Week 2 Hrs SEE: 50
SEE Hours:
03
Prerequisites: Analog and Digital Electronics
Course Objectives:
1. Build local area network
2. To understand the physical topology of LAN, components using simulation tools
3. Analyze MAC layer performance & conduct packet analysis

List of Programs Teaching

Hours
PART - A
1. Study CAT6 UTP EIA/TIA568A/B straight and cross-over cable
crimp and test and/verify its connectivity
2. Install and configure network devices like hub,switch,and router
and create a LAN and perform connectivity test.
3. Configure host IP,subnet mask and gateway in LAN
4. Study of basic Network configuration commands and utilities to
debug the network issues.
5. Case Study of Campus Network Operation Center
6. Packet capture and header analysis by wire-shark (TCP,UDP,IP)
USING WIRESHARK or any other tool.
7. Implement client server communication using sockets
PART – B

Following simulation experiment shall be conducted using qualnet

simulator/CISCO packet tracer

1. Simulate a three nodes point - to – point network with duplex

links between them. Set the queue size and vary the bandwidth
and find the number of packets dropped.
2. Simulate a four node point-to-point network with the links
connected as follows: N0-n2,n1-n2 and n2-n3. Apply TCP agent
between n0-n3 and UDP between n1-n
Apply relevant applications over TC and UDP agents
changing the parameter and determine the number of packets
sent by TCP / UDP.
3. Simulate the transmission of ping messages over a network
topology consisting of 6 nodes and find the number of packets
dropped due to congestion.

Department of Computer Science & Engineering Page 27

 Curriculum For B.E. VI Semester 2021 - 2022

4. Simulate an Ethernet LAN using n nodes (6-10), change error

rate and data rate and compare throughput.
5. Simulate an Ethernet LAN using n nodes and set multiple traffic
nodes and plot congestion window for different source/
destination.
6. Simulate simple ESS and with transmitting nodes in wire-less
LAN by simulation and determine the performance with respect
to transmission of packets.
7. Simulation of link state routing algorithm.

Question paper pattern: For SEE , two programs from the Exercise programs list
will be asked.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO Course Outcome (CO)
Code #
Demonstrate the use of different network cabling components and
CO1
devices
CO2 Analysis performance of LAN and wireless LAN
19CSL61 CO3 Illustrate basic networks utilities and demonstrate client server
communication.
CO4 Demonstrate working of routing algorithms.
CO5 Perform packet capture analysis the packet contents.

Department of Computer Science & Engineering Page 28

 Curriculum For B.E. VI Semester 2021 - 2022

Course Title: MACHINE LEARNING LAB

Subject Code :19CSL62 Credit : 1 CIE: 50
Number of Practical Hours/Week 2 Hrs SEE: 50
SEE Hours: 03
Prerequisites: Probability & Statistics, Java/Python Programming
Course Objectives:
 Learn implementation and applications of Machine Learning Algorithms.
 Understand the usage of various datasets for implementing ML Algorithms.

1. Write a Program to Implement Water-Jug problem using Python.

2. Write a Program to Implement AO* Algorithm using Python

3. Implement and demonstrate the FIND-S algorithm for finding the

most specific hypothesis based on a given set of training data
samples. Read the training data from a .CSV file.
4. For a given set of training data examples stored in a .CSV file,
implement and demonstrate the Candidate-Elimination algorithm
to output a description of the set of all hypotheses consistent with
the training examples.
5. Write a program to demonstrate the working of the decision tree
based ID3 algorithm. Use an appropriate data set for building the
decision tree and apply this knowledge to classify a new sample.
6. Build an Artificial Neural Network by implementing the
Backpropagation algorithm and test the same using appropriate
data sets.
7. Write a program to implement the naïve Bayesian classifier for a
sample training data set stored as a .CSV file. Compute the
accuracy of the classifier, considering few test data sets.
8. Assuming a set of documents that need to be classified, use the
naïve Bayesian Classifier model to perform this task. Built-in Java
classes/API can be used to write the program. Calculate the
accuracy, precision, and recall for your data set.
9. Write a program to construct a Bayesian network considering
medical data. Use this model to demonstrate the diagnosis of heart
patients using standard Heart Disease Data Set. You can use
Java/Python ML library classes/API
10. Apply EM algorithm to cluster a set of data stored in a .CSV file.
Use the same data set for clustering using k-Means algorithm.
Compare the results of these two algorithms and comment on the
quality of clustering. You can add Java/Python ML library
classes/API in the program.
11. Write a program to implement k-Nearest Neighbour algorithm to
Department of Computer Science & Engineering Page 29
 Curriculum For B.E. VI Semester 2021 - 2022

classify the iris data set. Print both correct and wrong predictions.
Java/Python ML library classes can be used for this problem.
12. Implement the non-parametric Locally Weighted Regression
algorithm in order to fit data points. Select appropriate
data set for your experiment and draw graphs
Question paper pattern: For SEE , two programs from the Exercise programs list will be asked.

Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
Understand the implementation procedures for the machine learning
CO1 algorithms.

Design Python programs for various Learning algorithms.

CO2
19CSL62
Apply appropriate data sets to the Machine Learning algorithms.
CO3

CO4 Perform Classification and clustering of Data using ML algorithms.

CO5 Apply Machine Learning algorithms to solve real world problems.

Department of Computer Science & Engineering Page 30