RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING,

KURNOOL

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE AND DETAILED SYLLABUS

REGULATION: RU20

RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL

RAYALASEEMA UNIVERSITY,

Pasupula, Kurnool District, Andhra Pradesh 518002

 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL

Course Structure & Syllabus for Third Year Regular B.Tech. Degree Program

(Effective for the batches admitted from 2020-21 onwards)

COMPUTER SCIENCE & ENGINEERING

INDUCTION PROGRAM (3 weeks duration)

 Physical activity
 Creative Arts
 Universal Human Values
 Literary
 Proficiency Modules
 Lectures by Eminent People
 Visits to local Areas
 Familiarization to Dept./Branch & Innovations

B. Tech – V Semester (Theory – 6, Lab – 4)

Instruction Scheme of

Credits
Course Hours per Examination
S.No Course Code Course Title week (Max. Marks)
Category
L T P CIE SEE Total
THEORY
1 PC 20APC0508T Artificial Intelligence 3 0 0 3 30 70 100
Formal Languages and Automata
2 PC 20APC0510 3 0 0 3 30 70 100
Theory
3 PC 20APC0509T Data Science 3 0 0 3 30 70 100
Professional Elective Course – I

4 PE 20APE0501 Cryptography & Network Security 3 0 0 3 30 70 100

Open Elective Course – I
5 OE 20AOE5401 3 0 0 3 30 70 100
Optimization Techniques
Mandatory Non-credit Course
6 MC 20AMC9904 2 0 0 0 50 - 50
Indian Constitution and Society
PRACTICAL
7 PC 20APC0508P Artificial Intelligence Lab 0 0 3 1.5 30 70 100
8 PC 20APC0509P Data Science Lab 0 0 3 1.5 30 70 100
Skill oriented course – III
9 SC 20ASC0504 1 0 2 2 30 70 100
Internet of Things
Evaluation of Community Service
10 CS 20APR0501 0 0 0 1.5 50
Project
TOTAL: 18 0 8 21.5 290 560 900
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(Common CSE, IT, CSD, CSE (DS), CSE (IOT))
Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0508T 3 0 0 3 CIE 30 M

Course Title : ARTIFICIAL INTELLIGENCE SEE 70 M

Course Objectives:
This course is designed to:
• Introduce Artificial Intelligence
• Teach about the machine learning environment
• Present the searching Technique for Problem Solving
• Introduce Robotics
Course Outcomes:
After completion of the course, students will be able to
• Apply searching techniques for solving a problem
• Design Intelligent Agents
• Develop First Order Logic
• Design mini robots
• Summarize past, present and future of Artificial Intelligence

UNIT I Introduction Lecture 9Hrs

Introduction: What is AI, Foundations of AI, History of AI, The State of Art.
Intelligent Agents: Agents and Environments, Good Behavior: The Concept of Rationality, The Nature of
Environments, The Structure of Agents.

UNIT II Solving Problems by searching Lecture 9 Hrs

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 Knowledge representation Lecture 8 Hrs

Knowledge representation issues, predicate logic- logic programming, semantic nets- frames and
inheritance, constraint propagation, representing knowledge using rules, rules based deduction systems.
Reasoning under uncertainty, review of probability, Baye’s probabilistic interferences and dempstershafer
theory.

UNIT IV First order logic Lecture 8 Hrs

First order logic. Inference in first order logic, propositional vs. first order inference, unification & lifts
forward chaining, Backward chaining, Resolution, Learning from observation Inductive learning.

UNIT V Robotics Lecture 10Hrs

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:
1. Artificial Intelligence, 2nd Edition, E.Rich and K.Knight (TMH)
2. Nilsson, Nils J., and Nils Johan Nilsson. Artificial intelligence: a new synthesis. Morgan Kaufmann, 1998.
3. 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.

Online Learning Resources:

http://peterindia.net/AILinks.html
http://nptel.ac.in/courses/106106139/
https://nptel.ac.in/courses/106/105/106105152/
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0510 3 0 0 3 CIE 30 M

Course Title : FORMAL LANGUAGES AND AUTOMATA THEORY SEE 70 M

