BNM Institute of Technology

An Autonomous Institution under VTU, Approved by AICTE

Department of Computer Science and Engineering
SEMESTER – V
Software Project Management and Finance (PCC)
Credit : 3
Course Code 21CSE151 CIA Marks 50
Teaching Hours/Week (L: T: P: J) 2:2:0:0 SEA Marks 50
Total Number of Lecture Hours 40 Exam Hours 03
Course Learning Objectives:
This course will enable students to
 Identify ethical and professional issues and explain why they are of concern to software
engineers.
 Recognize the importance of software maintenance and describe the intricacies involved in
software evolution.
 Apply estimation techniques, schedule project activities and compute pricing.
 Identify software quality parameters and quantify software using measurements and metrics.
 Recognize the need for agile software development, describe agile methods, apply agile
practices and plan for agility.
Number Bloom’s
of Hours Level

Module-1: Introduction
Introduction: Software Crisis, Need for Software Engineering.
Professional Software Development, Software Engineering Ethics. Case
Studies.
Software Processes: Models: Waterfall Model, Incremental Model and
(CO1)
Spiral Model, Process activities. 8
Apply
Requirements Engineering: Requirements Engineering Processes,
Functional and non-functional requirements.
The software Requirements Document, Requirements Specification,
Requirements validation, Requirements Management
Module-2: System Models, Design and Implementation, Software Testing
System Models: Structural models, Behavioral models, UML modeling
using StarUml tool.
(CO2)
Design and Implementation: Introduction to RUP, Design Principles 8
Apply
Software Testing: Development testing, Test-driven development,
Release testing, User testing.
Module-3: Project management, Project Planning, Quality management
Project management: Risk management, Managing People, Teamwork.
Project Planning: Software pricing, Plan-driven development, Project
(CO3)
scheduling: Estimation techniques, 8
Apply
Quality management: Software quality, Reviews and inspections,
Software measurement and metrics, Software standards
Module-4: Agile Software Development
Agile Software Development: Coping with Change, The Agile Manifesto:
Values and Principles. Agile methods: SCRUM (Ref ―The SCRUM (CO4)
8
Primer, Ver 20.) and Extreme Programming. Plan-driven and agile Apply
development. Agile project management, Scaling agile methods.
Module-5: Managing Project Finances
How to Manage Project Finances-Cost estimating: Work Breakdown
Structure, Cost budgeting: Cost Aggregation, Reserve Analysis, Parametric
estimating, Infrastructure and overheads, Cost control: Change Control,
Resource Management (CO5)
8
Performance Measurement and Analysis- Cost Variance, Earned Value, Apply
Schedule Variance, Cost Performance Index, Schedule Performance Index.
Forecasting, Introduction of Tools to manage project Finances-TouchBase
Project Financials
Course outcomes:
1. Understand the activities involved in software engineering and identify the role of various
process models.
2. Design a software system, component, or process to meet desired needs within realistic
constraints and describe various software testing methods
3. Illustrate the role of project planning and quality management in software development.
4. Describe agile project management and benefits of using agile approaches.
5. Understanding financial concepts and apply it to control Project Costs.
Reference Books:
1. Software Engineering Ian Sommerville Pearson Education 9th Edition, 2012
2. Software Engineering-A Practitioner approach Roger S. Pressman Tata McGraw Hil 7th Edition
3. An Integrated Approach to Software Engineering Pankaj Jalote Wiley India
4. A guide to the project Management body of knowledge- PMBOK guide , 7th edition

Marks Distribution for Assessment

CIA Components Description Marks
(50)
Written test  Total Number of Test:03
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests= 30 Marks
Assignment Activity to demonstrate all the phases of the software 10
development life cycle
Quiz Conduct quiz after 1st IA 10
Total CIA 50
SEA Written exam  Theory exam will be conducted for 100 marks and scaled 50
(50) down to 50 marks.
 The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions.
Total Marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science & Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: V
Course Name: Automata Theory and Computability Course Code: 21CSE152
L: T: P: J 2 : 2 :0 :0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 (40) SEA Duration: 03 Hours
Pre-Requisites:

Course Learning Objectives: The students will be able to

1 Introduce core concepts in Automata and Theory of Computation
2 Identify different Formal language Classes and their Relationships
3 Design Grammars and Recognizers for different formal languages
4 Prove or disprove theorems in automata theory using their properties
5 Determine the decidability and intractability of Computational problems

No. of Blooms
Module-1: Introduction to theory of Computation, Languages and Strings Hours Cognitive
Levels
Basic terminologies used in Strings, Languages, A Language Hierarchy,
Finite State Machines (FSM): Deterministic FSM, Regular languages, Understand
Designing FSM, Nondeterministic FSMs, Simulators for FSMs, 8 /Apply
Minimizing FSMs, Finite State Transducers,. CO1

Module-2: Regular Expressions

What is a RE?, Kleene’s theorem, Applications of REs, Manipulating and
Simplifying RE, Regular Grammars, Regular Languages (RL) and Non-
Apply
regular Languages ,To show that a language is regular, Closure properties 8
CO2
of RLs, to show some languages are not RLs.

Module-3: Context Free Grammars

Introduction to Rewrite Systems and Grammars, CFGs and languages,
designing CFGs, simplifying CFGs, Derivation and Parse trees, Ambiguity,
Apply
Normal Forms. Pushdown Automata (PDA): Deterministic and Non- 8
CO3
deterministic PDAs, alternatives that are not equivalent to PDA.

Module-4: Context-Free Languages and Turing Machine

Showing a language is context-free, Pumping theorem for CFL, Important
closure properties of CFLs, Turing Machine : Turing machine model, Apply
8
Representation, Language acceptability by TM, design of TM CO4

Module-5: Decidability
Variants of Turing Machines (TM), The model of Linear Bounded
automata. halting problem of TM, Post correspondence problem. Understand
Complexity: Growth rate of functions, the classes of P and NP, Quantum 8 CO5
Computation: quantum computers, Church-Turing thesis.
 Course Outcomes: After completing the course, the students will be able to

Understand the fundamental concepts in theory of computation, Design of finite state

21CSE152.1
machines for the given language

21CSE152.2 Design of Regular expressions to recognize FSM

21CSE152.3 Design Grammars and Automata (recognizers) for different language classes

21CSE152.4 Use Reduction techniques for translating complex problems into a formal computational
model like PDA and TM for better solution
21CSE152.5 Classify a problem with respect to different models of Computation.

21CSE152.6 Build automata for real time application and test using JFLAP tool

Text Books
1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson
education,2012/2013
2. K L P Mishra, N Chandrasekaran , 3rd Edition, Theory of Computer Science, PhI, 2012.
Reference Books
1.John E Hopcroft, Rajeev Motwani, Jeffery D Ullman, Introduction to Automata Theory,
Languages, and Computation, 3rd Edition, Pearson Education, 2013
2. Michael Sipser : Introduction to the Theory of Computation, 3rd edition, Cengage learning,2013
3. John C Martin, Introduction to Languages and The Theory of Computation, 3rd Edition, Tata
McGraw –Hill Publishing Company Limited, 2013
4. Peter Linz, “An Introduction to Formal Languages and Automata”, 3rd Edition, Narosa
Publishers, 1998
5. Basavaraj S. Anami, Karibasappa K G, Formal Languages and Automata theory, Wiley India,
2012

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
Build automata for real time application and test using JFLAP
AAT 10
tool
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institution under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 5
Course Name: Computer Networks Course Code: 21CSE153
L: T: P: J 3:0:2:0 CIA Marks: 50
Credits: 4 SEA Marks: 50
Hours/Week (Total) 5 hrs/ Week (60) SEA Duration: 03 Hours
Pre-Requisites:
Course Learning Objectives: The students will be able to
1 Demonstration of application layer, physical and data link layer protocols.
2 Apply transport layer services to understand UDP and TCP protocols.
3 Analyze the working routers, IP and Routing Algorithms as part of network layer.
4 Briefly understand the concepts of Network Security.

No. of Blooms Cognitive

