Skip to main content

Understanding Programming Methodologies: A Comprehensive Guide

Understanding Programming Methodologies: A Comprehensive Guide Introduction Programming methodologies define structured approaches to writing code, improving efficiency, maintainability, and scalability. Different methodologies provide distinct ways of thinking about problem-solving, organizing logic, and structuring applications. This blog explores various programming methodologies, their advantages, drawbacks, applications, and best use cases. 1. Procedural Programming Procedural programming follows a step-by-step approach where code is structured as procedures or functions. Characteristics: Based on the concept of procedure calls. Follows a linear, top-down execution model. Uses variables, loops, and control structures. Languages: C, Pascal, Fortran Sample Code (C): #include <stdio.h> void greet() { printf("Hello, World!\n"); } int main() { greet(); return 0; } Applications: Embedded systems (e.g., firmware, microcontrollers) Operating systems (e.g., Li...
Post a Comment

Why JVM Was Needed & How It Evolved – A Story

 

The Problem Before Java

In the early days of programming, developers faced a big issue: portability. Every programming language required code to be rewritten for different operating systems. A program written for Windows wouldn’t run on Linux or Mac without modifications.

Imagine you are a Bollywood director making a movie. If you shoot in Hindi, it won’t reach a Tamil-speaking audience unless you dub or remake it. This was the same problem in software—each platform needed a different version of the same program.

The Birth of Java & JVM (1991-1995)

In 1991, James Gosling and his team at Sun Microsystems wanted to solve this problem. They dreamed of a language that could run anywhere, on any device, without modification.

They created Java, but Java alone wasn’t enough. They needed a translator that could understand Java and speak the language of any operating system. This is where the Java Virtual Machine (JVM) was born.

  • Java Compiles Code to Bytecode: Instead of compiling directly into system-specific machine code, Java compiles into an intermediate code called bytecode.
  • JVM Translates Bytecode for Any OS: The JVM acts as a universal translator, converting bytecode into machine code specific to the operating system (Windows, Mac, Linux, etc.).
  • Write Once, Run Anywhere (WORA): Now, developers could write their code once, and it could run anywhere that had a JVM installed.

Evolution of JVM

  1. Early JVM (1995 - Java 1.0)
    • Basic JVM was slow because it interpreted bytecode line by line.
  2. JIT Compiler (1997 - Java 1.2)
    • The Just-In-Time (JIT) Compiler was introduced, which made execution much faster by compiling bytecode into native machine code just before execution.
  3. Garbage Collection Improvements (2004 - Java 5 & later)
    • JVM started managing memory better, automatically removing unused objects, making Java more efficient.
  4. Modern JVM (2014 - Java 8 & beyond)
    • JVM introduced performance improvements, security features, and support for cloud computing and large-scale applications.

Why JVM is Still Important?

Today, JVM is everywhere—from mobile apps (Android uses a Java-based VM) to enterprise applications running on servers. It continues to evolve, making Java one of the most reliable and future-proof languages.

So, thanks to JVM, developers don’t have to "remake the movie" for every platform. They just write once, and JVM takes care of the rest!

Labels:

Comments

Post a Comment

Popular posts from this blog

Iterators and Collections

In Java, iterators are objects that allow for sequential access to the elements of a collection. The Java Collections Framework provides the Iterator interface, which defines methods for iterating over collections such as lists, sets, and maps. Here's an explanation of iterators and their relationship with collections, along with examples: Iterator Interface: The Iterator interface provides methods to iterate over the elements of a collection sequentially: - boolean hasNext(): Returns true if there are more elements to iterate over. - E next(): Returns the next element in the iteration. - void remove():  Removes the last element returned by `next()` from the underlying collection (optional operation). Collections and Iterators: 1. Collection Interface:    - Collections represent groups of objects, such as lists, sets, and maps.    - They provide methods for adding, removing, and accessing elements. 2. Iterator Usage:    - Collections implement the Iter...
Post a Comment
Read more

The Collection Interface.

  The Collection Interface. 
Post a Comment
Read more

OracleJDK vs OpenJDK

Oracle JDK (Java Development Kit): Oracle JDK is the official reference implementation of the Java Platform, Standard Edition (Java SE). It included the JRE along with development tools. OpenJDK: An open-source alternative to Oracle JDK, OpenJDK is a community-driven project. It provides a free and open-source implementation of the Java Platform, and many other JDKs, including Oracle JDK, are derived from OpenJDK. Below is a simple table highlighting some key points of comparison between Oracle JDK and OpenJDK: Feature Oracle JDK OpenJDK Vendor Oracle Corporation OpenJDK Community Licensing Commercial (Paid) with Oracle Binary Code License Agreement Open Source (GNU General Public License, version 2, with the Classpath Exception) Support Commercial support available with Oracle Support subscription Community support, may have commercial support options from other vendors Updates and Patches Regular updates with security patches provided by Oracle Updates and patches contributed by the ...
Post a Comment
Read more