Course Objectives:
This course is designed to:
• Introduce languages, grammar, and computational models
• Explain the Context Free Grammars
• Enable the students to use Turing machines
• Demonstrate decidability and un-decidability for NP-Hard problems

Course Outcomes:
After completion of the course, students will be able to
• List types of Turing Machines
• Design Turing Machine
• Formulate decidability and undesirability problems

UNIT I
Finite Automata
Why Study Automata Theory? The Central Concepts of Automata Theory, Automation, Finite Automation,
Transition Systems, Acceptance of a String by a Finite Automaton, DFA, Design of DFAs, NFA, Design of
NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata with E-Transition,
Minimization of Finite Automata, Mealy and Moore Machines, Applications and Limitation of Finite Automata.

UNIT II
Regular Expressions
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two Regular Expressions, Manipulations
of Regular Expressions, Finite Automata, and Regular Expressions, Inter Conversion, Equivalence between
Finite Automata and Regular Expressions, Pumping Lemma, Closers Properties, Applications of Regular
Expressions, Finite Automata and Regular Grammars, Regular Expressions and Regular Grammars.

UNIT III
Context Free Grammars
Formal Languages, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem, Context-Free
Grammar, Leftmost and Rightmost Derivations, Parse Trees, Ambiguous Grammars, Simplification of
Context Free Grammars-Elimination of Useless Symbols, E-Productions and Unit Productions, Normal
Forms for Context Free Grammars-Chomsky Normal Form and Greibach Normal Form, Pumping Lemma,
Closure Properties, Applications of Context Free Grammars.
UNIT IV
Pushdown Automata
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description Language
Acceptance of pushdown Automata, Design of Pushdown Automata, Deterministic and Non – Deterministic
Pushdown Automata, Equivalence of Pushdown Automata and Context Free Grammars Conversion, Two
Stack Pushdown Automata, Application of Pushdown Automata.

UNIT V
Turing Machine
Turing Machine, Definition, Model, Representation of Turing Machines-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a Turing Machine, Design of Turing Machines,
Techniques for Turing Machine Construction, Types of Turing Machines, Church’s Thesis, Universal Turing
Machine, Restricted Turing Machine.
Decidable and Undecidable Problems: NP, NP-Hard and NP-Complete Problems.

Textbooks:
1. Introduction to Automata Theory, Languages and Computation, J.E.Hopcroft, R.Motwani and J.D.Ullman,
3rd Edition, Pearson, 2008.
2. Theory of Computer Science-Automata, Languages and Computation, K.L.P.Mishra and
N.Chandrasekaran, 3rd Edition, PHI, 2007.
Reference Books:
1. Formal Language and Automata Theory, K.V.N.Sunitha and N.Kalyani, Pearson, 2015.
2. Introduction to Automata Theory, Formal Languages and Computation, ShyamalenduKandar,
Pearson, 2013.
3. Theory of Computation, V.Kulkarni, Oxford University Press, 2013.
4. Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill, 2014.

Online Learning Resources:

https://nptel.ac.in/courses/106106049/
https://nptel.ac.in/courses/106104028
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(Common to CSE IT, CSD, CSE (AI), CSE (DS), AI&DS)
Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0509T 3 0 0 3 CIE 30 M

Course Title : DATA SCIENCE SEE 70 M

Course Objectives:
Course Objectives
This course is designed to:
• Understand the approaches for handling data related problems
• Explore the mathematical concepts required for Data science
• Explain the basic concepts of data science.
• Elucidate various Machine Learning algorithms.
• Introduce Natural Language Processing and Recommender Systems

UNIT- I
Introduction to Data Science, A Crash Course in Python, Visualizing Data.

Learning Outcomes:
At the end of the unit, students will be able to:
• Describe the importance of data analysis (L1).
• Identify the key connectors of Data Science (L4).
• Interpret and visualize the data using bar charts, line charts and scatter plots (L3).

UNIT-II
Linear Algebra, Statistics, Probability, Hypothesis and Inference, Gradient Descent.

