LESSON PLAN Faculty Name: Mr. P.Rakesh Kumar Date: 19-07 ...

LESSON PLAN

Faculty Name: Mr. P.Rakesh Kumar Date: 19-07-2012

Year: III Semester Branch:CSE-B Sec

Subject: ELECTRONIC DEVICES AND CIRUITS Subject Code: T188

S.No. Day Date Topic Topics

Covered Remarks

UNIT – 1(JUNCTION DIODE CHARACTERSTICS)

1 Wednesday 18/7/2012 Introduction to EDC

2 Thursday 19 Review of Semiconductor Physics

3 Saturday 21 N-Type Semiconductors

4 Monday 23 P-Type Semiconductors

5 Tuesday 24 Mass Action Law

6 Wednesday 25 Continuity Equation

7 Thursday 26 Hall Effect

8 Saturday 28 TUTORIAL

9 Monday 30 Fermi Level of Semiconductors

10 Tuesday 31 Energy band diagram of PN Diode

11 Wednesday 1/8/2012 PN Diode biasing

12 Thursday 2 Current Components, Diode Equation

13 Saturday 4 TUTORIAL

14 Monday 6 VI Characteristic

15 Tuesday 7 Temperature dependence of VI Char.

16 Wednesday 8 Transition and Diffusion capacitance

17 Thursday 9 Breakdown Mechanisms in PN Diode

18 Monday 13 TUTORIAL

19 Tuesday 14 Zener Diode, Tunnel Diode

20 Thursday 16 Varactor Diode, LED

21 Saturday 18 LCD, Photo Diode.

UNIT – 2(RECTIFIERS AND FILTES) 21

22 Tuesday 21 Half wave Rectifier

23 Wednesday 22 Full Wave Rectifier with center tap transformer

24 Thursday 23 Full Wave Bridge Rectifier

25 Saturday 25 Harmonic Components in a Rectifier circuit


S.No. Week Date Topic Topics

Covered Remarks

27 Tuesday 28 Inductor, Capacitor, LC Filter

28 Wednesday 29 Pi-Section, Multiple L-Section & Multi Pi Section Filter

29 Thursday 30 Comparison of Filters

30 Saturday 1/9/2012 TUTORIAL

I - Mid Exams

Chapter - 3

31 Monday 10 Junction Transistor, Transistor Current Components

32 Tuesday 11 Transistor as an Amplifier, Transistor Construction

33 Wednesday 12 Current Components in a Transistor

34 Thursday 13 Input and Output characteristics of Transistor in

Common Base

35 Saturday 15 Input and Output characteristics of Transistor in

Common Emitter


37 Tuesday 18 Input and Output characteristics of Transistor in

Common Collector

38 Thursday 20 Relation between Alpha, Beta, and Gama

39 Saturday 22 FET-JFET Characteristics

40 Monday 24 Small Signal Model of JFET, MOSFET Characteristics

41 Tuesday 25 Comparison of Transistors, Introduction to SCR and UJT

42 Wednesday 26 TUTORIAL

Chapter - 4

43 Thursday 27 BJT biasing

44 Saturday 29 DC Equivalent Model

45 Monday 1/10/2012 Criteria for fixing Operating Point

46 Wednesday 3 Fixed Bias

47 Thursday 4 TUTORIAL

48 Saturday 6 Collector to base Bias

49 Monday 8 Self bias techniques for Stability

50 Tuesday 9 Stability Factors (S,Ś,S΄΄)

51 Wednesday 10 Compensation techniques

52 Thursday 11 Thermal Run Away, Thermal Stability


Chapter - 5

54 Tuesday 16 h-Parameter representation of a transistor.

55 Wednesday 17 Analysis of: Voltage, Current gain, I/p & O/p Impedance.


Covered Remarks

56 Thursday 18 Comparison of Transistor: in terms of Ai, Ri, Av, Ro.

57 Saturday 20 Introduction to Feedback Amplifier and Feedback Oscillators

58 Tuesday 23 TUTORIAL

59 Thursday 25 Revision (Chapter 1)

60 Monday 29 Revision (Chapter 2)

61 Tuesday 30 Revision (Chapter 3)

62 Wednesday 31 Revision (Chapter 2)

63 Thursday 1/11/2012 Revision (Chapter 3)

Revision (Chapter 4)

64 Saturday 3 Advanced Topics(Compound configration)

65 Monday 5 Advanced Topics(coupled amplifiers)

66 Tuesday 6 Advanced Topics(tuned amplifiers)

67 Wednesday 7 Advanced Topics(Integrated electronics)

68 Thursday 8 Advanced Topics(power supplies)

II - Mid Exams

Signature of Faculty Signature of Head of Department

LESSON PLAN

Sub Name : DIGITAL LOGIC DESIGN LAB

Branch: CSE Semester: III

Date: 18.07.12

To 17.11.12

CS351: DIGITAL LOGIC DESIGN LAB

Lecture : 3 Periods/week Internal Marks : 25

Tutorial External Marks : 75

Credits : 2 External Examination : 3 Hrs

---------------------------------------------------------------------------------------------------------------

CYCLE 1

1.a) Basic Gates Function Verification using truth tables.

i) AND Gate using 7408 IC

ii) OR Gate using 7432 IC

iii) NOT Gate using 7404 IC

b) Universal Gates Functional Verification

i) NAND Gate using 7400 IC

ii) NOR Gate using 7402 IC

c) Special Gates Functional verification

i) XOR Gate using 7486 IC

ii) XNOR Gate using XOR followed by NOT Gate

2. Realization of following gates using universal gates and its functional verification.

AND, OR, XOR, NOT

3. a) Design Half-adder and Full-adder circuits and verify its functionality.

b) Verify the functionality of four bit ripple carry adder for signed and unsigned integers with the

verification of overflow condition.

4. Design a four bit comparator and verify its functionality(using logic gates or IC’s)

5. Design a BCD to Excess-3 code converter and verify its functionality by using gates.

6. Design a BCD to Gray code converter and verify its functionality by using gates.

7. Design and verify the functionality of Decoders and multiplexers of different inputs.

CYCLE 2

8. Verify the functionality of following Flip-Flops.

a) SR Flip-Flop

b) JK Flip-Flop

c) D Flip-Flop

d) T Flip-Flop

9. a) Design a UP-Counter using JK/T Flip-Flop.

b) Design a MOD-3 Counter.

10. Design a DOWN-Counter using JK/T Flip-Flop.

11. Design a Bi-directional Counter using JK/T Flip-Flop.

12. Design a Synchronous Counter for 100-110-111-011-001

LAB PLAN


Branch: CSE (sec-A) Semester: III

Date: 18.07.12

To 17.11.12

COURSE OBJECTIVE:

The course will provide the student with a firm foundation of the principles of digital design

by building a working knowledge of digital electronics and its applications. By the end of the semester,

the student shall have acquired the basic skill in using the digital design kit;

● Use of prototyping board.

● Use of basic gates, decoders and multiplexers.

● Use of PLDs

● Use of flip-flops, counters and shift registers.

● Use of logic probe.

COURSE OUTCOMES:

A student who successfully fulfills the course requirements will have demonstrated:

1. An ability to operate laboratory equipment.

2. An ability to construct, analyzes, and troubleshoots simple combinational and sequential circuits.

3. An ability to design and troubleshoot a simple state machine.

4. An ability to measure and record the experimental data, analyze the results, and prepare a formal

laboratory report.

LAB PLAN



Date: 18.07.12

To 17.11.12

Lesson Plan For CSE(SEC-A)

CYCLE-I

Program: 1

Basic gates(AND, OR, NOT), Universal gates(NAND, NOR) and Special gates(XOR, XNOR)

function verification using truth tables.

Session

No

Topics to be covered

Date

Teaching

Method

Remarks

1 Introduction to logisim software 18.07.2012 BB

2 Basic gates verification 25.07.2012 BB

Program: 2

Realize the gates(AND,OR, NOT, XOR) using the universal gates(NAND, NOR) and also prove

the theorems of Boolean algebra.

Session

No


Date

Teaching

Method

Remarks

3 Realization of AND, OR, NOT, XOR gates 01.08.2012 BB

Program: 3

Designing the half adder, full adder, half subtractor, full subtractor and the ripple carry adder

of digital circuits.

Session

No


Date

Teaching

Method

Remarks

6 Half adder, Full adder, Half subtractor 08.08.2012 BB

7 Full subtractor, Ripple carry adder 22.08.2012 BB

Program:4

Designing the four bit comparator and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

8 Four bit comparator 29.08.2012 BB

LAB PLAN



Date: 18.07.12

To 17.11.12

Program:5

Designing the BCD to Excess-3 code converter and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

9 BCD to Excess-3 code converter 12.09.2012 BB

Program:6

Designing the BCD to Gray code converter and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

9 BCD to Gray code converter 26.09.2012 BB

Program:7

Verify the functionality of decoders and multiplexers.

Session

No


Date

Teaching

Method

Remarks

10 Decoders, Multiplexer 03.10.2012 BB

CYCLE-II

Program:8

Verify the functionality of J-K Flip-flop, D-Flip-flop, T- Flip-flop, S-R Flip-flop.

Session

No


Date

Teaching

Method

Remarks

11 Flip-flops 10.10.2012 BB

Program:9

Design the UP and Mod-3 counter using JK/T Flip-flops

Session

No


Date

Teaching

Method

Remarks

12 UP counter 17.10.2012 BB

13 Mod-3 counter 31.10.2012 BB

LAB PLAN

Date: 18.07.12

To 17.11.12



Program:10

Design the Down counter using JK/T Flip-flops

Session

No


Date

Teaching

Method

Remarks

14 Down counter 31.10.2012 BB

Program:11

Design the Bidirectional counter using JK/T Flip-flops

Session

No


Date

Teaching

Method

Remarks

14 Bidirectional counter 07.11.2012 BB

Program:12

Design a Synchronous Counter for 100-110-111-011-001

Session

No


Date

Teaching

Method

Remarks


16 exam 14.11.2012 BB

LESSON PLAN

Date: 18.07.12

To 17.11.12


Branch: CSE Semester: III

CS351: DIGITAL LOGIC DESIGN LAB

Lecture : 3 Periods/week Internal Marks : 25

Tutorial External Marks : 75


---------------------------------------------------------------------------------------------------------------

CYCLE 1

1.a) Basic Gates Function Verification using truth tables.

i) AND Gate using 7408 IC

ii) OR Gate using 7432 IC

iii) NOT Gate using 7404 IC

b) Universal Gates Functional Verification

i) NAND Gate using 7400 IC

ii) NOR Gate using 7402 IC

c) Special Gates Functional verification

i) XOR Gate using 7486 IC

ii) XNOR Gate using XOR followed by NOT Gate

2. Realization of following gates using universal gates and its functional verification.

AND, OR, XOR, NOT

3. a) Design Half-adder and Full-adder circuits and verify its functionality.

b) Verify the functionality of four bit ripple carry adder for signed and unsigned integers with the

verification of overflow condition.

4. Design a four bit comparator and verify its functionality(using logic gates or IC’s)

5. Design a BCD to Excess-3 code converter and verify its functionality by using gates.

