asymptotic notation with several parameters – conditional asymptotic notation – amortized analysis – NPcompleteness – NP-hard – recurrence equations – solving recurrence equations – arrays – linked lists – trees. 2. Heap Structures 9
CP671 ADVANCED DATA STRUCTURES AND ALGORITHMS 3 0 0 3 1.
Complexity Analysis & Elementary Data Structures 9
Asymptotic notations – Properties of big oh notation – asymptotic notation with
several parameters – conditional asymptotic notation – amortized analysis – NP-
completeness – NP-hard – recurrence equations – solving recurrence equations –
arrays – linked lists – trees.
Heap Structures 9 2.
Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps –
Skew heaps - Lazy-binomial heaps.
3. Search Structures 9
Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-
trees – splay trees – Tries.
4. Multimedia Structures 9
Segment trees – k-d trees – Point Quad trees – MX-Quad trees – R-trees – TV-
trees.
5. Applications 9
Huffman coding – Garbage collection and compaction – Topological sort – Mincut maxflow algorithm – Activity networks – Set representation – Set union
and find operations – Counting binary trees.
TOTAL = 45
References:
1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
Galgotia, 1999.
2. Adam Drozdex, Data Structures and algorithms in C++, Second Edition,
Thomson learning – vikas publishing house, 2001.
3. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall,
1988.
4. V.S. Subrahmanian, Principles of Multimedia Database systems, Morgan
Kaufman, 1998.
5. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to
Algorithms”, Second Edition, PHI 2003.
Min-max heaps – Deaps –... 1页 免费 lecture ppt for Fibonacc... ... Binomial Heaps Leftist trees Binomial heaps Actual Amortized O(log n) O(...
Min-max heaps – Deaps –... 1页 免费 Fibonacci 3页 1财富值 ...We ?rst introduce binomial trees, which are special heap-ordered trees, ...
Min-max heaps – Deaps –... 1页 免费 Merkle Puzzles are Optim... ...4 January, 1994 Are Fibonacci Heaps Optimal? Diab Abuaiadh and Jeffrey H....
§6 Leftist Heaps Declaration: struct TreeNode { ElementType PriorityQueue ...binomial tree, Bk, heaps? k What is by attaching a binomial tree, an ...
Chapter 5 Priority Queues (Heaps) 1/26 Targets Learn the efficient implementation of the priority queue ADT Learn the uses of priority queues Learn the ...
Minuscule heaps over Dynkin diagrams of type_初三数学_数学_初中教育_教育专区。A minuscule heap is a partially ordered set, together with a labeling of ...
The effect of particle shape and friction on the stresses in heaps of granular media We simulate static model sandpiles made of polygonal particles in ...
fibheaps背景与分析_工学_高等教育_教育专区。斐波那契堆的详细背景资料... fibonacci-heap 16页 免费 算法合集之《浅谈“跳跃... 15页 免费 左偏树的...
暂无评价 11页 免费 05函数(MAX,MIN) 1页 免费 Min-max heaps – Deaps –... 1页 免费喜欢此文档的还喜欢 INV:Min-Max库存计划方法 6页 免费 Oracle ...
Priority Queues Fibonacci Heaps Heaps Operation make-heap insert These ...s s Fibonacci heap intuition. s Similar to binomial heaps, but less ...
热门文档