RISC Vs CISC

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/control-unit-design/risc-vs-cisc-arch/asset-risc-vs-cisc after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces Reduced Instruction Set Computer (RISC) architecture, defining it by its use of fewer, simpler instructions for faster execution with reduced memory dependency. It details key characteristics like fixed-length instructions, register-based operations, and hardwired control units. The historical context is provided, highlighting Stanford's MIPS and Berkeley's RISC projects in the 1980s, alongside modern implementations like ARM and IBM PowerPC. Finally, the lecture contrasts RISC with Complex Instruction Set Computer (CISC) using a detailed comparison table covering instruction count, addressing modes, and control unit complexity.

Chapters

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

    The instructor defines RISC using a slide listing core characteristics. He underlines phrases such as 'use fewer instructions with simple constructs' and 'executed much faster within the CPU without having to use memory as often.' Key features listed include relatively few instructions, few addressing modes, and memory access limited to load and store instructions. The slide emphasizes that all operations are done within CPU registers and uses a fixed-length, easily decoded instruction format. This section establishes the foundational definition of RISC as a processor design philosophy focused on efficiency and speed through simplicity.

  2. 2:00 – 5:00 02:00-05:00

    The lecture expands on RISC technicalities, noting 'Single-cycle instruction execution' and 'Hardwired rather than microprogrammed control.' The instructor discusses the history, mentioning that while forerunners existed in the 60s and 70s, the modern concept dates to the 1980s, specifically citing projects at 'Stanford University' and the 'University of California, Berkeley.' He explains that Stanford's MIPS became a successful architecture, while Berkeley's RISC gave the name to the concept and was commercialized as SPARC. The segment concludes with a list of RISC designs including ARC, Alpha, ARM, and MIPS, noting ARM's dominance in smartphones and supercomputers like Summit, which was the world's fastest supercomputer as of January 2020.

  3. 5:00 – 6:34 05:00-06:34

    The focus shifts to Complex Instruction Set Computer (CISC), defined as a computer where single instructions can execute several low-level operations. The instructor presents a comparison table contrasting CISC and RISC formats. He underlines that CISC has a 'Large number of instructions (around 1000)' and 'Variable length instruction format,' whereas RISC has 'Relatively Few numbers of instruction' and 'Fixed length easy to decode instruction format.' The table also contrasts operand manipulation (memory vs. registers) and control units (microprogrammed vs. hardwired), highlighting that CISC is 'Powerful but costly' while RISC is 'Relatively less powerful but cheap.' This comparison clarifies the trade-offs between the two architectures.

The video provides a comprehensive overview of RISC architecture, starting with its fundamental definition and operational advantages like speed and simplicity. It traces the historical evolution from early concepts to the pivotal 1980s projects at Stanford and Berkeley that popularized the technology. The lecture then broadens the scope to include modern RISC implementations like ARM and IBM PowerPC, establishing their relevance in both consumer electronics and high-performance computing. Finally, the instructor solidifies understanding by contrasting RISC with CISC, using a structured table to highlight differences in instruction complexity, addressing modes, and hardware implementation, effectively distinguishing the two major processor design philosophies and their respective trade-offs in cost and performance.

Loading lesson…