Scribd
Upload
32 views

Basic Concepts

Data Structure Notes PPT

Uploaded by

jasolanke1992
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
32 views

Basic Concepts

Data Structure Notes PPT

Uploaded by

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

Chapter 1

Basic Concepts

Objectives

• Use pseudocode in the development of algorithms


• Understand the need for Abstract Data Type (ADT)
• Understand the implementation of ADTs
• Use void pointers and pointer to functions
• Understand the role of Big-O notation

Data Structures: A Pseudocode Approach with C, Second Edition 1


Data Structures: A Pseudocode Approach with C, Second Edition 2
Data Structure
Aggregation of atomic and composite data into a set with defined
relationships. Structure refers to a set of rules that hold the data
together.
• A combination of elements in which each is either a data type or another
data structure.
• A set of associations of relationship involving combined elements.
Example:

Data Structures: A Pseudocode Approach with C, Second Edition 3


Data Structures: A Pseudocode Approach with C, Second Edition 4
Abstract Data Type
 ADT users are NOT concerned with how the task is done but rather
what it can do.

 An abstract data type is a data declaration packaged together


with the operations that are meaningful for the data type.

 We encapsulate the data and the operations on the data, and


then hide them from the user.

 All references to and manipulation of the data in a data structure


are handled through defined interfaces to the structure.

Data Structures: A Pseudocode Approach with C, Second Edition 5


Model for an Abstract Data Type

In this section we provide a conceptual


model for an Abstract Data Type (ADT).

• ADT Operation – passage like


• ADT Data Structure – controlled
entirely

Data Structures: A Pseudocode Approach with C, Second Edition 6


Data Structures: A Pseudocode Approach with C, Second Edition 7
ADT Implementations

There are two basic structures we can use to


implement an ADT list: arrays and linked lists.
In this section we discuss the basic
linked-list implementation.
• Array Implementation
• Linked List Implemenation

Data Structures: A Pseudocode Approach with C, Second Edition 8


Data Structures: A Pseudocode Approach with C, Second Edition 9
Data Structures: A Pseudocode Approach with C, Second Edition 10
Data Structures: A Pseudocode Approach with C, Second Edition 11
Generic Code for ADT

In this section we discuss and provide examples


of two C tools that are required to implement
an ADT.
• Pointer to Void
• Pointer to Function

Data Structures: A Pseudocode Approach with C, Second Edition 12


Algorithm Efficiency
To design and implement algorithms, programmers
must have a basic understanding of what constitutes
good, efficient algorithms.

Linear Loops
-Efficiency is a function of the number of intstructions.
-
Loop update either adds or subtracts.

•Big-O Notation
-Not concerned with exact measurement of efficiency but with the magnitude.
- A dominant factor determines the magnitute.

Data Structures: A Pseudocode Approach with C, Second Edition 13

You might also like