Module-1: Introduction Hours Levels with CO
mapping
Introduction:
Data communication: Components, Data representation, Data flow,
Networks: Network criteria, Physical Structures, Network types: LAN,
WAN, Switching, The Internet. (1.1,1.2, 1.3(1.3.1to 1.3.4 of Text)
Network Models:
Protocol Layering: Scenarios, Principles, Logical Connections, TCP/IP
Protocol Suite: Layered Architecture, Layers in TCP/IP suite,
Description of layers, Encapsulation and Decapsulation, Addressing, 8 hours
Multiplexing and Demultiplexing, The OSI Model: OSI Versus TCP/IP. (Theory) Understand
(2.1, 2.2, 2.3 of Text) CO1
4 hours
Digital Transmission: Digital to digital conversion (Only Line coding: (Practical)
Polar, Bipolar and Manchester coding). Physical Layer: Analog to digital
conversion (only PCM), Transmission Modes, Analog Transmission:
Digital to analog conversion, Multiplexing and switching.

Lab Component: Simple NS2 Simulation Exercises.

Module-2: Data Link Layer

Data-link Layer:
Introduction: Nodes and Links, Services, Categories of link, Sublayers,
Link Layer addressing: Types of addresses, ARP. Data Link Control 8 hours
(DLC) services: Framing, Flow and Error Control, Data Link Layer (Theory
Protocols: Simple Protocol, Stop and Wait protocol, Piggybacking. (9.1, ) Apply
9.2(9.2.1, 9.2.2), 11.1, 11.2 of Text) 4 hours CO2
Media Access Control: (Practic
Random Access: ALOHA, CSMA, CSMA/CD, CSMA/ CA.(12.1 of al)
Text)
Lab Component: Simple NS2 Simulation Exercises.
Module-3: Network Layer
Network Layer:
Introduction, Network Layer services: Packetizing, Routing and
Forwarding, Other services, Packet Switching: Datagram Approach,
Virtual Circuit Approach, IPV4 Addresses: Address Space, Classful
Addressing, Classless Addressing, DHCP, Network Address Resolution,
Forwarding of IP Packets: Based on destination Address and Label.
(18.1, 18.2, 18.4, 18.5.1, 18.5.2 of Text)
Network Layer Protocols: 8 hours
(Theory) Apply
Internet Protocol (IP): Datagram Format, Fragmentation, Options,
Security of IPv4 Datagrams. (19.1 of Text). 4 hours CO3
(Practical)
Unicast Routing:
Introduction, Routing Algorithms: Distance Vector Routing, Link State
Routing, Path vector routing. (20.1, 20.2 of Text) L1,L2, L3
Lab Component
1. Wireshark Labs (https://www.rose -
hulman.edu/class/csse/csse432/201230/Wireshark-Labs/) IP
2. Implementation of Routing Algorithms.
Module-4: Transport Layer

Transport Layer:
Introduction: Transport Layer Services, Connectionless and Connection
oriented Protocols, Transport Layer Protocols: Simple protocol, Stop and wait
protocol, Go-Back-N Protocol, Selective repeat protocol. (23.1, 23.2.1, 23.2.2,
23.2.3, 23.2.4 of Text)
Transport-Layer Protocols in the Internet: 8 hours
User Datagram Protocol: User Datagram, UDP Services, UDP Applications, (Theory) Apply
Transmission Control Protocol: TCP Services, TCP Features, Segment, 4 hours CO4
Connection, State Transition diagram, Windows in TCP, Flow control, Error (Practical)
control, TCP congestion control. (24.2, 24.3.1, 24.3.2, 24.3.3, 24.3.4, 24.3.5,
24.3.6, 24.3.7, 24.3.8, 24.3.9 of Text)
Lab Component Wireshark Labs(https://www.rose -
hulman.edu/class/csse/csse432/201230/Wireshark-Labs/)
TCP,UDP
Module-5: Application Layer

Application Layer:
Introduction: providing services, Application- layer paradigms, Standard
Client -Server Protocols: World wide web, Hyper Text Transfer Protocol,
FTP: Two connections, Control Connection, Data Connection, Electronic
Mail: Architecture, Wed Based Mail, Telnet: Local versus remote logging.
Domain Name system: Name space, DNS in internet, Resolution, DNS
Messages, Registrars, DDNS, security of DNS. (25.1, 26.1, 26.2, 26.3, 26.4,
26.6 of Text) 8 hours
Socket Programming : creating Network Applications: Socket (Theory) Apply
Programming with UDP, Socket Programming with TCP. 4 hours CO5
Lab Component (Practical)
1. Wireshark Labs(https://www.rose -
hulman.edu/class/csse/csse432/201230/Wireshark-Labs/)
DNS,HTTP
2. Socket Programming
Course Outcomes: After completing the course, the students will be able to
Apply the concepts of digital communication to understand the working of physical
21CSE153.1
layer

21CSE153.2 Apply data link layer protocols with fundamentals of digital communication.

21CSE153.3 Apply IP and routing protocols in network layer.

21CSE153.4 Apply Transport Layer Services and infer TCP and UDP protocols.

21CSE153.5 Apply principles of Application layer protocols.

Text Books
1. Behrouz A Forouzan, "Data Communications and Networking", 5th Edition, McGraw Hill, 2013,
ISBN: 1-25-906475-3.
2. Andrew S Tanenbaum, Computer Networks, fifth edition, Pearson
Reference Books:
1. James F Kurose and Keith W Ross, Computer Networking, A Top-Down Approach, Sixth edition,
Pearson,2017.
2. Nader F Mir, Computer and Communication Networks, 2nd Edition, Pearson, 2014.

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks scaled down to 20 marks
Assignment Average of 2 Assignments for 10 marks each 10
Practical Weekly Assessment -10 Marks
10
IA Test-10 Marks
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
The question paper will have 10 full questions each of 20 50
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
An Autonomous Institute Under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: V
Course Name: Computer Graphics and Visualization Course Code: 21CSE154
L: T: P: J 3 :0:2 : 0 CIA Marks: 50
Credits: 4 SEA Marks: 50
Hours/Week (Total) 5 SEA Duration: 03 Hours
Pre-Requisites: Basic mathematics ,C programming and Computer aided design
Course Learning Objectives: The students will be able to
1 Overview of Computer Graphics along with its applications and OpenGL primitives and attributes
2 Illustrate different fill area attributes to animate the images
3 Exploring 2D and 3D graphics mathematics along with OpenGL API’s.
4 Demonstrate clipping and illumination models on both 2D and 3D objects.
5 Explore various projections, 3D viewing and visibility detection methods
No. of Blooms
Hours Cognitive
Module-1: Introduction Levels with
CO mapping
Overview: Basics of computer graphics, Application of Computer Graphics,
Random Scan and Raster Scan displays, graphics software. OpenGL: Introduction
to OpenGL, coordinate reference frames, OpenGL point functions, OpenGL line
functions, point attributes, line attributes, OpenGL point attribute functions,
OpenGL line attribute functions, Line drawing algorithms(DDA, Bresenham‟s.
Color and gray scale, OpenGL Color Functions.
Laboratory Component: 5+5 Apply
1. Design a line using DDA line drawing algorithm CO1
2. Implement Bresenham‟s line drawing algorithm for all types of slope.
3. Design a real world picture using primitives such as points, lines, triangles and
polygons.
4. Design, develop and implement recursively subdivide a tetrahedron to form 3D
sierpinski gasket. The number of recursive steps is to be specified by the user
Module-2:
2D and 3D viewing pipeline, OpenGL 2D viewing functions. Fill area Primitives:
Polygon fill-areas, OpenGL polygon fill area functions, fill area attributes, general
scan line polygon fill algorithm, OpenGL fill-area attribute functions. Color and
gray scale, OpenGL Color Functions. circle generation algorithms (Bresenham‟s).
Input and Interaction: OpenGL interactive input device functions, Menus Picking,
Animating Interactive programs. 5+5 Apply
Laboratory Component: CO2
1. Implement a circle drawing algorithm.
2. Develop a menu driven program to fill the polygon using scan line algorithm
3. Implement the program to draw a polygon that interact with interact with input
functions.
Module-3:
2D and 3D Geometric Transformations: 2DGeometric Transformations: Basic 2D
Geometric Transformations, matrix representations and homogeneous coordinates.
Inverse transformations, 2D Composite transformations, other 2D transformations,
OpenGL geometric transformations function. 3D Geometric Transformations:
Translation, rotation, scaling, composite 3D transformations, other 3D Apply
transformations, OpenGL geometric transformations functions.
5+5
CO3
Laboratory Component:
1. Create and rotate a triangle about the origin and a fixed point.
2. Draw a colour cube and spin it using OpenGL transformation matrices.
3. Develop a program to show different transformations.
Module-4:
Clipping and Illumination Models: Clipping: clipping window, normalization and
viewport transformations, clipping algorithms,2D point clipping, 2D line clipping
algorithms: cohen-sutherland line clipping only -polygon fill area clipping:
Sutherland-Hodgeman polygon clipping algorithm only. Illumination Models:
Light sources, basic illumination models-Ambient light, diffuse reflection, specular
and phong model, Corresponding openGL functions. OpenGL Quadric Surfaces.
5+5 Apply
Laboratory Component:
CO4
1. Clip a lines using Cohen-Sutherland algorithm.
2. To draw a simple shaded scene consisting of a tea pot on a table. Define suitably
the position and properties of the light source along with the properties of the
surfaces of the solid object used in the scene
3. Develop a program to show the different quadric surfaces.
Module-5:
3D Viewing and Visible Surface Detection: 3DViewing:3D viewing concepts, 3D
viewing coordinate parameters, Projection transformation, orthogonal projections,
perspective projections, The viewport transformation and 3D screen coordinates.
OpenGL 3D viewing functions. Visible Surface Detection Methods: Classification
of visible surface Detection algorithms, depth buffer method only and OpenGL Apply
6+4
visibility detection functions.
CO5
Laboratory Component:
1. Draw a color cube and allow the user to move the camera suitably to experiment
with perspective viewing

Course Outcomes: After completing the course, the students will be able to
21CSE154.1 Apply Computer Graphics along with its applications and OpenGL primitives and
attributes
21CSE154.2 Apply different fill area attributes to animate the images
21CSE154.3 Apply 2D and 3D graphics mathematics along with OpenGL API’s.
21CSE154.4 Apply clipping and illumination models on both 2D and 3D objects.
21CSE154.5 Apply various projections, 3D viewing and visibility detection methods

Text Books
1. Donald Hearn & Pauline Baker: Computer Graphics with OpenGL Version,3rd / 4th Edition, Pearson
Education,2011
2. Edward Angel: Interactive Computer Graphics- A Top Down approach with OpenGL, 5th edition. Pearson
Education, 2008
Reference Books
1. James D Foley, Andries Van Dam, Steven K Feiner, John F Huges Computer graphics with OpenGL:
pearson education
2. Xiang, Plastock : Computer Graphics , sham‟s outline series, 2nd edition, TMG.
3. Kelvin Sung, Peter Shirley, steven Baer : Interactive Computer Graphics, concepts and applications,
Cengage Learning
4. M M Raikar & Shreedhara K S Computer Graphics using OpenGL, Cengage publication

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 2
 Each test will be conducted for 50 marks out of which 15
30
marks for theory and 35 marks for lab test.
 Average of 2 tests reduced to 30 Marks
 AAT Presentation / Demonstration of mini project and weekly
20
assessment.
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam External lab exam will be conducted for 100 marks and scaled
down to 50 Marks
The question paper will have two parts. Part A is for 30 marks 50
theory. Part-B lab test of 70 marks(Write
up+Execution+Viva=15+45+10).
Total marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: V
Course Name: Web Technology and its Applications Course Code: 21CSE155
L: T: P: J 0: 0: 2: 2 CIA Marks: 50
Credits: 2 SEA Marks: 50
Hours/Week (Total) 4 hrs/ week (30) SEA Duration: 03 Hours
Pre-Requisites: Fundamentals of Programming and Networking
Course Learning Objectives: The students will be able to
1 To explain web application development procedures
2 To impart servlet technology for writing business logic
3 To teach students the basics of server-side scripting using PHP
4 To facilitate students to connect to databases using JDBC
No. of BLL with CO
Module-1:
Hours mapping
Introduction to HTML: The development process, Html tags and
simple HTML forms, web site structure Introduction to XHTML: XML, CO1
6
Move to XHTML, Meta tags, Character entities, frames and frame sets. Understand

Module-2:
Style sheets: Need for CSS, introduction to CSS, basic syntax and
structure, using CSS, background images, colors and properties, CO2
6
manipulating texts, using fonts, borders and boxes, margins, padding Understand
lists, positioning using CSS, CSS2.
Module-3:
JavaScript: Client-side scripting, what is JavaScript, how to develop
JavaScript, simple JavaScript, variables, functions, conditions, loops and
CO3
repetition 6
Apply
DHTML: Combining HTML, CSS and JavaScript, events and buttons,
controlling your browser
Module-4:
XML: Introduction to XML, uses of XML, simple XML, XML key
components, DTD and Schemas, Well formed, using XML with CO4
application.XML, XSL and XSLT. Introduction to XSL, XML 6
Apply
transformed simple example, XSL elements.
Module-5:
PHP: Introduction and basic syntax of PHP, decision and looping with
examples, PHP and HTML, Arrays, Functions, Browser control and
detection, string, Form processing, Files, Advance Features: Cookies and
Sessions.
CO5
6
Create
Databases: Basic command with PHP examples, Connection to server,
creating database, selecting a database, listing database, listing table
names creating a table, inserting data, altering tables, queries, deleting
database, deleting data and tables.
 Handson Practice sets
Practical Set -1 HTML
 Design web pages for your college containing a description of the courses, departments,
faculties, library etc, use href, list tags.
 Create your class timetable using table tag.
 Create user Student feedback form
(Use textbox, text area, checkbox, radio button, select box etc.)
 Create your resume using HTML tags also experiment with colors, text, link, size and also other
tags you studied.
 At the bottom create a link to take user to the top of the page
Practical Set -2 CSS
 Design a web page of your home town with an attractive background color, text
color, an Image, font etc. (use internal CSS).
 Use Inline CSS to format your resume that you created.
 Use External CSS to format your class timetable as you created.
 Use External, Internal, and Inline CSS to format college web page that you created.
Practical Set -3 JavaScript
 Develop a JavaScript to display today’s date.
 Develop simple calculator for addition, subtraction, multiplication and division
operation using JavaScript
 Create HTML Page with JavaScript which takes Integer number as input and
tells whether the number is ODD or EVEN.
 Create HTML Page that contains form with fields Name, Email, Mobile No, Gender, Favorite Color
and a button now write a JavaScript code to combine and display the information in textbox when the
button is clicked.
 Implement Validation in above Feedback Form.
 Use regular expression for validation in Feedback Form.
 Write a JavaScript program to change background color after 5 seconds of page load.
Practical Set -4 XML
 Create XML file to store student information like Enrollment Number, Name, Mobile Number, Email
Id.
Practical Set -5 PHP
 Write a php program to display today’s date in dd-mm-yyyy format.
 Write a php program to check if number is prime or not.
 Create HTML page that contain textbox, submit / reset button. Write php program to
display this information and also store into text file.
 Write a PHP Script for login authentication. Design an html form which takes
username and password from user and validate against stored username and password in file.
 Write PHP Script for storing and retrieving user information from MySql table.
1. Design A HTML page which takes Name, Address, Email and MobileNo. From user
(register.php )
2. Store this data in Mysql database / text file.
3. Next page display all user in html table using PHP ( display.php )
 Write a PHP script for user authentication using PHP-MYSQL. Use session for storing username.
Mini Project: Website
Students have to create a website which contains above topics in Website.
Course Outcomes: After completing the course, the students will be able to
21CSE155 .1 Understand the HTML tags and use them to develop the user-friendly web pages.
Understand the CSS with its types and use them to provide the styles to the web pages at
21CSE155 .2
various levels
21CSE155 .3 Develop the dynamic web pages by using the JavaScript
Build the web pages dynamically using the database connectivity and applying server-side
21CSE155 .4
scripting with XML and PHP
Create the modern Web applications using the client and server-side technologies and the web
21CSE155 .5
design fundamentals.

Reference Books
 Developing Web Applications, Ralph Moseley and M. T. Savaliya, Wiley-India
 Web Technologies, Black Book, dreamtech Press
 HTML 5, Black Book, dreamtech Press
 Developing Web Applications in PHP and AJAX, Harwani, McGrawHil

Marks Distribution for Assessment:

CIA
Component Description Marks
(50)
Written Test Total Number of Test: 2
Each Theory test will be conducted for 30 marks 30
Average of 2 tests = 30 Marks
Weekly Assessment (Record / Project) 10
Practical Lab IA Test 10
Total Marks 50
SEA
Component Description Marks
(50)
Project Write up – 10 marks
100 marks
Project Report – 25 marks
reduced to
Presentation and demonstration – 50 marks
50 marks
Viva – voce – 15 marks
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institution under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 5
Course Name: Data Structures and its Applications
Course Code: 21CSE1561
L: T: P: J 2:0:2:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 hrs/ week (40) SEA Duration: 03 Hours
Pre-Requisites: Basic Concepts of C

Course Learning Objectives: The students will be able to

1 Understand the basics of C programming language to study data structures
2 Acquire knowledge on Various types of data structures, operations and algorithms ,Sorting and
searching operations
3 Analyze the performance of Stack, Queue, Lists, Trees, Hashing, Searching and Sorting
techniques
4 Implement all the applications of Data structures in a high-level language
5 Design and apply appropriate data structures for solving computing problems.

No. of Blooms
Hours Cognitive
Levels with
CO mapping
Module-1: Introduction
Functions: Categories of functions, call by Value, call by reference.
Arrays: Passing arrays to functions, passing strings to functions
Pointers: Pointer as function arguments, Functions returning pointers,
Structures: Declaring and using structure types. Searching and Sorting: Apply
5 hours
Bubble sort, Insertion Sort, Selection sort, Quick sort, Linear Search and
(Theory) CO1
Binary search
Lab Session: 3 hours CO2
1. Implement call by value and Call by reference (Practical) CO3
2. Programs on passing arrays to a function
3. Programs on function with pointers as an argument
4. Searching and sorting Programs.
Module-2: Classification of Data Structures
Primitive and Non- Primitive, Linear and Nonlinear; Data structure
Operations, ADT, Array as ADT, Operations - Insert, Delete, Search,
Sort, String Definition, Representation, String as ADT, Operations – 5 hours
Insert, Delete, Concatenate, Comparing, Substring. Conversion (Theory) Apply
Recursion - Factorial, GCD, Fibonacci Sequence, Tower of Hanoi 3 hours CO2
Lab Session: (Practical)
1. Array Operations
2. Programs on Recursion
Module-3: Stacks and queues
Stack: Definition, Representation, Stack as ADT, Operations and
Applications: Polish and reverse polish expressions, Infix to postfix
conversion, evaluation of postfix expression, infix to prefix, postfix to 5 hours Apply
infix Queue: Definition, Representation, Queue as ADT, Operations,
(Theory) CO3
Queue Variants: Circular Queue, Priority Queue, Double Ended Queue;
Applications of Queues. 3 hours CO4
Lab session: (Practical) CO5
1. Implementation of stack and Queue data structure
2. Application level program on stack and Queue DS
Module-4: Linked List
Linked List: Limitations of array implementation, Memory
Management: Static (Stack) and Dynamic (Heap) Memory Allocation,
Memory management functions. Definition, Representation, Operations: Apply
5 hours
getnode() and Freenode() operations Types of linked lists: Singly
(Theory) CO3
Linked List,Doubly Linked Lists,Circular Linked List: Application of
Linked Lists: Stacks, Queues, Double-ended Queues, Priority Queues, 3 hours CO4
Lab session: (Practical) CO5
1. Implementation of Linked Lists
2. Application level programs on LL
Module 5: Trees and Hashing
Trees: Definitions, Terminologies, Array and linked Representation of
Binary Trees, Types- Complete/full, Almost Complete, Strictly, Skewed.
Traversal methods - Inorder, postorder, preorder. Binary Search Trees - 5 hours Apply
Creation, Insertion, Deletion, Traversal, Binary Search and BST.
(Theory) CO3
Hashing: The Hash Table organizations, Hashing Functions, Static and
Dynamic Hashing, Collision-Resolution Techniques, Programming 3 hours CO4
Examples. (Practical) CO5
Lab Session:
1. Implementation of BST and all traversing techniques

Course Outcomes: After completing the course, the students will be able to

21CSE1561.1 Understand the basics of C programming language

Acquire knowledge on Various types of data structures, operations and algorithms ,Sorting
21CSE1561.2
and searching operations
Analyze the performance of Stack, Queue, Lists, Trees, Hashing, Searching and Sorting
21CSE1561.3
techniques

21CSE1561.4 Implement the applications of Data structures in a high-level language

21CSE1561.5 Design and apply appropriate data structures for solving computing problems.

Text Books
1. Gilberg and Forouzan, Data Structures: A Pseudo-code approach with C, 2nd Ed, Cengage
Learning,2014.
2. Reema Thareja, Data Structures using C, 3rd Ed, Oxford press, 2012
Reference Books
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed, Universities Press,
2014.
2. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014.
3. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with Applications,2nd
Ed, McGraw Hill, 2013
4.A M Tenenbaum, Data Structures using C, PHI, 1989
5.Robert Kruse, Data Structures and Program Design in C, 2nd Ed, PHI, 1996.
Marks distribution for assessment

CIA Component Description Marks

(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Module wise Lab activity 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: V
Course Name: JAVA & It’s Applications Course Code: 21CSE1562
L: T: P: J 2:0:2:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 hrs/ week (40) SEA Duration: 03 Hours
Course Learning Objectives: The students will be able to
1 Show competence in the use of the Java programming language in the development of small to
medium-sized application programs that demonstrate professionally acceptable coding and
performance standard
2 Learn the fundamental features of object-oriented language in JAVA.
3 Set up Java JDK environment to create, debug and run java programs.
4 Learn object-oriented concepts using programming examples.
5 Read and write data from/to files in JAVA.
6 Create multi-threaded programs and event handling mechanism.
7 Learn string handling & collections using programming examples

No. of Blooms
Hours Cognitive
Module-1: Introduction to Java Levels with
CO
mapping
Introduction to Java: Features of OOP, Characteristics/Buzz words of Java, 5
Java Environment: JDK, JVM, JRE, Fundamental Programming Structure
in Java, Variables, Data Types, Operators & Expressions, Control
Statements, Iteration Statements, Command Line Arguments.

Sample Programs: 3
1. Develop a program to print an int, a double and a char on screen. Understand
2. Develop a program to print the area of a rectangle of sides 2 and 3 CO 1
units respectively.
3. Develop a program to add 3 to the ASCII value of the character 'd'
and print the equivalent character.
4. Develop a program to add 8 to the number 2345 and then divide it
by 3. Now, the modulus of the quotient is taken with 5 and then
multiply the resultant value by 5. Display the result.
Module-2: Classes & Objects
Classes & Objects: Defining Classes & Objects, Access Specifies, 5
Constructors, Overloading Constructor, Method Overloading, Passing and
Returning object form Method, new operator, finalize() method, this
keyword, Static Keyword, Encapsulation, Polymorphism.

Array and String: Single and Multidimensional Array, Definition of String,

Apply
String Literals, String Class, String Inbuilt Methods, StringBuffer &
CO 2
StringBuilder Class, Use of Wrapper class.

Sample Programs: 3
1. Develop a program to print the area of a rectangle by creating a
class named 'Area' having two methods. First method named as
'setDim' takes length and breadth of rectangle as parameters and the
 second method named as 'getArea' returns the area of the rectangle.
Length and breadth of rectangle are entered through keyboard.
2. Develop a program to check if elements of an array are same or not
it read from front or back.
3. Input a string which contains some palindrome substrings. Find out
the position of palindrome substrings if exist and replace it by *.
(For example if input string is “bob has a radar plane” then it should
convert in “*** has a ***** plane.
4. Write a program to reverse individual words in a string, where each
word may be delimited by a dot, comma, space or tab, like
www.google.com should become www.elgoog.moc.
Module-3: Inheritance, Interfaces & Packages.
Inheritance: Defining a Inheritance, Types of Inheritance, Constructor in 5
subclass, Method Overriding, super keyword, abstract keyword, final
keyword.

Interfaces & Packages: Defining a Interface, Implementing a Interface,

Difference between Interface & Classes, Extending a Interface, Usage of
Package, Classpath, Importing a Package.

Sample Programs: 3
1. Create a class with a method that prints "This is parent class" and
its subclass with another method that prints "This is child class".
Now, create an object for each of the class and call
1 - method of parent class by object of parent class.
2 - method of child class by object of child class.
3 - method of parent class by object of child class.
2. Create a class named 'Member' having the following members:
Data members
1 - Name
2 - Age
3 - Phone number
4 - Address Apply
5 - Salary CO 3
It also has a method named 'printSalary' which prints the salary of
the members. Two classes 'Employee' and 'Manager' inherits the
'Member' class. The 'Employee' and 'Manager' classes have data
members 'specialization' and 'department' respectively. Now,
assign name, age, phone number, address and salary to an employee
and a manager by making an object of both of these classes and
print the same.
3. Develop a program to define two interfaces “student" and "faculty"
containing one method each ("Listen" and "Teach").both of these
interfaces should be implemented by a class called "College".
Demonstrate the above implementation by writing a main method
in a new class called "DemoMultiInterface”.
4. Create a package named "BNMIT". Under this create two packages
named "Employee" and "Student". Under the employee package
create a class called "EmployeeDetails" having required member
fields and methods. Under the Student package create a class called
"StudentDetails" having required member fields and methods.
Demonstrate the above by creating objects of StudentDetails and
EmployeeDetails inside another class which resides in another
package.Hint: You can assume the relevant fields and methods to
 be written inside the Employee Details and Student Details class.
Module-4: Multithreading & IO Programming
Multithreading: Multi Threaded Programming: What are threads? How to 5
make the classes threadable ; Extending threads; Implementing runnable;
Synchronization.

IO Programming: Introduction to Stream, Byte Stream, Character stream,

Readers and Writers, File Class, File InputStream, File Output Stream,
InputStreamReader. Apply
3 CO 4
Sample Programs:
1. Develop a program to create two threads, one thread should print
only even numbers and another thread should print only prime
numbers upto a given number.
2. Develop a program to write and read the contents from a file, and
count the vowels in a file.
Module-5: Exceptions, Collections
Exceptions: Definition of Exception, Classification of Exception, Structure 5
of Try & catch block, Error Vs Exception, Throw Keyword, Throws
Keyword, Finally Keyword, Custom Exception.

Collections: Collections Overview, Iterators, Collection Interfaces: List:

ArrayList, Linked List & Vector, Set: Hashset, Linked Hashset , Map:
Hashmap, Linked Hashmap, & Hash table. Comparator & Comparable
Interface.

Sample Programs: 3
1. Develop an application for Bank with instance variables acno, name,
and balance. Instance methods deposit (amt), withdraw (amt). If
balance is less than 500 then throw user defined exception Apply
“insufficient balance”. (hint: exception Handling). CO 5
2. Create a class Student with attributes roll no, name, age and course.
Initialize values through parameterized constructor. If age of student
is not in between 15 and 21 then generate user-defined exception
“Age Not Within Range Exception”. If name contains numbers or
special symbols raise exception “NameNotValidException”. Define
the two exception classes.
3. Srusti went for shopping and purchased many items. Each item is in
the range Rs.500 to 2000. After purchasing the items from the shop,
she started listing the items in some order. Design a java application
program to perform this task. (Hint: ArrayList).
4. Shyam has to submit an assignment on SET interface, the
assignment is to perform union ,intersection and difference
operation on SET , help Shyam complete the assignment.

Course Outcomes: After completing the course, the students will be able to
21CSE1562.1 Understand the basic core concepts of JAVA.
21CSE1562.2 Apply object-oriented programming concepts and to develop applications
21CSE1562.3 Make use of inheritance, interface, and package to solve problems.
Apply multithreading and IO Programming concept to solve real time concurrent
21CSE1562.4
applications.
21CSE1562.5 Apply Exception and Collections to develop applications.
 Textbooks
1. The Complete Reference, Java 2 (Fourth Edition), Herbert Schild, - TMH.
2. Java Fundamentals A comprehensive introduction By Herbert Schildt, Dale Skrien, McGraw
Hill Education.
3. Programming with Java A Primer – E.Balaguruswamy, Mc Grawhill
Reference Books
1. Core Java Volume-I Fundamentals Horstmann & Cornell, - Pearson Education. - Eight
Edition
2. Head First Java: A Brain-Friendly Guide, 2nd Edition- Kathy Sierra, Bert Bates

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Dept. of Computer Science and Engineering
Semester : 6
Course Name: Mobile Application Development Course Code: 21CSE1563
L: T: P: J 2: 0:2 :0 CIA Marks: 50
Credits: 40 SEA Marks: 50
Hours/Week (Total) 4 hrs/ week (40) SEA Duration: 03 Hours
Pre-Requisites:
1. C programming Practice
2. Java programming Practice
3. Web development Practice
Course Learning Objectives: The students will be able to
1 Learn to setup Android application development environment
2 Illustrate user interfaces for interacting with apps and triggering actions
3 Interpret tasks used in handling multiple activities
4 Identify options to save persistent application data
5 Appraise the role of security and performance in Android applications

No. of Blooms
Hours cognitive
Module-1: Levels with
CO
mapping
Get started, Build your first app, Activities, Testing, debugging and using
support libraries
Textbook 1: Lesson 1,2,3

Lab Component:
Apply
Create an application to design a Visiting Card. The Visiting card should 5+3=8
CO 1
haves company logo at the top right corner. The company name should be
displayed in Capital letters, aligned to the center. Information like the name
of the employee, job title, phone number, address, email, fax and the website
address is to be displayed. Insert a horizontal line between the job title and
the phone number.
Module-2:

User Interaction, Delightful user experience, Testing your UI

Textbook 1: Lesson 4,5,6
Apply
Lab Component: 5+3=8
CO2
Develop an Android application using controls like Button, Text View, Edit
Text for designing a calculator having basic functionality like Addition,
Subtraction, Multiplication and Division.
Module-3:
Background Tasks, Triggering, scheduling and optimizing background tasks
Textbook 1: Lesson 7,8
Analyse
5+3=8
Lab Component: CO3
Develop an application to set an image as wallpaper. On click of a button, the
wallpaper image should start to change randomly every 30 seconds.
Module-4:
All about data, Preferences and Settings, Storing data using SQLite, Sharing
data with content providers, Loading data using Loaders
Textbook 1: Lesson 9,10,11,12
Lab Component: Analyse
5+3=8
Write a program to enter Medicine Name, Date and Time of the Day as input CO4
from the user and store it in the SQLite database. Input for Time of the Day
should be either Morning or Afternoon or Evening or Night. Trigger an alarm
based on the Date and Time of the Day and display the Medicine Name.
Module-5:
Permissions, Performance and Security, Firebase, Publish.
Textbook 1: Lesson 13,14,15
RBT: L1, L2
Lab Component : Analyse
5+3=8
Create two files of XML and JSON type with values for City Name, Latitude, CO5
Longitude, Temperature, and Humidity. Develop an application to create an
activity with two buttons to parse the XML and JSON files which when
clicked should display the data in their respective layouts side by side.

Course Outcomes: After completing the course, the students will be able to

21CSE1563.1 Apply the Android application concepts by setting up Android development environment
21CSE1563.2 Apply adaptive, responsive user interfaces that work across a wide range of devices.
21CSE1563.3 Apply long running tasks and background work in Android applications.
21CSE1563.4 Analyze the methods in storing, sharing and retrieving data in Android applications
21CSE1563.5 Analyze performance of android applications and understand the role of permissions and
security.

Text Books
1. Google Developer Training, "Android Developer Fundamentals Course Google Developer Training
Team, 2017.
Reference Books
1. Erik Hellman, “Android Programming – Pushing the Limits”, 1 st Edition, Wiley India Pvt Ltd, 2014.
Marks Distribution for Assessment:
CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: V
Course Name: Data Analytics Course Code: 21CSE1564
L:T:P:J 2: 0 :2 :0 CIA Marks:50
Credits: 3 SEA Marks:50
Hours/Week (Total) 4 SEA Duration:03Hours
Pre-Requisites: Basics of Mathematical and Statistical Methods, Object Oriented Programming,
familiarity and program writing skills in Java and knowledge of python libraries, Cloud platform for
storage and applications.
Course Learning Objectives: The students will be able to
1 To explain introductory concepts, a brief methodological description and some descriptive
statistics of data.
2 To explain multivariate descriptive statistics methods of data analytics, methods used in data
preparation phase of the CRISP-DM methodology, concerning data quality issues, converting
data to different scales or scale types and reducing data dimensionality.
3 To explain methods involving clustering, frequent pattern mining, which aims to capture the
most frequent patterns.
4 To explain cheat sheet and project on descriptive analytics and generalization, performance
measure for regression and the bias-variance trade-off.

No. of Blooms
Hours Cognitive
Module Levels with
CO
mapping
Module-1: Introduction
Introduction to Data, Big Data and Data Science , Big Data Architectures,
Small Data, What is Data? A Short Taxonomy of Data Analytics, Examples
of Data Use, A Project on Data Analytics.
Descriptive Statistics: Scale Type, Descriptive Univariate Analysis,
Descriptive Bivariate Analysis.
Practical Component: Data Collection and Cleaning
1. Data Collection Exercise: Provide students with a dataset (e.g.,
Understand
CSV file) from a real-world source, such as a government website 8
CO1
or a public data repository. Instruct students to collect additional
relevant data, clean the dataset (handle missing values, outliers),
and document the data collection process.
2. Data Exploration: Have students perform basic exploratory data
analysis (EDA) on the cleaned dataset. They should generate
summary statistics, visualizations (histograms, scatter plots), and
draw initial insights from the data.
Module-2: Multivariate Analysis, Data Quality and Preprocessing
Multivariate Analysis: Multivariate Frequencies, Multivariate Data
Visualization, Multivariate Statistics, Infographics and Word Clouds.
Data Quality and Preprocessing: Data Quality, Converting to a Different
Scale Type, Converting to a Different Scale, Data Transformation, Apply
8
Dimensionality Reduction. CO2
Practical Component: Data Analysis Techniques
Provide students with datasets containing multiple variables. Have them
perform multivariate analysis, including multivariate frequencies, data
visualization (scatter plots, heatmaps), and computation of relevant
multivariate statistics (e.g., covariance, correlation).
Module-3:Clustering and Frequent Pattern Mining
Clustering: Distance Measures, Clustering Validation, Clustering
Techniques.
Frequent Pattern Mining: Frequent Itemsets, Association Rules, Behind
Support and Confidence, Other Types of Pattern.
Practical Component: Clustering and Frequent Pattern Mining
1. Clustering Exercise: Provide datasets and guide students in
Apply
performing clustering analysis. They should calculate distance 8
CO3
measures, validate the clusters, and experiment with different
clustering techniques (e.g., K-means, hierarchical clustering).
2. Frequent Pattern Mining: Introduce students to frequent itemsets
and association rule mining. Provide datasets with transactional
data and have students identify frequent itemsets and derive
association rules with various support and confidence thresholds.
Module-4:Cheat Sheet and Project on Descriptive Analytics
Cheat Sheet and Project on Descriptive Analytics:
Cheat Sheet of Descriptive Analytics, Project on Descriptive Analytics.
Regression: Predictive Performance Estimation, Finding the Parameters
of the Model, Technique and Model Selection.
Practical Component: Descriptive Analytics Cheat Sheet and
Regression Project
1. Cheat Sheet Development: Instruct students to create a Apply
8
comprehensive cheat sheet summarizing key concepts and CO4
techniques in descriptive analytics. This can serve as a reference for
their ongoing work.
2. Regression Project: Assign students a regression analysis project.
They should estimate predictive performance, find model
parameters, and perform technique and model selection. Provide
datasets with both numerical and categorical predictors.
Module-5: Classification
Classification: Binary Classification, Predictive Performance Measures for
Classification, Distance-based Learning Algorithms, Probabilistic
Classification Algorithms.
Practical Component:
Analyze
Binary Classification Project: Assign students a binary classification 8
CO5
project where they have to predict a target variable. Provide datasets with
labeled examples, and have students apply distance-based learning
algorithms and probabilistic classification algorithms. Evaluate their models
using appropriate performance measures (accuracy, precision, recall, etc.).
Course Outcomes: After completing the course, the students will be able to

21CSE1564.1 Understand the fundamentals of descriptive analytics of data.

21CSE1564.2 Apply for multivariate analysis, data preparation and data transformation and reducing.

21CSE1564.3 Apply various clustering techniques for pattern mining.

21CSE1564.4 Apply predictive analytics and performance measures for model selection

21CSE1564.5 Analyze various algorithms for classification problems.

Text Books
1. A General Introduction to Data Analytics , Joao Mendes et al, Wiley, 2019

Reference Books
2. Raj Kamal and Preeti Saxena, Big Data Analytics Introduction to Hadoop, Spark, and
Machine-Learning, McGraw Hill Education, 2018 ISBN: 9789353164966, 9353164966
3. 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-13: 978-
9332570351
4. Tom White, “Hadoop: The Definitive Guide”, 4 th Edition, O‟Reilly Media, 2015.ISBN-13: 978-
9352130672
5. Arshdeep Bahga, Vijay Madisetti, "Big Data Analytics: A Hands-On Approach", 1st Edition, VPT
Publications, 2018. ISBN-13: 978-0996025577

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Open ended experiments 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institution under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: System Software and Compiler Design Course Code: 21CSE161
L: T: P: J 2:2:0:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites:

Course Learning Objectives: The students will be able to

1 Understand the various system softwares by learning their working techniques
2 Familiarize with source file, object file and executable file structures and libraries
3 Describe the front-end and back-end phases of compiler and their importance to students
4 Apply SDT and describe various IR techniques
5 Describe the various code optimization techniques employed by the compiler

No. of Blooms
Module-1 : System Software Hours Cognitive
Levels
Introduction to System Software, Machine Architecture of SIC and SIC/XE.
Assemblers: Basic assembler functions, machine dependent assembler 8 Apply
features, machine independent assembler features, Basic loader functions CO1

Module-2: Introduction & Lexical Analysis

Introduction:
Language Processors, The structure of a compiler, The evolution of
programming languages, The science of building compiler, Applications
Apply
of compiler technology, Programming language basics 8
CO2
Lexical Analysis:
The role of lexical analyzer, Input buffering, Specifications of token,
recognition of tokens
Module-3: Syntax Analysis
Introduction, Role Of Parsers, Context Free Grammars, Writing a
grammar, Derivation, Ambiguity, Left Recursion, Top Down Parsers, 8 Apply
Bottom-Up Parsers: Shift Reduce Parser, Simple LR and Canonical LR CO3

Module-4: Semantic Analysis

Syntax directed translation: Syntax directed definitions, Evaluation
orders for SDD, Applications of syntax directed translations
8 Analyze
Intermediate code Generation : Variants of syntax trees, three-address
CO4
code ,type declarations, type checking, IR for switch statements and
procedures
Module-5: Target code generation
Issues in the Design of a Code Generator, The target Language,
Addresses in the target code, Basic blocks and Flow graphs, Optimization 8 Apply
of basic blocks, A simple code generator. CO5
Course Outcomes: After completing the course, the students will be able to

Apply the concepts and algorithms for design system softwares like assemblers, linkers and
21CSE161.1
loaders.

21CSE161.2 Apply the concepts of lexical analysis for token recognition and token specification.

21CSE161.3 Apply the parsing techniques and grammar transformation techniques for Syntax analysis.
Analyze Syntax directed Translations, Intermediate Representation for generating target
21CSE161.4
code.
Apply algorithms that code generators utilize to translate the IR into a sequence of target
21CSE161.5
language instructions for simple register machines and generate optimal codes

Text Books
1. System Software by Leland. L. Beck, D Manjula, 3rd edition, 2012
2. Compilers-Principles, Techniques and Tools by Alfred V Aho, Monica S. Lam, Ravi Sethi,
Jeffrey D. Ullman. Pearson, 2nd edition, 2007

Reference Books
1. Systems programming – Srimanta Pal , Oxford university press, 2016
2. System programming and Compiler Design, K C Louden, Cengage Learning
3. System software and operating system by D. M. Dhamdhere TMG
4. Compiler Design, K Muneeswaran, Oxford University Press 2013.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test ⚫ Total Number of Test: 3
⚫ Each Theory test will be conducted for 30 marks 30
⚫ Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Artificial Intelligence and Machine learning
Course Code: 21CSE162
L:T:P:J 3:0:2:0 CIA Marks:50
Credits: 4 SEA Marks:50
Hours/Week (Total) 5 SEA Duration:03Hours
Pre-Requisites: Linear Algebra, Probability and Statistics, Data Mining, and Python
Programming
Course Learning Objectives: The students will be able to
1 Understand the types of classifications and dimensionality reduction techniques.
2 To become acquainted with regression, classification, and error functions.
3 To become acquainted with the concepts of ensemble, clustering and reinforcement learning.
4 Show scholarly expertise in the application of and analysis of machine learning algorithms to address
various learning challenges.

No. of Blooms
Hours Cognitive
Module-1: Levels with
CO mapping
Introduction to Learning, Machine learning- Types- Classification-
Regression- Multi-class classification. Dimensionality reduction –Linear 6
and Logistic Regression, Principal Component Analysis. Apply
Laboratory Component: CO 1
1. Apply multi class classification on suitable dataset. 4
2. Apply PCA on suitable dataset.
Module-2:
Singular Value Decomposition and Linear Discriminant Analysis. Naive
Bayes, Parameter Estimation, Sequential Pattern Classification. Neural
6
Network Basics: Perceptron, Error Functions.
Analyse
Laboratory Component:
CO 2
1. Analyze the working of Naive Bayes using suitable dataset.
4
2. Analyze the working of perceptron and error functions using
suitable datasets.
Module-3:
Optimization – Gradient Descent, Multilayer Perceptron, Nonlinearities,
Learning, Backpropagation, Function Approximations, Overfitting,
6
Underfitting. Support Vector Machines (SVM), Kernel methods – Bias-
Apply
Variance tradeoff.
CO 3
Laboratory Component:
4
1. Construct multilayer perceptron.
2. Construct backpropagation.
Module-4:
Regularization and Model/Feature Selection. Ensemble Methods:
Boosting, Bagging, Random Forests. Unsupervised learning – K-Means
6
clustering, K-medoids, Hierarchical. EM Algorithm, Reinforcement-
Apply
Elements of Reinforcement Learning.
CO 4
Laboratory Component:
4
1. Apply random Forest algorithm on suitable datasets.
2. Apply reinforcement algorithm on suitable datasets.
Module-5:
Applications of ML on IoT. IoT Data Acquisition System. How to prepare 6
data for machine learning algorithms. Exploratory Data Analysis (EDA) Apply
for IoT data. Anomaly detection on IoT data. Working principle & Use of CO 5
Geographical Information System (GIS), GPS module for vehicle speed 4
 measurement and real-time tracking. Analysis of IoT- enabled wearable
devices data, smart cities data, and smart agriculture data.
Laboratory Component:
1. Apply machine learning techniques on datasets collected using
IoT devices.
Note*: 1. For Laboratory component, use any platforms such as MATLAB or ANACONDA
2 Sample laboratory components is specified in each model.

Course Outcomes: After completing the course, the students will be able to
21CSE162.1 Apply the fundamentals of machine learning techniques using suitable datasets.

21CSE162.2 Analyze the strength and weakness of different machine learning models to solve
real world problems.
21CSE162.3 Apply supervised learning models on real world applications.
21CSE162.4 Apply unsupervised learning models on real world applications.
21CSE162.5 Apply machine learning techniques to solve IoT based real world applications.

TextBooks
1. Understanding Machine Learning, Shai Shalev-Shwartz and Shai Ben-David. Cambridge
University Press, 2017.
2. Tom M. Mitchell, -Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
3. Ethem Alpaydin, “Introduction to machine learning”, second edition, PHI publication, 2010
Reference Books
1. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make Sense of
Data, First Edition, Cambridge University Press, 2012.
2. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective, Second Edition,
Chapman and Hall/CRC Machine Learning and Pattern Recognition Series, 2014.
3. John L. Semmlow, Benjamin Griffel, Biosignal and Medical Image Processing, 3rd Ed, CRC
Press, 2014.
4. Pattern recognition and machine learning by Christopher Bishop, Springer Verlag, 2006
5. Stephen Marsland, - Machine Learning: An Algorithmic Perspective, Second Edition, 2014.

Marks Marks Distribution for Assessment:

CIA (50) Component Description Marks
Written  Total Number of Test: 2
Test  Each test will be conducted for 50 marks. 30
 Average of 2 tests = 30 Marks
 Conduction of experiments, Record writing, viva
Practical in each lab 20 marks 20
 Average of conduction, record, viva = 20 Marks
Total Marks 50
SEA (50) Component Description Marks
Written The theory exam will be conducted for 100 marks
Exam and scaled down to 50 Marks.
50
The question paper will have 10 full questions each
of 20 marks. Students must answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS) and Outcome Based Education (OBE)
Semester: 6
Course Name: Cryptography and Cyber Security Course Code: 21CSE163
L: T: P: J 3: 0: 2: 0 CIA Marks: 50
Credits: 4 SEA Marks: 50
Hours/Week (Total) 5hrs/week SEA Duration: 03 Hours
Pre-Requisites: Nil
Course Learning Objectives: The students will be able to
1 Enable to learn the fundamental concepts of cryptography, and steganography and make use of
these techniques in computing systems.
2 Choose between symmetric and asymmetric encryption techniques depending on the application.
3 Summarize the policies and laws in cyber security.
4 Analyze the security issues and risks in Computer Networks.
5 Analyze the security issues and risks in software and web.

No. Blooms
of Cognitive
Module-1:
Hours Levels with
CO mapping
Classical Ciphers: Introduction to cryptography, cryptanalysis, and
cryptology, Overview of cryptography, Basic Cryptographic primitives,
Classical ciphers: substitution cipher – Caesar, Playfair and Hill cipher, 6
Transposition cipher – Rail fence, Columnar and Double columnar, One- Apply
time-pad encryption, Limitations of One-Time-Pad, Steganography. CO1
Laboratory Component: 4
1. Make use of Steganographic tools to hide text in an image.
2. Make use of Steganographic tools to hide an image in an image.
Module-2:
Modern Cryptography: Modern cryptography: Perfectly secret encryption,
Symmetric Key Ciphers: AES, Asymmetric Key Ciphers-Key distribution
and Key Management, Diffie Hellman Protocol, RSA Encryption, Digital
Signature, Cryptanalysis 6
Laboratory Component: Apply
1. Installing openssl package CO2
2. Execute openssl commands for AES encryption and decryption 4
with image and text as input.
3. Write a simple program to find a key from a wordlist, given a
plaintext, an IV, and the corresponding ciphertext.
Module-3:
What is cyber security? Need for cyber security, data privacy, Risk Management,
Digital Forensics- Incident response, Security operations. The legal perspectives:
6
Cyber-crime and legal landscape around the world, Why do we need cyber
Understand
laws: The Indian context
CO3
Laboratory Component:
4
1. Installation of Wire shark, tcpdump
2. Capturing and analyzing packets
Module-4:
Network Security: Wired Security Issues: Firewalls, Intrusion Detection,
Intrusion Prevention Systems, Honeypots, DoS and DDOS attack, Analyze
Wireless Security issues- Android and iOS Security, App Security, Secure 6 CO4
Boot, Data Exfiltration, Wireless Protected Access (WPA), IEEE 802.1x,
802.11i/ WPA2, Wireless Network Threats, Cloud and IoT Application
Security
Laboratory Component: 4
1. Use of scapy tool for DOS attack
2. Nmap and nc commands
Module-5:
Software and Web Security: Operating system security: Attack Surfaces of
Set-UID Programs, Principle of Least Privilege; Environment variables 6
attack surface, Control Hijacking– Buffer overflow and Countermeasures,
Web security: Cross-Site Request Forgery, Cross-Site Scripting, SQL
Analyze
Injection, Threat Modelling- design, Types of Security testing: Fuzz
CO5
testing, Vulnerability scanning, Penetration Testing; Static and Dynamic
analysis.
Laboratory Component: 4
1. SQL injection attack

Course Outcomes: After completing the course, the students will be able to
21CSE163.1 Make use of steganography to hide data.
Choose appropriate private or public key encryption techniques depending on the
21CSE163.2
application.
21CSE163.3 Summarize the policies and laws in cyber security.
21CSE163.4 Analyze the security issues and risks in Computer Networks.
21CSE163.5 Analyze the security issues and risks in software

Textbooks
1. “Introduction to Modern Cryptography”, Jonathan Katz, Yehuda Lindell, 2nd Edition, CRC Press,
2015.
2. Wenliang Du,Computer Security A Hands-on Approach,2017
Reference Books
1. “Cryptography and Network Security” Behrouz A.Foruzan, 3rd Edition, Tata McGraw Hill, 2017
2. William Stallings, Lawrie Brown, “Computer Security: Principles and Practice”, Indian
Edition,Pearson, 2010.
3. Jonathan Rosenoer,“Cyber Law: The law of the Internet”, Springer-Verlag, 1997.
4. Mark F Grady, Fransesco Parisi, “The Law and Economics of Cyber Security”, Cambridge University
Press, 2006.
Marks Distribution for Assessment:
CIA Component Description Marks
(50)
Written Test  Total Number of Test: 2
 Each Theory test will be conducted for 30 marks. 30
 Average of 2 tests = 30 Marks
 Conduction of experiments, Record writing, viva in each
Practical lab 20 marks 20
 Average of conduction, record, viva = 20 Marks
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam The theory exam will be conducted for 100 marks and scaled
down to 50 Marks.
50
The question paper will have 10 full questions each of 20
marks. Students must answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Data Science Course Code: 21CSE164
L: T: P: J 0: 0: 2: 2 CIA Marks: 50
Credits: 2 SEA Marks: 50
Hours/Week (Total) 4 hrs/ week SEA Duration: 03 Hours
Pre-Requisites:
Course Learning Objectives: The students will be able to
1 Understand data science concepts and Big Data, modelling using R language
2 Analyze Basic tools of EDA, Data science process with case studies and Different algorithms.
3 Optimize & solve real life problems with different spam filter.
4 Explore Feature Generation and Feature Selection
No. of Blooms cognitive
Module-1: Hours Levels with CO
mapping
Introduction: What is Data Science? Big Data and Data Science hype – and
getting past the hype, Why now? – Datafication, Current landscape of
perspectives, A data Science Profile, Skill sets. Statistical Inference, Understand
6
CO1
Populations and samples, Big Data, new kinds of data, modelling, statistical
modeling probability distributions, fitting a model, - Introduction to R
Module-2:
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: Real Direct (online real estate firm). Algorithms, machine Apply
6
CO2
Learning Algorithms, Three Basic Algorithms: Linear Regression, k-Nearest
Neighbours (kNN), k-means, R Programs for the algorithms
Module-3:
Spam Filter, Linear Regression and Spam Filter, K-NN and spam Filter,, Naïve
Bayes Algorithm, Spam Filter using Naïve Bayes, Laplace Smoothing,, Apply
6
Comparing Naïve Bayes to K-NN, Scraping the Web, introduction to Logical CO3
Regression and M6D case study
Module-4:
Feature Generation and Feature Selection (Extracting Meaning from Data):
Motivating application: user (customer) retention. Feature Generation
(brainstorming, role of domain expertise, and place for imagination), Feature
Selection algorithms. Filters; Wrappers; Decision Trees; Random Forests. Analyze
Recommendation Systems: Building a User-Facing Data Product, Algorithmic
6
CO4
ingredients of a Recommendation Engine, Dimensionality Reduction, Singular
Value Decomposition, Principal Component Analysis, Exercise: build your
own recommendation system
Module-5:
Data Engineering, Map reduce, Word Frequency Problem,, Map Reduce
Solution, Other Examples of Map Reduce, Pregel-An Introduction. Data
Visualization: Basic principles, ideas and tools for data visualization. Mining Create
6
CO5
Social Network Graphs: Social networks as graphs, Clustering of graphs, Direct
discovery of communities in graphs, Partitioning of graphs
 Handson Practice sets
Practical Set
 Data Sets IRIS Data Set It is required that the student be conversant with R Programming Language or
Python Programming language and use them in implementing Data Science and Algorithms. Iris is a
particularly famous toy dataset (i.e. a dataset with a small number of rows and columns, mostly used for
initial small-scale tests and proofs of concept). This specific dataset contains information about the Iris, a
genus that includes 260-300 species of plants. The Iris dataset contains measurements for 150 Iris flowers,
each belonging to one of three species: Virginica, Versicolor and Setose. (50 flowers for each of the three
species). Each of the 150 flowers contained in the Iris dataset is represented by 5 values: Sepal length, in
cm Sepal width, in cm petal length, in cm petal width, in cm Iris species, one of: iris-setose, iris-
versicolor, iris-virginica. Each row of the dataset represents a distinct flower (as such, the dataset will have
150 rows). Each row then contains 5 values (4 measurements and a species label). The dataset is described in
more detail on the UCI Machine Learning Repository website. The dataset can either be downloaded directly
from there (iris.data file), or from a terminal, using the wget tool. The following command downloads the
dataset from the original URL and stores it in a file named iris.csv. $ wget
"https://archive.ics.uci.edu/ml/machine-learning-databases/iris/iris.data" -O iris.csv MNIST Data Set

The MNIST dataset is another particularly famous dataset as CSV file. It contains several thousands of
handwritten digits (0 to 9). Each hand-written digit is contained in a 28 × 28 8-bit grayscale image. This
means that each digit has 784 (282) pixels, and each pixel has a value that ranges from 0 (black) to 255
(white). The dataset can be downloaded from the following
URL:https://raw.githubusercontent.com/dbdmg/data-science-lab/master/datasets/mnist_test.csv. Each row of
the MNIST datasets represents a digit. For the sake of simplicity, this dataset contains only a small fraction
(10,000 digits out of 70,000) of the real MNIST dataset, which is known as the MNIST test set. For each
digit, 785 values are available.
1 Load the Iris dataset as a list of lists (each of the 150 lists should have 5 elements). Compute and print the
mean and the standard deviation for each of the 4 measurement columns (i.e. sepal length and width, petal
length and width). Compute and print the mean and the standard deviation for each of the 4 measurement
columns, separately for each of the three Iris species (Versicolor, Virginica and Setose). Which measurement
would you consider “best”, if you were to guess the Iris species based only on those four values? .
2 Load the MNIST dataset. Create a function that, given a position 1 ≤ k ≤ 10, 000, prints the kthdigit of the
dataset (i.e. thekthrow of the csv file) as a grid of 28 × 28 characters. More specifically, you should map each
range of pixel values to the following characters:
[0, 64) → " "
[64, 128) → "."
[128, 192) → "*"
[192, 256) → "#"
Compute the Euclidean distance between each pair of the 784-dimensional vectors of the digits at the
following positions: 26th, 30th, 32nd, 35th. Based on the distances computed in the previous step and
knowing that the digits listed are 7, 0, 1, 1, can you assign the correct label to each of the digits ?
3 Split the Iris dataset into two the datasets - IrisTest_TrainData.csv, IrisTest_TestData.csv. Read them as two
separate data frames named Train_Data and Test_Data respectively. Answer the following questions:
 How many missing values are there in Train_Data?  What is the proportion of Setosa types in the
Test_Data?
 What is the accuracy score of the K-Nearest Neighbor model (model_1) with 2/3 neighbors using
Train_Data and Test_Data?
 Identify the list of indices of misclassified samples from the „model_1‟.  Build a logistic regression model
(model_2) keeping the modelling steps constant. Find the accuracy of the model_2
4 Demonstrate Decision tree classification model and Evaluate the performance of classifier on Iris dataset.

5 Demonstrate any of the Clustering model and Evaluate the performance on Iris dataset.

Course Outcomes: After completing the course, the students will be able to
21CSE164 .1 Understand the basic concepts of Data Science
21CSE164 .2 Implement Data Science, Big data and fitting model
21CSE164 .3 Explore Data Analysis, Data Science Process and R Programs for the algorithms.
21CSE164 .4 Analyze the Feature Selection algorithms and Recommendation Systems.
21CSE164 .5 Design Map Reduce Solutions

Reference Books
 Cathy O Neil, Rachel Schutt, 2014, “Doing Data Science-Straight Talk from the Frontline”, Orielly
 Jure Leskovek, Anand Rajaraman, Jeffrey Ullman, 2014 Mining of Massive Data Sets, Cambridge University Press
 Kevin Murphy, 2013, Machine learning: A Probabilistic Perspective
 Peter Bruce, Andre Bruce, Practical Statistics for Data Scientists, Orielly Series

Marks Distribution for Assessment:

CIA
Component Description Marks
(50)
Written Test Total Number of Test: 2
Each Theory test will be conducted for 30 marks 30
Average of 2 tests = 30 Marks
Weekly Assessment (Record / Project) 10
Practical Lab IA Test 10
Total Marks 50
SEA
Component Description Marks
(50)
Project Write up – 10 marks
100 marks
Project Report – 25 marks
reduced to
Presentation and demonstration – 50 marks
50 marks
Viva – voce – 15 marks
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institute Under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Digital Image Processing Course Code:21CSE1651
L: T: P: J 2 :0 : 2: 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites: Computer graphics, Computer aided design
Course Learning Objectives: The students will be able to
1 Understand the fundamentals of digital image processing
2 Explore the image transform techniques to enhance the image used in digital image processing
3 Use image restoration techniques and methods in digital image processing
4 Illustrate various coloring and morphological concepts in digital image processing
5 Apply different compression technique to store the image efficiently.
Programming tools preferred: SCILAB, Python, Java or any other relevant platform.
Real Time Images can be used to demonstrate the work.
No. of Blooms
Hours Cognitive
Levels with
Module-1: CO mapping
Introduction to Digital Image Processing Examples of fields that use DIP,
Fundamental Steps in Digital Image Processing, Components of an Image
Processing System, Elements of Visual Perception, Light and the
Electromagnetic Spectrum. Image Sensing and Acquisition, Image Sampling
Understand
and Quantization, Some Basic Relationships Between Pixels.
8 CO1
Sample programs
1. Write a Program to read a digital image. Split and display image into 4
quadrants, up, down, right and left.
2. Implementation of Relationships between Pixels
3. Write a program to show rotation, scaling, and translation of an image.
Module-2:
Spatial Domain: Some Basic Intensity Transformation Functions, Histogram
Processing, Fundamentals of Spatial Filtering, Smoothing Spatial Filters,
Sharpening Spatial Filters Frequency Domain: Preliminary Concepts, The
Discrete Fourier Transform (DFT) of Two Variables, Properties of the 2-D DFT,
Filtering in the Frequency Domain, Image Smoothing and Image Sharpening
Using Frequency Domain Filters, Selective Filtering.
Sample programs Apply
1. Simulation and Display of an Image, Negative of an Image(Binary & Gray
8
CO2
Scale)
2. Contrast stretching of a low contrast image, Histogram, and Histogram
Equalization
3. Implementation of Image Smoothening Filters(Mean and Median filtering
of an Image)

Module-3:
A Model of the Image Degradation /Restoration Process. Noise models,
Restoration in the Presence of Noise Only using Spatial Filtering. Noise
Reduction by Frequency Domain Filtering, Linear Position-Invariant
Degradations, Estimating the Degradation Function, Inverse Filtering, Minimum
Mean Square Error (Wiener) Filtering, Constrained Least Squares Filtering. 8 Apply
Sample programs CO3
1. Implementation of image restoring techniques.
2. Implementation of Image Intensity slicing technique for image enhancement
Module-4:
Color Image Processing: Color Fundamentals, Color Models, Pseudo color
Image Processing. Wavelets: Background, Multiresolution Expansions.
Morphological Image Processing: Preliminaries, Erosion and Dilation, Opening
and Closing, The Hit or-Miss Transforms, Some Basic Morphological
Algorithms-Boundary extraction, Hole filling and extraction of connected
component. 8 Apply
Sample programs CO4
1. Read an image, first apply erosion to the image and then subtract the result
from the original. Demonstrate the difference in the edge image if you use
dilation instead of erosion.
2. Compression of Color Image
Module-5:
Image Compression: Fundamentals, coding Redundancy, Inter-pixel
redundancy, image compression model, Lossy and Lossless compression,
Huffman Coding, Golomb Coding, Arithmetic Coding, LZW coding, Block
Transform Coding, Run length coding. Apply
8
Sample programs CO5
1. Demonstrate enhancing and segmenting low contrast 2D images.
2. Write a Program to read a digital image. Split and display image into 4
quadrants, up, down, right and left.

Course Outcomes: After completing the course, the students will be able to
21CSE1651.1 Understand the fundamentals of digital image processing
21CSE1651.2 Apply the image transform techniques to enhance the image used in digital image processing
21CSE1651.3 Apply image restoration techniques and methods used in digital image processing
21CSE1651.4 Apply various coloring and morphological concepts in digital image processing
21CSE1651.5 Apply different compression technique to store the image efficiently.

Text Books
1. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, Third Ed., Prentice Hall, 2008.
Reference Books
1. Milan Sonka,”Image Processing, analysis and Machine Vision”, Thomson Press India Ltd, Fourth
Edition.
2. Fundamentals of Digital Image Processing- Anil K. Jain, 2nd Edition, Prentice Hall of India.
3. S. Sridhar , Digital Image Processing, Oxford University Press, 2nd Ed, 2016.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of activity 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institute Under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS) and Outcome Based Education (OBE)
Semester: VI
Course Name: Wireless Sensor Networks Course Code: 21CSE1652
L: T: P: J 2:0:2:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites: Computer Networks

Course Learning Objectives: The students will be able to

1 To understand the fundamentals of wireless sensor networks and its application to critical real time
scenarios.
2 To study the various protocols at various layers and its differences with traditional protocols.
3 To study MAC Protocols and their issues.
4 To analyze the different routing protocols in wireless sensor network.
5 To analyze the issues pertaining to sensor networks and the challenges involved in managing a sensor
network.
No. of Blooms cognitive
Module-1: Introduction Hours Levels with CO
mapping
Introduction: Fundamentals of wireless communication technology, the electromagnetic
spectrum radio propagation, characteristics of wireless channels, modulation techniques, 6
multiple access techniques, wireless LANs, PANs, WANs, and MANs, Wireless Internet CO1
Lab Component: Understand
1. Installing Cisco packet tracer 2
2. Designing and simulation of network topology using Cisco packet tracer.
Module-2: adhoc/sensor networks
Introduction to adhoc/sensor networks: Key definitions of adhoc/sensor networks, unique
constraints and challenges, advantages of ad-hoc/sensor network, driving applications, 6
issues in adhoc wireless networks, issues in design of sensor network, sensor network
CO2
architecture, data dissemination and gathering.
Understand
Lab Component:
1. Understanding and working of HTTP headers and understanding persistent and non- 2
persistent HTTP connections.
Module-3: MAC Protocols
MAC Protocols : Issues in designing MAC protocols for adhoc wireless networks, design 6
goals, classification of MAC protocols, MAC protocols for sensor network, location
CO3
discovery, quality, other issues, S-MAC, IEEE 802.15.4.
Apply
Lab Component:
1. Working on different sensors data communication using Cisco packet tracer 2
Module-4: Routing Protocols
Routing Protocols: Issues in designing a routing protocol, classification of routing
6
protocols, table-driven, on-demand, hybrid, flooding, hierarchical, and power aware routing
CO4
protocols.
Lab Component: Analyze
IPv6 configuration and static routing commands 2
Module-5: QoS and Energy Management
QoS and Energy Management : Issues and Challenges in providing QoS, classifications,
MAC, network layer solutions, QoS frameworks, need for energy management, classification, 6
battery, transmission power, and system power management schemes. CO5
Analyze
Lab Component: 2
Using Cisco packet tracer understand the life of packet in Internet.

Course Outcomes: After completing the course, the students will be able to

21CSE1652.1 Illustrate the fundamentals of wireless communication technology

21CSE1652.2 Outline advantages and issues of adhoc sensor networks
21CSE1652.3 Identify the different MAC protocols in wireless sensor networks
21CSE1652.4 Analyze the different routing protocols
21CSE1652.5 Examine Issues and Challenges in providing QoS in wireless sensor networks

Text Book
1. C. Siva Ram Murthy, and B. S. Manoj, "AdHoc Wireless networks", Pearson Education - 2008.

Reference Books
1. Feng Zhao and Leonides Guibas, "Wireless sensor networks ", Elsevier publication - 2004.
2. Jochen Schiller, "Mobile Communications", Pearson Education, 2nd Edition, 2003.
3. William Stallings, "Wireless Communications and Networks ", Pearson Education – 2004

Marks distribution for assessment

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down to 50
Marks
50
The question paper will have 10 full questions each of 20 marks. Students
have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended
experiments, Mini Projects, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 6
Course Name: Data Warehousing & Data Mining Course Code: 21CSE1653
L: T: P: J 2: 0: 2 :0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites:
 Basic concepts from Database management
 SQL Practice
Course Learning Objectives: The students will be able to
1 Demonstrate different Data Warehouse Implementations.
2 Interpret the features of Data Mining and Data Mining Applications.
3 Implement Association Mining Methods.
4 Implement Classification Methods.
5 Implement Cluster Analysis and recent trends in Data Mining Applications.

No. of Blooms
Hours Cognitive
Module-1: Data Warehousing Levels with
CO
mapping
Basic Concepts, Data Warehouse Modeling: Data Cube and OLAP,
Data Warehouse Implementation, Data Preprocessing, Data Cleaning,
Data Integration, Data Reduction, Data Transformation and Data Apply
6+2=8
Discretization. CO 1
Lab Component:
Create an application to design a for a schema and OLAP operation
Module-2: Data Mining
Why Data Mining? What Is Data Mining? What Kinds of Data Can Be
Mined? Major Issues in Data Mining, Data Objects and Attribute Types,
Basic Statistical Descriptions of Data, Data Visualization, Measuring Apply
6+2=8
Data Similarity and Dissimilarity, Data Mining Applications. CO2
Lab Component:
Create an application for a data preprocessing activities
Module-3: Association Mining
Mining Frequent Patterns, Associations, and Correlations: Basic
Concepts and Methods, Frequent Item set Mining Methods, Which
Patterns Are Interesting?—Pattern Evaluation Methods, Constraint-
Based Frequent Pattern Mining, Mining High-Dimensional Data and Analyse
6+2=8
Colossal Patterns CO3
Lab Component :
Create an application to show the working progress of Association
mining
Module-4: Classification
Basic Concepts, Decision Tree Induction, Bayes Classification
Methods, Rule-Based Classification, Holdout Method and Random Sub
sampling, Cross-Validation, Bootstrap, Boosting, Random Forests, Analyse
6+2=8
Bayesian Belief Networks, Classification by Back propagation. CO4
Lab Component :
Create an application for the decision tree using B+ tree
 Module-5: Cluster Analysis and recent trends
Cluster Analysis, Partitioning Methods, Hierarchical Methods, Density-
Based Methods, Grid-Based Methods, Outlier Detection Methods,
Visual and Audio Data Mining. Analyse
6+2=8
Lab Component : CO5
Create an application to show the working progress of Visual and Audio
Data Mining.

Course Outcomes: After completing the course, the students will be able to
21CSE1653.1 Apply the data warehouse concepts for data cube problems.

21CSE1653.2 Apply the data mining solutions with data visualization techniques.

21CSE1653.3 Analyze the association rules for the data set using mining concepts.

21CSE1653.4 Analyze between the classification Algorithm methods.

21CSE1653.5 Analyze data mining problems in recent trends

Text Books
1. Jiawei Han, Micheline Kamber, Jian Pei: Data Mining -Concepts and Techniques, 3rd Edition,
Morgan Kaufmann Publisher, 2012.
2. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Pearson, First
impression,2014.
Reference Books
1. Sam Anahory, Dennis Murray: Data Warehousing in the Real World, Pearson,Tenth
Impression,2012.
2. Michael.J.Berry,Gordon.S.Linoff: Mastering Data Mining , Wiley Edition, second edition,2012.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Advanced Java Programming Course Code: 21CSE1654
L: T: P: J 2:0:2:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites: Java Programming Language and Basic concepts of Java.

Course Learning Objectives: The students will be able to

1 Identify the need for advanced Java concepts like Collections.
2 Adapt Servlets to build server-side programs.
3 Make use of JDBC & Hibernate Framework to access database through Java Programs.
4 Make use of Spring Framework for Integrating Different Technology.

No. of Blooms
Hours Cognitive
Module-1: Collections
Levels with
CO mapping
Collections Overview, Iterators, Collection Interfaces: List: ArrayList, 6
Linked List & Vector, Set: Hashset, Linked Hashset, Map: Hashmap,
Linked Hashmap, & Hash table. Comparator & Comparable Interface.

Sample Programs:
1. Srusti went for shopping and purchased many items. Each item is 2
in the range Rs.500 to 2000. After purchasing the items from the
shop, she started listing the items in some order. Design a java Apply
application program to perform this task. (Hint: ArrayList). CO 1
2. There are 10 elements stored in two different Arraylist. Each of
those elements are stored in an unordered manner. Perform
following set operations for this list using Hashset. (Hint: use
Hashset)
i) Union
ii) Intersection
iii) Set Difference
Module-2: JSP
Introduction to JSP, Creating simple JSP Programs, How JSP is processed, 6
JSP Scripting Constructs, Predefined Variables, JSP Directives, Simple
JSP Program to fetch database records, Case Study: Browsing Database
Tables. Apply
Sample Program: 2 CO 2
1. Develop a JSP program calculates factorial values for an integer
number, while the input is taken from an HTML form.
2. Develop a JSP program shows the System date and time.
Module-3: Servlets
Introduction, Life Cycle of a Servlet(Init(), Service(),Destroy()), using 6
Tomcat for servlet development, simple servlet: create and compile servlet
source code, start tomcat, start a web browser and request the servlet,
Apply
servlet API, Handling HTTP Requests and Responses: Handling HTTP
CO 3
GET requests and POST request, Using Cookies, Session Tracking.
Sample Programs:
1. Develop a Servlet application to print current date & time. 2
 2. Develop a Servlet application to Auto refresh a page.

