VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY HYDERABAD

B.TECH. II YEAR
COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

III SEMESTER R22

Course
Title of the Course L T P/D CH C
Code

22PC1CS202 Design and Analysis of Algorithms 3 1 0 4 4

Object Oriented Programming Through
22PC1IT201 3 0 0 3 3
Java
22PC1AM201 Database Management systems 3 0 0 3 3

22HS1MG201 Engineering Economics and Accountancy 3 0 0 3 3

Mathematical Foundations for Computer
22PC1DS201 3 0 0 3 3
Science
Object Oriented Programming Through
22PC2IT201 0 0 2 2 1
Java Laboratory
Database Management systems
22PC2AM201 0 0 2 2 1
Laboratory
22ES2DS101 Python Programming Laboratory 0 0 2 2 1

22SD5DS202 Field Project 0 0 2 2 1

22MN6HS102 Environmental Science 2 0 0 2 0

Total 17 1 8 26 20

IV SEMESTER R22
Course
Title of the Course L T P/D CH C
Code
Digital Logic Design and Computer
22PC1DS202 3 0 0 3 3
Organization
22BS1MT205 Statistical inference and Queuing Theory 2 1 0 3 3

22PC1CS201 Software Engineering 3 0 0 3 3

22PC1IT202 Operating Systems 3 0 0 3 3

Mathematical Foundations for Data
22PC1DS203 3 0 0 3 3
Science
Python for Statistical Analysis and Software
22PC2DS211 0 0 2 2 1
Engineering Laboratory
22PC2IT202 Operating Systems Laboratory 0 0 2 2 1

22SD5DS201 Data Visualization 0 0 2 2 1

22PW4DS201 Design Thinking 0 0 4 4 2

22MN6HS201 Intellectual Property Rights 2 0 0 2 0

Total 16 1 10 27 20

L – Lecture T – Tutorial P – Practical D – Drawing CH – Contact Hours/Week

C – Credits SE – Sessional Examination CA – Class Assessment ELA – Experiential Learning Assessment
SEE – Semester End Examination D-D – Day to Day Evaluation LR – Lab Record
CP – Course Project PE – Practical Examination

1
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC1CS202) DESIGN AND ANALYSIS OF ALGORITHMS

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 1 4 30 5 5 60 100

COURSE PRE-REQUISITES: Programming, Data Structures, Discrete Mathematics.

COURSE OBJECTIVES:
To reinforce algorithms analysis methods
To ability to analyse running time of an algorithm
To understand different algorithm design strategies
To apply algorithms design techniques to solve computational problems.

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Analyse running time of an algorithm using asymptotic analysis
CO-2: Apply appropriate algorithm design techniques to develop efficient algorithms
for solving computational problems
CO-3: Compare different algorithms for their efficiency and choose an appropriate
data structure
CO-4: Employ graphs to model engineering problems, when appropriate and
analyse time complexity
CO-5: Describe and identify the classes P, NP, NP-Hard and NP Complete problems
and formulate solutions using standard approaches

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 2 2 2 3 - - - 2 - - - 2 3 - -
CO-2 3 2 3 3 3 2 2 3 2 1 3 3 - 3 3
CO-3 2 2 2 3 - - - 2 - - - 2 - 3 -
CO-4 3 3 2 3 1 1 1 2 1 1 1 3 3 - 3
CO-5 3 3 3 3 - - - 1 1 1 2 2 3 - 3

UNIT-I:
Performance Analysis: Characteristics of Algorithm. Analysis of Algorithm: Best,
Average and Worst-Case behaviour, Asymptotic Analysis– Big oh, Omega, Theta
notations and Little oh, Little omega notations, Time and Space Trade-Offs, Analysis of
Recursive Algorithms through Recurrence Relations, Substitution Method, Recursion
Tree Method and Masters’ Theorem.

UNIT-II:
Fundamental Algorithmic Strategies: Divide and conquer General method,
applications-Binary search, Quick sort, Merge sort, Strassen‘s matrix multiplication.
Greedy method: General method, applications- Job sequencing with deadlines, 0/1

2
knapsack problem, Minimum cost spanning trees, Single source shortest path
problem, Huffman Codes.
Brute force, KMP Pattern Matching Algorithms.

UNIT-III:
Dynamic Programming: General method, Principle of optimality, applications-
Multistage graphs, Matrix chain multiplication, Optimal binary search trees, 0/1
knapsack problem, All pairs shortest path problem, Travelling sales person problem,
Reliability design.

UNIT-IV:
Backtracking Method: Applications- N-Queen problem, Sum of subsets problem,
Graph coloring, Hamiltonian cycles. Branch and Bound Method: Applications -
Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution,
FIFO Branch and Bound solution

UNIT-V:
Graph Algorithms: Depth First Search (DFS) and Breadth First Search (BFS), Topological
sorting, Connected and Bi Connected Components, Network Flow Algorithm.
Tractable and Intractable Problems: P, NP, NP-complete and NP-hard. Cook’s
theorem, Randomized Algorithms.

TEXT BOOKS:
1. Fundamental of Computer Algorithms, Ellis Horowitz, Satraj Sahni and
Rajasekharam, Second Edition, Galgotia Publications
2. Introduction to Algorithms, Thomas H.Cormen, Charles E.Lieserson, Ronald L.Rivest
and Clifford Stein, 4th Edition, MIT Press/McGraw-Hill

REFERENCES:
1. Algorithm Design, Jon Kleinberg and EvaTardos, 1st Edition, Pearson
2. Algorithm Design: Foundations, Analysis, and Internet Examples, Michael T.
Goodrich and Roberto Tamassia, Second Edition, Wiley
3. Introduction to the Design and Analysis of Algorithms,Anany Levitin, 3rd Edition,
Pearson Publications
4. The Design and Analysis of Computer Algorithms, A. Aho, J. Hopcroft and J. Ullman

ONLINE RESOURCES:
1. http://nptel.ac.in/courses/106101060/
2. https://www.cmi.ac.in/~madhavan/teaching.html
3. https://www.ics.uci.edu/~eppstein/161/960312.html
4. https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/

3
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC1IT201) OBJECT ORIENTED PROGRAMMING THROUGH JAVA

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To understand object oriented concepts and problem solving techniques
• To obtain knowledge about the principles of inheritance and polymorphism
• To implement the concept of packages, interfaces, exception handling and
concurrency mechanism
• To understand the Java Database Connectivity Architecture

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Solve real-world problems using Object Oriented Programming Paradigm
CO-2: Apply code reusability through inheritance, packages and interfaces
CO-3: Solve problems using java collection framework and I/O classes
CO-4: Develop applications by Generics for better performance use Multithreading
CO-5: Build applications using the JDBC API to access the database

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 2 3 3 2 2 2 2 2 1 3 3 2 1
CO-2 3 2 2 2 2 2 1 1 1 2 2 1 2
CO-3 3 2 3 2 2 2 2 2 2
CO-4 3 3 2 2 2 2 1 1 1 2 3 2 1
CO-5 3 3 2 2 3 2 1 1 2 3 2 2

UNIT-I:
Object Oriented Programming Paradigm: Introduction to OOP Paradigm, Evolution of
Java, Difference between JDK, JRE, and JVM, Classes, Objects, Data Types, Variables,
Comments, Type Conversion and Casting, Operators, Symbolic Constants, Control
Statements, Scope of Variables, Constructors, this keyword, Overloading, Command
line Arguments, Arrays, String Class, Wrapper classes.

UNIT-II:
Inheritance, Packages, Interfaces and Other Topics: Understanding static, Introducing
Nested and Inner classes, Access Modifiers, Varargs: variable-Length Arguments,
Lambda Expressions, garbage collection- finalize.
Inheritance: Basics, Using super, creating a multi level hierarchy, when constructors
are executed, method overriding, polymorphism - dynamic method dispatch, using
abstract class, final with Inheritance, object class.
Packages and Interfaces: Packages, Access protection, Importing Packages,
Interfaces, Default Interfaces, Default interface methods, Use static methods in an
Interface,

4
UNIT-III:
Exception Handling: Exception handling Fundamentals, Exception Types, Using try and
catch, throw, throws, finally, Java Custom Exception, Catch Multiple Exceptions, Try-
with Resources, Exceptions propagation, Chained Exceptions.
I/O, Generics and Other Topics: The Streams (Byte, Character, and Standard), Output
Stream and InputStream classes, Reading and Writing Files, Random access file
operations, Generics: The general form of a generics class, creating a generic
method, generics interfaces, Serialization, Annotations,, Auto Boxing.

UNIT-IV:
Multithreaded Programming: Java Thread life cycle model – Thread creation - Thread
Exceptions - Thread Priority – Synchronization - Runnable Interface - Interthread
Communication - Deadlock - Suspending, Resuming and stopping threads.
Java AWT: AWT Hierarchy, Event Delegation Model, Adapter classes, Listeners, Layout
management, AWT Components, Simple UI for Email registration.

UNIT-V:
The Collection Framework: Collection Objects – Sets, Lists, Queues, Maps – ArrayList-
LinkedList - Vector– HashSet– LinkedHashSet– TreeSet– HashMap– Hashtable.
Retrieving Elements from Collections – Enumeration, Iterator, List Iterator – String
Tokenizer and Arrays Class – Sorting using Comparable and Comparator.
Java Database Connectivity: Introduction to JDBC, Types of Drivers, Basic steps in
developing JDBC applications, JDBC classes and Interfaces, CRUD operations with
JDBC, Transaction Management, Stored Procedures.

