Chapter 1- Introduction to Data Structures

Introduction to Data
Structures 1

1.1 Introduction
1.2 What is information?
1.3 What is data structure?
1.4 Why data structures?
1.5 Types of memory allocation
1.6 Summary
1.7 Key Terms
1.8 Review Questions

1
 Chapter 1- Introduction to Data Structures

Objectives
To understand the concept of data structures
To learn the types of data structures with examples
To understand the use of data strcuctures

1.1 Introduction

It is important for every Computer Science student to understand the concept of Information and
how it is organized or how it can be utilized.

1.2 What is Information?

If we arrange some data in an appropriate sequence, then it forms a structure and gives us a
meaning. This meaning is called Information. The basic unit of Information is a bit, Binary Digit.
So, we found two things in Information: One is Data and the other is Structure.

1.3 What is Data Structure?

1. A data structure is a systematic way of organizing and accessing data.

2. A data structure tries to structure data!
 Usually more than one piece of data
 Should define legal operations on the data
 The data might be grouped together (e.g. in an linked list)
3. When we define a data structure we are in fact creating a new data type of our own.
 i.e. using predefined types or previously user defined types.
 Such new types are then used to reference variables type within a program

1.4 Why Data Structures?

1. Data structures study how data are stored in a computer so that operations can be
implemented efficiently
2. Data structures are especially important when you have a large amount of information
3. Conceptual and concrete ways to organize data for efficient storage and manipulation.

1.5 Types of Memory Allocation

2
 Chapter 1- Introduction to Data Structures

There are two types of allocation:

(i) Static memory allocation
(ii) Dynamic memory allocation

1.5.1 Static Memory Allocation

Static memory allocation is nothing but the memory is allocated during compilation. Eg. Array

1.5.2 Dynamic Memory Allocation

Dynamic memory allocation is nothing but the memory is allocated during execution. Eg.Linked
list.

1.6 Summary
A data structure is a systematic way of organizing and accessing data. Data structures
are especially important when you have a large amount of information. It gives different ways to
efficiently organize data for storage and manipulation. Memory is allocated either during
compilation or execution.

1.7 Key Terms

Information, Data structures, Array, Linked List, Dynamic Memory Allocation.

1.8 Review Questions ?????????????

1. What is meant by information?

2. What is a data structure?
3. What are the types of memory allocation? Explain with an example.