Seraphim72的博客

Data Structures Succinctly Part 1 Table of Contents The Story behind the Succinctly Series of Books ................................................................................... 9 Chapter 1 Algorithms and Data Structures ........................................................................................... 11 Why Do We Care? ................................................................................................................................. 11 Asymptotic Analysis ............................................................................................................................... 11 Rate of Growth ..................................................................................................................................... 11 Best, Average, and Worst Case .......................................................................................................... 13 What are we Measuring? ..................................................................................................................... 13 Code Samples ..................................................................................................................................... 13 Chapter 2 Linked List ............................................................................................................................... 14 Overview ................................................................................................................................................ 14 Implementing a LinkedList Class ........................................................................................................... 16 The Node ............................................................................................................................................. 16 The LinkedList Class ........................................................................................................................... 18 Add ....................................................................................................................................................... 19 Remove ................................................................................................................................................ 20 Contains ............................................................................................................................................... 22 GetEnumerator .................................................................................................................................... 23 Clear .................................................................................................................................................... 24 CopyTo ................................................................................................................................................ 24 Count ................................................................................................................................................... 25 IsReadOnly .......................................................................................................................................... 25 Doubly Linked List .................................................................................................................................. 25 Node Class .......................................................................................................................................... 26 Add ....................................................................................................................................................... 26 5 Remove ................................................................................................................................................ 28 But Why? ............................................................................................................................................. 31 Chapter 3 Array List ................................................................................................................................. 33 Overview ................................................................................................................................................ 33 Class Definition ...................................................................................................................................... 33 Insertion ................................................................................................................................................. 35 Growing the Array ................................................................................................................................ 35 Insert .................................................................................................................................................... 37 Add ....................................................................................................................................................... 38 Deletion .................................................................................................................................................. 39 RemoveAt ............................................................................................................................................ 39 Remove ................................................................................................................................................ 40 Indexing.................................................................................................................................................. 40 IndexOf ................................................................................................................................................ 40 Item ...................................................................................................................................................... 41 Contains ............................................................................................................................................... 42 Enumeration ........................................................................................................................................... 42 GetEnumerator .................................................................................................................................... 42 Remaining IList Methods ................................................................................................................. 43 Clear .................................................................................................................................................... 43 CopyTo ................................................................................................................................................ 43 Count ................................................................................................................................................... 43 IsReadOnly .......................................................................................................................................... 44 Chapter 4 Stack and Queue .................................................................................................................... 45 Overview ................................................................................................................................................ 45 Stack ...................................................................................................................................................... 45 6 Class Definition .................................................................................................................................... 46 Push ..................................................................................................................................................... 47 Pop ....................................................................................................................................................... 47 Peek ..................................................................................................................................................... 48 Count ................................................................................................................................................... 48 Example: RPN Calculator .................................................................................................................... 49 Queue .................................................................................................................................................... 51 Class Definition .................................................................................................................................... 51 Enqueue ............................................................................................................................................... 52 Dequeue .............................................................................................................................................. 52 Peek ..................................................................................................................................................... 53 Count ................................................................................................................................................... 53 Deque (Double-Ended Queue) .............................................................................................................. 53 Class Definition .................................................................................................................................... 54 Enqueue ............................................................................................................................................... 55 Dequeue .............................................................................................................................................. 55 PeekFirst .............................................................................................................................................. 56 PeekLast .............................................................................................................................................. 57 Count ................................................................................................................................................... 57 Example: Implementing a Stack .......................................................................................................... 58 Array Backing Store ............................................................................................................................. 59 Class Definition .................................................................................................................................... 62 Enqueue ............................................................................................................................................... 62 Dequeue .............................................................................................................................................. 65 PeekFirst .............................................................................................................................................. 66 PeekLast .............................................................................................................................................. 66 Count ................................................................................................................................................... 67 7 Chapter 5 Binary Search Tree ................................................................................................................. 68 Tree Overview ........................................................................................................................................ 68 Binary Search Tree Overview ................................................................................................................ 69 The Node Class ..................................................................................................................................... 70 The Binary Search Tree Class ............................................................................................................... 71 Add ....................................................................................................................................................... 72 Remove ................................................................................................................................................ 74 Contains ............................................................................................................................................... 79 Count ................................................................................................................................................... 81 Clear .................................................................................................................................................... 81 Traversals .............................................................................................................................................. 82 Preorder ............................................................................................................................................... 82 Postorder ............................................................................................................................................. 83 Inorder .................................................................................................................................................. 84 GetEnumerator .................................................................................................................................... 86 Chapter 6 Set ............................................................................................................................................ 87 Set Class ................................................................................................................................................ 87 Insertion ................................................................................................................................................. 89 Add ....................................................................................................................................................... 89 AddRange ............................................................................................................................................ 89 Remove .................................................................................................................................................. 90 Contains ................................................................................................................................................. 90 Count ...................................................................................................................................................... 91 GetEnumerator ...................................................................................................................................... 91 Algorithms .............................................................................................................................................. 92 Union .................................................................................................................................................... 92 8 Intersection .......................................................................................................................................... 93 Difference ............................................................................................................................................. 94 Symmetric Difference .......................................................................................................................... 95 IsSubset ............................................................................................................................................... 96 Chapter 7 Sorting Algorithms ................................................................................................................. 98 Swap ...................................................................................................................................................... 98 Bubble Sort ............................................................................................................................................ 98 Insertion Sort ........................................................................................................................................ 100 Selection Sort ....................................................................................................................................... 103 Merge Sort ........................................................................................................................................... 105 Divide and Conquer ........................................................................................................................... 105 Merge Sort ......................................................................................................................................... 106 Quick Sort ............................................................................................................................................ 108