Module-4: JDBC
Basic SQL, Introduction to JDBC, JDBC Architecture & Drivers, Create a 6
Database, Table, CRUD Operations, Java Application Using JDBC
Connectivity, Driver Manager, Result Set, Connection, Statement,
Prepared Statement, DB Connectivity Steps, Store & Retrieving Image in
SQL, JDBC CRUD Application.
Apply
2
CO 4
Sample Programs:
1. Develop a code create a connection between database to Java
Program.
2. Develop a code to create a database table using Java.
3. Develop a program to perform CRUD operations.
Module-5: Hibernate & Springs
Hibernate: Introduction, Hibernate Architecture, Hibernate Session, 6
Hibernate Configuration, Hibernate With Annotation, Hibernate Validator,
Hibernate CRUD.

Springs: Introduction, Spring Framework, Spring Basics, Inversion of

Control, Dependency Injection, Spring Annotations, Spring MVC, Spring Apply
MVC Annotations, Spring MVC Hello World Applications. CO 5

Sample Programs:
1. Develop a program to create a database and perform CRUD 2
operation using hibernate framework.
2. Develop a program to validate the input using spring framework.

Course Outcomes: After completing the course, the students will be able to
21CSE1654.1 Apply the concept like collections in developing modular & efficient programs.
21CSE1654.2 Develop Server-Side applications using JSP.

