B.N.M.

Institute of Technology
An Autonomous Institution under VTU, Approved by AICTE
Department of Mathematics
Syllabus
Semester: IV
Course: Statistics, Probability and Graph theory
Course Code: 22MAI141 (Common to CSE, ISE, AIML)
L:T:P:J 2:1:1:0 CIA: 50
Credits: 03 SEA: 50
Hours: 40 SEA Duration: 03 Hours
Course Learning Objectives: The students will be able to
1 Provide an insight into applications of Graph Theory, Curve fitting & Statistical methods.
2 Develop the knowledge of probability, joint probability distribution and Queuing theory occurring in digital
signal processing, design engineering and micro wave engineering.
No. of Blooms
Module-1: Curve fitting & Statistical methods hours
cognitive
Levels
Examples from Engineering field that require curve fitting and statistical methods.
Curve Fitting: Curve fitting by the method of least squares-fitting the curves of the form:
𝑦 = 𝑎𝑥+𝑏, y = 𝑎𝑥𝑏 𝑎𝑛𝑑 𝑦 = 𝑎𝑥2 + 𝑏𝑥 + 𝑐. L: 04
Apply
Statistical methods: Introduction to Moments, Skewness, kurtosis and problems. Karl T: 04
Pearson’s coefficient of correlation and lines of regression.
Lab Component: Problems on curve fitting and statistical methods
Module-2: Probability Distributions & Joint probability distribution
Examples from Engineering field that require Probability and Joint probability distribution
Probability Distributions: Review of basic probability theory. Discrete and continuous
Random variables, probability mass/density functions (definitions only). Binomial, Poisson,
exponential and normal distributions (without proof). L: 04
Joint probability distribution: Joint Probability distribution for two discrete random variables, T: 04 Apply
expectation, covariance and correlation.
Lab Component: Problems on binomial, Poisson, exponential and normal distributions
Module-3:Markov Chain & Sampling Theory
Examples from Engineering field that require Markov Chain and Sampling Theory
Markov Chain: Introduction to Stochastic process, Probability vectors, Stochastic matrices,
Regular stochastic matrices, Markov Chains, Higher transition probabilities, Stationary
distribution of Regular Markov chains and absorbing states, Markovian processes. L: 04
Sampling Theory: Introduction to sampling theory, Testing of hypothesis, level of significance, T: 04 Apply
confidence limits, test of significance of mean and difference of means for large samples-z-test,
test of significance of small Samples-Student’s t- distribution, Goodness of fit-Chi-Square test.
Lab Component: Problems on Markovian processes and, Sampling Theory
Module-4: Queuing theory
Examples from Engineering field that require queueing theory
Introduction, Symbolic representation of a queuing model, single server Poisson queuing model
with infinite capacity (M/M/1: ∞/FCFS), when 𝜆𝑛 = 𝜆 and 𝜇𝑛 = 𝜇(𝜆 < 𝜇), L: 04
Multiple server Poisson queuing model with infinite capacity (M/M/S: ∞/ FCFS), when 𝜆𝑛 = Apply
T: 04
𝜆 for all 𝑛, (𝜆 > 𝑆𝜇),
Lab Component: Problems on (M/M/1: ∞/FCFS) and (M/M/S: ∞/ FCFS) queuing models

Module-5: Graph Theory

Examples from Engineering field that require graph theory
Basic concepts, types of graphs, order and size of a graph, in-degree and out-degree, bipartite-
graphs, connected and disconnected graphs, Eulerian graph, Hamiltonian graphs, sub-graphs,
L: 04
isomorphic graphs. Matrix representation of graphs, adjacency matrix, incidence matrix. Apply
Planar graphs: definition, characterization of planar graphs, Kuratowski’s theorem, Euler’s T: 04
formula and consequences.
Lab Component: Problems on detection of planar and non-planar graphs
Page. 1
Course Outcomes: After completing the course, the students will be able to
CO 1: Make use of correlation and regression analysis to fit a suitable mathematical model for the statistical
data.
CO 2: Apply discrete and continuous probability and joint probability distributions in analyzing the probability
models arising in engineering field.
CO 3: Use Markov chain in prediction of future events and demonstrate the validity of testing the hypothesis.
CO 4: Acquire skills in analyzing queuing models.
CO 5: Apply the knowledge of Graph Theory in Network modeling, electrical network and computational
algorithms

Reference Books:
1. E. Kreyszig: “Advanced Engineering Mathematics”, John Wiley & Sons, 10th Edition(Reprint),
2016.
2. B. S. Grewal: “Higher Engineering Mathematics”, Khanna Publishers, 44th Edition, 2017.
3. S. D. Sharma : “Operations Research", Kedar Nath Ram Nath & Co. Meerut, 2014.
4. T. Veerarajan : Probability, Statistics and Random processes, McGraw Hill Education(India)
Private Limited, Third edition, Nineteenth reprint 2017.
5. C. Ray Wylie, Louis C. Barrett : “Advanced Engineering Mathematics", 6th Edition, McGraw-
Hill Book Co., New York, 1995.
6. James Stewart : Calculus-Early Transcendental, Cengage Learning India Private Ltd., 2017.
7. B. V. Ramana: "Higher Engineering Mathematics" 11th Edition, Tata McGraw-Hill, 2010.
8. Srimanta Pal & Subobh C. Bhunia: “Engineering Mathematics”, Oxford University Press, 3rd
Reprint, 2016.
9. Narsingh Deo, “Graph Theory with Applications to Engineering and Computer Science”, Prentice
Hall of India, 2000.

