II B.Tech - CSE AI ML CSE AI R20 Course Structue Syllabi

R 20 Regulations
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

(Established by Govt. of A.P., ACT No.30 of 2008)
ANANTHAPURAMU – 515 002 (A.P) INDIA
Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science & Engineering (Artificial Intelligence)
II B.TECH.
Semester-III
S.No Course Code Course Name Category Hours per week Credits
L T P
1. 20A54304 Discrete Mathematics & Graph Theory BS 3 0 0 3
2. 20A04304T Digital Electronics& Microprocessors ES 3 0 0 3
3. 20A05301T Advanced Data Structures & Algorithms PC 3 0 0 3
4. 20A05302T Object Oriented Programming Through PC 3 0 0 3
Java
5. 20A05303 Computer Organization PC 3 0 0 3
6. 20A04304P Digital Electronics& Microprocessors Lab ES 0 0 3 1.5
7. 20A05301P Advanced Data Structures and Algorithms PC 0 0 3 1.5
Lab
8. 20A05302P Object Oriented Programming Through PC 0 0 3 1.5
Java Lab
9. 20A05304 Skill Oriented Course – I SC 1 0 2 2
Web application Development
10. 20A99201 Mandatory noncredit course - II MC 3 0 0 0
Environmental Science
Total 21.5
Semester-IV
S.No Course Code Course Name Category Hours per week Credits
L T P
1. 20A54404 Deterministic & Stochastic Statistical BS 3 0 0 3
Methods
2. 20A05401T Database Management Systems PC 3 0 0 3
3. 20A05402T Operating Systems PC 3 0 0 3
4. 20A30401T Artificial Intelligence PC 3 0 0 3
5. Humanities Elective– I HS 3 0 0 3
20A52301 Managerial Economics & Financial
Analysis
20A52302 Organizational Behaviour
20A52303 Business Environment
6. 20A05401P Database Management SystemsLab PC 0 0 3 1.5
7. 20A05402P Operating SystemsLab PC 0 0 3 1.5
8. 20A30401P Artificial Intelligence Lab PC 0 0 3 1.5
9. 20A05502P Skill Oriented Course– II SC 1 0 2 2
20A05404 Exploratory Data Analysis with R
10. Mandatory noncrdit course – III MC 2 1 0 0
20A99401 Design Thinking for Innovation
11. 20A99301 NSS/NCC/NSO Activities MC 0 0 2 0
Total 21.5
Community Service Internship/Project(Mandatory) for 6 weeks duration during summer vacation
Honors/Minor courses (The hours distribution can be 3-0-2 or 3-1-0 also) 4 0 0 4
R 20 Regulations

Note:
1. Eligible and interested students can register either for Honors or for a Minor in IV Semester as
per the guidelines issued by the University
2. Students shall register for NCC/NSS/NSO activities and will be required to participate in an
activity for two hours in a week during fourth semester.
3. Lateral entry students shall undergo a bridge course in Mathematics during third semester
R 20 Regulations

Course Code Discrete Mathematics & Graph theory L T P C

20A54304 (Common to CSE, IT, CSE( DS), CSE (IoT), CSE 3 0 0 3
(AI), CSE (AI & ML) and AI & DS)
Pre-requisite Basic Mathematics Semester III
Course Objectives:
Introduce the concepts of mathematical logic and gain knowledge in sets, relations and
functions and Solve problems using counting techniques and combinatorics and to introduce
generating functions and recurrence relations. Use Graph Theory for solving real world
problems
Course Outcomes (CO):
After completion of the course, students will be able to
• Apply mathematical logic to solve problems.
• Understand the concepts and perform the operations related to sets, relations and
functions.
• Gain the conceptual background needed and identify structures of algebraic nature.
• Apply basic counting techniques to solve combinatorial problems.
• Formulate problems and solve recurrence relations.
• Apply Graph Theory in solving computer science problems
UNIT - I Mathematical Logic 8 Hrs
Introduction, Statements and Notation, Connectives, Well-formed formulas, Tautology,
Duality law, Equivalence, Implication, Normal Forms, Functionally complete set of
connectives, Inference Theory of Statement Calculus, Predicate Calculus, Inference theory
of Predicate Calculus.
UNIT - II Set theory 9 Hrs
Basic Concepts of Set Theory, Relations and Ordering, The Principle of Inclusion-
Exclusion, Pigeon hole principle and its application,Functions composition of functions,
Inverse Functions, Recursive Functions, Lattices and its properties. Algebraic structures:
Algebraic systems-Examples and General Properties, Semi groups and Monoids, groups, sub
groups, homomorphism, Isomorphism.
UNIT - III Elementary Combinatorics 8 Hrs
Basics of Counting, Combinations and Permutations, Enumeration of Combinations and
Permutations, Enumerating Combinations and Permutations with Repetitions, Enumerating
Permutations with Constrained Repetitions, Binomial Coefficients, The Binomial and
Multinomial Theorems.
UNIT - IV Recurrence Relations 9 Hrs
R 20 Regulations

Generating Functions of Sequences, Calculating Coefficients of Generating Functions,
Recurrence relations, Solving Recurrence Relations by Substitution and Generating
functions, The Method of Characteristic roots, Solutions of Inhomogeneous Recurrence
Relations.
UNIT - V Graphs 9 Hrs
Basic Concepts, Isomorphism 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
Textbooks:
1. Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for
Computer Scientists & Mathematicians, 2nd Edition, Pearson Education.
2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications
to Computer Science, Tata McGraw Hill, 2002.
Reference Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics
and Graph Theory, 7th Edition, McGraw Hill Education (India) Private Limited.
2. Graph Theory with Applications to Engineering and Computer Science
byNarsinghDeo.
Online Learning Resources:
http://www.cs.yale.edu/homes/aspnes/classes/202/notes.pdf
R 20 Regulations

Course Code DIGITAL ELECTRONICS & L T P C
20A04304T MICROPROCESSORS 3 0 0 3
Pre-requisite Basic Electronics Semester III
Course Objectives:
• To understand all the concepts of Logic Gates and Boolean Functions.
• To learn about Combinational Logic and Sequential Logic Circuits.
• To design logic circuits using Programmable Logic Devices.
• To understand basics of 8086 Microprocessor and 8051 Microcontroller.
• To understand architecture of 8086 Microprocessor and 8051 Microcontroller.
• To learn Assembly Language Programming of 8086 and 8051.
After Completion of this course, the student will be able to:
• Design any Logic circuit using basic concepts of Boolean Algebra.
• Design any Logic circuit using basic concepts of PLDs.
• Design and develop any application using 8086 Microprocessor.
• Design and develop any application using 8051 Microcontroller.
UNIT - I Number Systems & Code Conversion
Number Systems & Code conversion, Boolean Algebra & Logic Gates, Truth Tables, Universal Gates,
Simplification of Boolean functions, SOP and POS methods – Simplification of Boolean functions
using K-maps,Signed and Unsigned Binary Numbers.
UNIT - II Combinational Circuits
Combinational Logic Circuits: Adders &Subtractors, Multiplexers, Demultiplexers, Encoders,
Decoders, Programmable Logic Devices.
UNIT - III Sequential Circuits
Sequential Logic Circuits: RS, Clocked RS, D, JK, Master Slave JK, T Flip-Flops, Shift Registers,
Types of Shift Registers, Counters, Ripple Counter, Synchronous Counters, Asynchronous Counters,
Up-Down Counter.
UNIT - IV Microprocessors - I
8085 microprocessor Review (brief details only), 8086 microprocessor, Functional Diagram, register
organization 8086, Flag register of 8086 and its functions, Addressing modes of 8086, Pin diagram of
8086, Minimum mode & Maximum mode operation of 8086, Interrupts in 8086.
UNIT – V Microprocessors - II
Instruction set of 8086, Assembler directives, Procedures and Macros, Simple programs involving
arithmetic, logical, branch instructions, Ascending, Descending and Block move programs, String
Manipulation Instructions. Overview of 8051 microcontroller, Architecture, I/O ports and Memory
organization, addressing modes and instruction set of 8051(Brief details only), Simple Programs.
Text Books:
1.M. Morris Mano, Michael D. Ciletti, Digital Design, Pearson Education, 5th Edition, 2013
2. Anil K. Maini, Digital Electronics: Principles, Devices and Applications, John Wiley & Sons, Ltd.,
2007.
3. N. Senthil Kumar, M. Saravanan, S. Jeevanathan, Microprocessor and
Microcontrollers,Oxford Publishers, 2010.
4. Advanced microprocessors and peripherals-A.K Ray and K.M.Bhurchandani, TMH, 2nd edition,
2006.
Reference Books:
R 20 Regulations

1. Thomas L. Floyd, Digital Fundamentals – A Systems Approach, Pearson, 2013.
2. Charles H. Roth, Fundamentals of Logic Design, Cengage Learning, 5th, Edition, 2004.
3. D.V.Hall, Microprocessors and Interfacing. TMGH, 2nd edition, 2006.
4. Kenneth.J.Ayala, The 8051 microcontroller, 3rd edition, Cengage Learning,2010.
NPTEL, SWAYAM
R 20 Regulations

Course Code Advanced Data Structures & Algorithms L T P C
20A05301T (Common to CSE, IT, CSE( DS), CSE (IoT), CSE (AI), CSE 3 0 0 3
(AI & ML) and AI & DS)
Pre-requisite Data Structures Semester III
Course Objectives:
• Learn asymptotic notations, and analyze the performance of different algorithms.
• Understand and implement various data structures.
• Learn and implement greedy, divide and conquer, dynamic programming and backtracking algorithms
using relevant data structures.
• Understand non-deterministic algorithms, polynomial and non-polynomial problems.
• Analyze the complexity of algorithms and apply asymptotic notations.
• Apply non-linear data structures and their operations.
• Understand and apply greedy, divide and conquer algorithms.
• Develop dynamic programming algorithms for various real-time applications.
• Illustrate Backtracking algorithms for various applications.
UNIT - I Introduction to Algorithms 9 Hrs

Introduction to Algorithms:
Algorithms, Pseudocode for expressing algorithms, Performance Analysis-Space complexity, Time
complexity, Asymptotic Notation- Big oh, Omega, Theta notation and Little oh notation, Polynomial Vs
Exponential Algorithms, Average, Best and Worst Case Complexities, Analysing Recursive Programs.
UNIT - II Trees Part-I 8 Hrs

Trees Part-I
Binary Search Trees: Definition and Operations, AVL Trees: Definition and Operations, Applications.
B Trees: Definition and Operations.
UNIT - III Trees Part-II 8 Hrs

Trees Part-II
Red-Black Trees, Splay Trees, Applications.
Hash Tables: Introduction, Hash Structure, Hash functions, Linear Open Addressing, Chaining and
Applications.
UNIT - IV Divide and conquer, Greedy method 9 Hrs

Divide and conquer: General method, applications-Binary search, Finding Maximum and minimum,
Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem,
Minimum cost spanning trees, Single source shortest path problem.
UNIT - V Dynamic Programming & Backtracking 9 Hrs

Dynamic Programming: General method, applications- 0/1 knapsack problem, All pairs shortest path
problem, Travelling salesperson problem, Reliability design.
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring,
Hamiltonian cycles.
Introduction to NP-Hard and NP-Complete problems: Basic Concepts.
Textbooks:
1. Data Structures and algorithms: Concepts, Techniques and Applications, G A V Pai.
R 20 Regulations

2. Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni and Rajasekharam, Galgotia
publications Pvt. Ltd.
Reference Books:
1. Classic Data Structures by D. Samanta, 2005, PHI
2. Design and Analysis of Computer Algorithms by Aho, Hopcraft, Ullman 1998, PEA.
3. Introduction to the Design and Analysis of Algorithms by Goodman, Hedetniemi, TMG.
https://www.tutorialspoint.com/advanced_data_structures/index.asp
http://peterindia.net/Algorithms.html
R 20 Regulations

Course Code Object Oriented Programming Through Java L T P C
20A05302T (Common to CSE, IT, CSE (AI), CSE (AI & ML) and AI& 3 0 0 3
DS)
Pre-requisite Fundamental Programming Semester III
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 design the GUIs using applets and swing controls.
• To understand the Java Database Connectivity Architecture
• Solve real-world problems using OOP techniques.
• Apply code reusability through inheritance, packages and interfaces
• Solve problems using java collection framework and I/O classes.
• Develop applications by using parallel streams for better performance.
• Develop applets for web applications.
• Build GUIs and handle events generated by user interactions.
• Use the JDBC API to access the database
UNIT - I Introduction 8Hrs

