Data structure practice : for collegiate programming contests and education /: for collegiate programming contests and education. (2016)

• Record Type: Book
• Further Information: Note: Yonghui Wu, Jiande Wang.
• Authors: Wu, Yonghui; Wang, Jiande
• Contents: FUNDAMENTAL PROGRAMMING SKILLS; ; Practice for Simple Computing; Improving Programming Style; Multiple Test Cases; Precision of Real Numbers; Improving Time Complexity by Dichotomy; Problems; ; Simple Simulation; Simulation of Direct Statement; Simulation by Sieve Method; Construction Simulation; Problems; ; Simple Recursion; Calculation of Recursive Functions; Solving Problems by Recursive Algorithms; Solving Recursive Datum; Problems; Summary of Section I; ; EXPERIMENTS FOR LINEAR LISTS; ; Linear Lists Accessed Directly; Application of Arrays 1: Calculation of Dates; Application of Arrays 2: Calculation of High-Precision Numbers; Application of Arrays 3: Representation and Computation of Polynomials; Application of Arrays 4: Calculation of Numerical Matrices; Character Strings 1: Storage Structure of Character Strings; Character Strings 2: Pattern Matching of Character Strings; Problems; ; Applications of Linear Lists for Sequential Access; Application of Sequence Lists; Application of Stacks; Application of Queues; Problems; ; Generalized List Using Indexes; Solving Problems Using Dictionaries; Solving Problems Using a Hash Table and the Hash Method; Problems; ; Sort of Linear Lists; Using Sort Function in STL; Using Sort Algorithms; Problems; Summary of Section II; ; EXPERIMENTS FOR TREES; ; Programming by Tree Structure; Solving Hierarchical Problems by Tree Traversal; Union–Find Sets Supported by Tree Structure; Calculation of Sum of Weights of Subtrees by Binary Indexed Trees; Problems; ; Applications of Binary Trees; Converting Ordered Trees to Binary Trees; Paths of Binary Trees; Traversal of Binary Trees; Problems; ; Applications of Classical Trees; Binary Search Trees; Binary Heaps; Huffman Trees; Problems; Summary of Section III; ; EXPERIMENTS FOR GRAPHS; ; Applications of Graph Traversal; BFS Algorithm; DFS Algorithm; Topological Sort; Connectivity of Undirected Graphs; Problems; ; Algorithms of Minimum Spanning Trees; Kruskal Algorithm; Prim Algorithm; Problems; ; Algorithms of Best Paths; Warshall Algorithm and Floyd–Warshall Algorithm; Dijkstra’s Algorithm; Bellman–Ford Algorithm; Shortest Path Faster Algorithm; Problems; ; Algorithms of Bipartite Graphs and Flow Networks; Maximum Matching in Bipartite Graphs; Flow Networks; Problems; Summary of Section IV
• Edition: 1st
• Publisher Details: Boca Raton : CRC Press
• Publication Date: 2016
• Extent: 1 online resource, illustrations (black and white)
• Subjects: 005.73; Data structures (Computer science)
• Languages: English
• ISBNs: 9781482215403
• Related ISBNs: 9781482215397
• Notes: Note: Description based on CIP data; item not viewed.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.