21CSE1654.3 Develop Server-Side applications using Servlets.

Make use of database access and details for managing information using the JDBC
21CSE1654.4
API.
21CSE1654.5 Apply different frameworks like Hibernate & spring for solving real time problems.

Text Books
1. The Complete Reference in Java – Seventh Edition.
2. Jim Keogh: J2EE-The Complete Reference, McGraw Hill, 2007.
3. Hibernate:
3.1 https://www.tutorialspoint.com/hibernate/index.htm
3.2 https://www.javatpoint.com/hibernate-tutorial
4. Springs:
4.1 https://www.javatpoint.com/spring-mvc-tutorial
4.2 https://www.tutorialspoint.com/spring/spring_web_mvc_framework.htm

Reference Books
1. Y. Daniel Liang: Introduction to JAVA Programming, 7thEdition, Pearson Education, 2007.
2. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education,2004.
3. Uttam K Roy, Advanced JAVA programming, Oxford University press, 2015.
Marks Distribution for Assessment:
CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks.
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 6
Course Name: Cryptography Hash and Integrity Protection Course Code: 21CSE1655
L: T: P: J 2 :0 : 2 : 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites: Nil
Course Learning Objectives: The students will be able to
1 Learn about the three tenants of the CIA triad—confidentiality, integrity, and availability—and
how they can be used to secure data.
2 Introduce message authentication and hash function.
3 To explain the basic properties that a digital signature algorithm must satisfy
4 TLS cryptographic protocol to secure network communications.

