Date:

LESSON PLAN
22/06/2015

Sub. Name : Object Oriented Analysis and Design To 31/10/2015

Branch: CSE, Semester & Sections: V & A

T265 – OBJECT ORIENTED ANALYSIS AND DESIGN

Lecture : 4 Periods/week Internal Marks : 25
Tutorial : 1 External Marks : 75
Credits : 4 External Examination : 3 Hrs
------------------------------------------------------------------------------------------------------
---------

UNIT - I

Introduction to UML: Importance of modeling, principles of modeling, object oriented modeling,

onceptual model of the UML, Architecture, and Software Development Life Cycle.

UNIT - II

Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and
Roles, Packages.

UNIT - III

Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.

UNIT - IV

Basic Behavioral Modeling-I : Interactions, Interaction diagrams Use cases, Use case Diagrams,
Activity Diagrams

UNIT - V

Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and
space, state chart diagrams.

Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

TEXT BOOK

1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide,
Pearson Education.
REFERENCES

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Pascal Roques: Modeling Software Systems Using UML2, WILEY- Dreamtech India Pvt. Ltd.

3. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hil Companies.

4. Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and
Unified Process, Craig Larman, Pearson Education.

Pre requisite: Basic knowledge of object oriented methods, Software Engineering Concepts.

COURSE EDUCATIONAL OBJECTIVES:

 The main objective is the students become familiar with all phases of OOAD.
 Master the main features of the UML.
 Master the main concepts of Object Technologies and how to apply them at work and
develop the ability to analyze and solve challenging problem in various domains.
 Learn the Object design Principles and understand how to apply them towards
implementation.

COURSE OUTCOMES:

After the completion of the course, students should be able to:

1. Select the basic elements of modeling such as Things, Relationships and Diagrams depending
on the views of UML Architecture and SDLC.

2. Apply basic and Advanced Structural Modeling Concepts for designing real time applications.

3. Design Class and Object Diagrams that represent Static Aspects of a Software System.

4. Analyze Dynamic Aspects of a Software System using Use Case, Interaction and Activity
Diagrams.

5. Apply techniques of State Chart Diagrams and Implementation Diagrams to model behavioral
aspects and Runtime environment of Software Systems.
Detailed Lesson Plan

No. of Content delivery

S.NO DATE TOPIC TO BE COVERED Actual Date HOURS Methods

UNIT-I INTRODUCTION TO UML

1 22/06/15 Importance of Modelling 1 DM1

2 23/06/15 Principles of modelling 1 DM1

3 25/06/15 Object Oriented modelling 1 DM1

4 26/06/15 Conceptual model of the UML 1 DM1

5 27/06/15 Conceptual model of the UML 1 DM6

6 29/06/15 Conceptual model of the UML 1 DM6

7 30/06/15 UML Architecture 1 DM1

8 06/07/15 Software Development life cycle 1 DM6

9 07/07/15 Tutorial-I 1 DM2

10 09/07/15 Software Development life cycle 1 DM1

UNIT-II STRUCTURAL MODELLING

11 10/07/15 Basic Structural Modelling: Classes 1 DM1

12 13/07/15 Basic Structural Modelling: Classes 1 DM6

13 14/07/15 Relation ships 1 DM1

14 16/07/15 Common mechanisms 1 DM1

15 17/07/15 Common mechanisms 1 DM6

16 20/07/15 Common mechanisms 1 DM6

17 21/07/15 Diagrams 1 DM1

18 23/07/15 Tutorial-II DM2

19 24/07/15 Diagrams 1 DM6

20 25/07/15 Advanced Structural Modelling: Classes 1 DM2

21 27/07/15 Advanced Relation ships 1 DM1

22 28/07/15 Interfaces 1 DM6

23 30/07/15 Types and Roles 1 DM6

24 31/07/15 Packages DM1

25 01/08/15 Tutorial-III DM2

26 03/07/15 Review DM6

UNIT-III CLASSES & OBJECT DIAGRAMS

27 04/07/15 Terms & Concepts - Class diagrams 1 DM1

28 06/07/15 Modelling techniques for class diagrams 1 DM1

29 07/07/15 Modelling techniques for class diagrams 1 DM1

30 10/07/15

31 11/07/15

32 13/07/15 MID-I EXAMS

33 14/07/15

34 17/08/15

35 18/08/15 Terms & Concepts - Object diagrams 1 DM1

36 20/08/15 Modelling techniques for Object diagrams 1 DM6

37 21/08/15 Modelling techniques for Object diagrams 1 DM6

38 22/08/15 Tutorial-IV 1 DM2

UNIT-IV BASIC BEHAVIORAL MODELLING

39 24/08/15 Interactions 1 DM1

40 25/08/15 Interaction diagrams- Sequence 1 DM1

41 27/08/15 Interaction diagrams - Collaborations 1 DM1

42 28/08/15 Interaction diagrams –C M Techniques 1 DM6

43 29/08/15 Use cases 1 DM1

44 31/08/15 Use case Diagrams 1 DM1

45 01/09/15 Common modelling techniques 1 DM6

46 03/09/15 Activity diagrams 1 DM1

47 04/09/15 Common modelling techniques 1 DM6

48 05/09/15 Tutorial-V 1 DM2

49 07/09/15 Review DM6

50 08/09/15 Review DM6

UNIT-V

51 10/09/15 Advanced Behavioral Modelling 1 DM6

52 11/09/15 Events and Signals 1 DM1

53 14/09/15 Events and Signals 1 DM6

54 15/09/15 State machines 1 DM6

55 18/09/15 Processes and Threads 1 DM1

56 19/09/15 Time and Space 1 DM1

57 21/09/15 State Chart Diagrams 1 DM6

58 22/09/15 State Chart Diagrams 1 DM6

59 25/09/15 Tutorial-VI 1 DM2

60 26/09/15 Architectural Modelling 1 DM1

61 28/09/15 Components 1 DM1

62 29/09/15 Component Diagrams 1 DM6

63 01/10/15 Deployment 1 DM1

64 03/10/15 Deployment Diagrams 1 DM6

65 05/10/15 Tutorial-VII 1 DM2

66 06/10/15 Review 1 DM6

67 08/10/15 Review DM6

68 09/10/15 Review DM6

69 12/10/15 Review of Unit - IV DM6

70 13/10/15 Review of Unit - III DM6

71 15/10/15 Review of Unit - II DM6

72 16/10/15 Review of Unit - II DM6

73 17/10/15 Review of Unit - I DM6

74 26/10/15

75 27/10/15

76 29/10/15 MID – II EXAMS

77 30/10/15

78 31/10/15

TEXT BOOK :

1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide,
Pearson Education.
REFERENCES :
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hil Companies.

NOTE: DELIVERY METHODS: DM1: Lecture interspersed with discussions/BB, DM2: Tutorial
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration (laboratory, field visit)
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, CO3, CO4, CO5, and sample proofs are enclosed
in Course file.

Signature

Name of the Faculty Name of Course HOD

Coordinator
D VEERAIAH D VEERAIAH Dr. N RAVI SHANKAR
 LESSON PLAN
Date:
Sub Code: P860 22/06/2015

Sub Name: OBJECT ORIENTED ANALYSIS & DESIGN LAB To 31/10/2015

Branch: CSE Year:III B.Tech Semester : V

P860 – OBJECT ORIENTED ANALYSIS & DESIGN LAB.

Lab : 3 Periods/week Internal Marks : 25
External Marks : 75
Credits: 2 External Examination : 3 Hrs
---------------------------------------------------------------------------------------------------------------

The student should take up the following case studies which are mentioned below, and
Model it in different views i.e. Use case view, logical view, component view, Deployment view,
Database design, forward and Reverse Engineering, and Generation of documentation of the project.

1. Unified Library application

2. Automatic Teller Machine(ATM)
3. Student Admission Procedure
4. Online Book Shopping
5. Hospital Management System
6. Cellular Network

Pre requisite: Object Oriented Programming concepts, Concepts of ER model.

Course Objectives:

To impart in depth knowledge so that the student will

1. Develop a problem statement.

2. Identify Use Cases and develop the Use Case model.

3. Identify the business activities and develop an UML Activity diagram.

4. Identity the conceptual classes and develop a domain model with UML Class diagram.

5. Be using the identified scenarios find the interaction between objects and represent those using
UML

Interaction diagrams.
6. Draw the State Chart diagram.

7. Develop architecture diagram with UML package diagram notation.

8. Draw Component and Deployment diagrams.

Course Outcomes (CO’s)

After undergoing this laboratory module, the student should be able to:

1. Analyze Software Requirements for the given Software Application.

2. Develop the UML Diagrams to view Software System in Static and Dynamic Aspects.
3. Describe the dynamic behaviour and structure of the design.

Session Actual No. of Delivery

Date Method
No Topics to be covered (Week wise) Date Hours

26/06/15 3 DM5&6
1 Introduction to Rational Software
Getting Familiarity with UML Notation 27/06/15

03/07/15 3
2 Automatic Teller Machine(ATM) DM5&6
04/07/15

3 Automatic Teller Machine(ATM) 10/07/15 3 DM5&6

4 Automatic Teller Machine(ATM) 17/07/15 3 DM5&6

24/07/15 3
5 Unified Library Application DM5&6
25/07/15

31/07/15 3
6 Unified Library Application DM5&6
01/08/15

7 07/08/15 3 DM5&6
Student Admission Procedure
21/08/15 3
8 Student Admission Procedure DM5&6
22/08/15
 28/08/15 3
9 Student Admission Procedure DM5&6
Online Book Shopping 29/08/15

04/09/15 3
11 Online Book Shopping DM5&6
05/09/15

12 11/09/15 3 DM5&6
Online Book Shopping
18/09/15 3
13 Hospital Management System DM5&6
19/09/15

25/09/15 3
14 Cellular Network DM5&6
26/09/15

15 03/10/15 3 DM5&6
Lab Internal Exam
16 Lab Internal Exam 09/10/15 3 DM5&6

17 Revision 16/10/15 3
DM5&6
17/10/15

NOTE: DELIVERY METHODS: DM1: Lecture interspersed with discussions/DM1, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration (laboratory, field visit),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, and sample proofs are enclosed in Course
file.

Signature
Name of the Faculty Name of Course HOD
Coordinator
D VEERAIAH D VEERAIAH Dr. N RAVI SHANKAR
 LESSON PLAN
Date:
Sub Code: P860 22/06/2015

Sub Name: OBJECT ORIENTED ANALYSIS & DESIGN LAB To 31/10/2015

Branch: CSE Year:III B.Tech Semester : V (B-Sec)

P860 – OBJECT ORIENTED ANALYSIS & DESIGN LAB.

Lab : 3 Periods/week Internal Marks : 25
External Marks : 75
Credits: 2 External Examination : 3 Hrs
---------------------------------------------------------------------------------------------------------------

The student should take up the following case studies which are mentioned below, and
Model it in different views i.e. Use case view, logical view, component view, Deployment view,
Database design, forward and Reverse Engineering, and Generation of documentation of the project.

7. Unified Library application

8. Automatic Teller Machine(ATM)
9. Student Admission Procedure
10. Online Book Shopping
11. Hospital Management System
12. Cellular Network

Pre requisite: Object Oriented Programming concepts, Concepts of ER model.

Course Objectives:

To impart in depth knowledge so that the student will

1. Develop a problem statement.

2. Identify Use Cases and develop the Use Case model.

