| Document Type
|
:
|
BL
|
| Record Number
|
:
|
891418
|
| Main Entry
|
:
|
Uehara, Ryuhei
|
| Title & Author
|
:
|
First course in algorithms through puzzles /\ Ryuhei Uehara.
|
| Publication Statement
|
:
|
Singapore :: Springer,, 2019.
|
| Page. NO
|
:
|
1 online resource (xi, 175 pages) :: illustrations (some color)
|
| ISBN
|
:
|
9789811331886
|
|
|
:
|
: 9789811331893
|
|
|
:
|
: 981133188X
|
|
|
:
|
: 9811331898
|
|
|
:
|
9789811331879
|
|
|
:
|
9811331871
|
| Notes
|
:
|
Includes index.
|
| Contents
|
:
|
Intro; Preface; Contents; 1 Preliminaries; 1.1 Machine Models; 1.1.1 Turing Machine Model; 1.1.2 RAM Model; 1.1.3 Other Machine Models; 1.2 Efficiency of Algorithm; 1.2.1 Evaluation of Algorithms on Turing Machine Model; 1.2.2 Evaluation of Algorithms on RAM Model; 1.2.3 Evaluation of Algorithms on Other Models; 1.2.4 Computational Complexity in the Worst Case; 1.3 Data Structures; 1.3.1 Variable; 1.3.2 Array; 1.3.3 Multi-dimensional Array; 1.3.4 Queues and Stacks; 1.4 The Big-O Notation and Related Notations; 1.4.1 Warning; 1.4.2 Big-O Notation
|
|
|
:
|
1.4.3 Other Notations Related to the Big-O Notation1.5 Polynomial, Exponential, and Logarithmic Functions; 1.5.1 Harmonic Number; 1.6 Graph; 1.6.1 Representations of a Graph; 2 Recursive Call; 2.1 Tower of Hanoi; 2.1.1 Analysis of the Tower of Hanoi; 2.1.2 Recurrent Call Mechanism; 2.2 Fibonacci Numbers; 2.2.1 Computing Fibonacci Numbers F(n) Arising from Recursive Calls; 2.2.2 Execution Time of Fibr Based on Recursive Calls; 2.2.3 Fast Method for Computing Fibonacci Numbers; 2.2.4 Extremely Fast Method to Compute Fibonacci Numbers; 2.3 Divide-and-Conquer and Dynamic Programming
|
|
|
:
|
3 Algorithms for Searching and Sorting3.1 Searching; 3.1.1 Linear Search and Its Running Time; 3.1.2 Searching in Pre-sorted Data; 3.1.3 Block Search and Its Analysis; 3.1.4 From Recursion to Binary Search; 3.2 Hashing; 3.3 Sorting; 3.3.1 Bubble Sort; 3.3.2 Merge Sort; 3.3.3 Quick Sort; 3.3.4 Analyses and Properties of Sorting; 3.3.5 Essential Complexity of Sorting; 3.3.6 Extremely Fast Bucket Sort and Machine Model; 4 Searching on Graphs; 4.1 Problems on Graphs; 4.2 Reachability: Depth-First Search on Graphs; 4.2.1 Search Trees and Depth-First Search
|
|
|
:
|
4.3 Shortest Paths: Breadth-First Search on Graphs4.4 Lowest Cost Paths: Searching on Graphs Using Dijkstra's Algorithm; 4.4.1 Implementations of Dijkstra's Algorithm; 4.4.2 Analysis of Dijkstra's Algorithm; 5 Backtracking; 5.1 The Eight Queen Puzzle; 5.1.1 Case Study 1; 5.1.2 Case Study 2; 5.1.3 Backtracking Algorithm and Its Analysis; 5.2 Knight's Tour; 5.2.1 Case Study 1; 5.2.2 Case Study 2; 5.2.3 Case Study 3; 5.2.4 Knight Tours on Board of Size 6times6; 6 Randomized Algorithms; 6.1 Random Numbers; 6.2 Shuffling Problem; 6.2.1 Naive Algorithm; 6.2.2 Elegant Algorithm
|
|
|
:
|
6.3 Coupon Collector's Problem7 References; 7.1 For Beginners; 7.2 For Intermediates; 7.3 For Experts; 8 Answers to Exercises; Afterword; Index
|
| Abstract
|
:
|
This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms. More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author's steps to solve problems and to gain a better understanding of the contents. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.
|
| Subject
|
:
|
Computer algorithms.
|
| Subject
|
:
|
Computer algorithms.
|
| Dewey Classification
|
:
|
005.1
|
| LC Classification
|
:
|
QA9.58
|