Learning Outcomes:
At the end of the unit, students will be able to:
• Identify the Correlation between two vectors (L4).
• Test a given hypothesis (L3).
• Compute mean, median and mode for the given data (L3).

UNIT-III
Getting Data, Working with Data, Machine Leaning, k-Nearest Neighbors, Naïve Bayes.
Learning Outcomes:
At the end of the unit, students will be able to:
• Compute dimensionality reduction using PCA (L3).
• Differentiate supervised and unsupervised learning methods (L4).
• Describe overfitting, under fitting, bias, variance and goodness of learning (L1).
• Solve classification problem using k-nearest neighbor classifier (L3).
• Apply Naïve Bayes classifier to solve decision making problem (L3).

UNIT-IV
Simple Linear Regression, Multiple Regression, Logistic Regression, Decision Trees, Neural Networks.
Learning Outcomes:

At the end of the unit, students will be able to:

• Describe gradient descent approach, maximum likelihood estimation and method of least squares
(L1).
• Apply SVM to determine a hyperplane with maximum margin (L3).
• Determine decision tree for given data (L5).
• Describe Perceptron and Back Propagation (L3).

UNIT-V
Clustering, Natural Language Processing, Network Analysis, Recommender Systems. Database and SQL,
MapReduce

Learning Outcomes:
At the end of the unit, students will be able to:
• Determine Clusters in data using k-means and Hierarchical Clustering methods (L5).
• Apply basic SQL Operations using NotQuiteABase (L3).
• Compare User-Based and Item-Based Collaborative Filtering (L2).
• Describe Grammer and MapReduce (L1).

Course Outcomes:
After completion of this course the student would be able to
• Visualize the data using bar charts, line charts and scatter plots (L4).
• Analyse Correlation between two data objects (L4).
• Demonstrate feature selection and dimensionality reduction.(L2)
• Solve decision making problems using k-NN, Naïve Bayes, SVM and Decision. Trees (L3).
• Determine Clusters in data using k-means and Hierarchical Clustering methods (L3).
• Design basic SQL Operations using NotQuiteABase (L6)
• Demonstrate the way to use machine learning algorithms using python. (L2)
Text Books:
1. Data Science from Scratch, First Principles with Python - Joel Grus, O’Reilly, First Edition.

Reference Books:
1. The Data Science Handbook, Field Cady, WILEY.
2. An Introduction to Data Science, Jeffrey M. Stanton, Jeffrey Stanton, 2012
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Professional Elective - I L T P C Exam 3 Hrs

Course Code : 20APE0501 3 0 0 3 CIE 30 M

Course Title : CRYPTOGRAPHY & NETWORK SECURITY SEE 70 M

Course Objectives:
This course aims at training students to master the:
• The concepts of classical encryption techniques and concepts of finite fields and number theory
• Working principles and utilities of various cryptographic algorithms including secret key cryptography,
hashes, and message digests, and public key algorithms
• Design issues and working principles of various authentication protocols, PKI standards
• Various secure communication standards including Kerberos, IPsec, TLS and email
• Concepts of cryptographic utilities and authentication mechanisms to design secure applications

Course Outcomes:
• After completion of the course, students will be able to
• Identify information security goals, classical encryption techniques and acquire fundamental
knowledge on the concepts of finite fields and number theory
• Compare and apply different encryption and decryption techniques to solve problems related to
confidentiality and authentication
• Apply the knowledge of cryptographic checksums and evaluate the performance of different
message digest algorithms for verifying the integrity of varying message sizes.
• Apply different digital signature algorithms to achieve authentication and create secure applications
• Apply network security basics, analyse different attacks on networks and evaluate the performance
of firewalls and security protocols like TLS, IPSec, and PGP
• Apply the knowledge of cryptographic utilities and authentication mechanisms to design secure
applications

UNIT I Lecture 9Hrs

