0% found this document useful (0 votes)
13 views101 pages

Ece Lesson Plan Vi Sem 2016-17

Uploaded by

chs999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views101 pages

Ece Lesson Plan Vi Sem 2016-17

Uploaded by

chs999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 101

LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING


(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B. Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Digital System Design using Verilog - S 194
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Ch.Mallikharjuna Rao, Assistant Professor
COURSE COORDINATOR : R.Hari kishan, Assistant Professor

COURSE OBJECTIVE: This course provides the role of Verilog HDL in digital system
design and different constructs of Verilog HDL to design at different levels ranging from
behavioral level down to switch level. It also provides the implementation of digital system
design using CPLD and FPGA.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand Digital System
Design flow using Verilog
HDL 2 3 1

2 Model Digital System at


Behavioral Level
3 2

3 Model Digital System at Data


flow level and switch level
3

4 Write Verilog functions, tasks,


UDP for digital modules
3

5 Use CPLDs, FPGAs to


implement Digital System
using Verilog HDL 3 2

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 T.R. Padmanabhan and B. Bala Tripura Sundari,”Design through Verilog HDL”,Wiley IEEE Press.
2 , “Stephen Brown and Zvonko Vranesic, “Fundamentals of Logic Design with Verilog”,Tata McGrawHill
Publishers,2nd Edition.
BOS APPROVED REFERENCE BOOKS:
1 Michael D.Ciletti,Advanced Digital Design with Verilog HDL,PHI Publishers.
2 J. Bhaskar, A Verilog Primier, BSP Publishers.
COURSE DELIVERY PLAN (LESSON PLAN): Section-C
UNIT-I : Introduction to Verilog, Language Constructs and Conventions and Gate
Level Modeling
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. Introduction to Subject 1 27.12.16 TLM1
2. Introduction to UNIT-I, Verilog as HDL 1 28.12.16 TLM1
Levels of Design Description,
3. 1 29.12.16 TLM1
Concurrency, Simulation
4. Synthesis, Functional Verification 1 30.12.16 TLM1
System Tasks, Programming Language 31.12.16
5. 1 TLM1
Interface (PLI), Module, Test Benches
6. TUTORIAL-1 1 3.1.17 TLM3
7. Simulation and Synthesis Tools 1 4.1.17 TLM1
LANGUAGE CONSTRUCTS AND
CONVENTIONS- Introduction,
8. 1 5.1.17 TLM1
Keywords, Identifiers, Strings, White
Space Characters, Comments
Numbers, Scalars and Vectors, Logic
9. 1 6.1.17 TLM1
Values, Strengths
Data Types, Parameters, Memory,
10. 1 7.1.17 TLM1
Operators, System Tasks
11. TUTORIAL-2 1 10.1.17 TLM3
Introduction, AND Gate Primitive,
12. 1 11.1.17 TLM1
Module Structure
Other Gate Primitives, Illustrative 12.1.17
13. 1 TLM1
Examples
Tri-State Gates, Array of Instances of
14. 1 17.1.17 TLM1
Primitives
Design of Flip flops with Gate 18.1.17
15. 1 TLM1
Primitives
Delays, Strengths and Contention 19.1.17
16. 1 TLM1
Resolution,Net data types
17. Design of basic circuits 1 20.1.17 TLM1
18. TUTORIAL-3 1 21.1.17 TLM3
24.1.17
19. Assignment/Quiz-1 1 TLM1

No. of classes required to complete UNIT-I 19 No. of classes taken:

UNIT-II : Behavioral Modeling


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Operations and
20. 1 25.1.17
Assignments,
Functional Bifurcation , Initial&
21. 1 27.1.17
Always Construct
Examples on Initial and Always
22. 1 28.1.17
Constructs
Assignments with Delays, wait
23. 1 31.1.17
construct
Multiple always blocks, Design at
24. 1 1.2.17
Behavioral Level
25. TUTORIAL-4 1 2.2.17
Blocking and Non-blocking
26. 1 3.2.17
Assignments
The case statement, Simulation Flow 4.2.17
27. 1
,iƒ and iƒ-else constructs
assign-deassign construct, repeat
28. 1 7.2.17
construct
for loop, the disable construct, While 8.2.17
29. 1
loop,
forever loop, parallel blocks, force-
30. 1 9.2.17
release construct, Event
31. Tutorial-5 1 10.2.17
32. Assignment/Quiz-2 1 14.2.17
No. of classes required to complete UNIT-II 13 No. of classes taken:

UNIT-III : Modeling at Data Flow Level and Switch Level Modeling


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Continuous Assignment
33. 1 15.2.17
Structures
34. Delays and Continuous Assignments 1 16.2.17
35. Assignment to Vectors , Operators 1 17.2.17
36. Tutorial-6 1 18.2.17
Introduction to switch level modeling,
37. 1 28.2.17
Basic Transistor Switches
38. CMOS Switch 1 1.3.17
39. Bi-directional Gates 1 2.3.17
Time Delays with Switch Primitives,
40. Instantiations with Strengths and 1 3.3.17
Delays
41. Strength Contention with Tri-reg Nets 1 4.3.17
42. Tutorial-7 1 7.3.17
43. Assignment/Quiz-3 1 8.3.17
No. of classes required to complete UNIT-III 11 No. of classes taken:

UNIT-IV : System Tasks, Functions and Compiler Directives, User-Defined Primitives


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
9.3.17
44. Introduction to UNIT-IV 1

45. Parameters, Path Delays 1 10.3.17


46. System Tasks and Functions 1 14.3.17
15.3.17
47. File-Based Tasks and Functions 1
Compiler Directives, Hierarchical 16.3.17
48. 1
Access
49. TUTORIAL-8 1 173.17
18.3.17
50. General Observations, Exercises 1
21.3.17
51. TUTORIAL-9 1

52. Introduction, Function 1 22.3.17


53. Tasks 1 23.3.17
54. User- Defined Primitives (UDP) 1 24.3.17
FSM Design (Moore and Mealy 25.3.17
55. 1
Machines)
56. TUTORIAL-10 1 29.3.17
57. Assignment/Quiz-4 1 30.3.17
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : Digital Design With SM Charts , Designing with PGAs and CPLDs & Verilog
Modules
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
58. Introduction to UNIT-V 1 31.3.17
State Machine Charts, Derivation of
59. 1 1.4.17
SM Charts
60. State Machine Charts 1 3.4.17
61. Realization of SM Charts 1 4.4.17
62. Implementation of the Dice Game 1 5.4.17
63. Tutorial-11 1 6.4.17
Alternative realizations for SM Charts
64. 1 7.4.17
using Microprogramming
65. Linked State Machines 1 11.4.17
66. Xilinx 3000 Series FPGAs 1 12.4.17
67. Designing with FPGAs 1 13.4.17

68. Tutorial-12 1 15.4.17


69. Using a One-Hot State Assignment 1 18.4.17
Altera Complex Programmable Logic
70. 1 19.4.17
Devices (CPLDs)
71. Altera FLEX 10K Series CPLDs 1 20.4.17
72. UART Design 1 21.4.17
73. Design of Microcontroller CPU 1 22.4.17
74. Assignment/Quiz-4 1 25.4.17
No. of classes required to complete UNIT-V 17 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. Introduction toCadence 1 26.4.17
2. Introduction to modelsim 1 27.4.17
3. Introduction to modelsim 1 28.4.17
Teaching Learning Methods
TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 27-01-2017 30-03-2017 9W
II Mid Examinations 31-03-2017 03-04-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr.CH.Mallikharjuna Mr. R.Harikishan Mr.Y.Amar Babu Dr.M.Suman Prof.B.Ramesh Reddy


Rao
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B. Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Digital System Design using Verilog - S 194
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : R.Hari kishan, Assistant Professor
COURSE COORDINATOR : R.Hari kishan, Assistant Professor

COURSE OBJECTIVE: This course provides the role of Verilog HDL in


digital system design and different constructs of Verilog HDL to design at
different levels ranging from behavioral level down to switch level. It also
provides the implementation of digital system design using CPLD and FPGA.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand Digital
System Design flow 2 3 1
using Verilog HDL
2 Model Digital System at
Behavioral Level 3 2

3 Model Digital System at


Data flow level and 3
switch level
4 Write Verilog functions,
tasks, UDP for digital 3
modules
5 Use CPLDs, FPGAs to
implement Digital
System using Verilog
3 2
HDL

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 T.R. Padmanabhan and B. Bala Tripura Sundari,”Design through Verilog HDL”,Wiley
IEEE Press.
2 , “Stephen Brown and Zvonko Vranesic, “Fundamentals of Logic Design with
Verilog”,Tata McGrawHill Publishers,2nd Edition.
BOS APPROVED REFERENCE BOOKS:
1 Michael D.Ciletti,Advanced Digital Design with Verilog HDL,PHI Publishers.
2 J. Bhaskar, A Verilog Primier, BSP Publishers.
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : Introduction to Verilog, Language Constructs and Conventions and Gate
Level Modeling
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
75. Introduction to Subject 1 27.12.16
76. Introduction to UNIT-I 1 28.12.16
77. Verilog as HDL 1 29.12.16
78. Levels of Design Description 1 30.12.16
79. Concurrency, Simulation 1 2.1.17
80. Synthesis, Functional Verification 1 3.1.17
System Tasks, Programming Language 4.1.17
81. 1
Interface (PLI)
5.1.17
82. Module, Test Benches 2
6.1.17
83. TUTORIAL-1 1 9.1.17
84. Simulation and Synthesis Tools 1 10.1.17
LANGUAGE CONSTRUCTS AND
CONVENTIONS- Introduction,
85. 1 11.1.17
Keywords, Identifiers, Strings, White
Space Characters, Comments
Numbers, Scalars and Vectors, Logic
86. 1 12.1.17
Values, Strengths
Data Types, Parameters, Memory,
87. 1 16.1.17
Operators, System Tasks
88. TUTORIAL-2 1 17.1.17
Introduction, AND Gate Primitive,
89. 1 18.1.17
Module Structure
Other Gate Primitives, Illustrative 19.1.17
90. 1
Examples
Tri-State Gates, Array of Instances of
91. 1 20.1.17
Primitives
Design of Flip flops with Gate 23.1.17
92. 1
Primitives
Delays, Strengths and Contention 24.1.17
93. 1
Resolution
94. Design of basic circuits 1 25.1.17
95. TUTORIAL-3 1 27.1.17
30.1.17
96. Assignment/Quiz-1 1

No. of classes required to complete UNIT-I 23 No. of classes taken:

UNIT-II : Behavioral Modeling


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Operations and
97. 1 31.1.17
Assignments,
Functional Bifurcation , Initial&
98. 1 1.2.17
Always Construct
Examples on Initial and Always
99. 1 2.2.17
Constructs
Assignments with Delays, wait
100. 1 3.2.17
construct
Multiple always blocks, Design at
101. 1 6.2.17
Behavioral Level
102. TUTORIAL-4 1 7.2.17
Blocking and Non-blocking
103. 1 8.2.17
Assignments
The case statement, Simulation Flow 9.2.17
104. 2
,iƒ and iƒ-else constructs 10.2.17
assign-deassign construct, repeat
105. 1 13.2.17
construct
for loop, the disable construct, While 14.2.17
106. 1
loop,
forever loop, parallel blocks, force-
107. 1 15.2.17
release construct, Event
108. Tutorial-5 1 16.2.17
109. Assignment/Quiz-2 1 17.2.17
No. of classes required to complete UNIT-II 14 No. of classes taken:

UNIT-III : Modeling at Data Flow Level and Switch Level Modeling


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Continuous Assignment
110. 1 20.2.17
Structures
21.2.17
111. Delays and Continuous Assignments 1

112. Assignment to Vectors 1 22.2.17


23.2.17
113. Operators 1

114. Tutorial-6 1 27.2.17


Introduction to switch level modeling,
115. 1 28.2.17
Basic Transistor Switches
CMOS Switch 1.3.17
116. 1

117. Bi-directional Gates 1 2.3.17


Time Delays with Switch Primitives,
118. Instantiations with Strengths and 1 3.3.17
Delays
119. Strength Contention with Tri-reg Nets 1 6.3.17
120. Tutorial-7 1 7.3.17
8.3.17
121. Assignment/Quiz-3 1

No. of classes required to complete UNIT-III 13

UNIT-IV : System Tasks, Functions and Compiler Directives, User-Defined Primitives


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
122. Introduction to UNIT-IV 1 9.3.17
123. Parameters 1 10.3.17
124. Path Delays 1 13.3.17
125. System Tasks and Functions 1 14.3.17
16.3.17
126. File-Based Tasks and Functions 1

127. Compiler Directives 1 17.3.17


128. Hierarchical Access 1 20.3.17
129. TUTORIAL-8 1 21.3.17
130. General Observations, Exercises 1 22.3.17
131. TUTORIAL-9 1 23.3.17
132. Introduction, Function 1 24.3.17
133. Tasks 1 27.3.17
134. User- Defined Primitives (UDP) 1 29.3.17
FSM Design (Moore and Mealy 30.3.17
135. 1
Machines)
136. TUTORIAL-10 1 31.3.17
137. Assignment/Quiz-4 1 3.4.17
No. of classes required to complete UNIT-IV 17 No. of classes taken:
UNIT-V : Digital Design With SM Charts , Designing with PGAs and CPLDs & Verilog
Modules
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
138. Introduction to UNIT-V 1 4.4.17
State Machine Charts, Derivation of 5.4.17
139. 1
SM Charts
140. State Machine Charts 1 6.4.17
141. Realization of SM Charts 1 7.4.17
10.4.17
142. Implementation of the Dice Game 1

143. Tutorial-11 1 11.4.17


Alternative realizations for SM Charts
144. 1 12.4.17
using Microprogramming
145. Linked State Machines 1 13.4.17
146. Xilinx 3000 Series FPGAs 1 17.4.17
1 18.4.17
147. Designing with FPGAs

148. Tutorial-12 1 19.4.17


149. Using a One-Hot State Assignment 1 20.4.17
Altera Complex Programmable Logic
150. 1 21.4.17
Devices (CPLDs)
21.4.17
151. Altera FLEX 10K Series CPLDs 1

152. UART Design 1 24.4.17


153. Design of Microcontroller CPU 1 25.4.17
154. Assignment/Quiz-4 1 26.4.17
No. of classes required to complete UNIT-V 17 No. of classes taken:
Contents beyond the Syllabus
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
4. Testing of Logic Circuits 1 27.4.17
5. Synthesis of combinational circuits 1 28.4.17

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr. R.Harikishan Mr. R.Harikishan Mr.Y.Amar Babu Dr.M.Suman Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
COURSE DELIVERY PLAN (LESSON PLAN): Section-B
UNIT-I : Introduction to Verilog, Language Constructs and Conventions and Gate
Level Modeling
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. Introduction to Subject 1 27.12.16
2. Introduction to UNIT-I 1 28.12.16
3. Verilog as HDL 1 30.12.16
4. Levels of Design Description 1 31.12.16
5. Concurrency, Simulation 1 2.1.17
6. Synthesis, Functional Verification 1 3.1.17
System Tasks, Programming Language 4.1.17
7. 1
Interface (PLI)
6.1.17
8. Module, Test Benches 2
7.1.17
9. TUTORIAL-1 1 9.1.17
10. Simulation and Synthesis Tools 1 10.1.17
LANGUAGE CONSTRUCTS AND
CONVENTIONS- Introduction,
11. 1 11.1.17
Keywords, Identifiers, Strings, White
Space Characters, Comments
Numbers, Scalars and Vectors, Logic
12. 1 14.1.17
Values, Strengths
Data Types, Parameters, Memory,
13. 1 16.1.17
Operators, System Tasks
14. TUTORIAL-2 1 17.1.17
Introduction, AND Gate Primitive,
15. 1 18.1.17
Module Structure
Other Gate Primitives, Illustrative 20.1.17
16. 1
Examples
Tri-State Gates, Array of Instances of
17. 1 21.1.17
Primitives
Design of Flip flops with Gate 23.1.17
18. 1
Primitives
Delays, Strengths and Contention 24.1.17
19. 1
Resolution
20. Design of basic circuits 1 25.1.17
21. TUTORIAL-3 1 27.1.17
28.1.17
22. Assignment/Quiz-1 1

No. of classes required to complete UNIT-I 23 No. of classes taken:


UNIT-II : Behavioral Modeling
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Operations and
23. 1 30.1.17
Assignments,
Functional Bifurcation , Initial&
24. 1 31.1.17
Always Construct
Examples on Initial and Always
25. 1 1.2.17
Constructs
Assignments with Delays, wait
26. 1 3.2.17
construct
Multiple always blocks, Design at
27. 1 4.2.17
Behavioral Level
28. TUTORIAL-4 1 6.2.17
Blocking and Non-blocking
29. 1 7.2.17
Assignments
The case statement, Simulation Flow 8.2.17
30. 2
,iƒ and iƒ-else constructs 10.2.17
assign-deassign construct, repeat
31. 1 11.2.17
construct
for loop, the disable construct, While 13.2.17
32. 1
loop,
forever loop, parallel blocks, force-
33. 1 14.2.17
release construct, Event
34. Tutorial-5 1 15.2.17
35. Assignment/Quiz-2 1 17.2.17
No. of classes required to complete UNIT-II 14 No. of classes taken:

UNIT-III : Modeling at Data Flow Level and Switch Level Modeling


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction, Continuous Assignment
36. 1 18.2.17
Structures
20.2.17
37. Delays and Continuous Assignments 1

38. Assignment to Vectors 1 21.2.17


22.2.17
39. Operators 1

40. Tutorial-6 1 25.2.17


Introduction to switch level modeling,
41. 1 27.2.17
Basic Transistor Switches
CMOS Switch 28.2.17
42. 1

43. Bi-directional Gates 1 1.3.17


Time Delays with Switch Primitives,
44. Instantiations with Strengths and 1 3.3.17
Delays
45. Strength Contention with Tri-reg Nets 1 4.3.17
46. Tutorial-7 1 6.3.17
7.3.17
47. Assignment/Quiz-3 1

No. of classes required to complete UNIT-III 13 No. of classes taken:

UNIT-IV : System Tasks, Functions and Compiler Directives, User-Defined Primitives


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
48. Introduction to UNIT-IV 1 8.3.17
49. Parameters 1 10.3.17
50. Path Delays 1 11.3.17
51. System Tasks and Functions 1 13.3.17
14.3.17
52. File-Based Tasks and Functions 1

53. Compiler Directives 1 15.3.17


54. Hierarchical Access 1 17.3.17
55. TUTORIAL-8 1 18.3.17
56. General Observations, Exercises 1 20.3.17
57. TUTORIAL-9 1 21.3.17
58. Introduction, Function 1 22.3.17
59. Tasks 1 24.3.17
60. User- Defined Primitives (UDP) 1 25.3.17
FSM Design (Moore and Mealy 27.3.17
61. 1
Machines)
62. TUTORIAL-10 1 29.3.17
63. Assignment/Quiz-4 1 31.3.17
No. of classes required to complete UNIT-IV 17 No. of classes taken:
UNIT-V : Digital Design With SM Charts , Designing with PGAs and CPLDs & Verilog
Modules
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
64. Introduction to UNIT-V 1 1.4.17
State Machine Charts, Derivation of 3.4.17
65. 1
SM Charts
66. State Machine Charts 1 4.4.17
67. Realization of SM Charts 1 5.4.17
7.4.17
68. Implementation of the Dice Game 1

69. Tutorial-11 1 8.4.17


Alternative realizations for SM Charts
70. 1 10.4.17
using Microprogramming
71. Linked State Machines 1 11.4.17
72. Xilinx 3000 Series FPGAs 1 12.4.17
1 14.4.17
73. Designing with FPGAs

74. Tutorial-12 1 15.4.17


75. Using a One-Hot State Assignment 1 17.4.17
Altera Complex Programmable Logic
76. 1 18.4.17
Devices (CPLDs)
19.4.17
77. Altera FLEX 10K Series CPLDs 1

78. UART Design 1 21.4.17


79. Design of Microcontroller CPU 1 22.4.17
80. Assignment/Quiz-4 1 24.4.17
81. Revision 1 25.4.17
No. of classes required to complete UNIT-V 18 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
6. Testing of Logic Circuits 1 26.4.17
7. Synthesis of combinational circuits 1 28.4.17

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr. R.Harikishan Mr. R.Harikishan Mr.Y.Amar Babu Dr.M.Suman Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada& Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-A & C
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : S419 - VLSI DESIGN
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Dr. S.V. JAGADEESH CHANDRA
COURSE COORDINATOR : Dr. S.V. JAGADESH CHANDRA

COURSEOBJECTIVE:This course provides the knowledge on IC Fabrication


Technologies and gives acomplete idea about combinational and sequential
sub system CMOS circuit designs used in VLSI Design. The course also
gives the complete information regarding design tools and CMOS testing
techniques.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand
semiconductor
technology and MOS
3 - 1 - - - - - - - - 1 2 3 -
fabrication process
2 Apply layout design
rules for NMOS,CMOS 3 - 2 - 3 1 - - - - - 1 2 3 -
logic circuit designs
3 Design sub systems
used in digital logic 1 - 3 - 2 1 - - - - - 2 2 3 -
systems
4 Design VLSI circuits
using Design tools and 1 - 3 - 3 1 - - - - - 1 2 3 -
Design methods
5 Apply CMOS testing
techniques to test 3 - - - 3 1 - - - - - 2 2 3 -
different digital designs

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Kamran Eshraghian, Eshraghian Dougles and A.Pucknell, Essentials of VLSI circuits
and systems, PHI Publishers, 2005.
2 Neil.H.E.Weste and Kamaran Eshraghian, Principles of CMOS VLSI Design (2/e),
Pearson Education Publishers, 3rdEdition.
BOS APPROVED REFERENCE BOOKS:
1 John .P. Uyemura, Introduction to VLSI Circuits and Systems, JohnWiley Publishers.
2 M.SZE, VLSI Technology,2ndEdition, TMH Publishers.
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : IC fabrication Technology
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Silicon semiconductor
1. 1 27.12.16 TLM2
technology,wafer processing
Moores law and some other basics in the
2. development of IC technology from SSI 1 29.12.16
to VLSI and ULSI
3. Lithography 1 30.01.16 TLM2
4. oxidation, epitaxy 1 31.12.16
5. ion implantation, and diffusion 1 03.12.17 TLM2
6. NMOSfabrication 1 04.01.17 TLM2
7. CMOS fabrication 1 05.01.17
BI‐CMOS technology, Comparison
8. 1 06.01.17 TLM2
between CMOS and bipolar technologies
9. Electrical properties of MOS circuits 1 07.01.17 TLM1
saturated, non saturated regions of MOS
10. 1 17.01.17 TLM1
transistor
11. threshold voltage, body effect 1 18.01.17 TLM1
12. TUTORIAL-1 1 19.01.17 TLM3
13. trans conductance, output conductance 1 20.01.17 TLM1
14. figure of merit, pass transistor 1 21.01.17 TLM1
15. NMOS inverter, pull up to pull down ratio 1 23.01.17 TLM1
16. scaling factors of MOS devices 1 24.01.17 TLM1
17. TUTORIAL-2 1 25.01.17 TLM3
18. CMOS inverter 1 273.01.17 TLM1
19. latch up in CMOS circuits 1 28.01.17 TLM1
20. Assignment/Quiz-1 1 31.01.17 TLM6
No. of classes required to complete UNIT-I 17 No. of classes taken:
UNIT-II : VLSI Circuit Design Process
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
21. VLSI Design flow, MOS layers 1 01.02.17 TLM1
22. Stick diagrams‐MOS layers 1 02.02.17 TLM2
23. NMOS design style, 1 03.02.17 TLM2
24. CMOS design style 1 04.02.17 TLM2
25. lambda- based designrule 1 07.02.17 TLM2
design rules for contact cuts, CMOS
26. 1 08.02.17 TLM2
lambda based design rules
27. TUTORIAL-3 1 09.02.17 TLM3
layout diagrams for NMOS and CMOS
28. 1 10.02.17 TLM2
inverters and logic gates
Concepts of sheet resistance and
29. 1 11.02.17 TLM1
standard unit of capacitance
30. area capacitance, inverter delays, 1 14.02.17 TLM1
31. cascaded inverters of drivers 1 15.02.17 TLM1
32. TUTORIAL-4 1 16.02.17 TLM3
33. Assignment/Quiz-2 1 17.02.17 TLM6
No. of classes required to complete UNIT-II 13 No. of classes taken:
UNIT-IIISubsystem Design
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
34. Introduction to Sub system design flow 1 18.02.17 TLM2
35. Adders- single bit adder schematic, , 1 28.02.17 TLM1
36. adder/ subtractor 1 01.03.17 TLM1
carry look ahead adder, carry save
37. 1 02.03.17 TLM2
adders
38. 4x4 array multiplier 1 03.03.17 TLM2
39. TUTORIAL-6 1 04.03.17 TLM3
Modified Booth’smultiplier,
40. 1 07.03.17 TLM2
serial/parallel multiplier
41. Shifters- design of 4x4 barrel shifter 1 08.03.17 TLM2
42. Parity generator using XOR gates 1 09.03.17 TLM1
43. XNOR based Comparator circuit 1 10.03.17 TLM1
44. Zero/One Detector 1 11.03.17 TLM1
45. TUTORIAL-7 1 14.03.17 TLM3
46. synchronous up/down counters 1 15.03.17 TLM2
47. Shift registers 1 16.03.17 TLM2
48. TUTORIAL-8 1 17.03.17 TLM3
49. Assignment/Quiz-3 1 18.03.17 TLM6
No. of classes required to complete UNIT-III 16 No. of classes taken:
UNIT-IV : System Design and Design Methods
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
50. CMOS design methods 1 21.03.17 TLM1
structured design
51. strategiesHierarchy,regularity 1 22.03.17 TLM1
modularity,
52. Behavioural RTL synthesis 1 23.03.17 TLM1
53. Structural to layout synthesis 1 24.03.17 TLM1
54. TUTORIAL-9 1 25.03.17 TLM3
55. placement and routing 1 29.03.17 TLM1
Example of an automatic placement
56. 1 30.03.17 TLM1
layout synthesis
57. HDL , schematic, layout design 1 31.03.17 TLM1
58. TUTORIAL-10 1 01.04.17 TLM3
59. floor planning, chip composition 1 04.04.17 TLM1
60. Circuit, logic, switch level simulation 1 05.04.17 TLM1
61. Timing verifiers, network isomorphism, 1 06.04.17 TLM1
net list comparison, layout extraction,
62. 1 07.04.17 TLM1
design rule verificationpattern gen
63. Assignment/Quiz-4 1 08.04.17 TLM6
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : CMOS Testing
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Need for testing- functionality tests,
64. 1 11.04.17 TLM1
manufacturing tests
65. Manufacturing TestPrinciples 1 12.04.17 TLM1
66. fault models, observability, 1 13.04.17 TLM1
67. Controllability, fault coverage 1 15.04.17 TLM1
68. TUTORIAL-11 1 18.04.17 TLM3
ATPG,Fault Grading,simulation
69. 1 19.04.17 TLM1
delay fault testing, statistical fault
70. 1 20.04.17 TLM1
analysis, fault sampling
71. DFT, Ad‐Hoc, scan based testing 1 21.04.17 TLM2
IDDQ testing, Chip level Test
72. 1 22.04.17 TLM2
Techniques
System-level Test Techniques-
73. 1 25.04.17 TLM2
boundaryscan ,improved testability
74. TUTORIAL-12 1 26.04.17 TLM3
75. Assignment/Quiz-5 1 27.04.17 TLM6
No. of classes required to complete UNIT-V 12 No. of classes taken:
Contents beyond the Syllabus
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
76. SUB-MICRON VLSI 1 28.04.17
77. IC using Nano meter sized transistor 1 29.04.17
Total no.of classes required to complete: No.of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
Sankranthi Holidays 09-01-2017 14-01-2017 1W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 07-05-2017 13-05-2017 1W
Semester End Examinations 14-05-2017 25-05-2017 2W
EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Dr. S.V.
JAGADEESH
Dr.S.V.JAGADESHCHANDRA Y.AMARBABU Dr.M.SUMAN Prof.B.RAMESHREDDY
CHANDRA

Module Research
Course Instructor Course Coordinator BOS Chairman&HOD
Coordinator Coordinator
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-B
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : S419 - VLSI DESIGN
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : K.RANI RUDRAMA
COURSE COORDINATOR : Dr. S.V. JAGADESH CHANDRA

COURSEOBJECTIVE: This course provides the knowledge on IC Fabrication


Technologies and gives a complete idea about combinational and sequential
sub system CMOS circuit designs used in VLSI Design. The course also
gives the complete information regarding design tools and CMOS testing
techniques.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand
semiconductor
technology and MOS
3 - 1 - - - - - - - - 1 2 3 -
fabrication process
2 Apply layout design
rules for NMOS,CMOS 3 - 2 - 3 1 - - - - - 1 2 3 -
logic circuit designs
3 Design sub systems
used in digital logic 1 - 3 - 2 1 - - - - - 2 2 3 -
systems
4 Design VLSI circuits
using Design tools and 1 - 3 - 3 1 - - - - - 1 2 3 -
Design methods
5 Apply CMOS testing
techniques to test 3 - - - 3 1 - - - - - 2 2 3 -
different digital designs

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Kamran Eshraghian, Eshraghian Dougles and A.Pucknell, Essentials of VLSI circuits
and systems, PHI Publishers, 2005.
2 Neil.H.E.Weste and Kamaran Eshraghian, Principles of CMOS VLSI Design (2/e),
Pearson Education Publishers, 3rdEdition.

BOS APPROVED REFERENCE BOOKS:


1 John .P. Uyemura, Introduction to VLSI Circuits and Systems, JohnWiley Publishers.
2 M.SZE, VLSI Technology,2ndEdition, TMH Publishers.
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : IC fabrication Technology
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Silicon semiconductor
1. 1 27.12.16 TLM2
technology,wafer processing
2. oxidation, epitaxy, lithography 1 29.12.16 TLM2
3. ion implantation, and diffusion 1 30.12.16 TLM2
4. NMOS C,MOS fabrication 1 31.12.16 TLM2
BI‐CMOS technology, Comparison
5. 1 02.01.17 TLM2
between CMOS and bipolar technologies
6. Electrical properties of MOS circuits 1 03.01.17 TLM1
saturated, non saturated regions of MOS
7. 1 05.01.17 TLM1
transistor
8. threshold voltage, body effect 1 06.01.17 TLM1
9. TUTORIAL-1 1 07.01.17 TLM3
10. trans conductance, output conductance 1 16.01.17 TLM1
11. figure of merit, pass transistor 1 17.01.17 TLM1
12. NMOS inverter, pull up to pull down ratio 1 19.01.17 TLM1
13. scaling factors of MOS devices 1 20.01.17 TLM1
14. TUTORIAL-2 1 21.01.17 TLM3
15. CMOS inverter 1 23.01.17 TLM1
16. latch up in CMOS circuits 1 24.01.17 TLM1
17. Assignment/Quiz-1 1 26.01.17 TLM6
No. of classes required to complete UNIT-I 17 No. of classes taken:
UNIT-II : VLSI Circuit Design Process
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
18. VLSI Design flow, MOS layers 1 27.01.17 TLM1
19. Stick diagrams‐MOS layers 1 28.01.17 TLM2
20. NMOS design style, 1 30.01.17 TLM2
21. CMOS design style 1 31.01.17 TLM2
22. lambda- based designrule 1 01.02.17 TLM2
design rules for contact cuts, CMOS
23. 1 03.02.17 TLM2
lambda based design rules
24. TUTORIAL-3 1 04.02.17 TLM3
layout diagrams for NMOS and CMOS
25. 1 06.02.17 TLM2
inverters and logic gates
Concepts of sheet resistance and
26. 1 07.02.17 TLM1
standard unit of capacitance
27. area capacitance, inverter delays, 1 08.02.17 TLM1
28. cascaded inverters of drivers 1 10.02.17 TLM1
29. TUTORIAL-4 1 13.02.17 TLM3
30. Assignment/Quiz-2 1 14.02.17 TLM6
No. of classes required to complete UNIT-II 13 No. of classes taken:
UNIT-III Subsystem Design
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
31. Introduction to Sub system design flow 1 16.02.17 TLM2
32. Adders- single bit adder schematic, , 1 17.02.17 TLM1
33. adder/ subtractor 1 18.02.17 TLM1
carry look ahead adder, carry save
34. 1 28.02.17 TLM2
adders
35. 4x4 array multiplier 1 02.03.17 TLM2
36. TUTORIAL-6 1 03.03.17 TLM3
Modified Booth’smultiplier,
37. 1 04.03.17 TLM2
serial/parallel multiplier
38. Shifters- design of 4x4 barrel shifter 1 06.03.17 TLM2
39. Parity generator using XOR gates 1 07.03.17 TLM1
40. XNOR based Comparator circuit 1 09.03.17 TLM1
41. Zero/One Detector 1 10.03.17 TLM1
42. TUTORIAL-7 1 11.03.17 TLM3
43. synchronous up/down counters 1 13.03.17 TLM2
44. Shift registers 1 14.03.17 TLM2
45. TUTORIAL-8 1 16.03.17 TLM3
46. Assignment/Quiz-3 1 17.03.17 TLM6
No. of classes required to complete UNIT-III 16 No. of classes taken:
UNIT-IV : System Design and Design Methods
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
47. CMOS design methods 1 18.03.17 TLM1
structured design strategies Hierarchy,
48. 1 20.03.17 TLM1
regularity modularity,
49. Behavioural RTL synthesis 1 21.03.17 TLM1
50. Structural to layout synthesis 1 23.03.17 TLM1
51. TUTORIAL-9 1 24.03.17 TLM3
52. placement and routing 1 25.03.17 TLM1
Example of an automatic placement
53. 1 27.03.17 TLM1
layout synthesis
54. HDL , schematic, layout design 1 28.03.17 TLM1
55. TUTORIAL-10 1 30.03.17 TLM3
56. floor planning, chip composition 1 31.03.17 TLM1
57. Circuit, logic, switch level simulation 1 01.04.17 TLM1
58. Timing verifiers, network isomorphism, 1 03.04.17 TLM1
net list comparison, layout extraction,
59. 1 04.04.17 TLM1
design rule verification pattern gen
60. Assignment/Quiz-4 1 07.04.17 TLM6
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : CMOS Testing
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Need for testing- functionality tests,
61. 1 08.04.17 TLM1
manufacturing tests
62. Manufacturing TestPrinciples 1 10.04.17 TLM1
63. fault models, observability, 1 11.04.17 TLM1
64. Controllability, fault coverage 1 12.04.17 TLM1
65. TUTORIAL-11 1 15.04.17 TLM3
ATPG, Fault Grading,simulation
66. 1 17.04.17 TLM1
delay fault testing, statistical fault
67. 1 18.04.17 TLM1
analysis, fault sampling
68. DFT, Ad‐Hoc, scan based testing 1 19.04.17 TLM2
IDDQ testing, Chip level Test
69. 1 21.04.17 TLM2
Techniques
System-level Test Techniques-
70. 1 22.04.17 TLM2
boundary scan ,improved testability
71. TUTORIAL-12 1 25.04.17 TLM3
72. Assignment/Quiz-5 1 27.04.17 TLM6
No. of classes required to complete UNIT-V 12 No. of classes taken:
Contents beyond the Syllabus
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
73. SUB-MICRON VLSI 1 28.04.17
74. IC using Nano meter sized transistor 1 29.04.17
Total no.of classes required to complete: No.of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study
ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
Sankranthi Holidays 09-01-2017 14-01-2017 1W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 07-05-2017 13-05-2017 1W
Semester End Examinations 14-05-2017 25-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

K.RANIRUDRAMA Dr.S.V.JAGADESHCHANDRA Y.AMARBABU Dr.M.SUMAN Prof.B.RAMESHREDDY


Module Research
Course Instructor Course Coordinator BOS Chairman&HOD
Coordinator Coordinator
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE., R14 Regulations
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : DS & OOP - S 176
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : S.Srinivasa Reddy, Asst.Prof
COURSE COORDINATOR : P.Ashok Reddy, Sr Asst.Prof

COURSE OBJECTIVE:
1. To understand fundamentals of programming such as variables, conditional and
iterative execution, methods, etc.
2. To understand the abstract data types stack, queue, de-queue, and list.
3. An understanding of the basic search and sort algorithms.
4. Understand fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries, etc
5. Have the ability to write computer programs to solve specified problems.
6. Be able to use the Java SDK environment to create, debug and run simple Java
programs.

COURSE ARTICULATION MATRIX(Correlation between Cos &POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Differentiate various
searching and sorting 3 2 2 2 1
algorithms.
2 Use Linear Data Structures
like stacks, queues and 3 2 2 2 1
linked lists
3 Employ OOP concepts in
JAVA. 3 2 2 2 1

4 choose an engineering
approach to solving
3 2 2 2 1
problems

5 propose the use of certain


java programming
concepts to solve the given 3 2 2 2 1
problems

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A. Forouzen,
cengage.
2 Herbert Schildt, “ The Complete Reference JAVA J2SE”. 7th Edition, TMH, new delhi,
2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia, 1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition, Pearson Education/
PHI, 2007.
COURSE DELIVERY PLAN (LESSON PLAN): Section-B
UNIT-I : Introduction to Data Structures Using C
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
155. Introduction to Data Structures 1 27.12.16 1

156. Course Outcomes 1 28.12.16 1


157. Linear and Data Structures 1 29.12.16 1
158. Non-Linear Data Structures 1 30.12.16 1
159. Introduction to Array 1 02.01.17 1,4,5
160. Searching Introduction 1 03.01.17 1,4,5
161. Linear Search 1 04.01.17 1,4,5
162. Binary Search 1 05.01.17 1,4,5
163. Sorting Introduction 1 06.01.17 1,4,5
164. Bubble sort 1 09.01.17 1,4,5
165. Selection sort 1 10.01.17 1,4,5
166. Insertion sort 1 11.01.17 1,4,5
167. Quick sort 1 12.01.17 1,4,5
168. Merge sort 1 16.01.17 1,4,5
169. TUTORIAL-2 1 17.01.17 1,3
170. Assignment/Quiz-1 1 18.01.17 1,6
No. of classes required to complete UNIT-I 16 No. of classes taken:
UNIT-II : Stack, Queue and Linked List
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
171. Introduction to UNIT-II 1 19.01.17 1,4,5
172. Stack definition 1 20.01.17 1,4,5
173. Representation 1 23.01.17 1,4,5
174. Operations on stack 1 24.01.17 1,4,5
175. Queue definition 1 25.01.17 1,4,5
176. Representation 1 27.01.17 1,4,5
177. Operations on Queue 1 30.01.17 1,4,5
178. Circular queue Representation 1 31.01.17 1,4,5
179. Operations on Circular queue 1 01.02.17 1,4,5
180. DE queue Representation 1 02.02.17 1,3
181. Operations on DE Queue 1 03.02.17 1,6
182. Tutorial 1 06.02.17 1,4,5
183. Introduction to Linked List 1 07.02.17 1,4,5
184. Single linked list definition 1 08.02.17 1,4,5
185. Representation 1 09.02.17 1,4,5
186. Operations on Single linked list 1 10.02.17 1,4,5
13.02.17
187. Double linked list definition 1 1,4,5
14.02.17
188. Representation 1 1,4,5
15.02.17
189. Operations on Double linked list 1 1,4,5
16.02.17
190. Tutorial 1 1,3
17.02.17
191. Assignment/Quiz-1 1 1,6
No. of classes required to complete UNIT-II 22 No. of classes taken:
UNIT-III : Introduction to Object Oriented Programming
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
192. Introduction to UNIT-III 1 28.02.17 1,4,5
193. OOPS paradigm, OOPS principles 1 01.03.17 1,4,5
Merits of OOP languages, Demerits of
194. 1 02.03.17 1,4,5
POP
Introduction to JAVA, History of
195. 1 03.03.17 1,4,5
JAVA
196. Features of JAVA 1 06.03.17 1,4,5
197. JVM, garbage collection 1 07.03.17 1,4,5
198. JAVA Importance for Internet 1 08.03.17 1,4,5
199. Programming concepts of JAVA 1 09.03.17 1,4,5
200. Identifiers and Keywords 1 10.03.17 1,4,5
201. Tutorial 1 13.03.17 1,4,5
202. Data types 1 14.03.17 1,4,5
203. Variables , expressions 1 15.03.17 1,4,5
204. operators 1 16.03.17 1,4,5
205. Control statements 1 17.03.17 1,4,5
206. TUTORIAL-8 1 20.03.17 1,3
207. Assignment/Quiz-3 1 21.03.17 1,6
No. of classes required to complete UNIT-III 17 No. of classes taken:

UNIT-IV : Objects and Classes, Polymorphism


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to classes, methods,
208. 1 22.03.17 1,4,5
Access controls
209. Static data, static methods 1 23.03.17 1,4,5
210. Pass by value , pass by reference 1 24.03.17 1,4,5
211. Constructors, finalization 1 27.03.17 1,4,5
212. Introduction to inheritance 1 29.03.17 1,4,5
213. Sub classes, super classes 1 30.03.17 1,4,5
214. Types of inheritance 1 31.03.17 1,4,5
215. This, super, final keywords 1 03.04.17 1,4,5
216. Scope rules, command line arguments 1 04.04.17 1,4,5
Abstract classes, interfaces, Inner
217. 1 05.04.17 1,4,5
classes
Concept of polymorphism, Compile
218. time polymorphism: method 1 06.04.17 1,4,5
overloading, method overriding
219. Constructor overloading 1 07.04.17 1,4,5
Runtime polymorphism: dynamic
220. 1 10.04.17 1,4,5
method dispatch
221. Tutorial 1 11.04.17 1,3
222. Assignment/Quiz-4 1 12.04.17 1,6
No. of classes required to complete UNIT-IV 16 No. of classes taken:
UNIT-V : Packages, Exception Handling, Multi Threading
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Packages, packages
223. 1 13.04.17 1,4,5
access
224. Importing packages and classes 1 17.04.17 1,4,5
225. User defined packages, class-path 1 18.04.17 1,4,5
226. Types of exceptions 1 19.04.17 1,4,5
Try, catch, throw and finally
227. 1 20.04.17 1,4,5
keywords
User defined exception handling
228. 1 21.04.17 1,4,5
mechanism
Introduction to multithreading:
229. 1 24.04.17 1,4,5
processes and threads
Thread states, thread life cycle,
230. 1 25.04.17 1,4,5
properties
Thread synchronization, interrupting
231. 1 26.04.17 1,4,5
threads
Thread groups, inter thread
232. 1 27.04.17 1,4,5
communication, daemon thread
233. Assignment/Quiz-5 1 28.04.17 1,6
No. of classes required to complete UNIT-V 12 No. of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practical 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

S. Srinivasa Reddy P.Ashok Reddy S.Siva Rama Krishna I Rajendra Kumar Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE., R14 Regulations
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Data Structures & Object Oriented Programming - S 176

L-T-P STRUCTURE : 4-1-0


COURSE CREDITS :3
COURSE INSTRUCTOR : S.Srinivasa Reddy, Asst.Prof
COURSE COORDINATOR : P.Ashok Reddy, Sr Asst.Prof

COURSE OBJECTIVE:
7. To understand fundamentals of programming such as variables, conditional and
iterative execution, methods, etc.
8. To understand the abstract data types stack, queue, de-queue, and list.
9. An understanding of the basic search and sort algorithms.
10. Understand fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries, etc
11. Have the ability to write a computer program to solve specified problems.
12. Be able to use the Java SDK environment to create, debug and run simple Java
programs.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Differentiate various
searching and sorting 3 2 2 2 1
algorithms.
2 Use Linear Data Structures
like stacks, queues and 3 2 2 2 1
linked lists
3 Employ OOP concepts in
JAVA. 3 2 2 2 1

4 choose an engineering
approach to solving
3 2 2 2 1
problems

5 propose the use of certain


java programming
concepts to solve the given 3 2 2 2 1
problems

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A. Forouzen,
cengage.
2 Herbert Schildt, “ The Complete Reference JAVA J2SE”. 7th Edition, TMH, new delhi,
2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia, 1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition, Pearson Education/
PHI, 2007.

COURSE DELIVERY PLAN (LESSON PLAN): Section-C


UNIT-I : Introduction to Data Structures Using C
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
234. Introduction to Data Structures 1 27.12.16 1

235. Course Outcomes 1 28.12.16 1


236. Linear and Data Structures 1 29.12.16 1
237. Non-Linear Data Structures 1 31.12.16 1
238. Introduction to Array 1 02.01.17 1,4,5
239. Searching Introduction 1 03.01.17 1,4,5
240. Linear Search 1 04.01.17 1,4,5
241. Binary Search 1 05.01.17 1,4,5
242. Sorting Introduction 1 07.01.17 1,4,5
243. Bubble sort 1 09.01.17 1,4,5
244. Selection sort 1 10.01.17 1,4,5
245. Insertion sort 1 11.01.17 1,4,5
246. Quick sort 1 12.01.17 1,4,5
247. Merge sort 1 16.01.17 1,4,5
248. TUTORIAL-2 1 17.01.17 1,3
249. Assignment/Quiz-1 1 18.01.17 1,6
No. of classes required to complete UNIT-I 16 No. of classes taken:
UNIT-II : Stack, Queue and Linked List
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
250. Introduction to UNIT-II 1 19.01.17 1,4,5
251. Stack definition 1 21.01.17 1,4,5
252. Representation 1 23.01.17 1,4,5
253. Operations on stack 1 24.01.17 1,4,5
254. Queue definition 1 25.01.17 1,4,5
255. Representation 1 28.01.17 1,4,5
256. Operations on Queue 1 30.01.17 1,4,5
257. Circular queue Representation 1 31.01.17 1,4,5
258. Operations on Circular queue 1 01.02.17 1,4,5
259. DE queue Representation 1 02.02.17 1,3
260. Operations on DE Queue 1 04.02.17 1,6
261. Tutorial 1 06.02.17 1,4,5
262. Introduction to Linked List 1 07.02.17 1,4,5
263. Single linked list definition 1 08.02.17 1,4,5
264. Representation 1 09.02.17 1,4,5
265. Operations on Single linked list 1 10.02.17 1,4,5
13.02.17
266. Double linked list definition 1 1,4,5
14.02.17
267. Representation 1 1,4,5
15.02.17
268. Operations on Double linked list 1 1,4,5
16.02.17
269. Tutorial 1 1,3
18.02.17
270. Assignment/Quiz-1 1 1,6
No. of classes required to complete UNIT-II 22 No. of classes taken:
UNIT-III : Introduction to Object Oriented Programming
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
271. Introduction to UNIT-III 1 28.02.17 1,4,5
272. OOPS paradigm, OOPS principles 1 01.03.17 1,4,5
Merits of OOP languages, Demerits of
273. 1 02.03.17 1,4,5
POP
Introduction to JAVA, History of
274. 1 04.03.17 1,4,5
JAVA
275. Features of JAVA 1 06.03.17 1,4,5
276. JVM, garbage collection 1 07.03.17 1,4,5
277. JAVA Importance for Internet 1 08.03.17 1,4,5
278. Programming concepts of JAVA 1 09.03.17 1,4,5
279. Identifiers and Keywords 1 11.03.17 1,4,5
280. Tutorial 1 13.03.17 1,4,5
281. Data types 1 14.03.17 1,4,5
282. Variables , expressions 1 15.03.17 1,4,5
283. operators 1 16.03.17 1,4,5
284. Control statements 1 18.03.17 1,4,5
285. TUTORIAL-8 1 20.03.17 1,3
286. Assignment/Quiz-3 1 21.03.17 1,6
No. of classes required to complete UNIT-III 17 No. of classes taken:

UNIT-IV : Objects and Classes, Polymorphism


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to classes, methods,
287. 1 22.03.17 1,4,5
Access controls
288. Static data, static methods 1 23.03.17 1,4,5
289. Pass by value , pass by reference 1 25.03.17 1,4,5
290. Constructors, finalization 1 27.03.17 1,4,5
291. Introduction to inheritance 1 29.03.17 1,4,5
292. Sub classes, super classes 1 30.03.17 1,4,5
293. Types of inheritance 1 01.03.17 1,4,5
294. This, super, final keywords 1 03.04.17 1,4,5
295. Scope rules, command line arguments 1 04.04.17 1,4,5
Abstract classes, interfaces, Inner
296. 1 05.04.17 1,4,5
classes
Concept of polymorphism, Compile
297. time polymorphism: method 1 06.04.17 1,4,5
overloading, method overriding
298. Constructor overloading 1 08.04.17 1,4,5
Runtime polymorphism: dynamic
299. 1 10.04.17 1,4,5
method dispatch
300. Tutorial 1 11.04.17 1,3
301. Assignment/Quiz-4 1 12.04.17 1,6
No. of classes required to complete UNIT-IV 16 No. of classes taken:
UNIT-V : Packages, Exception Handling, Multi Threading
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Packages, packages
302. 1 13.04.17 1,4,5
access
303. Importing packages and classes 1 17.04.17 1,4,5
304. User defined packages, class-path 1 18.04.17 1,4,5
305. Types of exceptions 1 19.04.17 1,4,5
Try, catch, throw and finally
306. 1 20.04.17 1,4,5
keywords
User defined exception handling
307. 1 22.04.17 1,4,5
mechanism
Introduction to multithreading:
308. 1 24.04.17 1,4,5
processes and threads
Thread states, thread life cycle,
309. 1 25.04.17 1,4,5
properties
Thread synchronization, interrupting
310. 1 26.04.17 1,4,5
threads
Thread groups, inter thread
311. 1 27.04.17 1,4,5
communication, daemon thread
312. Assignment/Quiz-5 1 29.04.17 1,6
No. of classes required to complete UNIT-V 12 No. of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

S. Srinivasa Reddy P.Ashok Reddy S.Siva Rama Krishna I Rajendra Kumar Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Digital Image Processing - S190
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr. M K Linga Murthy
COURSE COORDINATOR : Mr. M K Linga Murthy
COURSE OBJECTIVE:
This course provides the fundamental concepts of Digital Image
Processing. The mathematical models of various 2D Image Transforms will
be introduced. The basics of Image enhancement and restoration in spatial
and frequency domain will be presented. The knowledge about compression
and segmentation will be studied. The basics of color image processing will
be learnt.

COURSE ARTICULATION MATRIX(Correlation between Cos &POs,


PSOs):
Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Summarize the
fundamentals of Digital 3 - 2 - - - - - - - - - - - 3
Image Processing
2 Design mathematical
models for various 3 - 2 - - - - - - - - - - - 3
Images Transforms
3 Analyze image
enhancement techniques
in spatial and frequency
- - 3 - - - - - - - - - - - 3
domain
4 Describe the concepts of
restoration and color - - 3 2 - - - - - - - - 1 - 3
image processing
5 Evaluate various
segmentation and - - 3 - - - - - - - - - 1 - 3
compression techniques.

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 R.C.Gonzalez and R.E.Woods, Digital Image Processing, Addison Wesley/ Pearson
education, 3rd Edition, 2002

BOS APPROVED REFERENCE BOOKS:


1 AnilK.Jain Jain,”Fundamnetals of Digital Image Processing’, PHI Publications.
2 William J Pratt, “ Digital Image Processing, John Wiley & Sons
3 Tinku Acharya, Ajoy K Ray,”Image ProcessingPrinciples and applications, Wiley-Inter
Science
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : Introduction
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. General interaction 1 28.12.16
2. Introduction to the course 1 29.12.16
3. Scope of the course 1 30.12.16
4. Course outcomes 1 31.12.16
5. Unit-1:2D function & Basic definitions 1 02.01.17
Digital image definition & Various steps 04.01.17
6. 2
in image processing 05.01.17
Components of Image processing
7. 1 06.01.17
system
8. Applications of Image Processing 1 07.01.17
Structure of Human Eye & Image
9. 1 09.01.17
formation
10. Sampling & Quantization 1 11.01.17
11. TUTORIAL-1 1 12.01.17
Digital image representation , Spatial
12. 1 16.01.17
Resolution
Intensity Resolution, Relationships
13. 1 18.01.17
between Pixels, Distance measures
14. TUTORIAL-2 1 19.01.17
No. of classes required to complete UNIT-I 15 No. of classes taken:

UNIT-II : Image Transforms


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15. Introduction to UNIT-II 1 20.01.17
16. 2D orthogonal & Unitary Transforms 1 21.01.17
23.01.17
17. Properties of Unitary transforms 2
25.01.17
18. 2D DFT & Properties 1 27.01.17
28.01.17
19. Cosine Transform & Properties 2
30.01.17
20. TUTORIAL-3 1 01.02.17
02.02.17
21. Hadamard Transform & Properties 2
03.02.17
22. Haar Transform & Properties 1 04.02.17
23. Slant Transform & Properties 1 06.02.17
24. TUTORIAL-4 1 08.02.17
No. of classes required to complete UNIT-II 13 No. of classes taken:
UNIT-III : Image Enhancement in Spatial and frequency domain
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
25. Spatial Domain Enhancement 1 09.02.17
Point Processing: Intensity 10.02.17
26. 1
Transformation functions
Piecewise linear Transformation 13.02.17
27. 1
functions
15.02.17
28. Histogram & its types 2
16.02.17
29. TUTORIAL-5 1 17.02.17
Basics of spatial filtering & Smoothing 18.02.17
30. 1
spatial filters
01.03.17
31. Sharpening spatial filters 2
02.03.17
Unsharp masking & High boost 03.03.17
32. 1
filtering
Introduction to Filtering in frequency 04.03.17
33. 1
domain
34. Image smoothing in frequency domain 1 06.03.17
35. Image sharpeing in frequency domain 1 08.03.17
36. TUTORIAL-6 1 09.03.17
37. Laplacian in the Frequency domain 1 10.03.17
No. of classes required to complete UNIT-III 15 No. of classes taken:

UNIT-IV : Image Restoration & Color Image Processing


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Image restoration & degradation 13.03.17
38. 1
model
39. Noise models 1 15.03.17
Restoration in the presence of noise 16.03.17
40. 2
using spatial filtering 17.03.17
41. Inverse Filtering 1 18.03.17
42. MMSE filtering 1 20.03.17
43. Constrained least square filtering 1 22.03.17
44. Tutorial -7 1 23.03.17
45. Color fundamentals 1 24.03.17
46. Color Models 1 25.03.17
47. Pseudo Color processing 1 27.03.17
48. Basics of full color image processing 1 29.03.17
49. Histogram Processing 1 30.03.17
50. Tutorial -8 1 31.03.17
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : Image Compression & Image Segmentation
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
51. Introduction to UNIT-V 1 01.04.17
Coding redundancy , Spatial 03.04.17
52. Redundancy & Temporal redundancy, 1
Fidelity Criteria
53. Image compression model 1 06.04.17
54. Error free compression 1 07.04.17
55. Huffman & Arithmetic coding 1 08.04.17
LZW , Bit plane and run length 10.04.17
56. 1
coding
57. Lossless & Lossy predictive coding 1 12.04.17
58. Tutorial-09 1 13.04.17
59. Detection of discontinuities 1 17.04.17
60. Edge Detection 1 19.04.17
Edge detection & Boundary detection, 20.04.17
61. 1
Local processing
Global Processing via Hough 21.04.17
62. 1
transformation
Global Processing via Graph theoretic 22.04.17
63. 1
techniques
64. Threshoding - Introduction 1 24.04.17
Region Growing Region splitting & 26.04.17
65. 1
merging
66. Tutorial – 10 1 27.04.17
No. of classes required to complete UNIT-V 18 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
67. Morphological operations 1 28.04.17
Image processing in Computer 29.04.17
68. 1
Vision, Video Processing.

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study
ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr, M K Linga Murthy Mr M K Linga Murthy Mr.T.Anil Raju Dr.E,V.Krishna Rao Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Digital Image Processing - S190
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr. M K Linga Murthy
COURSE COORDINATOR : Mr. M K Linga Murthy
COURSE OBJECTIVE:
This course provides the fundamental concepts of Digital Image
Processing. The mathematical models of various 2D Image Transforms will
be introduced. The basics of Image enhancement and restoration in spatial
and frequency domain will be presented. The knowledge about compression
and segmentation will be studied. The basics of color image processing will
be learnt.

COURSE ARTICULATION MATRIX(Correlation between Cos &POs,


PSOs):
Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Summarize the
fundamentals of Digital 3 - 2 - - - - - - - - - - - 3
Image Processing
2 Design mathematical
models for various 3 - 2 - - - - - - - - - - - 3
Images Transforms
3 Analyze image
enhancement techniques
in spatial and frequency
- - 3 - - - - - - - - - - - 3
domain
4 Describe the concepts of
restoration and color - - 3 2 - - - - - - - - 1 - 3
image processing
5 Evaluate various
segmentation and - - 3 - - - - - - - - - 1 - 3
compression techniques.

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 R.C.Gonzalez and R.E.Woods, Digital Image Processing, Addison Wesley/ Pearson
education, 3rd Edition, 2002

BOS APPROVED REFERENCE BOOKS:


1 AnilK.Jain Jain,”Fundamnetals of Digital Image Processing’, PHI Publications.
2 William J Pratt, “ Digital Image Processing, John Wiley & Sons
3 Tinku Acharya, Ajoy K Ray,”Image ProcessingPrinciples and applications, Wiley-Inter
Science
COURSE DELIVERY PLAN (LESSON PLAN): Section-B
UNIT-I : Introduction
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. General interaction 1 27.12.16
2. Introduction to the course 1 28.12.16
3. Scope of the course 1 29.12.16
4. Course outcomes 1 30.12.16
5. Unit-1:2D function & Basic definitions 1 02.01.17
Digital image definition & Various steps 03.01.17
6. 2
in image processing 04.01.17
Components of Image processing
7. 1 05.01.17
system
8. Applications of Image Processing 1 06.01.17
Structure of Human Eye & Image
9. 1 09.01.17
formation
10. Sampling & Quantization 1 10.01.17
11. TUTORIAL-1 1 11.01.17
Digital image representation , Spatial
12. 1 12.01.17
Resolution
Intensity Resolution, Relationships
13. 1 16.01.17
between Pixels, Distance measures
14. TUTORIAL-2 1 17.01.17
No. of classes required to complete UNIT-I 15 No. of classes taken:

UNIT-II : Image Transforms


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15. Introduction to UNIT-II 1 18.01.17
16. 2D orthogonal & Unitary Transforms 1 19.01.17
20.01.17
17. Properties of Unitary transforms 2
23.01.17
18. 2D DFT & Properties 1 24.01.17
25.01.17
19. Cosine Transform & Properties 2
27.01.17
20. TUTORIAL-3 1 30.01.17
31.01.17
21. Hadamard Transform & Properties 2
01.02.17
22. Haar Transform & Properties 1 02.02.17
23. Slant Transform & Properties 1 03.02.17
24. TUTORIAL-4 1 06.02.17
No. of classes required to complete UNIT-II 13 No. of classes taken:
UNIT-III : Image Enhancement in Spatial and frequency domain
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
25. Spatial Domain Enhancement 1 07.02.17
Point Processing: Intensity 08.02.17
26. 1
Transformation functions
Piecewise linear Transformation 09.02.17
27. 1
functions
10.02.17
28. Histogram & its types 2
13.02.17
29. TUTORIAL-5 1 14.02.17
Basics of spatial filtering & Smoothing 15.02.17
30. 1
spatial filters
16.02.17
31. Sharpening spatial filters 2
17.02.17
Unsharp masking & High boost 28.02.17
32. 1
filtering
Introduction to Filtering in frequency 01.03.17
33. 1
domain
34. Image smoothing in frequency domain 1 02.03.17
35. Image sharpeing in frequency domain 1 03.03.17
36. TUTORIAL-6 1 06.03.17
37. Laplacian in the Frequency domain 1 07.03.17
No. of classes required to complete UNIT-III 15 No. of classes taken:

UNIT-IV : Image Restoration & Color Image Processing


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Image restoration & degradation 08.03.17
38. 1
model
39. Noise models 1 09.03.17
Restoration in the presence of noise 10.03.17
40. 2
using spatial filtering 13.03.17
41. Inverse Filtering 1 14.03.17
42. MMSE filtering 1 15.03.17
43. Constrained least square filtering 1 16.03.17
44. Tutorial -7 1 17.03.17
45. Color fundamentals 1 20.03.17
46. Color Models 1 21.03.17
47. Pseudo Color processing 1 22.03.17
48. Basics of full color image processing 1 23.03.17
49. Histogram Processing 1 24.03.17
50. Tutorial -8 1 27.03.17
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : Image Compression & Image Segmentation
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
51. Introduction to UNIT-V 1 29.03.17
Coding redundancy , Spatial 30.03.17
52. Redundancy & Temporal redundancy, 2 31.03.17
Fidelity Criteria
53. Image compression model 1 03.04.17
54. Error free compression 1 04.04.17
55. Huffman & Arithmetic coding 1 06.04.17
LZW , Bit plane and run length 07.04.17
56. 1
coding
57. Lossless & Lossy predictive coding 1 10.04.17
58. Tutorial-09 1 11.04.17
59. Detection of discontinuities 1 12.04.17
60. Edge Detection 1 13.04.17
Edge detection & Boundary detection, 17.04.17
61. 1
Local processing
Global Processing via Hough 18.04.17
62. 1
transformation
Global Processing via Graph theoretic 19.04.17
63. 1
techniques
64. Threshoding - Introduction 1 20.04.17
Region Growing Region splitting & 21.04.17
65. 2
merging 24.04.17
66. Tutorial – 10 1 25.04.17
No. of classes required to complete UNIT-V 20 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
67. Morphological operations 1 26.04.17
Image processing in Computer 27.04.17
68. 2
Vision, Video Processing. 28.04.17

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study
ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr, M K Linga Murthy Mr M K Linga Murthy Mr.T.Anil Raju Dr.E,V.Krishna Rao Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Digital Image Processing - S190
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr. G.L.N.Murthy
COURSE COORDINATOR : Mr. M K Linga Murthy
COURSE OBJECTIVE:
This course provides the fundamental concepts of Digital Image
Processing. The mathematical models of various 2D Image Transforms will
be introduced. The basics of Image enhancement and restoration in spatial
and frequency domain will be presented. The knowledge about compression
and segmentation will be studied. The basics of color image processing will
be learnt.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Summarize the
fundamentals of Digital 3 - 2 - - - - - - - - - - - 3
Image Processing
2 Design mathematical
models for various 3 - 2 - - - - - - - - - - - 3
Images Transforms
3 Analyze image
enhancement techniques
in spatial and frequency
- - 3 - - - - - - - - - - - 3
domain
4 Describe the concepts of
restoration and color - - 3 2 - - - - - - - - 1 - 3
image processing
5 Evaluate various
segmentation and - - 3 - - - - - - - - - 1 - 3
compression techniques.

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 R.C.Gonzalez and R.E.Woods, Digital Image Processing, Addison Wesley/ Pearson
education, 3rd Edition, 2002

BOS APPROVED REFERENCE BOOKS:


1 AnilK.Jain Jain,”Fundamnetals of Digital Image Processing’, PHI Publications.
2 William J Pratt, “ Digital Image Processing, John Wiley & Sons
3 Tinku Acharya, Ajoy K Ray,”Image ProcessingPrinciples and applications, Wiley-Inter
Science
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : Introduction
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. General interaction 1 27.12.16
2. Introduction to the course 1 28.12.16
3. Scope of the course 1 29.12.16
4. Course outcomes 1 31.12.16
5. Unit-1:2D function & Basic definitions 1 02.01.17
Digital image definition & Various steps 03.01.17
6. 2
in image processing 04.01.17
Components of Image processing 05.01.17
7. 2
system 07.01.17
8. Applications of Image Processing 1 09.01.17
Structure of Human Eye & Image
9. 1 10.01.17
formation
10. Sampling & Quantization 1 11.01.17
11. TUTORIAL-I 1 12.01.17
Digital image representation , Spatial
12. 1 16.01.17
Resolution
Intensity Resolution, Relationships 17.01.17
13. 2
between Pixels, Distance measures 18.01.17
14. TUTORIAL-II 1 19.01.17
No. of classes required to complete UNIT-I 17 No. of classes taken:

UNIT-II : Image Transforms


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15. Introduction to UNIT-II 1 21.01.17
16. 2D orthogonal & Unitary Transforms 1 23.01.17
24.01.17
17. Properties of Unitary transforms 2
25.01.17
18. 2D DFT & Properties 1 28.01.17
30.01.17
19. Cosine Transform & Properties 2
31.01.17
20. TUTORIAL-III 1 01.02.17
02.02.17
21. Hadamard Transform & Properties 2
04.02.17
22. Haar Transform & Properties 1 06.02.17
23. Slant Transform & Properties 1 07.02.17
24. TUTORIAL-IV 1 08.02.17
No. of classes required to complete UNIT-II 13 No. of classes taken:

UNIT-III : Image Enhancement in Spatial and frequency domain


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
25. Spatial Domain Enhancement 1 09.02.17
Point Processing: Intensity 13.02.17
26. 1
Transformation functions
Piecewise linear Transformation 14.02.17
27. 1
functions
15.02.17
28. Histogram & its types 1

29. TUTORIAL-V 1 16.02.17


Basics of spatial filtering & Smoothing 18.02.17
30. 1
spatial filters
28.02.17
31. Sharpening spatial filters 2
01.03.17
Unsharp masking & High boost 02.03.17
32. 1
filtering
Introduction to Filtering in frequency 04.03.17
33. 1
domain
34. Image smoothing in frequency domain 1 06.03.17
35. Image sharpeing in frequency domain 1 07.03.17
36. TUTORIAL-VI 1 08.03.17
37. Laplacian in the Frequency domain 1 09.03.17
No. of classes required to complete UNIT-III 14 No. of classes taken:

UNIT-IV : Image Restoration & Color Image Processing


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Image restoration & degradation 13.03.17
38. 1
model
39. Noise models 1 14.03.17
Restoration in the presence of noise 15.03.17
40. 1
using spatial filtering
41. TUTORIAL-VII 1 16.03.17
42. Inverse Filtering 1 18.03.17
43. MMSE filtering 1 20.03.17
44. Constrained least square filtering 1 21.03.17
45. TUTORIAL-VIII 1 22.03.17
46. Color fundamentals 1 23.03.17
47. Color Models 1 25.03.17
48. Pseudo Color processing 1 27.03.17
49. Basics of full color image processing 1 29.03.17
50. Histogram Processing 1 30.03.17
51. TUTORIAL-IX 1 01.04.17
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : Image Compression & Image Segmentation
No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
52. Introduction to UNIT-V 1 03.04.17
Coding redundancy , Spatial 04.04.17
53. Redundancy & Temporal redundancy, 1
Fidelity Criteria
54. Image compression model 1 06.04.17
55. Error free compression 1 10.04.17
56. Huffman & Arithmetic coding 1 11.04.17
57. TUTORIAL-X 1 12.04.17
LZW , Bit plane and run length 13.04.17
58. 1
coding
59. Lossless & Lossy predictive coding 1 15.04.17
60. TUTORIAL-XI 1 17.04.17
61. Detection of discontinuities 1 18.04.17
62. Edge Detection 1 19.04.17
Edge detection & Boundary detection, 20.04.17
63. 1
Local processing
Global Processing via Hough 22.04.17
64. 1
transformation
Global Processing via Graph theoretic 24.04.17
65. 1
techniques
66. Threshoding - Introduction 1 25.04.17
Region Growing Region splitting & 26.04.17
67. 1
merging
68. TUTORIAL-XII 1 27.04.17
No. of classes required to complete UNIT-V 17 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S. No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Image processing in Computer 29.04.17
69. 1
Vision, Video Processing.

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study
ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr, G.L.N. Murthy Mr.M.K.Linga.Murthy Mr.T.Anil Raju Dr.E,V.Krishna Rao Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING
(Autonomous)
L.B.Reddy Nagar, Mylavaram – 521 230. Andhra Pradesh, INDIA
Affiliated to JNTUK, Kakinada & Approved by AICTE New Delhi
Accredited by NBA, New Delhi & certified by ISO 9001:2008
http://www.lbrce.ac.in
COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE., R14 Regulations
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Data Structures & Object Oriented Programming - S 176

L-T-P STRUCTURE : 4-1-0


COURSE CREDITS :3
COURSE INSTRUCTOR : P.Ashok Reddy, Sr.Asst.Prof
COURSE COORDINATOR : P.Ashok Reddy, Sr Asst.Prof

COURSE OBJECTIVE:
13. To understand fundamentals of programming such as variables, conditional and
iterative execution, methods, etc.
14. To understand the abstract data types stack, queue, de-queue, and list.
15. An understanding of the basic search and sort algorithms.
16. Understand fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries, etc
17. Have the ability to write a computer program to solve specified problems.
18. Be able to use the Java SDK environment to create, debug and run simple Java
programs.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Implement various
searching and sorting
algorithms.
2 Understand and
implement stacks and
queues using arrays, linked
list implementation.
3 Implement OOP concepts
in JAVA.

4 Know how we work with


grouping of objects,
concurrent execution and
how we handle dynamic
activities.

5 Understand the
importance of packages
and Exception handling
and will have the ability to
implement them as per
real time scenarios.
Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’
1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A. Forouzen,
cengage.
2 Herbert Schildt, “ The Complete Reference JAVA J2SE”. 7th Edition, TMH, new delhi,
2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia, 1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition, Pearson Education/
PHI, 2007.

COURSE DELIVERY PLAN (LESSON PLAN): Section-A


UNIT-I : Introduction to Data Structures Using C
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
313. Introduction to Data Structures 1 28.12.16 1

314. Course Outcomes 1 28.12.16 1


315. Linear and Data Structures 1 29.12.16 1
316. Non-Linear Data Structures 1 29.12.16 1
317. Introduction to Array 1 30.12.16 1,4,5
318. Searching Introduction 1 31.12.16 1,4,5
319. Linear Search 1 31.12.16 1,4,5
320. Binary Search 1 02.01.17 1,4,5
321. Sorting Introduction 1 04.01.17 1,4,5
322. Bubble sort 1 05.01.17 1,4,5
323. Selection sort 1 06.01.17 1,4,5
324. Insertion sort 1 08.01.17 1,4,5
325. Quick sort 1 10.01.17 1,4,5
326. Merge sort 1 11.01.17 1,4,5
327. TUTORIAL-2 1 11.01.17 1,3
328. Assignment/Quiz-1 1 12.01.17 1,6
No. of classes required to complete UNIT-I 16 No. of classes taken:
UNIT-II : Stack, Queue and Linked List
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
329. Introduction to UNIT-II 1 18.01.17 1,4,5
330. Stack definition 1 18.01.17 1,4,5
331. Representation 1 19.01.17 1,4,5
332. Operations on stack 1 19.01.17 1,4,5
333. Queue definition 1 20.01.17 1,4,5
334. Representation 1 20.01.17 1,4,5
335. Operations on Queue 1 21.01.17 1,4,5
336. Circular queue Representation 1 25.01.17 1,4,5
337. Operations on Circular queue 1 27.01.17 1,4,5
338. DE queue Representation 1 30.01.17 1,3
339. Operations on DE Queue 1 01.02.17 1,6
340. Tutorial 1 02.02.17 1,4,5
341. Introduction to Linked List 1 03.02.17 1,4,5
342. Single linked list definition 1 04.02.17 1,4,5
343. Representation 1 06.02.17 1,4,5
344. Operations on Single linked list 1 08.02.17 1,4,5
10.02.17
345. Double linked list definition 1 1,4,5
10.02.17
346. Representation 1 1,4,5
13.02.17
347. Operations on Double linked list 1 1,4,5
16.02.17
348. Tutorial 1 1,3
17.02.17
349. Assignment/Quiz-1 1 1,6
No. of classes required to complete UNIT-II 22 No. of classes taken:
UNIT-III : Introduction to Object Oriented Programming
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
350. Introduction to UNIT-III 1 27.02.17 1,4,5
351. OOPS paradigm, OOPS principles 1 01.03.17 1,4,5
Merits of OOP languages, Demerits of
352. 1 02.03.17 1,4,5
POP
Introduction to JAVA, History of
353. 1 04.03.17 1,4,5
JAVA
354. Features of JAVA 1 06.03.17 1,4,5
355. JVM, garbage collection 1 08.03.17 1,4,5
356. JAVA Importance for Internet 1 08.03.17 1,4,5
357. Programming concepts of JAVA 1 09.03.17 1,4,5
358. Identifiers and Keywords 1 11.03.17 1,4,5
359. Tutorial 1 13.03.17 1,4,5
360. Data types 1 15.03.17 1,4,5
361. Variables , expressions 1 15.03.17 1,4,5
362. operators 1 16.03.17 1,4,5
363. Control statements 1 18.03.17 1,4,5
364. TUTORIAL-8 1 20.03.17 1,3
365. Assignment/Quiz-3 1 20.03.17 1,6
No. of classes required to complete UNIT-III 17 No. of classes taken:

UNIT-IV : Objects and Classes, Polymorphism


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
366. Introduction to classes, methods, 1 22.03.17 1,4,5
Access controls
367. Static data, static methods 1 23.03.17 1,4,5
368. Pass by value , pass by reference 1 25.03.17 1,4,5
369. Constructors, finalization 1 27.03.17 1,4,5
370. Introduction to inheritance 1 29.03.17 1,4,5
371. Sub classes, super classes 1 30.03.17 1,4,5
372. Types of inheritance 1 01.03.17 1,4,5
373. This, super, final keywords 1 03.04.17 1,4,5
374. Scope rules, command line arguments 1 04.04.17 1,4,5
Abstract classes, interfaces, Inner
375. 1 05.04.17 1,4,5
classes
Concept of polymorphism, Compile
376. time polymorphism: method 1 06.04.17 1,4,5
overloading, method overriding
377. Constructor overloading 1 08.04.17 1,4,5
Runtime polymorphism: dynamic
378. 1 10.04.17 1,4,5
method dispatch
379. Tutorial 1 11.04.17 1,3
380. Assignment/Quiz-4 1 12.04.17 1,6
No. of classes required to complete UNIT-IV 16 No. of classes taken:
UNIT-V : Packages, Exception Handling, Multi Threading
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Packages, packages
381. 1 13.04.17 1,4,5
access
382. Importing packages and classes 1 17.04.17 1,4,5
383. User defined packages, class-path 1 18.04.17 1,4,5
384. Types of exceptions 1 19.04.17 1,4,5
Try, catch, throw and finally
385. 1 20.04.17 1,4,5
keywords
User defined exception handling
386. 1 22.04.17 1,4,5
mechanism
Introduction to multithreading:
387. 1 24.04.17 1,4,5
processes and threads
Thread states, thread life cycle,
388. 1 25.04.17 1,4,5
properties
Thread synchronization, interrupting
389. 1 26.04.17 1,4,5
threads
Thread groups, inter thread
390. 1 27.04.17 1,4,5
communication, daemon thread
391. Assignment/Quiz-5 1 29.04.17 1,6
No. of classes required to complete UNIT-V 12 No. of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study
ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

P. Ashok Reddy P.Ashok Reddy S.Srinivasa Reddy I Rajendra Kumar Prof.B.Ramesh Reddy
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-A
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : EMBEDDED SYSTEMS DESIGN-S229
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : K.RANI RUDRAMA
COURSE COORDINATOR : K.RANI RUDRAMA

COURSE OBJECTIVE : This course provides the knowledge on Design of


Embedded systems used in Real time applications. The course will give a
complete idea about various Hardware components like processors,
memories, interfacing buses for On board and external communication
interface. The course also gives the complete information regarding Real
time operating systems for designing a real time systems.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand the
characteristics and
quality attributes of
3 - 2 1 1 - 1 - 1 1 - 2 - 1 -
Embedded systems
2 Gain the knowledge on
Embedded system 3 - 2 1 1 - 1 - 1 1 - 2 - 1 -
components
3 Acquire knowledge on
different interfacing
device drivers and
3 - 2 1 1 - 1 - 1 1 - 2 - - 1
interrupts
4 Develop inter process
communication between 2 - 3 1 1 - 1 - 1 1 - 2 - 3 2
multiple processors
5 Apply hardware and
software real time
embedded system
2 - 2 1 3 - 1 - 1 1 - 2 1 3 2
design techniques

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Raj Kamal, “Embedded Systems Architecture, Programming and Design”, Tata Mc
Graw Hill Publishers, 2ndEdition.

2 Frank Vahid, Tony D. Givargis “Embedded System Design: AUnifiedHardware/Software


Introduction “,Wiley India Edition, 2002.
BOS APPROVED REFERENCE BOOKS:
1 Peter Mervedel, “Embedded Systems Design”,Springer Verlag Publications.
2 KVKK Prasad “Embedded / Real Time Systems”, Dreamtech Press, 2005.
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : Introduction to Embedded Systems
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
1. Introduction to Embedded system 1 27.12.16 TLM2
Embedded Systems Vs General
2. 1 28.12.16 TLM1
Computing Systems
3. History of Embedded Systems 1 30.12.16 TLM2
4. Classification of Embedded Systems 1 31.12.16 TLM1
5. Major Application Areas 1 02.01.17 TLM1
6. Purpose of Embedded Systems 1 03.01.17 TLM1
7. Characteristics of Embedded Systems. 1 04.01.17 TLM2
8. Quality Attributes of Embedded Systems. 1 06.01.17 TLM1
9. Embedded Firmware, Reset Circuit 1 07.01.17 TLM1
10. Brown-out Protection Circuit, Oscillator 1 16.01.17 TLM2
11. TUTORIAL-1 1 17.01.17 TLM3
12. Real Time Clock, Watchdog Timer 1 18.01.17 TLM2
13. Embedded Firmware 1 20.01.17 TLM1
14. Design approaches 1 21.01.17 TLM2
15. TUTORIAL-2 1 23.01.17 TLM3
16. Assignment/Quiz-1 1 24.01.17 TLM6
No. of classes required to complete UNIT-I 16 No. of classes taken:
UNIT-II : Embedded System Components
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
17. Core of the Embedded System 1 25.01.17 TLM2
General Purpose and Domain Specific
18. 1 27.01.17 TLM1
Processors
19. ASICs, PLDs 1 28.01.17 TLM2
20. Commercial Off-The-Shelf Components 1 30.01.17 TLM1
21. Memory, ROM 1 31.01.17 TLM1
22. RAM 1 01.02.17 TLM1
23. TUTORIAL-3 1 03.02.17 TLM3
Memory according to the type of
24. 1 04.02.17 TLM1
Interface
25. Memory Shadowing 1 06.02.17 TLM1
Memory selection for Embedded
26. 1 07.02.17 TLM2
Systems
Sensors and Actuators Communication
27. 1 08.02.17 TLM2
Interface
28. TUTORIAL-4 1 10.02.17 TLM3
Onboard and External Communication
29. Interfaces
1 11.02.17 TLM1
30. Assignment/Quiz-2 1 13.02.17 TLM6
31. ISA,PCI, PCI/X 1 14.02.17 TLM2
No. of classes required to complete UNIT-II 15 No. of classes taken:

UNIT-III : Device drivers and Interrupts:


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
32. Device drivers programming 1 15.02.17 TLM1
Writing physical device driving ISRs
33. 1 17.02.17 TLM1
in a system
34. Virtual Device Drivers 1 18.02.17 TLM2
35. Parallel port Device drivers 1 28.02.17 TLM2
36. TUTORIAL-5 1 01.03.17 TLM3
37. Hand shaking signal to a parallel port 1 03.03.17 TLM1
38. Serial port Drivers in a system 1 04.03.17 TLM1
Device drivers for internal
39. 1 06.03.17 TLM1
programmable timing device
40. Interrupt service mechanism 1 07.03.17 TLM2
Hardware interrupts related to Internal
41. 1 08.03.17 TLM1
Devices
42. TUTORIAL-6 1 10.03.17 TLM3
43. Contex switching using register sets 1 11.03.17 TLM2
Classification of Processors Interrupt
44. 1 13.03.17 TLM2
Service Mechanism
Software override of Hardware
45. 1 14.03.17 TLM2
priorities
46. TUTORIAL-7 1 15.03.17 TLM3
47. Assignment/Quiz-3 1 17.03.17 TLM6
No. of classes required to complete UNIT-III 16 No. of classes taken:

UNIT-IV : Inter-Process Communication


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to Multiple processes in
48. 1 18.03.17 TLM2
an application
49. Multiple threads in an application 1 20.03.17 TLM2
50. Tasks, tasks states, task and data 1 21.03.17 TLM2
51. Concept of Semaphores 1 22.03.17 TLM1
52. Shared data 1 23.03.17 TLM1
53. Inter process communication 1 24.03.17 TLM1
54. Semaphore functions 1 25.03.17 TLM1
55. TUTORIAL-8 1 27.03.17 TLM3
56. Message queue, mailbox functions 1 28.03.17 TLM2
57. Pipe, socket functions 1 31.03.17 TLM2
58. Remote Procedure call 1 01.04.17 TLM2
59. Task communication and 1 03.04.17 TLM2
synchronization
60. TUTORIAL-9 1 04.04.17 TLM3
61. Assignment/Quiz-4 1 07.04.17 TLM6
No. of classes required to complete UNIT-IV 14 No. of classes taken:

UNIT-V : Real Time Operating Systems


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
62. Introduction to Operating Systems 1 08.04.17 TLM2
63. Operating System Services 1 10.04.17 TLM2
64. basics of RTOS 1 11.04.17 TLM2
65. Memory management 1 12.04.17 TLM1
66. TUTORIAL-10 1 15.04.17 TLM3
67. Interrupt routines in RTOs 1 17.04.17 TLM1
68. Embedded operating systems 1 18.04.17 TLM1
69. TUTORIAL-11 1 19.04.17 TLM1
Basic design using an RTOs
70. 1 21.04.17 TLM1
Scheduler, object function
71. Characteristics of RTOs 1 22.04.17 TLM2
72. TUTORIAL-12 1 25.04.17 TLM3
73. Assignment/Quiz-5 1 26.04.17 TLM6
No. of classes required to complete UNIT-V 12 No. of classes taken:
Contents beyond the Syllabus
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Real Time operating systems Wind
74. River Vx Works, QNX Neutrino 1 28.04.17 TLM2
MicroC/OS‐II
75. Advanced Embedded Systems 1 29.04.17 TLM2
Total No.of classes required to complete: 75 No .of classes taken:

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD

TLM2 PPT TLM5 Programming TLM8 Lab Demo

TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study


ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
Sankranthi Holidays 09-01-2017 14-01-2017 1W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 07-05-2017 13-05-2017 1W
Semester End Examinations 14-05-2017 25-05-2017 2W
EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

K.RANI RUDRAMA K.RANI RUDRAMA Y.AMAR BABU Dr.M.SUMAN Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE- B&C
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : EMBEDDED SYSTEMS DESIGN-S229
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : M.SIVASANKARA RAO
COURSE COORDINATOR : K.Ranirudrama

COURSE OBJECTIVE : This course provides the knowledge on Design of


Embedded systems used in Real time applications. The course will give a
complete idea about various Hardware components like processors,
memories, interfacing buses for On board and external communication
interface. The course also gives the complete information regarding Real
time operating systems for designing a real time systems.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Understand the
characteristics and
quality attributes of 3 - 2 1 1 - 1 - 1 1 - 2
Embedded systems

2 Gain the knowledge on


Embedded system 3 - 2 1 1 - 1 - 1 1 - 2
components
3 Know the different
interfacing device
drivers and interrupts
3 - 2 1 1 - 1 - 1 1 - 2

4 Develop inter process


communication between 2 - 3 1 1 - 1 - 1 1 - 2
multiple processors
5 Apply hardware and
software real time
embedded system
2 - 2 1 3 - 1 - 1 1 - 2
design techniques

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Raj Kamal, “Embedded Systems Architecture, Programming and Design”, Tata Mc
Graw Hill Publishers, 2ndEdition.

2 Frank Vahid, Tony D. Givargis “Embedded System Design: AUnifiedHardware/Software


Introduction “,Wiley India Edition, 2002.
BOS APPROVED REFERENCE BOOKS:
1 Peter Mervedel, “Embedded Systems Design”,Springer Verlag Publications.
2 KVKK Prasad “Embedded / Real Time Systems”, Dreamtech Press, 2005.
COURSE DELIVERY PLAN (LESSON PLAN): Section-A
UNIT-I : Introduction to Embedded Systems
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction the Subject and Syllabus of
1. 1 27.12.16
ESD
2. Discussion on CO’s and CEO’s 1 29.12.16
Introduction to the IUnit and Definition
3. 1 30.12.16
of ESD
Embedded Systems Vs General
4. 1 31.12.16
Computing Systems
5. History of Embedded Systems 1 02.01.17
6. Classification of Embedded Systems 1 03.01.17
Major Application Areas Purpose
7. 1 06.01.17
of Embedded Systems
8. Representation of Discrete Time Signals 1 07.01.17
9. Characteristics of Embedded Systems. 1 10.01.17
10. Quality Attributes of Embedded Systems. 1 12.01.17
11. Embedded Firmware, Reset Circuit 1 16.01.17
Brown-out Protection Circuit, Oscillator
12. 1 17.01.17
Unit
13. TUTORIAL-1 1 19.01.17
14. Real Time Clock, Watchdog Timer 1 20.01.17
15. Embedded Firmware 1 21.01.17
16. Design approaches 1 23.01.17
17. TUTORIAL-2 1 24.01.17
18. Assignment/Quiz-1 1 27.01.17
No. of classes required to complete UNIT-I 18 No. of classes taken:

UNIT-II : Embedded System Components


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to the II Unit. Core of the
19. 1 28.01.17
Embedded System
General Purpose and Domain Specific
20. 1 30.01.17
Processors
21. ASICs, PLDs 1 31.01.17
22. Commercial Off-The-Shelf Components 1 02.02.17
23. Memory, ROM 1 03.02.17
24. RAM 1 04.02.17
25. TUTORIAL-3 1 06.02.17
Memory according to the type of
26. 1 07.02.17
Interface
27. Memory Shadowing 1 09.02.17
28. Memory selection for Embedded 1 10.02.17
Systems
Sensors and Actuators Communication
29. 1 11.02.17
Interface
30. TUTORIAL-4 1 13.02.17
Onboard and External Communication
31. 1 14.02.17
Interfaces
32. Assignment/Quiz-2 1 16.02.17
33. ISA,PCI, PCI/X 1 17.02.17
34. TUTORIAL-5 1 18.02.17
No. of classes required to complete UNIT-II 16 No. of classes taken:

UNIT-III : Device drivers and Interrupts:


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to the III Unit.
35. 1 28.02.17
Discussion about Device drivers
Writing physical device driving ISRs
36. 1 02.03.17
in a system
37. Virtual Device Drivers 1 03.03.17
38. Parallel port Device drivers 1 04.03.17
39. TUTORIAL-6 1 06.03.17
40. Hand shaking signal to a parallel port 1 07.03.17
41. Serial port Drivers in a system 1 09.03.17
Device drivers for internal
42. 1 10.03.17
programmable timing device
43. Interrupt service mechanism 1 11.03.17
Hardware interrupts related to Internal
44. 1 13.03.17
Devices
45. TUTORIAL-7 1 14.03.17
46. Contex switching using register sets 1 16.03.17
Classification of Processors Interrupt
47. 1 17.03.17
Service Mechanism
Software override of Hardware
48. 1 18.03.17
priorities
49. TUTORIAL-8 1 20.03.17
50. Assignment/Quiz-3 1 21.03.17
No. of classes required to complete UNIT-III 16 No. of classes taken:

UNIT-IV : Inter-Process Communication


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to IV Unit,
51. 1 23.03.17
Multiple processes in an application
52. Multiple threads in an application 1 24.03.17
Tasks, tasks states, task and data
53. 1 25.03.17
Concept of Semaphores
54. Shared data, Semaphore functions 1 27.03.17
55. Inter process communication 1 30.03.17
56. TUTORIAL-9 1 31.03.17
57. Message queue, mailbox functions 1 01.04.17
58. Pipe, socket functions 1 03.04.17
59. Remote Procedure call 1 04.04.17
Task communication and
60. 1 06.04.17
synchronization
61. TUTORIAL-10 1 07.04.17
62. Assignment/Quiz-4 1 08.04.17
No. of classes required to complete UNIT-IV 14 No. of classes taken:
UNIT-V : Real Time Operating Systems
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Introduction to V Unit,
63. 1 10.04.17
Operating Systems
64. Operating System Services 1 11.04.17
65. basics of RTOS 1 13.04.17
66. Memory management 1 15.04.17
67. TUTORIAL-11 1 17.04.17
68. Interrupt routines in RTOs 1 18.04.17
69. Embedded operating systems 1 20.04.17
70. Basic design using an RTOs 1 21.04.17
71. Scheduler, object function 1 22.04.17
72. Characteristics of RTOs 1 24.04.17
73. TUTORIAL-12 1 25.04.17
74. Assignment/Quiz-5 1 27.04.17
No. of classes required to complete UNIT-V 12 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Real Time operating systems Wind
75. River Vx Works, QNXNeutrino, 1 28.04.17
MicroC/OS‐II
76. Advanced Embedded Systems 1 29.04.17

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
Sankranthi Holidays 09-01-2017 14-01-2017 1W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 07-05-2017 13-05-2017 1W
Semester End Examinations 14-05-2017 25-05-2017 2W
EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr.M.Sivasankara Rao Mrs.K.Ranirudrama Mr.Y.Amar Babu Dr.M.Suman Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-A Section
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Antennas and Wave Propagation - S 131
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr B.Y.V.N.R.Swamy
COURSE COORDINATOR : Mr P.Rakesh Kumar.

COURSE OBJECTIVE: This course provides the knowledge on Antennas and


Radiation fundamentals. The course will expose different types of Antennas
and their applications. The course also gives the complete information
regarding Propagation of Radio wave in atmosphere.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement
At the end of the PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
course, student
will be able to
1 Understand and
elaborate the
Antenna and 2 2 3
Radiation
fundamentals
2 Analyze and
synthesize various 3 2 2 1
Antenna Arrays
3 Design different
types of High
3 2
frequency
Antennas
4 Measure various
Antenna 3 2
Parameters
5 Understand the
radio wave
3 2
propagation in
atmosphere

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Constantine A.Balanis, Antenna Theory : Analysis and Design, John Wiley &
sons Publishers,2 Edition.
BOS APPROVED REFERENCE BOOKS:
1 K.D. Prasad, Antennas and Wave Propagation, Satya Prakashan Publishers,
New Delhi.
2 John D. Kraus, Antennas and Wave Propagation, TMH Publishers

COURSE DELIVERY PLAN (LESSON PLAN): Section-A


UNIT-I : Radiation and Antenna fundamentals
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
392. Introduction to Subject 1 27.12.16
393. Course Outcomes 1 28.12.16
394. Introduction to UNIT-I 1 29.12.16
395. Definition and function of Antenna 1 30.12.16
02.01.17
396. Radiation Mechanism 1
Potential functions-heuristic approach,
397. 1 03. 01.17
Maxwell’s equation approach
Potential functions for sinusoidal 04. 01.17
398. 2
oscillations 05. 01.17
Analysis of Radiation fields of a
06. 01.17
399. Alternating current element , Power 2
09. 01.17
radiated by current element
Radiation resistance of current element, 10. 01.17
400. 2
Radiation of half wave dipole 11. 01.17
Radiation from quarter wave Monopole 12. 01.17
401. 1
and half wave dipole
402. TUTORIAL-1 1 13. 01.17
Radiation pattern expressions of Center-
403. fed vertical Dipole, Center-fed 1 16. 01.17
Horizontal Dipole, Reciprocity principle
Isotropic Radiators, Antenna
404. Parameters: Radiation intensity- 1 17. 01.17
Radiation Pattern
Directive gain- Directivity, Power gain,
405. 1 18. 01.17
Beam Width
Effective aperture, Effective length,
406. 1 19. 01.17
Relation between Ae ,Gain, R rad
Network Theorems and their
407. 1 20. 01.17
applications
408. TUTORIAL-2 1 23. 01.17
409. Assignment/Quiz-1 1 24.01.17
No. of classes required to complete UNIT-I 22 No. of classes taken:

UNIT-II : Array antenna analysis and synthesis


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Various forms of Antenna Arrays,
410. 1 24.01.17
Linear and Circular arrays
411. Arrays of Two Point Sources 1 25.01.17
Linear Arrays of N-Point Sources,
412. 1 26.01.17
Expression for electric field from two,
three and N element arrays
413. linear arrays: Broad-side array 1 27.01.17
30.01.17
414. TUTORIAL-3 1
31.01.17
linear arrays: End-Fire array, Binomial
415. 1 01.02.17
array
Patterns of Array of Non Isotropic 02.02.17
416. Radiators, Method of pattern 1
multiplication
Effect of Earth on Vertical Patterns, 03.02.17
417. and on radiation resistance, Methods of 1
Excitation of Antennas
06.02.17
418. Schelnuoff Polynomial Method 2
07.02.17
419. Fourier Transform Method 2
08.02.17
420. TUTORIAL-4 1
Woodward-Lawson Method 09.02.17
421. 1
Dolph-Chebyshev Method 10.02.17
31. 1
11.02.17
32. Dolph-Chebyshev Method 1
14.02.17
33. Assignment/Quiz-2 1
No. of classes required to complete UNIT-II 15 No. of classes taken:

UNIT-III :HF,VHF,UHF Antennas


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15.02.17
33. Introduction to UNIT-III 1
Directional Antennas, Omni- 16.02.17
34. 1
Directional Antennas
Resonant Antennas, Non Resonant 17.02.17
35. 1
Antennas
28.02.17
36. Folded Dipole 1
01.03.17
37. Yagi-Uda Antenna 1
02.03.17
38. V-Antenna, Inverted V-Antenna 1
03.03.17
39. TUTORIAL-5 1
04.03.17
40. Rhombic Antenna, 1
06.03.17
41. Loop Antenna 1
Helical Antenna 07.03.17
42. 1
Log-Periodic Antenna 08.03.17
43. 1
09.03.17
44. TUTORIAL-6 1
10.03.17
45. Assignment/Quiz-3 1
No. of classes required to complete UNIT-III 13 No. of classes taken:

UNIT-IV : Microwave Antennas and ANTENNA Measurements


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
13.03.17
46. Introduction to UNIT-IV 1
14.03.17
47. Different types of Reflectors, Corner 1
Parabolic Reflector Antennas, Feed 15.03.17
48. 1
System
16.03.17
49. Horn Antenna, Lens Antenna 1
17.03.17
50. Aperture Antennas 1
20.03.17
51. Microstrip or Patch Antenna 1
21.03.17
52. Slot Antenna 1
22.03.17
53. TUTORIAL-7 1
Reciprocity in Antenna measurements 23.03.17
54. – Near-field and Far-field – 1
Measurements ranges
Measurement of different Antenna 24.03.17
parameters- Directional pattern,
55. 1
Radiation resistance, Gain (Two
Antenna, Three Antenna Methods)
Directivity, Beam width, SLR, 27.03.17
56. Polarization, Impedance, Radiation 1
Efficiency, Aperture Efficiency
Fundamental equation for Free space 29.03.17
Propagation, Modes of Wave
57. 1
Propagation: Ground wave or Surface
wave Propagation
30.03.17
58. TUTORIAL-8 1
31.03.17
59. Assignment/Quiz-4 1
No. of classes required to complete UNIT-IV 15 No. of classes taken:
UNIT-V : Wave Propagation
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
60. Introduction to UNIT-V 1 03.04.17
04.04.17
61. Sky wave or Ionospheric Propagation, 1
06.04.17
62. Space wave Propagation 1
07.04.17
63. Tropospheric Scatter Propagation 2
10.04.17

TUTORIAL-9 11.04.17
64. 1
Duct Propagation, Line of Sight 12.04.17
65. 1
Ionospheric abnormalities 13.04.17
66. 2
17.04.17

LUF, MUF 18.04.17


67. 1
Fading 19.04.17
68. 1

69. Skip Distance 1 20.04.17


70. TUTORIAL-10 1 21.04.17
71. Problems in unit V 1 24.04.17
72. Assignment/Quiz-5 1 25.04.17
No. of classes required to complete UNIT-V 15 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
26.04.17
73. Design of micro strip patch antennas 1
27.04.17
74. Rectangular Patch Antennas 1
28.04.17
75. Circular Patch Antennas 1

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr B.Y.V.N.R.Swamy Mr P.Rakesh Kumar Mr.G.L.N.Murthy Dr.J.Babu Babu Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-B Section
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Antennas and Wave Propagation - S 131
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr P.Rakesh Kumar.
COURSE COORDINATOR : Mr P.Rakesh Kumar.

COURSE OBJECTIVE: This course provides the knowledge on Antennas and


Radiation fundamentals. The course will expose different types of Antennas
and their applications. The course also gives the complete information
regarding Propagation of Radio wave in atmosphere.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement
At the end of the PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
course, student
will be able to
1 Understand and
elaborate the
Antenna and 2 2 3
Radiation
fundamentals
2 Analyze and
synthesize various 3 2 2 1
Antenna Arrays
3 Design different
types of High
3 2
frequency
Antennas
4 Measure various
Antenna 3 2
Parameters
5 Understand the
radio wave
3 2
propagation in
atmosphere

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Constantine A.Balanis, Antenna Theory : Analysis and Design, John Wiley &
sons Publishers,2 Edition.
BOS APPROVED REFERENCE BOOKS:
1 K.D. Prasad, Antennas and Wave Propagation, Satya Prakashan Publishers,
New Delhi.
2 John D. Kraus, Antennas and Wave Propagation, TMH Publishers

COURSE DELIVERY PLAN (LESSON PLAN): Section-A


UNIT-I : Radiation and Antenna fundamentals
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
422. Introduction to Subject 1 27.12.16
423. Course Outcomes 1 28.12.16
424. Introduction to UNIT-I 1 29.12.16
425. Definition and function of Antenna 1 30.12.16
02.01.17
426. Radiation Mechanism 1
Potential functions-heuristic approach,
427. 1 03. 01.17
Maxwell’s equation approach
Potential functions for sinusoidal 04. 01.17
428. 2
oscillations 05. 01.17
Analysis of Radiation fields of a
06. 01.17
429. Alternating current element , Power 2
09. 01.17
radiated by current element
Radiation resistance of current element, 10. 01.17
430. 2
Radiation of half wave dipole 11. 01.17
Radiation from quarter wave Monopole 12. 01.17
431. 1
and half wave dipole
432. TUTORIAL-1 1 13. 01.17
Radiation pattern expressions of Center-
433. fed vertical Dipole, Center-fed 1 16. 01.17
Horizontal Dipole, Reciprocity principle
Isotropic Radiators, Antenna
434. Parameters: Radiation intensity- 1 17. 01.17
Radiation Pattern
Directive gain- Directivity, Power gain,
435. 1 18. 01.17
Beam Width
Effective aperture, Effective length,
436. 1 19. 01.17
Relation between Ae ,Gain, R rad
Network Theorems and their
437. 1 20. 01.17
applications
438. TUTORIAL-2 1 23. 01.17
439. Assignment/Quiz-1 1 24.01.17
No. of classes required to complete UNIT-I 22 No. of classes taken:

UNIT-II : Array antenna analysis and synthesis


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Various forms of Antenna Arrays,
440. 1 24.01.17
Linear and Circular arrays
441. Arrays of Two Point Sources 1 25.01.17
Linear Arrays of N-Point Sources,
442. 1 26.01.17
Expression for electric field from two,
three and N element arrays
443. linear arrays: Broad-side array 1 27.01.17
30.01.17
444. TUTORIAL-3 1
31.01.17
linear arrays: End-Fire array, Binomial
445. 1 01.02.17
array
Patterns of Array of Non Isotropic 02.02.17
446. Radiators, Method of pattern 1
multiplication
Effect of Earth on Vertical Patterns, 03.02.17
447. and on radiation resistance, Methods of 1
Excitation of Antennas
06.02.17
448. Schelnuoff Polynomial Method 2
07.02.17
449. Fourier Transform Method 2
08.02.17
450. TUTORIAL-4 1
Woodward-Lawson Method 09.02.17
451. 1
Dolph-Chebyshev Method 10.02.17
31. 1
11.02.17
32. Dolph-Chebyshev Method 1
14.02.17
33. Assignment/Quiz-2 1
No. of classes required to complete UNIT-II 15 No. of classes taken:

UNIT-III :HF,VHF,UHF Antennas


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15.02.17
76. Introduction to UNIT-III 1
Directional Antennas, Omni- 16.02.17
77. 1
Directional Antennas
Resonant Antennas, Non Resonant 17.02.17
78. 1
Antennas
28.02.17
79. Folded Dipole 1
01.03.17
80. Yagi-Uda Antenna 1
02.03.17
81. V-Antenna, Inverted V-Antenna 1
03.03.17
82. TUTORIAL-5 1
04.03.17
83. Rhombic Antenna, 1
06.03.17
84. Loop Antenna 1
Helical Antenna 07.03.17
85. 1
Log-Periodic Antenna 08.03.17
86. 1
09.03.17
87. TUTORIAL-6 1
10.03.17
88. Assignment/Quiz-3 1
No. of classes required to complete UNIT-III 13 No. of classes taken:

UNIT-IV : Microwave Antennas and ANTENNA Measurements


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
13.03.17
89. Introduction to UNIT-IV 1
14.03.17
90. Different types of Reflectors, Corner 1
Parabolic Reflector Antennas, Feed 15.03.17
91. 1
System
16.03.17
92. Horn Antenna, Lens Antenna 1
17.03.17
93. Aperture Antennas 1
20.03.17
94. Microstrip or Patch Antenna 1
21.03.17
95. Slot Antenna 1
22.03.17
96. TUTORIAL-7 1
Reciprocity in Antenna measurements 23.03.17
97. – Near-field and Far-field – 1
Measurements ranges
Measurement of different Antenna 24.03.17
parameters- Directional pattern,
98. 1
Radiation resistance, Gain (Two
Antenna, Three Antenna Methods)
Directivity, Beam width, SLR, 27.03.17
99. Polarization, Impedance, Radiation 1
Efficiency, Aperture Efficiency
Fundamental equation for Free space 29.03.17
Propagation, Modes of Wave
100. 1
Propagation: Ground wave or Surface
wave Propagation
30.03.17
101. TUTORIAL-8 1
31.03.17
102. Assignment/Quiz-4 1
No. of classes required to complete UNIT-IV 15 No. of classes taken:
UNIT-V : Wave Propagation
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
103. Introduction to UNIT-V 1 03.04.17
04.04.17
104. Sky wave or Ionospheric Propagation, 1
06.04.17
105. Space wave Propagation 1
07.04.17
106. Tropospheric Scatter Propagation 2
10.04.17

TUTORIAL-9 11.04.17
107. 1
Duct Propagation, Line of Sight 12.04.17
108. 1
Ionospheric abnormalities 13.04.17
109. 2
17.04.17

LUF, MUF 18.04.17


110. 1
Fading 19.04.17
111. 1

112. Skip Distance 1 20.04.17


113. TUTORIAL-10 1 21.04.17
114. Problems in unit V 1 24.04.17
115. Assignment/Quiz-5 1 25.04.17
No. of classes required to complete UNIT-V 15 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
26.04.17
116. Design of micro strip patch antennas 1
27.04.17
117. Rectangular Patch Antennas 1
28.04.17
118. Circular Patch Antennas 1

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr P.Rakesh Kumar Mr P.Rakesh Kumar Mr.G.L.N.Murthy Dr.J.Babu Babu Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE-C Section
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : Antennas and Wave Propagation - S 131
L-T-P STRUCTURE : 4-1-0
COURSE CREDITS :3
COURSE INSTRUCTOR : Mr P.Rakesh Kumar.
COURSE COORDINATOR : Mr P.Rakesh Kumar.

COURSE OBJECTIVE: This course provides the knowledge on Antennas and


Radiation fundamentals. The course will expose different types of Antennas
and their applications. The course also gives the complete information
regarding Propagation of Radio wave in atmosphere.

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement
At the end of the PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
course, student
will be able to
1 Understand and
elaborate the
Antenna and 2 2 3
Radiation
fundamentals
2 Analyze and
synthesize various 3 2 2 1
Antenna Arrays
3 Design different
types of High
3 2
frequency
Antennas
4 Measure various
Antenna 3 2
Parameters
5 Understand the
radio wave
3 2
propagation in
atmosphere

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight(Low), 2 - Moderate(Medium), 3 - Substantial (High).

BOS APPROVED TEXT BOOKS:


1 Constantine A.Balanis, Antenna Theory : Analysis and Design, John Wiley &
sons Publishers,2 Edition.
BOS APPROVED REFERENCE BOOKS:
1 K.D. Prasad, Antennas and Wave Propagation, Satya Prakashan Publishers,
New Delhi.
2 John D. Kraus, Antennas and Wave Propagation, TMH Publishers

COURSE DELIVERY PLAN (LESSON PLAN): Section-A


UNIT-I : Radiation and Antenna fundamentals
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
452. Introduction to Subject 1 27.12.16
453. Course Outcomes 1 28.12.16
454. Introduction to UNIT-I 1 29.12.16
455. Definition and function of Antenna 1 30.12.16
02.01.17
456. Radiation Mechanism 1
Potential functions-heuristic approach,
457. 1 03. 01.17
Maxwell’s equation approach
Potential functions for sinusoidal 04. 01.17
458. 2
oscillations 05. 01.17
Analysis of Radiation fields of a
06. 01.17
459. Alternating current element , Power 2
09. 01.17
radiated by current element
Radiation resistance of current element, 10. 01.17
460. 2
Radiation of half wave dipole 11. 01.17
Radiation from quarter wave Monopole 12. 01.17
461. 1
and half wave dipole
462. TUTORIAL-1 1 13. 01.17
Radiation pattern expressions of Center-
463. fed vertical Dipole, Center-fed 1 16. 01.17
Horizontal Dipole, Reciprocity principle
Isotropic Radiators, Antenna
464. Parameters: Radiation intensity- 1 17. 01.17
Radiation Pattern
Directive gain- Directivity, Power gain,
465. 1 18. 01.17
Beam Width
Effective aperture, Effective length,
466. 1 19. 01.17
Relation between Ae ,Gain, R rad
Network Theorems and their
467. 1 20. 01.17
applications
468. TUTORIAL-2 1 23. 01.17
469. Assignment/Quiz-1 1 24.01.17
No. of classes required to complete UNIT-I 22 No. of classes taken:

UNIT-II : Array antenna analysis and synthesis


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
Various forms of Antenna Arrays,
470. 1 24.01.17
Linear and Circular arrays
471. Arrays of Two Point Sources 1 25.01.17
Linear Arrays of N-Point Sources,
472. 1 26.01.17
Expression for electric field from two,
three and N element arrays
473. linear arrays: Broad-side array 1 27.01.17
30.01.17
474. TUTORIAL-3 1
31.01.17
linear arrays: End-Fire array, Binomial
475. 1 01.02.17
array
Patterns of Array of Non Isotropic 02.02.17
476. Radiators, Method of pattern 1
multiplication
Effect of Earth on Vertical Patterns, 03.02.17
477. and on radiation resistance, Methods of 1
Excitation of Antennas
06.02.17
478. Schelnuoff Polynomial Method 2
07.02.17
479. Fourier Transform Method 2
08.02.17
480. TUTORIAL-4 1
Woodward-Lawson Method 09.02.17
481. 1
Dolph-Chebyshev Method 10.02.17
31. 1
11.02.17
32. Dolph-Chebyshev Method 1
14.02.17
33. Assignment/Quiz-2 1
No. of classes required to complete UNIT-II 15 No. of classes taken:

UNIT-III :HF,VHF,UHF Antennas


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
15.02.17
119. Introduction to UNIT-III 1
Directional Antennas, Omni- 16.02.17
120. 1
Directional Antennas
Resonant Antennas, Non Resonant 17.02.17
121. 1
Antennas
28.02.17
122. Folded Dipole 1
01.03.17
123. Yagi-Uda Antenna 1
02.03.17
124. V-Antenna, Inverted V-Antenna 1
03.03.17
125. TUTORIAL-5 1
04.03.17
126. Rhombic Antenna, 1
06.03.17
127. Loop Antenna 1
Helical Antenna 07.03.17
128. 1
Log-Periodic Antenna 08.03.17
129. 1
09.03.17
130. TUTORIAL-6 1
10.03.17
131. Assignment/Quiz-3 1
No. of classes required to complete UNIT-III 13 No. of classes taken:

UNIT-IV : Microwave Antennas and ANTENNA Measurements


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
13.03.17
132. Introduction to UNIT-IV 1
14.03.17
133. Different types of Reflectors, Corner 1
Parabolic Reflector Antennas, Feed 15.03.17
134. 1
System
16.03.17
135. Horn Antenna, Lens Antenna 1
17.03.17
136. Aperture Antennas 1
20.03.17
137. Microstrip or Patch Antenna 1
21.03.17
138. Slot Antenna 1
22.03.17
139. TUTORIAL-7 1
Reciprocity in Antenna measurements 23.03.17
140. – Near-field and Far-field – 1
Measurements ranges
Measurement of different Antenna 24.03.17
parameters- Directional pattern,
141. 1
Radiation resistance, Gain (Two
Antenna, Three Antenna Methods)
Directivity, Beam width, SLR, 27.03.17
142. Polarization, Impedance, Radiation 1
Efficiency, Aperture Efficiency
Fundamental equation for Free space 29.03.17
Propagation, Modes of Wave
143. 1
Propagation: Ground wave or Surface
wave Propagation
30.03.17
144. TUTORIAL-8 1
31.03.17
145. Assignment/Quiz-4 1
No. of classes required to complete UNIT-IV 15 No. of classes taken:
UNIT-V : Wave Propagation
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
146. Introduction to UNIT-V 1 03.04.17
04.04.17
147. Sky wave or Ionospheric Propagation, 1
06.04.17
148. Space wave Propagation 1
07.04.17
149. Tropospheric Scatter Propagation 2
10.04.17

TUTORIAL-9 11.04.17
150. 1
Duct Propagation, Line of Sight 12.04.17
151. 1
Ionospheric abnormalities 13.04.17
152. 2
17.04.17

LUF, MUF 18.04.17


153. 1
Fading 19.04.17
154. 1

155. Skip Distance 1 20.04.17


156. TUTORIAL-10 1 21.04.17
157. Problems in unit V 1 24.04.17
158. Assignment/Quiz-5 1 25.04.17
No. of classes required to complete UNIT-V 15 No. of classes taken:

Contents beyond the Syllabus


No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly
26.04.17
159. Design of micro strip patch antennas 1
27.04.17
160. Rectangular Patch Antennas 1
28.04.17
161. Circular Patch Antennas 1

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Assignment/Quiz – 1 1 A1=5
Assignment/Quiz – 2 2 A2=5
I-Mid Examination 1,2 B1=20
Assignment/Quiz – 3 3 A3=5
Assignment/Quiz – 4 4 A4=5
Assignment/Quiz – 5 5 A5=5
II-Mid Examination 3,4,5 B2=20
Evaluation of Assignment/Quiz Marks: A=(A1+A2+A3+A4+A5)/5 1,2,3,4,5 A=5
Evaluation of Mid Marks: B=75% of Max(B1,B2)+25% of Min(B1,B2) 1,2,3,4,5 B=20
Cumulative Internal Examination : A+B 1,2,3,4,5 A+B=25
Semester End Examinations 1,2,3,4,5 C=75
Total Marks: A+B+C 1,2,3,4,5 100

Mr P.Rakesh Kumar Mr P.Rakesh Kumar Mr.G.L.N.Murthy Dr.J.Babu Babu Prof.B.Ramesh Reddy


Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING
(Autonomous)
L.B.Reddy Nagar, Mylavaram – 521 230. Andhra Pradesh, INDIA
Affiliated to JNTUK, Kakinada & Approved by AICTE New Delhi
Accredited by NBA, New Delhi & certified by ISO 9001:2008
http://www.lbrce.ac.in
--------------------------------------------------------------------------------------------
COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : DS & OOP Lab – L129
L-T-P STRUCTURE : 3-0-0
COURSE CREDITS :2
COURSE INSTRUCTOR :
COURSE COORDINATOR :

COURSE OBJECTIVE: To understand fundamentals of programming such as variables,


conditional and iterative execution, methods, and the abstract data types stack, queue, de-
queue, and list, An understanding of the basic search and sort algorithms. Understand
fundamentals of object-oriented programming in Java, writing computer programs to solve
specified problems. Use the Java SDK environment to create, debug and run simple Java
programs

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Implement various
searching and sorting
algorithms.
2 Understand and implement
stacks and queues using
arrays, linked list
implementation.
3 Implement OOP concepts in
JAVA.

4 Know how we work with


grouping of objects,
concurrent execution and
how we handle dynamic
activities.

5 Understand the importance


of packages and Exception
handling and will have the
ability to implement them as
per real time scenarios.

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).
BOS APPROVED REFERENCE BOOKS:
1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A.
Forouzen, cengage.
2 Herbert Schildt, “The Complete Reference JAVA J2SE”. 7th Edition, TMH,
new delhi, 2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia,
1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition,
Pearson Education/ PHI, 2007.

DS & OOP LAB SCHEDULE (LESSON PLAN): Section-A


BATCH-1
No. of Tentative Actual Teaching HOD
S.No. Experiments to be conducted Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear search,


482. 3 29.12.16
Binary search
Bubble sort, Selection sort, Insertion
483. 3 03.01.17
sort

484. Quick sort, Merge sort 3 10.01.17

485. Implement Stack using Arrays 3 17.01.17

486. Implement Queue using Arrays 3 24.01.17

Implement the Single Linked list


487. 3 31.01.17
with all operations
Implement the Double Linked list
488. 3 07.02.17
with all operations

489. Implement the DEQ & CIQ 3 14.02.17

CYCLE-2

1. Write a JAVA program to find the


sum of individual digits of a positive
integer.
2. Write a JAVA program to generate
the first ‘n’ terms of the sequence. A
490. Fibonacci sequence is defined as 3 28.02.17
follows: the first and second terms in
the sequence are 0 and 1.Subsequent
terms are formed by adding the
preceding two terms in the sequence.
3. Write a JAVA program to generate
all the prime numbers between 1 and
n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use both
recursive and non-recursive functions
a) To find the factorial of a given
491. integer. 3 07.03.17
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci number.
1.Write a Java program to perform
Matrix Multiplication
2. Write a JAVA program to
492. implement static data members and 3 14.03.17
static member Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write C++ programs that illustrate
the usage of following forms of
493. inheritance. 3 21.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to implement
Method over Loading and Method
overriding
494. 2. Write a Java program by using this 3 28.03.17
and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism by
dynamic method dispatch.
495. 2. Write a Java program using 3 04.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally
block
2. Write a Java program by using
496. 3 11.04.17
Exception handling Mechanism
including, Finally
Block?
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
497. 3 18.04.17
2. Write a Java program to implement
Inter thread communication
498. Lab internal Exam 3 25.04.17