Introduction: Introduction to Object Oriented Programming, The History and Evolution of Java,
Introduction to Classes, Objects, Methods, Constructors, this keyword, Garbage Collection, Data Types,
Variables, Type Conversion and Casting, Arrays, Operators, Control Statements, Method Overloading,
Constructor Overloading, Parameter Passing, Recursion, String Class and String handling methods.
UNIT - II Inheritance, Packages, Interfaces 9Hrs
Inheritance: Basics, Using Super, Creating Multilevel hierarchy, Method overriding, Dynamic Method
Dispatch, Using Abstract classes, Using final with inheritance, Object class,
Packages: Basics, Finding packages and CLASSPATH, Access Protection, Importing packages.
Interfaces: Definition, Implementing Interfaces, Extending Interfaces, Nested Interfaces, Applying
Interfaces, Variables in Interfaces.
UNIT - III Exception handling, Stream based I/O (java.io) 9Hrs
Exception handling - Fundamentals, Exception types, Uncaught exceptions, using try and catch, multiple
catch clauses, nested try statements, throw, throws and finally, built-in exceptions, creating own exception
subclasses.
Stream based I/O (java.io) – The Stream classes-Byte streams and Character streams, Reading console
Input and Writing Console Output, File class, Reading and Writing Files, Random access file operations,
The Console class, Serialization, Enumerations, Autoboxing, Generics.
UNIT - IV Multithreading, The Collections Framework (java.util) 8Hrs
Multithreading: The Java thread model, Creating threads, Thread priorities, Synchronizing threads,
Interthread communication.
The Collections Framework (java.util): Collections overview, Collection Interfaces, The
Collectionclasses- Array List, Linked List, Hash Set, Tree Set, Priority Queue, Array Deque. Hashtable,
Properties, Stack, Vector, String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner.
UNIT - V Applet, GUI Programming with Swings, Accessing Databases 8Hrs
with JDBC
Applet: Basics, Architecture, Applet Skeleton, requesting repainting, using the status window, passing
parameters to applets
R 20 Regulations

GUI Programming with Swings – The origin and design philosophy of swing, components and containers,
layout managers, event handling, using a push button, jtextfield, jlabel and image icon, the swing buttons,
jtext field, jscrollpane, jlist, jcombobox, trees, jtable, An overview of jmenubar, jmenu and jmenuitem,
creating a main menu, showmessagedialog, showconfirmdialog, showinputdialog, showoptiondialog,
jdialog, create a modeless dialog.
Accessing Databases with JDBC:
Types of Drivers, JDBC Architecture, JDBC classes and Interfaces, Basic steps in developing JDBC
applications, Creating a new database and table with JDBC.
Textbooks:
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.
Reference Books:
1. Understanding Object-Oriented Programming with Java, updated edition, T. Budd, Pearson
Education.
2. Core Java Volume – 1 Fundamentals, Cay S. Horstmann, Pearson Education.
3. Java Programming for core and advanced learners, Sagayaraj, Dennis, Karthik andGajalakshmi,
University Press
4. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
5. Object Oriented Programming through Java, P. Radha Krishna, University Press.
6. Programming in Java, S. Malhotra, S. Chaudhary, 2nd edition, Oxford Univ. Press.
7. Java Programming and Object-oriented Application Development, R.A. Johnson,
Cengage Learning.
https://www.w3schools.com/java/java_oop.asp
http://peterindia.net/JavaFiles.html
R 20 Regulations

Course Code Computer Organization L T P C

20A05303 (Common to CSE, IT, CSE( DS), CSE (IoT), CSE (AI), CSE 3 0 0 3
(AI & ML) and AI & DS)
Pre-requisite Digital Electronics Semester III
Course Objectives:
• To learn the fundamentals of computer organization and its relevance to classical and modern
problems of computer design
• To understand the structure and behavior of various functional modules of a computer.
• To learn the techniques that computers use to communicate with I/O devices
• To acquire the concept of pipelining and exploitation of processing speed.
• To learn the basic characteristics of multiprocessors

• Understand computer architecture concepts related to the design of modern processors, memories
and I/Os
• Identify the hardware requirements for cache memory and virtual memory
• Design algorithms to exploit pipelining and multiprocessors
• Understand the importance and trade-offs of different types of memories.
• Identify pipeline hazards and possible solutions to those hazards
UNIT - I Basic Structure of Computer, Machine Instructions and 8Hrs

Programs
Basic Structure of Computer: Computer Types, Functional Units, Basic operational Concepts, Bus
Structure, Software, Performance, Multiprocessors and Multicomputer.
Machine Instructions and Programs: Numbers, Arithmetic Operations and Programs, Instructions and
Instruction Sequencing, Addressing Modes, Basic Input/output Operations, Stacks and Queues,
Subroutines, Additional Instructions.
UNIT - II Arithmetic, Basic Processing Unit 9Hrs

Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of
Positive Numbers, Signed-operand Multiplication, Fast Multiplication, Integer Division, Floating-Point
Numbers and Operations.
Basic Processing Unit: Fundamental Concepts, Execution of a Complete Instruction, Multiple-Bus
Organization, Hardwired Control, and Multi programmed Control.
UNIT - III The Memory System 8Hrs

The Memory System: Basic Concepts, Semiconductor RAM Memories, Read-Only Memories, Speed,
Size and Cost, Cache Memories, Performance Considerations, Virtual Memories, Memory Management
Requirements, Secondary Storage.
UNIT - IV Input/Output Organization 8Hrs

Input/Output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct Memory
Access, Buses, Interface Circuits, Standard I/O Interfaces.
UNIT - V Pipelining, Large Computer Systems 9 Hrs

Pipelining: Basic Concepts, Data Hazards, Instruction Hazards, Influence on Instruction Sets.
Large Computer Systems: Forms of Parallel Processing, Array Processors, The Structure of General-
Purpose multiprocessors, Interconnection Networks.
R 20 Regulations

Textbooks:
1. Carl Hamacher, ZvonkoVranesic, SafwatZaky, “Computer Organization”, 5th Edition, McGraw
Hill Education, 2013.
Reference Books:
1. M.Morris Mano, “Computer System Architecture”, 3rd Edition, Pearson Education.
2. Themes and Variations, Alan Clements, “Computer Organization and Architecture”, CENGAGE
Learning.
3. SmrutiRanjanSarangi, “Computer Organization and Architecture”, McGraw Hill Education.
4. John P.Hayes, “Computer Architecture and Organization”, McGraw Hill Education
https://nptel.ac.in/courses/106/103/106103068/
R 20 Regulations

Course Code DIGITAL ELECTRONICS & L T P C
20A04304P MICROPROCESSORS LAB 0 0 3 1.5
Pre-requisite Semester III

Basic Electronics Engineering,
Course Objectives:
• To understand all the concepts of Logic Gates and Boolean Functions.
• To learn about Combinational Logic and Sequential Logic Circuits.
• To design logic circuits using Programmable Logic Devices.
• To understand basics of 8086 Microprocessor and 8051 Microcontroller.
• To understand architecture of 8086 Microprocessor and 8051 Microcontroller.
• To learn Assembly Language Programming of 8086 and 8051.
After Completion of this course, the student will be able to:
• Design any Logic circuit using basic concepts of Boolean Algebra.
• Design any Logic circuit using basic concepts of PLDs.
• Design and develop any application using 8086 Microprocessor.
• Design and develop any application using 8051 Microcontroller.
List of Experiments:
Note: Minimum of 12 (6+6) experiments shall be conducted from both the sections
given below:
DIGITAL ELECTRONICS:
1. Verification of Truth Table for AND, OR, NOT, NAND, NOR

and EX-OR gates.
2. Realisation of NOT, AND, OR, EX-OR gates with only NAND
and only NOR gates.
3. Karnaughmap Reduction and Logic Circuit Implementation.
4. Verification of DeMorgan’s Laws.
5. Implementation of Half-Adder and Half-Subtractor.
6. Implementation of Full-Adder and Full-Subtractor.
7. Four Bit Binary Adder
8. Four Bit Binary Subtractor using 1’s and 2’s Complement.
MICROPROCESSORS (8086 Assembly Language Programming)
1. 8 Bit Addition and Subtraction.

2. 16 Bit Addition.
3. BCD Addition .
4. BCD Subtraction.
5. 8 Bit Multiplication.
6. 8 Bit Division.
7. Searching for an Element in an Array.
8. Sorting in Ascending and Descending Orders.
9. Finding Largest and Smallest Elements from an Array.
10. Block Move
Text Books:
R 20 Regulations

1.M. Morris Mano, Michael D. Ciletti, Digital Design, Pearson Education, 5th Edition,
2013.
2. Anil K. Maini, Digital Electronics: Principles, Devices and Applications, John Wiley & Sons, Ltd.,
2007.
3. N. Senthil Kumar, M. Saravanan, S. Jeevanathan, Microprocessor and
Microcontrollers,Oxford Publishers, 2010.
4. Advanced microprocessors and peripherals-A.K ray and K.M.Bhurchandani, TMH, 2nd edition,
2006.
Reference Books:
1. Thomas L. Floyd, Digital Fundamentals – A Systems Approach, Pearson, 2013.
2. Charles H. Roth, Fundamentals of Logic Design, Cengage Learning, 5th, Edition, 2004.
3. D.V.Hall, Microprocessors and Interfacing. TMGH, 2nd edition, 2006.
4. Kenneth. J. Ayala, The 8051 microcontroller, 3rd edition, Cengage Learning, 2010.
Online Learning Resources/Virtual Labs:
https://www.vlab.co.in/
R 20 Regulations

Course Code Advanced Data Structures and Algorithms Lab L T P C
20A05301P (Common to CSE, IT, CSE( DS), CSE (IoT), CSE 0 0 3 1.5
Pre-requisite Basics of Data Structures Semester III
Course Objectives:
• Learn data structures for various applications.
• Implement different operations of data structures by optimizing the performance.
• Develop applications using Greedy, Divide and Conquer, dynamic programming.
• Implement applications for backtracking algorithms using relevant data structures.
• Understand and apply data structure operations.
• Understand and apply non-linear data structure operations.
• Apply Greedy, divide and conquer algorithms.
• Develop dynamic programming algorithms for various real-time applications.
• Illustrate and apply backtracking algorithms, further able to understand non-deterministic
algorithms.
1. Write a program to implement the following operations on Binary Search Tree:
a) Insert b) Delete c) Search d) Display
2. Write a program to perform a Binary Search for a given set of integer values.
3. Write a program to implement Splay trees.
4. Write a program to implement Merge sort for the given list of integer values.
5. Write a program to implement Quicksort for the given list of integer values.
6. Write a program to find the solution for the knapsack problem using the greedy method.
7. Write a program to find minimum cost spanning tree using Prim’s algorithm
8. Write a program to find minimum cost spanning tree using Kruskal’s algorithm
9. Write a program to find a single source shortest path for a given graph.
10. Write a program to find the solution for job sequencing with deadlines problems.
11. Write a program to find the solution for a 0-1 knapsack problem using dynamic programming.
12. Write a program to solve Sum of subsets problem for a given set of distinct numbers using
backtracking.
13. Implement N Queen's problem using Back Tracking.
References:
1. Y Daniel Liang, “Introduction to Programming using Python”, Pearson.
2. Benjamin Baka, David Julian, “Python Data Structures and Algorithms”, Packt Publishers,2017.
3. Rance D. Necaise, “Data Structures and Algorithms using Python”, Wiley Student Edition.
http://cse01-iiith.vlabs.ac.in/
http://peterindia.net/Algorithms.html
R 20 Regulations

Course Code Object Oriented Programming Through Java Lab L T P C
20A05302P (Common to CSE, IT, CSE (AI), CSE (AI & ML) and 0 0 3 1.5
AI& DS)
Pre-requisite Fundamental Programming Semester III
Course Objectives:
• To introduce the concepts of Java.
• To Practice object-oriented programs and build java applications.
• To implement java programs for establishing interfaces.
• To implement sample programs for developing reusable software components.
• To establish database connectivity in java and implement GUI applications.
• Recognize the Java programming environment.
• Develop efficient programs using multithreading.
• Design reliable programs using Java exception handling features.
• Extend the programming functionality supported by Java.
• Select appropriate programming constructs to solve a problem.
Week-1
a. Installation of Java software, study of any Integrated development environment, Use Eclipse or
Netbeans 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=0. Read in a,
b, c and use the quadratic formula.
c. Develop a Java application to generate Electricity bills. Create a class with the following members:
Consumer no., consumer name, previous month reading, current month reading, type of EB connection
(i.e domestic or commercial). Commute the bill amount using the following tariff.
If the type of the EB connection is domestic, calculate the amount to be paid as follows:
• First 100 units - Rs. 1 per unit
• 101-200 units - Rs. 2.50 per unit
• 201 -500 units - Rs. 4 per unit
• > 501 units - Rs. 6 per unit
If the type of the EB connection is commercial, calculate the amount to be paid as follows:
• First 100 units - Rs. 2 per unit
• 101-200 units - Rs. 4.50 per unit
• 201 -500 units - Rs. 6 per unit
• > 501 units - Rs. 7 per unit
d. Write a Java program to multiply two given matrices.
Week-2
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 Java program that inputs 5 numbers, each between 10 and 100 inclusive. As each number is
read, display it only if it’s not a duplicate of any number already read display the complete set of
unique values input after the user enters each new value.
R 20 Regulations