TEXT BOOKS:
1. Java The complete reference, 9th Edition Herbert Schildt, McGraw Hill Education
(India) Pvt. Ltd.
2. Java How to Program, 10th Edition, Paul Dietel, Harvey Dietel, Pearson Education

REFERENCES:
1. Core Java Volume -1 Fundamentals Cay S. Horstmann, Pearson Education
2. Java Programming for core and advanced learners, Sagayaraj, Dennis, Karthik
and Gajalakshmi, University Press
3. Introduction to Java programming, Y. Daniel Liang, Pearson Education
4. Object Oriented Programming through Java, P. Radha Krishna, University Press

ONLINE RESOURCES:
1. https://www.w3schools.com/java/java_oop.asp
2. http://peterindia.net/JavaFiles.html

5
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC1AM201) DATABASE MANAGEMENT SYSTEMS

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE PRE-REQUISITES: Basic computer programming skills

COURSE OBJECTIVES:
• To introduction of Data Base Management concepts and to give the description
of structure of Data Base systems
• To understand concepts of ER model and model the data base for the given
scenarios and prepare the database through normalization
• To know the features of various models of data and query representations
• To introduce the concepts and protocols related to transaction management and
understand the concepts of data storage

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Appreciate the underlying concepts of database system architecture and
Design E-R models to represent simple database application scenarios
CO-2: Convert the ER-model to relational tables, populate relational database and
formulate SQL queries on data
CO-3: Improve the database design by normalization
CO-4: Apply and relate the concept of transaction, concurrency control and
recovery in database
CO-5: Familiar with basic database storage structures and access techniques using
Indexing, hashing including B tree methods

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 1 3 2 3 2 2 1 1 2 3
CO-2 2 2 3 3 3 2 3 1 2 2 3
CO-3 2 3 1 3 1 2 1 1 3 3
CO-4 3 2 1 1 1 3 1 2 2
CO-5 2 2 1 1 1 3 2 2 2

UNIT – I:
Introduction to Databases and Database Management System: Database system
Applications, Advantages of DBMS over File System, Data Models, Instances and
schema, View of Data, Database Languages –DDL, DML, DCL, Database Users and
Administrator, Database System Architecture.
Database Design and ER diagrams: Attributes and Entity Sets, Relationships and
Relationship Sets, Constraints, Keys, Design Issues, Entity-Relationship Diagram,
Extended E-R Features, Database Design with ER model, Database Design for a
schema.

6
UNIT – II:
Introduction to the Relational Model: Structure of RDBMS, Integrity Constraints over
Relations, Querying Relational Data, Relational Algebra and Relational Calculus.
Introduction to SQL: Data Definition commands, Data Manipulation Commands, Basic
Structure, Set operations, Aggregate Operations, Join Operations, Sub queries and
correlated queries, views, Triggers, Cursors

UNIT – III:
Functional Dependencies: Introduction, Basic Definitions, Trivial and Non trivial
dependencies, closure of a set of dependencies, closure of attributes, irreducible set
of dependencies.
Schema Refinement in Database Design: Problems Caused by Redundancy,
Decompositions – Problem Related to Decomposition, Lossless Join Decomposition,
Dependency Preserving Decomposition, FIRST, SECOND, THIRD Normal Forms, BCNF,
Multivalued Dependencies, FOURTH Normal Form.

UNIT – IV:
Transaction Management: Transaction state, Implementation of atomicity and
Durability, Concurrent executions – Serializability, Recoverability.
Concurrency Control: Lock Based Protocols, Timestamp Based Protocols, Validation
Based Protocols, Multiple Granularity, Dead Lock Handling
Recoverability: Failure Classification, Storage Structure, Recovery and Atomicity- Log
Based recovery, Recovery with concurrent transactions, Checkpoints.

UNIT – V:
File Organization: Organization of records in file, Data Dictionary Storage.
Indexing and Hashing: Basic Concepts, Ordered Indices, B tree Index files, B+ tree
index files, Static Hashing, Dynamic Hashing – Comparison of Indexing with Hashing.

TEXT BOOKS:
1. Database System Concepts, Silberschatz, Korth, Sudarshan, 7th Edition,
McGrawHill
2. Introduction to Database Systems, C.J.Date, Pearson Education

REFERENCES:
1. Database Management Systems, Raghu Ramakrishnan, Johannes Gehrke, Tata
McGraw-Hill
2. Fundamentals of Database Systems, Elmasri Navathe Pearson Education
3. Database Systems Design, Implementation, and Management, Peter Rob & Carlos
Coronel, 7th Edition, Cengage Learning

ONLINE RESOURCES:
1. https://www.w3schools.com/sql/default.asp
2. https://www.javatpoint.com/dbms-tutorial

7
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22HS1MG201) ENGINEERING ECONOMICS AND ACCOUNTANCY

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To understand the basic concepts of economics and different forms of business
organizations
• To create awareness on basics of business economics and to analyse the
concepts of demand and supply
• To describe each stage of product life cycle with the help different costs and their
role in maintaining optimum cost of production and overall profitability by
considering different market competitions
• To acquaint with the basic accounting knowledge and financial accounting
process
• To evaluate the performance of the organization using various ratios

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Perform decision making function effectively in an uncertain framework by
applying the based concepts of economics and select suitable form of business
organization which meets the requirements of business
CO-2: Take the right decisions towards buying and selling of goods and services based
on the demand and supply dynamics in the markets
CO-3: Fix the right price based upon production cost which can best meet the pre-
determined objectives of the business under different market conditions
CO-4: Prepare book of accounts and understand overall position of the business
CO-5: Interpret the firm’s financial performance using various ratios

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 - - - - - - - 1 2 1 3 1 - - -
CO-2 - - - - - - - 1 2 1 3 1 - - -
CO-3 - - - - - - - 1 2 1 3 1 - - -
CO-4 - - - - - - - 1 2 1 3 1 - - -
CO-5 - - - - - - - 1 2 1 3 1 - - -

UNIT-I:
Introduction to Economics: Definition, nature, scope and types of Economics. National
Income (NI) & types of Inflation.
Forms of organizing Private and Public-Sector Business Enterprises
Private Sector Business Enterprises: (i) Sole Proprietorship – Definition, features, merits,
limitations & suitability. (ii) Partnership – Definition, Partnership Act, features, types,
merits, limitations, suitability. (iii) Joint-Stock Company – Definition, Companies Act,
features, types, merits, limitations, suitability.

8
Public Sector Business Enterprises: Definition, features, objectives, merits, problems

UNIT-II:
Business Economics: Definition, nature and scope, linkages with other disciplines.
Demand Analysis: Law of Demand, Factors affecting demand; Elasticity of Demand-
Types Measurement, Factors affecting and Significance,
Demand Forecasting: Characteristics of Good Demand Forecasting, Steps in Demand
Forecasting, Methods of Demand Forecasting.
Supply Analysis: Determinants of Supply, Supply function and Law of Supply.

UNIT-III:
Production, Cost, Market Structures & Pricing:
Production Analysis: Factors of Production, Production Function, Production Function
with one variable input, two variable inputs, Returns to Scale, Different Types of
Production Functions - Cobb-Douglas.
Cost Analysis: Types of Costs, Short run and long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly,
Oligopoly, Monopolistic Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis (Simple
problems)

UNIT-IV:
Introduction to Financial Accounting: Definition, basic principles and double-entry
book-keeping, practice of accounting process-Journal, ledger, trial balance and final
accounts (simple problems)

UNIT-V:
Ratio Analysis: Meaning, computation of ratios (i) Liquidity Ratios: Current Ratio and
Quick Ratio, (ii) Solvency Ratios: Interest Coverage Ratio and Debt-Equity Ratio, (iii)
Activity Ratios: Stock/Inventory Turnover Ratio and Debt Turnover Ratio, (iv) Profitability
Ratios: Gross Profit Ratio, Net Profit Ratio & Earning Per Share (EPS) Ratio

TEXT BOOKS:
1. Managerial Economics, D.M. Mithani, Himalaya Publishing House, 9e, 2022
2. Managerial Economics, Satya P. Das & J.K. Goyal, Sage Publications, 2e, 2022
3. Financial Accounting, S.N.Maheswari, Vikas Publications, 6e, 2018

REFERENCES:
1. Managerial Economics, Dominick Salvatore, Siddhartha K. Rastogi, Oxford
Publications, 9e, 2020
2. Financial Accounting for Management: An analytical perspective, Ambrish
Gupta, Pearson Education, 6e, 2018
3. Business Economics, H L Ahuja, S. Chand & Co, 13e, 2019
4. Principles of Marketing: A South Asian Perspective, Kotler Philip, Gary Armstrong,
Prafulla Y. Agnihotri, and Eshan ul Haque, Pearson Education/ Prentice Hall of
India, 13e, 2010