No. of classes required to complete LAB 51 No. of classes conducted:

BATCH-2
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear


1. search, Binary search
3 29.12.16

Bubble sort, Selection sort,


2. 3 05.01.17
Insertion sort
3. Quick sort, Merge sort 3 19.01.17

4. Implement Stack using Arrays 3 02.02.17

5. Implement Queue using Arrays 3 02.02.17

Implement the Single Linked list


6. 3 09.02.17
with all operations
Implement the Double Linked list
7. 3 16.02.17
with all operations
CYCLE-2

1. Write a JAVA program to find


the sum of individual digits of a
positive integer.
2. Write a JAVA program to
generate the first ‘n’ terms of the
sequence. A Fibonacci sequence is
defined as follows: the first and
8. second terms in the sequence are 0 3 02.02.17
and 1.Subsequent terms are formed
by adding the preceding two terms
in the sequence.
3. Write a JAVA program to
generate all the prime numbers
between 1 and n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use
both recursive and non-recursive
functions
a) To find the factorial of a given
9. 3 09.03.17
integer.
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci number.
1.Write a Java program to perform
10. 3 16.03.17
Matrix Multiplication
2. Write a JAVA program to
implement static data members and
static member Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write C++ programs that
illustrate the usage of following
11. forms of inheritance. 3 23.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to
implement Method over Loading
and Method overriding
12. 2. Write a Java program by using 3 30.03.17
this and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism
by dynamic method dispatch.
13. 2. Write a Java program using 3 06.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally block
2. Write a Java program by using
14. 3 13.04.17
Exception handling Mechanism
including, Finally Block
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
15. 2. Write a Java program to 3 20.04.17
implement Inter thread
communication
16. Lab internal Exam 3 27.04.17