b. Write a Java Program to create an abstract class named Shape that contains two integers and an
empty method named print Area(). Provide three classes named Rectangle, Triangle and Circle such
that each one of the classes extends the class Shape. Each one of the classes contains only the
method print Area () that prints the area of the given shape.
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 StringToknizer class.
Week-4
a. Write a Java program to implement user defined exception handling.
b. Write java program that inputs 5 numbers, each between 10 and 100 inclusive. As each number
is read display it only if it‘s not a duplicate of any number already read. Display the complete set
of unique values input after the user enters each new value.
Week-5
a. Write a Java program that creates a user interface to perform integer division. The user enters
two numbers in the text fields, Num1 and Num2. The division of Num1 and Num2 is displayed
in the Result field when the Divide button is clicked. If Num1 and Num2 were not integers, the
program would throw a Number Format Exception. If Num2 were zero, the program would throw
an Arithmetic Exception Display the exception in a message dialog box.
b. 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.
Week-6
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 file exists, whether the file is readable, or writable, the type of file and the length of the file
in bytes.
Week-7
a. Write a java program that displays the number of characters, lines and words in a text file.
b. Write a java program that reads a file and displays the file on the screen with line number before
each line.
Week-8
a. Write a Java program that correctly implements the producer-consumer problem using the
concept of inter thread communication.
b. Develop a Java application for stack operation using Buttons and JOptionPane input and
Message dialog box.
c. Develop a Java application to perform Addition, Division, Multiplication and subtraction using
the JOptionPane dialog Box and Textfields.
Week-9
a. Develop a Java application for the blinking eyes and mouth should open while blinking.
b. Develop a Java application that simulates a traffic light. The program lets the user select one of
the three lights: Red, Yellow or Green with radio buttons. On selecting a button an appropriate
message with ―STOP‖ or ―READY‖ or ‖GO‖ should appear above the buttons in the selected color.
Initially, there is no message shown.
Week-10
a. Develop a Java application to implement the opening of a door while opening man should
present before hut and closing man should disappear.
b. Develop a Java application by using JtextField to read decimal values and converting a decimal
number into a binary number then print the binary value in another JtextField.
Week-11
a. Develop a Java application that handles all mouse events and shows the event name at the center
of the window when a mouse event is fired. Use adapter classes.
R 20 Regulations

b. Develop a Java application to demonstrate the key event handlers.
Week-12
a. Develop a Java application to find the maximum value from the given type of elements using a
generic function.
b. Develop a Java application that works as a simple calculator. Use a grid layout to arrange buttons
for the digits and for the +, -,*, % operations. Add a text field to display the result.
c . Develop a Java application for handling mouse events.
Week-13
a. Develop a Java application to establish a JDBC connection, create a table student with properties
name, register number, mark1, mark2, mark3. Insert the values into the table by using java and
display the information of the students at front end.
References:
1. P. J. Deitel, H. M. Deitel, “Java for Programmers”, Pearson Education, PHI, 4th Edition, 2007.
2. P. Radha Krishna, “Object Oriented Programming through Java”, Universities Press, 2nd Edition,
2007
3. Bruce Eckel, “Thinking in Java”, Pearson Education, 4th Edition, 2006.
4. Sachin Malhotra, Saurabh Chaudhary, “Programming in Java”, Oxford University Press, 5th
Edition, 2010.
https://java-iitd.vlabs.ac.in/
http://peterindia.net/JavaFiles.html
R 20 Regulations

Course Code Web Application Development L T P C
20A05304 (Common to CSE, CSE (AI), CSE (AI & ML) and 1 0 2 2
AI& DS)
Pre-requisite Semester III
Course Objectives:
• Learn website development using HTML, CSS, JavaScript.
• Understand the concepts of responsive web development using the bootstrap framework
• Make use of the JQueryjavascript library to provide interactiveness to the websites.
• Discover how to use Google Charts to provide a better way to visualize data on a website
• 5. Learn Content Management Systems to speed the development process
• Construct web sites with valid HTML, CSS, JavaScript
• Create responsive Web designs that work on phones, tablets, or traditional laptops and wide-
screen monitors.
• Develop websites using jQuery to provide interactivity and engaging user experiences
• Embed Google chart tools in a website for better visualization of data.
• Design and develop web applications using Content Management Systems like WordPress
Activities:
Module - 1:
HTML: What is a browser?, What is HTML?, Elements and Tags, Basic HTML5 structure, Metadata,
<title>, Adding favicon, Comments, headings
Task: Create a Basic HTML document
Module - 2:
HTML (continued): Block-Level Elements & Inline Elements, Links (Understand Absolute vs Relative
paths), Lists, Images, iframe (embed youtube video)
Task: Create your Profile Page
Module - 3:
HTML (continued): Tables: <table>, <tr>, <th>, <td>, Attributes for each Table element
Task: Create a Class Timetable (to merge rows/columns, use rowspan/colspan)
Module - 4:
HTML (continued): Form Elements: <input>, <select>, <textarea>, <button>, Attributes for each
Form element
Task: Create a Student Hostel Application Form
Module - 5:
Cascading Style Sheets (CSS): CSS Properties, Types of CSS, Selectors, box model, Pseudo-elements,
z-index
Task: Make the Hostel Application Form designed in Module -4 beautiful using CSS (add colors,
backgrounds, change font properties, borders, etc.)
Module - 6:
Bootstrap - CSS Framework: Layouts (Containers, Grid system), Forms, Other Components
Task: Style the Hostel Application Form designed in Module-5still more beautiful using Bootstrap
CSS (Re-size browser and check how the webpage displays in mobile resolution)
Module - 7:
R 20 Regulations

HTTP & Browser Developer Tools: Understand HTTP Headers (Request & Response Headers), URL
& its Anatomy, Developer Tools: Elements/Inspector, Console, Network, Sources, performance,
Application Storage.
Task:Analyse various HTTP requests (initiators, timing diagrams, responses) and identify problems if
any.
Module - 8:
Javascript: Variables, Data Types, Operators, Statements, Objects, Functions, Events & Event
Listeners, DOM.
Task: Design a simple calculator using JavaScript to perform sum, product, difference, and quotient
operations:
Module - 9:
Dynamic HTML with JavaScript: Manipulate DOM, Error Handling, Promises, async/await, Modules.
Task:Design& develop a Shopping Cart Application with features including Add Products, Update
Quantity, Display Price(Sub-Total & Total), Remove items/products from the cart.
Module - 10:
JQuery - A Javascript Library: Interactions, Widgets, Effects, Utilities, Ajax using JQuery.
Task: Validate all Fields and Submit the Hostel Application Form designed in Module-6 using JQuery
Module - 11:
Google Charts: Understand the Usage of Pie chart, Bar Chart, Histogram, Area & Line Charts, Gantt
Charts.
Task: Develop an HTML document to illustrate each chart with real-time examples.
Module - 12:
Open Source CMS (Content Management System): What is a CMS?, Install CMS, Themes, Plugins.
Task: Develop an E-learning website using any CMS(for example WordPress)
References:
1. Deitel and Deitel and Nieto, ―Internet and World Wide Web - How to Program‖, Prentice
Hall, 5th Edition, 2011.
2. Web Technologies, Uttam K. Roy, Oxford Higher Education., 1st edition, 10th impression,
2015.
3. Stephen Wynkoop and John Burke ―Running a Perfect Website‖, QUE, 2nd Edition,1999.
4. Jeffrey C and Jackson, ―Web Technologies A Computer Science
PerspectivePearsonEducation, 2011.
5. Gopalan N.P. and Akilandeswari J., ―Web Technology, Prentice Hall of India, 2011.
a. HTML: https://html.spec.whatwg.org/multipage/
b. HTML: https://developer.mozilla.org/en-US/docs/Glossary/HTML5
c. CSS: https://www.w3.org/Style/CSS/
d. Bootstrap - CSS Framework: https://getbootstrap.com/
e. Browser Developer Tools: https://developer.mozilla.org/en-
US/docs/Learn/Common_questions/What_are_browser_developer_tools
f. Javascript: https://developer.mozilla.org/en-US/docs/Web/JavaScript
g. JQuery: https://jquery.com
h. Google Charts: https://developers.google.com/chart
i. Wordpress: https://wordpress.com
R 20 Regulations

Course Code ENVIRONMENTAL SCIENCE L T P C
20A99201 (Common to All Branches of Engineering) 3 0 0 0
Pre-requisite NIL Semester III
Course Objectives:
• To make the students to get awareness on environment
• To understand the importance of protecting natural resources, ecosystems for future generations
and pollution causes due to the day to day activities of human life
• To save earth from the inventions by the engineers.

At the end of the course, the student will be able to
• Grasp multidisciplinary nature of environmental studies and various renewable and nonrenewable
resources.
• Understand flow and bio-geo- chemical cycles and ecological pyramids.
• Understand various causes of pollution and solid waste management and related preventive
measures.
• About the rainwater harvesting, watershed management, ozone layer depletion and waste land
reclamation.
• Casus of population explosion, value education and welfare programmes.
UNIT - I 8 Hrs
Multidisciplinary Nature Of Environmental Studies: – Definition, Scope and Importance – Need for
Public Awareness.
Natural Resources : Renewable and non-renewable resources – Natural resources and associated
problems – Forest resources – Use and over – exploitation, deforestation, case studies – Timber extraction
– Mining, dams and other effects on forest and tribal people – Water resources – Use and over utilization
of surface and ground water – Floods, drought, conflicts over water, dams – benefits and problems –
Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources,
case studies – Food resources: World food problems, changes caused by agriculture and overgrazing,
effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. – Energy
resources:
UNIT - II 12 Hrs
Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem – Producers, consumers
and decomposers – Energy flow in the ecosystem – Ecological succession – Food chains, food webs and
ecological pyramids – Introduction, types, characteristic features, structure and function of the following
ecosystem:
a. Forest ecosystem.
b. Grassland ecosystem
c. Desert ecosystem
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Biodiversity And Its Conservation : Introduction 0 Definition: genetic, species and ecosystem diversity
– Bio-geographical classification of India – Value of biodiversity: consumptive use, Productive use, social,
ethical, aesthetic and option values – Biodiversity at global, National and local levels – India as a mega-
diversity nation – Hot-sports of biodiversity – Threats to biodiversity: habitat loss, poaching of wildlife,
man-wildlife conflicts – Endangered and endemic species of India – Conservation of biodiversity: In-situ
and Ex-situ conservation of biodiversity.
UNIT - III 8 Hrs
R 20 Regulations

Environmental Pollution: Definition, Cause, effects and control measures of :
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and industrial wastes – Role of
an individual in prevention of pollution – Pollution case studies – Disaster management: floods,
earthquake, cyclone and landslides.
UNIT - IV 10 Hrs
Social Issues and the Environment: From Unsustainable to Sustainable development – Urban problems
related to energy – Water conservation, rain water harvesting, watershed management – Resettlement and
rehabilitation of people; its problems and concerns. Case studies – Environmental ethics: Issues and
possible solutions – Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents
and holocaust. Case Studies – Wasteland reclamation. – Consumerism and waste products. – Environment
Protection Act. – Air (Prevention and Control of Pollution) Act. – Water (Prevention and control of
Pollution) Act – Wildlife Protection Act – Forest Conservation Act – Issues involved in enforcement of
environmental legislation – Public awareness.
UNIT - V 8 Hrs
Human Population And The Environment: Population growth, variation among nations. Population
explosion – Family Welfare Programmes. – Environment and human health – Human Rights – Value
Education – HIV/AIDS – Women and Child Welfare – Role of information Technology in Environment
and human health – Case studies.
Field Work: Visit to a local area to document environmental assets River/forest grassland/hill/mountain –
Visit to a local polluted site-Urban/Rural/Industrial/Agricultural Study of common plants, insects, and
birds – river, hill slopes, etc..
Textbooks:
1. Text book of Environmental Studies for Undergraduate Courses ErachBharucha for University
Grants Commission, Universities Press.
2. Palaniswamy, “Environmental Studies”, Pearson education
3. S.AzeemUnnisa, “Environmental Studies” Academic Publishing Company
4. K.Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate Courses as per
UGC model syllabus”, Scitech Publications (India), Pvt. Ltd.
Reference Books:
1. Deeksha Dave and E.Sai Baba Reddy, “Textbook of Environmental Science”, Cengage
Publications.
2. M.Anji Reddy, “Text book of Environmental Sciences and Technology”, BS Publication.
3. J.P.Sharma, Comprehensive Environmental studies, Laxmi publications.
4. J. Glynn Henry and Gary W. Heinke, “Environmental Sciences and Engineering”, Prentice hall of
India Private limited
5. G.R.Chatwal, “A Text Book of Environmental Studies” Himalaya Publishing House
6. Gilbert M. Masters and Wendell P. Ela, “Introduction to Environmental Engineering and Science,
Prentice hall of India Private limited.
R 20 Regulations

Course Code Deterministic & Stochastic Statistical Methods L T P C
20A54404 (Common to CSE, IT,CSE (AI), CSE (AI & ML) and AI & 3 0 0 3
DS)
Pre-requisite Basic Mathematics Semester IV