Computer and Network Security Concepts : Computer Security Concepts, The OSI Security Architecture,
Security Attacks ,Security Services , Security Mechanisms ,A Model for Network Security, Classical
Encryption Techniques : Symmetric Cipher Model ,Substitution Techniques ,Transposition Techniques
,Steganography, Block Ciphers : Traditional Block Cipher Structure, The Data Encryption Standard,
Advanced Encryption Standard :AES Structure, AES Transformation Functions
UNIT II Lecture 9Hrs
Number Theory:
The Euclidean Algorithm, Modular Arithmetic, Fermat’s and Euler’s Theorems, The Chinese Remainder
Theorem, Discrete Logarithms, Finite Fields: Finite Fields of the Form GF(p), Finite Fields of the Form
GF(2n).Public Key Cryptography: Principles, Public Key Cryptography Algorithms, RSA Algorithm, Diffie
Hellman Key Exchange, Elliptic Curve Cryptography.

UNIT III Lecture 9Hrs

Cryptographic Hash Functions: Application of Cryptographic Hash Functions, Requirements & Security,
Secure Hash Algorithm, Message Authentication Functions, Requirements & Security, HMAC & CMAC.
Digital Signatures: NIST Digital Signature Algorithm, Distribution of Public Keys, X.509 Certificates, Public-
Key Infrastructure

UNIT IV Lecture 9Hrs

User Authentication: Remote User Authentication Principles, Kerberos. Electronic Mail Security: Pretty Good
Privacy (PGP) And S/MIME.
IP Security: IP Security Overview, IP Security Policy, Encapsulating Security Payload, Combining Security
Associations, Internet Key Exchange.

UNIT V Lecture 8Hrs

Transport Level Security: Web Security Requirements, Transport Layer Security (TLS), HTTPS, Secure Shell
(SSH)
Firewalls: Firewall Characteristics and Access Policy, Types of Firewalls, Firewall Location and
Configurations.

Textbooks:
1) Cryptography and Network Security- William Stallings, Pearson Education, 7thEdition.
2) Cryptography, Network Security and Cyber Laws – Bernard Menezes, Cengage Learning, 2010
edition.
Reference Books:
1) Cryptography and Network Security- Behrouz A Forouzan, Debdeep Mukhopadhyaya, Mc-GrawHill,
3rd Edition, 2015.
2) Network Security Illustrated, Jason Albanese and Wes Sonnenreich, MGH Publishers, 2003.

Online Learning Resources:

1) https://nptel.ac.in/courses/106/105/106105031/lecture by Dr. Debdeep Mukhopadhyay IIT
Kharagpur [Video Lecture]
2) https://nptel.ac.in/courses/106/105/106105162/lecture by Dr. Sourav Mukhopadhyay IIT Kharagpur
[Video Lecture]
3) https://www.mitel.com/articles/web-communication-cryptography-and-network-securityweb articles
by Mitel Power Connections
RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Open Elective - I L T P C Exam 3 Hrs

Course Code : 20AOE5401 3 0 0 3 CIE 30 M

Course Title : OPTIMIZATION TECHNIQUES SEE 70 M

Course Objectives:
This course enables the students to classify and formulate real-life problem for modeling as optimization
problem, solving and applying for decision making.

Course Outcomes:
Student will be able to
• formulate a linear programming problem and solve it by various methods.
• give an optimal solution in assignment jobs, give transportation of items from sources to destinations.
• identify strategies in a game for optimal profit.
• implement project planning.

UNIT I
Introduction to operational research-Linear programming problems (LPP)-Graphical method-Simplex
method-Big M Method-Dual simplex method.

UNIT II
Transportation problems- assignment problems-Game theory.

UNIT III
CPM and PERT –Network diagram-Events and activities-Project Planning-Reducing critical events and
activities-Critical path calculations.

UNIT IV
Sequencing Problems-Replacement problems-Capital equipment- Discounting costs- Group replacement.

UNIT V
Inventory models-various costs- Deterministic inventory models-Economic lot size-Stochastic inventory
models- Single period inventory models with shortage cost.

Textbooks:
1. Operations Research , S.D. Sharma.
2. Operations Research, An Introduction, Hamdy A. Taha, Pearson publishers.
3. Operations Research, Nita H Shah, Ravi M Gor, Hardik Soni, PHI publishers
Reference Books:
1. Problems on Operations Research, Er. Prem kumargupta, Dr.D.S. Hira, Chand publishers
2. Operations Research, CB Gupta, PK Dwivedi, Sunil kumaryadav

