Scribd
Upload
21 views35 pages

Data Structure and Algorithms Lecture 3

Uploaded by

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

Data Structure and Algorithms Lecture 3

Uploaded by

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

Course Instructor

Engr. Adiba Jafar


Course Information
 Textbooks
 Data Structures
by D Samanta Prentice Hall 2003
 Data Structures and Algorithms
by A. V. Aho, J. E. Hopcroft, J. D. Ullman
 Theory and Problems of Data Structure
by Seymour Lipschutz,Schaum’s Outline Series McGraw
HillBook Co,1986
Course Outline
Course Outline
 Introduction to Data Structure
 Algorithms
 Recursion
 Stacks
 Queues
 Lists and linked lists
 Trees
 Sorting
 Searching
 Graphs
 Hashing
Learning Outcomes
 The main things we will learn in this course:
• To think algorithmically and get the spirit of how
algorithms are designed .
• To learn a number of algorithm design techniques
(such as divide-and-conquer)
• To analyze (in a precise and formal way) the efficiency
and the correctness of algorithms.
Lecture 1
What is Data and information ?
 Data is a value or set of values that has no implied
meaning until it is associated with a particicular
attribute .Example 81.6,85.1---------- are data

• Meaning full or processed data is called information.

• An ENTITY is something that has certain attributes or


properties which may be assigned values. The values may
be either numeric or nonnumeric.
• EXAMPLE student,employee
Entity Set
 Collection of entities that contains the same attributes.
 Examples
Entity Name ID # Weight
emp1 John 1111 160
emp2 Smith 2222 115
emp3 Brown 3333 120

DATA ITEM: It refers to a single unit of values.


* Elementary data item
* Group data item
Primary key:
It uniquely determine the records in file.
What are Algorithm about
Solving problems in everyday life
• Travel from Bolzano to Munich
• Cook Spaghetti
For all these problems, there are
• Instructions
• Recipes
• Procedures
Which describe a complex operation in terms of
• elementary operations
• control structures and conditions
Algorithms
Outline, the essence of a computational procedure,
step-by-step instructions
An algorithm is a sequence of unambiguous instructions
for solving a problem, i.e.,
• for obtaining a required output in a finite amount of
time.
PROGRAM
Implementation of an algorithm in some programming
language .
Preconditions, Postconditions
Specify preconditions and postconditions of algorithms:
Precondition:
• What does the algorithm get as input?
Postcondition:
• What does the algorithm produce as output?
• … how does this relate to the input?
Properties of algorithms:
• Correctness, Termination, Run time
What is Data Structure?
 Data structure is a representation of data and the
operations allowed on that data.

• A data structure is a way to store and organize data in


order to facilitate the access and modifications.

• Data Structure are the method of representing of logical


relationships between individual data elements related to
the solution of a given problem.
Basic Data Structure
Basic Data Structures

Linear Data Structures Non-Linear Data Structures

Arrays Linked Lists Stacks Queues Trees Graphs Hash Tables


array

Linked list

queue
tree stack
Selection of Data Structure
 The choice of particular data model depends on
two consideration:
 It must be rich enough in structure to represent the
relationship between data elements
 The structure should be simple enough that one can
effectively process the data when necessary
Types of Data Structure
 Linear: In Linear data structure, values are arrange in linear
fashion.
 Array: Fixed-size
 Linked-list: Variable-size
 Stack: Add to top and remove from top
 Queue: Add to back and remove from front
 Priority queue: Add anywhere, remove the highest
priority
Types of Data Structure
 Non-Linear: The data values in this structure are not
arranged in order.
 Hash tables: Unordered lists which use a ‘hash function’ to insert
and search
 Tree: Data is organized in branches.
 Graph: A more general branching structure, with less strict
connection conditions than for a tree
Type of Data Structures
 Homogenous: In this type of data structures, values of the
same types of data are stored.
 Array

 Non-Homogenous: In this type of data structures, data


values of different types are grouped and stored.
 Structures
 Classes
Abstract Data Type and Data Structure
 Definition:-
 Abstract Data Types (ADTs) stores data and allow various
operations on the data to access and change it.
 A mathematical model, together with various operations defined on
the model
 An ADT is a collection of data and associated operations for
manipulating that data

 Data Structures
 Physical implementation of an ADT
 data structures used in implementations are provided in a language
(primitive or built-in) or are built from the language constructs (user-
defined)
 Each operation associated with the ADT is implemented by one
or more subroutines in the implementation
Abstract Data Type
 ADTs support abstraction, encapsulation, and information
hiding.

 Abstraction is the structuring of a problem into well-


defined entities by defining their data and operations.

 The principle of hiding the used data structure and to only


provide a well-defined interface is known as encapsulation.
The Core Operations of ADT
 Every Collection ADT should provide a way to:
 add an item
 remove an item
 find, retrieve, or access an item

 Many, many more possibilities


 is the collection empty
 make the collection empty
 give me a sub set of the collection
• No single data structure works well for all purposes, and so
it is important to know the strengths and limitations of
several of them
Stacks
 Collection with access only to the last element inserted
 Last in first out
Data4 Top
 insert/push
 remove/pop Data3

 top Data2
 make empty
Data1
Queues
 Collection with access only to the item that has been
present the longest
 Last in last out or first in first out
 enqueue, dequeue, front
 priority queues and dequeue
Front Back

Data1 Data2 Data3 Data4


List
 A Flexible structure, because can grow and
shrink on demand.
Elements can be:
 Inserted
 Accessed
 Deleted
At any position
last
first
Tree
 A Tree is a collection of elements called nodes.
 One of the node is distinguished as a root, along with a
relation (“parenthood”) that places a hierarchical structure
on the nodes.
Root
Example of tree in terms of
level number
Tree of arithmetic expression
(2x+y)(a-7b) 3
GRAPH
Pictorial representation of any information is called
graph.

A B

C
Data Structure Operations
1.TRAVERSING
Accessing each record exactly once .
It means find something from data.
2. INSERTING
Adding new record
3. DELETING
Removing record.
4. SEARCHING
Finding data
Data Structure Operations
5. Sorting
Arranging.
6.Merging
Combining Data.
COMPLEXITY
 The complexity of an algorithm is the function which
gives the running time or space in terms of input size.
Home Tasks
Submit given problems(hand written) from schaum’s
outline series

1.11.3
1.51.12
Read linked list example from book and submit it(hand
written)

You might also like