9
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC1DS201) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To apply logical reasoning to variety of problems
• To understand the concepts on elementary combinatorics and permutations
• To analyze the properties of graphs and trees
• To evaluate various methods for solving the recurrence relations

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Demonstrate problems using statement calculus, predicate logic and set
theory
CO-2: Analyze sets, relations, functions, and discrete structures
CO-3: Apply and calculate permutations and combinations
CO-4: Understand the use of graphs and trees as models
CO-5: Solve various problems using recurrence relation techniques

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 3 1 2 1 2 - - - - - 1 2 2 1
CO-2 3 3 1 2 1 2 - - - - - 1 2 2 1
CO-3 3 3 1 2 1 2 - - - - - 1 2 2 2
CO-4 3 3 1 2 1 2 - - - - - 1 3 3 2
CO-5 3 - 2 - 2 - - - - - - - - - -

UNIT-I:
Mathematical Logic: Statements and notations, Connectives, Well-formed formulas,
Truth Tables, tautology, equivalence implication, Normal forms, Rules of inference,
Consistency, proof of contradiction, Automatic Theorem Proving.
Predicates: Quantifiers, Predicative logic, Free & Bound variables.

UNIT-II:
Set Theory: Notations, inclusion and equality sets, operations on sets, Venn diagrams.
Relations: Properties of binary Relations, equivalence, transitive closure, compatibility
and partial ordering relations, Hasse diagram. Functions: Types of Functions, Inverse
Function, Composition of functions, recursive Functions.

UNIT-III:
Elementary Combinatorics: Basics of counting, Combinations & Permutations, with
repetitions, Constrained repetitions, the principles of Inclusion – Exclusion, Pigeon hole
principle, Binomial Coefficients.

10
UNIT-IV:
Graphs: Basic Concepts, Isomorphisms and Subgraphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler ‘s Formula,
Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four-
Color Problem.

UNIT-V:
Recurrence Relations: Generating Functions, Function of Sequences, Calculating
Coefficients of generating functions, Recurrence relations, solving recurrence relation
by substitution and Generating functions, the method of Characteristic roots, solution
of Inhomogeneous Recurrence Relations.

TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, J. P.
Trembly and R. Manohar, Tata McGraw-Hill, 2019
2. Discrete Mathematics for Computer Scientists & Mathematicians, J. L. Mott, A.
Kandel, T. P. Baker, 2nd Edition, PHI, 1986
3. Graph Theory: With Application to Engineering and Computer Science, Narsingh
Deo, Prentice Hall of India, 2003

REFERENCES:
1. Elements of Discrete Mathematics, A Computer Oriented Approach, C. L. Liu and
D. P. Mohapatra, 3rd Edition, Tata McGraw-Hill, 2017
2. Discrete Mathematics and its Applications, Kenneth H. Rosen, Tata McGraw-Hill,
2003
3. Discrete Mathematics, Norman L. Biggs, 2nd Edition, Oxford University Press, 1989

ONLINE RESOURCES:
1. IIT Discrete Mathematics Lectures – YouTube

11
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC2IT201) OBJECT ORIENTED PROGRAMMING THROUGH JAVA LABORATORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
0 2 1 10 10 10 10 60 100

COURSE OBJECTIVES:
• To understand OOP principles
• To understand the Exception Handling mechanism
• To understand Java collection framework
• To understand multithreaded programming
• To understand java database connectivity in Java

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Able to write the programs for solving real world problems using Java OOP
principles
CO-2: Able to write programs using Exceptional Handling approach
CO-3: Able to write multithreaded applications
CO-4: Able to Build application using Java Collection Framework
CO-5: Able to develop java application connect database using JDBC

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 3 2 3 - 2 - - 2 - 1 2 3 3 2
CO-2 3 2 3 2 - - - - 2 1 - 2 3 3 2
CO-3 3 3 2 3 - - - - 2 - 2 2 2 2 2
CO-4 2 2 3 2 2 2 2 - 2 1 2 2 3 3 2
CO-5 2 2 2 2 2 3 2 1 2 1 1 2 3 3 3

LIST OF PROGRAMS / EXPERIMENTS / EXERCISES:

Week 1:
a. Installation of Java software, study of any integrated development environment,
Use Eclipse or Netbean platform and acquaint with the various menus. Create a
test project, add a test class and run it. See how you can use auto suggestions,
auto fill. Try code formatter and code refactoring like renaming variables, methods
and classes. Try debug step by step with java program to find prime numbers
between 1 to n.
b. Write a Java program that prints all real solutions to the quadratic equation
ax2+bx+c. Read in a, b, c and use the quadratic formula.
c. Write a Java program to multiply two given matrices.

Week 2:

12
a. Write Java program on use of inheritance, preventing inheritance using final,
abstract classes.
b. Write Java program on dynamic binding, differentiating method overloading and
overriding.
c. Develop a java application to implement currency converter (Dollar to INR. EURO
to INR, Yen) using Interfaces.

Week 3:
a. Write a Java program to create a package named "com.mycompany.math" that
contains a class named "Calculator" with methods to add, subtract, multiply and
divide two numbers. Write a test program to use this package.
b. Create a package named "com.mycompany.util" that contains a class named
"StringUtils" with a method named "reverseString" that takes a string as input and
returns the reverse of the input string. Write a test program to use this package.

Week 4:
a. Write a Java program to implement user defined exception handling.
b. Write a Java program to throw an exception “Insufficient Funds” while withdrawing
the amount in the user account.
c. Write a Java program to implement Try-with Resources, Multi-catch Exceptions,
and Exception Propagation Concepts?

Week 5:
a. Write a java program to split a given text file into n parts. Name each part as the
name of the original file followed by .part where n is the sequence number of the
part file.
b. Write a Java program that reads a file name from the user, displays information
about whether the tile exists, whether the file is readable, or writable. The type of
tile and the length of the file in bytes.

Week 6:
a. Write a Java program on Random Access File class to perform different read and
write operations.
b. Create a class called Employee with properties name(String), dateofbirth
(java.util.Date), department(String), designation(String) and Salary(double).
Create respective getter and setter methods and constructors (no-argument
constructor and parameterized constructor) for the same. Create an object of the
Employee class and save this object in a file called “data” using serialization. Later
using deserialization read this object and prints the properties of this object.

Week 7:
a. Create a generic class called Box that can hold any type of object. Implement
the following methods: 1) void set(T obj): sets the object stored in the box 2) T get():
retrieves the object stored in the box 3) boolean isEmpty(): returns true if the box is
empty, false otherwise
b. Implement a generic Stack class that can hold any type of object. Implement the
following methods: 1) void push(T obj): pushes an object onto the top of the stack
,2) T pop(): removes and returns the object at the top of the stack 3) boolean
isEmpty(): returns true if the stack is empty, false otherwise

Week 8:
a. Write a Java program to implement Autoboxing and Unboxing?
b. Write a Java program to implement Built-In Java Annotations?

Week 9:

13
a. Write a Java program that creates three threads. First thread displays —Good
Morning every one second, the second thread displays —Hello every two seconds
and the third thread displays —Welcome every three seconds.
b. Write a Java program that correctly implements producer consumer problem
using the concept of inter thread communication.
c. Create a Email registration Form using Java AWT. The UI should have fields such as
name, address, sex, age, email, contact number, etc.,
d. Demonstrate various Layout Managers in Java AWT. Display the output in card
layout wheareas each card exhibits different layout.

Week 10:
a. Write a Java program to create a Vector and add some elements to it. Then get
the element at a specific index and print it.
b. Write a Java program to create a BitSet and set some bits in it. Then perform some
bitwise operations on the BitSet and print the result.
c. Write a Java program to read the time intervals (HH:MM) and to compare system
time if the system Time between your time intervals print correct time and exit else
try again to repute the same thing. By using String Tokenizer class.

Week 11:
a. Write a Java program to demonstrate the working of different collection classes.
[Use package structure to store multiple classes].
b. Write a Java program to create a TreeMap and add some elements to it. Then get
the value associated with a specific key and print it.
c. Write a Java program to create a PriorityQueue and add some elements to it.
Then remove the highest priority element from the PriorityQueue and print the
remaining elements.

Week 12:
a. Deve1op a Java application to establish a JDBC connection, create a table
student with properties name, register number, mark 1, mark2, mark3. Insert the
values into the table by using the java and display the information of the students
at font end.
b. Write a program to perform CRUD operations on the student table in a database
using JDBC

TEXT BOOKS:
1. Java for Programmers, P. J. Deitel and H. M. Deitel, 10th Edition Pearson education.
2. Thinking in Java, Bruce Eckel, Pearson Education.
3. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.

REFERENCES:
1. Java Programming, D. S. Malik and P. S. Nair, Cengage Learning.
2. Core Java, Volume 1, 9th edition, Cay S. Horstmann and G Cornell, Pearson.
3. Programming in Java, S. Malhotra, S. Chudhary, 2nd edition, Oxford Univ. Press.
4. Java Programming and Object-oriented Application Development, R. A. Johnson,
Cengage Learning.

ONLINE RESOURCES:
1. https://www.w3schools.com/java/java_oop.asp
2. http://peterindia.net/JavaFiles.html

14
15
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22PC2AM201) DATABASE MANAGEMENT SYSTEMS LABORATORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
0 2 1 10 10 10 10 60 100

COURSE PRE-REQUISITES: Basic computer programming skills

