Memory References

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-c-computer-architecture/control-unit-design/instruction-types/asset-memory-references after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment provides a comprehensive analysis of a computer's control unit, specifically focusing on the instruction cycle and the execution of memory-reference instructions. The instructor utilizes flowcharts and tables to explain how the control unit decodes instructions, handles indirect addressing, and performs specific micro-operations. The lesson progresses from the general logic of instruction fetching and decoding to the detailed execution steps for a set of standard assembly language instructions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor begins by dissecting a control unit flowchart. He explains the initialization step where the sequence counter SC is set to 0. The process moves to loading the address register AR with the program counter PC and fetching the instruction into the instruction register IR. He highlights the decoding of the operation code in bits 12 through 14 of the IR. A key decision point involves the signal D3, which identifies memory-reference instructions. The instructor explains the role of the I bit (bit 15) in determining indirect addressing. If I is 1, the effective address is retrieved from memory using the micro-operation AR <- M[AR]. If I is 0, the address is already in AR, and the instruction proceeds directly to execution.

  2. 2:00 – 4:59 02:00-04:59

    The lecture transitions to a detailed table of Memory-Reference Instructions, listing symbols like AND, ADD, LDA, STA, BUN, BSA, and ISZ. The instructor explains the symbolic descriptions, such as AC <- AC ^ M[AR] for the AND instruction. He then presents detailed flowcharts for each of these instructions, breaking down the micro-operations. For example, the AND instruction involves fetching data into the data register DR (DR <- M[AR]) and then performing the logical AND with the accumulator AC. Similarly, the ADD instruction involves DR <- M[AR] followed by AC <- AC + DR. The BSA instruction is shown to store the return address in memory (M[AR] <- PC) and update the program counter (PC <- AR). The ISZ instruction increments the memory word and skips if the result is zero. The segment concludes with a brief overview of hexadecimal codes for other instructions like CLA and CLE.

The video effectively bridges the gap between abstract control logic and concrete instruction execution. By first establishing the general flowchart for instruction decoding and indirect addressing, the instructor sets the stage for understanding the specific micro-operations required for each instruction type. The detailed breakdown of memory-reference instructions demonstrates how the control unit orchestrates data movement between registers like AC, AR, PC, and DR to perform arithmetic, logic, and control flow tasks. This progression from general decoding to specific execution highlights the hierarchical nature of computer architecture design.

Loading lesson…