Chapter 10 PDF

1
Data Structures and Algorithms
BITS-Pilani K. K. Birla Goa Campus
1
Material for the presentation taken from Cormen, Leiserson, Rivest and
Stein, Introduction to Algorithms, Third Edition; 1
BITS-Pilani K. K. Birla Goa Campus Data Structures and Algorithms
Part III : Data Structures
I Many algorithms manipulate sets of items.
2

I These sets must be able to grow or shrink (i.e. must be
dynamic).
2

dynamic).
I Operations on dynamic sets
2

dynamic).
I Queries
2

dynamic).
I Queries
I Modifying operations
2
Ch. 10 : Elementary Data Structures
I Stack : last-in, first-out (LIFO)
3
Ch. 10 : Elementary Data Structures
I Stack : last-in, first-out (LIFO)

I There are many ways of implementing stacks.
3
Elementary data structure: Stack
I PUSH and POP
4
I PUSH and POP
4
I PUSH and POP
I PUSH(S,17) , PUSH(S,3)
4
I PUSH and POP
4
I PUSH and POP
I POP(S)
4
Stack operation pseudocode
5
Stack operation pseudocode
5
Stack procedure pseudocode
5
Stack operations
I Stack operations can lead to overflows and underflows.
6
Stack operations
I Stack operations can lead to overflows and underflows.

I Each stack operation takes O(1) time.
6
Balanced Parentheses
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
7
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
Output : Balanced
7
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
Output : Balanced
I Input : { ( ) [ } ]
7
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
Output : Balanced
I Input : { ( ) [ } ]
Output : Not Balanced
7
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
Output : Balanced
I Input : { ( ) [ } ]
I Can we use a Stack to solve this problem?
7
I Input : [ ( ) ] { } { [ ( ) ( ) ] ( ) }
Output : Balanced
I Input : { ( ) [ } ]
I Can we use a Stack to solve this problem?
I Use vector in C++ STL for Stacks.
7
Elementary data structure: Queue
I Queue : first-in, first-out (FIFO)
8

I There are many ways of implementing queues.
8

I There are many ways of implementing queues.
I ENQUEUE and DEQUEUE
8
Queue array implementation
9
9
9
Enqueue and Dequeue
10
Enqueue and Dequeue
10
Queue operations
I Each operation can be performed in O(1) time.
11
Queue operations

I Queue can be used to perform Breadth-first-search in Graphs.
11
Queue operations

I Queue can be used to perform Breadth-first-search in Graphs.
I Use vector in C++ STL for Queues.
11
Linked lists
I A data structure in which objects are ordered linearly using a

pointer.
12
Linked lists

pointer.
12
Linked lists

pointer.
12
Linked lists

pointer.
I Linked list can support all the operations on a dynamic set.
12
C++ program
I C++ program for singly linked list
13
C++ program
I C++ program for singly linked list

I insertNode function (L. 109)
13
C++ program : Doubly linked list node
14
Doubly linked node : More satellite data
15
Doubly Linked List
16
Doubly Linked List
16
Doubly Linked List
16
Doubly Linked List
I NIL: prev of head element, and next of tail element
16
Doubly Linked List

I Singly linked list does not have a prev pointer
16
Doubly Linked List

I Circular linked list
16
Doubly Linked List

I Circular linked list
I We will assume that we are working with an unsorted, doubly
linked list.
16
List search
17
List search
I LIST-SEARCH takes Θ(n) time in the worst case.
17
List insert
18
List insert
18
List insert
18
List insert
18
List insert
LIST-INSERT takes O(1) time

18
List delete
19
List delete
19
List delete
19
List delete
19
List delete
LIST-DELETE takes O(1) time.
19
List delete
LIST-DELETE takes O(1) time. Deleting an element with a given

key would take Θ(n) time.
19
I
20

Chapter 10 PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 10 PDF

Uploaded by

Copyright:

Available Formats

1

Data Structures and Algorithms

BITS-Pilani K. K. Birla Goa Campus

I Many algorithms manipulate sets of items.

I Many algorithms manipulate sets of items.

I Many algorithms manipulate sets of items.

I Many algorithms manipulate sets of items.

I Many algorithms manipulate sets of items.

I Stack : last-in, first-out (LIFO)

I Stack : last-in, first-out (LIFO)

I PUSH and POP

I PUSH and POP

I PUSH and POP

I PUSH and POP

I PUSH and POP

I Stack operations can lead to overflows and underflows.

I Stack operations can lead to overflows and underflows.

I Queue : first-in, first-out (FIFO)

I Queue : first-in, first-out (FIFO)

I Queue : first-in, first-out (FIFO)

I Each operation can be performed in O(1) time.

I Each operation can be performed in O(1) time.

I Each operation can be performed in O(1) time.

I A data structure in which objects are ordered linearly using a

I A data structure in which objects are ordered linearly using a

I A data structure in which objects are ordered linearly using a

I A data structure in which objects are ordered linearly using a

I Linked list can support all the operations on a dynamic set.

I C++ program for singly linked list

I C++ program for singly linked list

I NIL: prev of head element, and next of tail element

I NIL: prev of head element, and next of tail element

I NIL: prev of head element, and next of tail element

I NIL: prev of head element, and next of tail element

I LIST-SEARCH takes Θ(n) time in the worst case.

LIST-INSERT takes O(1) time

LIST-DELETE takes O(1) time.

LIST-DELETE takes O(1) time. Deleting an element with a given

You might also like