No. of classes required to complete LAB 48 No. of classes conducted:

Contents beyond the Syllabus


- Programs on DEQ
- Programs on CIQ
- Programs on array
- Programs on memory management functions
- Sample java introduction programs
- Sample programs on call-by-value and call-by-reference
- Sample programs on super, this, final keywords
Teaching Learning Methods
TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Day to Day work 1 A1=10
Record Writing 2 A2=5
Internal Lab Examination 1,2 B=10
Cumulative Internal Examination : A+B 3 A+B=25
Semester End Examinations 4 C=50
Total Marks: A+B+C 5 75

Mr.P.Ashok Reddy Mr.P.Ashok Reddy Mr.S.Srinivasa Reddy I Rajendra Kumar I Rajendra Kumar
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : DS & OOP Lab – L129
L-T-P STRUCTURE : 3-0-0
COURSE CREDITS :2
COURSE INSTRUCTOR :
COURSE COORDINATOR :

COURSE OBJECTIVE: To understand fundamentals of programming such as variables,


conditional and iterative execution, methods, and the abstract data types stack, queue, de-
queue, and list, An understanding of the basic search and sort algorithms. Understand
fundamentals of object-oriented programming in Java, writing computer programs to solve
specified problems. Use the Java SDK environment to create, debug and run simple Java
programs

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Differentiate various
searching and sorting 3 2 2 2 1
algorithms.
2 Use Linear Data Structures
like stacks, queues and 3 2 2 2 1
linked lists
3 Employ OOP concepts in
JAVA. 3 2 2 2 1

