R22 B.Tech.

CSE JNTU
Syllabus Hyderabad
II YEAR II SEMESTER

III YEAR II SEMESTER

Course
S. No. Course Title L T P Credits
Code
1 CS601PC Machine Learning 3 0 0 3
2 CS602PC Formal Languages and Automata Theory 3 0 0 3
3 CS603PC Artificial Intelligence 3 0 0 3
4 Professional Elective – III 3 0 0 3
5 Open Elective-I 3 0 0 3
6 CS604PC Machine Learning Lab 0 0 2 1
7 CS605PC Artificial Intelligence Laboratory 0 0 2 1
8 Professional Elective-III Lab 0 0 2 1
9 CS606PC Industrial Oriented Mini Project/ Internship/ Skill
0 0 4 2
Development Course (Big data-Spark)
10 *MC609 Environmental Science 3 0 0 0
Total 18 0 8 20

Page 1 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad

Page 82 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS601PC: MACHINE LEARNING

B.Tech. III Year II Sem. L T P C

3 0 0 3
Course Objectives:
 To introduce students to the basic concepts and techniques of Machine Learning.
 To have a thorough understanding of the Supervised and Unsupervised learning
techniques
 To study the various probability-based learning techniques

Course Outcomes:
 Distinguish between, supervised, unsupervised and semi-supervised learning
 Understand algorithms for building classifiers applied on datasets of non-linearly
separable classes
 Understand the principles of evolutionary computing algorithms
 Design an ensembler to increase the classification accuracy

UNIT - I
Learning – Types of Machine Learning – Supervised Learning – The Brain and the
Neuron – Design a Learning System – Perspectives and Issues in Machine Learning –
Concept Learning Task – Concept Learning as Search – Finding a Maximally Specific
Hypothesis – Version Spaces and the Candidate Elimination Algorithm – Linear
Discriminants: – Perceptron – Linear Separability – Linear Regression.

UNIT - II
Multi-layer Perceptron– Going Forwards – Going Backwards: Back Propagation Error –
Multi-layer Perceptron in Practice – Examples of using the MLP – Overview – Deriving Back-
Propagation – Radial Basis Functions and Splines – Concepts – RBF Network – Curse of
Dimensionality – Interpolations and Basis Functions – Support Vector Machines

UNIT - III
Learning with Trees – Decision Trees – Constructing Decision Trees – Classification
and Regression Trees – Ensemble Learning – Boosting – Bagging – Different ways
to Combine Classifiers – Basic Statistics – Gaussian Mixture Models – Nearest Neighbor
Methods – Unsupervised Learning – K means Algorithms

UNIT - IV
Dimensionality Reduction – Linear Discriminant Analysis – Principal Component
Analysis – Factor Analysis – Independent Component Analysis – Locally Linear
Embedding – Isomap – Least Squares Optimization
Evolutionary Learning – Genetic algorithms – Genetic Offspring: - Genetic Operators – Using
Genetic Algorithms

UNIT - V
Reinforcement Learning – Overview – Getting Lost Example
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov Chain
Monte Carlo – Graphical Models – Bayesian Networks – Markov Random Fields – Hidden
Markov Models – Tracking Methods

TEXT BOOKS:
1. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective,
Second Edition, Chapman and Hall/CRC Machine Learning and Pattern

Page 83 of 26
R22 B.Tech. CSE JNTU
Recognition Series, 2014.
Syllabus Hyderabad

Page 84 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
REFERENCE BOOKS:
1. Tom M Mitchell, ―Machine Learning, First Edition, McGraw Hill Education, 2013.
2. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make
Sense of Data‖, First Edition, Cambridge University Press, 2012.
3. Jason Bell, ―Machine learning – Hands on for Developers and Technical
Professionals‖, First Edition, Wiley, 2014
4. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive Computation
and Machine Learning Series), Third Edition, MIT Press, 2014

Page 90 of
154
 R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS602PC: FORMAL LANGUAGES AND AUTOMATA THEORY

B.Tech. III Year II Sem. L T P C

3 0 0 3
Course Objectives
 To provide introduction to some of the central ideas of theoretical computer
science from the perspective of formal languages.
 To introduce the fundamental concepts of formal languages, grammars and automata
theory.
 Classify machines by their power to recognize languages.
 Employ finite state machines to solve problems in computing.
 To understand deterministic and non-deterministic machines.
 To understand the differences between decidability and undecidability.

