ENCAPSULATION IN JAVA

Encapsulation



 Encapsulation in Java is a mechanism of wrapping the data (variables) and code acting on the data (methods) together as a single unit. In encapsulation, the variables of a class will be hidden from other classes, and can be accessed only through the methods of their current class.



eg - Capsule is an example of encapsulation.


public class Test {
   private String name;
   private String idNum;
   private int age;

   public int getAge() {
      return age;
   }

   public String getName() {
      return name;
   }

   public String getIdNum() {
      return idNum;
   }

   public void setAge( int newAge) {
      age = newAge;
   }

   public void setName(String newName) {
      name = newName;
   }

   public void setIdNum( String newId) {
      idNum = newId;
   }
}








Comments

Post a Comment

Popular posts from this blog

OBJECT ORIENTED CONCEPTS

Image
OOPS CONCEPTS  The popular object-oriented languages are Java, C#,php, Python,c++ etc. The main aim of object-oriented programming is to implement real-world entities.   Java is object oriented programming language. Object oriented programming features- 1) inheritance 2) encapsulation 3) abstraction 4) polymorphism    - run time polymorphism    - compile time polymorphism 5) association 6) composition 7) aggregation. Object Any entity that has state and behavior is known as an object. For example, a chair, pen, table, keyboard, bike, etc. It can be physical or logical. Class Collection of objects is called class. It is a logical entity. A class can also be defined as a blueprint from which you can create an individual object. Class doesn't consume any space.
Read more

Arrays programms

 Arrays coding round interview programms. 1] BinarySearch package com.hefshine.arrayscw; import java.util.Scanner; public class BinarySearch { int size, search; int mid; void binary() { Scanner sc = new Scanner(System.in); System.out.println("enter size of an array: "); size = sc.nextInt(); System.out.println("enter element of an array "); int[] array = new int[size]; for (int i = 0; i < size ; i++) { array[i] = sc.nextInt(); } System.out.println("enter search :"); search = sc.nextInt(); int first = 0; int last = size - 1; boolean flag = true; while (first <= last) { mid = (first + last) / 2; if (array[mid] == search) { flag = false; System.out.println("element fount at : " + mid); break; } else if (array[mid] < search) { first = mid + 1; } else { last = mid - 1; } } if (flag) { System.out.println("invalid element"); } }...
Read more