3. Identify the business activities and develop an UML Activity diagram.

4. Identity the conceptual classes and develop a domain model with UML Class diagram.

5. Be using the identified scenarios find the interaction between objects and represent those using
UML

Interaction diagrams.
6. Draw the State Chart diagram.

7. Develop architecture diagram with UML package diagram notation.

8. Draw Component and Deployment diagrams.

Course Outcomes (CO’s)

After undergoing this laboratory module, the student should be able to:

1. Analyze Software Requirements for the given Software Application.

2. Develop the UML Diagrams to view Software System in Static and Dynamic Aspects.
3. Describe the dynamic behaviour and structure of the design.

Session Actual No. of Delivery

Topics to be covered (Week wise) Date
No Date Hours Methods

22/06/15
1 Introduction to Rational Software 3 DM5&6
Getting Familiarity with UML Notation 24/06/15

29/06/15
2 Automatic Teller Machine(ATM) 3 DM5&6
01/07/15

06/07/15
3 Automatic Teller Machine(ATM) 3 DM5&6
08/07/15

13/07/15
4 Unified Library Application 3 DM5&6
15/07/15

20/07/15
5 Unified Library Application 3 DM5&6
22/07/15

27/07/15
6 Student Admission Procedure 3 DM5&6
29/07/15

7 Student Admission Procedure 03/08/15 3 DM5&6

 05/08/15

8 Student Admission Procedure 19/08/15 3 DM5&6

24/08/15
9 Online Book Shopping 3 DM5&6
26/08/15

31/08/15
11 Online Book Shopping 3 DM5&6
02/09/15

07/09/15
12 Hospital Management System 3 DM5&6
09/09/15

14/09/15
13 Hospital Management System 3 DM5&6
16/09/15

21/09/15
14 Cellular Network 3 DM5&6
23/09/15

28/09/15
15 Cellular Network 3 DM5&6
30/0915

05/10/15
16 Lab Internal Exam 3 DM5&6
07/10/15

12/10/15
17 Revision 3 DM5&6
14/10/15

NOTE: DELIVERY METHODS: DM1: Lecture interspersed with discussions/DM1, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration (laboratory, field visit),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, and sample proofs are enclosed in Course
file.

Signature
Name of the Faculty Name of Course HOD
Coordinator
D VEERAIAH D VEERAIAH Dr. N RAVI SHANKAR
 Date:
LESSON PLAN
22/06/2015

Sub. Name : Object Oriented Analysis and Design To 31/10/2015

Branch: CSE, Semester & Sections: V & B

T265 – OBJECT ORIENTED ANALYSIS AND DESIGN

Lecture : 4 Periods/week Internal Marks : 25
Tutorial : 1 External Marks : 75
Credits : 4 External Examination : 3 Hrs
------------------------------------------------------------------------------------------------------
---------

UNIT - I

Introduction to UML : Importance of modeling, principles of modeling, object oriented modeling,

conceptual model of the UML, Architecture, Software Development Life Cycle.

UNIT - II

Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and
Roles, Packages.

UNIT - III

Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.

UNIT - IV

Basic Behavioral Modeling-I : Interactions, Interaction diagrams Use cases, Use case Diagrams,
Activity Diagrams

UNIT - V
Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and
space, state chart diagrams.

Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

TEXT BOOK

1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide,
Pearson Education.

REFERENCES

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Pascal Roques: Modeling Software Systems Using UML2, WILEY- Dreamtech India Pvt. Ltd.
3. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hil Companies.

4. Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design and
Unified Process, Craig Larman, Pearson Education.

Pre requisite: Basic knowledge of object oriented methods, Software Engineering Concepts.

COURSE EDUCATIONAL OBJECTIVES:

 The main objective is the students become familiar with all phases of OOAD.
 Master the main features of the UML.
 Master the main concepts of Object Technologies and how to apply them at work and
develop the ability to analyze and solve challenging problem in various domains.
 Learn the Object design Principles and understand how to apply them towards
implementation.

COURSE OUTCOMES:
After the completion of the course, students should be able to:

6. Select the basic elements of modeling such as Things, Relationships and Diagrams depending
on the views of UML Architecture and SDLC.

7. Apply basic and Advanced Structural Modeling Concepts for designing real time applications.

8. Design Class and Object Diagrams that represent Static Aspects of a Software System.

9. Analyze Dynamic Aspects of a Software System using Use Case, Interaction and Activity
Diagrams.

10. Apply techniques of State Chart Diagrams and Implementation Diagrams to model behavioral
aspects and Runtime environment of Software Systems.
Detailed Lesson Plan

No. of Content delivery

S.NO DATE TOPIC TO BE COVERED Actual Date HOURS Methods

UNIT-I INTRODUCTION TO UML

1 22/06/15 Importance of Modelling 1 DM1

2 23/06/15 Principles of modelling 1 DM1

3 24/06/15 Object Oriented modelling 1 DM1

4 25/06/15 Conceptual model of the UML 1 DM1

5 26/06/15 Conceptual model of the UML 1 DM6

6 29/06/15 Conceptual model of the UML 1 DM6

7 30/06/15 UML Architecture 1 DM1

8 06/07/15 Software Development life cycle 1 DM6

9 07/07/15 Tutorial-I 1 DM2

10 08/07/15 Software Development life cycle 1 DM1

UNIT-II STRUCTURAL MODELLING

11 09/07/15 Basic Structural Modelling: Classes 1 DM1

12 10/07/15 Basic Structural Modelling: Classes 1 DM6

13 13/07/15 Relation ships 1 DM1

14 14/07/15 Common mechanisms 1 DM1

15 16/07/15 Common mechanisms 1 DM6

16 17/07/15 Common mechanisms 1 DM6

17 20/07/15 Diagrams 1 DM1

18 21/07/15 Tutorial-II DM2

19 22/07/15 Diagrams 1 DM6

20 23/07/15 Advanced Structural Modelling: Classes 1 DM2

21 24/07/15 Advanced Relation ships 1 DM1

22 27/07/15 Interfaces 1 DM6

23 28/07/15 Types and Roles 1 DM6

24 29/07/15 Packages DM1

25 31/08/15 Tutorial-III DM2

26 03/07/15 Review DM6

UNIT-III CLASSES & OBJECT DIAGRAMS

27 04/07/15 Terms & Concepts - Class diagrams 1 DM1

28 05/07/15 Modelling techniques for class diagrams 1 DM1

29 06/07/15 Modelling techniques for class diagrams 1 DM1

30 07/07/15

31 10/07/15

32 11/07/15 MID-I EXAMS

33 12/07/15

34 13/08/15

35 17/08/15 Terms & Concepts - Object diagrams 1 DM1

36 18/08/15 Modelling techniques for Object diagrams 1 DM6

37 19/08/15 Modelling techniques for Object diagrams 1 DM6

38 20/08/15 Tutorial-IV 1 DM2

UNIT-IV BASIC BEHAVIORAL MODELLING

39 24/08/15 Interactions 1 DM1

40 25/08/15 Interaction diagrams- Sequence 1 DM1

41 26/08/15 Interaction diagrams - Collaborations 1 DM1

42 27/08/15 Interaction diagrams –C M Techniques 1 DM6

43 28/08/15 Use cases 1 DM1

44 31/08/15 Use case Diagrams 1 DM1

45 01/09/15 Common modelling techniques 1 DM6

46 02/09/15 Activity diagrams 1 DM1

47 03/09/15 Common modelling techniques 1 DM6

48 04/09/15 Tutorial-V 1 DM2

49 07/09/15 Review DM6

50 08/09/15 Review DM6

UNIT-V

51 09/09/15 Advanced Behavioral Modelling 1 DM6

52 10/09/15 Events and Signals 1 DM1

53 11/09/15 Events and Signals 1 DM6

54 14/09/15 State machines 1 DM6

55 15/09/15 Processes and Threads 1 DM1

56 16/09/15 Time and Space 1 DM1

57 18/09/15 State Chart Diagrams 1 DM6

58 21/09/15 State Chart Diagrams 1 DM6

59 22/09/15 Tutorial-VI 1 DM2

60 23/09/15 Architectural Modelling 1 DM1

61 25/09/15 Components 1 DM1

62 28/09/15 Component Diagrams 1 DM6

63 29/09/15 Deployment 1 DM1

64 01/10/15 Deployment Diagrams 1 DM6

65 05/10/15 Tutorial-VII 1 DM2

66 06/10/15 Review 1 DM6

67 07/10/15 Review DM6

68 08/10/15 Review DM6

69 09/10/15 Review of Unit - IV DM6

70 12/10/15 Review of Unit - III DM6

71 13/10/15 Review of Unit - II DM6

72 14/10/15 Review of Unit - II DM6

73 15/10/15 Review of Unit - I DM6

74 26/10/15

75 27/10/15

76 29/10/15 MID – II EXAMS

77 30/10/15

78 31/10/15

TEXT BOOK :

2. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide,
Pearson Education.
REFERENCES :
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hil Companies.

NOTE: DELIVERY METHODS: DM1: Lecture interspersed with discussions/BB, DM2: Tutorial
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration (laboratory, field visit)
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, CO3, CO4, CO5, and sample proofs are enclosed
in Course file.

Signature

Name of the Faculty Name of Course HOD

Coordinator

D. VEERAIAH D. VEERAIAH Dr. N. RAVI SHANKAR

Course Educational objectives:

 Students will have an appreciation of the history and evolution of computer graphics, both
hardware and software. Assessed by written homework assignment.
 Students will have an understanding of 2D graphics and algorithms which includes line
drawing, polygon filling, clipping, and transformations.
 Students will understand the concepts of and techniques used in 3D computer graphics,
including viewing transformations, hierarchical modeling, color, lighting and texture
mapping.
 Students will be introduced to algorithms and techniques fundamental to 3D computer
graphics and will understand the relationship between the 2D and 3D versions of such
algorithms.

Course Outcomes:

This course will enable you to:

 Able to understand the graphics applications and various interactive input and output
devices.
 Able to understand and draw line, circle and ellipse using algorithms and functions to
implement graphic primitives
 Able to know different geometrical transformations in 2D
 Able to learn regarding 2D Coordinate transformation , viewing functions and
clipping algorithms
 Able to understand the 3D display methods , geometrical transformations and
coordinate transformations.

Pre requisite: Knowledge of Coordinate system in Mathematics.