Data Structures Succinctly Part 2 Table of Contents The Story behind the Succinctly Series of Books ................................................................................... 9 Chapter 1 Skip Lists ................................................................................................................................. 11 Overview ................................................................................................................................................ 11 How it Works ........................................................................................................................................ 11 But There is a Problem ........................................................................................................................ 13 Code Samples ..................................................................................................................................... 15 SkipListNode Class ................................................................................................................................ 15 SkipList Class ........................................................................................................................................ 16 Add ......................................................................................................................................................... 17 Picking a Level ..................................................................................................................................... 17 Picking the Insertion Point ................................................................................................................... 19 Remove .................................................................................................................................................. 20 Contains ................................................................................................................................................. 21 Clear ....................................................................................................................................................... 23 CopyTo................................................................................................................................................... 23 IsReadOnly ............................................................................................................................................ 24 Count ...................................................................................................................................................... 24 GetEnumerator ...................................................................................................................................... 24 Common Variations ............................................................................................................................... 25 Array-Style Indexing............................................................................................................................. 25 Set behaviors ....................................................................................................................................... 26 Chapter 2 Hash Table .............................................................................................................................. 27 Hash Table Overview ............................................................................................................................. 27 Hashing Basics ...................................................................................................................................... 27 5 Overview .............................................................................................................................................. 27 Hashing Algorithms .............................................................................................................................. 29 Handling Collisions .............................................................................................................................. 33 HashTableNodePair Class..................................................................................................................... 34 HashTableArrayNode Class .................................................................................................................. 36 Add ....................................................................................................................................................... 36 Update ................................................................................................................................................. 37 TryGetValue ......................................................................................................................................... 38 Remove ................................................................................................................................................ 39 Clear .................................................................................................................................................... 40 Enumeration ......................................................................................................................................... 40 HashTableArray Class ........................................................................................................................... 42 Add ....................................................................................................................................................... 43 Update ................................................................................................................................................. 43 TryGetValue ......................................................................................................................................... 44 Remove ................................................................................................................................................ 44 GetIndex .............................................................................................................................................. 45 Clear .................................................................................................................................................... 45 Capacity ............................................................................................................................................... 46 Enumeration ......................................................................................................................................... 46 HashTable Class .................................................................................................................................... 48 Add ....................................................................................................................................................... 49 Indexing ............................................................................................................................................... 50 TryGetValue ......................................................................................................................................... 51 Remove ................................................................................................................................................ 51 ContainsKey ......................................................................................................................................... 52 ContainsValue ...................................................................................................................................... 52 6 Clear .................................................................................................................................................... 53 Count ................................................................................................................................................... 53 Enumeration ......................................................................................................................................... 54 Chapter 3 Heap and Priority Queue ....................................................................................................... 56 Overview ................................................................................................................................................ 56 Binary Tree as Array .............................................................................................................................. 57 Structural Overview.............................................................................................................................. 57 Navigating the Array like a Tree .......................................................................................................... 59 The Key Point ...................................................................................................................................... 60 Heap Class ............................................................................................................................................ 60 Add ......................................................................................................................................................... 61 RemoveMax ........................................................................................................................................... 65 Peek ....................................................................................................................................................... 69 Count ...................................................................................................................................................... 69 Clear ....................................................................................................................................................... 69 Priority Queue ........................................................................................................................................ 70 Priority Queue Class ............................................................................................................................ 70 Usage Example .................................................................................................................................... 71 Chapter 4 AVL Tree .................................................................................................................................. 73 Balanced Tree Overview........................................................................................................................ 73 What is Node Height? .......................................................................................................................... 73 Balancing Algorithms ............................................................................................................................. 75 Right Rotation ...................................................................................................................................... 75 Left Rotation ......................................................................................................................................... 77 Right-Left Rotation ............................................................................................................................... 78 Left-Right Rotation ............................................................................................................................... 80 Heaviness and Balance Factor ............................................................................................................ 81 7 AVLTreeNode Class .............................................................................................................................. 82 Balance ................................................................................................................................................ 83 Rotation Methods ................................................................................................................................. 86 AVLTree Class ....................................................................................................................................... 87 Add ....................................................................................................................................................... 88 Contains ............................................................................................................................................... 89 Remove ................................................................................................................................................ 90 GetEnumerator .................................................................................................................................... 93 Clear .................................................................................................................................................... 95 Count ................................................................................................................................................... 95 Chapter 5 B-tree ....................................................................................................................................... 96 Overview ................................................................................................................................................ 96 B-tree Structure ...................................................................................................................................... 96 Minimal Degree .................................................................................................................................... 97 Tree Height .......................................................................................................................................... 97 Searching the Tree .............................................................................................................................. 98 Putting it Together.............................................................................................................................. 100 Balancing Operations ........................................................................................................................... 100 Pushing Down .................................................................................................................................... 100 Rotating Values .................................................................................................................................. 102 Splitting Nodes ................................................................................................................................... 104 Adding Values ...................................................................................................................................... 105 Removing Values ................................................................................................................................. 107 B-tree Node .......................................................................................................................................... 108 BTreeNode Class............................................................................................................................... 108 Adding, Removing, and Updating Values .......................................................................................... 110 Splitting Node ..................................................................................................................................... 111 8 Pushing Down .................................................................................................................................... 113 Validation ........................................................................................................................................... 115 B-tree ................................................................................................................................................... 116 BTree Class ....................................................................................................................................... 116 Add ..................................................................................................................................................... 117 Remove .............................................................................................................................................. 118 Contains ............................................................................................................................................. 126 Clear .................................................................................................................................................. 127 Count ................................................................................................................................................. 127 CopyTo .............................................................................................................................................. 128 IsReadOnly ........................................................................................................................................ 128 GetEnumerator .................................................................................................................................. 129