6. Design a BCD to Gray code converter and verify its functionality by using gates.

7. Design and verify the functionality of Decoders and multiplexers of different inputs.

CYCLE 2

8. Verify the functionality of following Flip-Flops.

a) SR Flip-Flop

b) JK Flip-Flop

c) D Flip-Flop

d) T Flip-Flop

9. a) Design a UP-Counter using JK/T Flip-Flop.

b) Design a MOD-3 Counter.

10. Design a DOWN-Counter using JK/T Flip-Flop.

11. Design a Bi-directional Counter using JK/T Flip-Flop.

12. Design a Synchronous Counter for 100-110-111-011-001

LAB PLAN

Date: 18.07.12

To 17.11.12


Branch: CSE (sec-B) Semester: III

COURSE OBJECTIVE:

The course will provide the student with a firm foundation of the principles of digital design

by building a working knowledge of digital electronics and its applications. By the end of the semester,

the student shall have acquired the basic skill in using the digital design kit;

● Use of prototyping board.

● Use of basic gates, decoders and multiplexers.

● Use of PLDs

● Use of flip-flops, counters and shift registers.

● Use of logic probe.

COURSE OUTCOMES:

A student who successfully fulfills the course requirements will have demonstrated:

1. An ability to operate laboratory equipment.

2. An ability to construct, analyzes, and troubleshoots simple combinational and sequential circuits.

3. An ability to design and troubleshoot a simple state machine.

4. An ability to measure and record the experimental data, analyze the results, and prepare a formal

laboratory report.

LAB PLAN

Date: 18.07.12

To 17.11.12



Lesson Plan For CSE(SEC-A)

CYCLE-I

Program: 1

Basic gates(AND, OR, NOT), Universal gates(NAND, NOR) and Special gates(XOR, XNOR)

function verification using truth tables.

Session

No


Date

Teaching

Method

Remarks

1 Introduction to logisim software 18.07.2012 BB

2 Basic gates verification 25.07.2012 BB

Program: 2

Realize the gates(AND,OR, NOT, XOR) using the universal gates(NAND, NOR) and also prove

the theorems of Boolean algebra.

Session

No


Date

Teaching

Method

Remarks

3 Realization of AND, OR, NOT, XOR gates 01.08.2012 BB

Program: 3

Designing the half adder, full adder, half subtractor, full subtractor and the ripple carry adder

of digital circuits.

Session

No


Date

Teaching

Method

Remarks

6 Half adder, Full adder, Half subtractor 08.08.2012 BB

7 Full subtractor, Ripple carry adder 22.08.2012 BB

Program:4

Designing the four bit comparator and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

8 Four bit comparator 29.08.2012 BB

LAB PLAN

Date: 18.07.12

To 17.11.12



Program:5

Designing the BCD to Excess-3 code converter and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

9 BCD to Excess-3 code converter 12.09.2012 BB

Program:6

Designing the BCD to Gray code converter and verify the functionality.

Session

No


Date

Teaching

Method

Remarks

9 BCD to Gray code converter 26.09.2012 BB

Program:7

Verify the functionality of decoders and multiplexers.

Session

No


Date

Teaching

Method

Remarks

10 Decoders, Multiplexer 03.10.2012 BB

CYCLE-II

Program:8

Verify the functionality of J-K Flip-flop, D-Flip-flop, T- Flip-flop, S-R Flip-flop.

Session

No


Date

Teaching

Method

Remarks

11 Flip-flops 10.10.2012 BB

Program:9

Design the UP and Mod-3 counter using JK/T Flip-flops

Session


Teaching

Method

Remarks

No Date

12 UP counter 17.10.2012 BB

13 Mod-3 counter 31.10.2012 BB

LAB PLAN

Date: 18.07.12

To 17.11.12



Program:10

Design the Down counter using JK/T Flip-flops

Session

No


Date

Teaching

Method

Remarks


Program:11

Design the Bidirectional counter using JK/T Flip-flops

Session

No


Date

Teaching

Method

Remarks

14 Bidirectional counter 07.11.2012 BB

Program:12

Design a Synchronous Counter for 100-110-111-011-001

Session

No


Date

Teaching

Method

Remarks


16 exam 14.11.2012 BB

UNIT - I

Binary Systems: Digital Computers and Digital Systems, Binary Numbers, Number base Conversion,

Octal and Hexadecimal Numbers, Complements, Binary Codes, Binary Storage and Registers, Binary

Logic, Integrated Circuits. Boolean Algebra And Logic Gates: Basic Definitions, Axiomatic definition of

Boolean Algebra, Basic theorems and Properties of Boolean Algebra, Boolean functions, Canonical

and Standard Forms, Other operations, Digital Logic Gates.

UNIT - II

Simplification Of Boolean Expressions: Formulation of simplification problem, Prime Implicants and

irredundant disjunctive and conjunctive expression, Karnaugh Maps, Minimal Expressions for

complete and incomplete Boolean functions. Five and Six Variable K-Maps, Quine-McCluskey Method,

Prime Implicants and Implicate tables and irredundant expressions, and Table reductions.

UNIT - III

Combinational Logic: Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure,

multilevel NAND and NOR circuits. Combinational Logic with MSI And LSI: Binary Parallel Adder,

Decimal Adder, Magnitude Comparator, Decoders, Multiplexers.

UNIT - IV

Sequential Logic: Flip Flops, Triggering of Flip-Flops, Analysis of Clocked Sequential Circuits, State

Reduction and Assignment, Flip-Flop Excitation tables, Design Procedure, Design of Counters, Design

with state equations Registers, Counters and Memory : Registers. Shift registers, Ripple Counters,

Synchronous Counters, Timing sequences, the memory unit.

UNIT - V

Programmable Logic: Read – Only Memory (ROM), PROM, Programmable Logic Device (PLD),

Programmable Logic Array (PLA), Programmable Array Logic (PAL).

Course Description & Objectives: This course concerns the design of digital systems using integrated circuits. The main

emphasis is on the theoretical concepts and systematic synthesis techniques that can be applied

to the design of practical digital systems.

Course Objectives:

The objective of the course is to explain how digital circuit of large complexity can be

built in a methodological way, starting from Boolean logic and applying a set of rigorous

techniques. Numerous examples and case studies will be used to illustrate how the concepts

presented in the lectures are applied in practice, and how the need to accommodate different

practically-motivated trade-offs can lead to alternative implementations. The students will

apply their knowledge in the labs by building increasingly more complex digital logic circuits.

Course Outlines:

First unit deals with the digital systems and various binary number systems. It deals

with various methods for the conversion of numbers in one system to another. It covers

various types of codes which includes codes for error correction and detection. It

introduces the theory of Boolean algebra.

Second unit introduces K-map method which is a straight forward graphical method for

simplification and quine-Mcclusky method is explained.

Third unit explains the principles of various combinational logic circuits. These Include

adders, subtractors, multiplexer, demultiplexers, decoders, encoders and comparators.

Fourth unit explains the basic theory behind various flip-flops. It also explain the design

procedure for various asynchronous counters, synchronous counters and sequence

generators. It also explain the registers and memory unit.

Fifth unit deals with the various types of memories like ROM, PROM, PLA and PAL’s.

Student Learning Outcomes: Upon the successful completion of this course students will be able to:

1. Solve basic binary math operations using the logic gates. 2. Demonstrate programming proficiency using the various logical elements to design practically motivated logical units.

3. Design different units that are elements of typical computer’s CPU. 4. Apply knowledge of the logic design course to solve problems of designing of control units of different input/output devices.

5. Wiring different logical elements, to analyze and demonstrate timing diagrams of the units modeled.

6. Design electrical circuitry using logical elements realized on the base of different technologies.

Session

No


Date

Teaching

Method

Remarks

1 Introduction to Digital Systems 28.12.2015 BB

2 Digital Systems, Binary Numbers 29.12.2015 BB

3 Number base Conversion 30.12.2015 BB


5 Octal and Hexadecimal Numbers 02.01.2016 BB

6 Complements 04.01.2016 BB

7 Binary Codes 05.01.2016 BB


9 Binary Storage and Registers,

Binary Logic 07.01.2015

BB

10 Integrated Circuits 09.01.2016 BB

11 Tutorial 18.01.2016 BB

12 Introduction to Boolean algebra,

Basic Definitions, Axiomatic

definition of Boolean Algebra

19.01.2016 BB

13 Basic theorems and Properties of

Boolean Algebra 20.01.2016

BB

14 Boolean functions 21.01.2016 BB

15 Canonical and Standard Forms 23.01.2016 BB


17 Other operations, Digital Logic

Gates 27.01.2016

BB

18 Slip test on UNIT-1 28.01.2016 BB

19 Simplification Of Boolean

Expressions 30.01.2016

BB

20 Introduction to Karnaugh Maps 01.02.2016 BB

21 One Variable, Two variable, Three

Variable maps

02.02.2016 BB

22 Four Variable Map 03.02.2016 BB


24 Five Variable K-Map and Examples 06.02.2016 BB

25 Six Variable K-Maps Examples 08.02.2016 BB

26 Minimal Expressions for incomplete

Boolean functions

09.02.2016 BB

27 Quine-McCluskey Method 10.02.2016 BB

28 Prime implicants and Essential

Prime Implicants

11.02.2016 BB

29 Pertickson Method for irredundant

expression

13.02.2016 BB

30 Slip Test on UNIT-2 15.02.2016 BB

31 Introduction to Combinational

Logic, Design Procedure, Analysis

Procedure

16.02.2016 BB

32 Adders 17.02.2016 BB

33 Subtractors 18.02.2016 BB

34 Code Conversion 20.02.2016 BB

35 Multilevel NAND circuits 29.02.2016 BB

36 Multilevel NOR circuits 01.03.2016 BB


38 Intoduction to Combinational Logic

with MSI And LSI

01.03.2016 BB

39 Binary Parallel Adder, Decimal

Adder

02.03.2016 BB

40 Decimal Adder 03.03.2016 BB

41 Magnitude Comparator 07.03.2016 BB

42 Decoders 08.03.2016 BB

43 Multiplexers 09.03.2016 BB



46 Introduction to Sequential Logic,

Flip Flops

14.03.2016 BB

47 Triggering of Flip-Flops, 15.03.2016 BB

48 Analysis of Clocked Sequential

Circuits

16.03.2016 BB

49 State Reduction and Assignment 17.03.2016 BB

50 Flip-Flop Excitation tables 19.03.2016 BB

51 Design Procedure 21.03.2016 BB

52 Design of Counters 22.03.2016 BB

53 Introduction to Registers, Shift

registers

23.03.2016 BB

54 Ripple Counters 24.03.2016 BB

56 Synchronous Counters 26.03.2016 BB

57 Timing sequences 28.03.2016 BB

58 the memory unit 29.03.2016 BB


61 Slip test on Unit-4 31.03.2016 BB

62 Read – Only Memory (ROM) 02.04.2016 BB

63 Programmable Read Only memory 04.04.2016 BB

64 Programmable Logic Device (PLD) 05.04.2016 BB

65 Programmable Logic Array 06.04.2016 BB

66 Programmable Array Logic (PAL). 07.04.2016 BB



69 Revision 12.04.2016 BB




