Architecture of Raster System

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-graphics/basics-of-computer-graphics/raster-vs-random-scan/asset-architecture-of-raster-system after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: 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
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive overview of raster scan systems, beginning with a diagram of their architecture and a detailed explanation of its components. The lecture then transitions into a series of worked examples to calculate key performance metrics. The first example calculates the pixel access rate for two different screen resolutions (640x480 and 1280x1024) at a refresh rate of 60 frames per second, using the formula: (resolution width) x (resolution height) x (refresh rate). The second example determines the minimum video RAM required for a system with a resolution of 1024x768 and a color palette of 65,536 colors, which requires 16 bits per pixel, leading to a calculation of total memory as (resolution width) x (resolution height) x (bits per pixel). The final example calculates the time spent scanning each row of pixels for a 1280x1024 system at 60 frames per second, using the formula: 1 / (refresh rate x number of scan lines). The video uses a digital whiteboard to write out the equations and solutions step-by-step.

Chapters

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

    The video begins with a slide titled "Architecture of Raster Scan Systems," displaying a block diagram. The diagram shows a CPU connected to a System Memory, which is attached to a Frame Buffer. The Frame Buffer is connected to a Video Controller, which in turn connects to a Monitor. All components are linked via a System Bus. The text below the diagram explains that the architecture comprises a Central Processing Unit (CPU), System Memory generally attached to the frame buffer, and a special-purpose processor called the video controller or display controller. The video controller accesses the frame buffer to refresh the screen, and the entire image is scanned out sequentially by the video controller. The instructor highlights the components on the diagram, such as the CPU, System Memory, and Frame Buffer, and explains their roles in the system.

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

    The video transitions to a new example problem. The on-screen text reads: "Example: Consider two raster systems with the resolutions of 640 x 480 and 1280 x 1024. How many pixels could be accessed per second in each of these systems by a display controller that refreshes the screen at a rate of 60 frames per second?" The instructor begins to solve the problem for the first system. They write the resolution as 640 x 480 and the refresh rate as 60 frames per second. The calculation is shown as 640 x 480 x 60, which equals 1.8432 x 10^7 pixels per second. The instructor then moves to the second system, writing the resolution as 1280 x 1024 and performing the calculation 1280 x 1024 x 60, resulting in 7.86432 x 10^7 pixels per second. The instructor explains that the access rate is the product of the number of pixels in a frame and the number of frames refreshed per second.

  3. 5:00 – 10:00 05:00-10:00

    The video presents a new example: "Example: Consider a raster system with the resolution of 1024 x 768 pixels and the color palette calls for 65,536 colors. What is the minimum amount of video RAM that the computer must have to support the above-mentioned resolution and number of colours?" The instructor explains that to determine the minimum video RAM, one must first find the number of bits required to represent each pixel. Since 65,536 = 2^16, 16 bits are needed per pixel. The total memory required is calculated as (resolution width) x (resolution height) x (bits per pixel), which is 1024 x 768 x 16. The instructor then moves to a third example: "Example: How much time is spent scanning across each row of pixels during screen refresh on a raster system with resolution of 1280 x 1024 and a refresh rate of 60 frames per second?" The instructor writes the resolution as 1280 x 1024 and the refresh rate as 60 frames per second. They explain that one frame takes 1/60 seconds, and since there are 1024 scan lines, one scan line takes 1/(60 x 1024) seconds, which is approximately 16.7 microseconds.

  4. 10:00 – 11:13 10:00-11:13

    The video continues with the third example. The instructor writes the calculation for the time to scan one row of pixels: 1 / (60 frames/sec * 1024 lines) = 1 / 61440 sec. This is calculated to be approximately 16.27 microseconds. The instructor explains that this is the time required to scan each row of pixels during a screen refresh. The video concludes with the instructor summarizing the key concepts and calculations covered in the lecture, emphasizing the importance of understanding the relationship between resolution, refresh rate, and the performance of the video controller.

The video provides a structured and progressive lesson on raster scan systems. It starts with a foundational understanding of the system's architecture, identifying the CPU, System Memory, Frame Buffer, and Video Controller as key components. This conceptual framework is then applied to solve practical problems. The first problem demonstrates how to calculate the pixel access rate, a critical performance metric, by multiplying the screen resolution by the refresh rate. The second problem shifts focus to memory requirements, showing how the number of colors in a palette determines the bits per pixel, which is then used to calculate the total video RAM needed. The final problem calculates the time per scan line, illustrating the real-time constraints of the display system. The progression from architecture to calculation demonstrates a clear pedagogical approach, moving from theory to application.

Loading lesson…