Course Outcomes
 Understand the concept of abstract machines and their power to recognize the languages.
 Employ finite state machines for modeling and solving computing problems.
 Design context free grammars for formal languages.
 Distinguish between decidability and undecidability.

UNIT - I
Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central
Concepts of Automata Theory – Alphabets, Strings, Languages, Problems.
Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite
Automata with Epsilon-Transitions.
Deterministic Finite Automata: Definition of DFA, How A DFA Process Strings, The language of
DFA, Conversion of NFA with €-transitions to NFA without €-transitions. Conversion of
NFA to DFA, Moore and Melay machines

UNIT - II
Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to
Regular Expressions.
Pumping Lemma for Regular Languages, Statement of the pumping lemma, Applications of
the Pumping Lemma.
Closure Properties of Regular Languages: Closure properties of Regular languages, Decision
Properties of Regular Languages, Equivalence and Minimization of Automata.

UNIT - III
Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a Grammar,
Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential Forms,
Parse Trees, Applications of Context-Free Grammars, Ambiguity in Grammars and
Languages.
Push Down Automata: Definition of the Pushdown Automaton, the Languages of a PDA,
Equivalence of PDA's and CFG's, Acceptance by final state, Acceptance by empty stack,
Deterministic Pushdown Automata. From CFG to PDA, From PDA to CFG.

UNIT - IV
Normal Forms for Context- Free Grammars: Eliminating useless symbols, Eliminating €-Productions.
Chomsky Normal form Greibach Normal form.
Pumping Lemma for Context-Free Languages: Statement of pumping lemma, Applications
Closure Properties of Context-Free Languages: Closure properties of CFL’s, Decision
Properties of CFL's Turing Machines: Introduction to Turing Machine, Formal Description,
Page 91 of 26
R22 B.Tech. CSE JNTU
Instantaneous
Syllabus description, The language of a Turing machine Hyderabad

Page 92 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
UNIT - V
Types of Turing machine: Turing machines and halting
Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An
Undecidable Problem That is RE, Undecidable Problems about Turing Machines,
Recursive languages, Properties of recursive languages, Post's Correspondence Problem,
Modified Post Correspondence problem, Other Undecidable Problems, Counter machines.

TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John
E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,
Mishra and Chandrashekaran, 2nd edition, PHI.

REFERENCE BOOKS:
1. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. A Textbook on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge University Press.
4. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
5. Introduction to Formal languages Automata Theory and Computation Kamala
Krithivasan, Rama R, Pearson.

Page 93 of 26
 R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS603PC: ARTIFICIAL INTELLIGENCE
B.Tech. III Year II Sem. L T P C
3 0 0 3
Prerequisites:
1. Programming for problem solving, Data Structures.

Course Objectives:
 To learn the distinction between optimal reasoning Vs. human like reasoning
 To understand the concepts of state space representation, exhaustive
search, heuristic search together with the time and space complexities.
 To learn different knowledge representation techniques.
 To understand the applications of AI, namely game playing, theorem proving,
and machine learning.

Course Outcomes:
 Understand search strategies and intelligent agents
 Understand different adversarial search techniques
 Apply propositional logic, predicate logic for knowledge representation
 Apply AI techniques to solve problems of game playing, and machine learning.

UNIT - I
Introduction to AI, Intelligent Agents, problem-Solving Agents, Searching for Solutions,
Uninformed Search Strategies: Breadth-first search, Uniform cost search, Depth-first
search, Iterative deepening Depth-first search, Bidirectional search, Informed (Heuristic)
Search Strategies: Greedy best-first search, A* search, Heuristic Functions, Beyond
Classical Search: Hill-climbing search, Simulated annealing search, Local Search in
Continuous Spaces

UNIT - II
Problem Solving by Search-II and Propositional Logic
Adversarial Search: Games, Optimal Decisions in Games, Alpha–Beta Pruning, Imperfect
Real-Time Decisions. Constraint Satisfaction Problems: Defining Constraint Satisfaction
Problems, Constraint Propagation, Backtracking Search for CSPs, Local Search for CSPs,
The Structure of Problems. Propositional Logic: Knowledge-Based Agents, The Wumpus
World, Logic, Propositional Logic, Propositional Theorem Proving: Inference and proofs,
Proof by resolution, Horn clauses and definite clauses, Forward and backward chaining,
Effective Propositional Model Checking, Agents Based on Propositional Logic.