COURSE OBJECTIVES:
• To provide the fundamental concepts of database creation
• To implement the concepts of Data manipulation
• To develop procedures for querying Multiple tables
• To understand the concepts of PL / SQL

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Understand the given scenario, design it through ER model and normalize the
schema.
CO-2: Use the basics of SQL and construct queries using SQL in database creation and
interaction
CO-3: Apply Integrity constraints for creating consistent RDBMS environment
CO-4: Applying PL/SQL for processing database
CO-5: Develop solutions using database concepts for real time requirements

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 1 3 3 2 1 2 - - 2 2 - 2 2 3
CO-2 3 1 3 3 1 1 2 - - - - - 3 2 3
CO-3 2 1 2 3 1 1 2 - - 2 - - 3 2 3
CO-4 3 2 2 3 1 1 2 - - - - - 3 2 3
CO-5 3 2 3 3 1 1 3 - - 3 - 2 3 3 3

LIST OF PROGRAMS / EXPERIMENTS / EXERCISES:

WEEK 1:
Implement the following using DUAL table: a) Character functions, b) Numeric
functions c) Date functions and d) Conversion functions.

WEEK 2:
Practice DDL and DML commands on a basic table without integrity constraints.

WEEK 3:
Practice DDL and DML commands on a Relational Database, specifying the Integrity
constraints. (Primary Key, Foreign Key, CHECK, NOT NULL)

WEEK 4:

16
Apply the concepts of Joins, SET operations and SQL functions on any two relational
schemas

WEEK 5-7:
Apply the concepts of Joins, SET operations and SQL functions on the following
schema:

a) Employee:

Name Datatype width Constraint Description

Empno Integer 4 Primary Key Employee Number
Ename Varchar 20 Employee Name
Job Char 12 Designation
Mgr Integer 4 Manager Number
Hiredate Date
Sal Number (8,2) Salary
Comm Number (6,2) Commission
Deptno Integer 2 Foreign Key Department Number

b) Dept:

Name Datatype width Constraint Description

Deptno Integer 2 Primary Key Department Number
Dname Varchar 12 Department Name
Loc Char 10 Location

c) Salgrade:

Name Datatype width Constraint Description

Grade Integer 1 Grade
Hisal Integer 4 Upper
Losal Integer 5 Lower

WEEK 8 – 11:
End to end implementation of a schema for a specific system along with the
illustrations of querying.
A system is described by specifying the functional and non-functional requirements.
Based on this description, the major entities are identified and modelled. Further the
relationships are modelled to form the initial schema. The schema is further refined by
removing redundancies through normalization. Also based on the query
requirements, the schema is remodeled to facilitate querying. Finally an illustration of
various queries to extract required information from the system is shown using SQL /
MYSQL.
The five major workflows to be implemented are:
1. System Specification
2. Design of Initial Schema
3. Schema refinement using functional dependencies and normalization
4. Schema refinement using query requirements
5. Illustration of querying the system using SQL / MYSQL.

WEEK 12:
Implementation of PL / SQL concepts

WEEK 13:

17
Creating and executing CURSORS.

WEEK 14:
Creation and application of TRIGGERS on a Relational schema.

TEXT BOOKS:
1. Database System Concepts, Silberschatz, Korth, Sudarshan, 7th Edition, McGrawHill
2. Introduction to Database Systems, C.J.Date, Pearson Education

REFERENCES:
1. Database Management Systems, Raghu Ramakrishnan, Johannes Gehrke, Tata
McGraw-Hill
2. Fundamentals of Database Systems, Elmasri Navathe Pearson Education
3. Database Systems Design, Implementation, and Management, Peter Rob & Carlos
Coronel, 7th Edition, Cengage Learning

ONLINE RESOURCES:
1. https://www.w3schools.com/sql/default.asp
2. https://www.javatpoint.com/dbms-tutorial

18
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22ES2DS101) PYTHON PROGRAMMING LABORATORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
1 2 2 10 10 10 10 60 100

COURSE OBJECTIVES:
• To install and run the Python interpreter
• To learn control structures
• To Understand Lists, Dictionaries in python
• To Handle Strings and Files in Python
• To acquire programming skills in core Python

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Develop the application specific codes using python.
CO-2: Understand Strings, Lists, Tuples and Dictionaries in Python
CO-3: Verify programs using modular approach, file I/O, Python standard library
CO-4: Implement Digital Systems using Python
CO-5: Develop the skill of designing Graphical User Interfaces in Python

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 2 3 3 2 3 2 2 1 2 2 2 3 3 2 3
CO-2 3 2 3 3 2 3 3 2 1 2 3 3 2 3 3
CO-3 3 2 3 1 2 3 2 3 2 1 2 3 2 1 2
CO-4 3 2 3 2 3 2 3 2 2 2 3 3 3 2 1
CO-5 3 2 3 3 3 3 3 2 3 3 2 3 1 2 3

Note: The lab experiments will be like the following experiment examples

Week -1: Basics

1. i) Use a web browser to go to the Python website http://python.org. This page
contains information about Python and links to Python-related pages, and it gives you
the ability to search the Python documentation.
ii) Start the Python interpreter and type help() to start the online help utility.
2. Start a Python interpreter and use it as a Calculator.
3. Write a program to purposefully raise Indentation Error and correct it
4. i) Write a program to calculate compound interest when principal, rate and number
of periods are given.
ii) Given coordinates (x1, y1), (x2, y2) find the distance between two points
5. Read name, address, email and phone number of a person through keyboard and
print the details.

19
Week - 2: Operations
1. Print the below triangle using for loop.
5
44
333
2222
11111
2. Write a program to check whether the given input is digit or lowercase character
or uppercase
character or a special character (use 'if-else-if' ladder)
3. Python Program to Print the Fibonacci sequence using while loop
4. Python program to print all prime numbers in a given interval (use break)
5. Write a program to compute LCM of two numbers by taking input from the user
6. Write a program add.py that takes 2 numbers as command line arguments and
prints its sum

Week - 3: Lists & Tuples

1. i) Write a program to convert a list and tuple into arrays.
ii) Write a program to find common values between two arrays.
2. Write a function called gcd that takes parameters a and b and returns their greatest
common divisor.
3. Write a function called palindrome that takes a string argument and returns True if
it is a palindrome and False otherwise. Remember that you can use the built-in
function len to check the length of a string.
4. Find mean, median, mode for the given set of numbers in a list.
5. Write a Python program to create a tuple.
6. Write a Python program to create a tuple with different data types.
7. Write a Python program to check whether an element exists within a tuple.

Week - 4: Sets, Dictionaries and Strings

1. Write a function called is_sorted that takes a list as a parameter and returns True if
the list is sorted in ascending order and False otherwise.
2. Write a function called has_duplicates that takes a list and returns True if there is any
element that appears more than once. It should not modify the original list.
i). Write a function called remove_duplicates that takes a list and returns a new list
with only the
unique elements from the original. Hint: they don’t have to be in the same order.
ii). The wordlist I provided, words.txt, doesn’t contain single letter words. So you might
want to add
“I”, “a”, and the empty string.
iii). Write a python code to read dictionary values from the user. Construct a function
to invert its
content. i.e., keys should be values and values should be keys.
3. i) Add a comma between the characters. If the given word is 'Apple', it should
become 'A,p,p,l,e'
ii) Remove the given word in all the places in a string?
iii) Write a function that takes a sentence as an input parameter and replaces the first
letter of every

20
word with the corresponding upper case letter and the rest of the letters in the word
by
corresponding letters in lower case without using a built-in function?
4. Writes a recursive function that generates all binary strings of n-bit length
5. Write a Python program to implement all set operations
6. Write a program to check whether a string is palindrome or not

Week - 5: Functions and Multi-D Lists

1. i) Write a python program that defines a matrix and prints
ii) Write a python program to perform addition of two square matrices
iii) Write a python program to perform multiplication of two square matrices
2. Simple Calculator program by making use of functions
3. Find the factorial of a number using recursion
4. Write a function cumulative_ product to compute cumulative product of a list of
numbers.
5. Write a function reverse to print the given list in the reverse order.

Week-6: Exceptions in Python

1. Write a program that detects an Exception
2. Write a program that raise an Exception ( divide by zero error,voter’s age validity
3. Write a program that raise an Exception as string(), student mark range validation)
4. Use the structure of exception handling all general purpose exceptions.
5. Write a python code to read a phone number and email-id from the user and
validate it for
correctness.

Week-7: Modules and Inheritance

1. How do you make a module? Give an example of construction of a module using
different geometrical shapes and operations on them as its functions.
2. a. Write a function called draw_rectangle that takes a Canvas and a Rectangle as
arguments and draws a representation of the Rectangle on the Canvas.
b. Add an attribute named color to your Rectangle objects and modify
draw_rectangle so that it uses the color attribute as the fill color.
c. Write a function called draw_point that takes a Canvas and a Point as arguments
and draws a representation of the Point on the Canvas.
d. Define a new class called Circle with appropriate attributes and instantiate a few
Circle objects. Write a function called draw_circle that draws circles on the canvas.
3. Write a Python program to demonstrate the usage of Method Resolution Order
(MRO) in multiple levels of Inheritance.

