Practice Question
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the course: About the Course
- General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
- Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Syllogisms, Seating Arrangements, Ranking, Order and Sequence, Time and Work, Ratio and Proportion, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Cubes and Dice, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Profit, Loss and Discount, Mensuration, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Trigonometry, Probability, Measurement and Quantity Take-Off, Clocks and Calendars, Articles and Determiners, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Modals, Conditionals and Subjunctive, Algebra, Vocabulary, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, HCF LCM, Combinatorics
- CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
- CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
- CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
- CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
- CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
- CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics, Internet of Things
- CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Semiconductor Memories and Programmable Logic Devices, Logic Families, Arithmetic Circuits, Waveform Generators and Timer Circuits, Minimization of Boolean Functions
- CS | Data Structures: Introduction to DS, Array, Stack, Queue
- CS | Cryptography: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
- UP Police Previous Year Papers:
- UP Police Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture provides a step-by-step derivation for calculating the memory space of a tridiagonal matrix. It begins by defining the matrix condition where elements are zero if they are more than one position away from the main diagonal. Using a 4x4 example, the instructor visualizes the non-zero elements forming a band around the main diagonal. He counts the elements in the main diagonal (n), upper diagonal (n-1), and lower diagonal (n-1). By summing these, he derives the total count of non-zero elements as 3n-2. Finally, he calculates the total space by multiplying this count by the size of an element (4 bytes), demonstrating an efficient storage method for sparse matrices.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a question displayed on the screen: "Consider a n*n square matrix A, such that A[i][j] = 0 if |i-j| > 1. find the space required to store the array in memory". The instructor underlines key phrases like "n*n square matrix", "A[i][j] = 0", and "space required" to emphasize the problem constraints. He decides to use a concrete example with n=4 to visualize the matrix structure. He draws a 4x4 grid on the whiteboard. He explains the condition |i-j| > 1, meaning if the absolute difference between row index i and column index j is greater than 1, the element is zero. He fills the first row (i=0) by checking j=0, 1, 2, 3. He calculates |0-0|=0, |0-1|=1, |0-2|=2, |0-3|=3. Since 2 and 3 are greater than 1, he writes 0 in those positions. He fills the first two positions with 'a' and 'b'. He continues this process for the entire matrix, filling it with letters like 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j' to represent non-zero values. He circles the non-zero elements to highlight the pattern, showing that non-zero values only exist on the main diagonal and the diagonals immediately above and below it.
2:00 – 5:00 02:00-05:00
The instructor proceeds to count the non-zero elements to determine the storage requirement. He writes "Main Diagonal = n" in green ink, circling the elements a, d, g, j. He then identifies the upper diagonal elements (b, e, h) and writes "Upper Diagonal = n-1" in red ink. He counts the lower diagonal elements (c, f, i) and writes "Lower Diagonal = n-1". He sums these values: n + (n-1) + (n-1). He simplifies the expression to 3n - 2. He writes "(3n-2) * 4B" on the board, explaining that if each element requires 4 bytes of memory, the total space is the number of non-zero elements multiplied by 4. He emphasizes that since the matrix is sparse, we do not store the zero elements, only the non-zero ones.
5:00 – 5:24 05:00-05:24
The instructor concludes the problem by summarizing the result. He points to the final formula 3n-2, which represents the total number of non-zero elements. He reiterates that this is the number of elements that need to be stored in memory. He confirms that the space required is (3n-2) * 4 bytes. He wraps up the explanation, having successfully derived the space complexity for this specific type of sparse matrix. He concludes the lesson by ensuring the student understands that the space is proportional to the number of non-zero elements.
The video demonstrates space optimization for sparse matrices. It starts with the definition of a tridiagonal matrix where non-zero elements are restricted to the main diagonal and adjacent diagonals. By using a 4x4 example, the instructor visualizes the pattern. He then counts the elements in each diagonal band (n, n-1, n-1) to derive the total count of 3n-2. Finally, he calculates the memory space by multiplying this count by the size of an element (4 bytes), showing how to efficiently store such matrices.

