66

COMPUTER SCIEruCE AND ENGINEERING 2013.14

JAWAHARLAL NEHRU TECHNOLOGICAL UNTVERSITY HYDERABAD

ll Year B.Tech. CSE-! Sem

LT/P.fu.C
4 -t-t- 4

(A30s02) DATA STRUCTURES

Obiectives:

'

To understand the basic concepts such as Abstract Data Types,

unear

'
o

ld
.in

and Non Linear Data structures.

To understand the notations used to anaryze the perbrrnance
of
algorithms.

To understand the behavior of data structures

srrch as stacks, queues,

trees' hash tables, search trees, Graphs and their representations.

or

.
To choose the appropriate data structure tor a sp!91fild
appticafiOn.
o To understand and anaryze various searching ano s6riing algorithmg.
To write programs in c ro sorve probrems using data structures
'
such
as arrays, linked lists, stacks, queues, trees, graphs, hash tables,
. searcfilrees.
: , r-.,, -.. j;.;
UNIT-I
.,,.-il
.r

-,r.i

nt
uW

Basic concepts- Argorithm Specification-rntroduction, Recursive

argofithms,
Data Abstraction performance anarysis- time comprexity
an-d space

complexity, Asymptotic Notation-Big O, Omega and Theta notations,

lntroduction to Linear and Non Lineariata structures.

Singly Linked Lists-operations-rnsertion, Deretion, concatenating

singry

linkedlists, circularly linked lists-operations for circularly

linked listsJDoubly
Linked Lists- Operations- lnsertion, Deletion.

Representation of singre, two dimensionar arrays, sparse

matrices-array and
linked representations.
UNIT- !I

stack ADT, definition, operations, array and rinked imprementations

in c,

Aj

applications-infix to postfix conversion, postfix expiession

evatuatior,
recursion implementation, eueue ADT, definition and
operations

anO

,array
linked lmprementations in c, circurar queues-rnsertion
and oetetion
operations, Deque (Doubte ended queue)ADT,
,nJiinf"O

"rr"y

implementations in C.

uNtT- ilt

Tl"= - Terminology, Representation of Trees, Binary tree ADT, properties

of Binary Trees, Bin-ary Tree Representations_a
rray and iint

Tree traversats, Threaded binary trees, Max priority

"O
Heap-Definition, rnsertibn into a Max Heap,

Xl,f,r^"1t$I?1.f,-B_,nrry
uueueAu I-rmprementation-Max

COMPUTER SCIENCE AND ENGINEERING 2013.14

Deletion from a Max HeaP.

Graphs

lntroduction, Definition, Terminology, Graph ADT' Graph

Repiesentations- Adjacency matrix, Adjacency lists, Graph traversals- DFS

and BFS.

UN[T.IV
Searching- Linear search, Binary Search, Static Hashing-lntroduction, hash
tables, hash functions, Overflow Handling.

or
ld
.in

Sorting-lnsertion Sort, Selection Sort, Radix Sort, Quick sort, Heap Sort'
Comparison of Sorting methods.
UN]T. V

search Trees-Binary search Trees, Definition, operations- searching,

lnsertion and Deletion, AVL Trees-Definition and Examples, lnsertion into
an AVL Tree ,B-Trees, Definition, B-Tree of order m, operations-lnsertion
and searching, lntroduction to Red-Black and splay Trees(Elementary

treafnenlorty oefinitions and Examples), comparison of search Trees.

Pattern matching algorithm- The Knuth-Morris-Pratt algorithm, Tries
(exarples only).

TEXT BO(X8:
Fundamentals ol Data slructures in C, 2nd Edition, E.Horowitz,
S.Sahni and Susan Anderson-Freed, Universities Press'
Data structures A Programming Approach with C, D'S'Kushwaha and
A.K.M'sra, PHl.
REFERENCE BOOKS:

1.

2.

2.
3.

R.F.Gilberg And B.A.Forouzan, Cengage Leaming'

Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss'
Pearson.

Data Structures using C, A.M'Tanenbaum,Y'

Langsam'

M.J.Augenstein, Pearson.
Data Struclures and Program Design in C, 2nd edition, R.Kruse'
C.L.Tondo and B.Leung,Pearson.
Data structures and Algorithms made easy in JAVA, 2nd Edition'
Narsimha Karumanchi, CareerMonk Publications'
Data Structures using C, R.Thareja, Oxford University Press'
Data Structures, S.Lipscutz,schaum's Outlines, TMH'

Aj

4.

Data structures: A Pseudocode Approach with C, 2nd edition'

nt
u

1'

5.

6.
7.
8.
L
10.

Data structures using C, A.K.Sharma, 2nd edition, Pearson"

Data Structures using C &C++, R.Shukla, Wiley lndia'
Classic Data Structures, D.Samanta, 2nd edition, PHI'

COMPUTER SCIENCE AND ENGINEERING 201}14

'11.

Advanced Data structures, peter Brass, Cambridge.

Outcomes:
a
a

Learn how to use data structurc concepts for realistic problems.

Ability to identify appropriate data structure for sorving computirrg
problems in respective language.

Aj
nt

uW

or
ld
.in

Ability to solve problems rndependently and think critically.