UNIT - III
Logic and Knowledge Representation
First-Order Logic: Representation, Syntax and Semantics of First-Order Logic, Using First-
Order Logic, Knowledge Engineering in First-Order Logic.
Inference in First-Order Logic: Propositional vs. First-Order Inference, Unification and Lifting,
Forward Chaining, Backward Chaining, Resolution.

UNIT - IV
Knowledge Representation: Ontological Engineering, Categories and Objects, Events. Mental
Events and Mental Objects, Reasoning Systems for Categories, Reasoning with Default
Information.
Classical Planning: Definition of Classical Planning, Algorithms for Planning with State-Space
Search, Planning Graphs, other Classical Planning Approaches, Analysis of Planning
approaches.

Page 94 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
UNIT - V
Uncertain knowledge and Learning Uncertainty: Acting under Uncertainty, Basic
Probability Notation, Inference Using Full Joint Distributions, Independence, Bayes’ Rule
and Its Use Probabilistic Reasoning: Representing Knowledge in an Uncertain Domain,
The Semantics of Bayesian Networks, Efficient Representation of Conditional
Distributions, Approximate Inference in Bayesian Networks, Relational and First-Order
Probability, Other Approaches to Uncertain Reasoning; Dempster-Shafer theory.

TEXT BOOK:
1. Artificial Intelligence: A Modern Approach, Third Edition, Stuart Russell and
Peter Norvig, Pearson Education.

REFERENCE BOOKS:
1. Artificial Intelligence, 3rd Edn, E. Rich and K. Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henry Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Education.
4. Artificial Intelligence and Expert systems – Patterson, Pearson Educatio

Page 95 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad

Page 96 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS634PE: MOBILE APPLICATION DEVELOPMENT (Professional Elective – III)

B.Tech. III Year II Sem. L T P C

3 0 0 3
Prerequisites
1. Acquaintance with JAVA programming
2. A Course on DBMS

Course Objectives
 To demonstrate their understanding of the fundamentals of Android operating systems
 To improves their skills of using Android software development tools
 To demonstrate their ability to develop software with reasonable
complexity on mobile platform
 To demonstrate their ability to deploy software to mobile devices
 To demonstrate their ability to debug programs running on mobile devices

Course Outcomes
 Understand the working of Android OS Practically.
 Develop Android user interfaces
 Develop, deploy and maintain the Android Applications.

UNIT - I
Introduction to Android Operating System: Android OS design and Features – Android
development framework, SDK features, Installing and running applications on Android
Studio, Creating AVDs, Types of Android applications, Best practices in Android
programming, Android tools Android application components – Android Manifest file,
Externalizing resources like values, themes, layouts, Menus etc, Resources for different
devices and languages, Runtime Configuration Changes
Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring state
changes

UNIT - II
Android User Interface: Measurements – Device and pixel density independent
measuring unit - s Layouts – Linear, Relative, Grid and Table Layouts
User Interface (UI) Components –Editable and non-editable TextViews, Buttons, Radio
and Toggle Buttons, Checkboxes, Spinners, Dialog and pickers
Event Handling – Handling clicks or changes of various UI components
Fragments – Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments
to Activity, adding, removing and replacing fragments with fragment transactions,
interfacing between fragments and Activities, Multi-screen Activities

UNIT - III
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new
Activity, Implicit Intents, Passing data to Intents, Getting results from Activities, Native
Actions, using Intent to dial a number or to send SMS
Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters,
finding and using Intents received within an Activity
Notifications – Creating and Displaying notifications, Displaying Toasts

UNIT - IV
Persistent Storage: Files – Using application specific folders and files, creating files, reading
data from files, listing contents of a directory Shared Preferences – Creating shared
preferences, saving and retrieving data using Shared Preference

Page 100 of
154
R22 B.Tech. CSE JNTU
Syllabus Hyderabad
UNIT - V
Database – Introduction to SQLite database, creating and opening a database, creating
tables, inserting retrieving and etindelg data, Registering Content Providers, Using content
Providers (insert, delete, retrieve and update)

TEXT BOOK:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012

REFERENCE BOOKS:
1. Android Application Development for Java Programmers, James C Sheusi,
Cengage Learning, 2013
2. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013

Page 101 of
154
 R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS635PE: SOFTWARE TESTING METHODOLOGIES (Professional Elective – III)

B.Tech. III Year II Sem. L T P C

