Linked List
(Two-way Linked List)
1
Two-way Linked List
A variant of a linked list in which each item has a link to the previous
item as well as
the next item.
Each node is divided into three parts.
1. Information field contains the information of eleme

Graph and Its Applications
1
Graph and Their Applications
Graph
Nonlinear data Structures.
A graph G consists of two properties:
(a) A set V of elements called vertices or nodes.
(b) A set E of connectors called edges such that each edge e is identified

Queue
1
Queue (Linear Queue)
It is a linear data structure consisting of list of items.
In queue, data elements are added at one end, called the rear and removed from another
end, called the front of the list.
Two basic operations are associated with q

Traversal of Graph
1
Traversing a Graph
(1) Breadth-first Search (BFS)
(2) Depth-first Search (DFS)
Breadth-first Search (BFS)
The breadth-first search (BFS) is a graph search algorithm.
BFS starts at a source node s and explores all the neighboring nod

Asymptotic Notation
The O Notation [edit]
Definition [edit]
The O(pronounced as: ig-oh) is the formal method of expressing the upper bound of an algorithm's
running time. It's a measure of the longest amount of time it could possibly take for the algorith

Weighted Graph and Its Related
Problems
1
Weight Matrix
Suppose G is a weighted and simple directed graph with m nodes. The weight
matrix W =(wij) of the graph G is the m x m matrix defined as follows:
wij =
w(e)
if there is a weighted edge from vi to vj

Linked Lists
list elements are stored, in memory,
in an arbitrary order
explicit information (called a link)
is used to go from one element to
the next
Memory Layout
Layout of L = (a,b,c,d,e) using an array representation.
a b
c
d
e
A linked representat

BinaryTree
1
Tree
Anonlineardatastructure
ContainadistinguishednodeR,calledtherootoftreeandasetofsubtrees.
Twonodesn1andn2arecalledsiblingsiftheyhavethesameparentnode.
Root
Subtrees
Figure: Tree
Binary Tree
A binary tree T is defined as a finite set of e

11/23/15
Sorting
(Bubble Sort, Insertion Sort, Selection Sort)
1
Sorting
Sorting refers to the operation of arranging data in some given order such as increasing
or decreasing with numerical data or alphabetically with character data.
11/23/15
Comparison

Stack
(Stack, Arithmetic Expression)
07/03/12
1
Stack
It is a linear data structure consisting of list of items.
In stack, data elements are added or removed only at one end, called the top of
the stack.
Two basic operations are associated with stack:

Introduction to Data Structures
1
Course Name
:
Course Teacher :
Data Structure (CSI 221)
Asma-ull-Hosna
Lecturer, Dept. of Computer Science
Stamford University.
Class Schedule :
Saturday
Tuesday
: 11:45 AM - 01:00PM
: 10.30AM - 11:45 AM
Marks Distributio

Arrays
1
LINEAR ARRAYS
A linear array is a list of a finite number n of
homogeneous data elements (i.e., data elements
of the same type) such that:
The
elements of the array are referenced respectively
by an index set consisting of n consecutive numbers.

Linked List
(One-way Linked List-Insertion and Deletion)
1
Insertion into a Linked List
1. Insertion at the beginning of the list
2. Insertion before a given node
3. Insertion of a node with a given location
4. Insertion into a sorted list.
Insertion at t

Recursion
1
Recursion
A procedure P is called a recursive procedure if it contains a call statement to itself
directly or indirectly.
Two well-defined properties of a recursive procedure are:
1. There must be certain base criteria for which the procedur

Searching
1
Searching
Searching refers to the operation of finding an item from a list of items
based on some key value.
Two Searching Methods
(1) Linear Search
(2) Binary Search
2
Linear Search
A linear search is a technique for finding a particular valu

Linked List
(One-way Linked List)
1
Linked List
A linear collection of data elements (linear data structure).
Each element is represented by a node.
Each node is divided into two parts.
1. Information part contains the information of element.
2. Link p

Arithmetic Expression Conversion Using stack
11/23/15
Shaily Kabir, Dept. of CSE, DU
1
Conversion of Infix Expression into Postfix Expression
Algorithm: Infix-to-Postfix (Q, P)
Here Q is an arithmetic expression in infix notation and this algorithm genera

Mergesort
1
Merge Sort
Merge sort is a comparison sorting technique.
This technique follows the divide-and-conquer approach.
It maintains the following 3 steps:
1. Divide:
Divide N-element sequence to be sorted into two subsequences of
about N/2 elemen