No. of Blooms
Hours Cognitive
Module-1: Levels with
CO
mapping
Introduction to cryptography, cryptanalysis, and cryptology, Overview of
cryptography, Basic Cryptographic Primitives, Vulnerabilities, Threats, and
Attacks. Cryptographic attacks: CCA, COA, KPA, CPA. Objectives of
Information Security: CIA triad, Confidentiality, Integrity, and Availability. 6
Trapdoor CO1
Laboratory Component: Understand
1. Columnar Transposition involves writing the plaintext out in rows and then 2
reading the ciphertext off in columns one by one. Write a Python program
to perform cryptanalysis of single columnar transposition with key size
varying from 3-6.
Module-2:
Message Integrity, Message digest algorithm (MD5), Cryptographic Hash
Function Requirements: One-Way and Collision Properties, Collision
resistant hash function (CRHF), Secure Hash Algorithm (SHA), Birthday
attack, Zero-knowledge protocols, Hash functions: Merkle-Damgard and 6
Davies Meyer. CO2
Laboratory Component: Apply
1. MD5 collision attack lab 2
(ref:
https://seedsecuritylabs.org/Labs_16.04/Crypto/Crypto_MD5_Collisio
n)
Module-3:
Entity authentication, device authentication, Message Authentication Code
(MAC) – Definition, Message Integrity, Cipher Block Chaining (CBC-
MAC), Constructing Secure message Authentication codes, Authenticated
6
Encryption, Generic Attacks on Hash Functions, Random Oracle Model,
Applications, CO3
Laboratory Component: Apply
1. Hash length extension attack
2
Ref:
https://seedsecuritylabs.org/Labs_16.04/Crypto/Crypto_Hash_Len
gth_Ext/
Module-4:
Identification protocols, Digital Signature (DS): Certificates and Public
Infrastructure, Attacks, Schemes, Applications, Signatures from Hash
6
Functions. Elliptic Curve cryptography-based signature (ECDSA), RSA-
CO4
based signature,
Evaluate
Laboratory Component:
2
1. RSA signature and encryption lab
Ref: https://seedsecuritylabs.org/Labs_16.04/Crypto/Crypto_RSA/
Module-5:
Case Study: TLS, Hash Tree (Merkle Tree), Cryptographic Hash
6
Applications: blockchain, cryptocurrency, and Bitcoin CO5
Laboratory Component: Apply
2
1. Create self-signed certificates in Python.