3 0 0 3
Prerequisites
1. Software Engineering
Course Objectives
 To provide knowledge of the concepts in software testing such as testing
process, criteria, strategies, and methodologies.
 To develop skills in software test automation and management using the latest tools.
Course Outcomes:
 Understand purpose of testing and path testing
 Understand strategies in data flow testing and domain testing
 Develop logic-based test strategies
 Understand graph matrices and its applications
 Implement test cases using any testing automation tool

UNIT - I
Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs,
taxonomy of bugs Flow graphs and Path testing: Basics concepts of path testing,
predicates, path predicates and achievable paths, path sensitizing, path
instrumentation, application of path testing.

UNIT - II
Transaction Flow Testing: transaction flows, transaction flow testing techniques.
Data Flow testing: Basics of data flow testing, strategies in data flow testing, application of
data flow testing.
Domain Testing: domains and paths, Nice & ugly domains, domain testing, domains and
interfaces testing, domain and interface testing, domains and testability.

UNIT - III
Paths, Path products and Regular expressions: path products & path expression, reduction
procedure, applications, regular expressions & flow anomaly detection.
Logic Based Testing: overview, decision tables, path expressions, kv charts, specifications.

UNIT - IV
State, State Graphs and Transition testing: state graphs, good & bad state graphs, state
testing, Testability tips.

UNIT - V
Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of
a matrix, node reduction algorithm, building tools. (Student should be given an exposure
to a tool like Jmeter/selenium/soapUI/Catalon).

TEXT BOOKS:
1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr. K. V. K. K. Prasad, Dreamtech.

REFERENCE BOOKS:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.

Page 102 of
154
R22 B.Tech. CSE JNTU
5. Art of Software Testing – Meyers, John Wile
Syllabus Hyderabad

Page 102 of
154
R22 B.Tech. CSE JNTU
Syllabus Hyderabad

Page 105 of
154
 R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS604PC: MACHINE LEARNING LAB

B.Tech. III Year II Sem. L T P C

0 0 2 1
Course Objective:
 The objective of this lab is to get an overview of the various machine learning
techniques and can demonstrate them using python.

Course Outcomes:
 Understand modern notions in predictive data analysis
 Select data, model selection, model complexity and identify the trends
 Understand a range of machine learning algorithms along with their
strengths and weaknesses
 Build predictive models from data and analyze their performance

List of Experiments
1. Write a python program to compute Central Tendency Measures:
Mean, Median, Mode Measure of Dispersion: Variance, Standard
Deviation
2. Study of Python Basic Libraries such as Statistics, Math, Numpy and Scipy
3. Study of Python Libraries for ML application such as Pandas and Matplotlib
4. Write a Python program to implement Simple Linear Regression
5. Implementation of Multiple Linear Regression for House Price Prediction using sklearn
6. Implementation of Decision tree using sklearn and its parameter tuning
7. Implementation of KNN using sklearn
8. Implementation of Logistic Regression using sklearn
9. Implementation of K-Means Clustering
10. Performance analysis of Classification Algorithms on a specific dataset (Mini Project)

TEXT BOOK:
1. Machine Learning – Tom M. Mitchell, - MGH.

REFERENCE BOOK:
1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis.

Page 106 of
154
 R22 B.Tech. CSE JNTU
Syllabus Hyderabad
CS605PC: ARTIFICIAL INTELLIGENCE LAB

B.Tech. III Year II Sem. L T P C

0 0 2 1
Course Objectives:
 Become familiar with basic principles of AI toward problem solving, knowledge
representation, and learning.

Course Outcomes:
 Apply basic principles of AI in solutions that require problem solving, knowledge
representation, and learning.

LIST OF EXPERIMENTS
Write a Program to Implement the following using Python.
1. Breadth First Search
2. Depth First Search
3. Tic-Tac-Toe game
4. 8-Puzzle problem
5. Water-Jug problem
6. Travelling Salesman Problem
7. Tower of Hanoi
8. Monkey Banana Problem
9. Alpha-Beta Pruning
10. 8-Queens Problem

TEXT BOOK:
1. Artificial Intelligence a Modern Approach, Third Edition, Stuart Russell and
Peter Norvig, Pearson Education.

REFERENCE BOOKS:
1. Artificial Intelligence, 3rd Edn, E. Rich and K. Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Educatio

Page 107 of
154
 CS614PE: MOBILE APPLICATION DEVELOPMENT LAB (Professional Elective – III)

