Data Structures and Algorithms - Chapter 8: Heaps pptx

... else1. MinData = Data[ 0]2. Data[ 0] = Data[ count -1 ]3. count = count - 14. ReheapDown(0, count -1 )5. return successEnd DeleteHeap16<ErrorCode> DeleteHeap (ref MinData <DataType>) ... (heap is not full) AND (more data in listOfData)1. listOfData.Retrieve(count, newData)2. data[ count] = newData3. ReheapUp( count)4. count = count + 13. if (count < listOfData.Size() )1. ... DataIn <DataType>)<ErrorCode> DeleteMin (ref MinData <DataType>)<ErrorCode> RetrieveMin (ref MinData <DataType>)<ErrorCode> RetrieveMax (ref MaxData <DataType>)<ErrorCode>...

Data Structures and Algorithms - Chapter 7 -Tree pptx

... Search (ref DataOut <DataType>)<ErrorCode> Insert (val DataIn <DataType>)<ErrorCode> Remove (val key <KeyType>)<ErrorCode> Retrieve (ref DataOut <DataType>)15Depend ... (ref<void>Operation(ref Data <DataType>))<void> inOrderTraverse (ref<void>Operation(ref Data <DataType>))<void> postOrderTraverse (ref<void>Operation(ref Data <DataType>))• ... tree)Record Data <DataType>Parent <DataType>Flag <ChildType>End RecordBinaryTree Data <Array of <Record> >End BinaryTree0123456 Data ABECFGH Parent - ABACCF...

Data Structures and Algorithms - Chapter 3 -STACK ppt

... <integer>count <integer> data <array of <DataType>>End Stackx x x x xxn count data 0 1 2 3 n-2 n-1 max-2 max-1Stack with pre-defined maxsize and has n elements.n -1 topPhysical…25push ... element).15counttop1pNewcounttop0pNewpNew->link = top top = pNewcount = count + 1Push Algorithm (cont.)<ErrorCode> Push (val DataIn <DataType>)Pushes new data into the stack.Pre DataIn contains data to be ... (cont.)<ErrorCode> Top (ref DataOut <DataType>)Retrieves data on the top of the stack without changing the stack.Pre none.Post if the stack is not empty, DataOut receives data on its top. The...

Data Structures and Algorithms - Chapter 3 -Stack Applications pdf

... / f)*gabca+b*c-(d*e / f)*gabc*+de++*+( - ( - *+ - *( - *( - InfixPostfixa+b*c- (d*e / f)*gabc*+de*a+b*c- (d*e / f)*gabc*+de*fa+b*c- (d*e / f)*gabc*+de*f/a+b*c- (d*e / f)*gabc*+de*f/a+b*c- ... success.14InfixPostfixInfixPostfixa+b*c-(d*e / f)*gaa+b*c-(d*e / f)*gabc*+a+b*c-(d*e / f)*gaa+b*c-(d*e / f)*gabc*+a+b*c-(d*e / f)*gaba+b*c-(d*e / f)*gabc*+da+b*c-(d*e / f)*gaba+b*c-(d*e / f)*gabc*+da+b*c-(d*e ... 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 242642Postfix2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 2 4 6 + * 5 - 1510*2 = 20201024+6 =10Evaluate a Postfix Expression5202 0-5 ...

Data Structures and Algorithms - Chapter 9: Hashing pot

... TruCSE Faculty - HCMUTHash Functions• Direct hashing• Modulo division• Digit extraction• Mid-square• Folding• Rotation• Pseudo-random1601 December 2008Cao Hoang TruCSE Faculty - HCMUTDirect ... 560010 → 66Spreading the data more evenly across the address space2601 December 2008Cao Hoang TruCSE Faculty - HCMUTPseudorandomPseudorandomNumber GeneratorKeyRandomNumberModuloDivisionAddressy ... Concepts[17][9][5][1]BACB and Acollide at 9Collision ResolutionInsert A, B, Chash(A) = 9hash(B) = 9hash(C) = 17B and A collide at 9C and B collide at 171401 December 2008Cao Hoang TruCSE Faculty - HCMUTBasic...

Data Structures and Algorithms - Chapter 6 -Recursion pot

... write (head-> ;data) 3. Print(head->link) // recursive caseEnd Print18Print List in Reverse19 Chapter 6 - Recursion Subprogram implementation Recursion Designing recursive algorithms  ... Backtracking Examples of backtracking and recursive algorithms:  Factorial Fibonacci The towers of Hanoi Eight Queens Problem Tree-structured program: Look-ahead in Game1Print List in Reverse20Print ... PrintReverse.1. if (head = NULL) // stopping case1. return2. PrintReverse(head->link) // recursive case3. write (head-> ;data) End PrintReverse21Factorial: A recursive Definition22Iterative...

Data Structures and Algorithms - Chapter 10: Sorting docx

... < count )1. temp = data current2. walker = current-13. loop (walker >=0) AND (temp.key < data walker.key)1. data walker+1= data walker2. walker = walker -1 4. data walker+1= temp5. ... count)1. temp = data[ current]2. walker = current - k3. loop (walker >=0) AND (temp.key < data[ walker].key)1. data[ walker + k] = data[ walker]2. walker = walker – k4. data[ walker + k] ... 1.19 Chapter 10 - Sorting1Choosing incremental valuesIncremental values may be: 1, 4, 13, 40, 121, kt= 1ki-1= 3 * ki+ 1t = |log3(n)| -1 or : 1, 3, 7, 15, 31, kt= 1ki-1=...

Data Structures and Algorithms - Chapter 12: Multiway trees pdf

... > position)1. subroot-> ;data i= subroot-> ;data i - 12. subroot->branchi + 1= subroot->branchi3. i = i + 13. subroot-> ;data position= entry4. subroot->branchposition + ... 1011M-Way Search Tree12131415B-Tree1617B-Tree Insertion18B-Tree Insertion19 Chapter 12 Lexicographic Search Trees: Tries Multiway Trees B-Tree, B*-Tree, B+-Tree Red-Black ... B-Tree, B*-Tree, B+-Tree Red-Black Trees (BST and B-Tree) 2-d Tree, k-d Tree1B-TreeB_Nodecount <integer> data <array of <DataType>>branch <array of <pointer>>End...

Data Structures and Algorithms - Chapter 12: Multiway trees doc

... entryNdx + 1)1 node -& gt; entries[shifter] = node -& gt; entries[shifter - 1]2 shifter = shifter - 13 node -& gt; entries[shifter] = newEntry4 node -& gt; numEntries = node -& gt; numEntries + ... Faculty - HCMUTB-Tree Insertion11 else1 insertEntry (rightPtr, entryNdx − minEntries, upEntry)2 node -& gt; numEntries = node -& gt; numEntries − 13 rightPtr -& gt; numEntries = rightPtr -& gt; ... - HCMUTB-Tree InsertionAlgorithm BTreeInsert (val root <pointer>, val data <record>)Inserts data into B-tree. Equal keys placed on right branch.Pre root is a pointer to the B-tree....

Xem thêm