Scribd
Upload
3 views16 pages

Csl0357-Dsa (U1) - S2

Uploaded by

sumitdhakar956
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views16 pages

Csl0357-Dsa (U1) - S2

Uploaded by

sumitdhakar956
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Program: B.Tech.

, Semester-III, Year-II

CSL0302: Data Structures

Introduction of Data Structures


(Session-1)

Mr. Suraj Sharma


Assistant Professor, Department of CSA
Outlines
• Prerequisites
• Data structures
• Data structure operations
• Classification of data structures
• Linear array
• Representation of linear arrays in memory
• Traversing a linear arrays
• Learning Outcomes
• References
Prerequisites

• Basic understanding of computer fundamentals and


programming in ‘C’
Data Structures

Data Structures describes the logical or mathematical model of


a particular organization of data in computer memory.
Data Structure Operations

• Traversing: Accessing each record exactly once so that


certain items in the record may be processed.

• Searching: Finding the location of the record with a given


key value, or finding the locations of all records which
satisfy one or more conditions.

• Inserting: Adding a new record to the structure.

• Deleting: Removing a record from the structure.


Data Structure Operations

The following two operations, which are used in special


situations, will also be considered:

• Sorting: Arranging the records in some logical order.

• Merging: Combining the records of two different sorted files


into a single sorted file.
Classification of Data Structures
Classification of Data Structures

Linear Data Structures

A data structure is said to be linear if its elements form a


sequence.

Non-Linear Data Structures

A data structure is said to be non-linear if its elements does not


forms a sequence.
Linear Array

A linear array is defined as a list of finite number n of


homogeneous data elements.

a. The elements of the array are referenced respectively by an


index set consisting of n consecutive numbers.

b. The elements of the array are stored respectively in


successive memory locations.
Representation of linear arrays in memory

Length=UB-LB+1
Address of A [ I ] = B + W * ( I – LB )
Traversing linear arrays
Algorithm (Traversing a linear array)

1. [Initialize a counter] set K:=LB


2. Repeat step 3 and 4 while K<=UB
3. [Visit elements] apply process to LA[K]
4. [Increase counter] set K:=K+1.
5. Exit
Traversing linear arrays
Learning Outcomes

• Data structures?

• Data structure operations?

• Classification of data structures?

• Linear array?

• Representation of linear arrays in memory?

• Traversing a linear arrays?


References
Text Books

• Seymour Lipschutz; Data Structures; Schaum’s Outlines,

Tata McGraw Hill Publishing.

• R. Kruse et al.; Data Structures and Program Design in C;

Pearson Education Publication.


References
References Books
• E. Horowitz, S. Sahani; Fundamentals of Data Structures;
Galgotia Publication.
• A M. Tenenbaum; Data Structures using C & C++, PHI
Publication.
• ISRD Group; Data Structures using C; Tata McGraw-Hill
Publishing.
• T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein;
Introduction to Algorithms, PHI Publication.
• J. P. Trembley, P. G. Sorenson; Data Structures; Tata
McGraw Hill Publishing.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy