Two Dimensional Array

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/array/1d-2d-addressing/asset-two-dimensional-array after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a foundational lecture on two-dimensional arrays in computer science. The instructor defines a 2D array as an "array of arrays" organized into rows and columns, resembling a matrix. He explains its utility in storing bulk data, similar to relational database structures. The lecture progresses to practical implementation, demonstrating how to declare and initialize 2D arrays in C using specific syntax examples. Visual aids, including grid diagrams and code snippets, are used to clarify how data is mapped to memory locations and how indexing works for accessing specific elements within the structure.

Chapters

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

    The session opens with a slide titled "Two-Dimensional array," defining the concept as an "array of arrays" organized as matrices. He highlights that 2D arrays implement a "relational database look a like data structure," providing ease in holding bulk data. Visually, a grid shows Row 0, Row 1, and Row 2 intersecting with Column 0, Column 1, and Column 2. Cells are labeled with indices like x[0][0] and x[1][1] to demonstrate access patterns. The instructor draws a 1D array and then a 2D grid to illustrate the transition from linear to two-dimensional storage. He writes examples like A[10][12] to denote dimensions, emphasizing the first bracket represents rows. The instructor uses hand-drawn diagrams to visually represent the 1D array as a single line of boxes and the 2D array as a grid of intersecting lines. This section establishes the theoretical framework before moving to code.

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

    The focus shifts to implementation in C. The instructor displays code: int disp[2][4] = { {10, 11, 12, 13}, {14, 15, 16, 17} };. He explains this nested initialization corresponds to rows. He presents an alternative using "OR," showing int disp[2][4] = { 10, 11, 12, 13, 14, 15, 16, 17 };, which flattens the list. To reinforce this, he draws a 2x4 grid and maps numbers 10 through 17 into cells, showing how the compiler fills memory. He underlines the initialization values in red to emphasize the data being stored. Finally, a slide titled "Implementation of 2D array" appears, introducing "row-major order and column-major order" as methods for storing multidimensional arrays in linear storage like random access memory, setting the stage for memory layout discussions. The slide text explicitly mentions "random access memory".

The video bridges theory and coding. By defining a 2D array as a matrix of rows and columns, the instructor sets a clear mental model. The transition to C code examples, specifically disp[2][4], grounds the theory in syntax. The visual mapping of values 10-17 into the grid helps students understand how linear data is organized into a 2D structure. The mention of row-major and column-major order serves as a crucial preview for understanding memory allocation, ensuring students grasp how the computer stores the data. This progression ensures a comprehensive understanding of both syntax and underlying memory mechanics, preparing students for more complex data structure topics.

Loading lesson…