Random Scan Displays

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/other-recurring-cs-topics/basics-of-computer-graphics/raster-vs-random-scan/asset-random-scan-displays 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 video is a lecture on computer graphics, focusing on random-scan displays. It begins by defining random-scan displays, explaining that they use a CRT with an electron beam directed only to the parts of the screen where a picture is to be drawn. This method, which draws pictures line by line, is also known as vector displays or stroke-writing displays. The lecture then details the system architecture, showing a diagram of a random-scan system with a CPU, system memory, display processor, and monitor connected by a system bus. It explains that a picture is defined by a set of line-drawing commands stored in a refresh display file (or display list) in memory. The display processor accesses this file to refresh the screen. The lecture concludes with a comparison table between raster scan and random scan systems, highlighting differences in electron beam movement, resolution, picture definition, and the ability to display realistic scenes. Finally, it briefly introduces colour CRT monitors and the two basic techniques for producing colour: beam-penetration and shadow-mask methods.

Chapters

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

    The lecture begins with a slide titled 'Random-Scan Displays'. The instructor explains that in a random-scan display unit, a CRT's electron beam is directed only to the parts of the screen where a picture is to be drawn. This is contrasted with raster scan systems. The slide states that random-scan monitors draw a picture one line at a time, which is why they are also referred to as vector displays, stroke-writing displays, or calligraphic displays. The instructor emphasizes that the component lines of a picture are drawn and refreshed in a specific order. The slide includes a diagram showing four different shapes (a circle, a rectangle, a line, and a triangle) being drawn on a CRT screen, illustrating the concept of drawing individual lines. The instructor writes 'picture definition' and 'store -> line command' on the slide to explain how the picture is stored as a set of commands.

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

    The lecture continues by explaining the memory storage of a picture definition in a random-scan system. The slide states that a picture is stored as a set of line-drawing commands in an area of memory called the refresh display file, display list, or display program, also known as a refresh buffer. It notes that random-scan systems are designed for line-drawing applications and cannot display realistic shaded scenes. A diagram of a 'RANDOM-SCAN SYSTEM' is shown, illustrating the components: CPU, System Memory, Display Processor, and Monitor, all connected by a System Bus. The instructor explains that an application program is input and stored in system memory with a graphics package. Graphics commands are translated into a display file, which the display processor accesses to refresh the screen. The video then transitions to a comparison table between Raster Scan and Random Scan systems. The table compares them on basis of electron beam movement (swept across screen vs. directed to portions), resolution (poor vs. good), picture definition (intensity values for points vs. line drawing instructions), and realistic display (effective vs. unable). The final slide introduces 'Colour CRT Monitors' and mentions the two basic techniques: beam-penetration method and shadow-mask method.

The video provides a comprehensive overview of random-scan display systems in computer graphics. It starts by defining the core principle: the electron beam is directed only to the specific locations on the screen needed to draw a picture, making it a vector-based system. This is contrasted with raster scan systems. The lecture then details the system's architecture, showing how a program's graphics commands are stored in a display file in memory and processed by a display processor to refresh the screen. A key point is that random-scan systems are optimized for line drawing and cannot render realistic, shaded scenes. The lesson concludes with a direct comparison table that clearly differentiates raster and random scan systems across several key parameters, reinforcing the concepts taught. The final topic introduces the methods for creating color on a CRT, setting the stage for further discussion.

Loading lesson…