Unit 2: Electronics21EEB101J

Karnaugh Map Minimization

Curriculum and historical examination lineage for Karnaugh Map Minimization under Unit 2 (Electronics) of Electrical and Electronics Engineering (21EEB101J) at SRMIST.

Appearances
18
Cataloged Exam Questions
Exam Papers
14
Distinct University Exams
Question Families
5
Recurring Conceptual Archetypes
SRMIST Status
Active
Regulation 2021 Syllabus
Assessment Cycle Weightage

Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.

CT1
0
Cycle Test 1
CT2
1
Cycle Test 2
EndSem
10
Semester Exam
Marks Weightage Distribution

Factual marks weightage of questions asked on this topic in historical examinations.

10 Marks:1 questions
15 Marks:7 questions
Recurring Question Families (5)

Question templates that recur across multiple examination cycles with similar conceptual stems.

family repeat5 paper appearances

“Simplified Boolean expression of Y(A, B, C) = \sum m(0, 1, 2, 3, 6) using K-map is a) A + BC' b) A...”

family repeat3 paper appearances

“Simplify the following Boolean expressions using k-map and implement 2 the simplified expressions...”

family repeat2 paper appearances

“Simplify the following expression using k-map and draw logic diagrams for the simplified...”

family repeat2 paper appearances

“Simplify the given boolean expressions using K-map and implement using logic gates. (i) Y(A,B,C,D)...”

family repeat1 paper appearance

“Describe the following with neat diagram. (a) Describe the following with neat diagram. (i) SMPS...”

Sample Past Exam Questions

Representative historical questions extracted directly from SRMIST examination papers.

Simplify the following expression using K-map. (b) Simplify the following expression using K-map. (i) $Y(A,B,C,D) = \Sigma_m(0,1,2,4,5,7,8,9,10,12,13)$ (ii) $F(A,B,C,D) =...

Year: 2022•Assessment: EndSem
10 Marks

Simplify the following Boolean expressions using k-map and implement 2 the simplified expressions using logic gates. Y(4, B, C,D) =E .(0,1, 2, 4, 5, 7, 8, 9, 10,12,13) Y(4,B,C,D)...

Year: 2023•Assessment: Other

Simplify the following Boolean expressions using k-map and implement the simplified expressions using logic gates. $Y(A,B,C,D)=\sum m(0,1,2,4,5,7,8,9,10,12,13)$...

Year: 2023•Assessment: EndSem
15 Marks

Simplify the following Boolean expressions using k-map and implement the simplified expressions using logic gates. (i) Y(A,B,C,D) = \Sigma m(1,5,6,7,9,11,12,13,15) (ii) Y(A,B,C,D)...

Year: 2023•Assessment: Other

a.i. Simplify the given Boolean expression using Boolean laws and theorems (1) $Y = ABC + \bar{A}\bar{C} + A\bar{B}C$ (2) $Y = AB + \bar{A}\bar{B}$ (ii) Using k-map simplify the...

Year: 2019•Assessment: EndSem
Historical Papers Indexed (8)

Examinations where questions for Karnaugh Map Minimization have appeared.

Electrical and Electronics Engineering (EEE) - PYQ 2022 July
2022EndSem
Electrical and Electronics Engineering (EEE) - PYQ 2023 May
2023Other
Electrical And Electronics Engineering - PYQ May 2023
2023EndSem
Electrical And Electronics Engineering - PYQ Jul 2023
2023Other
Electrical And Electronics Engineering - PYQ May 2019
2019EndSem
Electrical And Electronics Engineering - PYQ Dec 2023
2023EndSem
Electrical And Electronics Engineering - PYQ Dec 2024
2024EndSem
Electrical And Electronics Engineering - PYQ Nov 2024
2024EndSem
Other Exam Topics in Unit 2: Electronics

Master Karnaugh Map Minimization in MintAI

Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.