Web links and Video Lectures:

1. https://nptel.ac.in/courses/111104098
2. https://www.youtube.com/watch?v=1YkfeR05YXY
3. https://archive.nptel.ac.in/courses/111/104/111104079/
4. https://www.youtube.com/watch?v=xGkpXk-AnWU
5. https://archive.nptel.ac.in/courses/106/104/106104170/

Page. 2
 BNM Institute of Technology
An Autonomous Institution under VTU
Department of Information Science and Engineering
SEMESTER–IV
Course: MICRO CONTROLLER AND EMBEDDED SYSTEM

CourseCode:22ISE142
L:T:P:J 3:1:1:0 CIA: 50
Credits: 04 SEA: 50
Hours: 50 SEA Duration: 03Hours
Course Learning Objectives: The students will be able to
1. Understand the fundamentals of ARM based systems, basic hardware components, selection
methods and attributes of an embedded system.
2. ProgramARM7controller using the various instructions
3. Identify the applicability of the embedded system
4. Comprehend the real time operating system used for the embedded system Develop and test
ProgramusingARM7TDMI/LPC2148
Conduct the experiments on an ARM7TDMI/LPC2148 evaluation board using evaluation version of
Embedded 'C' &Keil Uvision-4 tool/compiler
No. of Blooms
Module-1 Hours cognitive
Levels
Microprocessors versus Microcontrollers, ARM7 Embedded Systems: The RISC
design philosophy, The CISC design philosophy, The ARM Design Philosophy,
Embedded System Hardware, Embedded System Software. ARM Processor 10
Apply
Fundamentals: Registers, Current Program Status Register, Pipeline, Exceptions,
Interrupts, and the Vector Table, Core Extensions
List of programs:
1. Write a program to add an array of 16 bit numbers & store the 32 bit result in
internal RAM
2. Write a program to find the square of a number(1to10) using look-uptable.
Module-2
Introduction to the ARM7 Instruction Set: Data Processing Instructions,
Programme Instructions, Software Interrupt Instructions, Program Status Register
Instruction, Coprocessor Instructions, Loading Constants ARM programming 10
using Assembly language: Writing Assembly code, Profiling and cycle counting, Apply
Instruction scheduling, Register Allocation, Conditional Execution, Looping
Constructs
List of programs:
3. Write a program to find the largest number in an arrayof32 numbers.
4. Write a program to arrange a series of32bit numbers in ascending order.
5. Write a program to count the number of ones and zeros in two consecutive
memory locations.

Page. 3
 Module-3
Embedded System Components: Embedded Vs General computing system,
History of embedded systems, Classification of Embedded systems, Major
applications areas of embedded systems, Core of an Embedded System including
all types of processor/controller, Memory, Sensors, Actuators, LED,7segment 10
Apply
LED display, stepper motor, Keyboard, Push button switch, Communication
Interface (on board and external types), Embedded firmware, Other system
components.
List of programs:
6. 6. Display “HelloWorld” message using Internal UART.
7. 7. Interface and Control a DC Mot
Module-4
Embedded System Design Concepts: Characteristics and Quality Attributes of 10
Embedded Systems, Operational quality attributes, non-operational quality Apply
attributes, Embedded Systems-Application and Domain specific, Hardware
Software Co-Design and Program Modelling, embedded firmware design and
development
List of programs:
8. Interface a Stepper motor and rotate it in clock wise and anti-clock
wisedirection.
9. Interface a DAC and generate Triangular wave forms. Interface a DAC
andgenerate Square wave forms.

Module-5
RTOS and IDE for Embedded System Design: How to choose an RTOS,
Integration and testing of Embedded hard ware and firmware, Embedded system
Development Environment–Block diagram (excluding Keil), Disassembler /
decompiler, simulator, emulator and debugging techniques, target hardware
10
debugging, boundary scan. Apply
List of programs:
10. Demonstrate the use of an external interrupt to toggle an LED On/Off.
11. Display the Hex digits 0 to F on a 7-segment LED interface, with an
appropriate delay in between.

Course Outcomes: After completing the course, the students will be able to
CO 1 Describe the architectural features and instructions of ARM7 microcontroller

CO 2 Apply the knowledge gained for Programming ARM7 for different applications and Interface
External devices and I/O with ARM7 microcontroller.
CO 3 Interpret the basic hardware components and their selection method based on the
Characteristics and attributes of an embedded system.
CO 4 Develop the hardware/software co-design and firmware design approaches.
CO 5 Demonstrate the need of real time operating system for embedded system applications
CO 6 Develop and test program using ARM7 TDMI/LPC2148

