Discover the depth  of  C

  C C++  Linux ProgrammingNEW   Operating Systems  Data StructuresNEW  Compilers  Contact Us

Navigation

Join C4SwimmersGroup

 sitepromotion.gif (577 bytes) New Member

Data Structures

  Introduction

Stacks

  About Stacks

  Types of Notations

  Infix to Postfix

  Infix to Prefix

  Evaluating Postfix

Queues

  About Queues
  Circular Queue
  Priority Queue
Linked Lists 
 About Linked Lists
 Singly Lists
 Doubly Lists
 Circular Lists
 Circular Doubly Lists
Sorting
 Bubble Sort
 Insertion Sort
 Selection Sort
 Shell Sort
 Merge Sort
 Quick Sort
Searching
 About Searching
 Linear Search
 Binary Search
Online Certifications
premiumservices.gif (1070 bytes) Brainbench
premiumservices.gif (1070 bytes) Benchmarks Global
Help and Support
customer_care_small.gif (1018 bytes) Suggestions
post-question_icon.gif (1062 bytes) Contribute
premiumservices.gif (1070 bytes) Feedback
premiumservices.gif (1070 bytes) Advertise with us
 

 memberhome.gif (1052 bytes) -Home Page-

 
 
.  

C For Swimmers : Mastering C step-by-step

Google


WWW c4swimmers.esmartguy.com

Introduction to Data Structures

 

Definition : 

The logical inter-relation between elementary data items is called as data structure. The basic data items include integers, bits, characters. 

Basically it deals with manipulation and organization of data, solving problems with computer involves data manipulation. But the data available will usually be in amorphous form. When different types of such data are related to each other, then we call it to be a data structure.
Ex : Queues, Trees, etc.

D = { d , F , A }

Where,
D : Data structure
d : Domain variable
F : A set of functions or procedures operating on domain variables.
A : A set of axioms or rules which governing the operations of these functions on the domain variable.

 

Advantages

The major advantages of data structures are :
• It gives different level of organizing data.
• It tells how data can be stored and accessed in its elementary level

 

Operation on Data Structures

The operations that can be performed on data structures are :
Creation : This operation creates a data structure. The declaration statement causes space to be created for data upon entering at execution time.

Destroy : This operation destroys the data structure and aids in the efficient use of memory.

Selection : This operation is used to access data within a data structure. The form of selection depends on the type of data structure being accessed.

Update : This operation changes or modifies the data in the data structure and it is an important property in selection operation.

 

Types of Data Structures

Linear Data Structure : Stacks, Queues, Linked Lists, etc.

Non-linear Data Structure : Trees, Graphs, etc.

 


Back to Basics

Array : Array is an ordered set which consists of a fixed number of objects. No deletion or insertion operations are performed on arrays.

List : List on the other hand is an ordered set containing of a variable number of elements to which insertions and deletions can be made. The list is divided into two types :

  • Stacks and 
  • Queues.

File : File is typically a large list that is stored in the external memory of a computer. Ex: Magnetic disk.

You are Visitor No.

Sign my Guestbook View my Guestbook

Subscribe to C4Swimmers Group
Designed and Maintained by  Nanda Kishor

Thanks for using C For Swimmers.
Regarding this material, you can send Bug Reports, Suggestions, Comments, etc. to

nandakishorkn@rediffmail.com

Note: All logos or trademarks are related to their respective owners.

Although every precaution has been taken, the designer(s) owe no responsibility for malicious errors.

No liability assumed for damages resulting from the use of the available information.