S.N0 Tentative Topics to be covered Actual Num. Content
Date Date of Delivery
classes Methods
UNIT-1
1 22-6-15 Introduction 22 1 DM1
2 23-6-15 Algorithm 23 1 DM1/DM6
3 24-6-15 Design & analysis of Algorithms 24 1 DM1/DM6
4 25-6-15 Space Complexity 25 1 DM1/ DM6
5 27-6-15 Time complexity 26 1 DM1/ DM6
6 29-6-15 Asymptotic Notations 27 1 DM1/ DM6
7 30-6-15 Tutorial-1 1 1 DM2
8 1-7-15 Divide & Conquer General 29 1 DM1/DM6
method
9 2-7-15 Binary Search 30 1 DM1/DM6
10 4-7-15 Finding Maximun and Minimum 2 1 DM1/ DM6
11 6-7-15 Example 4 1 DM1
12 7-7-15 Merge sort 6 1 DM2
13 8-7-15 Example 8 1 DM1
14 9-7-15 Tutorial-2 9 1 DM2
UNIT-II
15 11-7-15 Greedy Method General method 11 1 DM1/ DM6
16 13-7-15 Knapsack problem 13 1 DM1/ DM6
17 14-7-15 Example 13
18 15-7-15 Tree Vertex Splitting 15 1 DM1/ DM6
19 16-7-15 Example 16
20 20-7-15 Job –Sequencing with deadlines 20 1 DM1/ DM6
21 21-7-15 Example 20 1 DM1
22 22-7-15 Tutorial-3 21 1 DM2
23 23-7-15 Minimum cost spanning tree- 25 1 DM1/ DM6
prims algorithm
24 25-7-15 Krushkals algorithm 27 1 DM1
25 27-7-15 Optimal Storage on Tapes 27 1 DM1/ DM6
26 28-7-15 Example 29
27 29-7-15 Optimal Merge Pattern 30 1 DM1
28 30-7-15 Example 1
29 1-8-15 Single source Shortest path 3 1 DM1
30 3-8-15 Example 4 1 DM1
Tutorial-4 5 1 DM2
UNIT – III
Dynamic Programming-General 1 DM1/ DM6
method
Multistage Graph 1 DM1/ DM6
All pairs Shortest path 1 DM1/ DM6
31 4-8-15 Example 1 DM1
32 5-8-15 Single source Shortest path 1 DM1/ DM6
33 6-8-15 Example 1 DM1
34 8-8-15 Optimal Binary Search Trees 1 DM1

35 18-8-15 Tutorial-5 1 DM2

36 19-8-15 String Editing 1 DM1
37 20-8-15 0/1 Knapsack 1 DM1
38 22-8-15 Reliabilty Design 1 DM1
39 24-8-15 Travelling Salesman Problem 1 DM1/ DM6
40 25-8-15 Example 1 DM1
41 26-8-15 Flow shop Scheduling 1 DM1/ DM6
42 27-8-15 Example 1 DM1
43 29-8-15 Tutorial-6 1 DM2
UNIT – IV
44 31-8-15 Techniques for Binary trees 1 DM1/ DM6
45 1-9-15 Techniques for Graphs 1 DM1/ DM6
46 2-9-15 Connected components 1 DM1/ DM6
47 3-9-15 Spanning Trees 1 DM1/ DM6
45 7-9-15 Bi-Connected Components 1 DM1
46 8-9-15 DFS 1 DM1
47 9-9-15 Tutorial-7 1 DM2
48 10-9-15 Back tracking –General method 1 DM1
49 12-9-15 The 8-Queens Problem 1 DM1
50 14-9-15 Sum of Subsets 1 DM1/ DM6
48 15-9-15 Graph Coloring 1 DM1
49 16-9-15 Hamiltonian cycle 1 DM1
50 17-9-15 Knapsack problem 1 DM1
51 19-9-15 Example 1 DM1
52 21-9-15 Tutorial-8 1 DM2
UNIT – V
53 22-9-15 Branch and Bound –method 1 DM1
54 23-9-15 0/1 Knapsack Problem 1 DM1/ DM6
55 26-9-15 Travelling Sales person 1 DM1/ DM6
56 28-9-15 Example 1 DM1
57 29-9-15 Efficiency Considerations 1 DM1/ DM6
58 30-9-15 Tutorial-9 1 DM2
59 1-10-15 NP hard and NP complete- Basic 1 DM1
concepts
60 3-10-15 Cook’s Theorem 1 DM1
61 5-10-15 NP-hard Graph Problems 1 DM1
62 6-10-15 NP –hard Scheduling Problem 1 DM1
63 7-10-15 Example 1 DM1
64 8-10-15 Some Simplified NP –hard 1 DM1/ DM6
Problems
65 10-10-15 Examples 1 DM1
66 12-10-15 Tutorial-10 1 DM2
67 13-10-15 Revision 1 DM1/ DM6
68 14-10-15 Revision 1 DM1/ DM6
69 15-10-15 Revision 1 DM1/ DM6
70 17-10-15 Revision 1 DM1/ DM6
TOTAL
Total number of classes required to complete the syllabus 66
Total number of classes available as per Schedule 70
NOTE: DELIVERY METHODS :DM1: Lecture interspersed with discussions/BB, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration ( laboratory, field visit ),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes:CO1,CO2,CO3,CO4,CO5 & sample proofs
are enclosed in Course file.

Signature
Name of the Faculty Name of Course Co-ordinator HOD
T.V. NAGARAJU T.V. NAGARAJU Dr.
Course Educational objectives:

 Students will have an appreciation of the history and evolution of computer graphics, both
hardware and software. Assessed by written homework assignment.
 Students will have an understanding of 2D graphics and algorithms which includes line
drawing, polygon filling, clipping, and transformations.
 Students will understand the concepts of and techniques used in 3D computer graphics,
including viewing transformations, hierarchical modeling, color, lighting and texture
mapping.
 Students will be introduced to algorithms and techniques fundamental to 3D computer
graphics and will understand the relationship between the 2D and 3D versions of such
algorithms.

Course Outcomes:

This course will enable you to:

 Able to understand the graphics applications and various interactive input and output
devices.
 Able to understand and draw line, circle and ellipse using algorithms and functions to
implement graphic primitives
 Able to know different geometrical transformations in 2D
 Able to learn regarding 2D Coordinate transformation , viewing functions and
clipping algorithms
 Able to understand the 3D display methods , geometrical transformations and
coordinate transformations.

Pre requisite: Knowledge of Coordinate system in Mathematics.

S.N0 Tentative Topics to be covered Actual Num. Content
Date Date of Delivery
classes Methods
UNIT-1
1 23-6-15 Introduction 1 DM1
2 24-6-15 Algorithm 1 DM1/DM6
3 25-6-15 Design & analysis of Algorithms 1 DM1/DM6
4 26-6-15 Space Complexity 1 DM1/ DM6
5 27-6-15 Time complexity 1 DM1/ DM6
6 30-6-15 Asymptotic Notations 1 DM1/ DM6
7 1-7-15 Tutorial-1 1 DM2
8 2-7-15 Divide & Conquer General 1 DM1/DM6
method
9 3-7-15 Binary Search 1 DM1/DM6
10 4-7-15 Finding Maximun and Minimum 1 DM1/ DM6
11 7-7-15 Example 1 DM1
12 8-7-15 Merge sort 1 DM2
13 9-7-15 Example 1 DM1
14 10-7-15 Tutorial-2 1 DM2
UNIT-II
15 11-7-15 Greedy Method General method 1 DM1/ DM6
16 14-7-15 Knapsack problem 1 DM1/ DM6
15-7-15 Example
17 16-7-15 Tree Vertex Splitting 1 DM1/ DM6
17-7-15 Example
18 21-7-15 Job –Sequencing with deadlines 1 DM1/ DM6
19 22-7-15 Example 1 DM1
20 23-7-15 Tutorial-3 1 DM2
21 24-7-15 Minimum cost spanning tree- 1 DM1/ DM6
prims algorithm
22 25-7-15 Krushkals algorithm 1 DM1
23 28-7-15 Optimal Storage on Tapes 1 DM1/ DM6
29-7-15 Example
24 30-7-15 Optimal Merge Pattern 1 DM1
25 31-7-15 Single source Shortest path 1 DM1
26 1-8-15 Example 1 DM1
27 4-8-15 Tutorial-4 1 DM2
UNIT – III
28 Dynamic Programming-General 1 DM1/ DM6
method
29 Multistage Graph 1 DM1/ DM6
30 All pairs Shortest path 1 DM1/ DM6
31 5-8-15 Example 1 DM1
32 6-8-15 Single source Shortest path 1 DM1/ DM6
33 7-8-15 Example 1 DM1
34 8-8-15 Optimal Binary Search Trees 1 DM1

35 18-8-15 Tutorial-5 1 DM2

36 19-8-15 String Editing 1 DM1
37 20-8-15 0/1 Knapsack 1 DM1
38 21-8-15 Reliabilty Design 1 DM1
39 22-8-15 Travelling Salesman Problem 1 DM1/ DM6
40 25-8-15 Example 1 DM1
41 26-8-15 Flow shop Scheduling 1 DM1/ DM6
42 27-8-15 Example 1 DM1
43 28-8-15 Tutorial-6 1 DM2
UNIT – IV
44 29-8-15 Techniques for Binary trees 1 DM1/ DM6
45 1-9-15 Techniques for Graphs 1 DM1/ DM6
46 2-9-15 Connected components 1 DM1/ DM6
47 3-9-15 Spanning Trees 1 DM1/ DM6
45 4-9-15 Bi-Connected Components 1 DM1
46 8-9-15 DFS 1 DM1
47 9-9-15 Tutorial-7 1 DM2
48 10-9-15 Back tracking –General method 1 DM1
49 11-9-15 The 8-Queens Problem 1 DM1
50 12-9-15 Sum of Subsets 1 DM1/ DM6
48 15-9-15 Graph Coloring 1 DM1
49 16-9-15 Hamiltonian cycle 1 DM1
50 17-9-15 Knapsack problem 1 DM1
51 18-9-15 Example 1 DM1
52 19-9-15 Tutorial-8 1 DM2
UNIT – V
53 22-9-15 Branch and Bound –method 1 DM1
54 23-9-15 0/1 Knapsack Problem 1 DM1/ DM6
55 25-9-15 Travelling Sales person 1 DM1/ DM6
56 26-9-15 Example 1 DM1
57 29-9-15 Efficiency Considerations 1 DM1/ DM6
58 30-9-15 Tutorial-9 1 DM2
59 1-10-15 NP hard and NP complete- Basic 1 DM1
concepts
60 3-10-15 Cook’s Theorem 1 DM1
61 6-10-15 NP-hard Graph Problems 1 DM1
62 7-10-15 NP –hard Scheduling Problem 1 DM1
63 8-10-15 Example 1 DM1
64 9-10-15 Some Simplified NP –hard 1 DM1/ DM6
Problems
65 10-10-15 Examples 1 DM1
66 13-10-15 Tutorial-10 1 DM2
67 14-10-15 Revision 1 DM1/ DM6
68 15-10-15 Revision 1 DM1/ DM6
69 16-10-15 Revision 1 DM1/ DM6
70 17-10-15 Revision 1 DM1/ DM6
TOTAL
Total number of classes required to complete the syllabus 66
Total number of classes available as per Schedule 70
NOTE: DELIVERY METHODS :DM1: Lecture interspersed with discussions/BB, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration ( laboratory, field visit ),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes:CO1,CO2,CO3,CO4,CO5 & sample proofs
are enclosed in Course file.

Signature
Name of the Faculty Name of Course Co-ordinator HOD
T.V. NAGARAJU T.V. NAGARAJU Dr.
 LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING (AUTONOMOUS)
L.B.REDDY NAGAR, MYLAVARAM, KRISHNA DIST., A.P.-521 230.
Approved by AICET, New Delhi. Accredited by NBA & Certified by ISO 9001:2008
http://www.lbrce.ac.in, [email protected], Phone: 08659-222933, Fax: 08659-222931
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Faculty Name: ,BVNR SIVA KUMAR, RH KISHAN LAB SCHEDULE
Date: 26-06-2015.
B.Tech(v-sem-cse) A-SECTION
I Batch(SAT) II BATCH ( FRI )
UNIT DESCRIPTION
CYCLE Performed Perform ed S
Introduction to 8086 Kits &
Planned Planned
Debug
CYCLE Programs on Data Transfer &
26/06/15 27/06/15
Exchange
CYCLE Programs on ADD,ADC. 03/07/15 04/07/15