Page. 4
Reference Books:
1. Andrew N Sloss, Dominic Symes and Chris Wright, A R M system developers guide,
Elsevier, Morgan Kaufman publishers, 2008 1st Edition.
2. Shibu K V, “Introduction to Embedded Systems”, Tata Mc Graw Hill Education, Private
Limited, 2nd Edition.
3. Raghunandan..G.H, Microcontroller (ARM) and Embedded System, Cengage learning
Publication, 20191st edition.
4. The Insider‟s Guide to the ARM7 Based Microcontrollers, Hitex Ltd.,1stedition,2005.
5. Steve Furber, ARM System-on-Chip Architecture, Second Edition, Pearson,20151stedition.
6. Raj Kamal, Embedded System, Tata McGraw-Hill Publishers,2nd Edition,2008
Web links and Video Lectures:
1. https://academicearth.org/
2. https://onlinecourses.nptel.ac.in/noc20_ee98/preview

Assessment Process
CIA (50) SEA
PCC CIA SEA Conduction: 100 M
I II Reduced to: 50 M
50 50
Conduction

Written Test Average of two tests – Five questions with each of 20

25 Marks marks (with internal choice).
50 50 Student should answer one full
Assignment 15
question from each module
AAT 10
Total – 50 marks Total – 50 marks

i) CIA: 50%
Average of 2 tests – scaled
IA Test: 2 IA tests - Each of 50 Marks
down to 25 M
Assignment – Two assignments – one for 10 marks and another for 5
15 Marks
marks
Additional Assessment Tools (AAT) – Oral /Online Quizzes,
Presentations, Group discussions, Case studies, Term Paper, Open
ended experiments, Mini industrial/social/rural Projects, Two-minute
video on latest topic, Short MOOC courses, Practical Orientation on
10 Marks
Design thinking, creativity & Innovation, Participatory & Industry
integrated learning, Practical activities, Problem solving exercises,
Participation in seminars/academic events/symposia and any other
activity
Total 50 Marks
ii) SEA : 50%
5 questions to answer each of 20 Marks
Theory 2 questions from each module with internal choice 20 M x 5 = 100 M
Exam Student should answer one full question from each reduced to 50 M
module
Total 50 Marks

Page. 5
 B.N.M. Institute of Technology
An Autonomous Institution under VTU
Department of Information Science and Engineering
DATABASE MANAGEMENT SYSTEM
SEMESTER – IV
Subject Code: Teaching Hours/Week 3:0:1:1 CIA Marks 50
22ISE143 (L: T: P: J)
Credits 4 SEA Marks 50
Total Number of Lecture Hours 50 Exam Hours 3
Course Learning Objectives:
This course will enable students to
 Understand fundamental concepts, terminology and application of databases.
 Design concepts and creation of relational databases using relation algebra.
 Practice SQL programming through a variety of database problems.
 Demonstrate the use of Normalization, concurrency and transactions in database.
Module Number Bloom’s
of Hours Level
Module-1
Databases and Databases Users: Characteristics of database Approach,
Advantages of using the DBMS Approach
Database System Concepts and Architecture: Data Models-Schemas and
Instances, Three-Schema Architecture and Data Independence, Database
Languages and Interfaces, The Database System Environment Data Modeling
Using the Entity-Relationship (ER) Model: Entity Types-Entity sets-
Attributes and Keys, Relationship types – Relationship Sets – Roles and 10 Understand
structural Constraints, Weak Entity Types.
Laboratory component:
Draw ER Diagram for the following Databases using GitMind software.
ORDER Database
BANK Database
LIBRARY Database
Module-2
Relational Data Model - Concept of relations, schema-instance distinction,
keys, referential integrity and foreign keys, relational algebra operators:
selection, projection, cross product, various types of joins, division, example
queries, tuple relation calculus, domain relational calculus, converting the
database specification in E/R notation to the relational schema
Laboratory component:
Create Schema, insert at least 5 records in each table and add appropriate
constraints for the following Library Database using ORACLE or MySQL
DBMS under LINUX/Windows environment
BOOK(Book_id, Title, Publisher_Name, Pub_Year)
BOOK_AUTHORS(Book_id, Author_Name) 10 Apply
PUBLISHER(Name, Address, Phone)
BOOK_COPIES(Book_id, Branch_id, No-of_Copies)
BOOK_LENDING(Book_id, Branch_id, Card_No, Date_Out, Due_Date)
LIBRARY_BRANCH(Branch_id, Branch_Name, Address)
Write SQL queries to
1. Retrieve details of all books in the library – id, title, name of publisher,
authors, number of copies in each branch, etc.
2. Get the particulars of borrowers who have borrowed more than 3 books, but
from Jan 2017 to Jun 2017.

Page. 6
3. Delete a book in BOOK table. Update the contents of other tables to
reflect this data manipulation operation.
4. Partition the BOOK table based on year of publication. Demonstrate its
working with a simple query.
Create a view of all books and its number of copies that are currently
available in the Library
Module-3
Basic SQL: SQL Data Definition and Data Types, Specifying Constraints in
SQL, Basic Retrieval Queries in SQL, INSERT – DELETE and UPDATE
Statements in SQL, Additional features in SQL
More SQL: Complex Queries, Triggers, Views and Schema Modification:
More Complex SQL Retrieval Queries, Specifying Constraints as Assertions and
actions as Triggers, Views (Virtual Tables)
in SQL, Schema Change Statements in SQL