73 Content beyond syllabus/Tools 18.04.2016 BB

74 Content beyond syllabus/Research

papers

20.04.2016 BB

75 Content beyond syllabus/New

applications

21.04.2016 BB

76 Content beyond syllabus/R & D 23.04.2016 BB

77 Practice 25.04.2016 BB





TEXT BOOKS :

M.Morris Mano, ‘Digital Logic and Computer Design’, PHI.

REFERENCES :

1. M.Morris Mano, ‘Computer Engineering Hardware Design’, PHI

2. Donald e Givone, Digital principles and Design, TMH (Unit II and V)

Course Delivery Plan:

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

Units 1 1 1 1 2 2 2 3

3 3 4 4 4 5 5 R R R

Prepared by Approved by

Signature

Name E.RAVI KUMAR HOD/CSE

Designation Asst. Professor Professor

UNIT - I

Binary Systems: Digital Computers and Digital Systems, Binary Numbers, Number base Conversion,

Octal and Hexadecimal Numbers, Complements, Binary Codes, Binary Storage and Registers, Binary

Logic, Integrated Circuits. Boolean Algebra And Logic Gates: Basic Definitions, Axiomatic definition of

Boolean Algebra, Basic theorems and Properties of Boolean Algebra, Boolean functions, Canonical

and Standard Forms, Other operations, Digital Logic Gates.

UNIT - II

Simplification Of Boolean Expressions: Formulation of simplification problem, Prime Implicants and

irredundant disjunctive and conjunctive expression, Karnaugh Maps, Minimal Expressions for

complete and incomplete Boolean functions. Five and Six Variable K-Maps, Quine-McCluskey Method,

Prime Implicants and Implicate tables and irredundant expressions, and Table reductions.

UNIT - III

Combinational Logic: Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure,

multilevel NAND and NOR circuits. Combinational Logic with MSI And LSI: Binary Parallel Adder,

Decimal Adder, Magnitude Comparator, Decoders, Multiplexers.

UNIT - IV

Sequential Logic: Flip Flops, Triggering of Flip-Flops, Analysis of Clocked Sequential Circuits, State

Reduction and Assignment, Flip-Flop Excitation tables, Design Procedure, Design of Counters, Design

with state equations Registers, Counters and Memory : Registers. Shift registers, Ripple Counters,

Synchronous Counters, Timing sequences, the memory unit.

UNIT - V

Programmable Logic: Read – Only Memory (ROM), PROM, Programmable Logic Device (PLD),

Programmable Logic Array (PLA), Programmable Array Logic (PAL).

Course Description & Objectives: This course concerns the design of digital systems using integrated circuits. The main

emphasis is on the theoretical concepts and systematic synthesis techniques that can be applied

to the design of practical digital systems.

Course Objectives:

The objective of the course is to explain how digital circuit of large complexity can be

built in a methodological way, starting from Boolean logic and applying a set of rigorous

techniques. Numerous examples and case studies will be used to illustrate how the concepts

presented in the lectures are applied in practice, and how the need to accommodate different

practically-motivated trade-offs can lead to alternative implementations. The students will

apply their knowledge in the labs by building increasingly more complex digital logic circuits.

Course Outlines:

First unit deals with the digital systems and various binary number systems. It deals

with various methods for the conversion of numbers in one system to another. It covers

various types of codes which includes codes for error correction and detection. It

introduces the theory of Boolean algebra.

Second unit introduces K-map method which is a straight forward graphical method for

simplification and quine-Mcclusky method is explained.

Third unit explains the principles of various combinational logic circuits. These Include

adders, subtractors, multiplexer, demultiplexers, decoders, encoders and comparators.

Fourth unit explains the basic theory behind various flip-flops. It also explain the design

procedure for various asynchronous counters, synchronous counters and sequence

generators. It also explain the registers and memory unit.

Fifth unit deals with the various types of memories like ROM, PROM, PLA and PAL’s.

Student Learning Outcomes: Upon the successful completion of this course students will be able to:

7. Solve basic binary math operations using the logic gates. 8. Demonstrate programming proficiency using the various logical elements to design practically motivated logical units.

9. Design different units that are elements of typical computer’s CPU. 10. Apply knowledge of the logic design course to solve problems of designing of control

units of different input/output devices.

11. Wiring different logical elements, to analyze and demonstrate timing diagrams of the units modeled.

12. Design electrical circuitry using logical elements realized on the base of different technologies.

Session

No


Date

Teaching

Method

Remarks

1 Introduction to Digital Systems 28.12.2015 BB

2 Digital Systems, Binary Numbers 29.12.2015 BB



5 Octal and Hexadecimal Numbers 02.01.2016 BB

6 Complements 04.01.2016 BB



9 Binary Storage and Registers,

Binary Logic 07.01.2015

BB

10 Integrated Circuits 09.01.2016 BB


12 Introduction to Boolean algebra,

Basic Definitions, Axiomatic

definition of Boolean Algebra

19.01.2016 BB

13 Basic theorems and Properties of

Boolean Algebra 20.01.2016

BB

14 Boolean functions 21.01.2016 BB



17 Other operations, Digital Logic

Gates 27.01.2016

BB


19 Simplification Of Boolean

Expressions 30.01.2016

BB

20 Introduction to Karnaugh Maps 01.02.2016 BB

21 One Variable, Two variable, Three

Variable maps

02.02.2016 BB

22 Four Variable Map 03.02.2016 BB


24 Five Variable K-Map and Examples 06.02.2016 BB

25 Six Variable K-Maps Examples 08.02.2016 BB

26 Minimal Expressions for incomplete

Boolean functions

09.02.2016 BB

27 Quine-McCluskey Method 10.02.2016 BB

28 Prime implicants and Essential

Prime Implicants

11.02.2016 BB

29 Pertickson Method for irredundant

expression

13.02.2016 BB


31 Introduction to Combinational

Logic, Design Procedure, Analysis

Procedure

16.02.2016 BB

32 Adders 17.02.2016 BB

33 Subtractors 18.02.2016 BB

34 Code Conversion 20.02.2016 BB

35 Multilevel NAND circuits 29.02.2016 BB

36 Multilevel NOR circuits 01.03.2016 BB


38 Intoduction to Combinational Logic

with MSI And LSI

01.03.2016 BB

39 Binary Parallel Adder, Decimal

Adder

02.03.2016 BB

40 Decimal Adder 03.03.2016 BB

41 Magnitude Comparator 07.03.2016 BB

42 Decoders 08.03.2016 BB

43 Multiplexers 09.03.2016 BB



46 Introduction to Sequential Logic,

Flip Flops

14.03.2016 BB

47 Triggering of Flip-Flops, 15.03.2016 BB

48 Analysis of Clocked Sequential

Circuits

16.03.2016 BB

49 State Reduction and Assignment 17.03.2016 BB

50 Flip-Flop Excitation tables 19.03.2016 BB

51 Design Procedure 21.03.2016 BB

52 Design of Counters 22.03.2016 BB

53 Introduction to Registers, Shift

registers

23.03.2016 BB

54 Ripple Counters 24.03.2016 BB

56 Synchronous Counters 26.03.2016 BB

57 Timing sequences 28.03.2016 BB

58 the memory unit 29.03.2016 BB


61 Slip test on Unit-4 31.03.2016 BB

62 Read – Only Memory (ROM) 02.04.2016 BB

63 Programmable Read Only memory 04.04.2016 BB

64 Programmable Logic Device (PLD) 05.04.2016 BB

65 Programmable Logic Array 06.04.2016 BB

66 Programmable Array Logic (PAL). 07.04.2016 BB







73 Content beyond syllabus/Tools 18.04.2016 BB

74 Content beyond syllabus/Research

papers

20.04.2016 BB

75 Content beyond syllabus/New

applications

21.04.2016 BB

76 Content beyond syllabus/R & D 23.04.2016 BB






TEXT BOOKS :

M.Morris Mano, ‘Digital Logic and Computer Design’, PHI.

REFERENCES :

1. M.Morris Mano, ‘Computer Engineering Hardware Design’, PHI

2. Donald e Givone, Digital principles and Design, TMH (Unit II and V)

Course Delivery Plan:

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

Units 1 1 1 1 2 2 2 3

3 3 4 4 4 5 5 R R R


Signature

Name E.RAVI KUMAR HOD/CSE

Designation Asst. Professor Professor

Course Description:

The Discrete Mathematical Structures subject gives the ability to solve the large logical

problems which applicable in research area. In this subject each unit gives different types of problems

which applied in different areas. This subject covers mathematical logic for statement calculus and

predicate calculus, normal forms, predicate logic, inference theory for statement calculus and

predicate calculus, set theory on relations and function, algebraic structures, permutations,

combinations, binomial, multinomial theorems, directed & undirected graphs, trees, spanning trees,

its algorithms, minimum spanning trees, its algorithms, and solving recurrence relations with different

procedures.

Course Key Points:

First unit covers Mathematical logic for Statement calculus and Predicate calculus, inference

theory for Statement calculus and Predicate calculus, Normal forms equivalences and logical

implications.

Second unit deals about set theory in all relations and functions.

Third unit covers the graph theory about its types, properties, algorithms, and coloring.

Fourth unit covers algebraic structures and Combinatorics.

Fifth unit deals with recurrence relations using generating functions and characteristic roots.

Outcomes:

All undergraduates will have

An ability to apply knowledge of mathematical logic for computer science and engineering.

An ability to identify, formulates, and solves engineering problems.

By using the graph theory the person can easily understands the network topologies in real

time applications.

By using this subject the person get knowledge about the applications of discrete structures and

computing, combinatorics, and graph theory.

Sub Name : DISCRETE MATHEMATICAL STRUCTURES

Faculty Name: B.Shyamala Branch: CSE

Class: II B.Tech Semester: I

Date:

To

Page

UNIT I:

Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Truth Tables, Tautologies,

Equivalence of Formulas, Duality law, Tautological Implications, Normal Forms, Theory of Inference for

Statement Calculus, Consistency of Premises, Indirect Method of Proof. Predicate calculus: Predicative Logic,

Statement Functions, Variables and Quantifiers, Free & Bound Variables, Inference theory for predicate calculus.

UNIT II:

Set Theory: Introduction, Operations on Binary Sets, Principle of Inclusion and Exclusion

Relations: Properties of Binary Relations, Relation Matrix and Digraph, Operations on Relations, Partition and

Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering Relations, Hasse Diagrams.

Functions: Bijective Functions, Composition of Functions, Inverse Functions, Permutation Functions, Recursive

Functions

UNIT III:

Graph Theory: Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs: Adjacency Matrices,

Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian Graphs, Multigraphs,

(Problems and Theorems without proofs), Graph Theory II: Planar Graphs, Euler’s Formula, Graph Colouring and

Covering, Chromatic Number,( Problems and Theorems without proofs), Trees, Directed trees, Binary Trees,

Decision Trees, Spanning Trees: Properties, Algorithms for Spanning trees and Minimum Spanning Tree.

UNIT IV:

Algebraic Structures: Algebraic Systems with one Binary Operation, Properties of Binary operations, Semi groups