CYCLE
Programs on MUL & DIV 10/07/15 11/07/15

CYCLE Programs on Sorting 17/07/15

CYCLE
Programs on code Conversion 24/07/15 25/07/15

CYCLE Programs on String 31/07/15 01/08/15

CYCLE Programs on Subroutines,

07/08/15 21/08/15
MASM
CYCLE DAC Interfacing- Generation of
28/08/15 22/08/15
Waveforms
CYCLE ADC Interfacing 04/09/15 29/08/15

CYCLE
Stepper Motor Interfacing 11/09/15 12/09/15

CYCLE Key Board Interfacing 18/09/15 19/09/15

CYCLE
Display Interfacing 25/09/15 26/09/15

CYCLE
8051 Program - Program & IO 03/10/15

CYCLE
INTERNAL EXAM 09/10/15 10/10/15
 LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING (AUTONOMOUS)
L.B.REDDY NAGAR, MYLAVARAM, KRISHNA DIST., A.P.-521 230.
Approved by AICET, New Delhi. Accredited by NBA & Certified by ISO 9001:2008
http://www.lbrce.ac.in, [email protected], Phone: 08659-222933, Fax: 08659-222931
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Faculty Name: ,BVNR SIVA KUMAR, RH KISHAN LAB SCHEDULE
Date: 26-06-2015.
B.Tech(v-sem-cse) B-SECTION
I Batch(MON) II BATCH ( WED )
UNIT DESCRIPTION
PLANED PERFORMD PLANED PERFORMD
S
CYCLE Introduction to 8086 Kits &
07/09/15 02/09/15
Debug
CYCLE Programs on Data Transfer &
14/09/15 09/09/15
Exchange
CYCLE Programs on ADD,ADC. 14/09/15 16/09/15

CYCLE
Programs on MUL & DIV 21/09/15 23/09/15

CYCLE Programs on Sorting 28/09/15 30/09/15

CYCLE
Programs on code Conversion 05/10/15 07/10/15

CYCLE 12/10/15
Programs on String 14/10/15

CYCLE Programs on Subroutines, 19/10/15

21/10/15
MASM
CYCLE DAC Interfacing- Generation of 26/10/15
28/10/15
Waveforms
CYCLE 02/11/15 04/11/15
ADC Interfacing

CYCLE 09/11/15 11/11/15

Stepper Motor Interfacing

CYCLE 16/11/15 18/11/15

Key Board Interfacing

CYCLE 16/11/15 25/11/15

Display Interfacing

CYCLE 23/11/15 25/11/15

8051 Program - Program & IO

CYCLE 23/11/15 28/10/15

INTERNAL EXAM
 LESSON PLAN
ACADEMIC YEAR : 2015-16 COURSE: B.Tech (V-Sem)- Section
A
BRANCH : Computer Science Engineering FACULTY : BVNR SIVA KUMAR
SUBJECT : MICROPROCESSORS AND INTERFACING

Teaching
S.No. DATE TOPIC DATE Methodology

1 22/06/15 Introduction - Microprocessor & Hexadecimal system

2 23/06/15 Architecture - Registers

3 25/06/15 Memory Segmentation, Registers usage

4 26/06/15 Instruction Format, Addressing Mode

5 27/06/15 MOV, XCHG instructions, Programs

6 29/06/15 Addressing Modes

7 30/06/15 Addressing Modes (Contd.)

8 02/07/15 Data Transfer Group, Programs

9 03/07/15 Flag Register

10 04/07/15 Data Transfer Group, Programs

11 06/07/15 ADD & ADC instructions

12 07/07/15 Arithmetic Group, programs

13 09/07/15 Arithmetic Group, programs

14 10/07/15 Tutorial - 1

15 11/07/15 Arithmetic Group, programs

16 13/07/15 Logical Group, Programs

17 14/07/15 Logical Group, Programs

18 16/07/15 String instructions, Programs

19 17/07/15 Tutorial - 2

20 18/07/15 Branching group, Programs

21 20/07/15 Branching group, Programs

22 21/07/15 Control group, Programs

23 23/07/15 8086pin configuration

24 24/07/15 Tutorial - 3

25 25/07/15 Memory interfacing

26 27/07/15 Odd & Even Banks

27 28/07/15 Timing diagram

28 30/07/15 8086 Pin Configuration

29 31/07/15 I/O interfacing

30 01/08/15 DMA Data Transfer

31 03/08/15 8237 Block Diagram & Interfacing

32 04/08/15 8086 Maximum Mode

33 06/08/15 Tutorial - 5

34 07/08/15 I Mid Paper Discussion

35 08/08/15 8255 PPI – Pin Configuration

36 01/08/15 8255 PPI - Mode 0, Programs

37 03/08/15 DAC Interfacing, Programs

38 04/08/15 Sine wave Generation

 LESSON PLAN
ACADEMIC YEAR : 2015-16 COURSE: B.Tech (VI-Sem)- Section A
BRANCH : Electronics and Communication Engineering FACULTY : BVNR SIVA KUMAR
SUBJECT : MICROPROCESSORS AND INTERFACING
S.No. DATE 1 TOPIC DATE 2 REMARKS

39 06/08/15 Stepper motors & Actuators

40 07/08/15 Tutorial - 6

41 08/08/15 Modes 1&2, ADC Interfacing

42 18/08/15 Display interfacing

43 20/08/15 Key Board interfacing

44 21/08/15 8279 Block diagram

45 22/08/15 Interrupts, IVT

46 24/08/15 Interrupt Response, DOS Interrupts

47 25/08/15 Tutorial - 7
48 27/08/15 PIC 8259, Modes
49 28/08/15 Interfacing & Cascading
50 29/08/15 Serial data Transfer
51 31/08/15 8251 Architecture
52 01/09/15 Tutorial - 8
53 03/09/15 8251 Interfacing
54 04/09/15 Data Transfer programs,
55 05/09/15 USB
55 07/09/15 Tutorial - 9
56 08/09/15 8051 family specifications
57 10/09/15 Architecture
58 11/09/15 Pin configuration & Interfacing
59 12/09/15 Tutorial - 10
60 14/09/15 Timer operation
61 15/09/15 Timer modes
62 17/09/15 Serial Port
63 18/09/15 Interrupt structure
64 19/09/15 Tutorial - 11 .
65 21/09/15 80286 Specifications
66 22/09/15 80386 Specifications
67 24/09/15 Real & Protected mode
68 25/09/15 Features
69 26/09/15 Memory, Paging
70 28/09/15 Tutorial - 12
71 29/09/15 Pentium features,
72 01/10/15 Branch Prediction

Signature of Faculty Signature of HOD

 LESSON PLAN
ACADEMIC YEAR : 2015-16 COURSE: B.Tech (V-Sem)- Section B
BRANCH : Computer Science Engineering FACULTY : BVNR SIVA KUMAR
SUBJECT : MICROPROCESSORS AND INTERFACING
Teaching
S.No. DATE TOPIC DATE Methodology
1 22/06/15 Introduction - Microprocessor & Hexadecimal system
2 23/06/15 Architecture - Registers

3 25/06/15 Memory Segmentation, Registers usage

4 26/06/15 Instruction Format, Addressing Mode

5 27/06/15 MOV, XCHG instructions, Programs

6 29/06/15 Addressing Modes

7 30/06/15 Addressing Modes (Contd.)

8 02/07/15 Data Transfer Group, Programs

9 03/07/15 Flag Register

10 04/07/15 Data Transfer Group, Programs

11 06/07/15 ADD & ADC instructions

12 07/07/15 Arithmetic Group, programs

13 09/07/15 Arithmetic Group, programs

14 10/07/15 Tutorial - 1

15 11/07/15 Arithmetic Group, programs

16 13/07/15 Logical Group, Programs

17 14/07/15 Logical Group, Programs

18 16/07/15 String instructions, Programs

19 17/07/15 Tutorial - 2

20 18/07/15 Branching group, Programs

21 20/07/15 Branching group, Programs

22 21/07/15 Control group, Programs

23 23/07/15 8086pin configuration

24 24/07/15 Tutorial - 3

25 25/07/15 Memory interfacing

26 27/07/15 Odd & Even Banks

27 28/07/15 Timing diagram

28 30/07/15 8086 Pin Configuration

29 31/07/15 I/O interfacing

30 01/08/15 DMA Data Transfer

31 03/08/15 8237 Block Diagram & Interfacing

32 04/08/15 8086 Maximum Mode

33 06/08/15 Tutorial - 5

34 07/08/15 I Mid Paper Discussion

35 08/08/15 8255 PPI – Pin Configuration

36 01/08/15 8255 PPI - Mode 0, Programs

37 03/08/15 DAC Interfacing, Programs

38 04/08/15 Sine wave Generation

 LESSON PLAN
ACADEMIC YEAR : 2015-16 COURSE: B.Tech (VI-Sem)- Section
B
BRANCH : Electronics and Communication Engineering FACULTY : BVNR SIVA KUMAR
SUBJECT : MICROPROCESSORS AND INTERFACING
S.No. DATE 1 TOPIC DATE 2 REMARKS

39 06/08/15 Stepper motors & Actuators

40 07/08/15 Tutorial - 6

41 08/08/15 Modes 1&2, ADC Interfacing

42 18/08/15 Display interfacing

43 20/08/15 Key Board interfacing

44 21/08/15 8279 Block diagram

45 22/08/15 Interrupts, IVT

46 24/08/15 Interrupt Response, DOS Interrupts

47 25/08/15 Tutorial - 7
48 27/08/15 PIC 8259, Modes
49 28/08/15 Interfacing & Cascading
50 29/08/15 Serial data Transfer
51 31/08/15 8251 Architecture
52 01/09/15 Tutorial - 8
53 03/09/15 8251 Interfacing
54 04/09/15 Data Transfer programs,
55 05/09/15 USB
55 07/09/15 Tutorial - 9
56 08/09/15 8051 family specifications
57 10/09/15 Architecture
58 11/09/15 Pin configuration & Interfacing
59 12/09/15 Tutorial - 10
60 14/09/15 Timer operation
61 15/09/15 Timer modes
62 17/09/15 Serial Port
63 18/09/15 Interrupt structure
64 19/09/15 Tutorial - 11 .
65 21/09/15 80286 Specifications
66 22/09/15 80386 Specifications
67 24/09/15 Real & Protected mode
68 25/09/15 Features
69 26/09/15 Memory, Paging
70 28/09/15 Tutorial - 12
71 29/09/15 Pentium features,
72 01/10/15 Branch Prediction
 Signature of Faculty Signature of HOD

Date:
LESSON PLAN 22/06/2015

Sub. Name : Principles of Programming Languages To 31/10/2015

Branch: CSE, Semester & Sections: V & A

T284 – Principles of Programming Languages

Lecture : 4 Periods/week Internal Marks : 25
Tutorial : 1 External Marks : 75
Credits : 4 External Examination : 3 Hrs
------------------------------------------------------------------------------------------------------
---------

UNIT - I

Preliminary Concepts: The reasons for studying the concepts of programming languages,
programming domains, Language evaluation criteria, influences on language design, Language
categories, Programming Paradigms -- Imperative, Object Oriented, Functional programming, Logic
Programming. Programming language implementation – Compilation and Virtual Machines,
Programming environments

UNIT - II

