فهرست مطالب

• Cover
• Title Page
• Copyright
• Dedication
• About the Author
• About the Technical Reviewer
• Brief Contents
• Contents in Detail
• Acknowledgments
• Introduction
• The Power of Coding
• Part I: Programming Fundamentals
• Chapter 1: Kotlin Basics
• Using Comments
• Variables
• Operators
• Working with Strings
• Null and Nullable Types
• Flow Control
• Functions
• Scope Functions
• Lambda Expressions
• Basic Input and Output
• Project 1: Build a Console-Based Calculator
• Summary
• Resource
• Chapter 2: Arrays, Collections, and Classes
• Arrays
• Collections
• An Introduction to Classes
• Common Classes and Custom Types
• Copying Objects
• Project 2: Build a Versatile Task Manager
• Summary
• Resource
• Chapter 3: Visualizing with JavaFX
• Data Visualization Tools for Kotlin
• An Overview of JavaFX
• Project 3: Build “Hello, World!” in JavaFX
• The JavaFX Object Hierarchy
• Creating JavaFX Charts
• Project 4: Visualize Data as a Bar Chart
• Project 5: Create a Multiseries Line Chart
• Drawing with the Canvas
• Project 6: Draw a Spiral Seashell
• Animation in JavaFX
• Project 7: Animate a Square
• Project 8: Animate a Bouncing Ball
• Summary
• Resources
• Part II: Applications in Math and Science
• Chapter 4: Solving Mathematical Problems with Code
• Project 9: Find the Square Root with the Babylonian Algorithm
• Project 10: Create Pythagorean Triples with Euclid’s Formula
• Project 11: Identify Prime Numbers with the Sieve of Eratosthenes
• Project 12: Calculate Earth’s Circumference the Ancient Way
• Project 13: Code the Fibonacci Sequence
• Project 14: Find the Shortest Distance Between Two Locations on Earth
• Project 15: Do Encryption with the Hill Cipher
• Project 16: Simulate a One-Dimensional Random Walk
• Summary
• Resources
• Chapter 5: Modeling and Simulation
• Project 17: Predict the Flight of a Cannonball
• Project 18: Design a Fountain with Water Jets
• Project 19: Track a Pendulum’s Motion and Phase
• Project 20: The Physics of Coffee Cooling
• Project 21: Simulate a Binary Star System
• Summary
• Resources
• Part III: Recursion, Sorting, and Searching
• Chapter 6: Recursive Functions and Fractals
• The Concept of Fractals
• Recursive Functions
• Project 22: The “Hello, World!” of Fractals
• Project 23: Draw the Sierpiński Triangle
• Project 24: Create a Fractal Tree
• The L-System and Turtle Graphics
• Project 25: Design an L-System Simulator
• The Mighty Mandelbrot Set
• Project 26: Code and Visualize the Mandelbrot Set
• Summary
• Resources
• Chapter 7: Sorting and Searching
• Sorting Algorithms
• Project 27: Space-Efficient Sorting with Insertion Sort
• Project 28: Faster Sorting with Merge Sort
• Project 29: High-Efficiency Sorting with Quick Sort
• Search Algorithms
• Project 30: Stack-Based Searching with Depth-First Search
• Project 31: Queue-Based Searching with Breadth-First Search
• Project 32: Heuristic Searching with A*
• Summary
• Resources
• Part IV: Optimization with Nature-Inspired Algorithms
• Afterword
• Appendix
• Index
• Back Cover