and Monoids: Homomorphism of Semi groups and Monoids, Groups: Abelian Group, Cosets, Subgroups (

Definitions and Examples of all Structures), Lattice: Properties. Algebraic Systems with two Binary Operations:

Rings. Combinatorics: Basic of Counting, Permutations, Derangements, Permutations with Repetition of Objects,

Circular Permutations, Restricted Permutations, Combinations, Restricted Combinations, Pigeonhole Principle

and its Application, Binomial Theorem, Binomial and Multinomial Coefficients.

UNIT V: Recurrence Relation: Generating Function of Sequences, Partial Fractions, Calculating Coefficient of

Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving linear homogeneous

recurrence Relations by substitution, generating functions and The Method of Characteristic Roots. Solving

Inhomogeneous Recurrence Relations

TEXT BOOKS:Discrete Mathematical Structures with Applications to Computer Science, Tremblay, Manohar,

TMH

1. Discrete Mathematics for Computer Scientists & Mathematicians, 2/e, Mott, Kandel, Baker, PHI REFERENCE BOOKS:

1. Discrete Mathematics, S.Santha, Cengage 2. Discrete Mathematics with Applications, Thomas Koshy, Elsevier 3. Discrete Mathematics,2/e, JK Sharma ,Macmillan 4. Discrete Mathematics,Chandrasekaran,Umaparvathi,2010,PHI

5. Discrete and Combinational Mathematics, 5/e ,Ralph. P.Grimaldi, Ramana, Pearson 6. Elements of Discrete Mathematics, CL Liu,Mahapatra,TMH

SYLLABUS Date:

To

Page


Faculty Name: B.Shyamala Branch: CSE


No. of

Periods

Date Unit Topic to be Covered Teaching Aid

1. UNIT-I

2. 18/07/12 Mathematical logic: Propositional Calculus,

Statements and Notations

Black Board

3. 19/07/12 Connectives, Truth Tables Black Board

4. 20/07/12 Tautologies, Equivalence of Formulas

Duality law

Black Board

5. 21/07/12 Tautological Implications Black Board

6. 24/07/12 Normal Forms Black Board


8. 26/07/12 Theory of Inference for Statement Calculus Black Board



11. 31/07/12 Consistency of Premises Indirect Method

of Proof

Black Board

12. 01/08/12 Predicate calculus: Predicative Logic Black Board

13. 02/08/12 Statement Functions, Variables and

Quantifiers Free & Bound Variables

Black Board

14. 03/08/12 Inference theory for predicate calculus Black Board

15. 04/08/12 UNIT-II Set Theory: Introduction, Operations on

Binary Sets

Black Board

16. 07/08/12 Principle of Inclusion and Exclusion Black Board

17. 08/08/12 Relations: Properties of Binary Relations Black Board

18. 09/08/12 Relation Matrix and Digraph Operations on

Relations

Black Board

LESSON PLAN Date:

To

Page


Faculty Name: B.Shyamala Branch: CSE-A



Relations

Black Board

20. 16/08/12 Partition and Covering, Transitive Closure Black Board

21. 17/08/12 Equivalence Relation Black Board

22. 18/08/12 Compatibility Relation Black Board

23. 21/08/12 Partial Ordering Relation & Hasse Diagrams Black Board


25. 23/08/12 Functions: Bijective Functions Black Board

26. 24/08/12 Composition of Functions, Inverse

Functions

Black Board

27. 25/08/12 Permutation Functions, Recursive

Functions

Black Board

28. 28/08/12 UNIT-III Basic Concepts of Graphs, Sub graphs Black Board

29. 29/08/12 Matrix Representation of Graphs Black Board

30. 30/08/12 Adjacency Matrices, Incidence Matrices Black Board

31. 31/08/12 Isomorphic Graphs, Paths and Circuits Black Board

32. 01/09/12 Eulerian Graphs, Hamiltonian Graphs Black Board

33. 11/09/12 Multigraphs, Planar Graphs, Euler’s

Formula

Black Board

34. 12/09/12 Graph Colouring and Covering, Chromatic

Number

Black Board

35. 13/09/12 Trees, Directed trees Black Board

36. 14/09/12 Binary Trees, Decision Trees Black Board

37. 15/09/12 Spanning Trees: Properties Black Board

38. 18/09/12 Algorithms for Spanning trees and

Minimum Spanning Trees

Black Board



Black Board

40. 21/09/12 UNIT-IV Algebraic Systems with one Binary

Operation

Black Board

41. 22/09/12 Properties of Binary operations, Semi

groups and Monoids

Black Board

42. 25/09/12 Homomorphism of Semi groups and

Monoids, Groups

Black Board

43. 26/09/12 Abelian Group, Cosets, Subgroups Black Board

44. 27/09/12 Lattice: Properties, Algebraic Systems with

two Binary Operations: Rings

Black Board

45. 28/09/12 Basic of Counting, Permutations,

Derangements

Black Board

46. 29/09/12 Permutations with Repetition of Objects Black Board

47. 03/10/12 Circular Permutations, Restricted

Permutations

Black Board

48. 04/10/12 Combinations, Restricted Combinations Black Board

49. 05/10/12 Pigeonhole Principle and its Application Black Board

50. 06/10/12 UNIT-V Binomial Theorem, Binomial and

Multinomial Coefficients

Black Board

51. 09/10/12 Generating Functions of Permutations and

Combinations

Black Board

52. 10/10/12 The Principles of Inclusion – Exclusion Black Board

53. 11/10/12 Generating Function of Sequences, Partial

Fractions

Black Board


Fractions

Black Board

55. 16/10/12 Calculating Coefficient of Generating

Functions

Black Board


Functions

Black Board

57. 18/10/12 Recurrence Relations, Formulation as

Recurrence Relations

Black Board

58. 19/10/12 Solving linear homogeneous recurrence

Relations by substitution

Black Board

59. 20/10/12 Generating functions and The Method of

Characteristic Roots

Black Board

60. 25/10/12 Solving Inhomogeneous Recurrence

Relations

Black Board


Relations

Black Board

62. 30/10/12 Content

Beyond

syllabus

Rules of Inference and Automatic Theorem

Proving for Statement calculus

Black Board

63. 31/10/12 Content

Beyond

DFS, BFS algorithms Black Board

syllabus

64. 01/11/12 Content

Beyond

syllabus

Polish theorem Black Board

65. 02/11/12 Content

Beyond

syllabus

Content Beyond syllabus Black Board

66. 03/11/12 Revision UNIT-I Black Board

67. 06/11/12 Revision UNIT-II Black Board

68. 07/11/12 Revision UNIT-III Black Board

69. 08/11/12 Revision UNIT-IV Black Board

70. 09/11/12 Revision UNIT-V Black Board

TEXT BOOKS:

Discrete Mathematical Structures with Applications to Computer Science, Tremblay, Manohar, TMH

Discrete Mathematics for Computer Scientists & Mathematicians, 2/e, Mott, Kandel, Baker, PHI

REFERENCE BOOKS:

Discrete Mathematics, S.Santha, Cengage

Discrete Mathematics with Applications, Thomas Koshy, Elsevier

Discrete Mathematics,2/e, JK Sharma ,Macmillan

Discrete Mathematics,Chandrasekaran,Umaparvathi,2010,PHI

Discrete and Combinational Mathematics, 5/e ,Ralph. P.Grimaldi, Ramana, Pearson

Elements of Discrete Mathematics, CL Liu,Mahapatra,TMH


Signature

Name Mrs B.Shyamala HOD/CSE

Designation Asst.Professor/CSE Professor

Date 16.07.2012 20.07.2012

No. of

Periods

Date Unit Topic to be Covered Teaching Aid

1. 18/07/12 UNIT-I Mathematical logic: Propositional Calculus,

Statements and Notations

Black Board

2. 19/07/12 Connectives, Truth Tables Black Board

3. 21/07/12 Tautologies, Equivalence of Formulas

Duality law

Black Board

4. 23/07/12 Tautological Implications Black Board






10. 31/07/12 Consistency of Premises Indirect Method

of Proof

Black Board

11. 01/08/12 Predicate calculus: Predicative Logic Black Board

12. 02/08/12 Statement Functions, Variables and

Quantifiers Free & Bound Variables

Black Board

13. 04/08/12 Inference theory for predicate calculus Black Board

14. 06/08/12 UNIT-II Set Theory: Introduction, Operations on

Binary Sets

Black Board

15. 07/08/12 Principle of Inclusion and Exclusion Black Board

16. 08/08/12 Relations: Properties of Binary Relations Black Board


Relations

Black Board


Relations

Black Board

LESSON PLAN Date:

To

Page


Faculty Name: B.Shyamala Branch: CSE-B


19. 14/08/12 Partition and Covering, Transitive Closure Black Board

20. 16/08/12 Equivalence Relation Black Board

21. 18/08/12 Compatibility Relation Black Board



24. 23/08/12 Functions: Bijective Functions Black Board

25. 25/08/12 Composition of Functions, Inverse

Functions

Black Board

26. 27/08/12 Permutation Functions, Recursive

Functions

Black Board

27. 28/08/12 UNIT-III Basic Concepts of Graphs, Sub graphs Black Board

28. 29/08/12 Matrix Representation of Graphs Black Board

29. 30/08/12 Adjacency Matrices, Incidence Matrices Black Board

30. 01/09/12 Isomorphic Graphs, Paths and Circuits Black Board

31. 10/09/12 Eulerian Graphs, Hamiltonian Graphs Black Board

32. 11/09/12 Multigraphs, Planar Graphs, Euler’s

Formula

Black Board

33. 12/09/12 Graph Colouring and Covering, Chromatic

Number

Black Board

34. 13/09/12 Trees, Directed trees Black Board

35. 15/09/12 Binary Trees, Decision Trees Black Board

36. 17/09/12 Spanning Trees: Properties Black Board



Black Board



Black Board

39. 22/09/12 UNIT-IV Algebraic Systems with one Binary

Operation

Black Board

40. 24/09/12 Properties of Binary operations, Semi

groups and Monoids

Black Board

41. 25/09/12 Homomorphism of Semi groups and

Monoids, Groups

Black Board

42. 26/09/12 Abelian Group, Cosets, Subgroups Black Board

43. 27/09/12 Lattice: Properties, Algebraic Systems with

two Binary Operations: Rings

Black Board

44. 29/09/12 Basic of Counting, Permutations,

Derangements

Black Board

45. 01/10/12 Permutations with Repetition of Objects Black Board

46. 03/10/12 Circular Permutations, Restricted

Permutations

Black Board

47. 04/10/12 Combinations, Restricted Combinations Black Board

48. 06/10/12 Pigeonhole Principle and its Application Black Board

49. 08/10/12 UNIT-V Binomial Theorem, Binomial and

Multinomial Coefficients

Black Board

50. 09/10/12 Generating Functions of Permutations and

Combinations

Black Board

51. 10/10/12 The Principles of Inclusion – Exclusion Black Board


Fractions

Black Board


Fractions

Black Board


Functions

Black Board


Functions

Black Board

56. 18/10/12 Recurrence Relations, Formulation as

Recurrence Relations

Black Board

57. 20/10/12 Solving linear homogeneous recurrence

Relations by substitution

Black Board