Laboratory component:
Create Schema, insert at least 5 records for each table and add appropriate
constraints for the following Order Database using ORACLE or MySQL DBMS
under LINUX/Windows environment.

SALESMAN(Salesman_id, Name, City, Commission) 10 Apply

CUSTOMER(Customer_id, Cust_Name, City, Grade, Salesman_id)
ORDERS(Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)

Write SQL queries to

1. Count the customers with grades above Bangalore’s average.
2. Find the name and numbers of all salesman who had more than one
customer.
3. List all the salesman and indicate those who have and don’t havecustomers
in their cities (Use UNION operation.)
4. Create a view that finds the salesman who has the customer with the
highest order of a day.
Demonstrate the DELETE operation by removing salesman with id 1000. All his
orders must also be deleted.
Module-4
Basics of Functional Dependencies and Normalization for Relational
Database: Functional Dependencies, Armstrong’s axioms for FD's, Equivalent
Decompositions, closure of a set of FDs, minimal covers, Normal forms Based on
Primary Keys, General Definitions of Second and Third Normal Forms, Boyce-
Codd Normal Forms

Laboratory component:
Create Schema, insert at least 5 records for each table and add appropriate
constraints for the following Company Database using ORACLE or MySQL
DBMS under LINUX/Windows environment. 10 Analyze

EMPLOYEE (SSN, Name, Address, Sex, Salary, Super SSN, D No)

DEPARTMENT ( D No, D Name, Mgr. SSN, Mgr. Start Date)
DLOCATION(D No,D Loc)
PROJECT (P No, P Name, P Location, D No) WORKS_ON(SSN,
P No, Hours)

Write SQL queries to

1. Make a list of all project numbers for projects that involve an employee whose
Page. 7
last name is ‘Scott’, either as a worker or as a manager of the department that
controls the project.
2. Show the resulting salaries if every employee working on the ‘IoT’ project is
given a 10 percent raise.
3. Find the sum of the salaries of all employees of the ‘Accounts’ department,
as well as the maximum salary, the minimum salary, and the average salary in
this department
4. Retrieve the name of each employee who works on all the projects controlled
by department number 5 (use NOT EXISTS operator).
For each department that has more than five employees, retrieve the department
number and the number of its employees who are making morethan Rs. 6,00,000.
Module-5
Introduction to Transaction Processing –Introduction to Transaction
Processing, Transaction and System Concepts, Desirable Properties on
Transactions

Concurrency Control Techniques: Transactions and Schedules, Serializability and

Recoverability, Precedence Graphs, Concurrency, Lock Based Protocols, 2PL, Strict
2PL Protocols, Deadlocks - Detection and Prevention
10 Analyze
NoSQL: SQL v/s NoSQL, The Emergence of NoSQL, BASE
Properties, Data Models: Relationships, Graph Database, Schema less
Database.

Laboratory component:
Implement aggregation and indexing with suitable example using MongoDB

Course outcomes: The students will able to:

Understand the Database System Concepts along with Data Modeling Using the Entity-
CO 1:
Relationship (ER) Model
Apply the concepts of relations on RDBMS, constraints, joints using relational algebra
CO 2:
operators.
CO 3: Apply Structured Query Language for database manipulation.

CO 4: Analyze functional dependencies to normalize relations of relational database

Analyze transactions processing, schedules protocols, serializability issues, deadlocks in
CO 5:
DBMS and concepts of NoSQL with its advantages

Text Books:
1. Ramez Elmasari, Shamkant B Navathe “Fundamentals of Database Systems”, Pearson,Seventh
Edition 2017.
2. “Database System Concepts”, Silberschatz, H Korth, S Sudarshan, 6th Edition, McGraw -Hill, 2010
Reference Books:
1. Pramod J Sadalage, Martin Fowler, “NOSQL Distilled”, Pearson, 2013

Page. 8
 Assessment Process
CIA (50) SEA
PCI CIA SEA Conduction: 100 M
I II
Reduced to: 50 M
50 50
Written
Average of two tests – 50 marks
Test Five questions with
scaled down to 15 marks
Conduction

each of 20 marks (with

Assignment Average of 2 Assignments – 10M internal choice).
50 50 Student should answer
Weekly Assessment – 10 Marks
one full question from
IA test – 15 Marks
Practical each module
(IA test to be conducted for 50 M
and scaled down to 15M)
Total – 50 Marks Total – 50 Marks

i) CIA: 50%
IA Test (Theory): 2 IA tests - each of 50 Marks –
Theory Average of 2 tests scaled down to 15 Marks 25 Marks
Assignment : 2 Assignments – each of 10 marks
Weekly Assessment – 10 Marks
Lab 25 Marks
Practical test (1) - 15 marks
Total 50 Marks

ii) SEA : 50%

Question Paper:
5 questions to answer, each of 20 Marks
2 questions from each module with internal choice 20 M x 5 = 100 M
Theory Exam
Student should answer one full question from each Reduced to 50 M
module
Total 50 Marks