Week- 8: Files
1. Write a Python code to merge two given file contents into a third file.
2. Write a Python code to open a given file and construct a function to check for
given words present in it and display on found.
3. Write a Python code to Read text from a text file, find the word with most number
of occurrences
4. Write a function that reads a file file1 and displays the number of words, number of
vowels, blank spaces, lower case letters and uppercase letters.

21
5. Write a program to print each line of a file in reverse order.

Week - 9: Exploration of NumPy Package

1. Import numpy, and explore their functionalities.
2. a) Install NumPy package with pip and explore it.
3. Write a program for slicing arrays using numpy
4. Write a program for Math operations on array using numpy
5. Write a program for searching
6. Write a program for sorting

Week - 10: Exploration of Pandas Package

1. Import Pandas and Plotpy and explore their functionalities
2. Python Data Frame
3. Python series

Week - 11: Exploration of SciPy and GUI

1. Import SciPy and explore their functionalities
2. Write a GUI program to create a window wizard having two text labels, two text
fields and two buttons as Submit and Reset.

Week-12: Digital Logic Systems

1. Write a program to implement Digital Logic Gates – AND, OR, NOT, EX-OR
2. Write a program to implement Half Adder, Full Adder, and Parallel Adder

TEXT BOOKS:
1. Supercharged Python: Take your code to the next level, Overland
2. Learning Python, Mark Lutz, O'reilly
3. Python for Data Analysis, 2nd Edition by Wes McKinney, Orielly

REFERENCE BOOKS:
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson
2. Python Programming A Modular Approach with Graphics, Database, Mobile, and
Web Applications, Sheetal Taneja, Naveen Kumar, Pearson
3. Programming with Python, A User’s Book, Michael Dawson, Cengage Learning,
India Edition
4. Think Python, Allen Downey, Green Tea Press
5. Core Python Programming, W. Chun, Pearson

22
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. III Semester

(22MN6HS102) ENVIRONMENTAL SCIENCE

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE-I SE-II SEE TOTAL
2 0 0 50 50 - 100

COURSE PRE-REQUISITES: Basic knowledge of environmental issues

COURSE OBJECTIVES:
• To recognize the impacts of human interventions towards environment
• To list out the benefits in creating a sustainable world
• To sketch out various activities in achieving a cleaner environment
• To emphasize the role of frontier technologies for a better planet to live

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Gain a variety of experiences & acquire a basic knowledge about the
environment & its allied problems
CO-2: Interpret the key components in safeguarding the environment
CO-3: Appraise the quality of environment in order to create a healthy atmosphere
CO-4: Familiarize with the importance of emerging technologies towards green
revolution

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 2 1 - - 1 1 - 2 1 - 2 - - 3
CO-2 3 2 2 1 - 1 1 - 2 1 - 2 - - 3
CO-3 3 2 2 - - 1 1 - 2 1 - 2 - - 3
CO-4 3 2 1 1 - 1 1 - 2 1 - 2 - - 3

MODULE 1:
Introduction to Environmental Science: Importance of Environmental Science,
Overview of the environment & its components, Human intervention in destruction or
sustenance of environment. Relationship between environmental science & society -
Influence of Industry, Innovation & infrastructure on environment

MODULE 2:
Synergy With Environment: Health & Well Being-ensuring healthy lives and promoting
wellbeing at all ages. Reduce the number of deaths and illnesses from hazardous
chemicals and air, water and soil pollution and contamination. Life under water and
on land-conservation & sustainable usage, measures to protect marine & coastal
ecosystems from various impacts. Protect and restore terrestrial ecosystems,
sustainably managing forests, combat desertification. Biodiversity a valuable
resource- biological diversity as a support for food, water, medicine, shelter, cleaning
of air and water and other material goods for sustaining life and increase resilience

23
MODULE 3:
Climate Change: Science behind climate change-factors responsible for climate
change, Scientific evidence about past climate and present. Expected
consequences of climate change- Impacts of climate change on growth and
development. Role of greenhouse gases- Global temperature rise & its impact on
environment & human health. Carbon footprint-Briefing on Paris agreement, Identify
key sectors for low carbon footprint. Climate change mitigation & adaptation
strategies

MODULE 4:
Moving Towards Sustainability: Eco-Audit and its importance. Sustainable agriculture-
Organic farming and hydroponics. Role of AI & IOT for efficient management of
environmental issues-Health, air, water, and soil. Sustainable living practices-
minimizing waste, limited use of earth’s natural resources, wise use of environment and
ensuring quality working/living environments

MODULE 5:
Innovations in Environmental Science: Sustainable cities and communities-case study,
Responsible consumption & production- Refuse, Reduce, Reuse and Recycle with
examples. Innovative approaches to waste management-smart waste
management, Plastic recycling-innovative ideas.

TEXTBOOKS:
1. Environmental Studies for UG Courses, Erach Bharucha, UGC Publications, Delhi,
2004
2. Environmental Studies by Rajagopalan, Oxford University Press
3. Introduction to Climate Change by Andreas Schmittner, Oregon State University,
2018

REFERENCES:
1. Green Development: Environment and sustainability in a developing world by Bill
Adams, 4th Edition, Routledge Publishers, 2021
2. Fixing Climate by Robert Kunzig & Wallace S Broecker, Main edition, Profile books
publisher, 2009
3. Plastic Waste and Recycling-Environmental Impact, societal Issues, Prevention and
solutions, 1st Edition, Academic Press 2020

ONLINE RESOURCES:
1. https://www.coursera.org/learn/beyond-the-sustainable-development-goals-
addressing-sustainability-and-development
2. https://www.coursera.org/specializations/climatechangeandsustainableinvestin
g

24
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22PC1DS202) DIGITAL LOGIC DESIGN AND COMPUTER ORGANIZATION

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE PRE-REQUISITES: IT WORKSHOP

COURSE OBJECTIVES:
• To learn about the functional blocks and data representation of computer system
• To understand the design principles of processor
• To understand the organization and management of memory
• To understand the management of peripheral devices

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Evaluate digital number systems and use Boolean algebra theorems, Properties
and Canonical forms for digital logic circuit design
CO-2: Design Combinational logic circuits and Sequential logic circuits
CO-3: Understand computer architecture and Data representation to perform
computer arithmetic operations
CO-4: Illustrate the design principles of control unit and pipelining
CO-5: Analyze the memory hierarchy in a computer system

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 3 3 2 2 1 1 - 3 - - 3 1 3 3
CO-2 3 3 3 3 3 3 3 - 3 - - 3 3 3 3
CO-3 3 3 3 3 3 3 3 - 3 - - 3 3 3 3
CO-4 3 3 3 3 3 3 3 - 3 - - 3 3 2 3
CO-5 3 3 3 3 3 3 3 - 3 - - 3 3 3 3

UNIT – I:
Number Systems, logic Gates and Boolean algebra
Number Systems: Binary, Octal, Decimal, Hexadecimal Number Systems. Conversion
of Numbers from One, Radix to another Radix, r‘s Complement and (r-1)‘s
Complements, Binary Codes, Basic Gates: NOT, AND, OR, Universal Gates: NAND,
NOR, Special Gates: Ex-OR and Ex-NOR Gates
Boolean algebra: Fundamental postulates of Boolean algebra, Basic theorems and
properties, Complement and Dual of Logical Expressions, SOP, POS, Minimizations of
Logic Functions Using Boolean Theorems, Karnaugh Map Method (K-Map):
Minimization of Boolean Functions maximum up to Four Variables, Simplifications with
Don’t Care Conditions Using K-Map.

UNIT-II:

25
Combinational Logic Circuits &Sequential Logic Circuits: Design of Half Adder, Full
Adder, Half Subtractor, Full Subtractor, Ripple Carry Adder. Designof Decoders,
Encoders, Multiplexers, De-multiplexers, Priority Encoder,
Sequential Logic Circuits: Latch and Flip-Flop, RS- Latch Using NAND and NOR Gates,
RS, JK, T and D Flip-flops, Truthand Excitation Tables, Conversion of Flip Flops, Master-
Slave Flip-flops. Registers and Counters

UNIT – III:
Functional Blocks of a Computer: CPU, Memory, Input-Output Subsystems, Control
Unit. Instruction Set Architecture of A CPU–Registers, Instruction Execution Cycle, RTL
Interpretation of Instructions, Addressing Modes.
Data Representation: Fixed and Floating-Point Representations. Computer Arithmetic
– Integer Addition and Subtraction, Multiplication – Shift-And Add, Booth Multiplier.

UNIT – IV:
CPU control unit design: Hardwired and micro-programmed design approaches.
Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.

UNIT-V:
Memory system design: Memory hierarchy, Cache Memory and Main Memory.
Peripheral devices and their characteristics: Input-output subsystems, I/O device
interface, I/O transfers–program controlled, interrupt driven and DMA.

TEXTBOOKS:
1. Digital Design, M. Morris Mano,Michael D Ciletti, 4/e,2008, PEA
2. Switching and Finite Automata Theory, ZviKohavi, Tata McGraw-Hill
3. Computer Organization and Design: The Hardware/Software Interfaces, David A.
Patterson and John L. Hennessy, 5th Edition, Elsevier
4. Computer Organization and Embedded Systems, Carl Hamacher, 6th
Edition,McGraw Hill Higher Education

