Cucumber BDD With Java, Selenium, Jenkin, GIT, Extent Report

Serverless computing runs your code only while an event is calling it: the provider conjures an execution environment on demand, throws it away afterwards, and charges for work performed instead of for capacity sitting idle.

A container is an application packaged together with the libraries and configuration it needs, run as an isolated process on a host that is already switched on, so the same package behaves the same way on a laptop, in a build pipeline and in production.

Object storage keeps every file as a self-contained object (the bytes, a unique key and some metadata) inside a flat bucket you read and write over HTTP, with no drive to mount and no directory tree underneath it.

A domain name is an address in the internet's public namespace that you rent through a registrar for a yearly fee, and it remains yours only while the registrar account holding it stays paid up and under your own control.

Caching keeps the result of expensive work, such as a rendered page or a database query, and serves that stored copy until it expires, making it the largest single source of speed on any busy website.

Uptime is the proportion of time a service answers requests, quoted in nines, and a service level agreement is the contract clause setting out how that proportion is counted and what the provider owes when it falls short.

A framework is a body of code that imposes a structure on the application built with it: it decides how files are organised, when the application's own code is called and how its parts talk, whereas a library is code the application calls when it chooses.

Object-oriented programming is a way of organising a program as objects, each holding its own data and the operations allowed on it, with classes as the templates objects are made from, so that the code models the things it is about rather than the steps the computer takes.

Data structures are the ways a program arranges data in memory (arrays, lists, hash tables, trees, graphs) and algorithms are the step-by-step procedures that work on them; together they decide whether an operation takes a millisecond or an hour as the data grows.