Page. 9
 BNM Institute of Technology
An Autonomous Institution under VTU
Department of Information Science and Engineering
SEMESTER–IV
Design and Analysis of Algorithms
Subject Code: 22ISE144 L:T:P:J: 3:0:2:0 CIE Marks: 50
Credits: 4 SEE Marks: 50
Total Number of Lecture Hours 50 SEE Duration: 3 Hours
Course objectives:
 Analyze the asymptotic performance of algorithms.
 To understand the concept of designing an algorithm.
 Synthesize efficient algorithms in common engineering design situations.
Analyze the efficiency of programs based on time complexity.
Blooms
Teaching
Module 1 Cognitive
Hours
Levels
Introduction: Notion of algorithm, Fundamentals of Algorithmic Problem Solving,
Fundamentals
of the Analysis of Algorithmic Efficiency: Analysis frame work, Asymptotic
Notationsand BasicEfficiency Classes, Mathematical Analysis of Non-recursive and
Recursive Algorithms.
Practical Programs:
1. Implement Coin Changing problem method and find the time required.
2. Write a program to find maximum profit using Knapsack technique.
3. Implement Job Sequence problem using Greedy method. Apply
10 Analyze
bruteforce/divide and conquer technique to recursively implement the
following concepts:
a. Linear Search or Binary Search.
b. To find the maximum and minimum from a given list of n elements
usingBrute Force Method.
4. There are 5 books in the shelf, find the number of ways to select 3 books
from 5books on the shelf using the NCR with recursion.
5. Find the next three terms of the sequence 15, 23, 38, 61, … Fibonacci series of
the given number using recursion.
Module 2
Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute Force
String Matching
Divide and Conquer: General method, Binary search, Recurrence equation for
divide and conquer, Finding the Maximum and Minimum, Merge sort, Quick sort,
Strassen’s matrix multiplication. Decrease and Conquer Approach: Topological
Sort.
1. Practical Programs:
2. Implement the Selection sort algorithm.
10 Apply
3. Implement Bubble sort algorithm.
4. Implement the Sequential Search algorithm.

Page. 10
 5. Write a program to search a key in a given set of elements using Binary
search method and find the time required to find the key.
6. Write a program to find Maximum and Minimum using divide and
conquer technique and find the time required to find the elements.

required sort the elements. Plot a graph of number of elements versus time
taken. Specify the time efficiency class of this algorithm.
7. Implement Topological sort using source removal method find the time required
to sort the elements.
Module 3
Greedy Method: General method, Coin Change Problem, Knapsack Problem, Job
sequencing with deadlines. Minimum cost spanning trees: Prim’s Algorithm,
Kruskal’s Algorithm. Single source shortestpaths: Dijkstra's Algorithm. Optimal
Tree problem: Huffman Trees and Codes.
Practical Programs:
1. Implement Coin Changing problem method and find the time required.
10 Apply
2. Write a program to find maximum profit using Knapsack technique.
3. Implement Job Sequence problem using Greedy method.
4. Implement Prim’s algorithm and Find Minimum Cost Spanning Tree of a given
connected undirected graph.
5. Implement Kruskal’s algorithm and Find Minimum Cost Spanning Tree of a
given connected undirected graph.
6. Implement Dijkstra’s algorithm find shortest paths to other vertices from a given
vertex in a weighted connected graph.

Module 4
Dynamic Programming: General method with Examples, Multistage Graphs.
Transitive Closure:Warshall’s Algorithm, All Pairs Shortest Paths: Floyd's
Algorithm, Optimal Binary Search Trees, Knapsack problem, Bellman-Ford
Algorithm, Travelling Sales Personproblem, Reliability design.
Practical Programs: 10 Apply
1. Implement all-pairs shortest paths problem using Floyd’s algorithm.
2. Implement all-pairs shortest paths problem using Warshal’s algorithm.
3. Implement 0/1 Knapsack using Dynamic Programming.
4. Implementation of Bellman Ford Algorithm using a directed graph.
5. Implement Travelling Sales man problem using Dynamic Programming.

Module 5

Page. 11
Backtracking: General method , N-Queens problem, Sum of subsets problem, Graph
coloring,
Hamiltonian cycles. Programme and Bound: Assignment Problem, Travelling
SalesPerson problem, 0/1 Knapsack problem: LC Programme and Bound solution,
FIFOProgramme and Bound solution. NP- Complete and NP-Hard problems:
Basic concepts, nondeterministic algorithms, P, NP, NP-Complete and NP-Hard
classes Practical Programs: 10 Analyze
1. Implementation of N Queen Problem using Backtracking technique.
2. Implementation of SUM-SUBSET Problem.
3. Design and implement to find all Hamiltonian Cycles in a connected undirected
Graph G of n vertices using the backtracking principle.
4. Implementation Assignment Problem using Backtracking technique.
5. Implementation of Travelling Sales Man Problem using Branch and Bound
method.
6. Implementation of Knapsack problem using Branch and Bound method.

Course outcomes: The students should be able to:

