Book Image

Cloud Native Applications with Ballerina

By : Dhanushka Madushan
Book Image

Cloud Native Applications with Ballerina

By: Dhanushka Madushan

Overview of this book

The Ballerina programming language was created by WSO2 for the modern needs of developers where cloud native development techniques have become ubiquitous. Ballerina simplifies how programmers develop and deploy cloud native distributed apps and microservices. Cloud Native Applications with Ballerina will guide you through Ballerina essentials, including variables, types, functions, flow control, security, and more. You'll explore networking as an in-built feature in Ballerina, which makes it a first-class language for distributed computing. With this app development book, you'll learn about different networking protocols as well as different architectural patterns that you can use to implement services on the cloud. As you advance, you'll explore multiple design patterns used in microservice architecture and use serverless in Amazon Web Services (AWS) and Microsoft Azure platforms. You will also get to grips with Docker, Kubernetes, and serverless platforms to simplify maintenance and the deployment process. Later, you'll focus on the Ballerina testing framework along with deployment tools and monitoring tools to build fully automated observable cloud applications. By the end of this book, you will have learned how to apply the Ballerina language for building scalable, resilient, secured, and easy-to-maintain cloud native Ballerina projects and applications.
Table of Contents (15 chapters)
1
Section 1: The Basics
4
Section 2: Building Microservices with Ballerina
8
Section 3: Moving on with Cloud Native

Questions

  1. You might already be familiar with printing star patterns using different programming languages. To familiarize yourself more with the Ballerina flow control syntax, write a Ballerina program to print the following star pattern:

    Figure 2.8 – Symmetric star pattern

  2. Write a function to sort an integer array. For example, an array with elements [5, 3, 9, 2, 4] should be returned as [2, 3, 4, 5, 9].

    Hint: You can simply use an insertion sort with two loops to implement a sorting algorithm. The first for loop should loop through the whole element and the second loop should insert the elements in the correct location. You can also use a merge sort with a recursive call to build a much more efficient sorting function.