Online Learning Resources:

https://nptel.ac.in/content/storage2/courses/105108127/pdf/Module_1/M1L2slides.pdf
https://slideplayer.com/slide/7790901/
https://www.ime.unicamp.br/~andreani/MS515/capitulo12.pdf
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Mandatory Non-credit Course L T P C Exam 3 Hrs

Course Code : 20AMC9904 2 0 0 0 CIE 50 M

Course Title : INDIAN CONSTITUTION AND SOCIETY SEE

COURSE OBJECTIVES:
The objective of this course is
• To enable the student to understand the importance of constitution.
• To understand the structure of executive, legislature and judiciary.
• To understand philosophy of fundamental rights and duties.
• To understand the autonomous nature of constitutional bodies like Supreme Court and high court
controller and auditor general of India and Election Commission of India.
• To understand the central-state relation in financial and administrative control.

UNIT I:
Introduction to Indian Constitution – Constitution - Meaning of the term - Indian Constitution- Sources and
constitutional history – Features – Citizenship – Preamble - Fundamental Rights and Duties - Directive
Principles of State Policy.

Learning Outcomes:
After completion of this unit student will
• Understand the concept of Indian constitution.
• Apply the knowledge on directive principle of state policy.
• Analyze the History and features of Indian constitution.
• Learn about Preamble, Fundamental Rights and Duties.

UNIT II:
Union Government and its Administration Structure of the Indian Union - Federalism - Centre-State
relationship – President’s Role, power and position - PM and Council of ministers - Cabinet and Central
Secretariat – Lok Sabha - Rajya Sabha - The Supreme Court and High Court - Powers and Functions.

Learning Outcomes:
After completion of this unit student will
• Understand the structure of Indian government.
• Differentiate between the state and central government.
• Explain the role of President and Prime Minister.
• Know the Structure of Supreme Court and High court.
UNIT III:
State Government and its Administration - Governor - Role and Position - CM and Council of ministers - State
Secretariat - Organization Structure and Functions.

Learning Outcomes:
After completion of this unit student will
• Understand the structure of state government.
• Analyze the role of Governor and Chief Minister.
• Explain the role of State Secretariat.
• Differentiate between structure and functions of state secretariat.

UNIT IV:
Local Administration - District’s Administration Head - Role and Importance - Municipalities - Mayor and role
of Elected Representatives - CEO of Municipal Corporation Pachayati Raj – Functions – PRI –Zilla Parishath
- Elected officials and their roles – CEO, ZillaParishath - Block level Organizational Hierarchy - (Different
departments) - Village level - Role of Elected and Appointed officials - Importance of grass root democracy.

Learning Outcomes:
After completion of this unit student will
• Understand the local Administration.
• Compare and contrast district administration’s role and importance.
• Analyze the role of Mayor and elected representatives of Municipalities.
• Learn about the role of Zilla Parishath block level organization.

UNIT V:
Election Commission - Election Commission - Role of Chief Election Commissioner and Election
Commissionerate - State Election Commission - Functions of Commissions for the welfare of SC/ST/OBC
and Women.

Learning Outcomes:
After completion of this unit student will
• Know the role of Election Commission.
• Contrast and compare the role of Chief Election commissioner and Commissionerate.
• Analyze the role of state election commission.
• Evaluate various commissions viz SC/ST/OBC and women.

TEXT BOOKS:
1. Durga Das Basu, “Introduction to the Constitution of India”, Prentice – Hall of India Pvt. Ltd... New
Delhi.
2. Subash Kashyap, “Indian Constitution”, National Book Trust.
REFERENCES:
1. J. A. Siwach, “Dynamics of Indian Government & Politics”.
2. H. M. Sreevai, “Constitutional Law of India”, 4th edition in 3 volumes (Universal Law Publication).
3. J.C. Johari, “Indian Government and Politics”, Hans India.
4. M.V. Pylee, “Indian Constitution Durga Das Basu, Human Rights in Constitutional Law, Prentice”Hall
of India Pvt. Ltd... New Delhi.