4 choose an engineering
approach to solving
3 2 2 2 1
problems

5 propose the use of certain


java programming concepts
3 2 2 2 1
to solve the given problems

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).

BOS APPROVED REFERENCE BOOKS:


1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A.
Forouzen, cengage.
2 Herbert Schildt, “The Complete Reference JAVA J2SE”. 7th Edition, TMH,
new delhi, 2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia,
1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition,
Pearson Education/ PHI, 2007.

DS & OOP LAB SCHEDULE (LESSON PLAN): Section-B


BATCH-1
No. of Tentative Actual Teaching HOD
S.No. Experiments to be conducted Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear search,


499. 3 28.12.16
Binary search
Bubble sort, Selection sort, Insertion
500. 3 04.01.17
sort

501. Quick sort, Merge sort 3 11.01.17

502. Implement Stack using Arrays 3 18.01.17

503. Implement Queue using Arrays 3 25.01.17

Implement the Single Linked list


504. 3 01.02.17
with all operations
Implement the Double Linked list
505. 3 08.02.17
with all operations

506. Implement the DEQ & CIQ 3 15.02.17

CYCLE-2

1. Write a JAVA program to find the


sum of individual digits of a positive
integer.
2. Write a JAVA program to generate
the first ‘n’ terms of the sequence. A
Fibonacci sequence is defined as
follows: the first and second terms in
507. 3 01.03.17
the sequence are 0 and 1.Subsequent
terms are formed by adding the
preceding two terms in the sequence.
3. Write a JAVA program to generate
all the prime numbers between 1 and
n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use both
508. recursive and non-recursive functions 3 08.03.17
a) To find the factorial of a given
integer.
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci number.
1.Write a Java program to perform
Matrix Multiplication
2. Write a JAVA program to
implement static data members and
509. 3 15.03.17
static member
Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write java programs that illustrate
the usage of following forms of
510. inheritance. 3 22.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to implement
Method over Loading and Method
overriding
511. 2. Write a Java program by using this 3 29.03.17
and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism by
dynamic method dispatch.
512. 2. Write a Java program using 3 05.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally
block
2. Write a Java program by using
513. 3 12.04.17
Exception handling Mechanism
including, Finally
Block?
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
514. 3 19.04.17
2. Write a Java program to implement
Inter thread communication
515. Lab internal Exam 3 26.04.17