58. 25/10/12 Generating functions and The Method of

Characteristic Roots

Black Board


Relations

Black Board


Relations

Black Board

61. 31/10/12 Content

Beyond

syllabus

Rules of Inference and Automatic Theorem

Proving for Statement calculus

Black Board

62. 01/11/12 Content

Beyond

syllabus

DFS, BFS algorithms Black Board

63. 03/11/12 Content Polish theorem Black Board

Beyond

syllabus

64. 05/11/12 Revision UNIT-I & II Black Board

65. 06/11/12 Revision UNIT-III Black Board

66. 07/11/12 Revision UNIT-IV Black Board

67. 08/11/12 Revision UNIT-V Black Board

TEXT BOOKS:

Discrete Mathematical Structures with Applications to Computer Science, Tremblay, Manohar, TMH

Discrete Mathematics for Computer Scientists & Mathematicians, 2/e, Mott, Kandel, Baker, PHI

REFERENCE BOOKS:

Discrete Mathematics, S.Santha, Cengage

Discrete Mathematics with Applications, Thomas Koshy, Elsevier

Discrete Mathematics,2/e, JK Sharma ,Macmillan

Discrete Mathematics,Chandrasekaran,Umaparvathi,2010,PHI

Discrete and Combinational Mathematics, 5/e ,Ralph. P.Grimaldi, Ramana, Pearson

Elements of Discrete Mathematics, CL Liu,Mahapatra,TMH

Unit wise Questions

UNIT-I

1. Explain the following connectives with examples

a) Λ (and) b) V (or) c) ~, ¬ (Negation)

d) → (Implication or conditional) e) ↔ (Bi-Conditional)

2. Explain Duality law?


Signature

Name Mrs B.Shyamala HOD/CSE


Date

3. When we say that the two statements formulas are equivalent to each other. Explain it clearly?

4. Obtain the PDNF and PCNF for the following formulas:

i) (¬PV¬Q)→(P↔¬Q)

ii) QΛ(PΛ¬Q)

5. Show the following equivalences. ( P Q) (R Q) (PVR) Q.

6. Explain the terms of equivalence.

7. Show that RVS follows logically from premises.

CD, (CD)→┐H, ┐H→(A┐B) and (A┐B)→RS.

8. Show that R →S can be derived from the premises P→(Q→S), ┐RP and Q.

9. Show that R(PVQ) is a valid conclusion from the premises PVQ, Q R, PM and ┐M.

10. With reference to automatic theorem proving, show that SVR is tautologically implied

by (PQ) (P→R)(Q→S).

11. Explain all methods in Theory of Inference for Statement calculus with examples?

UNIT-II

1. List all the permutations on A = {a,b,c}.

2. Let X= {1,2,3, …….. ,25} and R= { (x,y) / x-y is divisible by 5 } be a relation on X. Show

that R is an equivalence relation.

3. Prove that if the function f : AB has an inverse if and only if b is bijective.

4. Show that the set of positive N is a lattice with respect to the operations a b = lcm(a,b)

and a b = gcd(a, b), lcm(least common multiple) and gcd(greatest common divisor)

5. Show that the relation of congruence modulo m has m distinct equivalence classes.

6. Let C be a collection of sets which are closed under intersection and union. Verify whether(C,,)

is a lattice.

7. Let S = {1,2,3,4,5} and let A = S x S. Define the following relation R on A such that (a, b) R (a’, b’) if

and only if a b’ = a’b.

8. Define the relation on Z Z by (a, b) (c, d) if and only if a c and b d. Then

i) Prove that is a partial ordering but not a total ordering.

ii) Prove that is a lattice ordering on Z Z.

9. Let a, b, c be integers where a 0. Suppose a divides b and a divides c, then prove that a divides bx

+ cy, where x and y are any integers.

10. How many relations are there in set theory and explain about partial ordering relation and

Compatibility relation?

11. Explain briefly

i) Composition of functions

ii) Inverse Functions

iii) Recursive function

UNIT-III

1. Using Warshall’s algorithm, compute the adjacency matrix of the transitive closure of the digraph