COURSE OUTCOMES:
At the end of the course, students will be able to
• Understand historical background of the constitution making and its importance for building a
democratic India.
• Understand the functioning of three wings of the government i.e., executive, legislative and judiciary.
• Understand the value of the fundamental rights and duties for becoming good citizen of India.
• Analyze the decentralization of power between central, state and local self-government.
• Apply the knowledge in strengthening of the constitutional institutions like CAG, Election Commission
and UPSC for sustaining democracy.

E-RESOURCES:
1. nptel.ac.in/courses/109104074/8
2. nptel.ac.in/courses/109104045/
3. nptel.ac.in/courses/101104065/
4. www.hss.iitb.ac.in/en/lecture-details.
5. www.iitb.ac.in/en/event/2nd-lecture-institute-lecture-series-indian-constitution.
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(Common to CSE, IT, CSE (AI), CSE (AI&ML), AI&DS)
Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0508P 0 0 3 1.5 CIE 30 M

Course Title : ARTIFICIAL INTELLIGENCE LAB SEE 70 M

Course Objectives:
• To teach the methods of implementing algorithms using artificial intelligence techniques
• To illustrate search algorithms
To demonstrate the building of intelligent agents

Course Outcomes:
After completion of the course, students will be able to
• Implement search algorithms
• Solve Artificial intelligence problems
• Design Chabot and virtual assistant

List of Experiments:
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 implement 8 puzzle problem
5. Write a program to implement Towers of Hanoi problem
6. Write a program to implement A* Algorithm
7. Write a program to implement Hill Climbing Algorithm
8. Build a Chabot using AWS Lex, Pandora bots.
9. Build a bot that provides all the information related to your college.
10. Build a virtual assistant for Wikipedia using Wolfram Alpha and Python

11. 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.

12. 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 a backpack size of 2:5 x N for each value
problem size N. Please note that the method used to generate 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.

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.

Online Learning Resources/Virtual Labs:

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
http://vlabs.iitb.ac.in/vlabs-dev/labs/machine_learning/labs/index.php
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0509P 0 0 3 1.5 CIE 30 M

Course Title : DATA SCIENCE LAB SEE 70 M

Course Objectives:
The course should enable the students to:
 Understand the R Programming Language.
 Exposure on Solving of data science problems.
 Understand The classification and Regression Model

Week-1 R AS CALCULATOR APPLICATION

a. Using with and without R objects on console
b. Using mathematical functions on console
c. Write an R script, to create R objects for calculator application and save in a specified location in disk

Week-2 DESCRIPTIVE STATISTICS IN R

a. Write an R script to find basic descriptive statistics using summary
b. Write an R script to find subset of dataset by using subset ()

Week-3 READING AND WRITING DIFFERENT TYPES OF DATASETS

a. Reading different types of data sets (.txt, .csv) from web and disk and writing in file in specific disk
location.
b. Reading Excel data sheet in R.
c. Reading XML dataset in R.

Week-4 VISUALIZATIONS
a. Find the data distributions using box and scatter plot.
b. Find the outliers using plot.
c. Plot the histogram, bar chart and pie chart on sample data

Week-5 CORRELATION AND COVARIANCE

a. Find the correlation matrix.
b. Plot the correlation plot on dataset and visualize giving an overview of relationships among data on
iris data.
c. Analysis of covariance: variance (ANOVA), if data have categorical variables on iris data
Week-6 REGRESSION MODEL
Import a data from web storage. Name the dataset and now do Logistic Regression to find out relation
between variables that are affecting the admission of a student in an institute based on his or her GRE score,
GPA obtained and rank of the student. Also check the model is fit or not. require (foreign), require (MASS)

Week-7 MULTIPLE REGRESSION MODEL

Apply multiple regressions, if data have a continuous independent variable. Apply on above dataset

Week-8 REGRESSION MODEL FOR PREDICTION

Apply regression Model techniques to predict the data on above dataset

Week-9 CLASSIFICATION MODEL

a. Install relevant package for classification.
b. Choose classifier for classification problem.
c. Evaluate the performance of classifier.

