Unit 1: Introduction to Number Systems and Logic Gates21CSS201T

Exclusive Gates and Boolean Algebra

Curriculum and historical examination lineage for Exclusive Gates and Boolean Algebra under Unit 1 (Introduction to Number Systems and Logic Gates) of Computer Organization and Architecture (21CSS201T) at SRMIST.

Appearances
2
Cataloged Exam Questions
Exam Papers
2
Distinct University Exams
Question Families
0
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
0
Cycle Test 2
EndSem
2
Semester Exam
Marks Weightage Distribution

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

1 Marks:1 questions
Sample Past Exam Questions

Representative historical questions extracted directly from SRMIST examination papers.

i. Define Boolean algebra. [2] ii. Explain the working of a logic gate. [2] iii. List the types of logic gate with diagram. [2] iv. Explain any two types of logic gate in detail....

Year: 2024•Assessment: EndSem

According to De-Morgan's theorem: NAND = ________ (A) Bubbled AND (B) Bubbled NOR (C) Bubbled XOR (D) Bubbled OR [1]

Year: 2024•Assessment: EndSem
1 Marks
Historical Papers Indexed (2)

Examinations where questions for Exclusive Gates and Boolean Algebra have appeared.

Computer Organization and Architecture - JULY 2024 Examination Paper
2024EndSem
Computer Organization and Architecture - MAY 2024 Examination Paper
2024EndSem
Other Exam Topics in Unit 1: Introduction to Number Systems and Logic Gates

Master Exclusive Gates and Boolean Algebra in MintAI

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