Syntax and Semantics: general Problem of describing Syntax and Semantics, formal methods of
describing syntax - BNF, EBNF for common programming languages features, parse trees, ambiguous
grammars, attribute grammars, denotational semantics and axiomatic semantics for common
programming language features.

UNIT - III

Data types: Introduction, primitive, character, user defined, array, associative, record, union, pointer
and reference types, design and implementation uses related to these types. Names, Variable,
concept of binding, type checking, strong typing, type compatibility, named constants, variable
initialization. Abstract DataTypes: Abstractions and encapsulation, introductions to data abstractions,
design issues, language examples, C++ parameterized ADT, object oriented programming in small talk,
C++, Java, C#, Ada 95

UNIT - IV

Expressions and Statements: Arithmetic relational and Boolean expressions, Short circuit evaluation
mixed mode assignment, Assignment Statements, Control Structures – Statement Level, Compound
Statements, Selection, Iteration, Unconditional Statements, guarded commands.

UNIT - V

Subprograms and Blocks: Fundamentals of sub-programs, Scope and lifetime of variable, static and
dynamic scope, Design issues of subprograms and operations, local refe rencing environments,
parameter passing methods, overloaded sub-programs, generic sub-programs, parameters that are
sub-program names, design issues for functions user defined overloaded operators, co routines.
Concurrency: Subprogram level concurrency, semaphores, monitors, massage passing, Java threads,
C# threads.

TEXT BOOK

1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson Education.

REFERENCES

1. Programming languages –Ghezzi, 3/e, John Wiley

2. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth
Edition PHI/Pearson Education
3. Programming languages –Watt, Wiley Dreamtech

Pre requisite: Knowledge of various Programming Languages like C, C++

Course Objectives:

To impart the in depth knowledge of

 1. Compare programming languages;
2. Principles of programming languages design; specification of syntax and semantics
3. Describe the main principles of imperative, functional, object oriented and
logic oriented programming languages;
4. Recite the high points of programming language history; and
5. Read the central formalisms used in the description of programming
languages.
6. Assess programming languages critically and in a scientific manner;

Course Outcomes:

CO1: Master using syntax‐related concepts including context‐free grammars, parse trees, recursive‐
descent parsing, printing, and interpretation.

CO2: Master analyzing semantic issues associated with function implementations, including variable
binding, scoping rules, parameter passing, and exception handling.

CO3: Master implementation techniques for interpreted functional languages.

CO4: Master using object‐oriented languages.

CO5: Be familiar with design issues of object‐oriented and functional languages.

CO6: Be familiar with language abstraction constructs of classes, interfaces, packages, and
procedures.

CO7: Be familiar with implementation of object‐oriented languages.

CO8: Be familiar with using functional languages

CO9: Be exposed to using logic languages.

Detailed Lesson Plan

No. of Content delivery

S.NO DATE TOPIC TO BE COVERED Actual Date
HOURS Methods

UNIT-I PRELIMINARY CONCEPTS

Introduction Reasons for studying concepts

1 22/06/15 3 DM1
of programming languages.

2 25/06/15 Programming domains. 1 DM1

3 27/06/15 Language Evaluation Criteria 1 DM1

4 29/06/15 Influences on language design 1 DM1

5 30/06/15 Language categories 1 DM6

Programming Paradigms -- Imperative,

6 01/07/15 1 DM6
Object Oriented

Functional programming, Logic

7 02/07/15 1 DM1
Programming.

Programming language implementation –

8 04/07/15 1 DM6
Compilation and Virtual Machines

9 06/07/15 Programming environments 1 DM1

10 07/07/15 Tutorial-I 1 DM2

UNIT-II SYNTAX AND SEMANTICS

General Problem of describing Syntax and

11 08/07/15 1 DM1
Semantics

12 09/07/15 BNF 1 DM6

13 13/07/15 Parse trees 1 DM1

14 14/07/15 Ambiguous grammars 1 DM1

15 15/07/15 Operator Precedence 1 DM6

16 16/07/15 Associativity 1 DM6

17 20/07/15 EBNF 1 DM1

18 21/07/15 Tutorial-II 1 DM2

19 22/07/15 Attribute grammars 1 DM6

20 23/07/15 Operational 1 DM2

Operational, Denotation semantics and

21 25/07/15 axiomatic semantics for common 1 DM1
programming language features.
 Operational, Denotation semantics and
22 27/07/15 axiomatic semantics for common 1
programming language features.

Operational, Denotation semantics and

23 28/07/15 axiomatic semantics for common 1
programming language features.

24 29/07/15 Tutorial-III 1 DM2

25 30/07/15 Review 1 DM6

UNIT-III DATA TYPES

26 01/08/15 Data types: Introduction 1 DM1

27 03/08/15 Primitive, character 1 DM1

28 04/08/15 User defined 1 DM6

31 05/08/15 Array Types 1 DM1

32 06/08/15 Array Types 1 DM1

33 10/08/15

34 11/08/15

35 12/08/15 MID-I EXAMS

36 13/08/15

37 17/08/15

38 18/08/15 Associative Arrays 1 DM1

39 Record Types

40 19/08/15 Union Types 1 DM6

41 20/08/15 Pointer and reference types 1 DM6

Design and implementation uses related to

42 22/08/15 1 DM1
above types.

Design and implementation uses related to

43 24/08/15 1 DM1
above types.

44 25/08/15 Names, Variable, concept of binding 1 DM1

Type checking, strong typing, type

45 26/08/15 1 DM1
compatibility

46 27/08/15 Named constants, variable initialization. 1 DM6

 29/08/15 Tutorial-III 1 DM2

47 31/08/15 Review 1 DM1

Abstract Data Types: Abstractions and

48 01/09/15 encapsulation, introductions to data 1 DM6
abstractions

49 02/09/15 Design issues 1 DM1

50 03/09/15 language examples 1 DM6

51 05/09/15 C++ parameterized ADT 1 DM1

Object oriented programming in small talk,

52 07/09/15 DM6
C++, Java, C#, Ada 95

Object oriented programming in small talk,

53 08/09/15 DM6
C++, Java, C#, Ada 95

Object oriented programming in small talk,

54 09/09/15 1 DM6
C++, Java, C#, Ada 95

10/09/15 Tutorial-IV 1 DM2

55 14/09/15 Tutorial-V 1 DM2

56 15/09/15 Review 1 DM6

UNIT IV EXPRESSIONS AND STATEMENTS

57 16/09/15 Arithmetic expressions 1 DM1

58 17/09/15 Arithmetic expressions 1 DM1

59 21/09/15 Overloaded Operators, Type Conversion 1 DM6

Relational and Boolean expressions, Short

60 22/09/15 1 DM6
circuit evaluation

Assignment Statements, Mixed mode

61 23/09/15 1 DM1
assignment

Statement Level Control Statements:

62 24/09/15 1 DM1
Selection Statements

Statement Level Control Statements:

26/09/15 Iteration Statements, Unconditional 1 DM1
Statements, guarded commands.

63 28/09/15 Tutorial-VI 1 DM2

64 29/09/15 Review 1 DM1

UNIT-V Subprograms and Blocks

 Fundamentals of sub-programsScope and
65 30/09/15 lifetime of variable, static and dynamic 1 DM6
Scope

Design issues of subprograms and

66 01/10/15 1 DM6
operations, local referencing environments

Parameter passing methods, Parameters

67 03/10/15 1 DM6
that are sub-program names.

Overloaded sub-programs, generic sub-

68 05/10/15 programs, Design issues for functions, User 1 DM6
defined overloaded operators, co routines

69 06/10/15 Concurrency: Subprogram level concurrency 1 DM6

70 07/10/15 Semaphores, Monitors 1 DM6

71 08/10/15 Massage passing 1 DM6

72 10/10/15 Java threads and C# threads 1 DM6

73 12/10/15 Review of Unit – V 1 DM6

74 13/10/15 Review of Unit – IV 1 DM6

75 14/10/15 Review of Unit – III 1

76 15/10/15 Review of Unit – II 1

77 17/10/15 Review of Unit – I 1

78 26/10/15

79 27/10/15

80 28/10/15 MID – II EXAMS

81 29/10/15

82 31/10/15

TEXT BOOK :

1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson Education.

REFERENCES :

1. Programming languages –Ghezzi, 3/e, John Wiley

2. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth Edition
PHI/Pearson Education
3. Programming languages –Watt, Wiley Dreamtech
NOTE: DELIVERY METHODS:

DM1: Lecture interspersed with discussions/BB,

DM2: Tutorial,
DM3: Lecture with a quiz,

DM4: Assignment/Test,

DM5: Demonstration (laboratory, field visit),

DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, CO3, CO4, CO5&CO6, and sample proofs are
enclosed in Course file.

Signature

Name of the Faculty Name of Course coordinator HOD

T UDAYA KUMAR
 Date:
LESSON PLAN
22/06/2015

Sub. Name : Principles of Programming Languages To 31/10/2015

Branch: CSE, Semester & Sections: V & B

T284 – Principles of Programming Languages

Lecture : 4 Periods/week Internal Marks : 25
Tutorial : 1 External Marks : 75
Credits : 4 External Examination : 3 Hrs
------------------------------------------------------------------------------------------------------
---------

UNIT - I

Preliminary Concepts: The reasons for studying the concepts of programming languages,
programming domains, Language evaluation criteria, influences on language design, Language
categories, Programming Paradigms -- Imperative, Object Oriented, Functional programming, Logic
Programming. Programming language implementation – Compilation and Virtual Machines,
Programming environments

UNIT - II

Syntax and Semantics: general Problem of describing Syntax and Semantics, formal methods of
describing syntax - BNF, EBNF for common programming languages features, parse trees, ambiguous
grammars, attribute grammars, denotational semantics and axiomatic semantics for common
programming language features.

UNIT - III

Data types: Introduction, primitive, character, user defined, array, associative, record, union, pointer
and reference types, design and implementation uses related to these types. Names, Variable,
concept of binding, type checking, strong typing, type compatibility, named constants, variable
initialization. Abstract DataTypes: Abstractions and encapsulation, introductions to data abstractions,
design issues, language examples, C++ parameterized ADT, object oriented programming in small talk,
C++, Java, C#, Ada 95
UNIT - IV

Expressions and Statements: Arithmetic relational and Boolean expressions, Short circuit evaluation
mixed mode assignment, Assignment Statements, Control Structures – Statement Level, Compound
Statements, Selection, Iteration, Unconditional Statements, guarded commands.

UNIT - V

Subprograms and Blocks: Fundamentals of sub-programs, Scope and lifetime of variable, static and
dynamic scope, Design issues of subprograms and operations, local referencing environments,
parameter passing methods, overloaded sub-programs, generic sub-programs, parameters that are
sub-program names, design issues for functions user defined overloaded operators, co routines.
Concurrency: Subprogram level concurrency, semaphores, monitors, massage passing, Java threads,
C# threads.

TEXT BOOK

1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson Education.

REFERENCES

4. Programming languages –Ghezzi, 3/e, John Wiley

5. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth
Edition PHI/Pearson Education
6. Programming languages –Watt, Wiley Dreamtech

Pre requisite: Knowledge of various Programming Languages like C, C++

Course Objectives:

To impart the in depth knowledge of

7. Compare programming languages;

8. Principles of programming languages design; specification of syntax and semantics
9. Describe the main principles of imperative, functional, object oriented and
logic oriented programming languages;
10. Recite the high points of programming language history; and
 11. Read the central formalisms used in the description of programming
