SRM VALLIAMMAI ENGINEERING COLLEGE
SRM Nagar, Kattankulathur 603 203
DEPARTMENT OF INFORMATION TECHNOLOGY
Name of the Staff : K.MOHANAMBAL
Designation : A.P. - Sr.G REV 00
Regulation : 2017
Sub.Code & Name : IT8076 & SOFTWARE TESTING
Semester/Branch : VI / IT-2
Academic Year : 2020-2021 ( EVEN Semester )
TOTAL
Planned HOURS/ Actual
UNIT TITLE HOURS References Mode of
Date TOPIC Date /UNIT Teaching
INTRODUCTION
Testing as an Engineering Activity , Testing as a
9.2.21 Process 1 T1/R4 BB/PPT
9.2.21 Testing Maturity Model,Testing axioms. 1 T1/R1 BB/PPT
11.2.21 Basic definitions,Software Testing Principles 1 T1/R1 BB/PPT
I The Tester's Role in a Software Development 9
11.2.21 Organization, 1 T1/R1 BB/PPT
16.2.21 Origins of Defects,Cost of defects , Defect Classes 1 T1/R1 BB/PPT
The Defect Repository and Test Design – Defect
16.2.21 Examples 1 T1/R1 BB/PPT
Developer/Tester Support of Developing a Defect
18.2.21 Repository 1 T1/R1 BB/PPT
Test 2
TEST CASE DESIGN
Test case Design Strategies , Using Black
18.2.21 BoxApproach to Test Case Design 1 T1/R4 BB/PPT
Boundary Value Analysis,Equivalence Class
20.2.21 Partitioning 1 T1/R1 BB/PPT
State-based testing – Cause-effect
graphing,Compatibility testing
1 T1/R2 BB/PPT
User documentation testing ,domain testing,Random
Testing – Requirements based testing
1 T1/R2 BB/PPT
II Using White Box Approach to Test design ,Test 9
Adequacy Criteria,Static testing vs. structural 1 T1/T2 BB/PPT
testing,Code
Functional testing , Coverage and Control Flow
Graphs,Covering Code Logic
1 T1/R1 BB/PPT
Paths-Code complexity testing,Additional White box
testing approaches,Evaluating Test Adequacy 1 T1/R1 BB/PPT
Criteria.
Test 2
LEVELS OF TESTING
The need for Levels of Testing – Unit Test – Unit
Test Planning – Designing the Unit Tests
1 T1/T2 BB/PPT
The Test Harness – Running the Unit tests and
Recording results,Integration tests ,
1 T1/T2 BB/PPT
Designing Integration Tests – Integration Test
Planning,Scenario testing , Defect bash elimination 1 T1/T2 BB/PPT
System Testing
III 9
TOTAL
Planned HOURS/ Actual
UNIT TITLE HOURS References Mode of
Date TOPIC Date /UNIT Teaching
III Acceptance testing ,Performance testing ,Regression 9
Testing ,Internationalization testing
1 T1/R3 BB/PPT
Ad-hoc testing ,Alpha, Beta Tests ,Testing OO
systems
1 T1/R1 BB/PPT
Usability and Accessibility testing ,Configuration
testing
1 T1/R1 BB/PPT
Compatibility testing ,Testing the
documentation ,Website testing.
1 T1/R1 BB/PPT
Test 2
TEST MANAGEMENT
People and organizational issues in testing –
Organization structures for testing teams
1 T1/R1 BB/PPT
Testing services ,Test Planning – Test Plan
Components
1 T1/T2 BB/PPT
Test Plan Attachments-Locating Test Items 1 T1/T2 BB/PPT
IV Test management-Test process – Reporting Test 9
Results
1 T1/T2 BB/PPT
Introducing the test specialist, Skills needed by a test
specialist
1 T1/T2 BB/PPT
Building a Testing Group,The Structure of Testing
Group,
1 T1/T2 BB/PPT
The Technical Training Program 1 T1/T2 BB/PPT
Test 2
TEST AUTOMATION
Software test automation 1 T1/R1 BB/PPT
Skill needed for automation – scope of automation 1 T1/R1 BB/PPT
Design and architecture for automation 1 T1/R1 BB/PPT
V 9
Requirements for a test tool 1 T1/R1,R2 BB/PPT
Challenges in automation 1 T1/R2,R3 BB/PPT
Test metrics and measurements 1 T1/R1,R2 BB/PPT
Project-Progress and productivity metrics. 1 T1/R2,R3 BB/PPT
Test 2
Total Periods : 45 Periods
T1-Text Book, T2-Text Book
R1-Reference1, R2-Reference2, R3-Reference3
R4-Reference4
PPT – PowerPoint Presentation
TEXT BOOK:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and Practices”, Pearson Education, 2006.
2. Ron Patton, “ Software Testing”, Second Edition, Sams Publishing, Pearson Education, 2007.
REFERENCES:
1. Ilene Burnstein, “ Practical Software Testing”, Springer International Edition, 2003.
2. Edward Kit,” Software Testing in the Real World – Improving the Process”, Pearson Education, 1995.
3. Boris Beizer,” Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold, New York, 1990.
4. Aditya P. Mathur, “Foundations of Software Testing _ Fundamental Algorithms and Techniques”, Dorling Kindersley (India) Pvt.
Ltd., Pearson Education, 2008.
STAFF IN -CHARGE HOD
SRM VALLIAMMAI ENGINEERING COLLEGE
(An Autonomous Institution)
SRM Nagar, Kattankulathur 603 203
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Name of the Staff : Dr.A.Samydurai
Designation : Professor
Regulation : 2019 REV 00
Sub.Code & Name : 1908014_Software Testing
Semester/Branch : VI & CSE
Academic Year : 2023-2024 ( EVEN Semester )
TOTAL
HOURS/
UNIT DATE TITLE HOURS REFERENCE MODE OF
TOPIC /UNIT TEACHING
INTRODUCTION Notion of an Algorithm 1 T1/R4 PPT
Fundamentals of Algorithmic Problem Solving 1 T1/R1 PPT
Important Problem Types, Fundamentals of the
1 T1/R1 PPT
Analysis of Algorithm Efficiency
Asymptotic Notations and its properties, 1 T1/R1 PPT
Analysis Framework 1 T1/R1 PPT
I 9
Emprical Analysis 1 T1/R1 PPT
1 T1/R1 PPT
Mathematical analysis for Recursive and Non-
Recursive algorithms 1 T1/R1 PPT
Visualization 1 T1/R1 PPT
BRUTE FORCE METHOD Brute Force
1 T1/R4 PPT
Computing
String Matching 1 T1/R1 PPT
Closest-Pair problems 1 T1/R2 PPT
II Convex 1 9 T1/R2 PPT
Hull Problems 1 T1/T2 PPT
Exhaustive Search 1 T1/R1 PPT
Traveling SalesmanProblem 1 T1/R1 PPT
Knapsack Problem 1 T1/R1 PPT
Assignment problem 1
DIVIDE-AND-CONQUER TECHNIQUE 1
Divide and conquer methodology 1 T1/T2 PPT
Binary search 1 T1/T2 PPT
Merge sort 1 T1/T2 PPT
Quick sort 1 T1/R3 PPT
III Heap sort 1 9 T1/R1 PPT
Multiplication of Large Integers 1 T1/R1 PPT
Strassen’s Matrix Multiplication, 1 T1/R1 PPT
Closest
Pair and Convex-Hull Problems. 1 T1/R1 PPT
TOTAL
HOURS/
UNIT DATE TITLE HOURS REFERENCE MODE OF
TOPIC /UNIT TEACHING
DYNAMIC PROGRAMMING AND
1
GREEDY TECHNIQUE
Principal of optimality- coin changing problem-
1 T1/R1 PPT
Computing a Binomial Coefficient
Floyd’ algorithm,Multistage graph 1 T1/T2 PPT
Optimal Binary Search Trees Knapsack
1 T1/T2 PPT
Problem
IV Memory functions, Greedy Technique- 9
1 T1/T2 PPT
Container loading Problem
Prim’s algorithm 1 T1/T2 PPT
Kruskal's Algorithm, 1 T1/T2 PPT
0/1 Knapsack Problem
Optimal Merge pattern, Huffman Trees 1 T1/T2 PPT
1 T1/T2 PPT
COPING UP WITH THE LIMITATIONS
1
OF ALGORITHEM POWER
Limitations of Algorithm Power-Lower Bound
1 T1/R1 PPT
Arguments
Decision Trees 1 T1/R1 PPT
P, NP and NP-Complete Problems 1 T1/R1 PPT
V Coping with the Limitations Backtracking, 9
1 T1/R1,R2 PPT
Queens problem
Hamiltonian Circuit Problem 1 T1/R2,R3 PPT
Subset Sum Problem 1 T1/R1,R2 PPT
Branch and Bound –LIFO-FIFO 1 T1/R2,R3 PPT
Assignment problem 1 T1/T2 PPT
Knapsack Problem
Traveling Salesman Problem
T1-Text Book, T2-Te Traveling Salesman problem,
Approximation Algorithms for NP Hard
R1-Reference1, R2-R
Problems, Knapsack problem
R4-Reference4
PPT – PowerPoint Presentation
1.
Srinivasa
2. Ron
TEXT
n
Patton, BOOK:
“
Desikan
Software
Testing”,
REFERE
2.
NCES:
Edward
3. Boris
1. Ilene Burnstein, “ Practical Software Testing”, Springer International Edition, 2003.
Kit,”
Beizer,”
4. Aditya
Software
Software
P.
Testing
Mathur,
“Foundat
STAFF INCHARGE HOD
Exhaustiv
e Search