CO1 Apply and Analyze the asymptotic runtime complexity of algorithms by using mathematical
relations that helps to identify them in specific instances
CO2 Apply and solve problems using brute force, divide and conquer techniques
CO3 Apply various problem solving methodologies such as greedy, decrease and conquer to solve a
given problem.
CO4 Apply the dynamic programming to estimate the computational complexity of different
algorithms.
CO5 Apply and Analyze the efficient algorithm design approaches in a problem specific manner in
terms of space and time complexity

Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 3 rd
Edition, PHI.
2. Introduction to the design and analysis of algorithms, by Anany Levitin, 3rd Edition, Pearson Education, 2011.

3. Data Structures & Algorithms using C, R.S. Salaria, 5th Edition, Khanna Publishing.
4. Computer Algorithms, by Horowitz E., Sahani S., Rajasekharan S., 2nd Edition, UniversitiesPress, 2008

Web Links:
https://www.cs.duke.edu/courses/fall08/cps230/Book.pdf.
https://www.tutorialspoint.com/design_and_analysis_of_algorithms/design_and_analysis_of
_algorithms_tutorial.pdf.

Page. 12
Assessment Process
SEA
CIA (50) Conduction: 100 M
PCI CIA SEA Reduced to: 50 M
I II
PART A PART B
30 30
Conduction

IA Test
Average of two tests – 30 M
50 50 Continuous 30 Marks 70 Marks
Weekly Assessment -20 marks
Assessment
Total – 50 Marks Total – 50 Marks

i) CIA: 50%

IA Test: 2 IA tests - each of 30 Marks Average of 2 tests – 30 M

Practical
Lab record – 10 Marks
20 Marks
Performance – 05 Marks
Viva – 05 Marks
Total 50 Marks

ii) SEA : 50%

Question Paper:
Theory part 5 questions to answer each of 6 Marks
2 questions from each module with internal choice
6 M x 5 = 30 Marks
Student should answer one full question from each
module
Write up - 20 Marks
Execution part Conduction - 40 Marks 70 Marks
Viva-Voce - 10 Marks
100 Marks
Total
Reduced to 50 M

Note:
 No Assignment and AAT

Page. 13
 B.N.M. Institute of Technology
An Autonomous Institution under VTU
Department of Information Science and Engineering
SEMESTER– IV
Python Programming and its Application
Pre requisite: Python Programming
Subject Code: 22ISE145 L:T:P:J: 0:0:2:2 CIE Marks: 50
Credits: 2 SEE Marks: 50
Total Number of Lecture Hours 25 SEE Duration: 3 Hours
Course objectives:
1. Take a new computational problem and develop a plan to solve it through problem understanding and
decomposition.
2. Follow a design creation process that includes specifications, algorithms, and testing.
3. Code, test, and debug a program in Python, based on your design

Teaching
Module – 1
Hours
Python Basics, Entering Expressions into the Interactive Shell, The Integer, Floating-Point, and
String Data Types, String Concatenation and Replication, Storing Values in Variables, Flow
control, Boolean Values, Comparison Operators, Boolean Operators, Mixing Boolean and
Comparison Operators, Elements of Flow Control, Program Execution, Flow Control Statements,
Importing Modules, Ending a Program Early with sys.exit(). 5
List of Programs
1. Write a python program to check whether the given string is palindrome or not.
2. Demonstrate a python code to implement abnormal termination?
3. Demonstrate a python code to print try, except and finally block statements

Module – 2
Functions, def Statements with Parameters, Return Values and return Statements, The None Value,
Keyword Arguments and print(), Local and Global Scope, The global Statement, Exception
Handling, A Short Program: Guess the Number.
List of Programs
1. Write a python program to check whether the given string is palindrome or not.
2. Write a program to create a menu with the following options 1. TO PERFORM ADDITITON 5
2. TO PERFORM SUBTRACTION 3. TO PERFORM MULTIPICATION 4. TO PERFORM
DIVISION Accepts, users input and perform the operation accordingly. Use functions with
arguments.
3.Write a python program to open a file and check what are the access permissions acquired
bythat file using os module?

Module – 3
Lists, The List Data Type, working with Lists, Augmented Assignment Operators, Methods,
Example Program: Magic 8 Ball with a List, List-like Types: Strings and Tuples, References,
Dictionaries and Structuring Data, The Dictionary Data Type, Pretty Printing, Using Data
Structures to Model Real-World Things.
List of Programs 5
1. Create a list and perform the following methods 1) insert() 2) remove() 3) append() 4) len()
5) pop() 6) clear()
2. Create a dictionary and apply the following methods 1) Print the dictionary items 2) access
items 3) use get() 4)change values 5) use len()
Page. 14
 Module – 4
Classes and objects, Programmer-defined types, Attributes, Rectangles, Instances as return values,
Objects are mutable, Copying, Classes and functions, Time, Pure functions, Modifiers,
5
Prototyping versus planning, Classes and methods, Object-oriented features, Printing objects,
Another example, A more complicated example,The init method, The str method,
Operator overloading, Type-based dispatch, Polymorphism, Interface and
implementation,Inheritance, Card objects, Class attributes, Comparing cards, Decks, Printing the
deck, Add, remove, shuffle and sort,Inheritance, Class diagrams, Data encapsulation