Course Objectives:
This course provides a study of various Mathematical Methods and Statistical Methods which is needed for
Artificial Intelligence, Machine Learning, and Data Science and also for Computer Science and engineering
problems.
• Apply logical thinking to problem-solving in context.
• Employ methods related to these concepts in a variety of data science applications.
• Use appropriate technology to aid problem-solving and data analysis.
• The Bayesian process of inference in probabilistic reasoning system.
• Demonstrate skills in unconstrained optimization.
UNIT - I Data Representation 9 Hrs
Distance measures, Projections, Notion of hyper planes, half-planes. Principal Component Analysis- Population
Principal Components, sample principal coefficients, covariance, matrix of data set, Dimensionality reduction,
Singular value decomposition, Gram Schmidt process.
UNIT - II Single Variable Distribution 9 Hrs
Random variables (discrete and continuous), probability density functions, properties, mathematical expectation-
Probability distribution - Binomial, Poisson approximation to the binomial distribution and normal distribution-
their properties-Uniform distribution-exponential distribution.
UNIT - III Stochastic Processes And Markov Chains: 9 Hrs
Introduction to Stochastic processes- Markov process. Transition Probability, Transition Probability Matrix, First
order and Higher order Markov process, step transition probabilities, Markov chain, Steady state condition,
Markov analysis.
UNIT - IV Multivariate Distribution Theory 10 Hrs
Multivariate Normal distribution – Properties, Distributions of linear combinations, independence, marginal
distributions, conditional distributions, Partial and Multiple correlation coefficient. Moment generating function.
BAYESIAN INFERENCE AND ITS APPLICATIONS: Statistical tests and Bayesian model comparison, Bit,
Surprisal,Entropy, Source coding theorem, Joint entropy, Conditional entropy, Kullback-Leibler divergence.
UNIT - V Optimization 9 Hrs
Unconstrained optimization, Necessary and sufficiency conditions for optima, Gradient descent methods,
Constrained optimization, KKT conditions, Introduction to non-gradient techniques, Introduction to least squares
optimization, Optimization view of machine learning. Data Science Methods: Linear regression as an exemplar
function approximation problem, linear classification problems.
Textbooks:
1. Mathematics for Machine Learning by A. Aldo Faisal, Cheng Soon Ong, and Marc Peter Deisenroth
2. Dr.B.S Grewal, Higher Engineering Mathematics, 45th Edition, Khanna Publishers.
3. Operations Research, S.D. Sharma
Reference Books:
1. Operations Research, An Introduction, Hamdy A. Taha, Pearson publishers.
2. A Probabilistic Theory of Pattern Recognition by Luc Devroye,. Laszlo Gyorfi, Gabor Lugosi.
https://www.math.brown.edu/swatson2/classes/data1010/pdf/data1010.pdf
R 20 Regulations

Course Code DATABASE MANAGEMENT SYSTEMS L T P C
20A05401T (Common to CSE, IT, CSE( DS), CSE (IoT), CSE (AI), 3 0 0 3
CSE (AI & ML) and AI & DS)
Pre-requisite NIL Semester IV
Course Objectives:
This course is designed to:
• Train in the fundamental concepts of database management systems, database modeling and design,
SQL, PL/SQL and system implementation techniques.
• Enable students to model ER diagrams for any customized application
• Inducting appropriate strategies for optimization of queries.
• Provide knowledge on concurrency techniques
• Demonstrate the organization of Databases
• Design a database for a real-world information system
• Define transactions that preserve the integrity of the database
• Generate tables for a database
• Organize the data to prevent redundancy
• Pose queries to retrieve the information from the database.
UNIT - I Introduction, Introduction to Relational Model 9Hrs
Introduction: Database systems applications, Purpose of Database Systems, view of Data, Database Languages,
Relational Databases, Database Design, Data Storage and Querying, Transaction Management, Database
Architecture, Data Mining and Information Retrieval, Specialty Databases, Database users and Administrators,
Introduction to Relational Model: Structure of Relational Databases, Database Schema, Keys, Schema
Diagrams, Relational Query Languages, Relational Operations
UNIT - II Introduction to SQL, Advanced SQL 9 Hrs
Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, Basic Structure of SQL
Queries, Additional Basic Operations, Set Operations, Null Values, Aggregate Functions, Nested Sub-queries,
Modification of the Database. Intermediate SQL: Joint Expressions, Views, Transactions, Integrity Constraints,
SQL Data types and schemas, Authorization.
Advanced SQL: Accessing SQL from a Programming Language, Functions and Procedures, Triggers, Recursive
Queries, OLAP, Formal relational query languages.
UNIT - III Database Design and the E-R Model, Relational Database Design 8Hrs
Database Design and the E-R Model: Overview of the Design Process, The Entity-Relationship Model,
Constraints, Removing Redundant Attributes in Entity Sets, Entity-Relationship Diagrams, Reduction to
Relational Schemas, Entity-Relationship Design Issues.
Relational Database Design:
Features of Good Relational Designs, Atomic Domains and First Normal Form, Decomposition Using Functional
Dependencies, Functional-Dependency Theory, Algorithms for Decomposition, Decomposition Using
Multivalued Dependencies, More Normal Forms.
UNIT - IV Query Processing, Query optimization 8 Hrs
Query Processing: Overview, Measures of Query cost, Selection operation, sorting, Join Operation, other
operations, Evaluation of Expressions.
Query optimization: Overview, Transformation of Relational Expressions, Estimating statistics of Expression
results, Choice of Evaluation Plans, Materialized views, Advanced Topics in Query Optimization.
UNIT - V Transaction Management, Concurrency Control, Recovery 10Hrs
System
Transaction Management:
R 20 Regulations

Transactions: Concept, A Simple Transactional Model, Storage Structures, Transaction Atomicity and
Durability, Transaction Isolation, Serializability, Isolation and Atomicity, Transaction Isolation Levels,
Implementation of Isolation Levels, Transactions as SQL Statements.
Concurrency Control: Lock-based Protocols, Deadlock Handling, Multiple granularity, Timestamp-based
Protocols, and Validation-based Protocols.
Recovery System: Failure Classification, Storage, Recovery and Atomicity, Recovery Algorithm, Buffer
Management, Failure with Loss of Nonvolatile Storage, Early Lock Release and Logical Undo Operations.
Textbooks:
1. A.Silberschatz, H.F.Korth, S.Sudarshan, “Database System Concepts”,6/e, TMH 2019
Reference Books:
1. Database Management System, 6/e RamezElmasri, Shamkant B. Navathe, PEA
2. Database Principles Fundamentals of Design Implementation and Management, Carlos Coronel, Steven
Morris, Peter Robb, Cengage Learning.
3.Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke,TMH
https://onlinecourses.nptel.ac.in/noc21_cs04/preview
R 20 Regulations

