COA (Computer Organization and Architecture)
COA (Computer Organization and Architecture) is the semester 4 subject of computer engineering at Mumbai University.
The prerequisite of this subject is Digital Logic Design and Application. Course Objectives of the subject Computer Organization and Architecture is to have a thorough understanding of the basic structure and operation of a digital computer. To discuss in detail the operation of the arithmetic unit including the algorithms & implementation of fixed-point and floating-point addition, subtraction, multiplication & division. To study the different ways of communicating with I/O devices and standard I/O interfaces. To study the hierarchical memory system including cache memories and virtual memory. Course Outcomes of the subject Computer Organization and Architecture At the end of the course student should be able to. To describe the basic structure of the computer system. To demonstrate the arithmetic algorithms for solving ALU operations. To describe instruction-level parallelism and hazards in typical processor pipelines. To describe superscalar architectures, multi-core architecture, and their advantages to demonstrate the memory mapping techniques. To Identify various types of buses, interrupts, and I/O operations in a computer system.
In computer engineering, computer architecture is a set of rules and methods that describe the functionality, organization, and implementation of computer systems. Some definitions of architecture define it as describing the capabilities and programming model of a computer but not a particular implementation. In other definitions computer architecture involves instruction set architecture design, microarchitecture design, logic design, and implementation. Booth algorithm gives a procedure for multiplying binary integers in signed 2’s complement representation in efficient way, i.e., less number of additions/subtractions required. It operates on the fact that strings of 0’s in the multiplier require no addition but just shifting and a string of 1’s in the multiplier from bit weight 2^k to weight 2^m can be treated as 2^(k+1 ) to 2^m. As in all multiplication schemes, booth algorithm requires examination of the multiplier bits and shifting of the partial product. Prior to the shifting, the multiplicand may be added to the partial product, subtracted from the partial product, or left unchanged according to following rules: The multiplicand is subtracted from the partial product upon encountering the first least significant 1 in a string of 1’s in the multiplier. The multiplicand is added to the partial product upon encountering the first 0 (provided that there was a previous ‘1’) in a string of 0’s in the multiplier. The partial product does not change when the multiplier bit is identical to the previous multiplier bit.
Module Overview of Computer Architecture & Organization consists of the following subtopics Introduction, Basic organization of computer. Block level description of the functional units. Data Representation and Arithmetic Algorithms Integer Data computation: Addition, Subtraction. Multiplication: unsigned multiplication, Booth‟s algorithm. Division of integers: Restoring and non restoring division, Floating point representation. IEEE 754 floating point number representation. Floating point arithmetic: Addition, Subtraction, Multiplication, Division. Module Processor Organization and Architecture consists of the following subtopics Von Neumann model, Harvard Architecture, Register Organization, Instruction formats, addressing modes, instruction cycle. Instruction interpretation and sequencing. ALU and Shifters, Basic pipelined data path and control, Data dependences, data hazards, Branch hazards, delayed branches, branch prediction Performance measures CPI, speedup, efficiency, throughput and Amdahl‟s law. Module Control Unit Design consists of the following subtopics Hardwired control unit design methods: State table, delay element, sequence counter with examples like control unit for multiplication and division ,Microprogrammed control Unit: Microinstruction sequencing and execution. Micro operations, Wilkie‟s microprogrammed Control Unit, Examples on microprograms
Module Memory Organization consists of the following subtopics Classifications of primary and secondary memories. Types of RAM (SRAM, DRAM, SDRAM, DDR, SSD) and ROM, Characteristics of memory, Memory hierarchy: cost and performance measurement. Virtual Memory: Concept, Segmentation and Paging, Address translation mechanism. Interleaved and Associative memory. Cache memory Concepts, Locality of reference, design problems based on mapping techniques. Cache Coherency, Write Policies. Module I/O Organization and Peripherals consists of the following subtopics Common I/O device types and characteristics, Types of data transfer techniques: Programmed I/O, Interrupt driven I/O and DMA. Introduction to buses, Bus arbitration and multiple bus hierarchy, Interrupt types, Interrupts handling Module Advanced Processor Principles consists of the following subtopics Introduction to parallel processing, Flynn‟s Classification, Concepts of superscalar architecture, out-of-order execution, speculative execution, multithreaded processor, VLIW, data flow computing. Introduction to Multi-core processor architecture.
Suggested Text Books for the subjects Computer Organization and Architecture by Mumbai university are as follows William Stallings, “Computer Organization and Architecture: Designing for Performance”, Pearson Publication, 10th Edition, 2013 . John P. Hayes, “Computer Architecture and Organization”, McGraw-Hill, 1988 B. Govindarajulu, “Computer Architecture and Organization: Design Principles and Applications”, Second Edition, McGraw-Hill (India). Suggested Reference Books for the subjects Computer Organization and Architecture by Mumbai University are as follows Andrew S. Tanenbaum “Structured Computer Organization”, Pearson, Sixth Edition. Morris Mano. “Computer System Architecture” Pearson Publication, 3rd Edition, 2007. Kai Hwang, Fayé Alayé Briggs. “Computer architecture and parallel processing”, McGraw-Hill . P. Pal Chaudhuri. “Computer Organization and Design” Prentice Hall India, 2004 Dr. M. Usha, T.S. Shrikant. “Computer System Architecture and Organization” Wiley India, 2014.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
Course Features
- Lectures 48
- Quiz 0
- Duration 10 hours
- Skill level All levels
- Language Hindi
- Students 5950
- Assessments Yes
Curriculum
- 7 Sections
- 48 Lessons
- 24 Weeks
Expand all sectionsCollapse all sections
- Introduction/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover\:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus\:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus\:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus\:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm\:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md\:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg\:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment { display: none !important; } .thim-course-landing-button { display: none !important; }12
- 1.1COA Introduction9 Minutes
- 1.2Floating Point Number Representation in IEEE 75417 Minutes
- 1.3Booth’s Algorithm with Solved Example part 115 Minutes
- 1.4Booth’s Algorithm with Solved Example part 210 Minutes
- 1.5Booth’s Algorithm with Solved Example part 38 Minutes
- 1.6Numerical Data Representation7 Minutes
- 1.7Restoring Division Part 0118 Minutes
- 1.8Restoring Division Part 0210 Minutes
- 1.9Non Restoring Division Part 0112 Minutes
- 1.10Non Restoring Division Part 0210 Minutes
- 1.11RISC Microprocessor12 Minutes
- 1.12CISC Microprocessor9 Minutes
- Processor Organization and Architecture3
- Control Unit Design4
- Memory Organization12
- 4.1Memory and its characteristics9 Minutes
- 4.2DRAM ( Dynamic RAM )7 Minutes
- 4.3SRAM (Static RAM)8 Minutes
- 4.4Cache Memory Full Concept with working7 Minutes
- 4.5Memory Hierarchy and Locality of Reference13 Minutes
- 4.6Memory Interleaved10 Minutes
- 4.7Virtual Memory & Paging concept10 Minutes
- 4.8Memory Segmentation10 Minutes
- 4.9Demand Paging11 Minutes
- 4.10Cache Coherence Single & Multi Processor11 Minutes
- 4.11Cache Coherence Strategies9 Minutes
- 4.12MESI Write invalidate snoopy protocol11 Minutes
- I/O Organization and Peripherals9
- 5.1IO module11 Minutes
- 5.2Programmed IO12 Minutes
- 5.3Interrupt Driven IO11 Minutes
- 5.4DMA Driven IO13 Minutes
- 5.5BUS and BUS Arbitration11 Minutes
- 5.6BUS Arbitration-Daisy Chaining8 Minutes
- 5.7BUS Arbitration-Polling Method7 Minutes
- 5.8Instruction Cycles and Interrupt Mechanism7 Minutes
- 5.9BUS Arbitration-Independent Request4 Minutes
- Advanced Processor Principles7
- Notes1
Leave A Reply
You must be logged in to post a comment.
19 Comments
How to enroll for the course?
you can enroll now
Thanks bhaiya😊❤️
your welcome
I am going to start from today
Is this course complete for cs students.
Thankyou sir …
Is this the complete course?
yes
will i get the certificate after the completion of the course??
No this course will help you understand the concept really well
How to take a notes pls….tell me .
Thanks for video .
you will get it in the course
Where can i get the notes for the subject?
it is in the course
Sir from where I can get the Handmade notes of COA ??
it is in the course
great bhai
Thanks bhaiya
Videos is different from utube or same?
Hey the videos are same they are arrange and if the course is paid because notes will included in this