List of Programs
1. Write a python Program to call data member and function using classes and objects.
2. Write a python program, which accepts the radius of a circle from user and computes the area
(use math module).
3. Write a python program to create a package (college), sub-package (alldept), modules (it,cse)
and create admin and cabin function to module?
Module – 5
NumPy and Pandas
Introduction, creating Array in NumPy, Accessing of Array Elements, NumPy Array Shape,
Iterating Arrays, NumPy Built in Functions, NumPy ufuncs, Creating own ufunc, Arithmetic
Functions, Rounding Decimals, Finding LCM and GCD.
Introduction to Pandas, Series, Key/Value as Series, Data Frames, Loading a file into Data Frame,
Viewing Data, Cleaning Data, Plotting.
List of Programs
1. Using a numpy module create an array and check the following:
1. Type of array 2. Axes of array 3. Shape of array 4. Type of elements in array 5
2. Using a numpy module create array and check the following:
1. List with type float 2. 3*4 array with all zeros 3. From tuple 4. Random values
3. Write a python code to read a csv file using pandas module and print the first and last five
lines of a file.
4. Using a numpy module create array and check the following:
1. Reshape 3X4 array to 2X2X3 array
2. Sequence of integers from 0 to 30 with steps of 5
3. Flatten array 4. Constant value array of complex type.

MINI PROJECT
 Sample Python Projects:
Project 1: Dice Rolling Simulator
This is one of the interesting python projects and will generate a random number each dice the 25
program runs, and the users can use the dice repeatedly for as long as he wants. When the user rolls
the dice, the program will generate a random number between 1 and 6 (as on a standard dice).The
number will then be displayed to the user. It will also ask users if they would like to roll the dice
again. The program should also include a function that can randomly grab a number within 1 to 6
and print it.

Project 2: Fantasy Cricket game:

Create a Fantasy Cricket game in Python. The game should have all the features displayed in the
mock-up screens in the scenario. To calculate the points for each player, you can use
rules similar to the sample rules displayed below.

Page. 15
Project 3: Contact Book:
Everyone uses a contact book to save contact details, including name, address, phone number, and
even email address. The main objective of this project is to generate a contact book using python
where users can add a new contact, edit, or delete existing contacts and view the details of all their
contacts. The application should also allow users to update contact information, delete contacts, and
list saved contacts

Project 4: Spin a Yarn:

The program first prompts the user to enter a series of inputs. These can be an adjective, a
preposition, a proper noun, etc. Once all the inputs are in place, they are placed in a premade story
template using concatenation. In the end, the full story is printed out to read some misintended
madness!

Project 5: Rock, Paper, Scissors

A 5-minute stint of rock, paper, scissors with the computer and designed by you. We again use the
random function here. You make a move first and then the program makes one. To indicate the
move, you can either use a single alphabet or input an entire string. A function will have to be set up
to check the validity of the move.

Course Outcomes:
22ISE145.1: Understand the basic concepts of python programming through the Mooc
courses
22ISE145.2: Create Projects using python programming for different domains.
References

1. Al Sweigart,“Automate the Boring Stuff with Python”,1stEdition, No Starch

Press, 2015.(Available under CC-BY-NC-SA license at
https://automatetheboringstuff.com/) (Chapters 1 to 18)
2. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, 2nd
Edition, GreenTea Press, 2015. (Available under CC-BY-NC license
http://greenteapress.com/thinkpython2/thinkpython2.pdf) (Chapters 13, 15, 16, 17, 18)
(Download pdf/html files from the above links)
3. Programming Python, Mark Lutz, O'Reilly Media, Edition 2010.
4. Gowrishankar S, Veena A, “Introduction to Python Programming”, 1st Edition,
CRCPress/Taylor & Francis, 2018. ISBN-13: 978-0815394372.
5. Jake VanderPlas, “Python Data Science Handbook: Essential Tools for Working with
Data”,1stEdition, O’Reilly Media, 2016. ISBN-13: 978-1491912058.
6. Charles Dierbach, “Introduction to Computer Science Using Python”, 1st Edition,
Wiley IndiaPvt Ltd, 2015. ISBN-13: 978-8126556014.

Page. 16
Assessment Process
SEA
PBL CIA SEA CIA (50) Conduction: 100 M
Reduced to: 50 M
I IA II IA
Conduction

Theory 25 25
Project
Average of 2 tests – 25 M Assessed for 100 marks
50 50
Weekly Assessment reduced to 50 Marks
Practical (Record/Project) – 10 Marks
Lab IA test – 15 Marks
Total – 50 Marks Total – 50 Marks

i) CIA: 50%
Theory - 2 IA tests - Each of 25 Marks 25 Marks
Practical
Weekly Assessment - Lab record/Project – 10 Marks 25 Marks
Lab IA test – 15 Marks
Total 50 Marks

ii) SEA : 50%

Project Write up – 10 Marks

Project report – 25 Marks 100 Marks
Presentation & Demonstration - 50 Marks Reduced to 50 Marks
Viva-Voce – 15 Marks
Total 50 Marks

Page. 17
 B.N.M. Institute of Technology