REFERENCES:
1. Fundamentals of Logic Design, Roth, 5th Edition, Thomson
2. Switching and Logic Design, C. V. S. Rao, Pearson Education
3. Digital Principles and Design, Donald D. Givone, Tata McGraw-Hill
4. Computer System Architecture, M. Morris Mano, 3rd Edition
5. Computer Architecture and Organization, John P. Hayes, 3rd Edition,
WCB/McGraw-Hill

ONLINE RESOURCES:
1. https://nptel.ac.in/courses/108106177
2. https://nptel.ac.in/courses/106105163

26
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22BS1MT205) STATISTICAL INFERENCE AND QUEUING THEORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE PRE-REQUISITES: Statistical Methods for Data Analysis (22BS1MT103)

COURSE OBJECTIVES:
• To the concept of sampling distribution
• To various methods to test the hypothesis for large Sample
• To various methods to test the hypothesis for small Sample
• To the Linear and polynomial relationship between the given data set
• To the basic concepts of queuing theory

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Evaluate sampling distribution of means, variance and confidence interval
CO-2: Apply the knowledge to test the hypothesis for large sample
CO-3: Apply the Knowledge about small sample tests based on Chi-square, t and F
distributions
CO-4: Use and fit a linear and polynomial regression model to data and use it for
prediction
CO-5: Apply the knowledge of different probability distributions to solve problems in
Queuing theory

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 2 1 1 1 - - - - - - - - 2 -
CO-2 3 3 2 2 2 - - - - - - - 1 2 -
CO-3 3 2 1 1 - - - - - - - - - 1 -
CO-4 3 3 2 2 2 - - - - - - - 1 2 -
CO-5 3 2 - - - - - - - - - - 1 1 -

UNIT- I:
Sampling distributions: Definition of population, sampling, statistic, parameter, Types
of sampling, sample mean and Variance, sampling distribution, standard error,
sampling distributions of means and variance, Estimation, interval estimation, point
estimation and confidence interval for the mean and proportions.

UNIT- II:
Testing of Hypothesis - Large samples: Central limit theorem, Tests of hypothesis - null
hypothesis, alternate hypothesis, type I, type II errors, critical region. Inferences
concerning means and proportions- Large samples- test of hypothesis for single mean
and difference between the means. Test of hypothesis for the proportions- single and
difference between the proportions.

27
UNIT- III:
Testing of Hypothesis - Small samples: Test of significance-t distribution, confidence
interval for the t- distribution, F-distribution and Chi square distribution, Analysis of
variance (ANOVA).

UNIT- IV:
Correlation and Regression : Correlation, Correlation coefficient and its properties,
rank correlation coefficient, Multiple and partial correlation, Introduction to Linear
Regression, Estimation of parameters of β_0 and β_1, Multiple linear regression,
Inferences for Linear Regression, Regression of second degree polynomial by least
square method.

UNIT -V:
Queuing Theory: Queuing theory -Arrival process and service process- Pure birth and
death process, M/M/1 model with finite and infinite capacities, M/M/C model with
infinite capacity.

TEXT BOOKS:
1. Applied Probability by I. N. Blake, 9th Edition, John Wiley & Sons Inc., 1979
2. Introductory Statistics by Thomas H Wonnacott& Ronald J Wonnacot, John Wiley
& Sons Inc., 1969
3. The Single Server Queue ,1969, by J.W. Cohen, Wiley Interscience, New York, NY.

REFERENCES:
1. Applied Statistics and Probability for Engineers by Douglas C. Montgomery,
George C. Runger, John Wiley & Sons, Inc, 3rd Edition, 2003
2. Probability and Statistics for Engineers – Richard. A.Johanson, 5th Edition,
PrenticeHall, 1995
3. Applied Statistics for Engineers-Jay.L.Devore, Nicholas. R.Famum, Jimmy.A.Doi, 3rd
Edition, Cengage learning
4. Some problems in the theory of queues, D.G. Kendall, Journal of the Royal
Statistical Society, Series B, 13, 151–185, 1951

28
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22PC1CS201) SOFTWARE ENGINEERING

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To identify the importance of software engineering principles and software process
framework
• To understand contemporary approaches for design models and requirements
validation
• To explore various metrics and quality assurance strategies
• To analyze different strategies for testing and risk management

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Analyze software engineering framework activities that can be tailored with
appropriate methods for developing the projects
CO-2: Design relevant software system models from the available software
requirements and validate desired user models with realistic constraints.
CO-3: Understand the Requirements Engineering Process and model the system using
the perception of UML.
CO-4: Deliver quality software products by applying software testing strategies and
product metrics over the entire system life cycle
CO-5: Specify contemporary issues of handling risk management and quality
management in Software development

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 3 2 2 2 2 1 1 1 1 2 2 1 3 3
CO-2 3 3 3 2 3 2 1 1 1 1 2 3 1 3 3
CO-3 3 3 2 2 2 2 1 1 1 1 2 3 1 3 3
CO-4 3 3 2 2 3 2 3 1 1 1 2 3 1 3 3
CO-5 3 3 2 2 3 2 3 1 1 1 2 3 1 3 3

UNIT – I:
Introduction to Software Engineering: Software characteristics, changing nature of
software, software myths.
A Generic View of Process: Software engineering-A layered technology, process
framework, The Capability Maturity Model Integration (CMMI)

UNIT – II:
Process Models: The waterfall model, spiral model, Incremental process model,
evolutionary process model, agile process
Software Requirements: Functional and non-functional requirements, the software
requirements document.

29
Requirements Engineering Process: Feasibility studies, requirements elicitation and
analysis, requirements validation, requirements management, and forward and
reverse engineering.

UNIT – III:
Modeling with UML: Modeling Concepts and Diagrams - Use Case Diagrams - Class
Diagrams - Interaction Diagrams - State chart Diagrams – Activity Diagrams - Package
Diagrams - Component Diagrams – Deployment Diagrams -Diagram Organization-
Diagram Extensions.
Design Engineering: The design process and design quality, design concepts, and
design model.

UNIT – IV:
Testing Strategies: A strategic approach to software testing, verification and
validation, Testing Strategies, Black box, and White box testing, and deployment.
Product Metrics: Metrics for analysis model, Metrics for design model, Metrics for
source code, Metrics for testing, Metrics for maintenance
Metrics for Process and Projects: Software measurement, Metrics for software quality

UNIT – V:
Risk Management: Reactive vs. Proactive risk strategies, Software risks, Risk
identification, Risk projection, RMMM plan
Quality Management: Quality concepts, Software quality assurance, Formal technical
reviews, ISO 9000 Quality standards.

TEXT BOOKS:
1. Software engineering - A practitioner’s Approach, Roger S.Pressman, McGraw-Hill
International Edition, 6th Edition, 2001
2. Software engineering, Ian Sommerville, Pearson Education Asia, 7th Edition, 2000
3. The Unified Modeling Language User Guide, by Grady Booch, James Rumbaugh,
Ivar Jacobson, Pearson Education

REFERENCES:
1. An Integrated Approach to Software Engineering, by Pankaj Jalote, Springer
Verlag, 1997
2. Software Engineering – An Engineering Approach, James F. Peters and
WitoldPedryez, John Wiley and Sons, New Delhi, 2000
3. Software Engineering Fundamentals, Ali Behforooz and Frederick J. Hudson, Oxford
University Press, New Delhi, 1996

ONLINE RESOURCES:
1. https://www.guru99.com/what-is-software-engineering.html
2. https://www.tutorialspoint.com/software_engineering/index.htm

30
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22PC1IT202) OPERATING SYSTEMS

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To understand operating system overview, functions and service
• To analyse process concept, inter process communication and synchronization
• To understand memory management and file system interface
• To understand secondary storage management
• To understand protection and security

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Student will be able to understand operating system overview, functions and
service
CO-2: Student will be able to analyze process concept, inter process communication
and synchronization
CO-3: student will be able to understand memory management and file system
interface
CO-4: student will able to understand secondary storage management
CO-5: student will be able to understand protection and security

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 1 2 1 1 1 1 1 - 1 3 2 3 2 3
CO-2 3 1 2 1 1 1 1 1 - 1 3 2 3 2 3
CO-3 3 1 2 1 1 1 1 1 - 1 3 2 3 2 3
CO-4 3 1 2 1 1 1 1 1 - 1 3 2 3 2 3
CO-5 3 1 2 1 1 1 1 1 - 1 3 2 3 2 3

UNIT-I:
Operating System Overview: Overview of Computer Operating Systems, Operating
System Functions, Operating System Services and Systems Calls, System Programs.
Process Concept: Process Concepts, process states. Threads, multithreading.

UNIT-II:
Process Management: Scheduling-Criteria, CPU Scheduling, Algorithms Evaluation,
Thread Scheduling.
Process Synchronization- Critical-Section Problem, Peterson‘s Solution,
Synchronization Hardware, Semaphores, Classic Problems of Synchronization,
Producer – consumer problem, Dining philosophers problem, Readers – Writers
Problem, Monitors, Synchronization examples.

31
UNIT-III:
Inter process communication: Message passing, shared memory
Deadlock: Deadlock System Model, Deadlock Characterization, Deadlock
Prevention, Detection and Avoidance, Recovery from Deadlock.