languages.
12. Assess programming languages critically and in a scientific manner;

Course Outcomes:

CO1: Master using syntax‐related concepts including context‐free grammars, parse trees, recursive‐
descent parsing, printing, and interpretation.

CO2: Master analyzing semantic issues associated with function implementations, including variable
binding, scoping rules, parameter passing, and exception handling.

CO3: Master implementation techniques for interpreted functional languages.

CO4: Master using object‐oriented languages.

CO5: Be familiar with design issues of object‐oriented and functional languages.

CO6: Be familiar with language abstraction constructs of classes, interfaces, packages, and
procedures.

CO7: Be familiar with implementation of object‐oriented languages.

CO8: Be familiar with using functional languages

CO9: Be exposed to using logic languages.

Detailed Lesson Plan

No. of Content delivery

S.NO DATE TOPIC TO BE COVERED Actual Date
HOURS Methods

UNIT-I PRELIMINARY CONCEPTS

Introduction Reasons for studying concepts

1 3 DM1
22/06/15 of programming languages.

2 23/06/15 Programming domains. 1 DM1

3 25/06/15 Language Evaluation Criteria 1 DM1

4 26/06/15 Influences on language design 1 DM1

5 27/06/15 Language categories 1 DM6

Programming Paradigms -- Imperative,

6 1 DM6
29/06/15 Object Oriented

Functional programming, Logic

7 1 DM1
30/06/15 Programming.

Programming language implementation –

8 1 DM6
06/07/15 Compilation and Virtual Machines

9 07/07/15 Programming environments 1 DM1

10 09/07/15 Tutorial-I 1 DM2

UNIT-II SYNTAX AND SEMANTICS

General Problem of describing Syntax and

11 1 DM1
10/07/15 Semantics

12 13/07/15 BNF 1 DM6

13 14/07/15 Parse trees 1 DM1

14 16/07/15 Ambiguous grammars 1 DM1

15 17/07/15 Operator Precedence 1 DM6

16 20/07/15 Associativity 1 DM6

17 21/07/15 EBNF 1 DM1

18 23/07/15 Tutorial-II 1 DM2

19 24/07/15 Attribute grammars 1 DM6

20 25/07/15 Operational 1 DM2

Operational, Denotation semantics and

21 axiomatic semantics for common 1 DM1
27/07/15 programming language features.
 Operational, Denotation semantics and
22 axiomatic semantics for common 1
28/07/15 programming language features.

Operational, Denotation semantics and

23 axiomatic semantics for common 1
30/07/15 programming language features.

24 31/07/15 Tutorial-III 1 DM2

25 01/08/15 Review 1 DM6

UNIT-III DATA TYPES

26 03/07/15 Data types: Introduction 1 DM1

27 04/07/15 Primitive, character 1 DM1

28 06/07/15 User defined 1 DM6

07/07/15 Array Types 1 DM1

10/07/15

31 11/07/15

32 13/07/15 MID-I EXAMS

33 14/07/15

34 17/08/15

35 18/08/15 Array Types 1 DM1

36 20/08/15 Associative Arrays 1 DM1

37 21/08/15 Record Types

38 22/08/15 Union Types 1 DM6

39 24/08/15 Pointer and reference types 1 DM6

Design and implementation uses related to

40 1 DM1
25/08/15 above types.

Design and implementation uses related to

41 1 DM1
27/08/15 above types.

42 28/08/15 Names, Variable, concept of binding 1 DM1

Type checking, strong typing, type

43 1 DM1
29/08/15 compatibility

44 31/08/15 Named constants, variable initialization. 1 DM6

45 01/09/15 Tutorial-III 1 DM2

46 03/09/15 Review 1 DM1

Abstract Data Types: Abstractions and

encapsulation, introductions to data 1 DM6
abstractions

47 04/09/15 Design issues 1 DM1

48 05/09/15 language examples 1 DM6

49 07/09/15 C++ parameterized ADT 1 DM1

Object oriented programming in small talk,

50 DM6
08/09/15 C++, Java, C#, Ada 95

Object oriented programming in small talk,

51 DM6
10/09/15 C++, Java, C#, Ada 95

Object oriented programming in small talk,

52 1 DM6
11/09/15 C++, Java, C#, Ada 95

53 14/09/15 Tutorial-IV 1 DM2

54 15/09/15 Tutorial-V 1 DM2

55 18/09/15 Review 1 DM6

UNIT-V

56 19/09/15 Arithmetic expressions 1 DM1

57 21/09/15 Arithmetic expressions 1 DM1

58 22/09/15 Overloaded Operators, Type Conversion 1 DM6

Relational and Boolean expressions, Short

59 1 DM6
25/09/15 circuit evaluation

Assignment Statements, Mixed mode

60 1 DM1
26/09/15 assignment

Statement Level Control Statements:

61 1 DM1
28/09/15 Selection Statements

Statement Level Control Statements:

62 Iteration Statements, Unconditional 1 DM1
29/09/15 Statements, guarded commands.

63 01/10/15 Tutorial-VI 1 DM2

64 03/10/15 Review 1 DM1

UNIT-V Subprograms and Blocks

 Fundamentals of sub-programsScope and
65 lifetime of variable, static and dynamic 1 DM6
05/10/15 Scope

Design issues of subprograms and

66 1 DM6
06/10/15 operations, local referencing environments

Parameter passing methods, Parameters

67 1 DM6
08/10/15 that are sub-program names.

Overloaded sub-programs, generic sub-

68 programs, Design issues for functions, User 1 DM6
09/10/15 defined overloaded operators, co routines

69 12/10/15 Concurrency: Subprogram level concurrency 1 DM6

70 13/10/15 Semaphores, Monitors , Massage passing 1 DM6

71 15/10/15 Java threads and C# threads 1 DM6

72 16/10/15 Review of Unit – V AND IV 1 DM6

73 17/10/15 Review of Unit – III, II AND I 1 DM6

74 26/10/15

75 27/10/15

76 28/10/15 MID – II EXAMS

77 29/10/15

78 31/10/15

TEXT BOOK :

1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson Education.

REFERENCES :

4. Programming languages –Ghezzi, 3/e, John Wiley

5. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth Edition
PHI/Pearson Education
6. Programming languages –Watt, Wiley Dreamtech

NOTE: DELIVERY METHODS:

DM1: Lecture interspersed with discussions/BB,

DM2: Tutorial,
DM3: Lecture with a quiz,

DM4: Assignment/Test,
DM5: Demonstration (laboratory, field visit),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes: CO1, CO2, CO3, CO4, CO5&CO6, and sample proofs are
enclosed in Course file.

Signature

Name of the Faculty Name of Course coordinator HOD

T UDAYA KUMAR
Name of the Faculty: K.NAGA PRASANTHI Semester:1 2015-16

Course Title: SOFTWARE TESTING METHODOLOGIES Dt:22-06-15

S.No. Tentative Topics to be covered Actual No.of Teaching

date date classes methodology
1 1. Purpose of Testing 1
1.1. What We Do
22.06.2015 1.2. Productivity and Quality BB
in Software
1.3. Goals for Testing
2 1.4. Phases in a Tester’s 2
23.06.2015 Mental Life
& 1.5. Test Design
BB
24.06.2015 1.6. Testing Isn’t Everything
1.7. The Pesticide Paradox
and the Complexity Barrier
3 2. SOME DICHOTOMIES 2
25.06.2015 2.1. Testing Versus Debugging
& 2.2. Function Versus Structure BB
26.06.2015 2.3. The Designer Versus the
Tester
4 2.4. Modularity Versus. 1
Efficiency
29.06.2015 2.5. Small Versus Large BB
2.6. The Builder Versus the
Buyer
5 3. A MODEL FOR TESTING 1
3.1. The Project
30.06.2015 3.2. Overview BB
3.3. The Environment
3.4. The Program
6 3.5. Bugs 1 BB
1.07.2015
3.6. Tests
7 3.7. Testing and Levels 1 BB
2.07.2015
3.8. The Role of Models
8 4. A TAXONOMY OF BUGS 1
4.1. General
3.07.2015 BB
4.2. Requirements, Features,
and Functionality Bugs
9 6.07.2015 4.3. Structural Bugs 1 BB
10 4.4. Data Bugs 1
7.07.2015 BB
4.5. Coding Bugs
11 4.6. Interface, Integration, 1
8.07.2015 and System Bugs BB
4.7. Test and Test Design Bugs
12 9.07.2015 Tutorial OR Test 1 BB/LCD
13 Flow Graphs and Path testing 1
1. Predicates, Path Predicates
13.07.2015 BB
1.1. General
1.2. Predicates.
14 1.3. Predicate Expressions 1
14.07.2015 1.4. Predicate Coverage BB
1.5. Testing Blindness
15 2. Path–Testing Basics 1 BB
15.07.2015
 2.1. Motivation and
Assumptions
2.2. Control Flow graphs
16 16.07.2015 2.3. Path Testing 1 BB
17 2.4. Loops 1
17.07.2015 2.5. More on Testing Multi – BB
Entry/Multi–Exit Routines
18 2.6. Effectiveness of Path 1
20.07.2015 Testing BB
2.7. Variations
19 3. Path Sensitizing 1
3.1. Review; Achievable and
BB
21.07.2015 Unachievable Paths.
3.2. Pragmatic Observations
20 3.3. Heuristic Procedures for 1
22.07.2015 Sensitizing Paths BB
3.4. Examples
21 4. Path Instrumentation 1
23.07.2015 4.1. The Problem
BB
4.2. General Strategy
4.3. Link Markers
22 4.4. Link Counters 1
24.07.2015 4.5. Other Instrumentation
BB
Methods.
4.6. Implementation
23 5. Application Of Path Testing 2
5.1. Integration, Coverage,
27.07.2015 and Paths in Called
& Components
28.07.15 5.2. New Code
5.3. Maintenance BB
5.4. Rehosting

6.TRANSACTION-FLOW TESTING
Transaction Flows
6.1. Definitions
6.2. Example
6.3. Usage
25 6.4. Implementation 1
29.07.2015
6.5. Perspective
26 6.6. Complications 1
30.07.2015
6.7. Transaction-Flow BB
Structure
27 7. Transaction-Flow Testing 1
Techniques
31.07.2015 7.1. Get the Transaction Flows BB
7.2. Inspections, Reviews,
Walkthroughs
28 7.3. Path Selection 1 BB
3.08.2015
7.4. Sensitization
29 7.5. Instrumentation 1
4.08.2015 7.6. Test Databases BB
7.7. Execution
30 DATA-FLOW TESTING 1
5.08.2015 8. DATA-FLOW TESTING BB
BASICS
 8.1. Motivation and