Week-10 CLUSTERING MODEL

a. Clustering algorithms for unsupervised classification.
b. Plot the cluster data using R visualizations.

Reference Books:
Yanchang Zhao, “R and Data Mining: Examples and Case Studies”, Elsevier, 1st Edition, 2012

Web References:
1.http://www.r-bloggers.com/how-to-perform-a-logistic-regression-in-r/
2.http://www.ats.ucla.edu/stat/r/dae/rreg.htm
3.http://www.coastal.edu/kingw/statistics/R-tutorials/logistic.html
4. http://www.ats.ucla.edu/stat/r/data/binary.csv
 RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(CSE)
Course Category : Skill Oriented Course - III L T P C Exam 3 Hrs

Course Code : 20ASC0504 1 0 2 2 CIE 30 M

Course Title : INTERNET OF THINGS SEE 70 M

Course Objectives:
• Understand the basics of Internet of Things and protocols.
• Discuss the requirement of IoT technology
• Introduce some of the application areas where IoT can be applied.
• Understand the vision of IoT from a global perspective, understand its applications, and determine
its market perspective using gateways, devices and data management

Introduction to IoT
Definition and Characteristics of IoT, physical design of IoT, IoT protocols, IoT communication models, IoT
Communication APIs, Communication protocols, Embedded Systems, IoT Levels and Templates

Prototyping IoT Objects using Microprocessor/Microcontroller

Working principles of sensors and actuators, setting up the board – Programming for IoT, Reading from
Sensors, Communication: communication through Bluetooth, Wi-Fi.

Experiments using ESP32

1. Serial Monitor, LED, Servo Motor - Controlling
• Experiment1:
Controlling actuators through Serial Monitor. Creating different led patterns and controlling them using push
button switches. Controlling servo motor with the help of joystick.
2. Distance Measurement of an object
• Experiment 2:
Calculate the distance to an object with the help of an ultrasonic sensor and display it on an LCD.
3. LDR Sensor, Alarm and temperature, humidity measurement
Experiment 3:
• Controlling relay state based on ambient light levels using LDR sensor.
• Basic Burglar alarm security system with the help of PIR sensor and buzzer.
• Displaying humidity and temperature values on LCD
4. Experiments using Raspberry Pi
Experiment 4:
• Controlling relay state based on input from IR sensors
• Interfacing stepper motor with R-Pi
• Advanced burglar alarm security system with the help of PIR sensor, buzzer and keypad. (Alarm
gets disabled if correct keypad password is entered)
• 5. Automated LED light control based on input from PIR (to detect if people are present) and LDR
(ambient light level)
5. IOT Framework
Experiment 5:
Upload humidity & temperature data to ThingSpeak, periodically logging ambient light level to ThingSpeak
Experiment 6:
Controlling LEDs, relay & buzzer using Blynk app
6. HTTP Based
Experiment 7:
• Introduction to HTTP. Hosting a basic server from the ESP32 to control various digital based
actuators (led, buzzer, relay) from a simple web page.
Experiment 8:
• Displaying various sensor readings on a simple web page hosted on the ESP32.

7. MQTT Based
Experiment 9:
Controlling LEDs/Motors from an Android/Web app, Controlling AC Appliances from an android/web app with
the help of relay.

Experiment 10:
Displaying humidity and temperature data on a web-based application

8. UAV/Drone:
Experiment 11:
• Demonstration of UAV elements, Flight Controller
• Mission Planner flight planning design
Experiment 12:
• Python program to read GPS coordinates from Flight Controller

Reference:
1. Adrian McEwen, Hakim Cassimally - Designing the Internet of Things, Wiley Publications, 2012.
2. Alexander Osterwalder, and Yves Pigneur – Business Model Generation – Wiley, 2011
3. ArshdeepBahga, Vijay Madisetti - Internet of Things: A Hands-On Approach, Universities Press,
2014.
4. The Internet of Things, Enabling technologies and use cases – Pethuru Raj, Anupama C. Raman,
CRC Press.

Online Learning Resources/Virtual Labs:

https://www.arduino.cc/
https://www.raspberrypi.org/