Course Outcomes: After completing the course, the students will be able to
21CSE1655.1 Classify cryptographic attacks.
21CSE1655.2 Make use of the hash for data integrity.
21CSE1655.3 Make use of authentication algorithms for message authentication
21CSE1655.4 Choose an appropriate digital signature.
21CSE1655.5 Utilize TLS for data security.

Text Books
1. “Introduction to Modern Cryptography”, Jonathan Katz, Yehuda Lindell, 2nd Edition, CRC
Press, 2015.
Reference Books
1. “Cryptography and Network Security” Behrouz A.Foruzan, 3rd Edition, Tata McGraw Hill,
2017

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 2
 Each test will be conducted for 30 marks 30
 Average of 2 tests = 30 Marks
 Conduction of experiments, Record writing, viva in each
lab 20 marks 20
 Average of conduction, record, viva = 20 Marks
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI (Professional Elective)
Course Name: High Performance Computing in Cloud Course Code: 21CSE1656
L: T: P: J 3 : 0 :0:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 4 SEA Duration: 03 Hours
Pre-Requisites:

Course Learning Objectives: The students will be able to

1 Understand the basics about High performance computing
2 Identify the challenges involved in distributed computing and understand the need for cluster
computing
3 Apply the concepts of Grid computing to improve the overall system performance
4 Define the basic concepts of cloud computing
5 Provide an in-depth and comprehensive knowledge of the Cloud Computing fundamental issues,
technologies, applications and implementations.

No. of Blooms
Hours Cognitive
Module-1: INTRODUCTION TO HPC Levels with
CO
mapping
Introduction to high performance computing, basic definitions: cluster, grid,
meta-computing, middleware etc., examples of representative applications.
Understand
Programming models: shared memory, message passing, peer-to-peer. 8
Development of parallel and distributed applications, Design phases, CO1
Performance metrics and profiling
Module-2: OVERVIEW OF CLUSTER COMPUTING
The Role of Clusters, Definition and Taxonomy, Distributed Computing,
Limitations, Architecture of cluster-based systems, Design Decisions, Protocols Apply
8
Distributed File Systems, Virtualization technologies, Issues in cluster design CO2

Module-3: INTRODUCTION OF GRID COMPUTING

Introduction, Evolution of the Grid, Definitions of Grid Computing, Grid models,
Applications, Examples of usage, Research possibilities / scope in Apply
8
Grid Computing, HPC and Grids, Scheduling HPC applications in Grids, Grid CO3
Monitoring Architecture (GMA) – An Overview of Grid Monitoring Systems.
Module-4: INTRODUCTION TO CLOUD COMPUTING
Introduction to Cloud Computing- Cloud issues and challenges - Properties -
Characteristics - Service models, Deployment models. Cloud resources: Network Apply
and API - Virtual and Physical computational resources - Data- 8
CO4
storage. Virtualization concepts - Types of Virtualization
Module-5: CLOUD SERVICE MODELS
Service models - Infrastructure as a Service (IaaS) - Resource Virtualization:
Server, Storage, Network - Case studies. Platform as a Service (PaaS) - Cloud
Analyze
platform & Management: Computation, Storage - Case studies. Software as a 8
Service (SaaS) - Web services - Web 2.0 - Web OS - Case studies – Anything as
CO5
a service (XaaS).
Course Outcomes: After completing the course, the students will be able to

21CSE1656.1 Understand the fundamental concepts of High Performance computing.

Identify the issues present in the distributed systems and overcome the limitations
21CSE1656.2
with cluster computing concepts.
Apply the concepts of various grid models to improve the performance of the
21CSE1656.3
system.
 Identify the main concepts, key technologies, strengths, and limitations of cloud
21CSE1656.4
computing.

21CSE1656.5 Analyze the architecture and infrastructure of cloud computing, including SaaS, PaaS,
IaaS, public cloud, private cloud, hybrid cloud, etc.

Text Books
1. High Performance Cluster Computing, Volume 1, Architecture and Systems, Rajkumar Buyya, Pearson
Education.
2. D. Janakiram, Grid Computing, Tata McGraw-Hill, 2005
3. R. Buyya, C. Vecchiola and S. T. Selvi, Mastering Cloud Computing Foundations and Applications
Programming, Morgan Kaufmann, Elsevier, 2013.
Reference Books
1) C. S. R. Prabhu, Grid and Cluster Computing, PHI, 2008.
2) B. Sosinsky, Cloud Computing Bible, Wiley, 2011
3) A. Chakrabarti, Grid Computing Security, Springer, 2007
4) . (Edited By) I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure,
Morgan Kaufmann, Elsevier, 2004.

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project/Case study 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
An Autonomous Institute Under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Computer Vision: Algorithms and Applications
Course Code: 21CSE1661
L: T: P: J 3: 0 : 0 : 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 40 SEA Duration: 03 Hours
Course Learning Objectives: The students will be able to
1 Provide an insight into the applications of Computer Vision.
2 Understand the fundamentals of Object Recognition, Image Classification.
3 Identify and Analyze the Adversarial Attacks and Defense mechanisms.
No. of Blooms
Hours Cognitive
Module-1:
Levels with
CO
mapping
Introduction: Background, requirements and issues, human vision. Image CO1,
formation: geometry and photometry 8
Understand
Module-2:
Geometry, brightness, quantization, camera calibration, photometry, Image
segmentation, Region segmentation, Edge detection, Point features (SIFT) , CO2,
Multi-view Geometry :Shape from stereo and motion, feature matching, Active 8
Apply
ranging
Module-3:
Object Recognition: Traditional Methods, Bag of Words, Bayes classifiers,
CO3,
Linear classifiers Neural Network Basics: Neural nets, CNNs, Backpropagation, 8
SGD, Batch Normalization, COLO. Apply
Module-4:
Image Classification: Variety of networks, possibly some coverage of semi-
supervised methods, Object Detection and Semantic Segmentation: Variety of CO4,
approaches (Faster/Mask RCNN, YOLO and related); Human pose estimation,
8
Apply
Face ID
Module-5:
Adversarial Attacks and Defense: Motion Analysis and activity Recognition -
Optical flow, motion features, classification network, Selected Topics–Vision
CO5,
8
and language, Vision Transformers.
Analyze

Course Outcomes: After completing the course, the students will be able to
21CSE1661.1
 Utilize the toolbox of the most powerful Computer Vision models.
21CSE1661.2
 Illustrate the theory behind the concepts of Computer Vision.

21CSE1661.3
 Apply Object Recognition by utilizing the traditional methods.

21CSE1661.4
 Apply Image Classification by making use of different approaches.
21CSE1661.5
 Create powerful Computer Vision applications.

Text Books
1. Computer Vision: Algorithms and Applications by Richard Szeliski. A Modern Approach-ISBN
– 9789332550117.
2. Computer Vision: A Modern Approach by David Forsyth and Jean Ponce. International 2nd
edition Available for free online.

Reference Books
1. Elements of Statistical Learning by Trevor Hastie, Robert Tibshirani, and Jerome Friedman.
Available for free online
2. Multiple View Geometry in Computer Vision (Second Edition) by Richard Hartley and Andrew
Zisserman. Available for free online through the UM Library.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 6
Course Name: Mobile Adhoc Networks Course Code: 21CSE1662
L: T: P: J 3: 0: 0: 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 3 SEA Duration: 03 Hours
Pre-Requisites: Basics of networking, Reference models, Network protocols
Course Learning Objectives: The students will be able to
1 Explain fundamental principles of Ad-hoc Networks
2 Discuss a comprehensive understanding of Ad-hoc network protocols
3 Outline current and emerging trends in Ad-hoc Wireless Networks.
4 Analyze energy management in ad-hoc wireless networks.
No. of
Module-1: Hours
BLL

Basic Wireless Sensor Technology and Systems

Introduction, Sensor Node Technology, Sensor Taxonomy, WN Operating Understand
8
Environment, Wireless Transmission Technology and Systems, Available CO1
Wireless Technologies
Module-2:
Ad-hoc Wireless Networks
Introduction, Issues in Ad-hoc Wireless Networks, Adhoc Wireless Internet;
MAC Protocols for Ad-hoc Wireless Networks: Introduction, Issues in
Designing a MAC Protocol, Design Goals of MAC Protocols, Classification of Understand
8
MAC protocols, Contention-Based Protocols (MACAW, FAMA, CO2
BTMAMARCH), Contention- Based Protocols with Reservation Mechanisms
(D-PRMA, CATA, HRMA) Contention-Based Protocols with Scheduling
Mechanisms (DPS, DWOP).
Module-3:
Routing Protocols for Ad-hoc Wireless Networks
Introduction, Issues in Designing a Routing Protocol for Ad-hoc Wireless
Networks; Classification of RoutingProtocols; Table Driven Routing Protocols
Apply
8
CO3
(DSDV, WRP, CGSR); On-Demand Routing Protocols (DSR, AODV, LAR,
ABR), Hybrid Routing Protocols (CEDAR, ZHLS).
Module-4:
Transport Layer and Security Protocols for Ad-hoc Networks
Introduction, Issues in Designing a Transport Layer Protocol; Design Goals of
a Transport Layer Protocol;Classification of Transport Layer, Transport Layer Apply
8
Protocols for Ad-hoc Networks; Security in Ad-hoc Wireless Networks, Issues CO4
and Challenges in Security Provisioning, Network Security Attacks.
Module-5:
Quality of Service and Energy Management in Ad-hoc Wireless
Networks: Introduction, Issues and Challenges in Providing QoS in Ad-hoc
Wireless Networks, Classification of QoS Solutions, MAC Layer Solutions,
Network Layer Solutions (Ticket based, Predictive Location based, Trigger Analyze
8
based); CO5
Energy Management in Ad-hoc Wireless Networks: Introduction, Need for
Energy Management in Ad-hoc Wireless Networks, Classification of Energy
Management Schemes, Battery Management Schemes.
Course Outcomes: After completing the course, the students will be able to
Demonstrate appropriate knowledge to exploit the benefits of wireless Adhoc & sensor
21CSE1662.1
networks
21CSE1662.2 Summarize the protocol design issues of Adhoc and sensor networks
21CSE1662.3 Make use of appropriate routing protocols in Adhoc networks
21CSE1662.4 Identify the Issues and Challenges in Security Provisioning in Adhoc networks
Analyze the challenges in providing the Quality of Service and Energy Management in Ad-hoc
21CSE1662.5
Wireless Networks