UNIT-IV:
Memory Management: Memory Management Swapping, Contiguous Memory
Allocation, Paging, Page-Table Structure, Segmentation, Virtual Memory, Demand
Paging, Page-Replacement Algorithms, Frames Allocation, Thrashing.
File System Interface: File Concepts, Access Methods and Directory Structure, File
System Mounting, File Sharing and Protection, Allocation Methods, Free-Space
Management, Efficiency and Performance

UNIT-V:
Mass Storage: Overview Mass-Storage Structure, Disk Structure, Disk Attachment, Disk
Scheduling, Swap-Space Management, RAID Structure
Protection: Protection Goals of Protection, Principles of Protection, Domain of
Protection Access Matrix, Implementation of Access Matrix,
Security: Security Problem, Program Threats, System and Network Threats
Case Study: Windows Operating system, Linux Operating System.

TEXT BOOKS:
1. Operating System Concepts-Abraham Silberchatz, Peter B. Galvin, Greg Gagne,
7th Edition, John Wiley
2. Operating Systems- A Concept based Approach, D.M.Dhamdhere, 2nd Edition,
TMH

REFERENCES:
1. Operating Systems-Internal and Design Principles, Stallings, Fifth Edition-2005,
Pearson education/PHI
2. UNIX: Concepts and Applications ,4th Edition, Sumitabha Das, TMH
3. Operating System: A Design-oriented Approach, Charles Patrick Crowley
4. Operating Systems: A Modern Perspective, Gary J. Nutt
5. Design of the Unix Operating Systems, Maurice J. Bach

32
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22PC1DS203) MATHEMATICAL FOUNDATIONS FOR DATA SCIECNE

TEACHING SCHEME EVALUATION SCHEME

L T/P C SE CA ELA SEE TOTAL
3 0 3 30 5 5 60 100

COURSE OBJECTIVES:
• To introduce the various mathematical concepts and models
• To undertake a critical evaluation of a wide range of data
• To develop designing skills for modeling non-deterministic problems
• To demonstrate various Machine Learning Algorithms used in Data Process

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Understand basic mathematical concepts in data science like linear algebra,
Probability and Optimization
CO-2: Apply linear models for regression and linear models for classification
CO-3: Employ Hypothesis Testing and Confidence Interval for several Real Time
Problems
CO-4: Analyze the different types of classification techniques for data analysis
CO-5: Apply visualization techniques for various data analysis tasks

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 3 1 1 1 - - - - - - 1 2 - 1
CO-2 2 3 2 1 2 - - - - - - 2 2 - -
CO-3 2 2 2 1 1 - - - - - - 1 2 3 2
CO-4 2 3 2 1 2 - - - - - - 2 2 2 2
CO-5 2 2 2 - 2 - - - - - - 2 1 3 2

UNIT-I
Model Building: Correlation, Pearson’s correlation, Kendall rank correlation, spearman
rank correlation, Regression, and its basics. Types of regression, fitting a function-
criterion for best fit, least squares, simple regression, model assessment and validation,
regression analysis, regression process.

UNIT-II
Linear Regression: Empirical model, Geometrical interpretation of linear regression,
derivation, coefficient of determination, assumption of errors, linear regression
hypothesis testing, residual analysis, residual plots, normal probability plots.

UNIT-III
Logistic Regression: Introduction, squashing, sigmoid function, logistic regression G
test, chi-square test, relationship between odds ratio and logistic regression,
interpreting logistic regression, logistic regression geometric intuition, optimization
problem solution.

33
UNIT-IV
Naive Bayes Classification: Conditional probability, example of condition probability,
independent events, mutually exclusive events, bayes theorem and related problems,
Naive Bayes algorithm and its mathematical interpretation, problem on Naive Bayes
algorithm. Feature importance and interpretability. Imbalanced data, outliers in Naive
Bayes, multiclass classification.

UNIT-V
Data Visualization: Show(), grid(), xlim(), ylim(), subplots, scatterplot, histogram, bar
plot, study of seaborn library, kde, count plot, box plot, whisker plot((), pairwise plot,
violin plot, different types of grids, palette in seaborn.
TEXTBOOKS:
1. Mathematics for Machine Learning, Marc Peter Deisenroth, A. Aldo Faisal, and
Cheng Soon Ong, Cambridge University Press, 2020
2. Linear algebra done right, S. Axler, Springer, 2017
3. Linear Algebra and Optimization for Machine Learning, Charu C. Aggarwal,
Springer

REFERENCES:
1. Mathematical Foundations of Data Science Using R, Matthias Dehmer,
SalissouMoutari, Frank Emmert-Streib, De Gruyter Oldenbourg, 2020
2. Norman Matloff, Probability and Statistics for Data Science: Math + R + Data, CRC
Data Science Series, 2019
3. Matrix methods in data mining and pattern recognition, Eldén Lars, Society for
Industrial and Applied Mathematics, 2007
4. Linear algebra and probability for computer science applications, E. Davis, CRC
Press, 2012

34
 VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22PC2DS211) PYTHON FOR STATISTICAL ANALYSIS AND SOFTWARE ENGINEERING

LABORATORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
0 2 1 10 10 10 10 60 100

COURSE PRE-REQUISITES: Basic computer programming skills

COURSEOBJECTIVES:
• To have hands on experience in developing a software project by using various
Software engineering principles and methods in each of the phases of software
development
• The course is designed to have hands on experience in the basics of data analysis
and understand the importance of statistics in designing the model use of visual
components and basic algorithms
• Apply statistical modeling techniques to data (i.e., linear and logistic regression,
linear models, multi level models)
• Create and interpret data visualizations using the Python programming language
and associated packages & libraries

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Analyze end-user requirements into system and software requirements
CO-2: Create a high-level design of the system from the software requirements
CO-3: Exposure on solving of data analysis problems
CO-4: Ability to design a Regression Model on the given data

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 2 2 3 2 2 1 - - 3 3 3 3 1 3 1
CO-2 2 2 3 2 3 1 - - 3 3 3 3 2 3 2
CO-3 3 2 3 3 3 3 - - - 2 3 3 3 3 3
CO-4 3 2 3 3 3 3 - - - - 3 3 3 3 3

LIST OF PROGRAMS / EXPERIMENTS / EXERCISES:

Do the following 7 exercises for any of the project given in the list of sample projects
or any other project:

Sample Projects:
• Passport automation System
• Book Bank
• Online Exam Registration
• Stock Maintenance System

35
• Online course reservation system
• E-ticketing
• Software Personnel Management System
• Credit Card Processing
• E-book management System.
• Recruitment system

Week1,2 and 3:
Development of problem statement.
Preparation of Software Requirement Specification Document, Design Documents
and Testing Phase related documents.
Preparation of Software Configuration Management and Risk Management related
document

Week 4, 5and 6:
Study and usage of any Design phase CASE tool
Performing the Design by using any Design phase CASE tools.
Develop test cases for unit testing and integration testing
Develop test cases for various white box and black box testing techniques.

LIST OF EXPERIMENTS FORPYTHON FOR STATISTICAL ANALYSIS

Week 7, 8and 9:
Develop a model on Analysis of variance (ANOVA) and table for the given data.
Calculating the skewness of a date set by pandas and scipy.
Design a model to calculating Percentile by SciPy and StasModels.
Develop a model to find the variance and standard deviation of uni variate statistics
measures by using pandas.

Week 10, and 11:

Demo on Bivariate and Multivariate Descriptive Statistics measures
Develop a model to measure covariance matrix, correlation matrix and heat map of
the given data set.
Demo on Bivariate and Multivariate Descriptive Statistics measures by SciPy and Stats
Models
Construct a model by using different types of distributions like Bi nominal, normal,
Poisson distributions

Week 12, and 13:

Develop a Linear Regression model for the given data.
Develop a Multiple Linear Regression model for the given data.
Design a model on hypothesis testing of F-test, t-test problems.

TEXTBOOKS:
1. Software Engineering, A practitioner’s Approach-Roger S.Pressman, 6th Edition,
McGraw Hill International Edition
2. Software Engineering, Ian Sommerville,7th Edition, Pearson Education
3. Practical Statistics for Data Scientists:50 Essential Concepts, by PeterBruce, O’Reilly
Edition

VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

36
B.Tech. IV Semester

(22PC2IT202) OPERATING SYSTEMS LABORATORY

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
0 2 1 10 10 10 10 60 100

COURSE OBJECTIVES:
• To understand the basic system calls related to process.
• To implement various CPU scheduling algorithms
• To implement memory management and virtual memory techniques
• To implement file management and disk scheduling algorithms

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: able to know the basic system calls related to process
CO-2: able to simulate CPU scheduling algorithms
CO-3: able to understand memory management and virtual memory techniques.
CO-4: able to analyse the various disk scheduling algorithms
CO-5: able to understand file management techniques

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 3 1 2 1 1 1 1 1 - - 3 2 3 2 3
CO-2 3 1 2 1 1 1 1 1 - - 3 2 3 2 -
CO-3 3 1 2 1 1 1 1 1 - - 3 2 3 2 -
CO-4 3 1 2 1 1 1 1 1 - - 3 2 3 2 3
CO-5 3 1 2 1 1 1 1 1 - - 3 2 3 2 3

LIST OF PROGRAMS / EXPERIMENTS / EXERCISES:

