CO CTSD
CO CTSD
K L Deemed to be University
Department of Computer Science and Applications -- KLVZ
Course Handout
2024-2025, Odd Sem
Course Title :COMPUTER ORGANIZATION
Course Code :24CA1101
L-T-P-S Structure : 2-2-0-0
Pre-requisite :
Credits :4
Course Coordinator :Thonepudi Hema Latha
Team of Instructors :
Teaching Associates :
Syllabus ::Number Systems: Representation of numbers in different radix, Conversions from one radix to another, Integer - unsigned, signed (sign magnitude, 1's complement, 2's complement). Boolean Algeb
techniques: Karnaugh Map- 2, 3 and 4 Variable K Maps. Minimization Techniques – Min-terms and Max-terms, Sum of Product (SOP), Product of Sum (POS). Combinational Building Blocks: Adders and Sub
Structure of Computers: Computer Types, Functional Units. Register Transfer & Micro -Operations: Register Transfer Language, Register Transfer, Bus & memory Transfers, Arithmetic Micro-operations, Log
Registers, Computer instructions, Timing and Control-Hardwired & Micro Programmed control, Instruction Cycle, Memory-Reference Instruction, Input-Output and interrupt, Design of Basic Computer, Desig
Organization, Stack Organization-types, Instruction Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced instruction Set Computer (RISC). Memory Organization: Memory
Text Books :[Link] System Architecture, Morris Mano, Pearson/PHI, 3rd Edition, 2007. [Link] Organization and Architecture by William Stallings, PHI, 6th edition,2006.
Reference Books :[Link] Logic and Computer Design, M. Morris Mano, Pearson, 2nd Edition. [Link] Organization, Carl Ham Acher, Tata McGraw Hill, 5th Edition
Web Links ::1.[Link] 2.[Link] 3.[Link] 4.[Link]
MOOCS :1.[Link] 2.[Link]
utm_source=adwords&utm_medium=udemyads&utm_campaign=DSA_Catchall_la.EN_cc.INDIA&utm_content=deal4584&utm_term=_._ag_82569850245_._ad_533220805577_._kw__._de_c_._dm__._pl_
Course Rationale :The course on Computer Organization and Architecture is indispensable for anyone pursuing a career in computer science and engineering. It equips students with the knowledge and skills n
development, hardware design, system administration, and more.
Course Objectives :Recognize and manipulate representations of numbers stored in digital computers. • Recall the history and development of modern computers, developing an appreciation for the potential a
main components • Recognize and perform computations with the functional units of the processor • Recall the basics of, and develop the ability to determine the applicability of single-cycle multi-cycle (MIPS
computer processor including memory • Perform elementary quantitative performance evaluation of computer systems •Solve elementary problems by assembly language programming
Blooms
Taxonomy
CO NO Course Outcome (CO) PO/PSO
Level
(BTL)
Understanding the fundamental concepts and techniques used in digital electronics and using K-Maps for Boolean
CO1 PO1,PO2,PO6 2
Expression simplification
CO2 Model the building blocks of Combinational and Sequential circuits and explaining registers and its usage PO1,PO6,PO2 3
Analyze the basic concepts of computer organization: structure and operation of computers and their peripherals the design
CO3 PO2,PO3,PO6 4
of the functional units of a digital computer system.
CO4 Classify the working of the Central Processing Unit. Design and evaluate the performance of memory systems PO2,PO3,PO6 4
Outcome Highest
COI-2 COI-3 COI-4
No. BTL
Btl-2
Understanding Basic digital concepts of Number
CO1 2 Systems,and Understanding the core concepts of
Boolean algebra and their application for circuit
realization and using K-maps for Boolean expressions
Btl-2
Btl-3
Outlining the Digital electronic concepts of Sequential
CO2 3 Make use of RTL for representing different set of
and Combinational circuits and Outlining the Basic
Operations in computer
functional units of computer
Btl-2 Btl-3
Btl-4
CO3 4 Explanation of instruction codes, Computer Registers, Identifying the timing, and control in the [Link]
Analyse the design of micro programmed control unit
instructions Identifying the design of different types of instructions,
Btl-2
Illustration of General register and Stack organization. Btl-4
Btl-3
CO4 4 Modelling of different instruction formats, addressing Discovering the need of virtual memory and memory
Construction of Main memory and associative memory,
modes and Simplify the design of RISC, Classification mapping techniques of cache memory
of different types of memory
1 of 13 03-09-2024, 14:24
Firefox [Link]
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis
PO3 of the information to provide valid conclusions for complex problems that cannot be solved by straightforward application of knowledge, theories and techniques applicable to the
engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modelling to complex engineering
PO4
activities with an understanding of the limitations.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modelling to complex engineering
PO4
activities with an understanding of the limitations.
PO5 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice
PO5 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice
PO6 Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
PO6 Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write
PO7
effective reports and design documentation, make effective presentations, and give and receive clear instructions
Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write
PO7
effective reports and design documentation, make effective presentations, and give and receive clear instructions
PO8 Life-long Learning: Recognize the need for, and have the preparation and ability to engage in independent and lifelong learning in the broadest context of technological change.
PO8 Life-long Learning: Recognize the need for, and have the preparation and ability to engage in independent and lifelong learning in the broadest context of technological change.
PSO1 An ability to use and develop cloud software, administrative features. Infrastructure services and architectural patterns; ethical hacking and forensic security technologies.
PSO1 An ability to use and develop cloud software, administrative features. Infrastructure services and architectural patterns; ethical hacking and forensic security technologies.
PSO2 PSO2: An ability to gain knowledge on design and control strategy; techniques to secure information and adapt to the fast changing world of information technology needs.
PSO2 PSO2: An ability to gain knowledge on design and control strategy; techniques to secure information and adapt to the fast changing world of information technology needs.
PSO3 Ability to apply the knowledge of computing tools and techniques in the field of Data science for solving real world problems encountered in the Software Industries.
PSO3 Ability to apply the knowledge of computing tools and techniques in the field of Data science for solving real world problems encountered in the Software Industries.
PSO4 Ability to identify the challenges in Data analytics with respect to IT Industry and pursue quality research in this field with social relevance.
PSO4 Ability to identify the challenges in Data analytics with respect to IT Industry and pursue quality research in this field with social relevance.
An ability to apply pattern recognition and artificial intelligent techniques including statistical data analysis and quantitative modelling techniques to solve real world problems from
PSO5
various domains such as healthcare, social computing, economics, etc.
An ability to apply pattern recognition and artificial intelligent techniques including statistical data analysis and quantitative modelling techniques to solve real world problems from
PSO5
various domains such as healthcare, social computing, economics, etc.
PSO6 An ability to recognize and analyze problems related to AI and ML applications along with their ethical implications
PSO6 An ability to recognize and analyze problems related to AI and ML applications along with their ethical implications
1 CO1 COI-2 Course Handout,Introduction to Computer Organization & Architecture NA Chalk,PPT,Talk End Semester Exam,SEM-EXAM1
5 CO1 COI-2 De morgan’s theorem (2&3 Variable), Boolean laws. Textbook-1 Page No. 11- 16 Chalk,PPT,Talk End Semester Exam,SEM-EXAM1
8 CO2 COI-2 Combinational Building Blocks – Adders, Subtractors, Textbook-1 Page No.14-18 Chalk,PPT,Talk End Semester Exam,SEM-EXAM1
9 CO2 COI-2 Multiplexers and Decoders. Textbook-1 Page No19- 22 Chalk,PPT,Talk End Semester Exam,SEM-EXAM1
Arithmetic Micro-operations, Logic Micro Operations, Shift Micro- End Semester Exam,Home
13 CO2 COI-3 Textbook-1 Page No.93-95 Chalk,PPT,Talk
operation, Arithmetic Logic Shift Unit Assignment,SEM-EXAM1
15 CO3 COI-3 Timing and Control, Instruction Cycle Textbook-1 Page No.95 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
16 CO3 COI-3 Memory-Reference Instruction, Input-Output, and interrupt Textbook-1 Page No.97-101 Chalk,PPT,Talk ALM,End Semester Exam,SEM-EXAM2
2 of 13 03-09-2024, 14:24
Firefox [Link]
Teaching-
[Link]. CO COI Topic Book No[CH No][Page No] Learning EvaluationComponents
Methods
17 CO3 COI-3 Design of Basic Computer, Design of accumulator Logic Textbook-1Page No.102- 106 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
18 CO3 COI-4 MICRO Programmed Control: Control Memory. Address Sequencing Textbook Page No.108- 111 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
21 CO4 COI-2 Instruction Formats, Addressing Modes Textbook Page 1 No.123-132 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
22 CO4 COI-2 Program Control Textbook Page 1 No.135-143 Chalk,PPT,Talk ALM,End Semester Exam,SEM-EXAM2
23 CO4 COI-3 Reduced instruction Set Computer (RISC). Textbook 1 Page No.145-149 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
24 CO4 COI-3 Memory Organization: Memory Hierarchy, Main Memory Textbook 1 Page No.150-156 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
25 CO4 COI-3 Associative Memory Cache Memory Textbook 1 Page No.157-162 Chalk,PPT,Talk End Semester Exam,SEM-EXAM2
SESSION NUMBER : 1
Session Outcome: 1 Understand the complete course handout, regarding Syllabus, Evaluation Components, Introduction To Computer Organization & Architecture
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Course Handout 2 Talk --- NOT APPLICABLE ---
20 Introduction to Computer Organization & Architecture 2 Talk --- NOT APPLICABLE ---
5 Conclusion & Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 2
Session Outcome: 2 Students will be able to Understand how to represent the numbers in different and solve the conversions from one radix to another
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Representation of numbers in different radix 2 PPT One minute paper
20 Conversions from one radix to another 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 3
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Integer - unsigned 2 PPT --- NOT APPLICABLE ---
20 Integer - signed (sign magnitude, 1's complement, 2's complement 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 4
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 ATTENDANCE AND RECAP 1 Talk --- NOT APPLICABLE ---
20 Boolean Algebra: Logic Gates-OR, AND, NOR, NAND, XOR & XNOR, Truth Tables 2 PPT Quiz/Test Questions
20 Boolean Algebra: Logic Gates-OR, AND, NOR, NAND, XOR & XNOR, Truth Tables 2 PPT --- NOT APPLICABLE ---
5 Conclusion 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 5
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 De Morgan’s theorem (2&3 Variable) 2 PPT --- NOT APPLICABLE ---
20 Boolean laws 2 PPT --- NOT APPLICABLE ---
3 of 13 03-09-2024, 14:24
Firefox [Link]
SESSION NUMBER : 6
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Introduction to Circuit designing technique 2 PPT Fish Bowl
20 Karnaugh Map- 2, 3 and 4 Variable K Maps 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 7
Session Outcome: 1 The Students Will Simplify the Min terms and Max terms and able to learn about Simplification of Boolean expressions using Boolean laws
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Minimization Techniques – Min-terms, and Max-terms 2 PPT --- NOT APPLICABLE ---
20 Sum of Product (SOP), Product of Sum (POS) 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 8
Session Outcome: 1 The student will learn about Demonstration of combinational circuits.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Combinational Building Blocks – Adders, 2 PPT --- NOT APPLICABLE ---
20 Combinational Building Blocks – Adders, 2 PPT Brain storming session
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 9
Session Outcome: 1 he student will Describe about the Multiplexer and Decoders
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Multiplexers 2 PPT --- NOT APPLICABLE ---
20 Decoders. 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 10
Session Outcome: 1 The student will learn Student able to understand the concepts of Sequential Circuits
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 equential Circuits – Flip Flops 2 PPT Quiz/Test Questions
20 Types of Flip Flop – SR Flip Flop, J K Flip Flop 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 11
Session Outcome: 1 The Student able to understand the concepts of Sequential Circuits and learn about the basic structure of a computer
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 D flip flop, T Flip flop 2 PPT --- NOT APPLICABLE ---
20 Basic Structure of Computers: Computer Types, Functional Unit 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 12
Session Outcome: 1 The student will Understand the concepts of Register Transfer & Micro -Operations & Bus and Memory Transfers.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Register Transfer & Micro -Operations: Register Transfer Language, Register Transfer 3 PPT --- NOT APPLICABLE ---
20 Bus & memory Transfers. 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 13
Session Outcome: 1 The student will be able to Understand the operations done on numeric data contained in the registers in general and Describe the Shift Microoperation
4 of 13 03-09-2024, 14:24
Firefox [Link]
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Arithmetic Micro-operations, Logic Micro Operations 3 PPT --- NOT APPLICABLE ---
20 Shift Micro-operation, Arithmetic Logic Shift Unit 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 14
Session Outcome: 1 The Student will be able to understand the Understand the concepts of Computer Registers, Computer instructions.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Basic Computer Organization and Design, Instruction codes 2 PPT --- NOT APPLICABLE ---
20 Computer Registers, Computer instructions 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 15
Session Outcome: 1 To make the students able to understand about the timing for all registers in the basic computer is controlled by a master clock generator.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
Statement-Opinion-
20 Timing and Control 3 PPT
Summary
20 Instruction Cycle 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 16
Session Outcome: 1 To make the students able to understand the symbols and descriptions
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Memory-Reference Instruction 3 PPT --- NOT APPLICABLE ---
20 Input-Output and interrupt 3 PPT Quiz/Test Questions
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 17
Session Outcome: 1 To make the students understand the Design of accumulator Logic
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Design of Basic Computer, 3 PPT --- NOT APPLICABLE ---
20 Design of accumulator Logic. 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 18
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 MICRO Programmed Control: Control Memory. 4 PPT --- NOT APPLICABLE ---
20 Address Sequencing 4 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 19
Session Outcome: 1 Student able to organize the examples on micro program Example and design of Control Unit
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Micro-Program example 4 PPT Think-Pair-Share
20 Design of Control Unit 4 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 20
Session Outcome: 1 The student will be able to Understand the general registers Stack organization
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Central Processing Unit: General registers Organization 2 PPT --- NOT APPLICABLE ---
20 Stack Organization. 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
5 of 13 03-09-2024, 14:24
Firefox [Link]
SESSION NUMBER : 21
Session Outcome: 1 The student will be able to Define the different types of addressing modes and identify the different types of instruction formats
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Instruction Formats, 2 PPT One minute paper
20 Addressing Modes 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 22
Session Outcome: 1 Student will be able to Discuss about the data transfer and manipulation & Program Control
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Data Transfer and Manipulation 2 PPT Quiz/Test Questions
20 Program Control 2 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 23
Session Outcome: 1 Student able to understand the design of microprocessor to perform a smaller number of types of computers instructions
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Reduced instruction Set Computer (RISC). 3 PPT --- NOT APPLICABLE ---
20 Reduced instruction Set Computer (RISC). 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 24
Session Outcome: 1 Students will be able to Describe the Memory Organization: Memory Hierarchy with main memory.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Memory Organization: Memory Hierarchy 3 PPT --- NOT APPLICABLE ---
20 Main Memory 3 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 25
Session Outcome: 1 Students will be able to understand the Associative Memory Cache Memory
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Associative Memory 4 PPT --- NOT APPLICABLE ---
20 Cache Memory 4 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 26
Session Outcome: 1 Student will be able to understand the Cache Memory Virtual Memory.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Cache Memory 4 PPT --- NOT APPLICABLE ---
20 Virtual Memory 4 PPT --- NOT APPLICABLE ---
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
Lab
session List of Experiments CO-Mapping
no
1 Convert 1) (657)8 into decimal , binary, hexadecimal, Convert (2348)10 into binary, octal, hexadecimal CO1
2 Write the truth table and symbols for all logic gates CO1
Obtain the simplified expression in sum of products for the following. Boolean function. F (A, B, C, D) = ∑ (2,3,12,13,14,15). Obtain the
3 CO1
simplified expression in sum of products for the following. Boolean function. F (A, B, C, D) = ∑ (1,4,5,8,9,11,12,13,15,).
4 Explain the 1’s complement of a numbers? Give examples Explain the 2’s complement of a numbers? Give examples. CO1
6 of 13 03-09-2024, 14:24
Firefox [Link]
Lab
session List of Experiments CO-Mapping
no
5 Simplify the expression A(B+C)+AB+ABC b) List all boolean laws with examples CO1
6 Explain about sum of products with an example b) Explain about product of sum with an example CO1
8 What is the drawback of JK flip flop. Design a flip flop which overcomes this drawback and explain with neat diagram. CO2
Discuss the functional units of a basic computer. i)I/P Unit ii)Memory Unit Discuss the functional units of a basic computer. iii)Control Unit
9 CO2
iv)Arithmetic & Logic Unit v)Output Unit
10 Write and explain register transfer notations for all instruction types with examples CO2
11 What are different types of micro-operations. Write a note on shift micro-operations. CO2
Discuss the operations performed by the Arithmetic Unit with a neat diagram Discuss the operations performed by the Logical Unit with a neat
12 CO2
diagram
13 Describe the types of computer registers in detail. Describe the roles of computer registers in detail. CO3
Describe the process of execution of a complete instruction with a neat diagram. Describe the process of execution of a complete instruction
14 CO3
with a neat diagram.
15 Explain the Memory reference instructions with examples. Explain the Memory reference instructions with examples. CO3
16 Explain the basic concepts of Input-Output and interrupt. explain the basic concepts of Input-Output and interrupt. CO3
Distinguish between the hardwired control unit and microprogrammed control unit. Distinguish between the hardwired control unit and
17 CO3
microprogrammed control unit.
18 Discuss about Micro program Sequencing. Discuss about Micro program Sequencing. CO3
Explain in detail various fields of micro-instruction format with a neat diagram. Explain in detail various fields of micro-instruction format with
19 CO3
a neat diagram.
21 Write and explain these notations to three-address, two-address. Explain single address and zero-address instruction types. CO4
22 What is the significance of addressing modes? Explain Direct, Immediate, and relative addressing modes with examples. CO4
23 Discuss Data transfer instructions with examples. Discuss Data manipulation instructions with examples. CO4
24 Explain the characteristics of RISC in detail. Explain the advantages of RISC in detail. CO4
25 Explain the need of virtual memory Explain the concepts of virtual memory in detail CO4
26 Explain different memory mapping techniques used in cache memory. Explain different memory mapping techniques used in cache memory. CO4
SESSION NUMBER : 1
Session Outcome: 1 Students will be able to understand and perform conversions between different number systems, including binary, decimal, and hexadecimal, confidently and accurately."
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Convert 1) (657)8 into decimal , binary, hexadecimal, 2 Talk --- NOT APPLICABLE ---
20 Convert (2348)10 into binary, octal, hexadecimal 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 2
Session Outcome: 1 Students will comprehend the fundamental principles of all logic gates, enabling them to design and analyse digital circuits for logical operations.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Writing truth tables for AND,OR gates 2 Talk One minute paper
20 Writing truth tables for [Link] gates 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 3
Session Outcome: 1 Students will be able to understand, analyse, and manipulate Boolean functions for logical decision-making and digital circuit design
7 of 13 03-09-2024, 14:24
Firefox [Link]
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
Obtain the simplified expression in sum of products for the following. Boolean function. F (A, B, C, D) = ∑
20 2 Talk One minute paper
(2,3,12,13,14,15).
Obtain the simplified expression in sum of products for the following. Boolean function. F (A, B, C, D) = ∑
20 2 Talk One minute paper
(1,4,5,8,9,11,12,13,15
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 4
Session Outcome: 1 Students will be capable of performing arithmetic operations such as addition and subtraction using 1's complement and 2's complement representations
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain the 1’s complement of a numbers? Give examples 2 Talk One minute paper
20 Explain the 2’s complement of a numbers? Give Examples 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 5
Session Outcome: 1 Students will acquire the skills to create, simplify, and evaluate Boolean expressions, enhancing their ability to solve logical and digital circuit problems.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Simplify A(B+C) +AB+ABC 2 Talk One minute paper
20 List all boolean laws with examples 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 6
Session Outcome: 1 Students will be able to understand the methods of simplification of expressions
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain about sum of products with an example 2 Talk One minute paper
20 Explain about product of sum with an example 2 Talk One minute paper
5 Conclusion& Summary 1 Talk One minute paper
SESSION NUMBER : 7
Session Outcome: 1 Students will gain proficiency in understanding, designing, and implementing multiplexers in digital circuits
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 2 Talk --- NOT APPLICABLE ---
20 Define a multiplexer 2 Talk One minute paper
20 Draw a 4:1 multiplexer 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 8
Session Outcome: 1 Students will achieve a comprehensive understanding of flip-flops, including their types, functions, and applications in digital circuits
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 What is the drawback of JK flip flop. 2 Talk One minute paper
20 Design a flip flop which overcomes this drawback and explain with neat diagram 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 9
Session Outcome: 1 Students will achieve a comprehensive understanding of the essential components that make up a computer system, including the CPU, memory, storage, and input/output
devices.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Discuss the functional units of a basic computer. i)I/P Unit ii)Memory Unit 2 Talk One minute paper
20 Discuss the functional units of a basic computer. iii)Control Unit iv)Arithmetic & Logic Unit v)Output Unit 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 10
Session Outcome: 1 Students will become proficient in using Register Transfer Notation (RTN) to describe and analyse the data flow and control in digital systems
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Write and explain register transfer notations for all instruction types with examples 3 Talk One minute paper
8 of 13 03-09-2024, 14:24
Firefox [Link]
20 Write and explain register transfer notations for all instruction types with examples 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 11
Session Outcome: 1 students will proficiently comprehend micro-operations and their role in digital system control and microprogramming.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 What are different types of micro-operations. 3 Talk One minute paper
20 Write a note on shift micro-operations. 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 12
Session Outcome: 1 students will have a deep understanding of Arithmetic and Logic Units (ALUs) and be able to design, analyse, and implement ALUs for various computational tasks.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Discuss the operations performed by the Arithmetic Unit with a neat diagram 3 Talk One minute paper
20 Discuss the operations performed by the Logical Unit with a neat diagram 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 13
Session Outcome: 1 Students will attain a thorough understanding of computer registers, including their types, functions, and roles in data processing and CPU operations.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Describe the types of computer registers in detail. 2 Talk One minute paper
20 Describe the roles of computer registers in detail. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 14
Session Outcome: 1 Students will learn the complete instruction execution process, visually represented with a clear diagram, enhancing their comprehension of computer architecture.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Describe the process of execution of a complete instruction with a neat diagram. 2 Talk One minute paper
20 Describe the process of execution of a complete instruction with a neat diagram. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 15
Session Outcome: 1 students will master memory reference instructions, enabling them to efficiently manipulate and access data in computer memory.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain the Memory reference instructions with examples. 3 Talk One minute paper
20 Explain the Memory reference instructions with examples. 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 16
Session Outcome: 1 students will grasp the fundamental concepts of Input-Output (I/O) operations and interrupts, enabling them to understand their significance in computer systems.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 explain the basic concepts of Input-Output and interrupt. 3 Talk One minute paper
20 explain the basic concepts of Input-Output and interrupt. 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 17
Session Outcome: 1 To make the students understand the differences between hardwired control unit and micro programmed control unit.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Distinguish between the hardwired control unit and microprogrammed control unit 3 Talk One minute paper
20 Distinguish between the hardwired control unit and microprogrammed control unit 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 18
Session Outcome: 1 students will be proficient in micro-program sequencing techniques, enhancing their ability to control complex digital systems effectively.
9 of 13 03-09-2024, 14:24
Firefox [Link]
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Discuss about Micro program Sequencing. 4 Talk One minute paper
20 Discuss about Micro program Sequencing. 4 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 19
Session Outcome: 1 students will have a comprehensive understanding of microinstruction formats and be capable of designing and interpreting microprograms.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain in detail various fields of micro-instruction format with a neat diagram. 4 Talk One minute paper
20 Explain in detail various fields of micro-instruction format with a neat diagram. 4 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 20
Session Outcome: 1 Students will have a solid grasp of stack organization principles and its applications in memory management and function calls.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain Stack organization in detail. 2 Talk One minute paper
20 Explain Stack organization in detail. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 21
Session Outcome: 1 students will be proficient in identifying and understanding three-, two-, single-, and zero-address instruction types, enhancing their knowledge of computer instruction
formats
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Write and explain these notations to three-address, two-address. 2 Talk One minute paper
20 Explain single address and zero-address instruction types. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 22
Session Outcome: 1 Students will gain a comprehensive understanding of addressing modes, enabling them to effectively utilize different addressing methods in computer programming and
architecture.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 What is the significance of addressing modes? 2 Talk One minute paper
20 Explain Direct, Immediate, and relative addressing modes with examples. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 23
Session Outcome: 1 students will be skilled in executing data transfer and manipulation instructions, facilitating effective data handling in computer programs.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Discuss Data transfer instructions with examples. 2 Talk One minute paper
20 Discuss Data manipulation instructions with examples. 2 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 24
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain the characteristics of RISC in detail. 3 Talk One minute paper
20 Explain the advantages of RISC in detail. 3 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 25
Session Outcome: 1 Students will be able to understand the concepts of virtual memory.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain the need of virtual memory 4 Talk One minute paper
10 of 13 03-09-2024, 14:24
Firefox [Link]
20 Explain the concepts of virtual memory in detail 4 Talk One minute paper
20 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
SESSION NUMBER : 26
Session Outcome: 1 students will be well-versed in memory allocation techniques employed in cache memory, enhancing their ability to optimize data retrieval and storage in computer systems.
Teaching- Learning
Time(min) Topic BTL Active Learning Methods
Methods
5 Attendance 1 Talk --- NOT APPLICABLE ---
20 Explain different memory mapping techniques used in cache memory. 4 Talk One minute paper
20 Explain different memory mapping techniques used in cache memory. 4 Talk One minute paper
5 Conclusion& Summary 1 Talk --- NOT APPLICABLE ---
Assignment
Week Assignment Type Topic Details co
No
Weekly Homework Students need to write examples for 1's complement,
2 1 1's complement, 2's complement) CO1
Assignments 2's complement
Weekly Homework students need to draw the diagrams of D flip flop, T
6 2 D flip flop, T Flip flop CO2
Assignments Flip flop and explain the logic
Weekly Homework Students need to explain about the procedure of
9 3 Address Sequencing CO3
Assignments addressing sequence
Weekly Homework Students need to present the different memories in
12 4 Memory Hierarchy CO4
Assignments memory hierarchy
Hour 1 2 3 4 5 6 7 8 9
Day Component
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Mon
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory --- --- --- --- V-S1,V-S2 V-S1,V-S2 --- --- ---
Tutorial --- --- --- --- -- -- --- --- ---
Tue
Lab --- --- --- --- -- -- --- --- ---
Skilling --- --- --- --- -- -- --- --- ---
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Wed
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Thu
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory --- --- --- --- --- --- --- -- --
Tutorial --- --- --- --- --- --- --- V-S1,V-S1,V-S2,V-S2 V-S1,V-S1,V-S2,V-S2
Fri
Lab --- --- --- --- --- --- --- -- --
Skilling --- --- --- --- --- --- --- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sat
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Sun
Lab -- -- -- -- -- -- -- -- --
Skilling -- -- -- -- -- -- -- -- --
REMEDIAL CLASSES:
Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according
SELF-LEARNING:
11 of 13 03-09-2024, 14:24
Firefox [Link]
Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule notified accordingly.
[Link] Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS
EVALUATION PLAN:
Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4
End Semester
Weightage 40 10 10 10 10
Summative
End Semester Exam 180
Evaluation
Max Marks 100 25 25 25 25
Total= 40 %
Weightage 5 1.25 1.25 1.25 1.25
Home Assignment and Textbook 60
In Semester Max Marks 40 10 10 10 10
Formative Weightage 15 3.75 3.75 3.75 3.75
Tutorial 30
Evaluation Max Marks 60 15 15 15 15
Total= 26 % Weightage 6 1.5 1.5 1.5 1.5
ALM 20
Max Marks 40 10 10 10 10
In Semester Weightage 17 8.5 8.5
Semester in Exam-II 90
Summative Max Marks 50 25 25
Evaluation Weightage 17 8.5 8.5
Total= 34 % Semester in Exam-I 90
Max Marks 50 25 25
ATTENDANCE POLICY:
Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned to
him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester end examination of the course, for cases of medical issues and other unavoidable
circumstances the students will be condoned if their attendance is between 75% to 85% in every course, subjected to submission of medical certificates, medical case file and other needful
documental proof to the concerned departments
DETENTION POLICY :
In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be eligible for appearing to the Semester End Examination, failing to fulfill these
conditions will deem such student to have been detained in that course.
PLAGIARISM POLICY :
Supplement course handout, which may perhaps include special lectures and discussions
COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:
Supplement course handout, which may perhaps include special lectures and discussions
Delivery Component of Sections of Chamber Consultation Chamber Consultation Timings for Chamber Consultation Signature of Course
Name of Faculty
Faculty Faculty Day (s) each day Room No: faculty:
Kiran Kumar
L 2-MA - - - -
Kothamasu
Kiran Kumar
T 2-A - - - -
Kothamasu
Thonepudi Latha L 1-MA - - - -
Thonepudi Latha T 1-A - - - -
MEDURI
T 1-B - - - -
POORNIMA
PATAN BUSHRA
T 2-B - - - -
ANJUM
GENERAL INSTRUCTIONS
12 of 13 03-09-2024, 14:24
Firefox [Link]
Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course Faculty to the class.
NOTICES
All notices concerning the course will be displayed on the respective Notice Boards.
Department Of BCA
HEAD OF DEPARTMENT:
13 of 13 03-09-2024, 14:24