Course Code OPERATING SYSTEMS L T P C
20A05402T (Common to CSE, IT, CSE( DS), CSE (IoT), CSE 3 0 0 3
Pre-requisite Basics of CO and DBMS Semester IV
Course Objectives:
The course is designed to
• Understand basic concepts and functions of operating systems
• Understand the processes, threads and scheduling algorithms.
• Provide good insight on various memory management techniques
• Expose the students with different techniques of handling deadlocks
• Explore the concept of file-system and its implementation issues
• Familiarize with the basics of the Linux operating system
• Implement various schemes for achieving system protection and security
• Realize how applications interact with the operating system
• Analyze the functioning of a kernel in an Operating system.
• Summarize resource management in operating systems
• Analyze various scheduling algorithms
• Examine concurrency mechanism in Operating Systems
• Apply memory management techniques in the design of operating systems
• Understand the functionality of the file system
• Compare and contrast memory management techniques.
• Understand deadlock prevention and avoidance.
• Perform administrative tasks on Linux based systems.
UNIT - I Operating Systems Overview, System Structures 8Hrs
Operating Systems Overview: Introduction, Operating system functions, Operating systems
operations, Computing environments, Open-Source Operating Systems
System Structures: Operating System Services, User and Operating-System Interface, systems calls,
Types of System Calls, system programs, Operating system Design and Implementation, Operating
system structure, Operating system debugging, System Boot.
UNIT - II Process Concept, Multithreaded Programming,Process 10Hrs
Scheduling, Inter-process Communication
Process Concept: Process scheduling, Operations on processes, Inter-process communication,
Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading issues, Examples.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple processor
scheduling, Thread scheduling, Examples.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers, Classical IPC
Problems - Dining philosophers problem, Readers and writers problem.
UNIT - III Memory-Management Strategies, Virtual Memory Lecture 8Hrs
Management
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation, Paging,
Segmentation, Examples.
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement,
Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation, Examples.
UNIT - IV Deadlocks, File Systems Lecture 9Hrs
R 20 Regulations

Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock detection And
recovery, Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation, management and optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling, RAID
structure, Stable storage implementation.
UNIT - V System Protection, System Security Lecture 8Hrs
System Protection: Goals of protection, Principles and domain of protection, Access matrix, Access
control, Revocation of access rights.
System Security: Introduction, Program threats, System and network threats, Cryptography as a
security, User authentication, implementing security defenses, firewalling to protect systems and
networks, Computer security classification.
Case Studies: Linux, Microsoft Windows.
Textbooks:
1. Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley,
2016.
2. Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008.
(Topics: Inter-process Communication and File systems.)
Reference Books:
1. Tanenbaum A S, Woodhull A S, Operating Systems Design and Implementation, 3rd edition,
PHI, 2006.
2. Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-
Hill, 2012.
3. Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
Education, 2009
4. Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004
http://peterindia.net/OperatingSystems.html
R 20 Regulations

Course Code ARTIFICIAL INTELLIGENCE L T P C

20A30401T 3 0 0 3
(Common to CSE (AI), CSE (AI & ML) and AI & DS)
Pre-requisite Mathematics and Programming Semester IV
Course Objectives:
• To introduce Artificial Intelligence
• To Teach about the machine learning environment
• To Present the searching Technique for Problem Solving
• To Introduce Natural Language Processing and Robotics
• Apply searching techniques for solving a problem
• Design Intelligent Agents
• Develop Natural Language Interface for Machines
• Design mini robots
• Summarize past, present and future of Artificial Intelligence
UNIT - I Introduction Lecture 8Hrs
Introduction: What is AI, Foundations of AI, History of AI, The State of Art.
Intelligent Agents: Agents and Environments, Good Behaviour: The Concept of Rationality, The
Nature of Environments, The Structure of Agents.
UNIT - II Solving Problems by searching Lecture 8Hrs
Problem Solving Agents, Example problems, Searching for Solutions, Uninformed Search Strategies,
Informed search strategies, Heuristic Functions, Beyond Classical Search: Local Search Algorithms
and Optimization Problems, Local Search in Continues Spaces, Searching with Nondeterministic
Actions, Searching with partial observations, online search agents and unknown environments.
UNIT - III Reinforcement Learning & Natural Language Lecture 9Hrs
Processing
Reinforcement Learning: Introduction, Passive Reinforcement Learning, Active Reinforcement
Learning, Generalization in Reinforcement Learning, Policy Search, applications of RL
Natural Language Processing: Language Models, Text Classification, Information Retrieval,
Information Extraction.
UNIT - IV Natural Language for Communication Lecture 9Hrs
Natural Language for Communication: Phrase structure grammars, Syntactic Analysis, Augmented
Grammars and semantic Interpretation, Machine Translation, Speech Recognition
Perception: Image Formation, Early Image Processing Operations, Object Recognition by appearance,
Reconstructing the 3D World, Object Recognition from Structural information, Using Vision.
UNIT - V Robotics Lecture 8 Hrs
Robotics: Introduction, Robot Hardware, Robotic Perception, Planning to move, Planning uncertain
movements, Moving, Robotic software architectures, application domains
Philosophical foundations: Weak AI, Strong AI, Ethics and Risks of AI, Agent Components, Agent
Architectures, Are we going in the right direction, What if AI does succeed.
Textbooks:
1. Stuart J.Russell, Peter Norvig, “Artificial Intelligence A Modern Approach”, 3rd Edition,
Pearson Education, 2019.
Reference Books:
R 20 Regulations

1. Nilsson, Nils J., and Nils Johan Nilsson. Artificial intelligence: a new synthesis. Morgan
Kaufmann, 1998.
2. Johnson, Benny G., Fred Phillips, and Linda G. Chase. "An intelligent tutoring system for the
accounting cycle: Enhancing textbook homework with artificial intelligence." Journal of
Accounting Education 27.1 (2009): 30-39.
http://peterindia.net/AILinks.html
R 20 Regulations

Course Code MANAGERIAL ECONOMICS AND FINANCIAL L T P C
20A52301 ANALYSIS 3 0 0 3
(Common to All branches of Engineering)
Course Objectives:
• To inculcate the basic knowledge of micro economics and financial accounting
• To make the students learn how demand is estimated for different products, input-output
relationship for optimizing production and cost
• To Know the Various types of market structure and pricing methods and strategy
• To give an overview on investment appraisal methods to promote the students to learn how to
plan long-term investment decisions.
• To provide fundamental skills on accounting and to explain the process of preparing financial
statements
• Define the concepts related to Managerial Economics, financial accounting and management.
• Understand the fundamentals of Economics viz., Demand, Production, cost, revenue and
markets
• Apply the Concept of Production cost and revenues for effective Business decision
• Analyze how to invest their capital and maximize returns
• Evaluate the capital budgeting techniques
• Develop the accounting statements and evaluate the financial performance of business entity.
UNIT - I Managerial Economics
Introduction – Nature, meaning, significance, functions, and advantages. Demand-Concept, Function,

Law of Demand - Demand Elasticity- Types – Measurement. Demand Forecasting- Factors governing
Forecasting, Methods. Managerial Economics and Financial Accounting and Management.
UNIT - II Production and Cost Analysis
Introduction – Nature, meaning, significance, functions and advantages. Production Function– Least-
cost combination– Short run and Long run Production Function- Isoquants and Isocosts, MRTS -
Cobb-Douglas Production Function - Laws of Returns - Internal and External Economies of scale. Cost
& Break-Even Analysis - Cost concepts and Cost behavior- Break-Even Analysis (BEA) -
Determination of Break-Even Point (Simple Problems)-Managerial significance and limitations of
Break-Even Analysis.
UNIT - III Business Organizations and Markets

Introduction – Nature, meaning, significance, functions and advantages. Forms of Business
Organizations- Sole Proprietary - Partnership - Joint Stock Companies - Public Sector Enterprises.
Types of Markets - Perfect and Imperfect Competition - Features of Perfect Competition Monopoly-
Monopolistic Competition–Oligopoly-Price-Output Determination - Pricing Methods and Strategies
UNIT - IV Capital Budgeting
Introduction – Nature, meaning, significance, functions and advantages. Types of Working Capital,
Components, Sources of Short-term and Long-term Capital, Estimating Working capital
requirements. Capital Budgeting– Features, Proposals, Methods and Evaluation. Projects – Pay Back
Method, Accounting Rate of Return (ARR) Net Present Value (NPV) Internal Rate Return (IRR)
Method (sample problems)
UNIT - V Financial Accounting and Analysis
R 20 Regulations

Introduction – Nature, meaning, significance, functions and advantages. Concepts and Conventions-
Double-Entry Book Keeping, Journal, Ledger, Trial Balance- Final Accounts (Trading Account, Profit
and Loss Account and Balance Sheet with simple adjustments). Financial Analysis - Analysis and
Interpretation of Liquidity Ratios, Activity Ratios, and Capital structure Ratios and Profitability.
Textbooks:
1. Varshney&Maheswari: Managerial Economics, Sultan Chand, 2013.
2. Aryasri: Business Economics and Financial Analysis, 4/e, MGH, 2019
Reference Books:
1. Ahuja Hl Managerial economics Schand,3/e,2013
2. S.A. Siddiqui and A.S. Siddiqui: Managerial Economics and Financial Analysis, New Age
International, 2013.
3. Joseph G. Nellis and David Parker: Principles of Business Economics, Pearson, 2/e, New
Delhi.
4. Domnick Salvatore: Managerial Economics in a Global Economy, Cengage,
2013.

https://www.slideshare.net/123ps/managerial-economics-ppt
https://www.slideshare.net/rossanz/production-and-cost-45827016
https://www.slideshare.net/darkyla/business-organizations-19917607
https://www.slideshare.net/balarajbl/market-and-classification-of-market
https://www.slideshare.net/ruchi101/capital-budgeting-ppt-59565396
https://www.slideshare.net/ashu1983/financial-accounting
R 20 Regulations

Course Code ORGANISATIONAL BEHAVIOUR L T P C
20A52302 (Common to All branches of Engineering) 3 0 0 3
Course Objectives:
• To enable student’s comprehension of organizational behavior
• To offer knowledge to students on self-motivation, leadership and management
• To facilitate them to become powerful leaders
• To Impart knowledge about group dynamics
• To make them understand the importance of change and development
• Define the Organizational Behaviour, its nature and scope.
• Understand the nature and concept of Organizational behaviour
• Apply theories of motivation to analyse the performance problems
• Analyse the different theories of leadership
• Evaluate group dynamics
• Develop as powerful leader
UNIT - I Introduction to Organizational Behavior

Meaning, definition, nature, scope and functions - Organizing Process – Making organizing effective
-Understanding Individual Behaviour –Attitude -Perception - Learning – Personality.
UNIT - II Motivation and Leading

Theories of Motivation- Maslow’s Hierarchy of Needs - Hertzberg’s Two Factor Theory - Vroom’s
theory of expectancy – Mc Cleland’s theory of needs–Mc Gregor’s theory X and theory Y– Adam’s
equity theory – Locke’s goal setting theory– Alderfer’s ERG theory .
UNIT - III Organizational Culture
Introduction – Meaning, scope, definition, Nature - Organizational Climate - Leadership - Traits
Theory–Managerial Grid - Transactional Vs Transformational Leadership - Qualities of good Leader
- Conflict Management -Evaluating Leader- Women and Corporate leadership.
UNIT - IV Group Dynamics
Introduction – Meaning, scope, definition, Nature- Types of groups - Determinants of group behavior
- Group process – Group Development - Group norms - Group cohesiveness - Small Groups - Group
decision making - Team building - Conflict in the organization– Conflict resolution
UNIT - V Organizational Change and Development
Introduction –Nature, Meaning, scope, definition and functions- Organizational Culture - Changing
the Culture – Change Management – Work Stress Management - Organizational management –
Managerial implications of organization’s change and development
Textbooks:
1. Luthans, Fred, Organisational Behaviour, McGraw-Hill, 12 Th edition 2011
2. P Subba Ran, Organisational Behaviour, Himalya Publishing House 2017
Reference Books:
▪ McShane, Organizational Behaviour, TMH 2009
▪ Nelson, Organisational Behaviour, Thomson, 2009.
▪ Robbins, P. Stephen, Timothy A. Judge, Organisational Behaviour, Pearson 2009.
▪ Aswathappa, Organisational Behaviour, Himalaya, 2009
httphttps://www.slideshare.net/Knight1040/organizational-culture-
9608857s://www.slideshare.net/AbhayRajpoot3/motivation-165556714
https://www.slideshare.net/harshrastogi1/group-dynamics-159412405
https://www.slideshare.net/vanyasingla1/organizational-change-development-26565951
R 20 Regulations

R 20 Regulations

Course Code Business Environment L T P C
Course Objectives:
• To make the student to understand about the business environment
• To enable them in knowing the importance of fiscal and monitory policy
• To facilitate them in understanding the export policy of the country
• To Impart knowledge about the functioning and role of WTO
• To Encourage the student in knowing the structure of stock markets

• Define Business Environment and its Importance.
• Understand various types of business environment.
• Apply the knowledge of Money markets in future investment
• Analyse India’s Trade Policy
• Evaluate fiscal and monitory policy
• Develop a personal synthesis and approach for identifying business opportunities
UNIT - I Overview of Business Environment

Introduction – meaning Nature, Scope, significance, functions and advantages. Types-Internal
&External, Micro and Macro. Competitive structure of industries -Environmental analysis- advantages
& limitations of environmental analysis& Characteristics of business.
UNIT - II Fiscal & Monetary Policy

Introduction – Nature, meaning, significance, functions and advantages. Public Revenues - Public
Expenditure - Evaluation of recent fiscal policy of GOI. Highlights of Budget- Monetary Policy -
Demand and Supply of Money –RBI -Objectives of monetary and credit policy - Recent trends- Role
of Finance Commission.
UNIT - III India’s Trade Policy

Introduction – Nature, meaning, significance, functions and advantages. Magnitude and direction of
Indian International Trade - Bilateral and Multilateral Trade Agreements - EXIM policy and role of
EXIM bank -Balance of Payments– Structure & Major components - Causes for Disequilibrium in
Balance of Payments - Correction measures.
UNIT - IV World Trade Organization

Introduction – Nature, significance, functions and advantages. Organization and Structure - Role and
functions of WTO in promoting world trade - GATT -Agreements in the Uruguay Round –TRIPS,
TRIMS - Disputes Settlement Mechanism - Dumping and Anti-dumping Measures.
UNIT - V Money Markets and Capital Markets

Introduction – Nature, meaning, significance, functions and advantages. Features and components of
Indian financial systems - Objectives, features and structure of money markets and capital markets -
Reforms and recent development – SEBI – Stock Exchanges - Investor protection and role of SEBI,
Introduction to international finance.
Textbooks:
1. Francis Cherunilam (2009), International Business: Text and Cases, Prentice Hall of India.
2. K. Aswathappa, Essentials of Business Environment: Texts and Cases & Exercises 13th Revised
Edition.HPH2016
R 20 Regulations

Reference Books:
1.K. V. Sivayya, V. B. M Das (2009), Indian Industrial Economy, Sultan Chand Publishers,
New Delhi, India.
2. Sundaram, Black (2009), International Business Environment Text and Cases, Prentice Hall of
India, New Delhi, India.
3. Chari. S. N (2009), International Business, Wiley India.
4.E. Bhattacharya (2009), International Business, Excel Publications, New Delhi.

https://www.slideshare.net/ShompaDhali/business-environment-53111245
https://www.slideshare.net/rbalsells/fiscal-policy-ppt
https://www.slideshare.net/aguness/monetary-policy-presentationppt
https://www.slideshare.net/DaudRizwan/monetary-policy-of-india-69561982
https://www.slideshare.net/ShikhaGupta31/indias-trade-policyppt
https://www.slideshare.net/viking2690/wto-ppt-60260883
https://www.slideshare.net/prateeknepal3/ppt-mo
R 20 Regulations

Course Code Database Management Systems L T P C
20A05401P Laboratory 0 0 3 1.5
(Common to CSE, IT, CSE( DS), CSE
(IoT), CSE (AI), CSE (AI & ML) and
AI & DS)
Pre-requisite Semester IV
Course Objectives:
• To implement the basic knowledge of SQL queries and relational algebra.
• To construct database models for different database applications.
• To apply normalization techniques for refining of databases.
• To practice various triggers, procedures, and cursors usingPL/SQL.
• To design and implementation of a database for an organization
• Design database for any real world problem
• Implement PL/SQL programs
• Define SQL queries
• Decide the constraints
• Investigate for data inconsistency
Week-1: CREATION OF TABLES
1. Create a table called Employee with the following structure.

Name Type
Empno Number
Ename Varchar2(20)
Job Varchar2(20)
Mgr Number
Sal Number
a. Add a column commission with domain to the Employee table.

b. Insert any five records into the table.
c. Update the column details of job
d. Rename the column of Employ table using alter command.
e. Delete the employee whose empno is19.
2. Create department table with the following structure.
Name Type
Deptno Number
Deptname Varchar2(20)
location Varchar2(20)
a. Add column designation to the department table.

b. Insert values into thetable.
c. List the records of emp table grouped bydeptno.
d. Update the record where deptno is9.
e. Delete any column data from thetable
R 20 Regulations

3. Create a table called Customertable
Name Type
Cust name Varchar2(20)
Cust street Varchar2(20)
Cust city Varchar2(20)
a. Insert records into thetable.

b. Add salary column to thetable.
c. Alter the table columndomain.
d. Drop salary column of the customertable.
e. Delete the rows of customer table whose ust_city is ‘hyd’.
f. Create a table called branchtable.
Name Type
Branch name Varchar2(20)
Branch city Varchar2(20)
asserts Number
4. Increase the size of data type for asserts to the branch.

a. Add and drop a column to the branch table.
b. Insert values to the table.
c. Update the branch name column
d. Delete any two columns from the table
5. Create a table called sailor table
Name Type
Sid Number
Sname Varchar2(20)
rating Varchar2(20)
a. Add column age to the sailor table.
b. Insert values into the sailor table.
c. Delete the row with rating>8.
d. Update the column details of sailor.
e. Insert null values into the table.
6. Create a table called reserves table
Name Type
Boat id Integer
sid Integer
day Integer
a. Insert values into the reservestable.

b. Add column time to the reservestable.
c. Alter the column day data type todate.
d. Drop the column time in thetable.
e. Delete the row of the table with somecondition.
Week-2: QUERIES USING DDL AND DML

R 20 Regulations

1. a. Create a user and grant all permissions to theuser.
b. Insert the any three records in the employee table and use rollback. Check theresult.
c. Add primary key constraint and not null constraint to the employeetable.
d. Insert null values to the employee table and verify theresult.
b. Insert values in the department table and usecommit.
c. Add constraints like unique and not null to the departmenttable.
d. Insert repeated values and null values into thetable.
b. Insert values into the table and use commit.
c. Delete any three records in the department table and use rollback.
d. Add constraint primary key and foreign key to thetable.
b. Insert records in the sailor table and usecommit.
c. Add save point after insertion of records and verify save point.
d. Add constraints not null and primary key to the sailortable.
b. Use revoke command to remove userpermissions.
c. Change password of the usercreated.
d. Add constraint foreign key and notnull.
b. Update the table reserves and use savepointandrollback.
c. Add constraint primary key , foreign key and not null to the reserves table
d. Delete constraint not null to the tablecolumn
Week-3:QUERIES USING AGGREGATE FUNCTIONS
1. a. By using the group by clause, display the enames who belongs to deptno 10
alongwithaveragesalary.
b. Display lowest paid employee details under eachdepartment.
c. Display number of employees working in each department and their departmentnumber.
d. Using built in functions, display number of employees working in each department and
their department name from dept table. Insert deptname to dept table and insert deptname for
each row, do the required thing specified above.
e. List all employees which start with either B or C.
f. Display only these ename of employees where the maximum salary is greater than or
equalto 5000.
2. a. Calculate the average salary for each differentjob.
b. Show the average salary of each job excludingmanager.
c. Show the average salary for all departments employing more than threepeople.
d. Display employees who earn more than thelowest salary in department 30
e. Show that value returned by sign (n)function.
f. How many days between day of birth to currentdate
3. a. Show that two substring as singlestring.
b. List all employee names, salary and 15% rise insalary.
c. Display lowest paid emp details under eachmanager
d. Display the average monthly salary bill for eachdeptno.
e. Show the average salary for all departments employing more than twopeople.
f. By using the group by clause, display the eid who belongs to deptno 05 along
withaverage salary.
4. a. Count the number of employees in department20
b. Find the minimum salary earned byclerk.
R 20 Regulations

c. Find minimum, maximum, average salary of allemployees.
d. List the minimum and maximum salaries for each jobtype.
e. List the employee names in descendingorder.
f. List the employee id, names in ascending order byempid.
5. a. Find the sids ,names of sailors who have reserved all boats called“INTERLAKE
Find the age of youngest sailor who is eligible to vote for each rating level with at least two
such sailors.
b. Find the sname , bid and reservation date for eachreservation.
c. Find the ages of sailors whose name begin and end with B and has at least 3characters.
d. List in alphabetic order all sailors who have reserved redboat.
e. Find the age of youngest sailor for each ratinglevel.
6. a. List the Vendors who have delivered products within 6 months from orderdate.
b. Display the Vendor details who have supplied both Assembled and Subparts.
c. Display the Sub parts by grouping the Vendor type (Local or NonLocal).
d. Display the Vendor details in ascendingorder.
e. Display the Sub part which costs more than any of the Assembledparts.
f. Display the second maximum cost Assembledpart
Week-4: PROGRAMS ON PL/SQL
1. a. Write a PL/SQL program to swaptwonumbers.

b. Write a PL/SQL program to find the largest of threenumbers.
2. a. Write a PL/SQL program to find the total and average of 6 subjects and display thegrade.
b. Write a PL/SQL program to find the sum of digits in a givennumber.
3. a. Write a PL/SQL program to display the number in reverseorder.
b. Writea PL/SQLprogramtocheckwhetherthegivennumberisprimeornot.
4. a. Write a PL/SQL program to find the factorial of a givennumber.
b. Write a PL/SQL code block to calculate the area of a circle for a value of radius varying
from 3 to 7. Store the radius and the corresponding values of calculated area in an empty
table named areas, consisting of two columns radius andarea.
5. a. Write a PL/SQL program to accept a string and remove the vowels from the string. (When
‘hello’ passed to the program it should display ‘Hll’ removing e and o from the worldHello).
b. Write a PL/SQL program to accept a number and a divisor. Make sure the divisor is less than
or equal to 10. Else display an error message. Otherwise Display the remainderin words.
Week-5: PROCEDURES AND FUNCTIONS
1. Write a function to accept employee number as parameter and return Basic +HRA together as
single column.
2. Accept year as parameter and write a Function to return the total net salary spent for a givenyear.
3. Create a function to find the factorial of a given number and hence findNCR.
4. Write a PL/SQL block o pint prime Fibonacci series using localfunctions.
5. Create a procedure to find the lucky number of a given birthdate.
6. Create function to the reverse of givennumber
Week-6: TRIGGERS
1. Create a row level trigger for the customers table that would fire for INSERT or UPDATE or
DELETE operations performed on the CUSTOMERS table. This trigger will display the
salary difference between the old values and newvalues:
CUSTOMERS table:
R 20 Regulations

ID NAME AGE ADDRESS SALARY

1 Alive 24 Khammam 2000
2 Bob 27 Kadappa 3000
3 Catri 25 Guntur 4000
4 Dena 28 Hyderabad 5000
5 Eeshwar 27 Kurnool 6000
6 Farooq 28 Nellore 7000
2. Creation of insert trigger, delete trigger, update trigger practice triggers using the passenger
database.
Passenger( Passport_ id INTEGER PRIMARY KEY, Name VARCHAR (50)
NotNULL, Age Integer Not NULL, Sex Char, Address VARCHAR (50)
NotNULL);
a. Write a Insert Trigger to check the Passport_id is exactly six digits ornot.
b. Write a trigger on passenger to display messages ‘1 Record is inserted’, ‘1 record is
deleted’, ‘1 record is updated’ when insertion, deletion and updation are done on
passengerrespectively.
3. Insert row in employee table using Triggers. Every trigger is created with name any trigger
have same name must be replaced by new name. These triggers can raised before insert, update
or delete rows on data base. The main difference between a trigger and a stored procedure is
that the former is attached to a table and is only fired when an INSERT, UPDATE or
DELETEoccurs.
4. Convert employee name into uppercase whenever an employee record is inserted or updated.
Trigger to fire before the insert orupdate.
5. Trigger before deleting a record from emp table. Trigger will insert the row to be deleted into
table called delete _emp and also record user who has deleted the record and date and time
ofdelete.
6. Create a transparent audit system for a table CUST_MSTR. The system must keep track of the
records that are being deleted orupdated
Week-7:PROCEDURES
1. Create the procedure for palindrome of givennumber.

2. Create the procedure for GCD: Program should load two registers with two Numbers and then
apply the logic for GCD of two numbers. GCD of two numbers is performed by dividing the
greater number by the smaller number till the remainder is zero. If it is zero, the divisor is the
GCD if not the remainder and the divisors of the previous division are the new set of two
numbers. The process is repeated by dividing greater of the two numbers by the smaller
number till the remainder is zero and GCD isfound.
3. Write the PL/SQL programs to create the procedure for factorial of givennumber.
4. Write the PL/SQL programs to create the procedure to find sum of N naturalnumber.
5. Write the PL/SQL programs to create the procedure to find Fibonacciseries.
6. Write the PL/SQL programs to create the procedure to check the given number is perfect ornot
Week-8: CURSORS
1. Write a PL/SQL block that will display the name, dept no, salary of fist highest paidemployees.
2. Update the balance stock in the item master table each time a transaction takes place in the
item transaction table. The change in item master table depends on the item id is already
present in the item master then update operation is performed to decrease the balance stock by
the quantity specified in the item transaction in case the item id is not present in the item
R 20 Regulations

master table then the record is inserted in the item mastertable.
3. Write a PL/SQL block that will display the employee details along with salary usingcursors.
4. To write a Cursor to display the list of employees who are working as a ManagersorAnalyst.
5. To write a Cursor to find employee with given job anddeptno.
6. Write a PL/SQL block using implicit cursor that will display message, the salaries of all the
employees in the ‘employee’ table are updated. If none of the employee’s salary are updated
we getamessage 'None of the salaries were updated'. Else we get a message like for example,
'Salaries for 1000 employees are updated' if there are 1000 rows in ‘employee’ table
Week-9: CASE STUDY: BOOK PUBLISHING COMPANY
A publishing company produces scientific books on various subjects. The books are written by
authors who specialize in one particular subject. The company employs editors who, not
necessarily being specialists in a particular area, each take sole responsibility for editing one or
more publications.
A publication covers essentially one of the specialist subjects and is normally written by a single
author. When writing a particular book, each author works with on editor, but may submit another
work for publication to be supervised by other editors. To improve their competitiveness, the
company tries to employ a variety of authors, more than one author being a specialist in a particular
subject for the above case study, do thefollowing:
1. Analyze the datarequired.
2. Normalize theattributes.
Create the logical data model using E-R diagrams
Week-10: CASE STUDY GENERAL HOSPITAL
AGeneralHospitalconsistsofanumberofspecializedwards(suchasMaternity,Pediatric,Oncology,
etc.). Each ward hosts a number of patients, who were admitted on the recommendation of their
ownGP and confirmed by a consultant employed by the Hospital. On admission, the personal
details of every patient are recorded. A separate register is to be held to store the information of
the tests undertaken and the results of a prescribed treatment. A number of tests may be conducted
for each patient. Each patient is assigned to one leading consultant but may be examined by
another doctor, if required. Doctors are specialists in some branch of medicine and may be leading
consultants for a number of patients, not necessarily from the same ward. For the above case study,
do the following.
Week-11: CASE STUDY: CAR RENTAL COMPANY
A database is to be designed for a car rental company. The information required includes a
description of cars, subcontractors (i.e. garages), company expenditures, company revenues and
customers. Cars are to be described by such data as: make, model, year of production, engine size,
fuel type, number of passengers, registration number, purchase price, purchase date, rent price and
insurance details. It is the company policy not to keep any car for a period exceeding one year. All
major repairs and maintenance are done by subcontractors (i.e. franchised garages), with whom
CRC has long-term agreements. Therefore the data about garages to be kept in the database
includes garage names, addresses, range of services and the like. Some garages require payments
immediately after a repair has been made; with others CRC has made arrangements for credit
facilities. Company expenditures are to be registered for all outgoings connected with purchases,
repairs, maintenance, insurance etc. Similarly the cash inflow coming from all sources: Car hire,
R 20 Regulations

car sales, insurance claims must be kept of file. CRC maintains a reasonably stable client base.
For this privileged category of customers special creditcard facilities are provided. These
customers may also book in advance a particular car. These reservations can be made for any
period of time up to one month. Casual customers must pay a deposit for an estimated time of
rental, unless they wish to pay by credit card. All major credit cards are accepted. Personal details
such as name, address, telephone number, driving license, number about each customer are kept
in the database. For the above case study, do thefollowing:
Week-12: CASE STUDY: STUDENT PROGRESS MONITORING SYSTEM
A database is to be designed for a college to monitor students' progress throughout their course of
study. The students are reading for a degree (such as BA, BA (Hons.) M.Sc., etc) within the
framework of the modular system. The college provides a number of modules, each being
characterized by its code, title, credit value, module leader, teaching staff and the department they
come from. A module is coordinated by a module leader who shares teaching duties with one or
more lecturers. A lecturer may teach (and be a module leader for) more than one module. Students
are free to choose any module they wish but the following rules must be observed: Some modules
require pre- requisites modules and some degree programs have compulsory modules. The
database is also to contain some information about
studentsincludingtheirnumbers,names,addresses,degreestheyreadfor,andtheirpastperformance
i.e. modules taken and examination results. For the above case study, do the following:
3. Create the logical data model i.e., ERdiagrams.
4. Comprehend the data given in the case study by creating respective tables with primary
keys and foreign keys whereverrequired.
5. Insert values into the tables created (Be vigilant about Master- Slavetables).
6. Display the Students who have taken M.Sccourse
7. Display the Module code and Number of Modules taught by eachLecturer.
8. Retrieve the Lecturer names who are not Module Leaders.
9. Display the Department name which offers ‘English ‘module.
10. Retrieve the Prerequisite Courses offered by every Department (with Departmentnames).
11. Present the Lecturer ID and Name who teaches‘Mathematics’.
12. Discover the number of years a Module istaught.
13. List out all the Faculties who work for ‘Statistics’Department.
14. List out the number of Modules taught by each ModuleLeader.
15. List out the number of Modules taught by a particularLecturer.
16. Create a view which contains the fields of both Department and Module tables.
(Hint- The fields like Module code, title, credit, Department code and itsname).
17. Update the credits of all the prerequisite courses to 5. Delete the Module ‘History’ from the
Moduletable.
References:
1. RamezElmasri, Shamkant, B. Navathe, “Database Systems”, Pearson Education, 6th Edition,
2013.
2. Peter Rob, Carles Coronel, “Database System Concepts”, Cengage Learning, 7th Edition, 2008.
http://www.scoopworld.in
http://vlabs.iitb.ac.in/vlabs-dev/labs/dblab/index.php
R 20 Regulations

Course Code OPERATING SYSTEMS LAB L T P C

20A05402P (Common to CSE, IT, CSE( DS), CSE (IoT), CSE (AI), 0 0 3 1.5
CSE (AI & ML) and AI & DS)
Pre-requisite Basics of CO and DBMS Semester IV
Course Objectives:
• To familiarize students with the architecture of OS.
• To provide necessary skills for developing and debugging CPU Scheduling algorithms.
• To elucidate the process management and scheduling and memory management.
• To explain the working of an OS as a resource manager, file system manager, process manager,
memory manager, and page replacement tool.
• To provide insights into system calls, file systems and deadlock handling.
• Trace different CPU Scheduling algorithms (L2).
• Implement Bankers Algorithms to Avoid and prevent the Dead Lock (L3).
• Evaluate Page replacement algorithms (L5).
• Illustrate the file organization techniques (L4).
• Illustrate shared memory process (L4).
• Design new scheduling algorithms (L6)
1. Practicing of Basic UNIX Commands.
2. Write programs using the following UNIX operating system calls
Fork, exec, getpid, exit, wait, close, stat, opendir and readdir
3. Simulate UNIX commands like cp, ls, grep, etc.,
4. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
5. Implement a dynamic priority scheduling algorithm.
6. Assume that there are five jobs with different weights ranging from 1 to 5. Implement round
robin algorithm with time slice equivalent to weight.
7. Implement priority scheduling algorithm. While executing, no process should wait for more
than 10 seconds. If the waiting time is more than 10 seconds that process has to be executed
for at least 1 second before waiting again.
8. Control the number of ports opened by the operating system with
a) Semaphore b) Monitors.
9. Simulate how parent and child processes use shared memory and address space.
10. Simulate sleeping barber problem.
11. Simulate dining philosopher’s problem.
12. Simulate producer-consumer problem using threads.
13. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
14. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU etc.,
15. Simulate Paging Technique of memory management
16. Simulate Bankers Algorithm for Dead Lock avoidance and prevention
17. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked
18. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
References:
R 20 Regulations