No. of classes required to complete LAB 51 No. of classes conducted:


BATCH-2
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear


2. search, Binary search
3 31.12.16

Bubble sort, Selection sort,


17. 3 07.01.17
Insertion sort
18. Quick sort, Merge sort 3 21.01.17

19. Implement Stack using Arrays 3 28.01.17

20. Implement Queue using Arrays 3 04.02.17

Implement the Single Linked list


21. 3 11.02.17
with all operations
Implement the Double Linked list
22. 3 18.02.17
with all operations
CYCLE-2

1. Write a JAVA program to find


the sum of individual digits of a
positive integer.
2. Write a JAVA program to
generate the first ‘n’ terms of the
sequence. A Fibonacci sequence is
defined as follows: the first and
23. second terms in the sequence are 0 3 04.02.17
and 1.Subsequent terms are formed
by adding the preceding two terms
in the sequence.
3. Write a JAVA program to
generate all the prime numbers
between 1 and n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use
both recursive and non-recursive
functions
a) To find the factorial of a given
24. 3 11.03.17
integer.
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci number.
1.Write a Java program to perform
Matrix Multiplication
2. Write a JAVA program to
25. implement static data members and 3 18.03.17
static member Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write C++ programs that
illustrate the usage of following
26. forms of inheritance. 3 25.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to
implement Method over Loading
and Method overriding
27. 2. Write a Java program by using 3 01.04.17
this and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism
by dynamic method dispatch.
28. 2. Write a Java program using 3 08.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally block
2. Write a Java program by using
29. 3 15.04.17
Exception handling Mechanism
including, Finally Block
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
30. 2. Write a Java program to 3 22.04.17
implement Inter thread
communication
31. Lab internal Exam 3 29.04.17