Within the last 18 months more than 40,000 people worldwide have taken the International Software Testing Qualifications Board (ISTQB) Foundations Level exam, 10,000 alone in the last 4 months. So, where can all these people go to learn what they need to know in order to pass the exam? Now they can go to Software Testing Foundations 2nd Edition, from Rocky Nook's new Computing division. Professional testing of software has become an increasingly important task requiring a profound knowledge of testing techniques. The ISTQB has developed a universally accepted, international, qualification scheme aimed at software and system testing professionals, and has created the syllabi and tests for the "Certified Tester". With authors who are among the founders of the ISTQB, this improved, updated, newly edited 2nd Edition covers the "Foundations Level" (i.e., entry level), and teaches the most important methods of software testing. It is designed for self-study and provides the necessary knowledge to pass the Certified Tester - Foundations Level exam as defined by the ISTQB. It also covers more recent topics, such as test-first approach and risk-based testing. Next Book Cover Software Testing Foundations: A Study Guide for the Certified Tester Exam By Andreas Spillner, Tilo Linz, Hans Schaefer ............................................... Publisher: Rocky Nook Pub Date: January 01, 2007 Print ISBN: 978-1-933952-08-6 Web ISBN: 1-933952-08-3 Pages: 288 Slots: 1.0 Start Reading Online Table of Contents | Index About the Authors Copyright Foreword to the First Edition by Rex Black Foreword Chapter 1. Introduction Chapter 2. The Basics of Software Testing Section 2.1. Terms and Motivation Section 2.2. The Fundamental Test Process Section 2.3. The Psychology of Testing Section 2.4. General Principles of Testing Section 2.5. Summary Chapter 3. Testing in the Software Lifecycle Section 3.1. The General V-Model Section 3.2. Component Test Section 3.3. Integration Test Section 3.4. System Test Section 3.5. Acceptance Test Section 3.6. Testing New Product Versions Section 3.7. Generic Types of Testing Section 3.8. Summary Chapter 4. Static Testing Section 4.1. Structured Group Examinations Section 4.2. Static Analysis Section 4.3. Summary Chapter 5. Dynamic Analysis – Test Design Techniques Section 5.1. Black Box Testing Techniques Section 5.2. White Box Testing Techniques Section 5.3. Intuitive and Experience Based Test Case Determination Section 5.4. Summary Chapter 6. Test Management Section 6.1. Test Organization Section 6.2. Test Planning Section 6.3. Cost and Economy Aspects Section 6.4. Definition of Test Strategy Section 6.5. Test Activity Management Section 6.6. Incident Management Section 6.7. Requirements to Configuration Management Section 6.8. Relevant Standards Section 6.9. Summary Chapter 7. Test Tools Section 7.1. Types of Test Tools Section 7.2. Selection and Introduction of Test Tools Section 7.3. Summary Part I: Appendix Appendix A. Test Plan According to IEEE Std. 829 Appendix B. Important Information on the Curriculum and on the Certified Tester Exam Appendix C. 9 Exercises Glossary Literature Further recommended literature Standards WWW-pages Further useful WWW-pages Index