Course Pack of COA - E2UC301T
Course Pack of COA - E2UC301T
FRAMEWORK
The Course Pack is a comprehensive and complete pedagogical guideline document that describes the components
of instruction delivery by a faculty member. It consists of the scheme of the course, Course Overview, Course
Objectives, Prerequisite course, Program-specific Outcomes (PSOs), Course outcomes (COs), Bloom’s taxonomy
(Knowledge Levels), Types of Courses, Course articulation matrix, Course assessment patterns, Course content,
Lesson Plan, Bibliography, Problem-based learning/case-studies/clinical, and Student-Centered learning (self-
learning towards life-long-learning). It not only provides a uniform design of Course delivery across the University
but also ensures freedom and flexibility to introduce innovations in learning and teaching and create vivid kinds of
assessment tools (alternate assessment tools) by a faculty member.
The course pack is developed by the faculty member teaching a course. If more than one faculty teaches the same
course, all the faculty members teaching the course shall be formed as a cluster, and a senior faculty member (Course-
lead) lead the Course delivery design in a team effort. The Course Pack provides ample scope and opportunity to
bring innovations in teaching pedagogies in a school/department.
Hence, the Course pack is a comprehensive learning-teaching strategy framework to be followed by all the faculty
members in schools/departments in the university. It is not only a tool for measuring the learning of a class but also
analyses the achievement levels (learning outcomes of the course) of all the students in a class in a continuous manner.
Tutorial
Theory
Tutorial 0 0
Practical
delivery
CIE
Practical 0 0
E
E
S
Self-Learning 0 0
Total 4 4 45 0 0 50% 50%
Course Lead: Dr. Brijesh Kumar Singh
Names of
Course Lead, Course
Course Coordinator: Mr. Dhirendra Siddharth
Instructors Theory Practical
Aanjey Mani Tripathi NA
Arun Kumar Rai
Balbindar Kaur
Brijesh Kumar Singh
Damodharan D.
Dhirendra Siddharth
Gurmeet Singh
Isha Chopra
Manish Verma
Minal Tandekar
Mukesh Kumar
Mullapudi Navyasri
Pragya Srivastava
Rajeev Kumar
Rati Bhan
Ruby Dahiya
Sandeep Bhatia
Savita Kumari
Sunil Kumar Chowdhary
Tarun Maini
Trapti Shrivastava
Vimal Singh
2. COURSE OVERVIEW
Computer Organization and Architecture is a foundational course in computer science and engineering that explores
the internal structure and operational principles of computer systems. The course covers the key concepts and
components that make up a computer system, including hardware design, instruction set architecture, memory
hierarchy, input/output mechanisms, and performance optimization. Students will gain an understanding of how
software interacts with hardware to perform computations and execute programs efficiently
3. COURSE OBJECTIVES
This course aims to provide a comprehensive understanding of the fundamental principles of computer organization
and architecture. Students will learn about the design and function of major computer system components, such as
the CPU, memory, and I/O systems, and analyze system performance to explore optimization techniques. The course
also emphasizes the interaction between hardware and software in executing instructions, offering practical
experience with assembly language programming and hardware simulation tools. This knowledge equips students
with the skills needed for advanced studies and careers in hardware and software development.
4. PREREQUISITE COURSE
PO2 Problem analysis: Identify, formulate, review research literature, and analyze complex computing science
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
computer sciences.
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern computing
science and IT tools including prediction and modeling to complex computing activities with an
understanding of the limitations.
PO6 IT specialist and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
computing science and information science practice.
PO7 Environment and sustainability: Understand the impact of the professional computing science solutions
in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
computing science practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities with the IT analyst
community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and understanding of the computing science
and management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent
and life-long learning in the broadest context of technological change.
PSO1 Have the ability to work with emerging technologies in computing requisite to Industry 4.0.
PSO2 Demonstrate Engineering Practice learned through industry internship and research project to solve live problems
in various domains.
TEXT BOOKS:
1. Morris Mano, Computer System Architecture, 3rd Edition, Prentice-Hall of India Private Limited, 1999.
REFERENCE BOOKS:
1. Hayes, John P. Computer architecture and organization. McGraw-Hill, Inc., 2002.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition,
Reprint 2012
3. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson
Education, Seventh edition, 2006
SWAYAM/NPTEL/MOOCs Certification
1. https://www.coursera.org/learn/comparch
2. https://nptel.ac.in/courses/106105163
3. https://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/
E2UC301T.1 To explain and classify the different types of register transfer and micro-operations.
E2UC301T.2 To analyze and compare different computer organizations and CPU components, including
instruction formats and addressing modes.
To assess and design strategies for memory organization, including cache and virtual memory
E2UC301T.4 management.
Bloom’s taxonomy is a set of hierarchical models used for the classification of educational learning objectives into
levels of complexity and specificity. The learning domains are cognitive, affective, and psychomotor.
The Course articulation matrix indicates the correlation between Course Outcomes and Program Outcomes and their
expected strength of mapping in three levels (low, medium and high).
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
COs/Pos
E2UC301T.1 3 3 2 - 2 - - 1 - - - - - -
E2UC301T.2 3 3 2 - - 2 - - - 1 - - - -
E2UC301T.3 3 3 2 - 2 - - 1 - - - - - -
E2UC301T.4 3 3 3 3 3 - 1 - 1 - - 2 - -
E2UC301T.5 3 3 3 3 3 2 2 - 1 1 - 2 - -
Note: 1-Low, 2-Medium, 3-High \ *first semester first course and first Course Outcome
Total
Theory
Tutorial
Tutorial
Practical
Practical
Self-study
Self-study
Total no.
of classes
27 L Memory Hierarchy
28 L Main Memory Designing of various
29 L Auxiliary Memory memory system for the
30 L Associative Memory computer for provided CO4
31 L Cache Memory specifications and
Virtual Memory requirements
32 L
33 L Memory Management Hardware
12. BIBLIOGRAPHY
TEXT BOOKS:
2. Morris Mano, Computer System Architecture, 3rd Edition, Prentice-Hall of India Private Limited, 1999.
REFERENCE BOOKS:
4. Hayes, John P. Computer architecture and organization. McGraw-Hill, Inc., 2002.
5. Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition,
Reprint 2012
6. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson
Education, Seventh edition, 2006
SWAYAM/NPTEL/MOOCs Certification
4. https://www.coursera.org/learn/comparch
5. https://nptel.ac.in/courses/106105163
https://www.geeksforgeeks.org/computer-organization-and-architecture-tutorials/
b) Summative assessment
The goal of summative assessment is to evaluate student learning at the end of a Course by comparing it against some
standard or benchmark. Examples of summative assessments include:
a final project
a paper
Semester-End Examination (For courses running in Semester mode)
End-Term Examination (For courses running in Annual Mode)
Information from summative assessments can be used formatively when students or faculty use it to guide their efforts
and activities in subsequent courses.
c) Weightage
The formative and summative assessments are given 50-50 weightage to ensure proper learning levels among the
students.
#
Typical Rubric for the Internal Assessments
Type of Assessment Tools QUIZ AAT$/MOOC Certifications
Internal Assessments
$
AAT is Literature survey, Seminar, Assignment, Term Paper, Slip Test (or) MOOC Certificate relevant to the
course
14.2Assessment Pattern for Integrated (Blended) Course:
CIE Total Marks
Type of Course Final Marks
(B) LAB CIE*0.5+SEE*0.5
LAB Work@ + Record MTE CIE SEE
EXAM*
INTEGRATED 25 50 25 100 100 100
@
Lab Work-15 marks + Lab Record-10 marks
*
Passing Criteria-30% of marks to be secured in the lab Exam conducted by two examiners (one internal and one
external)
2 CREDIT MOOC
25 25 50 50 100
COURSES
*
from MOOC portal
LABORATORY 25 25 50 50 100
@
Lab Work-15 marks + Lab Record-10 marks
*
Passing Criteria-30% of marks to be secured in the lab Exam conducted by two examiners (one internal and one
external)
Type of Course
(R)
Conclusion/
FinalMarks
Identification
Result Analysis
Methodology
Experimental/
Findings
CIE+SEE
Literature Review/
Problem
Applicability
CIE SEE%
TRL 2 Applied Initial practical applications are identified. Potential of material or process to solve a
Research problem, satisfy a need, or find application is confirmed.
TRL 3 Critical Function
Applied research advances and early-stage development begins. Studies and laboratory
or Proof of Concept
measurements validate analytical predictions of separate elements of the technology.
Established
TRL 4 Lab Testing/
Design, development and lab testing of components/processes. Results provide
Validation of Alpha
evidence that performance targets may be attainable based on projected or modelled
Prototype Component/
systems.
Process
Note: Council Driven Programs can follow their own assessment pattern.
Practice Problems
1.
2.
3.
4.
5.
6.
7.
12. In following assembly language program, identify that which type of addressing mode has been used in
each of the instructions.
13. The following memory units are specified by the number of words times the number of bits per word. How
many address lines and input-output data lines are needed in each case?
14. How many 128 x 8 memory chips are needed to provide a memory capacity of 4096 x 16?
15. Show the value of all bits of a 12-bit register that hold the number equivalent to decimal 215 in (a) binary;
(b) binary-coded octal; (c) binary-coded hexadecimal; (d) binary-coded decimal (BCD).
16. Perform the arithmetic operations (+42) + (- 13) and (-42) - (- 13) in binary using signed-2's complement
representation for negative numbers.
17. A digital computer has a common bus system for 16 registers of 32 bits each. The bus is constructed with
multiplexers.
18. The 8-bit registers AR, BR, CR and DR initially have the following values:
AR= 11110010, BR= 11111111, CR=10111001 and DR=11101010. Determine the 8-bit values in each
register after execution of the following sequence of micro operations.
AR AR + BR
CR CR ^ DR, BR BR +1
AR AR - CR
19. A computer uses a memory unit with 256K words of 32 bits each. A binary instruction code is stored in one
word in memory. The instruction has four parts: an indirect bit, an operation code, a register code part to
specify one of 64 registers, and an address part.
a. How many bits are there in the operation code, the register code part, and the address part?
b. Draw the instruction word format and indicate the number of bits in each part.
c. How many bits are there in the data and address inputs of the memory?
b. Show the binary operation that will be performed in the AC when the instruction is executed.
c. Give the contents of registers PC, AR, DR, AC, and IR in hexadecimal and the values of E, I, and the
sequence counter SC in binary at the end of the instruction cycle.
21. A digital computer has a memory unit with a capacity of 16,384 words, 40 bits per word. The instruction
code format consists of six bits for the operation part and 14 bits for the address part (no indirect mode bit).
Two instructions are packed in one memory word and a 40-bit instruction register IR is available in the
control unit. Formulate a procedure for fetching and executing instructions for this computer.
22. The following program is stored in the memory unit of the basic computer. Show contents of the AC and PC,
at the end, after each instruction is executed. All numbers listed below are in hexadecimal.
10 CLA
013 HLT
X = (A + B) * (C + 016 C1A5 D)
25. The memory unit of a computer has 256K words of 32 bits each. The computer has an instruction format
with four fields: an operation code field, a mode field to specify one of seven addressing modes, a register
address field to specify one of 60 processor registers, and a memory address. Specify the instruction format
and the number of bits in each field if the in instruction is in one memory word.
26. An instruction is stored at location 300 with its address field at location 301. The address field has the value
400. A processor register R 1 contains the number 200. Evaluate the effective address if the addressing mode
of the instruction is (a) direct; (b) immediate; (c) relative; (d) register indirect; (e) index with R1 as the index
register.
27 Give five examples of external interrupts and five examples of internal interrupts. What is the difference
between a software interrupt and a subroutine call?
28. The two-word instruction at address 200 and 201 is a "load to AC" instruction with an address field equal to
500. The first word of the instruction specifies the operation code and mode, and the second word specifies
the address part. PC has the value 200 for fetching this instruction. The content of processor register R 1 is
400, and the content of an index register XR is 100. AC receives the operand after the instruction is executed.
The figure lists a few pertinent addresses and shows the memory content at each of these addresses. Calculate
the effective address and the operand that must be loaded into AC for (a) Direct, (b) Immediate, (c) Indirect,
(d) Relative, (e) Indexed (f) Register (g) Register Indirect (h) Autoincrement, (i) Autodecrement addressing
mode.
29. In certain scientific computations it is necessary to perform the arithmetic operation (Ai + Bi) (Ci + Di) with
a stream of numbers. Specify a pipeline configuration to carry out this task. List the contents of all registers
in the pipeline for i = 1 through 6.
30. Draw a space-time diagram for a six-segment pipeline showing the time it takes to process eight tasks.
31. Determine the number of dock cycles that it takes to process 200 tasks in a six-segment pipeline.
32. A no pipeline system takes 50 ns to process a task. The same task can be processed in a six-segment pipeline
with a clock cycle of 10 ns. Determine the speedup ratio of the pipeline for 100 tasks. What is the maximum
speedup that can be achieved?
33. A weather forecasting computation requires 250 billion floating-point operations. The problem is processed
in supercomputer that can perform 100 megaflops. How long will it take to do these calculations?
34. Perform the arithmetic operations below with binary numbers and with negative number in signed-2"s
complement representation. Use seven bits to accommodate each number together with its sign. In each case,
determine if there is an overflow by checking the carries into and out of the sign bit position.
(a) (+35) + (+40)
35. Show the step-by-step multiplication process using Booth algorithm when the following binary numbers are
multiplied. Assume 5-bit registers that hold signed numbers, the multiples and in both cases is + 15.
36. Explain the difference between the daisy chaining priority and parallel priority interrupts. Draw the diagrams
to explain their working.
37. A computer uses a memory unit with 256 K words of 32 bits each. A binary instruction code is stored in one
word of memory. The instruction has four parts: an indirect bit, an operation code, a register code part to
specify one of 64 registers and an address part. Draw the instruction word format and indicate the number of
bits in each part.
(i) How many chips are needed to provide a memory capacity of 1024 bytes?
(ii) How many chips are needed to provide a memory capacity of 16K bytes?
39. How many characters per second can be transmitted over a 1200-baud line in each of the following modes?
(Assume a character code of eight bits).
40. a. How many 128 x 8 RAM chips are needed to provide a memory capacity of 2048 bytes?
b. How many lines of the address bus must be used to access 2048 bytes of memory? How many of these
lines will be common to all chips?
c. How many lines must be decoded for chip select? Specify the size of the decoder.
41. The logical address space in a computer system consists of 128 segments. Each segment can have up to 32
pages of 4K words in each. Physical memory consists of 4K block of 4K words in each. Formulate the logical
and physical address formats.
42. Consider a direct mapped cache of size 32 KB with block size 32 bytes. The CPU
generates 32 bits addresses. Calculate the number of bits needed for cache indexing and the
number of tag bits are respectively.