1. “Operating System Concepts”, Abraham Silberchatz, Peter B. Galvin, Greg Gagne, Eighth
Edition, John Wiley.
2. “Operating Systems: Internals and Design Principles”, Stallings, Sixth Edition–2009,
Pearson Education
3. “Modern Operating Systems”, Andrew S Tanenbaum, Second Edition, PHI.
4. “Operating Systems”, S.Haldar, A.A.Aravind, Pearson Education.
5. “Principles of Operating Systems”, B.L.Stuart, Cengage learning, India Edition.2013-2014
6. “Operating Systems”, A.S.Godbole, Second Edition, TMH.
7. “An Introduction to Operating Systems”, P.C.P. Bhatt, PHI.

https://www.cse.iitb.ac.in/~mythili/os/
http://peterindia.net/OperatingSystems.html
R 20 Regulations

Course Code ARTIFICIAL INTELLIGENCE LAB L T P C
20A30401P (Common to CSE (AI), CSE (AI & ML) and AI & 0 0 3 1.5
DS)
Pre-requisite Fundamental Programming Semester IV
Course Objectives:
• To teach the methods of implementing algorithms using artificial intelligence techniques
• To illustrate search algorithms
• To demonstrate the building of intelligent agents
• Implement search algorithms
• Solve Artificial intelligence problems
• Design chatbot and virtual assistant
1. Write a program to implement DFS and BFS
2. Write a Program to find the solution for traveling salesman Problem
3. Write a program to implement Simulated Annealing Algorithm
4. Write a program to find the solution for the wumpus world problem
5. Write a program to implement 8 puzzle problem
6. Write a program to implement Towers of Hanoi problem
7. Write a program to implement A* Algorithm
8. Write a program to implement Hill Climbing Algorithm
9. Build a Chatbot using AWS Lex, Pandora bots.
10. Build a bot that provides all the information related to your college.
11. Build a virtual assistant for Wikipedia using Wolfram Alpha and Python
12. The following is a function that counts the number of times a string occurs in another
string:
# Count the number of times string s1 is found in string s2
def countsubstring(s1,s2):
count = 0
for i in range(0,len(s2)-len(s1)+1):
if s1 == s2[i:i+len(s1)]:
count += 1
return count
For instance, countsubstring(’ab’,’cabalaba’) returns 2.
Write a recursive version of the above function. To get the rest of a string (i.e. everything but
the first character).
13. Higher order functions. Write a higher-order function count that counts the number of
elements in a list that satisfy a given test. For instance: count (lambda x: x>2, [1, 2, 3, 4, 5])
should return 3, as there are three elements in the list larger than 2. Solve this task without
using any existing higher-order function.
R 20 Regulations

