Summary KTU CSE Data Structures Notes – Arrays, Polynomial Representation & Sparse Matrices | Module 1 – Part 1 to 3

INTRODUCTION TO DATA
STRUCTURES AND
ARRAY



CS KTU Lectures

, DATA STRUCTURES
 Data may be organized in many different ways


 The logical or mathematical model of a particular
organization of data is called data structure

 A data structure is a particular way of organizing data in
a computer so that it can be used efficiently

 It is also called building block of a program.




CS KTU Lectures

,TYPE DATA STRUCTURES




CS KTU Lectures

, TYPE DATA STRUCTURES
 Primitive data structure(Simple Data structure)
 Simple data structure can be constructed with the help of
primitive data types
 It can hold a single value
 Non-primitive data structure(Compound data structure)
 It can be constructed with the help of any one of the
primitive data structure and it is having a specific
functionality. It is divided into two.
 Linear data structure
 Elements are arranged in a sequential manner
 Non-linear data structure
 Elements are arranged in a random manner
CS KTU Lectures