An Autonomous Institution under VTU
Semester: III / IV
COURSE: CONSTITUTION OF INDIA AND
PROFESSIONAL ETHICS
Course Code: 22CIP146 L:T:P:J: 1:0:0:0 CIA Marks: 50

Credits: 1 SEA Marks: 5 0

15 hrs
Hours: SEA Duration: 2Hrs

Course Learning Objectives: The students will be able to

1 know the fundamental political codes, structure, procedures, powers, and duties of Indian government
institutions, fundamental rights, directive principles, and the duties of citizens

2 know the Indian top civil service positions and the exams conducted by UPSC and SPSC for the same

3 Understand engineering ethics and their responsibilities; identify their individual roles and ethical
responsibilities towards society.
MODULE 1: Introduction to Indian Constitution RBT Hrs
The Necessity of the Constitution, Introduction to Indian Constitution, The
Making of the Constitution, Role of Constituent Assembly, Preamble and
Salient features of the Constitution of India, Fundamental Rights and its
Restriction and limitations in different complex situations, Directive Principles 1,2,3 3
of State Policy, Fundamental Duties.

MODULE 2: System of Government, Central Government, State

RBT Hrs
Government
System of Government-Parliamentary System, Federal System.
Central Government-Basic details, Powers and Functions of Union Executive.
Parliament- LS and RS (Composition, Duration, Membership and Presiding
officers of Parliament and their functions). Leaders in Parliament (Leader of the
House and Leader of the Opposition). Sessions of Parliament (Summoning,
1,2,3 3
Adjournment, Adjournment Sine Die, Prorogation, Dissolution). Quorum of
House, Language in Parliament, Joint sitting of two Houses. State Government-
Basic details, Powers and Functions of State Executive. State Legislature
(Composition, Duration, Membership and Presiding officers of Parliament and
their functions).
MODULE 3: Judiciary, Amendments and Emergency Provisions RBT Hrs
Supreme Court, High Court, Judicial Review, Judicial Activism. Methods in
Constitutional Amendments (How and Why). Types of Emergencies and its 1,2,3 3
Consequences, Recent Amendments to the Constitution.
MODULE 4: Elections, Constitutional and Non Constitutional
RBT Hrs
Bodies
Elections- Election Commission of India, Electoral Process.
Constitutional Bodies- Election Commission, Union Public Service
Commission, State Public Service Commission, Goods and Service Tax
Council.
Non Constitutional Bodies- Central Information Commission, State Information
1,2,3 3
Commission.
Page. 18
 MODULE 5: Professional Ethics RBT Hrs
Scope & Aims of Engineering & Professional Ethics, Positive and Negative
Faces of Engineering Ethics, Responsibilities in Engineering, the impediments
1,2,3 3
to Responsibility. Trust and Reliability in Engineering, Risks, Safety and
liability in Engineering, Clash of Ethics, IPRs (Intellectual Property Rights)

Course outcome: On completion of this course, students will be able to,

CO1: Have constitutional knowledge and legal literacy.
CO2: Have knowledge on All India Services and State Civil Services.
CO3: Understand Engineering and Professional Ethics and responsibilities of Engineers.

Reference Books
Suggested Learning Resources:

1. Title of the Book - Indian Polity

Name of the Author - M Lakshmikanth
Name of the Publisher-Mc Graw Hill Education
Edition and Year- 2019
2. Title of the Book - Engineering Ethics
Name of the Authors - M. Govindarajan, S.Natarajan, V.S. Senthilkumar
Name of the Publisher- Prentice-Hall
Edition and Year-2004
3. Durga Das Basu (DD Basu): “Introduction to the Constitution on India”, (Students Edition.)
Prentice –Hall EEE, 19th / 20th Edn., (Latest Edition) or 2008.
4. Shubham Singles, Charles E. Haries, and Et al : “Constitution of India and Professional
Ethics” byCengage Learning India Private Limited, Latest Edition – 2018.

5. M.Govindarajan, S.Natarajan, V.S.Senthilkumar, “Engineering Ethics”, Prentice –Hall

of IndiaPvt. Ltd. New Delhi, 2004
6. M.V.Pylee, “An Introduction to Constitution of India”, Vikas Publishing, 2002.
7. Latest Publications of NHRC - Indian Institute of Human Rights, New Delhi.

Web Links and Video Lectures

www.unacademy.com/lesson/future-perfect-
tense/YQ9NSNQZ https://successesacademy

Question paper pattern for SEA and CIA.

• The SEA question paper will be set for 50 marks and the pattern of the question paper will
be objective type (MCQ).
• The CIA question paper will be set for 50 marks and the pattern of the question paper will
be objective type (MCQ).
Final Marks = CIA + SEA = 50+50 = 100 Marks
Page. 19
 Class Internal Assessment

IA1 Objective type Average of 2 IA will

questions be taken
50Marks 50Marks
IA2 Objective type
questions
50Marks
Total CIA 50 Marks

Semester End Assessment

Semester end Exam Objective type 50 Marks
questions
50Marks
Total SEA 50 Marks

Final Marks = CIA + SEA = 50+50 = 100 Marks

Page. 20
Page. 21
Page. 22
Page. 23