No. of classes required to complete LAB 48 No. of classes conducted:

Contents beyond the Syllabus


- Programs on DEQ
- Programs on CIQ
- Programs on array
- Programs on memory management functions
- Sample java introduction programs
- Sample programs on call-by-value and call-by-reference
- Sample programs on super, this, final keywords

Teaching Learning Methods


TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Day to Day work 1 A1=10
Record Writing 2 A2=5
Internal Lab Examination 1,2 B=10
Cumulative Internal Examination : A+B 3 A+B=25
Semester End Examinations 4 C=50
Total Marks: A+B+C 5 75

Mr.S Srinivasa Reddy Mr.P.Ashok Reddy Mr.M.Hema Latha I Rajendra Kumar I Rajendra Kumar
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD
LAKKIREDDY BALI REDDY COLLEGE OF ENGINEERING
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
(Autonomous & Affiliated to JNTUK, Kakinada & Approved by AICTE, New Delhi,
NAAC Accredited with ‘A’ grade, Accredited by NBA, Certified by ISO 9001:2015)
L B Reddy Nagar, Mylavaram-521 230, Krishna District, Andhra Pradesh.

COURSE HANDOUT
PROGRAM : B.Tech., VI-Sem., ECE
ACADEMIC YEAR : 2016-17
COURSE NAME & CODE : DS & OOP Lab – L129
L-T-P STRUCTURE : 3-0-0
COURSE CREDITS :2
COURSE INSTRUCTOR :
COURSE COORDINATOR :

