lecture plan 302 final
TRANSCRIPT
![Page 1: Lecture Plan 302 FINAL](https://reader030.vdocument.in/reader030/viewer/2022021319/577ccf371a28ab9e788f2dda/html5/thumbnails/1.jpg)
8/12/2019 Lecture Plan 302 FINAL
http://slidepdf.com/reader/full/lecture-plan-302-final 1/3
![Page 2: Lecture Plan 302 FINAL](https://reader030.vdocument.in/reader030/viewer/2022021319/577ccf371a28ab9e788f2dda/html5/thumbnails/2.jpg)
8/12/2019 Lecture Plan 302 FINAL
http://slidepdf.com/reader/full/lecture-plan-302-final 2/3
deletion Algorithms
Proble !i"cu"" abo#e lecturer $%$*%$ T-
Dou;ly lin)ed list, <ar;age Collection and Compaction $+
Array and lin)ed representation and implementation o3ueues !2
Operations on 4ueue* Create, Add, Delete, 5ull and Empty !1
Proble !i"cu"" abo#e lecturer $+%20%2$ T-*
Circular 3ueue, De3ue, and +riority 4ueue 22
"epresentation and (mplementation o Singly &in)ed &ists !$
T.o-.ay 7eader &ist, Tra/ersing and Searching o &in)ed
&ist, O/erlo. and 8nderlo.
!6
Proble !i"cu"" abo#e lecturer 22%23%2& T-
Unit III Basic terminology, Binary Trees !%
Binary tree representation, alge;raic Expressions !'
Complete Binary Tree Extended Binary Trees !
Proble !i"cu"" abo#e lecturer 2'%2%2* T-+
Array and &in)ed "epresentation o Binary trees, Tra/ersingBinary trees
!:
Threaded Binary trees Tra/ersing Threaded Binary trees 2+
7uman algorithm $2
Se3uential search, ;inary search, comparison and analysis $1
Proble !i"cu"" abo#e lecturer 2%2+%30%3$ T-$0
Unit I, (nsertion Sort, Bu;;le Sorting $!
4uic) Sort, T.o =ay #erge Sort 33
7eap Sort, Sorting on Dierent >eys $6
Binary Search Tree ?BST@ (nsertion and Deletion in BST $%
Proble !i"cu"" abo#e lecturer 32%33%3&%3' T-$$
Binary Search Tree ?BST@ (nsertion and Deletion in BST $'
Complexity o Search Algorithm, +ath &ength $
A& Trees B-trees $:
Binary Search Tree ?BST@ (nsertion and Deletion in BST $0
Proble !i"cu"" abo#e lecturer 3%3*%3%3+ T-$2
<raphs* Terminology "epresentations 62
![Page 3: Lecture Plan 302 FINAL](https://reader030.vdocument.in/reader030/viewer/2022021319/577ccf371a28ab9e788f2dda/html5/thumbnails/3.jpg)
8/12/2019 Lecture Plan 302 FINAL
http://slidepdf.com/reader/full/lecture-plan-302-final 3/3
Unit , <raphs #ulti-graphs, Directed <raphs &$
"epresentations o <raphs, Adacency #atrices, Tra/ersal 6!
Connected Component and Spanning Trees #inimum Cost
Spanning Trees
6$
Proble !i"cu"" abo#e lecturer &0%&$%&2%&3 T-$3
+hysical Storage #edia 5ile Organization &&
Organization o records into Bloc)s, Se3uential 5iles 6%
(ndexing and 7ashing, +rimary indices, Secondary indices 6'
B Tree index 5iles, B Tree index 5iles 6
(ndexing and 7ashing Comparisons &
Proble !i"cu"" abo#e lecturer &&%&'%&%&*%& T-$&