Text Books
1. C. Siva Ram Murthy & B. S. Manoj: Ad-hoc Wireless Networks, Pearson Education, 2014.
ISBN 978-81-317-0688-6
2. Wireless Sensor Networks: Technology, Protocols and Applications, Kazem Sohraby, Daniel
Minoli, Taieb Znati, WILEY, Second Edition (Indian), 2014, ISBN: 978-0-471-74300-2
Reference Books
1. Xiuzhen Cheng, Xiao Hung, Ding-Zhu Du: Ad-hoc Wireless Networking, Kluwer Academic
Publishers, 2004.
2. C.K. Toh: Ad-hoc Mobile Wireless Networks- Protocols and Systems, Pearson Education, 2002
3. Wireless Sensor Networks- An Information Processing Approach, Feng Zhao & Leonidas J. Guibas,
Elsevier, 2007, ISBN-9781558609143.

Marks Distribution for Assessment:

CIA Component Description Marks

(50)
Written Total Number of Test: 3
Test Each Theory test will be conducted for 30 marks 30
Average of 3 tests = 30 Marks
Assignment 10
AAT 10
Total Marks 50
SEA Component Description
Marks
(50)
5 Questions to answer, each of 20 marks.
Written 2 Questions from each module with internal choice. 50
Exam
Student should answer one full question from each module.
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments, Mini Projects,
Two-minute video on latest topic, Short MOOC courses
 BNM Institute Of Technology
Dept. of Computer Science & Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Devops Course Code: 21CSE1663
L: T: P: J 3:0:0:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 3 SEA Duration: 03 Hours
Course Learning Objectives: The students will be able to
1 Understand the challenges in Software Engg and Continuous Integration and Continuous
Delivery
2 Know how DevOps is applied and used in Software Development cycle.
3 Know how DevOps can be applied in testing phase of SDLC.
4 To understand the DevOps tools used in each phase of software development activity.
5 To appreciate the use of DevOps post software development and deployment..

No. of Blooms
Module1 Hours Cognitive
Levels
Introduction to DevOps and Continuous Delivery: Introducing DevOps,
how fast is fast? The Agile wheel of wheels, Beware the cargo cult Agile
fallacy. CO1
08
A View from Orbit: The DevOps process and Continuous Delivery, Understand
Release management, Scrum, Kanban, and the delivery pipeline, wrapping
up – a complete example, Identifying bottlenecks
Module 2
Everything is Code: The need for source code control, The history of
source code management, Roles and code, Which source code
management system?, A word about source code management system CO2
08
migrations, Choosing a branching strategy, Branching problem areas, Apply
Artifact version naming. Choosing a client, Setting up a basic Git server,
Shared authentication, Hosted Git servers.
Module 3
Building the Code: Why do we build code?, The many faces of build
systems, The Jenkins build server, Managing build dependencies, The
final artifact, Continuous Integration, Continuous Delivery, Jenkins
plugins, The host server, Build slaves, Software on the host, Triggers. Job CO3
08
chaining and build pipelines, A look at the Jenkins filesystem layout, Apply
Build servers and infrastructure as code, Build phases, Alternative build
servers, Collating quality measures, About build status visualization,
Taking build errors seriously
Module 4
Testing the Code : Manual testing, Pros and cons with test automation,
Unit testing, JUnit in general and JUnit in particular, A JUnit example,
Mocking, Test Coverage, Automated integration testing, Performance CO4
08
testing, Automated acceptance testing, Automated GUI testing, Understand
JavaScript testing, Testing backend integration points, A complete test
automation scenario
Module 5:Pipelining and Multiprocessors
Deploying the Code: Why are there so many deployment systems?, CO5
Virtualization stacks, Executing code on the client, The Puppet master and 8 Apply
Puppet agents, Cloud solutions, AWS, Azure.
Course Outcomes: After completing the course, the students will be able to

22CSE1663.1 Understand the Software Engg process, and challenges

22CSE1663.2 Know how Devops is applied and used in Software Development cycle.

22CSE1663.3 Know the application of DevOps in Software Development activity

22CSE1663.4 Understand application of DevOps in Software Testing and Validation activity

22CSE1663.5 Build familiarity of application of DevOps in Software Deployment phase

Text Books
1. Joakum Verona, “Practical DevOps”, Packt Publishing Limited, 2016

Reference Books
Jennifer Davis, Ryn Daniels, “Effective DevOps”, O’reilly Publications, 2016.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Case study on various architectures 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
Department of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Cloud Computing Course Code: 21CSE1664
L: T: P: J 3: 0 : 0 :0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 40 SEA Duration: 03 Hours
Pre-Requisites:

Course Learning Objectives: The students will be able to

1 Understand the basics of Cloud Computing.
2 Obtain an in-depth and comprehensive knowledge of the Cloud Computing fundamental issues,
technologies, applications and implementations.
3 Develop programs and do experiment with the various cloud computing environments.
4 Develop applications with the help of cloud infrastructure
5 Analyze about the different Cloud Standards and security measures.

No. of Blooms
Hours Cognitive
Module-1: Introduction to Cloud Computing Levels with
CO
mapping
Introduction to Cloud Computing- Cloud issues and challenges - Properties -
Characteristics - Service models, Deployment models. Cloud resources: Network
Apply
and API - Virtual and Physical computational resources - Data-
storage. Virtualization concepts - Types of Virtualization- Introduction to Various
8
Hypervisors - High Availability (HA)/Disaster Recovery (DR) using CO1
Virtualization.
Module-2: Service Models
Service models - Infrastructure as a Service (IaaS) - Resource Virtualization:
Server, Storage, Network - Case studies. Platform as a Service (PaaS) - Cloud Apply
platform & Management: Computation, Storage - Case studies. Software as a 8
Service (SaaS) - Web services - Web 2.0 - Web OS - Case studies – Anything as CO2
a service (XaaS).
Module-3: Migrating into a Cloud
Introduction, Challenges while migrating to Cloud, Broad approaches to
Analyse
migrating into the cloud why migrate -deciding on cloud migration, the Seven-
step model of migration into a cloud, Migration Risks and Mitigation, relevant 8
Deployment Models for Enterprise Cloud Computing. CO3
Module-4: Cloud Programming and Software Environments
Cloud Programming and Software Environments – Parallel and Distributed
Programming paradigms – Programming on Amazon AWS and Microsoft Azure Apply
– Programming support of Google App Engine – Emerging Cloud software 8
Environment. CO4

Module-5: Cloud Access & Cloud Security

Cloud Access: authentication, authorization and accounting - Cloud Provenance
and meta-data - Cloud Reliability and fault-tolerance - Cloud Security, privacy, Apply
policy and compliance- Cloud federation, interoperability and standards. 8
CO5
Course Outcomes: After completing the course, the students will be able to

 Identify the main concepts, key technologies, strengths, and limitations of cloud
21CSE1664.1
computing and the possible applications for state-of-the-art cloud computing.
 Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS,
21CSE1664.2
IaaS, public cloud, private cloud, hybrid cloud, etc.
21CSE1664.3 Analyze various methods to migrate into cloud & its associated challenges.

 Make use of the appropriate cloud computing solutions and recommendations

21CSE1664.4
according to the applications used.
 Identify the core issues of cloud computing such as security, privacy, and
21CSE1664.5
interoperability and apply solutions accordingly.

Text Books
1. 1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and cloud computing from
Parallel Processing to the Internet of Things”, Morgan Kaufmann, Elsevier – 2012.
2. Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate
Online - Michael Miller - Que 2008.
Reference Books
1. Barrie Sosinsky, “ Cloud Computing Bible” John Wiley & Sons, 2010.
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, Cloud Security and Privacy An Enterprise
Perspective on Risks and Compliance, O'Reilly 2009.

Marks Distribution for Assessment:

CIA Component Description Marks

(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project/Case study 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: 6
Course Name: Cyber security and digital forensics Course Code: 21CSE1665
L: T: P: J 3 :0 : 0 : 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 40 SEA Duration: 03 Hours
Pre-Requisites: Nil
Course Learning Objectives: The students will be able to
1 Provide a deep understanding of security issues, digital forensics & incident response.
2 Enhance knowledge and experience of various digital forensics techniques and incident
response
3 To apply techniques to store incident evidence safely and securely.
4 Analyze various mail forensic tools
5 Apply various data recovery tools to get back deleted data.

No. of Blooms
Hours Cognitive
Module-1: Levels with
CO
mapping
Forensics Overview: Digital forensics: Introduction – Evidential potential of
digital devices: closed vs. open systems, evaluating digital evidence potential, CO1
Concepts: computer/network/Internet forensic and anti-forensics, Digital 8
Understand
Investigation, Data Acquisition, and Information Gathering.
Module-2:
Cyber Crime and Computer Crime. Definition and types of cybercrimes, electronic
evidence and handling, electronic media, collection, searching, and storage of
CO2
electronic media, introduction to internet crimes, hacking and cracking, credit card 8
and ATM frauds, web technology, cryptography, emerging digital crimes, and Apply
modules.
Module-3:
Processing crimes and incident scenes, securing a computer incident or
CO3
crime, seizing digital evidence at the scene, storing digital evidence, 8
Apply
obtaining digital hash, and reviewing cases.
Module-4:
Current computer forensics tools- software, hardware tools, validating and testing
forensic software, addressing data-hiding techniques, performing remote CO4
acquisitions, E-Mail investigations- investigating email crime and violations, 8
Analyse
understanding E-Mail servers, specialized E-Mail forensics tool.
Module-5:
Introduction to Forensic Tools, Usage of Slack space, tools for Disk Imaging, Data
Recovery, Vulnerability Assessment Tools, Encase and FTK tools, Anti Forensics
and probable counters, retrieving information, process of computer forensics and
CO5
digital investigations, processing of digital evidence, digital images, damaged SIM 8
and data recovery, multimedia evidence, retrieving deleted data: desktops, laptops Apply
and mobiles, retrieving data from slack space, renamed file, ghosting, compressed
files.

Course Outcomes: After completing the course, the students will be able to
21CSE1665.1 Summarize security issues, digital forensics & incident response
21CSE1665.2 Apply various digital forensics techniques and incident response
21CSE1665.3 Apply techniques to store incident evidence safely and securely.
21CSE1665.4 Analyze various mail forensic tools
21CSE1665.5 Apply various data recovery tools to get back deleted data.

Text Books
1. Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage
Learning, India Edition, 2008.
2. Angus M.Marshall, John, “ Digital forensics: Digital evidence in criminal investigation”
Reference Books
1. Gregory Kipper, “Wireless Crime and Forensic Investigation”, Auerbach Publications, 2007
2. Iosif I. Androulidakis, “ Mobile phone security and forensics: A practical approach”, Springer
publications, 2012
3. Andrew Hoog, “ Android Forensics: Investigation, Analysis and Mobile Security for Google
Android”, Elsevier publications, 2011

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100
 BNM Institute of Technology
An Autonomous Institution under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE))
Semester: 6
Course Name: High Performance Computer Architecture and Parallel Computing
Course Code: 21CSE1666
L: T: P: J 3: 0 :0:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 40 SEA Duration: 3 Hours
Pre-Requisites:
Students must have good knowledge on
 Computer organization
 Computer architecture
Course Learning Objectives: The students will be able to
1 To introduce the design, analysis, and implementation, of high performance computational science
and engineering applications.
2 Illustrate on advanced computer architectures, parallel algorithms, parallel languages, and
performance-oriented computing.
3 Be familiar with popular parallel programming paradigms.
4 Understand the means by which to measure, assess and analyse the performance of HPC
applications.
5 Understand the mechanisms for evaluating the suitability of different HPC solutions to solving
scientific problems.
No. of BLL with
Module-1: Hours CO mapping
Introduction: Computational Science and Engineering: Computational
Science and Engineering Applications; characteristics and requirements,
Review of Computational Complexity, Performance: metrics and
Understand
measurements, Granularity and Partitioning, Locality: 8
CO1
temporal/spatial/stream/kernel, Basic methods for parallel programming,
Real-world case studies (drawn from multiscale, multi-discipline
applications)
Module-2:
High-End Computer Systems: Memory Hierarchies, Multi-core Processors:
Homogeneous and Heterogeneous, Shared-memory Symmetric
Multiprocessors, Vector Computers, Distributed Memory Computers, Apply
8
Supercomputers and Petascale Systems, Application Accelerators / CO2
Reconfigurable Computing, Novel computers: Stream, multithreaded and
purpose-built.
Module-3:
Parallel Algorithms: Parallel models: ideal and real frameworks, Basic
Techniques: Balanced Trees, Pointer Jumping, Divide and Conquer,
Apply
Partitioning, Regular Algorithms: Matrix operations and Linear Algebra, 8
CO3
Irregular Algorithms: Lists, Trees, Graphs, Randomization: Parallel Pseudo-
Random Number Generators, Sorting, Monte Carlo techniques.
Module-4:
Parallel Programming: Revealing concurrency in applications, Task and
Functional Parallelism, Task Scheduling, Synchronization Methods, Parallel
Primitives (collective operations), SPMD Programming (threads, OpenMP, Apply
8
MPI), I/O and File Systems, Parallel Matlabs (Parallel Matlab, Star-P, Matlab CO4
MPI), Partitioning Global Address Space (PGAS) languages (UPC, Titanium,
Global Arrays)
 Module-5:
Achieving Performance: Measuring performance, Identifying performance
bottlenecks, Restructuring applications for deep memory hierarchies, Analyze
Partitioning applications for heterogeneous resources using existing libraries, 8
CO5
tools, and frameworks

Course Outcomes: After completing the course, the students will be able to
Understand the underlying architecture of computing technology, different measures of computational
21CSE1666.1
complexity, and basic methods of parallel programming using real world case studies.
21CSE1666.2 Apply memory hierarchy techniques of various computer systems and its purpose.
Identify different parallel algorithms used in the design of parallel models and various techniques in
21CSE1666.3
modern high performance architectures.
Apply the concept of functional parallelism, task scheduling and various synchronization methods of
21CSE1666.4
parallel programming for achieving parallelism.
21CSE1666.5 Analyze hardware/software co-design for achieving performance.

Text Books
1. Introductions to Parallel Computing, Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar,
Addison-Welsey, 2nd edition, 2003.
2. Petascale Computing: Algorithms and Applications, David A. Bader (Ed.), Chapman & Hall/CRC,
Computational Science Series, 2007.
Reference Books
1. An Introduction to Parallel Computing, Design and Analysis of Algorithms, Rama, A. Gupta, G. Karypis, V.
Kumar, Addison-Wesley 2/e, 2003.
2. Scalable Parallel Computing, Kai Hwang, McGraw Hill 1998.
3. Parallel Computer Architecture: A hardware/Software Approach, David Culler Jaswinder Pal Singh, Morgan
Kaufmann, 1999.
Marks Distribution for Assessment:

CIA Component Description Marks