COURSE OBJECTIVE: To understand fundamentals of programming such as variables,


conditional and iterative execution, methods, and the abstract data types stack, queue, de-
queue, and list, An understanding of the basic search and sort algorithms. Understand
fundamentals of object-oriented programming in Java, writing computer programs to solve
specified problems. Use the Java SDK environment to create, debug and run simple Java
programs

COURSE ARTICULATION MATRIX(Correlation between COs&POs,PSOs):


Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO At the end of the course, 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
student will be able to
1 Differentiate various
searching and sorting 3 2 2 2 1
algorithms.
2 Use Linear Data Structures
like stacks, queues and 3 2 2 2 1
linked lists
3 Employ OOP concepts in
JAVA. 3 2 2 2 1

4 Choose an engineering
approach to solving
3 2 2 2 1
problems

5 Propose the use of certain


java programming concepts
3 2 2 2 1
to solve the given problems

Note: Enter Correlation Levels 1 or 2 or 3. If there is no correlation, put ‘-’


1- Slight (Low), 2 - Moderate (Medium), 3 - Substantial (High).

BOS APPROVED REFERENCE BOOKS:


1 Data Structures: A Pseudocode approach, Richard F. Gilberg, Behrouz A.
Forouzen, cengage.
2 Herbert Schildt, “The Complete Reference JAVA J2SE”. 7th Edition, TMH,
new delhi, 2009.
BOS APPROVED REFERENCE BOOKS:
1 Horowitz and sahani ,”Fundamentals of Data Structures”, Galgotia,
1st edition, 1999.
2 H.M.Dietel and P.J.Dietel, “JAVA How to Program”, Sixth Edition,
Pearson Education/ PHI, 2007.