1. Simulate the following CPU scheduling algorithms a) FCFS b)SJF
2. Simulate the following CPU scheduling algorithms a) Priority b) Round robin
3. Simulate Bankers Algorithm for Deadlock Avoidance.
4. Implementation of the following Memory Allocation Methods for fixed partition
a) First Fit b) Worst Fit c) Best Fit
5. Implementation of Paging Technique of Memory Management
6. Implementation of the following Page Replacement Algorithms a) FIFO b) LRU c)
optimal
7. Simulate frame allocation Methods.
a) minimum number of frames b) equal allocation c) proportional allocation
8. Simulate the following Disk scheduling algorithms.
a) FCFS b) SSTF c) SCAN
9. Simulate the following Disk scheduling algorithms.
a) C-SCAN b) LOOK c) C-LOOK
10. Simulate all file allocation strategies.
a) Sequential b) Indexed c) Linked.

37
TEXTBOOKS:
1. Operating System Concepts-Abraham Silberchatz, Peter B. Galvin, Greg Gagne,
7th Edition, John Wiley
2. UNIX: Concepts and Applications ,4th Edition, Sumitabha Das, TMH

REFERENCES:
1. Operating Systems-A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH
2. Operating Systems: A Modern Perspective, Gary J. Nutt
3. Operating System Concepts-Abraham Silberchatz, Peter B. Galvin, Greg Gagne,
7th Edition, John Wiley

38
 VNR VIGNANAJYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

B.Tech. IV Semester

(22SD5DS201) DATA VISUALIZATION

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP VV SEE TOTAL
0 2 1 10 10 10 10 10 - 50

COURSE OBJECTIVES:
• To install and run the R studio for data analysis
• To understand principles and techniques for data visualization
• To visualize thedata that can improve comprehension, communication, and
decision making
• To implement various tools and methods for easy interpretation of data

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Understand the importance of data visualization in analytics
CO-2: Gain knowledge in the principles of data visualization
CO-3: Apply the principles of data visualization on toy datasets using R
CO-4: Analyze data towards decision making using visualization
CO-5: Identify appropriate/suitable visualization for particular requirements imposed
by the data type and analytics algorithms

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 2 2 2 3 3 - - - - - - 2 3 2 -
CO-2 1 1 2 2 3 - - - - - - 1 2 2 -
CO-3 2 2 1 1 3 - - - - - 1 1 3 2 2
CO-4 2 2 1 1 2 - - - - - 1 1 2 3 3
CO-5 1 1 2 2 1 - - - - - 2 1 1 2 2

Exercise 1: Basics
Introduction to basic components of R programming, overview of visualization, data
types, basics of plotting graphs, different types of graphs in analytics

Exercise 2: Importance of visualizations

Principles of communicating data, Principles of encoding data to make visualizations,
Importance of color in visualizations

Exercise 3: Plots using basic R

Exercise 3.1: Plots with one categorical, continuous variable

Functions in R for plotting, plots with one categorical variable, plots with one
continuous variable, plots with one categorical and one continuous variable

Exercise 3.2: Plots with 2 continuous variables

39
Plots with two continuous variables, controlling various aesthetics of the graph.

Exercise 4: ggplot2 in R
Group manipulation and data reshaping in R, understanding the philosophy of
ggplot2, bar plot, pie chart, histogram, boxplot, scatter plotand regression plots

Exercise 5: ggplot2 in R
Controlling aesthetics like colour, size, legend and facets.

Exercise 6: Data Visualization

Importing the data, Dimensions and measures, color code for various types of
variables

Exercise 7: Working with sheets

Understanding the worksheet, row and column shelves, showme card, filter and
pages shelf

Exercise 8: Calculations
Working with different measures, creating new calculated fields, Quick table
calculations, parameters and groups

Exercise 9: Graphs for Analytics

Calculate Proportions and percentages, Comparing current to historical and Actual
to Target

Exercise 10: Normal Distribution Variation

Calculate Mean and Median – Normal Distribution Variation and Uncertainty

Exercise 11: Reporting and Visualizing variation

Reporting and Visualizing variation, Control Charts Multiple Quantities – Scatter Plots,
Stacked bars, Regressions and trend lines

Exercise 12: Depicting changes over time

Depicting changes over time, Line Chart, Dual Axis Line Chart, scatterplot

Exercise 13: Reporting

Introduction to dashboard, use of filters in dashboard, Imbedding pictures, Insert live
webpage, story

TEXT BOOKS:
1. Microsoft Power BI, Marco Russo
2. R for everyone, Jarad P Lander
3. Statistics: An Introduction using R Michael J Crawley

REFERENCES:
1. Think Python, Allen Downey, Green Tea Press
2. Core Python Programming, W.Chun, Pearson
3. Introduction to Python, Kenneth A. Lambert, Cengage

ONLINE RESOURCES:
1. https://www.tableau.com/learn
2. https://tableauacademy.substack.com/p/tableau-training-and-learning-2021

VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY

40
B.Tech. IV Semester

(22PW4DS201) DESIGN THINKING

TEACHING SCHEME EVALUATION SCHEME

L T/P C D-D PE LR CP SEE TOTAL
0 4 2 10 10 10 10 60 100

COURSE OBJECTIVES:
• To instill a sense of significance towards applying creativity to product and service
design
• To teach a systematic approach to identifying and defining a problem before
brainstorming for a solution
• To inculcate core design principles and applied creativity to develop innovative
strategies that better connect engineers and technologies with their end users
• To build a mindset leading to flow of creative ideas, validating those ideas and
prioritizing the best ones among them
• To motivate students to apply design thinking while implementing projects focusing
on local, regional or global societal problems

COURSE OUTCOMES: After completion of the course, the student should be able to
CO-1: Demonstrate the understanding of design principles from a technology
perspective
CO-2: Validate problem statements through user empathisation with societal,
cultural, global and Environmental consciousness
CO-3: Use specific and relevant ideation and brainstorming techniques to find
innovative solutions
CO-4: Prototype a solution to address user challenges
CO-5: Investigate the cultural, emotional, Environmental, technological and business
factors relevant to developing new product or service design concept

COURSE ARTICULATION MATRIX:

(Correlation of Course Outcomes with Program Outcomes and Program Specific Outcomes using
mapping levels 1 = Slight, 2 = Moderate and 3 = Substantial)
PROGRAM SPECIFIC
PROGRAM OUTCOMES (PO)
OUTCOMES (PSO)
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3

CO-1 - - 2 - - 2 - - 3 3 1 1 - 2 1
CO-2 - - 3 2 1 3 - - 3 2 1 1 2 1 3
CO-3 - - 2 - - 2 - - 2 2 3 - - - 2
CO-4 - - 3 - 2 - - - 2 3 1 - - 1 2
CO-5 - - - 3 3 1 - 1 - 1 - - - 2

UNIT-I:
Design Overview and Doing Design: Various perspectives of design; Good and Bad
Design; Introduction to the Design Double Diamond: Discover-Define-Develop-
Deliver; Discover Phase- Looking for problems; Identifying Stakeholders and Defining
User Personas; User Empathization; Data collection, creating and conducting surveys
and Empathy Tools;

UNIT-II:

41
Need Analysis: Types of Users, Types of Needs; Market Size; Value Proposition to the
Users; Identifying Addressable Needs and Touch points; Structuring Need Statements;
Customer Experience (CX) Design; Service Design and Development Process;
Customer Journey Map (CJM), Service Experience Cycle.

UNIT-III:
Ideation Process: Introduction to creativity and closed-world solutions, Idea
generation techniques: Brainstorming, Mind Maps, SCAMPER, Systematic Inventive
Thinking methods (Subtraction, Multiplication, Division, Task Unification and Attribute
Dependency);
Strategic Innovation for competition in future: Linear Innovation vs. Non-linear
innovation, Understanding and identifying weak signals, 3-box thinking, 3-Box
framework and Box-3 ideation, Four-Action Framework (Eliminate-Reduce-Raise-
Create, or ERRC Matrix).

UNIT -IV:
Building Prototypes: Building Conceptual model of product/service using various
prototype methods, test a business model or business case to support the viability of
the solution using MVP.
Design for Sustainability: Concern for Environment and Sustainability in Design, Case
Studies to understand good Design For Environment (DFE) Decisions; Sustainable
Design Approaches in the five stages of the Product Life Cycle.

UNIT -V:
Capstone Project (Interdisciplinary): Applying design thinking principles and methods
for problem definition, ideation, prototyping, testing, refining and taking the solution
to the users, using visual representation tools to indicate problem, User persona, needs,
empathisation, ideas and prototype that leads to chosen solution, creating
presentation.

TEXT BOOKS:
1. Change by Design, Tim Brown, Harper Business, 2012 (ISBN: 978-0062337382)
2. The Design of Everyday Things, Donald A. Norman, MIT Press, 2013 (ISBN: 978-
0262525671)

REFERENCES:
1. The Art of Innovation, Tom Kelly, Jonathan Littman, HarperCollins Business, 2002
2. Design Thinking: Integrating Innovation, Customer Experience, and Brand Value,
Thomas Lockwood, Allworth Press, 2009 (ISBN: 978-1581156683)
3. Design Thinking for Start-ups: A Handbook for Readers and Workbook for
Practitioners, Jimmy Jain, Notion Press, 2018 (ISBN: 978-1642495034)

42