G = ( { a,b,c,d,e}, { (a,b), (b,c),(c,d),(d,e),(e,d) }

2. What is coloring problem and hence define proper coloring?

3. Prove that the vertices of every graph can be properly colored with 5-colors.

4. Implement a graph so that the lists of header nodes and arc nodes are circular.

5. Describe the applications and efficiency level s of depth-first traversal.

6. Describe Prim’s algorithm for finding shortest paths in minimum spanning tree.

7. Define a chromatic number of a graph and prove that every tree with two or more vertices is 2-

chromatic.

8. Define covering prove that covering of graph is minimal if graph contains no path of length 3 or

more.

9. Let G be a complete directed graph. A non empty subset of the vertices of G is said to be an ‘out

classed group’ if any edge joining a vertex in the subset and a vertex not in the subset is always

directed from the latter to the former. Show that G has a directed circuit containing all the vertices,

if there is no outclassed group of vertices

10. What is a minimum spanning tree? What are the different ways of creating minimum spanning

trees.

11. Describe the applications and efficiency level s of breadth-first traversal.

12. Prove that the Kuratowskis second graph consisting of 6 vertices and 9 edges is non-planar.

13. State criteria to detect the planarity of a connected graph and give an example also.

14. Find the rank and nullity of the complete graph Kn

15. Prove that a connected graph G remains connected after removing an edge e from G if and only

if e belongs to some circuit in G.

16. Describe Kruskal’s algorithm to create minimum spanning tree.

17. Prove that if a connected graph has edge weights that are all distinct (in other words, no two

edges have the same weight), there is only one minimum spanning tree.

18. Prove that Petersen graph is neither Eulerian nor semi Eulerian.

19. Prove that connected graph is semi-Eulerian if and only if it has actually zero or two vertices of

odd degree.

20. Define 1 – and 2- isomorphism with one example each.

21. If G1 and G2 are two 1-isomorphic graphs then the rank of G1 is equal to the rank of G2 and the

nullity of G1 is equal to the nullity of G2 .

UNIT-IV

1. How many ways can 20 similar books be placed on 5 different shelves?

2. Enumerate the number of ways of placing 20 indistinguishable balls into 5 boxes where each

box is nonempty.

3. Find a recurrence relation for the number of ways to arrange flags on flag pole n feet tall using 4

types of flags. Red flags 2 feet high, (or) White, blue and yellow flags each 1 foot high.

4. Find a recurrence relation for the number of ways to make a pile of n chips using garnet, gold, red,

white and blue chips such that no two gold chips are together.

5. Compute the number of 10-digit numbers which contain only the digits 1,2 and 3

with the digit 2 appearing in each number exactly twice.

6. Describe Fibonacci relation with suitable examples.

7. Explain the methods of solving recurrence relations with suitable examples.

8. In how many ways can we distribute 10 red balls, 10 white balls, and 10 blue balls into 6 different

boxes (any box may be left empty)?

9. How many bridge deals are there in which North and South get all the spades?

10. What is a group and sub group, and explain about its properties?

11. Explain the groups Isomorphism and homomorphism?

UNIT-V

1. Solve the recurrence relation

S (k) – 0.25 S (k-1) = 0, S (o) = 6.

2. Solve the recurrence relation an-9an-1+26an-2 - 24an-3=0 for n≥3.

3. Solve the Recurrence Relation an-7an-1+10an-2=0 for n>=2 a0=10,a1=41

4. Solve the Recurrence Relation an+2+4an+1-5an=n2+n+1 for n>=2 a0=10,a1=41.

LESSON PLAN

Faculty Name: Mr. P.Rakesh Kumar Date: 19-07-2012

Year: III Semester Branch:CSE-A Sec

Subject: ELECTRONIC DEVICES AND CIRUITS Subject Code: T188

S.No. Day Date Topic Topics

Covered Remarks

UNIT – 1(JUNCTION DIODE CHARACTERSTICS)

1 Wednesday 18/7/2012 Introduction to EDC

2 Thursday 19 Review of Semiconductor Physics

3 Friday 20 N-Type Semiconductors

4 Monday 23 P-Type Semiconductors

5 Tuesday 24 Mass Action Law

6 Wednesday 25 Continuity Equation

7 Thursday 26 Hall Effect

8 Friday 27 TUTORIAL

9 Monday 30 Fermi Level of Semiconductors

10 Tuesday 31 Energy band diagram of PN Diode

11 Wednesday 1/8/2012 PN Diode biasing

12 Thursday 2 Current Components, Diode Equation


14 Monday 6 VI Characteristic

15 Tuesday 7 Temperature dependence of VI Char.

16 Thursday 8 Transition and Diffusion capacitance

17 Monday 9 Breakdown Mechanisms in PN Diode

18 Monday 13 Zener Diode, Tunnel Diode

19 Tuesday 14 Varactor Diode, LED

20 Thursday 16 LCD, Photo Diode.


UNIT – 2(RECTIFIERS AND FILTES)

22 Tuesday 21 Half wave Rectifier

23 Wednesday 22 Full Wave Rectifier with center tap transformer

24 Thursday 23 Full Wave Bridge Rectifier

25 Friday 24 Harmonic Components in a Rectifier circuit

26 Monday 27 Inductor, Capacitor, LC Filter


Covered Remarks

27 Tuesday 28 Pi-Section, Multiple L-Section & Multi Pi Section Filter

28 Wednesday 29 Comparison of Filters

29 Thursday 30 Comparison of Filters


I - Mid Exams

Chapter - 3

31 Monday 10/9/2012 Junction Transistor, Transistor Current Components

32 Tuesday 11 Transistor as an Amplifier, Transistor Construction

33 Wednesday 12 Current Components in a Transistor

34 Thursday 13 Input and Output characteristics of Transistor in

Common Base


36 Monday 17 Input and Output characteristics of Transistor in

Common Emitter

37 Tuesday 18 Input and Output characteristics of Transistor in

Common Collector

38 Thursday 20 Relation between Alpha, Beta, and Gama


40 Monday 24 FET-JFET Characteristics

41 Tuesday 25 Small Signal Model of JFET, MOSFET Characteristics

42 Wednesday 26 Comparison of Transistors, Introduction to SCR and UJT

Chapter - 4

43 Thursday 27 BJT biasing

44 Friday 28 DC Equivalent Model

45 Monday 1/10/2012 Criteria for fixing Operating Point

46 Wednesday 3 Fixed Bias

47 Thursday 4 Collector to base Bias


49 Monday 8 Self bias techniques for Stability

50 Tuesday 9 Stability Factors (S,Ś,S΄΄)

51 Wednesday 10 Compensation techniques

52 Thursday 11 Thermal Run Away, Thermal Stability


Chapter - 5

54 Monday 15 h-Parameter representation of a transistor.

55 Tuesday 16 Analysis of: Voltage, Current gain, I/p & O/p Impedance.


Covered Remarks

56 Wednesday 17 Comparison of Transistor: in terms of Ai, Ri, Av, Ro.

57 Thursday 18 Comparison of Transistor: in terms of Ai, Ri, Av, Ro.

58 Friday 19 Introduction to Feedback Amplifier and Feedback Oscillators

59 Thursday 25 Introduction to Feedback Amplifier and Feedback Oscillators


61 Monday 29 Revision (Chapter 3)

62 Tuesday 30 Revision (Chapter 2)

63 Wednesday 31 Revision (Chapter 3)

Revision (Chapter 4)

64 Thursday 1/11/2012 Revision (Chapter 2)

65 Friday 2 Revision (Chapter 3)

66 Monday 5 Advanced Topics(Compound configration)

67 Tuesday 6 Advanced Topics(coupled amplifiers)

68 Wednesday 7 Advanced Topics(tuned amplifiers)

69 Thursday 8 Advanced Topics(Integrated electronics)

70 Friday 9 Advanced Topics(power supplies)

71 10

II - Mid Exams

Signature of Faculty Signature of Head of Department

Course : B.Tech. (III-Sem.,) Section - A&B

Branch : CSE-A&B

Subject : Electronic Devices and Circuits using Lab. VIEW

(Code: P827) Batch :A2

Faculty : Mr. P. Rakesh Kumar

A.Y. : 2012-13

Notification of Lab Cycle Experiments

Batch 25/7/12 1/8/12 8/8/12 22/8/12 5/9/12 12/9/12 19/9/12 26/9/12 3/10/12 10/10/12 17/10/12 24/10/12 31/10/12 7/11/12 14/11/12

01 -- Exp1 Exp2 Exp3 Exp4 Exp5 Exp6 Exp7 Exp8 Exp9 Exp10 Exp11 Exp12 Rept. Test












Lab-in-charge Head of The Department, ECE

Course : B.Tech. (III-Sem.,) Section - A&B Branch : CSE-A&B

Subject : Electronic Devices and Circuits using Lab. VIEW (Code: P827) Batch :A1

Faculty : Mr. P. Rakesh Kumar A.Y. : 2012-13


Batch 27/7/12 3/8/12 17/8/12 24/8/12 31/8/12 7/9/12 14/9/12 21/9/12 28/9/12 5/10/12 19/10/12 26/10/12 16/11/12 16/11/12 20/11/12















Subject : Electronic Devices and Circuits using Lab. VIEW (Code: P827) Batch :B2



Batch 29/7/12 5/8/12 12/8/12 19/8/12 26/9/12 2/9/12 23/9/12 30/9/12 7/10/12 21/10/12 28/10/12 4/11/12 11/11/12 18/11/12 20/11/12















Subject : Electronic Devices and Circuits using Lab. VIEW (Code: P827) Batch :B1



Batch 31/7/12 7/8/12 14/8/12 21/8/12 28/9/12 4/9/12 11/9/12 25/9/12 9/10/12 23/10/12 30/10/12 6/11/12 13/11/12 20/11/12 20/11/12














LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING (Autonomous)

L.B. Reddy Nagar, Mylavaram – 521 230

Subject: PROBABILITY & STATISTICS Academic Year: 2012-2013

Branch / Year/ Semester: CSE II Year B.Tech I Semester Section: A

S.No

Date

No. of

Lecture.

Hrs

Planned Topics Topics

Covered Remarks

Unit-I

1 18-07-12 01 Introduction class

2 19-07-12 01 Introduction to probability and definitions

3 20-07-12 01 Tutorial class

4 23-07-12 01 Axioms of probability, simple theorems

5 24-07-12 01 Addition theorem, problems

6 25-07-12 01 Conditional probability, multiplication theorem

7 26-07-12 01 Problems on multiplication theorem


9 30-07-12 01 Independent Events,

10 31-07-12 01 theorems on independent events

11 01-08-12 01 Problems on independent events

12 02-08-12 01 baye’s theorem


14 06-08-12 01 Problems on baye’s theorem

15 07-08-12 01 Problems.

Unit-II

16 08-08-12 01 Random variables, discrete and continuous

17 09-08-12 01 Distribution function ,Problems

18 13-08-12 01 Expectations and problems

19 14-08-12 01 Binomial distribution: mean, variance, MGF

20 16-08-12 01 Problems on binomial distribution


22 21-08-12 01 poisson distribution-mean, variance.

23 22-08-12 01 MGF and mode

24 23-08-12 01 Problems on poisson distribution


26 27-08-12 01 Normal distribution–mean & variance, properties

27 28-08-12 01 MGF and their moments

28 29-08-12 01 Problems on normal distribution



Unit-III

31 10-09-12 01 Introduction :sampling distribution, definitions

32 11-09-12 01 Sampling distribution of mean

33 12-09-12 01 problems

34 13-09-12 01 Sampling distribution of Proportion, variances


36 17-09-12 01 Sampling distribution of sums and differences

37 18-09-12 01 Problems

38 20-09-12 01 Point and interval estimation, related problems


40 24-09-12 01 Bayesian estimation and problems

Unit – IV

41 25-09-12 01 Statistical hypothesis: Introduction, definitions

42 26-09-12 01 Type – I, II Errors, one & two tail tests.

43 27-09-12 01 Z -test for single proportion, problems


45 01-10-12 01 Z -test for difference of proportions, problems

46 03-10-12 01 Z -test for single mean, problems

47 04-10-12 01 Z -test for difference of means, problems


49 08-10-12 01 Tests of significance : t-test for means

50 09-10-12 01 Problems

51 10-10-12 01 Paired t-test, problems.

52 11-10-12 01 F-test for variances, problems


54 15-10-12 01 Chi-square test for goodness of fit, problems.

55 16-10-12 01 Chi-square test for independence of attributes

56 17-10-12 01 Problems on chi-square tests.

Unit – V

57 18-10-12 01 Correlation and Regression: Introduction


59 23-10-12 01 Coefficient of correlation, problems

60 25-10-12 01 Problems on change of origin and scale model


62 29-10-12 01 Rank correlation coefficient , problems.

63 30-10-12 01 Regression lines and properties of coefficients.

64 31-10-12 01 Problems on regression coefficients

65 01-11-12 01 problems


67 05-11-12 01 Introduction to queuing theory-definitions

68 06-11-12 01 M/M/1 infinite arrivals Model-1, problems

69 07-11-12 01 M/M/1 finite arrivals Model-2, problems

70 08-11-12 01 Review problems


Signature of the faculty Head of the Department

LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING (Autonomous) L.B. Reddy Nagar, Mylavaram – 521 230

Subject: PROBABILITY & STATISTICS Academic Year: 2012-2013 Branch / Year/ Semester: CSE II Year B.Tech I Semester Section: B

Faculty Name :M.RAMI REDDY

S.No

Date

No. of

Lecture.

Hrs

Planned Topics Topics

Covered Remarks

Unit-I

1 18-07-12 01 Introduction class

2 19-07-12 01 Introduction to probability and definitions

3 20-07-12 01 Axioms of probability, simple theorems


5 23-07-12 01 Addition theorem, problems

6 25-07-12 01 Conditional probability, multiplication theorem

7 26-07-12 01 Problems on multiplication theorem

8 27-07-12 01 Independent Events


10 30-07-12 01 theorems on independent events

11 01-08-12 01 Problems on independent events

12 02-08-12 01 baye’s theorem


14 04-08-12 01 Problems on baye’s theorem

15 06-08-12 01 Problems.

Unit-II

16 08-08-12 01 Random variables, discrete and continuous

17 09-08-12 01 Distribution function ,Problems

18 13-08-12 01 Expectations and problems.

19 16-08-12 01 Binomial distribution: mean, variance, MGF

20 17-08-12 01 Problems on binomial distribution


22 22-08-12 01 poisson distribution-mean, variance.

23 23-08-12 01 MGF and mode

24 24-08-12 01 Problems on poisson distribution


26 27-08-12 01 Normal distribution–mean & variance, properties

27 29-08-12 01 MGF and their moments




Unit-III

31 10-09-12 01 Introduction :sampling distribution, definitions

32 12-09-12 01 Sampling distribution of mean

33 13-09-12 01 problems

34 14-09-12 01 Sampling distribution of Proportion, variances


36 17-09-12 01 Sampling distribution of sums and differences

37 20-09-12 01 Problems

38 21-09-12 01 Point and interval estimation, related problems


40 24-09-12 01 Bayesian estimation and problems

Unit – IV

41 26-09-12 01 Statistical hypothesis: Introduction, definitions

42 27-09-12 01 Type – I, II Errors, one & two tail tests.

43 28-09-12 01 Z -test for single proportion, problems


45 01-10-12 01 Z -test for difference of proportions, problems

46 03-10-12 01 Z -test for single mean, problems

47 04-10-12 01 Z -test for difference of means, problems


49 06-10-12 01 Tests of significance : t-test for means

50 08-10-12 01 Problems

51 10-10-12 01 Paired t-test, problems.

52 11-10-12 01 F-test for variances, problems


54 15-10-12 01 Chi-square test for goodness of fit, problems.

55 17-10-12 01 Chi-square test for independence of attributes

56 18-10-12 01 Problems on chi-square tests.

Unit – V

57 19-10-12 01 Correlation and Regression: Introduction


59 25-10-12 01 Coefficient of correlation, problems

60 26-10-12 01 Problems on change of origin and scale model

61 29-10-12 01 Rank correlation coefficient , problems

62 31-10-12 01 Regression lines and properties of coefficients

63 01-11-12 01 Problems on regression coefficients

64 02-11-12 01 problems on regression coefficients


66 05-11-12 01 Introduction to queuing theory-definitions

67 07-11-12 01 M/M/1 infinite arrivals Model-1, problems

68 08-11-12 01 M/M/1 finite arrivals Model-2, problems

69 09-11-12 01 Remedial class

Signature of the faculty Head of the Department.

UNIT - I

Introduction

OOP Paradigm ,OOPS principles, Merits of OOP languages, Demerits of Procedure Oriented

Programming languages,C++ Overview, Data types, Identifers,Operators,Type casting, C++

Characteristics, Difference between class and structure, declaration of variables, dynamic

initialization of variables, new and delete operators, I/O Manipulators.

UNIT - II

Classes and Objects:

Defining Classes in C++, accessing class members, access specifiers(Public and

Private),defining member functions, static data members, static member functions, friend

functions, friend classes, inline functions, nested classes, passing objects to functions,

returning objects, object assignment, Array of objects, Constructor and Destructor , constant

and volatile keywords, constant and volatile member functions

UNIT - III

Inheritance:

Base class, derived class, access specifier (Protected), scope rules, abstract base class,

virtual base class, single inheritance, multiple inheritance, multilevel inheritance, hierarchical

inheritance and hybrid inheritance, calling base class constructors.

String class-Usage of standard library string class with example programs.

UNIT - IV

Polymorphism:

Pointers, Pointers to objects, ‘this’ Pointer, Pointers to derived Classes. Concept of

Polymorphism, Compile time Polymorphism: Operator Overloading, Overloading Unary

Operators, and Overloading Binary Operators, Function Overloading,

Run time Polymorphism: Virtual functions, Pure Virtual Functions.

Templates: Introduction, Class Templates, Function Templates.

UNIT - V

Files and Exception Handling:

Exception Handling: Introduction, Mechanism, throw, catch, Specifying Exceptions.

I/O Streams: C++ Streams, C++ Stream classes, Unformatted I/O Operations, Formatted I/O

Operations, Formatting using Manipulators.

C++ Files: Introduction, Classes for file stream Operations, Opening and closing a file,

detecting end-of-file, I/O Operations, command line arguments.

S.No. Date

(Tentative) Topics to be covered

Hrs

.

Teaching

Method/

Aid

R

Remarks

1 18-07-2012 Introduction

1 Black Board

UN

IT 1

2 19-07-2012 OOP Paradigm 1 Black Board

3 20-07-2012 OOPS principles 1 Black Board


5 24-07-2012 Merits of OOP languages 1 Black Board

6 25-07-2012 Demerits of Procedure-

Oriented Programming languages

1 Black Board

7 26-07-2012 C++ Overview 1 Black Board

8 27-07-2012 Data types 1 Black Board

9 30-07-2012 Identifiers,Operators 1 Black Board

10 31-07-2012 Type casting 1 Black Board

11 01-08-2012 C++ Characteristics 1 Black Board

12 02-08-2012 dynamic initialization of variables 1 Black Board

13 03-08-2012 new and delete operators 1 Black Board

14 06-08-2012 I/O Manipulators 1 Black Board

15 07-08-2012 Difference between class and structure,

declaration of variables 1 Black Board

08-08-2012 Tutorial

16 13-08-2012 Classes and Objects:

1 Black Board

U NI T 2

17 16-08-2012 Defining Classes in C++,

accessing class members, 1 Black Board

18 17-08-2012 access specifies(Public and

Private),defining member

functions,

1 Black Board

19 20-08-2012 static data members, static

member functions 1 Black Board

20 21-08-2012 Friend functions, friend classes, 1 Black Board

21 22-08-2012 inline functions 1 Black Board

22 23-08-2012 nested classes 1 Black Board

23 24-08-2012 passing objects to functions,

1 Black Board

24 27-08-2012 object assignment 1 Black Board

25 28-08-2012 Constructor and Destructor 1 Black Board


27 30-08-2012 Array of objects 1 Black Board

28 31-08-2012 constant and volatile keywords 1 Black Board

29 31-08-2012 constant and volatile member

functions, returning objects 1 Black Board

30 01-09-2012 Tutorial 1 Black Board

I MID EXAMINATIONS (03-09-2012 TO 08-09-2012)

31 10-09-2012 Inheritance: 1 Black Board

UN

IT 3

32 11-09-2012 Base class, derived class, access

specifier (Protected), 1 Black Board

33 12-09-2012 scope rules, abstract base class 1 Black Board

34 13-09-2012 virtual base class, single

inheritance, multiple inheritance,

multilevel inheritance,

1 Black Board



multilevel inheritance, 1

Black Board

36 17-09-2012 hierarchical

inheritance and hybrid inheritance,

calling base class constructors

1 Black Board




1 Black Board

38 20-09-2012 String class-Usage of standard

library string class with example

programs

1 Black Board

39 21-09-2012 String class 1 Black Board

UN

IT 4

40 24-09-2012 TUTORIAL 1 Black Board

41 25-09-2012 Polymorphism: 1 Black Board

42 26-09-2012 Pointers, Pointers to objects 1 Black Board

43 27-09-2012 ‘this’ Pointer, Pointers to derived

Classes. 1 Black Board

44 28-09-2012 Concept of Polymorphism,

Compile time Polymorphism: 1 Black Board

45 1-10-2012 Operator Overloading 1 Black Board

46 03-10-2012 Overloading Unary Operators, 1 Black Board

47 04-10-2012 Overloading Binary Operators,.

1 Black Board

48 05-10-2012 Function Overloading Run time

Polymorphism: Virtual functions, 1 Black Board

49 08-10-2012 Pure Virtual Functions 1 Black Board

09-10-2012 GENERIC PROGRAMMING 1 Black Board

UN

IT 5

10-10-2012 Templates: Introduction, Class

Templates. 1 Black Board

50 11-10-2012 Function Templates 1 Black Board


52 15-10-2012 Exception handling: Introduction 1 Black Board

53 16-10-2012 Mechanism, try, throw and catch 1 Black Board

57 17-10-2012 Example programs 1 Black Board

58 18-10-2012 Catching all Exceptions, Multiple

catches

1 Black Board

59 19-10-2012 Nested Try Block, Specifying Ex 1 Black Board

60 22-10-2012 I/O Streams: Introduction 1 Black Board

61 23-10-2012 C++ Streams, Stream Classes 1 Black Board


63 29-10-2012 Unformatted I/O Operations 1 Black Board

64 30-10-2012 Formatted I/O Operations 1 Black Board

65 31-10-2012 Formatted using manipulators 1 Black Board


67 02-10-2012 C++ Files: Introduction 1 Black Board

68 05-11-2012

Opening and closing of a file 1 Black Board

69 06-11-2012

Detecting end of file 1 Black Board

70 07-11-2012

I/O opeartions 1 Black Board

71 08-11-2012

Programs on files 1 Black Board

72 08-11-2012

Command line arguments 1 Black Board.

73 09-11-2012

TUTORIAL 1 Black Board

TEXT BOOK

Herbert Schildt, The Complete Reference C++, Fourth Edition, Tata McGraw Hill.

REFERENCES

1. E.Balaguruswamy, Object Oriented Programming with C++, Third Edition, TMH.

2. Deitel & Deitel, C++ How to Program, Third Edition, Pearson Education.

3. Ashok N Kamthane, Object Oriented Programming with ANSI& Turbo C++.

Course Delivery:

UNIT 1 2 3 4 5

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


Signature

Name A.Sree Rama Chandra Murthy HOD/CSE


Date 29.07.2012

UNIT - I

Introduction

OOP Paradigm ,OOPS principles, Merits of OOP languages, Demerits of Procedure Oriented

Programming languages,C++ Overview, Data types, Identifers,Operators,Type casting, C++

Characteristics, Difference between class and structure, declaration of variables, dynamic

initialization of variables, new and delete operators, I/O Manipulators.

UNIT - II

Classes and Objects:

Defining Classes in C++, accessing class members, access specifiers(Public and

Private),defining member functions, static data members, static member functions, friend

functions, friend classes, inline functions, nested classes, passing objects to functions,

returning objects, object assignment, Array of objects, Constructor and Destructor , constant

and volatile keywords, constant and volatile member functions

UNIT - III

Inheritance:

Base class, derived class, access specifier (Protected), scope rules, abstract base class,

virtual base class, single inheritance, multiple inheritance, multilevel inheritance, hierarchical

inheritance and hybrid inheritance, calling base class constructors.

String class-Usage of standard library string class with example programs.

UNIT - IV

Polymorphism:

Pointers, Pointers to objects, ‘this’ Pointer, Pointers to derived Classes. Concept of

Polymorphism, Compile time Polymorphism: Operator Overloading, Overloading Unary

Operators, and Overloading Binary Operators, Function Overloading,

Run time Polymorphism: Virtual functions, Pure Virtual Functions.

Templates: Introduction, Class Templates, Function Templates.

UNIT - V

Files and Exception Handling:

Exception Handling: Introduction, Mechanism, throw, catch, Specifying Exceptions.

I/O Streams: C++ Streams, C++ Stream classes, Unformatted I/O Operations, Formatted I/O

Operations, Formatting using Manipulators.

C++ Files: Introduction, Classes for file stream Operations, Opening and closing a file,

detecting end-of-file, I/O Operations, command line arguments.

S.No. Date

(Tentative) Topics to be covered

Hrs

.

Teaching

Method/

Aid

R

Remarks

1 18-07-2012 Introduction

1 Black Board

UN

IT 1

2 19-07-2012 OOP Paradigm 1 Black Board



5 24-07-2012 Merits of OOP languages 1 Black Board

6 25-07-2012 Demerits of Procedure-

Oriented Programming languages

1 Black Board

7 26-07-2012 C++ Overview 1 Black Board

8 27-07-2012 Data types 1 Black Board

9 30-07-2012 Identifiers,Operators 1 Black Board

10 31-07-2012 Type casting 1 Black Board

11 01-08-2012 C++ Characteristics 1 Black Board

12 02-08-2012 dynamic initialization of variables 1 Black Board

13 03-08-2012 new and delete operators 1 Black Board

14 06-08-2012 I/O Manipulators 1 Black Board

15 07-08-2012 Difference between class and structure,

declaration of variables 1 Black Board

08-08-2012 Tutorial

16 13-08-2012 Classes and Objects:

1 Black Board

UN

IT 2

17 16-08-2012 Defining Classes in C++,

accessing class members, 1 Black Board

18 17-08-2012 access specifies(Public and

Private),defining member

functions,

1 Black Board

19 20-08-2012 static data members, static

member functions 1 Black Board

20 21-08-2012 Friend functions, friend classes, 1 Black Board

21 22-08-2012 inline functions 1 Black Board

22 23-08-2012 nested classes 1 Black Board

23 24-08-2012 passing objects to functions,

1 Black Board

24 27-08-2012 object assignment 1 Black Board



27 30-08-2012 Array of objects 1 Black Board

28 31-08-2012 constant and volatile keywords 1 Black Board

29 31-08-2012 constant and volatile member

functions, returning objects 1 Black Board


I MID EXAMINATIONS (03-09-2012 TO 08-09-2012)

31 10-09-2012 Inheritance: 1 Black Board

UN

IT 3

32 11-09-2012 Base class, derived class, access

specifier (Protected), 1 Black Board

33 12-09-2012 scope rules, abstract base class 1 Black Board



multilevel inheritance,

1 Black Board



multilevel inheritance, 1

Black Board




1 Black Board




1 Black Board

38 20-09-2012 String class-Usage of standard

library string class with example

programs

1 Black Board

39 21-09-2012 String class 1 Black Board

UN

IT 4

40 24-09-2012 TUTORIAL 1 Black Board

41 25-09-2012 Polymorphism: 1 Black Board

42 26-09-2012 Pointers, Pointers to objects 1 Black Board

43 27-09-2012 ‘this’ Pointer, Pointers to derived

Classes. 1 Black Board

44 28-09-2012 Concept of Polymorphism,

Compile time Polymorphism: 1 Black Board

45 1-10-2012 Operator Overloading 1 Black Board

46 03-10-2012 Overloading Unary Operators, 1 Black Board

47 04-10-2012 Overloading Binary Operators,.

1 Black Board

48 05-10-2012 Function Overloading Run time

Polymorphism: Virtual functions, 1 Black Board

49 08-10-2012 Pure Virtual Functions 1 Black Board

09-10-2012 GENERIC PROGRAMMING 1 Black Board U N I T 5

10-10-2012 Templates: Introduction, Class

Templates. 1 Black Board

50 11-10-2012 Function Templates 1 Black Board


52 15-10-2012 Exception handling: Introduction 1 Black Board

53 16-10-2012 Mechanism, try, throw and catch 1 Black Board

57 17-10-2012 Example programs 1 Black Board

58 18-10-2012 Catching all Exceptions, Multiple

catches

1 Black Board

59 19-10-2012 Nested Try Block, Specifying Ex 1 Black Board

60 22-10-2012 I/O Streams: Introduction 1 Black Board



63 29-10-2012 Unformatted I/O Operations 1 Black Board

64 30-10-2012 Formatted I/O Operations 1 Black Board



67 02-10-2012 C++ Files: Introduction 1 Black Board

68 05-11-2012

Opening and closing of a file 1 Black Board

69 06-11-2012

Detecting end of file 1 Black Board

70 07-11-2012

I/O opeartions 1 Black Board

71 08-11-2012

Programs on files 1 Black Board

72 08-11-2012

Command line arguments 1 Black Board.

73 09-11-2012

TUTORIAL 1 Black Board

TEXT BOOK

Herbert Schildt, The Complete Reference C++, Fourth Edition, Tata McGraw Hill.

REFERENCES

1. E.Balaguruswamy, Object Oriented Programming with C++, Third Edition, TMH.

2. Deitel & Deitel, C++ How to Program, Third Edition, Pearson Education.

3. Ashok N Kamthane, Object Oriented Programming with ANSI& Turbo C++.

Course Delivery:

UNIT 1 2 3 4 5

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


Signature

Name A.Sree Rama Chandra Murthy HOD/CSE


Date 29.07.2012

P861 – OBJECT ORIENTED PROGRAMMING THROUGH C++ LAB.

Lab. : 3 Periods/week Internal Marks : 25

External Marks : 75


--------------------------------------------------------------------------------------------------------------- Objectives:

To make the students familiar with the concepts of Object Oriented Programming using C++ 1. Write a C++ program to find the sum of individual digits of a positive integer. 2. Write a C++ program to generate the first ‘n’ terms of the sequence. A Fibonacci sequence

is defined as 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 C++ program to generate all the prime numbers between 1 and n. Where ‘n’ is a value supplied by the user.

4. Write a C++ programs that use both recursive and non-recursive 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.

5. Write a C++ program to perform addition, suCSraction and multiplication operations on two complex numbers using classes and objects. 6. Write a C++ program to find out the total and average marks of 10 students using Classes and objects? 7. Write a C++ program to implement static data members and static member functions 8. Write a C++ program to implement the matrix ADT using a class. The operations Supported by this ADT are:

a) Reading a matrix. c) Addition of matrices. b) Displaying a matrix d) Multiplication of matrices.