DS & OOP LAB SCHEDULE (LESSON PLAN): Section-B


BATCH-1
No. of Tentative Actual Teaching HOD
S.No. Experiments to be conducted Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear


516. 3 30.12.16
search, Binary search
Bubble sort, Selection sort,
517. 3 06.01.17
Insertion sort

518. Quick sort, Merge sort 3 20.01.17

519. Implement Stack using Arrays 3 27.01.17

520. Implement Queue using Arrays 3 03.02.17

Implement the Single Linked list


521. 3 10.02.17
with all operations
Implement the Double Linked list
522. 3 17.02.17
with all operations

CYCLE-2

1. Write a JAVA program to find


the sum of individual digits of a
positive integer.
2. Write a JAVA program to
generate the first ‘n’ terms of the
sequence. A Fibonacci sequence is
defined as follows: the first and
523. second terms in the sequence are 0 3 03.03.17
and 1.Subsequent terms are formed
by adding the preceding two terms
in the sequence.
3. Write a JAVA program to
generate all the prime numbers
between 1 and n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use
both recursive and non-recursive
524. 3 10.03.17
functions
a) To find the factorial of a given
integer.
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci number.
1.Write a Java program to perform
Matrix Multiplication
2. Write a JAVA program to
implement static data members and
525. 3 17.03.17
static member
Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write C++ programs that
illustrate the usage of following
526. forms of inheritance. 3 24.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to
implement Method over Loading
and Method overriding
527. 2. Write a Java program by using 3 31.03.17
this and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism
by dynamic method dispatch.
528. 2. Write a Java program using 3 07.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally
block
2. Write a Java program by using
529. 3 14.04.17
Exception handling Mechanism
including, Finally
Block?
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
530. 2. Write a Java program to 3 21.04.17
implement Inter thread
communication
531. Lab internal Exam 3 28.04.17

No. of classes required to complete LAB 48 No. of classes conducted:


BATCH-2
No. of Tentative Actual Teaching HOD
S.No. Topics to be covered Classes Date of Date of Learning Sign
Required Completion Completion Methods Weekly

CYCLE-1

Sample C Programs & Linear


3. search, Binary search
3 02.01.17

Bubble sort, Selection sort,


32. 3 09.01.17
Insertion sort
33. Quick sort, Merge sort 3 16.01.17

34. Implement Stack using Arrays 3 23.01.17

35. Implement Queue using Arrays 3 30.01.17

Implement the Single Linked list


36. 3 06.02.17
with all operations
Implement the Double Linked list
37. 3 13.02.17
with all operations
CYCLE-2

1. Write a JAVA program to find


the sum of individual digits of a
positive integer.
2. Write a JAVA program to
generate the first ‘n’ terms of the
sequence. A Fibonacci sequence is
defined as follows: the first and
38. second terms in the sequence are 0 3 27.02.17
and 1.Subsequent terms are formed
by adding the preceding two terms
in the sequence.
3. Write a JAVA program to
generate all the prime numbers
between 1 and n. Where ‘n’ is
a value supplied by the user.
Write a JAVA programs that use
both recursive and non-recursive
functions
a) To find the factorial of a given
39. integer. 3 06.03.17
b) To find the GCD of two given
integers.
c) To find the nth Fibonacci
number.
1.Write a Java program to perform
Matrix Multiplication
2. Write a JAVA program to
40. 3 13.03.17
implement static data members and
static member
Functions
3. Write a Java program using
constructors
1.Write a Java program for
constructor overloading
2. Write C++ programs that
illustrate the usage of following
41. forms of inheritance. 3 20.03.17
a) Single Inheritance b) Multiple
Inheritance
c) Multi level Inheritance d)
Hierarchical Inheritance
1.Write a Java program to
implement Method over Loading
and Method overriding
42. 2. Write a Java program by using 3 27.03.17
this and super key word.
3. Write a Java program by using
final variables and final methods
1. Write a JAVA program that
illustrates run time polymorphism
by dynamic method dispatch.
43. 2. Write a Java program using 3 03.04.17
abstract class
3. Write a Java program on
demonstration of packages
1. Write a Java program by using
Exception handling Mechanism
including, Finally
block
2. Write a Java program by using
44. 3 10.04.17
Exception handling Mechanism
including, Finally
Block?
3. Write a Java program to create
Multithreads
1. Write a Java program on Thread
Synchronization
45. 2. Write a Java program to 3 17.04.17
implement Inter thread
communication
46. Lab internal Exam 3 24.04.17

No. of classes required to complete LAB 48 No. of classes conducted:

Contents beyond the Syllabus

- Programs on DEQ
- Programs on CIQ
- Programs on array
- Programs on memory management functions
- Sample java introduction programs
- Sample programs on call-by-value and call-by-reference
- Sample programs on super, this, final keywords
Teaching Learning Methods
TLM1 Chalk and Talk TLM4 Problem Solving TLM7 Seminars or GD
TLM2 PPT TLM5 Programming TLM8 Lab Demo
TLM3 Tutorial TLM6 Assignment or Quiz TLM9 Case Study

ACADEMIC CALENDAR:
Description From To Weeks
I Phase of Instructions-1 27-12-2016 18-02-2017 7W
I Mid Examinations 20-02-2017 27-02-2017 1W
II Phase of Instructions 28-02-2017 29-04-2017 9W
II Mid Examinations 01-05-2017 06-05-2017 1W
Preparation and Practicals 08-05-2017 13-05-2017 1W
Semester End Examinations 15-05-2017 27-05-2017 2W

EVALUATION PROCESS:
Evaluation Task COs Marks
Day to Day work 1 A1=10
Record Writing 2 A2=5
Internal Lab Examination 1,2 B=10
Cumulative Internal Examination : A+B 3 A+B=25
Semester End Examinations 4 C=50
Total Marks: A+B+C 5 75

Mr.S Srinivasa Reddy Mr.P.Ashok Reddy Mr.M.Hema Latha I Rajendra Kumar I Rajendra Kumar
Course Instructor Course Coordinator Module Coordinator Research Coordinator BOS Chairman&HOD

You might also like