Assumptions
31 8.2. Date Flow-graphs 1 BB
6.08.2015
8.3. The Data-Flow Model
32 9. DATA-FLOW TESTING 1
STRATEGIES
7.08.2015 BB
9.1. General
9.2. Terminology
33 8.08.2015
9.3. The Strategies 1
9.4. Slicing, Dicing, Data Flow, BB
and Debugging
34 Tutorial\Exam\Topics beyond 1
8.08.2015 BB/LCD
Syllabus
35 DOMAIN TESTING 1
1. DOMAINS AND PATHS
18.08.2015 1.1. The Model
BB
1.2. A Domain Is a Set
1.3. Domains, Paths, and
Predicates
36 1.4. Domain Closure 2
19.08.2015
1.5. Domain Dimensionality
& BB
1.6. The Bug Assumptions
20.08.2015
1.7. Restrictions
37 2. NICE DOMAINS AND UGLY 1
DOMAINS
2.1. Where Do Domains Come
21.08.2015 BB
From?
2.2. Specified Versus
Implemented Domains
38 2.3. Nice Domains 1
2.4. Ugly Domains and How
Programmers and Testers
Treat Them
24.08.2015 BB
3. DOMAIN TESTING
3.1. Overview
3.2. Domain Bugs and How to
Test
39 3.3. Procedure 1
25.08.2015 3.4. Variations, Tools, BB
Effectiveness
40 4. DOMAINS AND INTERFACE 2
26.08.2015 TESTING
& 4.1. General BB
27.08.2015 4.2. Domains and Range
4.3. Closure Compatibility
41 4.4. Span Compatibility 2
28.08.2015
4.5. Interface Range/Domain
& BB
Compatibility Testing
31.08.2015
4.6. Finding the Values
42 5. DOMAINS AND TESTABILITY 2
1.09.2015
5.1. General
& BB
5.2. Linearizing
2.09.2015
Transformations
43 3.09.2015 5.3. Coordinate 2
& Transformations BB
4.09.2015
 5.4. A Canonical Program
Form
5.5. Great Insights?
44 Tutorial\Exam\Topics beyond 1 BB/LCD
7.09.2015
Syllabus
45 1. PATH PRODUCTS AND 1
PATH EXPRESSIONS
1.1. Overview
8.09.2015 BB
1.2. Basic Concepts
1.3. Path Products
1.4. Path Sums
46 1.5 Distributive Laws 1
9.09.2015 1.6. Absorption Rule
BB
1.7. Loops
1.8. Identity Elements
47 2. A REDUCTION PROCEDURE 1
10.09.2015 2.1. Overview
BB
2.2. Cross-Term Step (Step 4)
2.3. Parallel Term (Step 6)
48 2.4. Loop Term (Step 7) 1
11.09.2015 2.5. Comments, Identities, BB
and Node-Removal Order
49 3. APPLICATIONS 2
14.09.2015 3.1. General
& 3.2. How Many Paths in a
BB
15.09.2015 Flowgraph?
3.3. Approximate Minimum
Number of Paths
50 3.4. The Probability of Getting 2
16.09.2015 There
& 3.5. The Mean Processing BB
18.09.2015 Time of a Routine
3.6. Push/Pop, Get/Return
3.7. Limitations and Solutions
51 4. REGULAR EXPRESSIONS 1
AND FLOW-ANOMALY
DETECTION
4.1. The Problem
21.09.2015 4.2. The Method BB
4.3. A Data-Flow Testing
Example
4.4. Generalizations,
Limitations, and Comments
52 LOGIC-BASED TESTING 1
5. MOTIVATIONAL OVERVIEW
22.09.2015 BB
5.1. Programmers and Logic
5.2. Hardware Logic Testing
53 5.3. Specification Systems and 1
Languages 5.4. Knowledge-
23.09.2015 BB
Based Systems
5.5. Overview
54 6. DECISION TABLES 1
6.1. Definitions and Notation
25.09.2015 6.2. Decision-Table Processors BB
6.3. Decision Tables as a Basis
for Test Case Design
55 6.4. Expansion of Immaterial 1
Cases
28.09.2015 6.5. Test Case Design BB
6.6. Decision Tables and
Structure
56 7. PATH EXPRESSIONS AGAIN 1
29.09.2015 7.1. General BB
7.2. Boolean Algebra
57 30.09.2015 7.3. Boolean Equations 1
58 8. KV CHARTS 1
1.10.2015 8.1. The Problem BB
8.2. Simple Forms
59 8.3. Three Variables 1
8.4. Four Variables and More
5.10.2015 BB
8.5. Even More Testing
Strategies?
60 9. SPECIFICATIONS 1
9.1. General
9.2. Finding and Translating
the Logic
6.10.2015 BB
9.3. Ambiguities and
Contradictions
9.4. Don’t-Care and
Impossible Terms
61 Tutorial\Exam\Topics beyond 1 BB
7.10.2015
Syllabus
62 1. STATE GRAPHS 1
8.10.2015 1.1. States
BB
1.2. Inputs and Transitions
1.3. Outputs
63 1.4. State Tables 1
9.10.2015 1.5. Time Versus Sequence BB
1.6. Software Implementation
64 2. GOOD STATE GRAPHS AND 1
BAD
2.1. General
12.10.2015 2.2. State Bugs BB
2.3. Transition Bugs
2.4. Output Errors
2.5. Encoding Bugs
65 3. STATE TESTING 1
13.10.2015 3.1. Impact of Bugs BB
3.2. Principles
66 3.3. Limitations and 1
Extensions
14.10.2015 3.4. What to Model BB
3.5. Getting the Data
3.6. Tools
67 4. TESTABILITY TIPS 1
4.1. A Balm for Programmers
4.2. How Big, How Small?
4.3. Switches, Flags, and
14.10.2015 BB
Unachievable Paths
4.4. Essential and Inessential
Finite-State Behavior
4.5. Design Guidelines
 68 5. MOTIVATIONAL OVERVIEW 1
5.1. The Problem with
Pictorial Graphs
15.10.2015 5.2. Tool Building BB
5.3. Doing and Understanding
Testing Theory
5.4. The Basic Algorithms
69 6. THE MATRIX OF A GRAPH 1
6.1. Basic Principles
15.10.2015 BB
6.2. A Simple Weight
6.3. Further Notation
70 7. RELATIONS 1
7.1. General
7.2. Properties of Relations
7.3. Equivalence Relations
7.4. Partial Ordering Relations
8. THE POWERS OF A MATRIX
16.10.2015 8.1. Principles
BB
8.2. Matrix Powers and
Products
8.3. The Set of All Paths
8.4. Loops
8.5. Partitioning Algorithm
5.6. Breaking Loops And
Applications
71 9. NODE-REDUCTION 1
ALGORITHM
9.1. General
17.10.2015 9.2. Some Matrix Properties
9.3. The Algorithm
9.4. Applications
9.5. Some Hints

NOTE: DELIVERY METHODS : DM1: Lecture interspersed with discussions/BB, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration ( laboratory, field visit ),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes:CO1,CO2,CO3,CO4,CO5& sample
proofs are enclosed in Course file.

Course Delivery:

UNIT 1 2 3 4 5

WEEK 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
 Prepared by Approved by

Signature

Name K.N. Prasanthi HOD/CSE

Designation Asistant Professor/CSE Professor

Date

Unit-Wise Question Bank

UNIT-I

1. Why is it impossible for a tester to find all the bugs in a system? Why might it not be
necessary for a program to be completely free of defects before it is delivered to its
customers?
2. To what extent can testing be used to validate that the program is fit for its purpose.
Discuss?
3. What is meant by integration testing? Goals of Integration Testing?
4. Explain white-box testing and behavioral testing?
5. State and explain various dichotomies in software testing?
6. Discuss about requirements, features and functionality bugs.
7. What are control and sequence bugs? How they can be caught?
UNIT-II

