What is data structure

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/introduction-to-ds/ds-basics-types/asset-what-is-data-structure 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 lecture introduces data structures as a particular way of organizing data in computer memory to ensure efficient use of time and space. The instructor defines a data structure as the logical relationship existing between individual elements of data, considering both the stored elements and their interconnections. A hand-drawn diagram of a memory block with indexed rows (0, 1, 2, etc.) is used to visually represent this concept. The lecture then outlines four key aspects that a data structure specifies: organization of data, accessing methods, degree of association, and processing methods. Finally, the instructor presents visual diagrams for fundamental data structures including arrays (contiguous indexing), linked lists (pointer-based nodes with Head, Data, and Next labels), stacks (push/pop at the top), queues (front/rear pointers), and trees (root node with edges).

Chapters

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

    The instructor presents a slide titled 'What is data structure' defining it as a particular way of organizing data in computer memory (cache, main, etc.) for efficient time and space usage. It is further defined as a logical relationship between individual elements, considering stored elements and their relationships. A hand-drawn diagram of a memory block with indexed rows (0, 1, 2) is drawn progressively, with red underlines added to key phrases like 'particular way of organizing data' and 'in terms of time and space'. The instructor shades the top block to illustrate memory organization.

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

    The lecture transitions to the four things a data structure specifies: 'Organization of data', 'Accessing methods', 'Degree of association', and 'Processing methods'. The instructor then displays comparative diagrams for arrays (memory locations with indices 0-6 showing letters U B F D A E C), linked lists (nodes A to D with 'Head', 'Data', 'Next' labels ending in NULL), stacks (push/pop at top), queues (front/rear pointers over an array), and binary trees (root node with connected edges). Red annotations highlight key elements like 'Head', 'Front', and 'Rear'.

The lecture builds from abstract definition to concrete examples. It starts with the core concept that data structures organize memory efficiently and define logical relationships between elements. The four specification points (organization, access, association, processing) provide a framework for understanding any data structure. The final section grounds this in five fundamental structures: arrays use contiguous memory with direct indexing; linked lists use pointers to connect non-contiguous nodes; stacks follow LIFO access at one end; queues follow FIFO with front/rear pointers; and trees use hierarchical node connections via edges. The progression moves from 'what' (definition) to 'how it is specified' (four aspects) to 'examples' (five structures), creating a logical learning path for students.

Loading lesson…