Course Assessment Work Sheet

Subject code
Subject Name

10BT30422
Digital logic design

Year & Sem

Second year, I SemesterI

Ac. Year

2014-15

Name of Faculty

P. Dhana Lakshmi

Department of CSSE

Students should be able to do the following tasks, described as "Course Outcomes"

Understand different Number systems, Codes, Logic Gates, Boolean laws &theorems
Simplify the Boolean functions to the minimum number of literals
Design & implement different types of combinational logic circuits using Logic gates
Design & implement different types of sequential logic circuits using Flip Flops
Design & implement different types of Counters, Registers, and Programmable Logic Devices.

CO 1
CO 2
CO 3
CO 4
CO 5

PO1, PO3, PO11

Program Outcomes
Assessment tools
1
2

Assigment 1
Mid 1

3
4

Assigment 2
Mid 2

Criteria for Assessment

Percentage of students who got 60% or more marks
Mini. PO attainment level 70% of students

Assessment of Course outcomes and mapping with Program outcomes

Assessment Method
CO1

CO2

CO3

CO4
CO5

% of attainment

A1Q1
A1Q2
A1Q3
M1Q1
M1Q2
M1Q4
M1Q3
A2Q1
A2Q3
A2Q2
M2Q4
M2Q2
M2Q3

51
78
57
95
90
76
86
56
67
67
88
60
86

Average
Target
Achivement of PO
through Course?

PO Attainment

Outcome Average

78%

PO1
77%
70%

PO3
75%
70%

PO11
75%
70%

YES

YES

YES

77%

76%

75%

75%

74%
Average

72%
70%
68%

70%

70%

70%

Target

Program outcomes
67

PO1

87

PO1

75

PO3, PO

78

PO3, PO

73

PO3, PO1

Digital Logic Design(CS3006) - II Year I Semester, Section A

A1Q1
67
34
51

No. of Students attempted

No. of students who got atlest 60%
% of students who got 60%

Mapping CO

CO1

A1Q2
67
52
78
CO1

A1Q3
67
38
57
CO1

A1Q4
67
31
47
CO2

M1Q1
69
65
95
CO2

M1Q2
69
62
90
CO2

100

95

67

67

60
No. of students who got atlest 60%
% of students who got 60%

51

50
40

A2Q1
72
40
56

CO2

90

67

67

65

57

52

69

69
62

CO4

M2Q1
70
30
43

CO3

CO5

69

72

72

59

CO5

M2Q3
70
60
86
CO5

67

72

67

70

70

M2Q4
70
61
88
CO4

70
60

56

52

47

48

48

43

40
31

30

M2Q2
70
42
60

88

86

38

34

A2Q3
72
48
67

86
76

69

A2Q2
72
48
67

CO3

78

80

No. of Students attempted

M1Q4
69
52
76

CO3

90

70

M1Q3
69
59
86

70
60

61

M2Q3

M2Q4

42

30

20
10
0
A1Q1

A1Q2

A1Q3

A1Q4

M1Q1

M1Q2

M1Q3

M1Q4

A2Q1

A2Q2

A2Q3

M2Q1

M2Q2

P. Dhana Lakshmi

CSE - Program Outcomes

PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
PO10
PO11
PO12

an ability to apply knowledge of mathematics, science, and engineeri

an ability to design and conduct experiments, as well as to analyze a
an ability to design a system, component, or process to meet the des
an ability to function in multidisciplinary teams,
an ability to identify, formulate, and solve engineering problems,
an understanding of professional and ethical responsibility,
an ability to communicate effectively,
the broad education necessary to understand the impact of engineeri
a recognition of the need for and an ability to engage in life-long learn
a knowledge of contemporary issues,
an ability to use the techniques, skills, and modern engineering tools
an ability to specify, design, develop, test and maintain usable softwa

science, and engineering,

s well as to analyze and interpret data,
ocess to meet the desired needs within realistic constraints, such as, economic, environmental, social,

neering problems,
sponsibility,

he impact of engineering solutions in a global, economic, environmental, and societal context,

ngage in life-long learning, ducation necessary to understand the impact of engineering solutions in a

ern engineering tools necessary for engineering practice, and

maintain usable software systems.

environmental, social, political, ethical, health and safety, manufacturability, and sustainability,

ietal context,
neering solutions in a global, economic, environmental, and societal context,

sustainability,

COURSE OUTCOMES & CORRESPONDING QUESTIONS

CO1: Understand different Number systems, Codes, Logic Gates, Boolean laws &theorems

A1Q1.Implement NOR gate with NAND gate.

A1Q2. List all postulates & theorems of Boolean algebra.
A1Q3. Express the following Boolean functions in Sum of minters &Product of max terms

CO2: Simplify the Boolean functions to the minimum number of literals.

M1Q1. Simplify the following Boolean function using K-map
M1Q2. Simplify the following Boolean function using Tabulation method.
M1Q4. Write the equations for Barrow & Difference of full subtractor.
CO3: Design & implement different types of combinational logic circuits using Logic gates.

M1Q3.Design a combinational logic circuit for bcd to ex-3 code converter.

A2Q1.Implement 4-bit full adder with look ahead carry generator.
A2Q3.differentiate bet. Decoder & encoder, Mux&DeMux.

CO4: Design & implement different types of sequential logic circuits using Flip Flops
A2Q2.Convert SR flip flop into JK flip flop.
M2Q4.design a clocked sequential circuit for the given state table/state diagram.
CO5: Design & implement different types of Counters, Registers, and Programmable Logic Devices.

M2Q2.Design 3-bit synchronous counter/ Mod-6 ripple counter.

M2Q3.design 4-bit bi directional shift register/4-bit universal register.

Boolean laws &theorems

ers &Product of max terms.

ber of literals.

circuits using Logic gates.

c circuits using Flip Flops.

le/state diagram.

rogrammable Logic Devices.