Scribd
Upload
20 views

Intraduction To DS

The document discusses data structures, abstract data types, and linear lists. It defines data structures and abstract data types, explaining that ADTs provide an implementation-independent view of data through defining operations without specifying implementation details. The document also describes list ADTs, their node structure, and common list operations like get, insert, remove, replace, and checking size or emptiness.

Uploaded by

sahithideekonda196
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
20 views

Intraduction To DS

The document discusses data structures, abstract data types, and linear lists. It defines data structures and abstract data types, explaining that ADTs provide an implementation-independent view of data through defining operations without specifying implementation details. The document also describes list ADTs, their node structure, and common list operations like get, insert, remove, replace, and checking size or emptiness.

Uploaded by

sahithideekonda196
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/ 8

MLRIT

Topic : Introduction to Data Structures,


Abstract Data Types(ADT) and Linear list.

Assoc. Professor: N Ramesh


A Data Structure
 A data structure is a specialized format for organizing, processing, retrieving and
storing data.
 A data structure is a particular way of organizing data in a computer so that it can be
used effectively.
 The implementation of an abstract data type, often referred to as a data structure, will
require that we provide a physical view of the data using some collection of
programming constructs and primitive data types.
 the separation of these two perspectives will allow us to define the complex data
models for our problems without giving any indication as to the details of how the
model will actually be built.
 This provides an implementation-independent view of the data. Since there will
usually be many different ways to implement an abstract data type, this implementation
independence allows the programmer to switch the details of the implementation
without changing the way the user of the data interacts with it. The user can remain
focused on the problem-solving process.
Abstract Data type (ADT)
 The Data Type is basically a type of data that can be used in different computer
program.
 It signifies the type like integer, float etc, the space like integer will take 4-bytes,
character will take 1-byte of space etc.
 The abstract datatype is special kind of datatype, whose behavior is defined by a set of
values and set of operations.
 The keyword “Abstract” is used as we can use these datatypes, we can perform
different operations. But how those operations are working that is totally hidden from
the user.
 The ADT is made of with primitive datatypes, but operation logics are hidden.
 Abstract Data type (ADT) is a type (or class) for objects whose behaviour is defined
by a set of value and a set of operations.
 The definition of ADT only mentions what operations are to be performed but not how
these operations will be implemented.
 It does not specify how data will be organized in memory and what algorithms will be
used for implementing the operations.
 It is called “abstract” because it gives an implementation-independent view.
 The process of providing only the essentials and hiding the details is known as
abstraction.
 The user of data type does not need to know how that data type is
implemented, for example, we have been using Primitive values like int,
float, char data types only with the knowledge that these data type can
operate and be performed on without any idea of how they are implemented.

 So a user only needs to know what a data type can do, but not how it will be
implemented. Think of ADT as a black box which hides the inner structure
and design of the data type.
List ADT
List ADT The data is generally stored in key sequence in a list which has a
head structure consisting of count, pointers and address of compare
function needed to compare the data in the list.

The data node contains the pointer to a data structure and a self-referential
pointer which points to the next node in the list.
The List ADT Functions is given below:
A list contains elements of the same type arranged in sequential order and following
operations can be performed on the list.

 get() – Return an element from the list at any given position.


 insert() – Insert an element at any position of the list.
 remove() – Remove the first occurrence of any element from a non-empty list.
 removeAt() – Remove the element at a specified location from a non-empty list.
 replace() – Replace an element at any position by another element.
 size() – Return the number of elements in the list.
 isEmpty() – Return true if the list is empty, otherwise return false.
 isFull() – Return true if the list is full, otherwise return false.
Thank you

You might also like