(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30
marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Theory exam will be conducted for 100 marks
Exam and scaled down to 50 Marks
The question paper will have 10 full questions 50
each of 20 marks. Students have to answer 5 full
questions
Total marks for the Course 100
Additional Assessment Tools (AAT) – Quiz/Presentations/Two-minute video on latest topic/
Short MOOC courses.
NPTEL course link: https://nptel.ac.in/courses/106105033

Coursera: Introduction to High-Performance and Parallel Computing

 BNM Institute of Technology
An Autonomous Institute Under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Computer Graphics and Visualization Course Code: 21CSE1671
L: T: P: J 3 : 0 : 0 :0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 3 SEA Duration: 03 Hours
Pre-Requisites: Computer Aided design
Course Learning Objectives: The students will be able to
1 Overview of Computer Graphics along with its applications
2 Illustrate OpenGl primitives and attributes
3 Make use of different fill area attributes to animate the images.
4 Exploring 2D and 3D graphics mathematics along with OpenGL API’s.
5 Demonstrate clipping and illumination models on both 2D and 3D objects.

No. of Blooms
Hours Cognitive
Module-1: Levels with
CO mapping
Overview: Basics of computer graphics, Application of Computer Graphics, video
display processor, Refresh Cathode Ray Tubes, Random Scan and Raster Scan Understand
displays, Input Devices, graphics software. coordinate reference frames, 8 CO1
Specifying a two dimensional world coordinate reference frame in openGL.
Introduction to OpenGL. Color and gray scale, OpenGL Color Functions.
Module-2:
OpenGL point functions, OpenGL line functions, point attributes, line attributes,
OpenGL point attribute functions, OpenGL line attribute functions, Line drawing
algorithms(DDA, Bresenham‟s), circle generation algorithms (Bresenham‟s). Fill
area Primitives: Polygon fill-areas, OpenGL polygon fill area functions, fill area
Apply
attributes.
8 CO2
Sample programs:
1. Design a line using DDA line drawing algorithm
2. Implement Brenham‟s line drawing algorithm for all types of slope.
3. Design a real world picture using primitives such as points, lines, triangles
and polygons.
Module-3:
2D and 3D viewing pipeline, OpenGL 2D viewing functions, OpenGL Character
Functions, OpenGL Display Lists, general scan line polygon fill algorithm,
OpenGL fill-area attribute functions. Polyhedra, OpenGL Polyhedra Functions,
Curved Surfaces, Quadric Surfaces, OpenGL quadric surfaces and cubic Apply
8
surfacefunctions. CO3
Sample programs:
1. Implement a circle drawing algorithm.
2. Develop a menu driven program to fill the polygon using scan line algorithm
Module-4:
2D and 3D Geometric Transformations: 2DGeometric Transformations: Basic
2D Geometric Transformations, matrix representations and homogeneous
coordinates. Inverse transformations, 2D Composite transformations, other 2D
transformations, OpenGL geometric transformations function. 3D Geometric
Transformations: Translation, rotation, scaling, composite 3D transformations, Apply
other 3D transformations, OpenGL geometric transformations functions.
8
CO4
Sample programs:
1. Create and rotate a triangle about the origin and a fixed point.
2. Draw a colour cube and spin it using OpenGL transformation matrices.
 Module-5:
Clipping and Color and Illumination Models: Clipping: clipping window,
normalization and viewport transformations, clipping algorithms,2D point
clipping, 2D line clipping algorithms: cohen-sutherland line clipping only -
polygon fill area clipping: Sutherland-Hodgeman polygon clipping algorithm Apply
only. Color Models, Light Sources, Basic illumination Models. 8 CO5
Sample programs:
1. Clip a lines using Cohen-Sutherland algorithm.
2. Develop a program to show the different quadric surfaces.

Course Outcomes: After completing the course, the students will be able to
21CSE1671.1 Understand the fundamentals of computer graphics
21CSE1671.2 Design and implement algorithms for 2D graphics primitives and attributes
21CSE1671.3 Apply 2D viewing and quadric surfaces
21CSE1671.4 Apply Geometric transformations on both 2D and 3D objects.
21CSE1671.5 Apply various clipping and illumination models

Text Books
1. Donald Hearn & Pauline Baker: Computer Graphics with OpenGL Version,3rd / 4th Edition, Pearson
Education,2011
2. Edward Angel: Interactive Computer Graphics- A Top Down approach with OpenGL, 5th edition.
Pearson Education, 2008
Reference Books
1. James D Foley, Andries Van Dam, Steven K Feiner, John F Huges Computer graphics with OpenGL:
pearson education
2. Xiang, Plastock : Computer Graphics , sham‟s outline series, 2nd edition, TMG.
3. Kelvin Sung, Peter Shirley, steven Baer : Interactive Computer Graphics, concepts and applications,
Cengage Learning
4. M M Raikar & Shreedhara K S Computer Graphics using OpenGL, Cengage publication

Marks Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
The question paper will have 10 full questions each of 20 50
marks. Students have to answer 5 full questions from each
module.
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
An Autonomous Institution under VTU
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Operating System and RTOS Course Code: 21CSE1672
L: T: P: J 3:0 : 0 :0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 3 SEA Duration: 03 Hours
Pre-Requisites:
Before learning OS, you must have the
 Basic knowledge of C Programming Language.
 Basic knowledge of Computer hardware and software system.
Course Learning Objectives: The students will be able to

1 Introduce concepts and terminology used in OS

2 Apply concepts of threading and multithreaded systems
3 Apply process synchronization and concept of Deadlock
4 Analyze the memory management techniques.
5 Understand the various applications of RTOS

Blooms
Cognitive
Module-1: Fundamental Concepts of Operating System No. of Levels with
Hours CO mapping
Fundamental Concepts of Operating System: Operating system functions and
characteristics, historical evolution of operating systems, issues in operating
system design.
Unix files: Naming files. Basic file types/categories. Organization of files. Hidden
files. Standard directories. Parent child relationship. The home directory and the Understand
8
HOME variable. Reaching required files- the PATH variable, manipulating the CO1
PATH, Relative and absolute pathnames. Directory commands – pwd, cd, mkdir,
rmdir commands. The dot (.) and double dots (..) notations to represent present and
parent directories and their usage in relative path names. File related commands –
cat, mv, rm, cp, wc and od commands.
Module-2: Process Management and CPU Scheduling
Process Management: Process abstraction, process address space, process
management, system calls, threads, process hierarchy. Apply
8
CPU Scheduling: Levels of scheduling, comparative study of scheduling CO2
algorithms, multiple processor scheduling.
Module-3: Deadlocks and Concurrent Processes
Deadlocks: Characterization, prevention and avoidance, deadlock detection and
recovery. Apply
8
Concurrent Processes: Critical section problem, semaphores, monitors, inter- CO3
process communication, message passing mechanisms.
Module-4: Memory Management
Memory Management: Storage allocation methods, virtual memory concept,
Analyze
demand paging, page replacement algorithms, segmentation, thrashing and Disk 8
CO4
Scheduling.
Module-5: Real Time Operating Systems
Real Time Operating Systems: Brief History of OS, Defining RTOS, The
Scheduler, Objects, Services, Characteristics of RTOS, Defining a Task, Tasks Apply
8
States and Scheduling, Task Operations, Structure, Synchronization, CO5
Communication and Concurrency. Defining Semaphores, Operations and
Use,Defining Message Queue, States, Content, Storage, Operations and Use, Case
studies of RTOS- Vx Works, Embedded Linux.

Course Outcomes: After completing the course, the students will be able to

21CSE1672.1 Understand the fundamental Concepts of Operating Systems to execute Shell Commands.

21CSE1672.2 Apply suitable techniques for management of different resources.

21CSE1672.3 Apply the concepts of deadlocks and concurrent process.

21CSE1672.4 Analyze the process of memory management.

21CSE1672.5 Apply the principles and characteristics of real time operating systems.

Text Books
1. Sumitabha Das., Unix Concepts and Applications., 4thEdition., Tata McGraw Hill.
2. Qing Li, “Real Time Concepts for Embedded Systems”, 2011, Elsevier.
Reference Books
1.Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 7th edition,
Wiley-India, 2006
2. W. Richard Stevens: Advanced Programming in the UNIX Environment, 2nd Edition, Pearson
Education, 2005
3. Unix System Programming Using C++ - Terrence Chan, PHI, 1999.
4. Rajkamal, “Embedded Systems- Architecture, Programming, and Design”, 2007,
TMH.
5. W. Richard Stevens, Stephan A. Rago, “Advanced UNIX Programming”, 2006, 2nd
Edition, Pearson.
6. Dr. Craig Hollabaugh, “Embedded Linux: Hardware, Software and Interfacing”,
2008, 1st Edition, Pearson.

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation / Demonstration of mini project 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down to 50
Marks
50
The question paper will have 10 full questions each of 20 marks.
Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations,Term Paper, Open ended experiments, Mini
Projects, Two-minute video on latest topic, Short MOOC courses
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Storage Area Networks
Course Code: 21CSE1673
L: T: P: J 3: 0 : 0 : 0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 40 SEA Duration: 03 Hours
Course Learning Objectives: The students will be able to
1 Define backup, recovery, disaster recovery, business continuity, and replication.
2 Examine emerging technologies including IP-SAN.
3 Understand logical and physical components of a storage infrastructure.
4 Identify components of managing and monitoring the data center.
5 Define information security and identify different storage virtualization technologies
Blooms
Cognitive
No. of
Module-1: Levels with
Hours
CO
mapping
Storage System: Introduction to Information Storage: Information Storage,
Evolution of Storage Architecture, Data Center Infrastructure, Virtualization and Cloud
CO1
Computing. Data Center Environment: Application Database Management System 8
(DBMS), Disk Drive Components, Disk Drive Performance Direct-Attached Storage, Understand
Storage Design Based on Application.
Module-2:
Data Protection - RAID: RAID Array Components, RAID Techniques, RAID Levels,
RAID Impact on Disk Performance, RAID Comparison. Intelligent Storage Systems:
CO2
Components of an Intelligent Storage System, Types of Intelligent Storage Systems. 8
Fibre Channel Storage Area Networks - Fibre Channel: Overview, The SAN and Its Understand
Evolution, Components of FC SAN.
Module-3:
Network-Attached Storage: General-Purpose Servers versus NAS Devices, Benefits
CO3
of NAS, Components of NAS, NAS I/O Operation, NAS Implementations, NAS File- 8
Sharing Protocols, Factors Affecting NAS Performance. Apply
Module-4:
Introduction to Business Continuity: Information Availability, BC Terminology, BC
CO4
Planning Life Cycle, Failure Analysis, Business Impact Analysis. Backup and 8
Archive: Backup Purpose, Backup Considerations, Backup and Restore Operations. Analyze
Module-5:
Local Replication: Replication Terminology, Uses of Local Replicas, Replica
Consistency, Local Replication Technologies, Tracking Changes to Source and Replica. CO5
8
Remote Replication: Modes of Remote Replication, Remote Replication Analyze
Technologies.

Course Outcomes: After completing the course, the students will be able to

Apply the knowledge of different storage Networking technologies and virtualization to

21CSE1673.1
identify key challenges in managing information.
21CSE1673.2 Apply the storage infrastructure and management activities of intelligent storage system and
identify the Components of FC SAN.
21CSE1673.3 Analyze the knowledge of storage area network to key components and for implementation
of Network Attached Storage.
21CSE1673.4 Analyze the concept of Storage Security Issues and the impact of storage architecture, types
of archives and forms of virtualization.
21CSE1673.5 Analyze the information security and identify different storage virtualization technologies
with business continuity, and replication.

Text Book:
1. EMC Education Services, Information Storage and Management, Wiley India Publications, 2009. ISBN:
9781118094839.

Reference Book:
1.Paul Massiglia, Richard Barker, Storage Area Networks Essentials: A Complete Guide to Understanding and
Implementing SANs Paperback”,1st Edition, Wiley India Publications,2008.

Marks Marks Distribution for Assessment:

CIA Component Description Marks

(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation /Case Study 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Case Study Report, Presentations, Short MOOC courses.
 BNM Institute of Technology
Dept. of Computer Science and Engineering
Choice Based Credit System (CBCS and Outcome Based Education (OBE)
Semester: VI
Course Name: Information and Network Security Course Code: 21CSE1674
L: T: P: J 3:0:0:0 CIA Marks: 50
Credits: 3 SEA Marks: 50
Hours/Week (Total) 3 SEA Duration: 03 Hours
Pre-Requisites:

Course Learning Objectives: The students will be able to

1 To understand basics of Network Security.
2 To be able to learn about the process of securing secure a message over insecure channel part of
computer networks by various means.
3 To learn about how to maintain the Confidentiality, Integrity and Availability of a data under
transmission in computer networks.
4 To understand various protocols for network security to protect against the threats in the networks

No. of Blooms
Module-1: Introduction
Hours Ccognitive Levels
with CO mapping
Attacks, Services and Mechanisms, Security Attacks, Security Services,
Integrity check, digital Signature, authentication, has algorithms.
Secret Key Cryptography: Block Encryption, DES rounds, S-Boxes Understand
IDEA: Overview, comparison with DES, Key expansion, IDEA rounds,
8
CO1
Uses of Secret key Cryptography; ECB, CBC, OFB, CFB, Multiple
encryptions DES.
Module-2: Hash Functions and Message Digests:
Length of hash, uses, algorithms (MD2, MD4, MD5, SHS) MD2:
Algorithm (Padding, checksum, passes.) MD4 and 5: algorithm (padding, Apply
8
stages, digest computation.) SHS: Overview, padding, stages. CO2

Module-3: Public key Cryptography:

Algorithms, examples, Modular arithmetic (addition, multiplication,
inverse, and exponentiation) RSA: generating keys, encryption and
decryption. Other Algorithms: PKCS, Diffie-Hellman, El-Gamal
signatures, DSS, Zero-knowledge signatures Authentication: Password Apply
Based, Address Based, Cryptographic, Authentication: Passwords in
8
CO3
distributed systems, on-line vs offline guessing, storing. Cryptographic
Authentication: passwords as keys, protocols, KDC’s Certification
Revocation, Interdomain, groups, delegation.
Module-4: Security Policies and Security Handshake Pitfalls:
What is security policy, high and low level policy, user issues? Protocol
problems, assumptions, Shared secret protocols, public key protocols,
mutual authentication, reflection attacks, use of timestamps, nonce and Apply
8
sequence numbers, session keys, one-and two-way public key based CO4
authentication
Module-5: Example System:
Kerberos: purpose, authentication server and ticket granting server, keys
and tickets, use of AS and TGS, replicated servers, Network Security:
Apply
Electronic mail security, IP security, Network management security. 8
CO4
Security for electronic commerce: SSL, SET. System Security: Intruders
and Viruses, Firewalls, Intrusion Detection
Course Outcomes: After completing the course, the students will be able to

21CSE1674.1 Identify the security issues in the network and resolve it.

21CSE1674.2 Apply hash functions to design and develop security solutions.

21CSE1674.3 Apply security mechanisms using rigorous approaches using public key ciphers.

21CSE1674.4 Identify security policies for authentication process.

21CSE1674.5 Identify network security protocols for IP security and its issues..

Text Books
1. 1. Atul Kahate, Cryptography and Network Security, McGraw Hill.
2. Kaufman, c., Perlman, R., and Speciner, M., Network Security, Private Communication in a public
world, 2nd ed., Prentice Hall PTR., 2002.
3. Stallings, W.,.Cryptography and Network Security: Principles and Practice, 3rd ed., Prentice Hall
PTR.,2003.
Reference Books
1. Stallings, W. Network security Essentials: Applications and standards, Prentice Hall, 2000.
2. Cryptography and Network Security; McGraw Hill; Behrouz A Forouzan.
3. Information Security Intelligence Cryptographic Principles and App. Calabrese Thomson. 7. Securing
A Wireless Network Chris Hurley SPD

Marks Distribution for Assessment:

CIA Component Description Marks
(50)
Written Test  Total Number of Test: 3
 Each Theory test will be conducted for 30 marks 30
 Average of 3 tests = 30 Marks
Assignment Average of 2 Assignments for 10 marks each 10
AAT Presentation 10
Total Marks 50
SEA Component Description
Marks
(50)
Written Exam Theory exam will be conducted for 100 marks and scaled down
to 50 Marks
50
The question paper will have 10 full questions each of 20
marks. Students have to answer 5 full questions
Total marks for the Course 100

Additional Assessment Tools (AAT) – Quiz, Presentations, Term Paper, Open ended experiments,
Mini Projects, Two-minute video on latest topic, Short MOOC courses