what is encapulation?

Answers were Sorted based on User's Feedback



what is encapulation?..

Answer / yohesh rasal

The wrapping up of data and function into a single
unit(called class) is known as encapsulation.

The data is not accessible to the out side word,and only
those functions which are wrapped in the class can access
it.These function provide the interface between the object
data and the program.This insulation of data from direct
access by the program is called data hiding or information
hiding.

Is This Answer Correct ?    32 Yes 1 No

what is encapulation?..

Answer / guest

The wrapping of data and its member functions into a single
unit is called encapsulation.

Is This Answer Correct ?    5 Yes 1 No

what is encapulation?..

Answer / ashish jadhav

hiding non essential details is called encapsulation.
preventing the access of non essential details.

Is This Answer Correct ?    4 Yes 2 No

what is encapulation?..

Answer / hetal

The wrapping of data and its member functions into a single
unit is called encapsulation.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Programming Languages AllOther Interview Questions

Explain three modes in which files can be accessed from python program

0 Answers   Peerless,


I want Ada programming language books. Could anyone post me any link for that?

0 Answers  


In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 &#8804; i0 <i1….< ik-1 &#8804; n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.

1 Answers  


Diff between %let and Call symput?

1 Answers   Accenture,


Which method protects back button to retrieve old value from previous page in Struts.

0 Answers  






Mainly Related to Oracle, DBMS , Oracle Stored Procedures, Functions, Oracle 9i Architecture, Redo logs..., Views,

0 Answers   Indian Overseas Bank,


What is ur porject Architecture? If anyone ask what i have to specify here..

0 Answers  


please any one pass file aid,xpeditor and endeavor tools

0 Answers  


it is a language or tools?

0 Answers  


___ method used to move a recordset pointer in nth position in DAG.

1 Answers  


In OB52 , How to define two open posting period, Like only 5 and 8 posting should be open.. should not open 6 and 7..period..

0 Answers  


What is the maximum amount of memory any single process on Windows can address? Is this different than the maximum virtual memory for the system? How would this affect a system design?

2 Answers  


Categories