Definitions Bitmap and Pixmap

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-graphics/basics-of-computer-graphics/bitmap-and-pixmap-pixel-depth-and-memory-representation/asset-definitions-bitmap-and-pixmap 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 computer graphics, specifically focusing on frame buffers and their representation. It begins by defining a bitmap as a frame buffer in a black-and-white system with one bit per pixel, and a pixmap for systems with multiple bits per pixel. The instructor uses a diagram of a screen to illustrate how a picture is stored in a frame buffer, which is a memory area. The lecture then transitions to a problem-solving section, presenting a question about calculating the refresh rate of a graphic display system. The solution involves calculating the total number of pixels, the total bits in the frame buffer, and the time required to refresh the entire buffer, leading to the final answer of 19 frames per second. The video concludes with a diagram of a computer system architecture, showing the CPU, system memory, frame buffer, video controller, and monitor, and reiterates that the frame buffer stores the picture definition.

Chapters

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

    The video starts with a slide titled 'Bitmap and pix map' which defines a bitmap as the frame buffer in a black-and-white system with one bit per pixel, and a pixmap for systems with multiple bits per pixel. The instructor draws a diagram of a screen, representing a picture, and explains that this picture is stored in a memory area called a frame buffer. The instructor writes 'Picture -> definition' and 'Memory -> frame buffer' to illustrate this concept.

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

    The instructor continues to explain the concept of a frame buffer, writing 'Black & White' and 'bit map' on the screen. A diagram of a screen is shown, with a red dot representing a pixel. The instructor explains that in a black-and-white system, a single bit (0 or 1) is used to represent a pixel. The instructor then draws a small box with a 0 and a 1, labeling it 'bit map'. The instructor also writes '8 bits -> 2^8 = 256 different colors' and '16 bits -> 2^16' to explain how multiple bits per pixel allow for more colors.

  3. 5:00 – 7:14 05:00-07:14

    The video transitions to a problem-solving section. A question is presented: 'A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit of colour depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately:'. The instructor explains that the size of the frame buffer is calculated as Resolution X bits per pixel. The instructor calculates the total number of pixels (640 x 480 = 307,200) and the total time to refresh the buffer (307,200 x 200 ns = 61,440,000 ns). The refresh rate is then calculated as 1 / (61,440,000 x 10^-9) = 16.27 frames per second, which is approximately 16 frames per second. The instructor then shows a diagram of a computer system with a CPU, system memory, frame buffer, video controller, and monitor, and explains that the frame buffer stores the picture definition.

The lecture provides a comprehensive overview of frame buffers in computer graphics. It starts with the fundamental definitions of bitmap and pixmap, explaining how they relate to the number of bits per pixel. The instructor uses diagrams to illustrate how a picture is stored in a frame buffer, a memory area that holds the intensity values for all screen points. The lesson then applies this knowledge to a practical problem, demonstrating how to calculate the refresh rate of a display system by considering the total number of pixels, the bits per pixel, and the access time. The final part of the video connects the frame buffer to the overall computer system architecture, showing its role in the video display process.

Loading lesson…