9. Write a C++ program to illustrate the usage of following: Default Constructor, Parameterized Constructor, Copy Constructor and Destructor 10. Write a C++ program that illustrates the following: a) Friend Function b) inline function 11. Write C++ programs that illustrates the usage of following forms of inheritance. (Exercise the

access specified protected also) a) Single Inheritance b) Multiple Inheritance c) Multi level Inheritance d) Hierarchical Inheritance

12. Write a C++ program to count the lines, words and characters in a given text using standard library string object.

13. Write a C++ program that illustrates the concept of Function over loading? 14. Write a C++ program that overloads the binary + operator to concatenate two strings and to

add two complex numbers. 15. Write a C++ program that overloads the unary ++ operator to increment each element of the

given one dimensional array by ‘1’? 16. Write a C++ program that illustrates run time polymorphism by using virtual functions. 17. Write a template based C++ program to check whether the given item is existed in the array

or not. 18. Write an example C++ program to illustrate the procedure of exceptions handling. 19. Write a C++ program to display the contents of a text file. 20. Write a C++ program which copies the contents of one file to another.

OBJECT ORIENTED PROGRAMMING LAB( C++)

Course Objective:

The aim of this course of this lab is to teach the principles underlying

Object Oriented Programming through C++.

Object oriented programs are easier to understand and maintain than their