1. Consider the following flow - graph? Select optimal number of paths to achieve C1+C2
(statement coverage + branch coverage

2. Explain various loops with an example?

3. Explain concatenated loops with an example?
4. State and explain various kinds of predicate blindness with examples?
 5. What are link counters? Discuss their use in path testing?
6. Discuss Traversal marker with an example?
7. What is meant by Co - incidental Correctness with example?
8. What is meant by statement testing and branch testing with an example?
9. State and explain various path selection rules.
10. What is meant by program’s control flow? How is it useful for path testing?
11. Discuss various flow graph elements with their notations.
12. Distinguish Control Flow and Transaction flow.
13. What is meant by transaction flow testing? Discuss its significance.
14. Discuss in detail data - flow testing strategies.
15. What are data - flow anomalies? How data flow testing can explore them?
16. What are data-flow anomalies? How data flow testing can explore them?
17. What is meant by a program slice? Discuss about static and dynamic program slicing.
18. Explain the terms Dicing, Data-flow and Debugging.
19. What is meant by data flow model? Discuss various components of it?
20. Compare data flow and path flow testing strategies?
21. Explain data-flow testing with an example. Explain its generalizations and limitations

UNIT-III

1. Discuss with example the equal - span range/Doman compatibility bugs.

2. Discuss in detail about testability of Domains.
3. What is meant by Domain Dimensionality?
4. What is meant by nice - domain? Give an example for nice two - dimensional domain.
5. Discuss
a. Linear domain boundaries
b. Non linear domain boundaries
c. Complete domain boundaries
d. Incomplete domain boundaries
6. Explain various properties related to Ugly-domains.
7. State and explain various restrictions at domain testing processes.
8. What is meant by domain testing? Discuss the various applications of domain testing?
9. With a neat diagram, explain the schematic representation of domain testing.
10. Explain how one-dimensional domains are tested?
11. Discuss in detail the domains and interface testing.

UNIT-IV

1. Explain Regular Expressions and Flow Anomaly detection.

2. Example Huang’s theorem with examples
3. Reduction procedure algorithm for the following flow graph
4. Write Short Notes on:
a. Distributive Laws
b. Absorption Rule
c. Loops
d. Identity elements
5. Discuss Path Sums and Path Product.
6. Discuss in brief applications of paths
7. Reduce the following functions using K-Maps F(A,B,C,D) = P(4,5,6,7,8,12,13)+d(1,15)
8. Whether the predicates are restricted to binary truth-values or not. Explain.
 9. What are decision tables? Illustrate the applications of decision tables. How is a decision
table useful in testing?
10. Explain with an example. How can we determine paths in domains in Logic based testing?
11. How the Boolean expression can be used in test case design
12. Flow graphs are abstract representations of programs. Justify?
13. Explain prime implicant, sum of product form and product of sum form.
14. How can we form specifications into sentences? Write down different phrases that can be
used for words?
15. Explain about the ambiguities and contradictions in specifications.
16. Demonstrate by means of truth tables the validity of the following theorems of Boolean
algebra:
a. Associative Laws
b. Demorgan's theorems for three variables
c. Distributive Law
d. Absorption Rule
UNIT-V

1. The behavior of a finite state machine is invariant under all encodings. Justify? (16 M)**
2. Write testers comments about state graphs
3. What are the types of bugs that can cause state graphs?
4. What are the principles of state testing. Discuss advantages and disadvantages.
5. Write the design guidelines for building finite state machine into code.
6. What are the software implementation issues in state testing?
7. Explain about good state and bad state graphs.
8. Explain with an example how to convert specification into state-graph. Also discuss how
contradictions can come out.
9. Write short notes on:
a. Transition Bugs
b. Dead States
c. State Bugs
d. Encoding Bugs
10. How can the graph be represented in Matrix form?
11. Write a partition algorithm.
12. Discuss node reduction algorithm.
13. How can a node reduction optimization be done.
14. What are the matrix operations in tool building.
15. Discuss the algorithm for finding set of all paths
16. How can a relation matrix be represented and what are the properties of relations? Explain
cross-term reduction and node term reduction optimization.
17. Write about matrix powers and products.
18. Write about equivalence relation and partial ordering relation
19. What are the advantages and disadvantages of array representations?
20. Write about loops in matrix representation
21. What are graph matrices and their applications?
22. Discuss the linked list representation.

Name of the Faculty: K.NAGA PRASANTHI Semester:1 2015-16

Course Title: SOFTWARE TESTING METHODOLOGIES Dt:22-06-15

S.No. Tentative Topics to be covered Actual No.of Teaching

date date classes methodology
1 1. Purpose of Testing 1
1.1. What We Do
23.06.2015 1.2. Productivity and Quality BB
in Software
1.3. Goals for Testing
2 1.4. Phases in a Tester’s 2
24.06.2015 Mental Life
& 1.5. Test Design
BB
25.06.2015 1.6. Testing Isn’t Everything
1.7. The Pesticide Paradox
and the Complexity Barrier
3 2. SOME DICHOTOMIES 2
26.06.2015 2.1. Testing Versus Debugging
& 2.2. Function Versus Structure BB
27.06.2015 2.3. The Designer Versus the
Tester
4 2.4. Modularity Versus. 1
Efficiency
30.06.2015 2.5. Small Versus Large BB
2.6. The Builder Versus the
Buyer
5 3. A MODEL FOR TESTING 1
3.1. The Project
1.07.2015 3.2. Overview BB
3.3. The Environment
3.4. The Program
6 3.5. Bugs 1 BB
2.07.2015
3.6. Tests
7 3.7. Testing and Levels 1 BB
3.07.2015
3.8. The Role of Models
8 4. A TAXONOMY OF BUGS 1
4.1. General
4.07.2015 BB
4.2. Requirements, Features,
and Functionality Bugs
9 7.07.2015 4.3. Structural Bugs 1 BB
10 4.4. Data Bugs 1
8.07.2015 BB
4.5. Coding Bugs
11 4.6. Interface, Integration, 1
9.07.2015 and System Bugs BB
4.7. Test and Test Design Bugs
12 10.07.2015 Tutorial OR Test 1 BB/LCD
13 Flow Graphs and Path testing 1
1. Predicates, Path Predicates
11.07.2015 BB
1.1. General
1.2. Predicates.
14 1.3. Predicate Expressions 1
14.07.2015 1.4. Predicate Coverage BB
1.5. Testing Blindness
15 2. Path–Testing Basics 1
15.07.2015 2.1. Motivation and
BB
Assumptions
2.2. Control Flow graphs
16 16.07.2015 2.3. Path Testing 1 BB
17 2.4. Loops 1
17.07.2015 2.5. More on Testing Multi – BB
Entry/Multi–Exit Routines
18 2.6. Effectiveness of Path 1
21.07.2015 Testing BB
2.7. Variations
19 3. Path Sensitizing 1
3.1. Review; Achievable and
BB
22.07.2015 Unachievable Paths.
3.2. Pragmatic Observations
20 3.3. Heuristic Procedures for 1
23.07.2015 Sensitizing Paths BB
3.4. Examples
21 4. Path Instrumentation 1
24.07.2015 4.1. The Problem
BB
4.2. General Strategy
4.3. Link Markers
22 4.4. Link Counters 1
25.07.2015 4.5. Other Instrumentation
BB
Methods.
4.6. Implementation
23 5. Application Of Path Testing 2
5.1. Integration, Coverage,
28.07.2015 and Paths in Called
Components
5.2. New Code
5.3. Maintenance
BB
5.4. Rehosting

6.TRANSACTION-FLOW TESTING
Transaction Flows
6.1. Definitions
6.2. Example
6.3. Usage
25 6.4. Implementation 1
29.07.15
6.5. Perspective
26 6.6. Complications 1
30.07.2015
6.7. Transaction-Flow BB
Structure
27 7. Transaction-Flow Testing 1
Techniques
31.07.2015 7.1. Get the Transaction Flows BB
7.2. Inspections, Reviews,
Walkthroughs
28 7.3. Path Selection 1 BB
1.08.2015
7.4. Sensitization
29 7.5. Instrumentation 1
4.08.2015 7.6. Test Databases BB
7.7. Execution
30 DATA-FLOW TESTING 1
8. DATA-FLOW TESTING
5.08.2015 BASICS BB
8.1. Motivation and
Assumptions
31 6.08.2015 8.2. Date Flow-graphs 1 BB
 8.3. The Data-Flow Model
32 9. DATA-FLOW TESTING 1
STRATEGIES
7.08.2015 BB
9.1. General
9.2. Terminology
33 9.3. The Strategies 1
8.08.2015
9.4. Slicing, Dicing, Data Flow, BB
and Debugging
34 Tutorial\Exam\Topics beyond 1 BB/LCD
8.08.2015
Syllabus
35 DOMAIN TESTING 1
1. DOMAINS AND PATHS
18.08.2015 1.1. The Model
BB
1.2. A Domain Is a Set
1.3. Domains, Paths, and
Predicates
36 1.4. Domain Closure 2
19.08.2015
1.5. Domain Dimensionality
& BB
1.6. The Bug Assumptions
20.08.2015
1.7. Restrictions
37 2. NICE DOMAINS AND UGLY 1
DOMAINS
2.1. Where Do Domains Come
21.08.2015 BB
From?
2.2. Specified Versus
Implemented Domains
38 2.3. Nice Domains 1
2.4. Ugly Domains and How
Programmers and Testers
Treat Them
22.08.2015 BB
3. DOMAIN TESTING
3.1. Overview
3.2. Domain Bugs and How to
Test
39 3.3. Procedure 1
25.08.2015 3.4. Variations, Tools, BB
Effectiveness
40 4. DOMAINS AND INTERFACE 2
26.08.2015 TESTING
& 4.1. General BB
27.08.2015 4.2. Domains and Range
4.3. Closure Compatibility
41 4.4. Span Compatibility 2
28.08.2015
4.5. Interface Range/Domain
& BB
Compatibility Testing
29.08.2015
4.6. Finding the Values
42 5. DOMAINS AND TESTABILITY 2
1.09.2015
5.1. General
& BB
5.2. Linearizing
2.09.2015
Transformations
43 5.3. Coordinate 2
3.09.2015 Transformations
5.4. A Canonical Program BB
Form
5.5. Great Insights?
44 Tutorial\Exam\Topics beyond 1 BB/LCD
4.09.2015
Syllabus
45 1. PATH PRODUCTS AND 1
PATH EXPRESSIONS
1.1. Overview
8.09.2015 BB
1.2. Basic Concepts
1.3. Path Products
1.4. Path Sums
46 1.5 Distributive Laws 1
9.09.2015 1.6. Absorption Rule
BB
1.7. Loops
1.8. Identity Elements
47 2. A REDUCTION PROCEDURE 1
10.09.2015 2.1. Overview
BB
2.2. Cross-Term Step (Step 4)
2.3. Parallel Term (Step 6)
48 2.4. Loop Term (Step 7) 1
11.09.2015 2.5. Comments, Identities, BB
and Node-Removal Order
49 3. APPLICATIONS 2
12.09.2015 3.1. General
& 3.2. How Many Paths in a
BB
15.09.2015 Flowgraph?
3.3. Approximate Minimum
Number of Paths
50 3.4. The Probability of Getting 2
There
16.09.2015 3.5. The Mean Processing BB
Time of a Routine
3.6. Push/Pop, Get/Return
3.7. Limitations and Solutions
51 4. REGULAR EXPRESSIONS 1
AND FLOW-ANOMALY
DETECTION
4.1. The Problem
18.09.2015 4.2. The Method BB
4.3. A Data-Flow Testing
Example
4.4. Generalizations,
Limitations, and Comments
52 LOGIC-BASED TESTING 1
5. MOTIVATIONAL OVERVIEW
19.09.2015 BB
5.1. Programmers and Logic
5.2. Hardware Logic Testing
53 5.3. Specification Systems and 1
Languages 5.4. Knowledge-
22.09.2015 BB
Based Systems
5.5. Overview
54 6. DECISION TABLES 1
6.1. Definitions and Notation
23.09.2015 6.2. Decision-Table Processors BB
6.3. Decision Tables as a Basis
for Test Case Design
55 6.4. Expansion of Immaterial 1
25.09.2015 Cases BB
6.5. Test Case Design
 6.6. Decision Tables and
Structure
56 7. PATH EXPRESSIONS AGAIN 1
26.09.2015 7.1. General BB
7.2. Boolean Algebra
57 29.09.2015 7.3. Boolean Equations 1
58 8. KV CHARTS 1
30.09.2015 8.1. The Problem BB
8.2. Simple Forms
59 8.3. Three Variables 1
8.4. Four Variables and More
1.10.2015 BB
8.5. Even More Testing
Strategies?
60 9. SPECIFICATIONS 1
9.1. General
9.2. Finding and Translating
the Logic
3.10.2015 BB
9.3. Ambiguities and
Contradictions
9.4. Don’t-Care and
Impossible Terms
61 Tutorial\Exam\Topics beyond 1 BB
6.10.2015
Syllabus
62 1. STATE GRAPHS 1
7.10.2015 1.1. States
BB
1.2. Inputs and Transitions
1.3. Outputs
63 1.4. State Tables 1
8.10.2015 1.5. Time Versus Sequence BB
1.6. Software Implementation
64 2. GOOD STATE GRAPHS AND 1
BAD
2.1. General
9.10.2015 2.2. State Bugs BB
2.3. Transition Bugs
2.4. Output Errors
2.5. Encoding Bugs
65 3. STATE TESTING 1
10.10.2015 3.1. Impact of Bugs BB
3.2. Principles
66 3.3. Limitations and 1
Extensions
13.10.2015 3.4. What to Model BB
3.5. Getting the Data
3.6. Tools
67 4. TESTABILITY TIPS 1
4.1. A Balm for Programmers
4.2. How Big, How Small?
4.3. Switches, Flags, and
14.10.2015 BB
Unachievable Paths
4.4. Essential and Inessential
Finite-State Behavior
4.5. Design Guidelines
68 5. MOTIVATIONAL OVERVIEW 1
15.10.2015 5.1. The Problem with BB
Pictorial Graphs
 5.2. Tool Building
5.3. Doing and Understanding
Testing Theory
5.4. The Basic Algorithms
69 6. THE MATRIX OF A GRAPH 1
6.1. Basic Principles
15.10.2015 BB
6.2. A Simple Weight
6.3. Further Notation
70 7. RELATIONS 1
7.1. General
7.2. Properties of Relations
7.3. Equivalence Relations
7.4. Partial Ordering Relations
8. THE POWERS OF A MATRIX
16.10.2015 8.1. Principles
BB
8.2. Matrix Powers and
Products
8.3. The Set of All Paths
8.4. Loops
8.5. Partitioning Algorithm
5.6. Breaking Loops And
Applications
71 9. NODE-REDUCTION 1
ALGORITHM
9.1. General
17.10.2015 9.2. Some Matrix Properties
9.3. The Algorithm
9.4. Applications
9.5. Some Hints

NOTE: DELIVERY METHODS : DM1: Lecture interspersed with discussions/BB, DM2: Tutorial,
DM3: Lecture with a quiz, DM4: Assignment/Test, DM5: Demonstration ( laboratory, field visit ),
DM6: Presentations/PPT

At the End of the course, students attained the Course Outcomes:CO1,CO2,CO3,CO4,CO5& sample
proofs are enclosed in Course file.

Course Delivery:

UNIT 1 2 3 4 5

WEEK 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Prepared by Approved by

Signature
Name K.N. Prasanthi HOD/CSE

Designation Asistant Professor/CSE Professor

Date