B.Tech. III Year II Sem. L T P C

0 0 21
Prerequisites: --- NIL---
Course Objectives:
 To learn how to develop Applications in an android environment.
 To learn how to develop user interface applications.
 To learn how to develop URL related applications.
Course Outcomes:
 Understand the working of Android OS Practically.
 Develop user interfaces.
 Develop, deploy and maintain the Android Applications.

LIST OF EXPERIMENTS:
1. Create an Android application that shows Hello + name of the user and run it on an emulator.
(b) Create an application that takes the name from a text box and shows hello message
along with the name entered in the text box, when the user clicks the OK button.
2. Create a screen that has input boxes for User Name, Password, Address, Gender
(radio buttons for male and female), Age (numeric), Date of Birth (Datepicker), State
(Spinner) and a Submit button. On clicking the submit button, print all the data below
the Submit Button. Use (a) Linear Layout (b) Relative Layout and (c) Grid Layout or
Table Layout.
3. Develop an application that shows names as a list and on selecting a name it should
show the details of the candidate on the next screen with a “Back” button. If the
screen is rotated to landscape mode (width greater than height), then the screen
should show list on left fragment and details on the right fragment instead of the
second screen with the back button. Use Fragment transactions and Rotation event
listeners.
4. Develop an application that uses a menu with 3 options for dialing a number, opening
a website and to send an SMS. On selecting an option, the appropriate action should
be invoked using intents.
5. Develop an application that inserts some notifications into Notification area and
whenever a notification is inserted, it should show a toast with details of the
notification.
6. Create an application that uses a text file to store usernames and passwords (tab
separated fields and one record per line). When the user submits a login name and
password through a screen, the details should be verified with the text file data and if
they match, show a dialog saying that login is successful. Otherwise, show the dialog
with a Login Failed message.
7. Create a user registration application that stores the user details in a database table.
8. Create a database and a user table where the details of login names and passwords
are stored. Insert some names and passwords initially. Now the login details entered
by the user should be verified with the database and an appropriate dialog should be
shown to the user.
9. Create an admin application for the user table, which shows all records as a list and
the admin can select any record for edit or modify. The results should be reflected in
the table.
10. Develop an application that shows all contacts of the phone along with details like
name, phone number, mobile number etc.
11. Create an application that saves user information like name, age, gender etc. in
shared preference and retrieves them when the program restarts.
12. Create an alarm that rings every Sunday at 8:00 AM. Modify it to use a time picker to set alarm
time.
TEXT BOOKS:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012.
2. Android Application Development for Java Programmers, James C Sheusi, Cengage, 2013.
REFERENCE BOOK:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013.
 CS615PE: SOFTWARE TESTING METHODOLOGIES LAB (Professional Elective – III)

B.Tech. III Year II Sem. L T P C

0 0 2 1
Prerequisites
 A basic knowledge of programming.

Course Objectives
 To provide knowledge of software testing methods.
 To develop skills in automation of software testing and software test automation
management using the latest tools.

Course Outcomes
 Design and develop the best test strategies in accordance with the development model.
 Design and develop GUI, Bitmap and database checkpoints
 Develop database checkpoints for different checks
 Perform batch testing with and without parameter passing

List of Experiments
1. Recording in context sensitive mode and analog mode
2. GUI checkpoint for single property
3. GUI checkpoint for single object/window
4. GUI checkpoint for multiple
objects 5.
a. Bitmap checkpoint for object/window
b. Bitmap checkpoint for screen area
1. Database checkpoint for Default check
6. Database checkpoint for custom check
6. Database checkpoint for runtime record
check 6.
a. Data driven test for dynamic test data submission
b. Data driven test through flat files
c. Data driven test through front grids
d. Data driven test through excel test

a. Batch testing without parameter passing

b. Batch testing with parameter passing
11. Data driven batch
11. Silent mode test execution without any interruption
12. Test case for calculator in windows application

TEXT BOOKS
1. Software Testing techniques, Baris Beizer, 2nd Edition, Dreamtech.
2. Software Testing Tools, Dr. K.V.K.K.Prasad, Dreamtech.

REFERENCE BOOKS
1. The craft of software testing, Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World, Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing, Mey
R22 B.Tech. CSE JNTU
Syllabus Hyderabad

Page 119 of 26
R22 B.Tech. CSE JNTU
Syllabus Hyderabad

Page 120 of 26