traditional counterparts.

This course is aimed principally at C programmers needing to come to

grips with the Object oriented concepts with C++ programming.

To develop software for GUIs and for Open Systems Development in view

the certification path.

S.No. Date

(Tentative) Programs To Be Executed

Hrs

. Cycles

1 21-07-2012 1. Introduction C++

2. Sum of individual digits

3. Febonacci sequence

3

Cyc

le 1

2 28-07-2012 1. Prime Numbers in a given

range.

2. Finding Factorial of given

number using Recursive &

Non Recursive Functions.

3. Finding Gcd of two digits

using Recursive & Non

Recursive Functions

3

3 04-08-2012 1. Finding nth term in a

febonacci sequence using

Recursive & Non

Recursive Functions

2. Programs on structures &

classes

3

3. 8.Programs on Reference

Variables

4. 9 . Call by reference

4 18-08-2012 1. Programs on operators

2. Programs using

manipulators

3. Program to perform addition, subtraction and multiplication operations on

a. two complex

numbers using

classes and objects.

4. Program to find out the

total and average marks of 10 students using

a. Classes and objects

3

Cyc

le-2

5 25-08-2012 1. Program that illustrates the following:

a) Friend Function b) inline function

2. Program to implement static data members

a) and 3. static member s

a) functions

3

6 01-08-2012 1. Program to illustrate the usage of following:

2. Default Constructor,

Parameterized Constructor

Copy Constructor and

Destructor

3

7 15-09-2012 1. Program to implement the matrix ADT using a class.

a. Reading a matrix. b. Addition of

matrices. 2. c)Displaying

d) Multiplication of matrices

3

8 22-09-2012 1. Programs that illustrates the usage of following forms of inheritance.

a) Single Inheritance b) Multiple Inheritance

b) Multi level Inheritance d) Hierarchical Inheritance

3

Cyc

le-3

9 29-09-2012 Write a C++ program to count the

lines, words and characters in a

given text using standard library

string object.

3

10 06-10-2012 1. Write a C++ program that overloads the binary + operator to concatenate two strings and to add two complex numbers.

2. 15. Write a C++ program that overloads the unary ++ operator to increment each element of the given one dimensional array by ‘1’?

3

Cyc

le-4

11 20-10-2012 1. Write a template based C++

program to check whether the given item is existed in the array or not.

2. Write a C++ program that

illustrates run time

polymorphism by using

virtual functions

3

12 27-10-2012 1. Program to illustrate the

procedure of exceptions

handling

2. Program to display the contents of a text file.

3. Program which copies the

contents of one file to

another

3

Cyc

le-5

13 03-10-2012 Lab Internal 3

P861 – OBJECT ORIENTED PROGRAMMING THROUGH C++ LAB.

Lab. : 3 Periods/week Internal Marks : 25

External Marks : 75


--------------------------------------------------------------------------------------------------------------- Objectives:

To make the students familiar with the concepts of Object Oriented Programming using C++ 1. Write a C++ program to find the sum of individual digits of a positive integer. 2. Write a C++ program to generate the first ‘n’ terms of the sequence. A Fibonacci sequence

is defined as 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 C++ program to generate all the prime numbers between 1 and n. Where ‘n’ is a value supplied by the user.

4. Write a C++ programs that use both recursive and non-recursive 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.

5. Write a C++ program to perform addition, suCSraction and multiplication operations on two complex numbers using classes and objects. 6. Write a C++ program to find out the total and average marks of 10 students using Classes and objects? 7. Write a C++ program to implement static data members and static member functions 8. Write a C++ program to implement the matrix ADT using a class. The operations Supported by this ADT are:

a) Reading a matrix. c) Addition of matrices. b) Displaying a matrix d) Multiplication of matrices.

9. Write a C++ program to illustrate the usage of following: Default Constructor, Parameterized Constructor, Copy Constructor and Destructor 10. Write a C++ program that illustrates the following: a) Friend Function b) inline function 11. Write C++ programs that illustrates the usage of following forms of inheritance. (Exercise the

access specified protected also) a) Single Inheritance b) Multiple Inheritance c) Multi level Inheritance d) Hierarchical Inheritance

12. Write a C++ program to count the lines, words and characters in a given text using standard library string object.

13. Write a C++ program that illustrates the concept of Function over loading? 14. Write a C++ program that overloads the binary + operator to concatenate two strings and to

add two complex numbers. 15. Write a C++ program that overloads the unary ++ operator to increment each element of the

given one dimensional array by ‘1’? 16. Write a C++ program that illustrates run time polymorphism by using virtual functions. 17. Write a template based C++ program to check whether the given item is existed in the array

or not. 18. Write an example C++ program to illustrate the procedure of exceptions handling. 19. Write a C++ program to display the contents of a text file. 20. Write a C++ program which copies the contents of one file to another.

OBJECT ORIENTED PROGRAMMING LAB( C++)

Course Objective:

The aim of this course of this lab is to teach the principles underlying

Object Oriented Programming through C++.

Object oriented programs are easier to understand and maintain than their

traditional counterparts.

This course is aimed principally at C programmers needing to come to

grips with the Object oriented concepts with C++ programming.

To develop software for GUIs and for Open Systems Development in view

the certification path.

S.No. Date

(Tentative) Programs To Be Executed

Hrs

. Cycles

1 21-07-2012 4. Introduction C++

5. Sum of individual digits

6. Febonacci sequence

3

Cyc

le 1

2 28-07-2012 4. Prime Numbers in a given

range.

5. Finding Factorial of given

number using Recursive &

Non Recursive Functions.

6. Finding Gcd of two digits

using Recursive & Non

Recursive Functions

3

3 04-08-2012 5. Finding nth term in a

febonacci sequence using

Recursive & Non

Recursive Functions

6. Programs on structures &

classes

7. 8.Programs on Reference

Variables

8. 9 . Call by reference

3

4 18-08-2012 5. Programs on operators

6. Programs using

manipulators

7. Program to perform addition, subtraction and multiplication operations on

a. two complex

numbers using

classes and objects.

3

Cyc

le-2

8. Program to find out the total and average marks of 10 students using

a. Classes and objects

5 25-08-2012 4. Program that illustrates the following:

a) Friend Function b) inline function

5. Program to implement static data members

a) and 6. static member s

a) functions

3

6 01-08-2012 3. Program to illustrate the usage of following:

4. Default Constructor,

Parameterized Constructor

Copy Constructor and

Destructor

3

7 15-09-2012 3. Program to implement the matrix ADT using a class.

a. Reading a matrix. b. Addition of

matrices. 4. c)Displaying

d) Multiplication of matrices

3

8 22-09-2012 2. Programs that illustrates the usage of following forms of inheritance.

a) Single Inheritance b) Multiple Inheritance

b) Multi level Inheritance d) Hierarchical Inheritance

3

Cyc

le-3

9 29-09-2012 Write a C++ program to count the

lines, words and characters in a

given text using standard library

string object.

3

10 06-10-2012 3. Write a C++ program that overloads the binary + operator to concatenate

3

Cyc

l

e-4

two strings and to add two complex numbers.

4. 15. Write a C++ program that overloads the unary ++ operator to increment each element of the given one dimensional array by ‘1’?

11 20-10-2012 3. Write a template based C++ program to check whether the given item is existed in the array or not.

4. Write a C++ program that

illustrates run time

polymorphism by using

virtual functions

3

12 27-10-2012 4. Program to illustrate the

procedure of exceptions

handling

5. Program to display the contents of a text file.

6. Program which copies the

contents of one file to

another

3

Cyc

le-5

13 03-10-2012 Lab Internal 3

Date post:	26-Mar-2022
Category:	Documents
Upload:	others
View:	1 times
Download:	0 times

LESSON PLAN Faculty Name: Mr. P.Rakesh Kumar Date: 19-07 ...

Documents