Primitive Vs Non-Primitive Data Structure

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/introduction-to-ds/ds-basics-types/asset-primitive-vs-non-primitive-data-structure after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | 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, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture provides a foundational overview of data structures, beginning with a detailed definition of primitive data structures and their characteristics. The instructor explains that these structures are predefined by the system with fixed storage methods and operations, directly handled by machine instructions. Examples such as char, int, float, and double are provided. The lesson then transitions to a hierarchical classification of data structures, distinguishing between primitive and non-primitive types. Non-primitive structures are further categorized into derived data structures, which are system-provided and built from primitives like arrays, and user-defined data structures, which are created by the programmer using language constructs like structures or classes. The lecture concludes by listing examples of non-primitive structures including arrays, lists, stacks, queues, linked lists, graphs, and trees.

Chapters

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

    The video begins with a slide titled 'Primitive data structure'. The on-screen text defines these structures as having a 'predefined way of storing data by the system' where the 'set of operations that can be performed on these data are also predefined'. The instructor emphasizes that they are 'directly operated upon by the machine instruction'. The slide lists specific examples of primitive data structures: 'char, int, float, double'. It further notes that the 'predefined operations are addition, subtraction, etc.', establishing the basic building blocks of data handling in programming.

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

    The presentation shifts to a hierarchy diagram labeled 'Data Structure', branching into 'Primitive' and 'Non-Primitive'. Under Primitive, the diagram lists 'Integer, float, Character, Pointer'. Under Non-Primitive, it shows 'Array, List, Files'. The 'List' category is further divided into 'Linear List' (containing 'Stack, Queues, Link List') and 'Non-linear list' (containing 'Graphs, Trees'). Subsequent slides introduce 'Non-Primitive data structure', stating that 'primitive data structures are not sufficient for our job'. It defines 'Derived data structures' as being 'made using primitives like an array' with predefined operations. Finally, it describes 'user defined data types' which the 'user defines using the primitive and derived data types using language constructs like structure or class', citing 'Linked Lists, Trees, etc.' as examples.

The lecture systematically builds the concept of data structures by first establishing the fundamental primitive types that are directly supported by the machine. It then expands this view to include non-primitive structures, which are necessary when primitives are insufficient. By categorizing non-primitive structures into derived (system-provided) and user-defined (programmer-created) types, the lesson clarifies the hierarchy and origin of different data organization methods, providing a clear roadmap from basic integer types to complex structures like trees and graphs.

Loading lesson…