Lecture plan DATA STRUCTURE (ECS-302) Unit Topic

T
2

P
0

Lecture/ Tutorial
1

Unit I

Basic Terminology, Elementary Data Organization Data Structure operations, Algorithm Complexity and TimeSpace trade-o Array De inition, "epresentation and Analysis, Single and #ultidimensional Arrays Proble !i"cu"" abo#e lecturer $%2%3 address calculation, application o arrays Character String in C, Character string operation Ordered &ist, Sparse #atrices Proble !i"cu"" abo#e lecturer &%'%(

! $ T-$ & % ' T-2 ) 0 T-3 12 11 $2 T-& 1$ 16 $' T-' 1' 11:

Array "epresentation and (mplementation o stac), Operations on Stac)s* +ush , +op Array "epresentation o Stac), &in)ed "epresentation o Stac) Operations Associated .ith Stac)s Application o stac)* Con/ersion o (n ix to +re ix and +ost ix Expressions Proble !i"cu"" abo#e lecturer *%)%+ E/aluation o post ix expression using stac)1 "ecursion Data Structure operations, Algorithm Complexity and TimeSpace trade-o Array De inition, "epresentation and Analysis, Single and #ultidimensional Arrays Proble !i"cu"" abo#e lecturer $0%$$%$2

Unit II

Array and lin)ed representation and implementation o 3ueues Operations on 4ueue* Create, Add, Delete, 5ull and Empty Circular 3ueue, De3ue, and +riority 4ueue Proble !i"cu"" abo#e lecturer $3%$&%$' "epresentation and (mplementation o Singly &in)ed &ists T.o-.ay 7eader &ist, Tra/ersing and Searching o &in)ed &ist, O/er lo. and 8nder lo. (nsertion and deletion to9 rom &in)ed &ists, (nsertion and

deletion Algorithms Proble !i"cu"" abo#e lecturer $(%$*%$) T-( $+ !2 !1 T-* 22 !$ !6 T-) !% !' !T-+ !: 2+ $2 $1 T-$0 $! 33 $6 $% T-$$ $' $$: $0 T-$2 62

Dou;ly lin)ed list, <ar;age Collection and Compaction Array and lin)ed representation and implementation o 3ueues Operations on 4ueue* Create, Add, Delete, 5ull and Empty Proble !i"cu"" abo#e lecturer $+%20%2$

Circular 3ueue, De3ue, and +riority 4ueue "epresentation and (mplementation o Singly &in)ed &ists T.o-.ay 7eader &ist, Tra/ersing and Searching o &in)ed &ist, O/er lo. and 8nder lo. Proble !i"cu"" abo#e lecturer 22%23%2&

Unit III

Basic terminology, Binary Trees Binary tree representation, alge;raic Expressions Complete Binary Tree1 Extended Binary Trees Proble !i"cu"" abo#e lecturer 2'%2(%2*

Array and &in)ed "epresentation o Binary trees, Tra/ersing Binary trees Threaded Binary trees Tra/ersing Threaded Binary trees 7u man algorithm Se3uential search, ;inary search, comparison and analysis Proble !i"cu"" abo#e lecturer 2)%2+%30%3$

Unit I,

(nsertion Sort, Bu;;le Sorting 4uic) Sort, T.o =ay #erge Sort 7eap Sort, Sorting on Di erent >eys Binary Search Tree ?BST@ (nsertion and Deletion in BST Proble !i"cu"" abo#e lecturer 32%33%3&%3'

Binary Search Tree ?BST@ (nsertion and Deletion in BST Complexity o Search Algorithm, +ath &ength AA& Trees B-trees Binary Search Tree ?BST@ (nsertion and Deletion in BST Proble !i"cu"" abo#e lecturer 3(%3*%3)%3+

<raphs* Terminology , "epresentations

Unit ,

<raphs , #ulti-graphs, Directed <raphs "epresentations o <raphs, AdBacency #atrices, Tra/ersal Connected Component and Spanning Trees #inimum Cost Spanning Trees Proble !i"cu"" abo#e lecturer &0%&$%&2%&3 +hysical Storage #edia 5ile Organization Organization o records into Bloc)s, Se3uential 5iles (ndexing and 7ashing, +rimary indices, Secondary indices BC Tree index 5iles, B Tree index 5iles (ndexing and 7ashing Comparisons Proble !i"cu"" abo#e lecturer &&%&'%&(%&*%&)

&$ 6! 6$ T-$3 && 6% 6' 6&) T-$&