14. Brute force solution to the Knapsack problem. Write a function that allows you to generate
random problem instances for the knapsack program. This function should generate a list of
items containing N items that each have a unique name, a random size in the range 1 .......
5 and a random value in the range 1..... 10.
Next, you should perform performance measurements to see how long the given knapsack
solver take to solve different problem sizes. You should perform at least 10 runs with different
randomly generated problem instances for the problem sizes 10,12,14,16,18,20 and 22. Use
abackpack size of 2:5 x N for each value problem size N. Please note that the method used
togenerate random numbers can also affect performance, since different distributions of
values can make the initial conditions of the problem slightly more or less demanding.
How much longer time does it take to run this program when we increase the number of items?
Does the backpack size affect the answer?
Try running the above tests again with a backpack size of 1 x N and with 4:0 x N.
15. Assume that you are organising a party for N people and have been given a list L of people
who, for social reasons, should not sit at the same table. Furthermore, assume that you have
C tables (that are infinitely large).
Write a function layout (N,C,L) that can give a table placement (i.e. a number from 0 : : :C -
1) for each guest such that there will be no social mishaps.
For simplicity we assume that you have a unique number 0 ......N-1 for each guest and that
the list of restrictions is of the form [(X, Y) ...] denoting guests X, Y that are not allowed to
sit together. Answer with a dictionary mapping each guest into a table assignment, if there are
no possible layouts of the guests you should answer False.
References:
1. David Poole, Alan Mackworth, Randy Goebel,”Computational Intelligence: a logical
approach”, Oxford University Press, 2004.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”,
Fourth Edition, Pearson Education, 2002.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998.
4. Artificial Neural Networks, B. Yagna Narayana, PHI
5. Artificial Intelligence, 2nd Edition, E.Rich and K.Knight, TMH.
6. Artificial Intelligence and Expert Systems, Patterson, PHI.

R 20 Regulations

https://www.tensorflow.org/
https://pytorch.org/
https://github.com/pytorch
https://keras.io/
https://github.com/keras-team
http://deeplearning.net/software/theano/
https://github.com/Theano/Theano
https://caffe2.ai/
https://github.com/caffe2
https://deeplearning4j.org/Scikit-learn:https://scikit-learn.org/stable/
https://github.com/scikit-learn/scikit-learn
https://www.deeplearning.ai/
https://opencv.org/
https://github.com/qqwweee/keras-yolo3
https://www.pyimagesearch.com/2018/11/12/yolo-object-detection-with-opencv/
https://developer.nvidia.com/cuda-math-library
R 20 Regulations

Course Code Exploratory Data Analytics with R L T P C
Skill Oriented (Common to CSE, CSE (AI), CSE (AI & ML) and AI& 1 0 2 2
Course DS)
20A05404
Pre-requisite Fundamental Programming Semester IV
Course Objectives:
The students will be able to learn:
• How to manipulate data within R and to create simple graphs and charts used in introductory
statistics.
• The given data using different distribution functions in R.
• The hypothesis testing and calculate confidence intervals; perform linear regression models
for data analysis.
• The relevance and importance of the theory in solving practical problems in the real world.

• Install and use R for simple programming tasks.
• Extend the functionality of R by using add-on packages
• Extract data from files and other sources and perform various data manipulation tasks on them.
• Explore statistical functions in R.
• Use R Graphics and Tables to visualize results of various statistical operations on data.
• Apply the knowledge of R gained to data Analytics for real-life applications.
1: INTRODUCTION TO COMPUTING
a. Installation of R
b. The basics of R syntax, workspace
c. Matrices and lists
d. Subsetting
e. System-defined functions; the help system
f. Errors and warnings; coherence of the workspace
2: GETTING USED TO R: DESCRIBING DATA

a. Viewing and manipulating Data
b. Plotting data
c. Reading the data from console, file (.csv) local disk and web
d. Working with larger datasets
3: SHAPE OF DATA AND DESCRIBING RELATIONSHIPS

a. Tables, charts and plots.
b. Univariate data, measures of central tendency, frequency distributions, variation, and Shape.
c. Multivariate data, relationships between a categorical and a continuous variable,
d. Relationship between two continuous variables – covariance, correlation coefficients, comparing
multiple correlations.
e. Visualization methods – categorical and continuous variables, two categorical variables, two
continuous variables.
4: PROBABILITY DISTRIBUTIONS
a. Sampling from distributions – Binomial distribution, normal distribution
b. tTest, zTest, Chi Square test
c. Density functions
R 20 Regulations

d. Data Visualization using ggplot – Box plot, histograms, scatter plotter, line chart, bar chart, heat
maps
5: EXPLORATORY DATA ANALYSIS Demonstrate the range, summary, mean, variance, median,
standard deviation, histogram, box plot, scatter plot using population dataset.
6: TESTING HYPOTHESES
a. Null hypothesis significance testing
b. Testing the mean of one sample
c. Testing two means
7: PREDICTING CONTINUOUS VARIABLES
a. Linear models
b. Simple linear regression
c. Multiple regression
d. Bias-variance trade-off – cross-validation
8: CORRELATION
a. How to calculate the correlation between two variables.
b. How to make scatter plots.
c. Use the scatter plot to investigate the relationship between two variables
9: TESTS OF HYPOTHESES
a. Perform tests of hypotheses about the mean when the variance is known.
b. Compute the p-value.
c. Explore the connection between the critical region, the test statistic, and the p-value
10: ESTIMATING A LINEAR RELATIONSHIP Demonstration on a Statistical Model for a Linear
Relationship
a. Least Squares Estimates
b. The R Function lm
c. Scrutinizing the Residuals
11: APPLY-TYPE FUNCTIONS
a. Defining user defined classes and operations, Models and methods in R
b. Customizing the user's environment
c. Conditional statements
d. Loops and iterations
12: STATISTICAL FUNCTIONS IN R
a. Write Demonstrate Statistical functions in R
b. Statistical inference, contingency tables, chi-square goodness of fit, regression, generalized linear
models, advanced modeling methods.
References:
1. SandipRakshit, “Statistics with R Programming”, McGraw Hill Education, 2018.
2. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, “AN Introduction to Statistical
Learning: with Applications in R”, Springer Texts in Statistics, 2017.
3. Joseph Schmuller, “Statistical Analysis with R for Dummies”, Wiley, 2017.
4. K G Srinivasa, G M Siddesh, ChetanShetty, Sowmya B J, “Statistical Programming in R”, Oxford
Higher Education, 2017.
1. www.oikostat.ch
2. https://learningstatisticswithr.com/
3. https://www.coursera.org/learn/probability-intro#syllabus
4. https://www.isibang.ac.in/~athreya/psweur/
R 20 Regulations

Course Code Design Thinking for Innovation L T P C
Pre-requisite NIL Semester IV
Course Objectives:
The objective of this course is to familiarize students with design thinking process as a tool for
breakthrough innovation. It aims to equip students with design thinking skills and ignite the minds to create
innovative ideas, develop solutions for real-time problems.
• Define the concepts related to design thinking.
• Explain the fundamentals of Design Thinking and innovation
• Apply the design thinking techniques for solving problems in various sectors.
• Analyse to work in a multidisciplinary environment
• Evaluate the value of creativity
• Formulate specific problem statements of real time issues
UNIT - I Introduction to Design Thinking 10 Hrs
Introduction to elements and principles of Design, basics of design-dot, line, shape, form as fundamental
design components. Principles of design. Introduction to design thinking, history of Design Thinking, New
materials in Industry.
UNIT - II Design Thinking Process 10 Hrs

Design thinking process (empathize, analyze, idea & prototype), implementing the process in driving
inventions, design thinking in social innovations. Tools of design thinking - person, costumer, journey
map, brain storming, product development
Activity: Every student presents their idea in three minutes, Every student can present design process in
the form of flow diagram or flow chart etc. Every student should explain about product development.
UNIT - III Innovation 8 Hrs

Art of innovation, Difference between innovation and creativity, role of creativity and innovation in
organizations. Creativity to Innovation. Teams for innovation, Measuring the impact and value of
creativity.
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation, Debate on
value-based innovation.
UNIT - IV Product Design 8 Hrs
Problem formation, introduction to product design, Product strategies, Product value, Product planning,
product specifications. Innovation towards product design Case studies.
Activity: Importance of modelling, how to set specifications, Explaining their own product design.
UNIT - V Design Thinking in Business Processes 10 Hrs

Design Thinking applied in Business & Strategic Innovation, Design Thinking principles that redefine
business – Business challenges: Growth, Predictability, Change, Maintaining Relevance, Extreme
competition, Standardization. Design thinking to meet corporate needs. Design thinking for Startups.
Defining and testing Business Models and Business Cases. Developing & testing prototypes.
Activity: How to market our own product, About maintenance, Reliability and plan for startup.
Textbooks:
R 20 Regulations

