Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

How is data security provided in Object Oriented languages?
?

Answer Posted / ramakrishna yechuri

Data security is provided with the help of
access specifiers called private,protected.
A variable which is declared as private cannot be acceced
outside the class.

Total data is binded or encapsulated in the form of
class.
A class itself is an example for encapsulation.

Is This Answer Correct ?    2 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is class and object with example?

1215


what is the drawback of classical methods in oops?

3428


What is an advantage of polymorphism?

1136


What is the use of oops?

1110


What is abstraction encapsulation?

1191


What is Difference Between Inheritance and creating object and getting data? means Class A extends B{ B.getMethod();} (OR) Class A{ b obj=new B(); obj.getMethod(); }

2691


What is overriding in oops?

1155


Can a destructor be called directly?

1133


What is oops and its features?

1147


Write a java applet that computes and displays the squares of values between 25 and 1 inclusive and displays them in a TextArea box

2675


#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2681


how to get the oracle certification? send me the answer

2203


What are the benefits of interface?

1115


What is the oops and benefits of oops programming?

1027


class type to basic type conversion

2465