Raster Scan and Random Scan

Duration: 3 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-raster-scan-and-random-scan 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
  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.

The video is a lecture on raster and random-scan displays, focusing on the working principle of raster-scan systems. It begins by explaining that in a raster-scan system, an electron beam sweeps across the screen from top to bottom, one row at a time. As the beam moves across each row, its intensity is turned on and off to create a pattern of illuminated spots, which form an image. The lecture then transitions to the concepts of horizontal and vertical retrace. The horizontal retrace is the return of the electron beam from the end of one scan line to the beginning of the next, while the vertical retrace is the return from the bottom of the screen to the top to start a new frame. Diagrams illustrate these scanning patterns, and the instructor uses on-screen annotations to highlight key terms like 'raster scan' and 'horizontal retrace'.

Chapters

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

    The video starts with a slide titled 'Raster and Random-Scan Displays'. The first section, 'Raster-Scan Displays', explains the working principle. The text states that in a raster-scan system, the electron beam is swept across the screen one row at a time from top to bottom. As the beam moves across each row, the beam intensity is turned on and off to create a pattern of illuminated spots. The slide includes a diagram showing four stages of a raster scan, where a pattern of dots (an 'A') is built up row by row. The instructor writes 'Frame buffer' on the slide, indicating that the image data is stored in a memory buffer. The definition of a raster scan is provided: 'A raster scan system displays an item as a group of separate points along each screen line.'

  2. 2:00 – 3:28 02:00-03:28

    The video transitions to a new slide titled 'Horizontal and Vertical Retrace'. The slide explains that at the end of each scan line, the electron beam returns to the left side of the screen to begin the next line, a process known as 'Horizontal Retrace'. At the end of each frame, the beam returns to the top left corner to begin the next frame, known as 'Vertical Retrace'. A diagram on the slide illustrates this process, showing the beam scanning across the screen in a zigzag pattern, with arrows indicating the horizontal and vertical retrace paths. The instructor annotates the diagram, writing 'top left' and 'bottom right' to clarify the starting and ending points of the scan.

The lecture provides a comprehensive overview of raster-scan display technology. It first establishes the fundamental concept of a raster scan, where an image is constructed by sequentially illuminating a grid of points. The core of the explanation is the scanning process, which is broken down into two key phases: the horizontal retrace, which moves the beam back to the start of the next line, and the vertical retrace, which moves the beam back to the top of the screen to begin a new frame. The visual aids, including the step-by-step diagram of the scan and the annotated retrace diagram, effectively illustrate the sequential and systematic nature of this display method.

Loading lesson…