1. Change by design, Tim Brown, Harper Bollins (2009)
2. Design Thinking for Strategic Innovation, Idris Mootee, 2013, John Wiley & Sons.
Reference Books:
1. Design Thinking in the Classroom by David Lee, Ulysses press
2. Design the Future, by Shrrutin N Shetty, Norton Press
3. Universal principles of design- William lidwell, kritinaholden, Jill butter.
4. The era of open innovation – chesbrough.H
https://swayam.gov.in/nd1_noc19_mg60/preview
R 20 Regulations

COMMUNITY SERVICE PROJECT

……Experiential learning through community engagement
Introduction
• Community Service Project is an experiential learning strategy that integrates meaningful
community service with instruction, participation, learning and community development
• Community Service Project involves students in community development and service activities
and applies the experience to personal and academic development.
• Community Service Project is meant to link the community with the college for mutual benefit.
The community will be benefited with the focused contribution of the college students for the
village/ local development. The college finds an opportunity to develop social sensibility and
responsibility among students and also emerge as a socially responsible institution.
Objective
Community Service Project should be an integral part of the curriculum, as an alternative to the 2
months of Summer Internships / Apprenticeships / On the Job Training, whenever there is an exigency
when students cannot pursue their summer internships. The specific objectives are;
• To sensitize the students to the living conditions of the people who are around them,
• To help students to realize the stark realities of the society.
• To bring about an attitudinal change in the students and help them to develop societal
consciousness, sensibility, responsibility and accountability
• To make students aware of their inner strength and help them to find new /out of box solutions
to the social problems.
• To make students socially responsible citizens who are sensitive to the needs of the
disadvantaged sections.
• To help students to initiate developmental activities in the community in coordination with
public and government authorities.
• To develop a holistic life perspective among the students by making them study culture,
traditions, habits, lifestyles, resource utilization, wastages and its management, social problems,
public administration system and the roles and responsibilities of different persons across
different social systems.
Implementation of Community Service Project

• Every student should put in a 6 weeks for the Community Service Project during the summer
vacation.
• Each class/section should be assigned with a mentor.
• Specific Departments could concentrate on their major areas of concern. For example, Dept.
of Computer Science can take up activities related to Computer Literacy to different sections
of people like - youth, women, house-wives, etc
• A log book has to be maintained by each of the student, where the activities
undertaken/involved to be recorded.
• The logbook has to be countersigned by the concerned mentor/faculty incharge.
R 20 Regulations

• Evaluation to be done based on the active participation of the student and grade could be
awarded by the mentor/faculty member.
• The final evaluation to be reflected in the grade memo of the student.
• The Community Service Project should be different from the regular programmes of
NSS/NCC/Green Corps/Red Ribbon Club, etc.
• Minor project report should be submitted by each student. An internal Viva shall also be
conducted by a committee constituted by the principal of the college.
• Award of marks shall be made as per the guidelines of Internship/apprentice/ on the job training
Procedure
• A group of students or even a single student could be assigned for a particular habitation or
village or municipal ward, as far as possible, in the near vicinity of their place of stay, so as to
enable them to commute from their residence and return back by evening or so.
• The Community Service Project is a twofold one –
o First, the student/s could conduct a survey of the habitation, if necessary, in terms of
their own domain or subject area. Or it can even be a general survey, incorporating all
the different areas. A common survey format could be designed. This should not be
viewed as a duplication of work by the Village or Ward volunteers, rather, it could be
another primary source of data.
o Secondly, the student/s could take up a social activity, concerning their domain or
subject area. The different areas, could be like –
▪ Agriculture
▪ Health
▪ Marketing and Cooperation
▪ Animal Husbandry
▪ Horticulture
▪ Fisheries
▪ Sericulture
▪ Revenue and Survey
▪ Natural Disaster Management
▪ Irrigation
▪ Law & Order
▪ Excise and Prohibition
▪ Mines and Geology
▪ Energy
▪ Internet
▪ Free Electricity
▪ Drinking Water
EXPECTED OUTCOMES
BENEFITS OF COMMUNITY SERVICE PROJECT TO STUDENTS
R 20 Regulations

Learning Outcomes
• Positive impact on students’ academic learning
• Improves students’ ability to apply what they have learned in “the real world”
• Positive impact on academic outcomes such as demonstrated complexity of understanding,
problem analysis, problem-solving, critical thinking, and cognitive development
• Improved ability to understand complexity and ambiguity
Personal Outcomes
• Greater sense of personal efficacy, personal identity, spiritual growth, and moral development
• Greater interpersonal development, particularly the ability to work well with others, and build
leadership and communication skills
Social Outcomes
• Reduced stereotypes and greater inter-cultural understanding
• Improved social responsibility and citizenship skills
• Greater involvement in community service after graduation
Career Development
• Connections with professionals and community members for learning and career opportunities
• Greater academic learning, leadership skills, and personal efficacy can lead to greater
opportunity
Relationship with the Institution
• Stronger relationships with faculty
• Greater satisfaction with college
• Improved graduation rates
BENEFITS OF COMMUNITY SERVICE PROJECT TO FACULTY MEMBERS

• Satisfaction with the quality of student learning
• New avenues for research and publication via new relationships between faculty and
community
• Providing networking opportunities with engaged faculty in other disciplines or institutions
• A stronger commitment to one’s research
BENEFITS OF COMMUNITY SERVICE PROJECT TO COLLEGES AND UNIVERSITIES

• Improved institutional commitment
• Improved student retention
• Enhanced community relations
BENEFITS OF COMMUNITY SERVICE PROJECT TO COMMUNITY

• Satisfaction with student participation
• Valuable human resources needed to achieve community goals
• New energy, enthusiasm and perspectives applied to community work
• Enhanced community-university relations.
R 20 Regulations

SUGGESTIVE LIST OF PROGRAMMES UNDER COMMUNITY SERVICE PROJECT
The following the recommended list of projects for Engineering students. The lists are not exhaustive
and open for additions, deletions and modifications. Colleges are expected to focus on specific local
issues for this kind of projects. The students are expected to carry out these projects with involvement,
commitment, responsibility and accountability. The mentors of a group of students should take the
responsibility of motivating, facilitating, and guiding the students. They have to interact with local
leadership and people and appraise the objectives and benefits of this kind of projects. The project
reports shall be placed in the college website for reference. Systematic, Factual, methodical and honest
reporting shall be ensured.
For Engineering Students

1. Water facilities and drinking water availability
2. Health and hygiene
3. Stress levels and coping mechanisms
4. Health intervention programmes
5. Horticulture
6. Herbal plants
7. Botanical survey
8. Zoological survey
9. Marine products
10. Aqua culture
11. Inland fisheries
12. Animals and species
13. Nutrition
14. Traditional health care methods
15. Food habits
16. Air pollution
17. Water pollution
18. Plantation
19. Soil protection
20. Renewable energy
21. Plant diseases
22. Yoga awareness and practice
23. Health care awareness programmes and their impact
24. Use of chemicals on fruits and vegetables
25. Organic farming
26. Crop rotation
27. Floury culture
28. Access to safe drinking water
29. Geographical survey
30. Geological survey
31. Sericulture
32. Study of species
R 20 Regulations

33. Food adulteration
34. Incidence of Diabetes and other chronic diseases
35. Human genetics
36. Blood groups and blood levels
37. Internet Usage in Villages
38. Android Phone usage by different people
39. Utilisation of free electricity to farmers and related issues
40. Gender ration in schooling lvel- observation.
Complimenting the community service project the students may be involved to take up some
awareness campaigns on social issues/special groups. The suggested list of programmes are;
Programmes for School Children

1. Reading Skill Programme (Reading Competition)
2. Preparation of Study Materials for the next class.
3. Personality / Leadership Development
4. Career Guidance for X class students
5. Screening Documentary and other educational films
6. Awareness Programme on Good Touch and Bad Touch (Sexual abuse)
7. Awareness Programme on Socially relevant themes.
Programmes for Women Empowerment
1. Government Guidelines and Policy Guidelines
2. Womens’ Rights
3. Domestic Violence
4. Prevention and Control of Cancer
5. Promotion of Social Entrepreneurship
General Camps
1. General Medical camps
2. Eye Camps
3. Dental Camps
4. Importance of protected drinking water
5. ODF awareness camp
6. Swatch Bharath
7. AIDS awareness camp
8. Anti Plastic Awareness
9. Programmes on Environment
10. Health and Hygiene
11. Hand wash programmes
12. Commemoration and Celebration of important days
Programmes for Youth Empowerment
1. Leadership
2. Anti-alcoholism and Drug addiction
3. Anti-tobacco
R 20 Regulations

4. Awareness on Competitive Examinations
5. Personality Development
Common Programmes
1. Awareness on RTI
2. Health intervention programmes
3. Yoga
4. Tree plantation
5. Programmes in consonance with the Govt. Departments like –
i. Agriculture
ii. Health
iii. Marketing and Cooperation
iv. Animal Husbandry
v. Horticulture
vi. Fisheries
vii. Sericulture
viii. Revenue and Survey
ix. Natural Disaster Management
x. Irrigation
xi. Law & Order
xii. Excise and Prohibition
xiii. Mines and Geology
xiv. Energy
Role of Students:
• Students may not have the expertise to conduct all the programmes on their own. The students
then can play a facilitator role.
• For conducting special camps like Health related, they will be coordinating with the
Governmental agencies.
• As and when required the College faculty themselves act as Resource Persons.
• Students can work in close association with Non-Governmental Organizations like Lions Club,
Rotary Club, etc or with any NGO actively working in that habitation.
• And also with the Governmental Departments. If the programme is rolled out, the District
Administration could be roped in for the successful deployment of the programme.
• An in-house training and induction programme could be arranged for the faculty and
participating students, to expose them to the methodology of Service Learning.
Timeline for the Community Service Project Activity

Duration: 8 weeks
1. Preliminary Survey (One Week)
• A preliminary survey including the socio-economic conditions of the allotted habitation to be
conducted.
R 20 Regulations

• A survey form based on the type of habitation to be prepared before visiting the habitation with
the help of social sciences faculty. (However, a template could be designed for different
habitations, rural/urban.
• The Governmental agencies, like revenue administration, corporation and municipal authorities
and village secreteriats could be aligned for the survey.
2. Community Awareness Campaigns (One Week)

• Based on the survey and the specific requirements of the habitation, different awareness
campaigns and programmes to be conducted, spread over two weeks of time. The list of
activities suggested could be taken into consideration.
3. Community Immersion Programme (Three Weeks)

Along with the Community Awareness Programmes, the student batch can also work with
any one of the below listed governmental agencies and work in tandem with them. This
community involvement programme will involve the students in exposing themselves to the
experiential learning about the community and its dynamics. Programmes could be in
consonance with the Govt. Departments.
4. Community Exit Report (One Week)

• During the last week of the Community Service Project, a detailed report of the outcome of the
8 weeks work to be drafted and a copy shall be submitted to the local administration. This
report will be a basis for the next batch of students visiting that particular habitation. The same
report submitted to the teacher-mentor will be evaluated by the mentor and suitable marks are
awarded for onward submission to the University.
Throughout the Community Service Project, a daily log-book need to be maintained by the
students batch, which should be countersigned by the governmental agency representative and
the teacher-mentor, who is required to periodically visit the students and guide them.

II B.Tech - CSE AI ML CSE AI R20 Course Structue Syllabi

Uploaded by

Copyright:

Available Formats

II B.Tech - CSE AI ML CSE AI R20 Course Structue Syllabi

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

II B.Tech - CSE AI ML CSE AI R20 Course Structue Syllabi

Uploaded by

Copyright:

Available Formats

R 20 Regulations

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Course Code Discrete Mathematics & Graph theory L T P C

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Pre-requisite Basic Electronics Semester III

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

UNIT - I Introduction to Algorithms 9 Hrs

UNIT - II Trees Part-I 8 Hrs

UNIT - III Trees Part-II 8 Hrs

UNIT - IV Divide and conquer, Greedy method 9 Hrs

UNIT - V Dynamic Programming & Backtracking 9 Hrs

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

UNIT - I Introduction 8Hrs

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Course Code Computer Organization L T P C

Course Outcomes (CO):

UNIT - I Basic Structure of Computer, Machine Instructions and 8Hrs

UNIT - II Arithmetic, Basic Processing Unit 9Hrs

UNIT - III The Memory System 8Hrs

UNIT - IV Input/Output Organization 8Hrs

UNIT - V Pipelining, Large Computer Systems 9 Hrs

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Pre-requisite Semester III

1. Verification of Truth Table for AND, OR, NOT, NAND, NOR

MICROPROCESSORS (8086 Assembly Language Programming)

1. 8 Bit Addition and Subtraction.

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Course Outcomes (CO):

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Pre-requisite Basic Mathematics Semester IV

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Course Code ARTIFICIAL INTELLIGENCE L T P C

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and

Introduction – Nature, meaning, significance, functions, and advantages. Demand-Concept, Function,

UNIT - II Production and Cost Analysis

UNIT - III Business Organizations and Markets

Computer Science &Engineering(Artificial Intelligence & Machine Learning) and