MCS-024 Object Oriented Technologies and Java Programming Solved Assignment 2019-2020

-

MCS-024 Object Oriented Technologies and Java Programming Solved Assignment 2019-2020

Q1. (a)  Explain basic concepts of Object Oriented Programming? Explain how data hiding is achieved.  
Answer:- Object-Oriented Programming is a methodology or paradigm to design a program using classes and objects. It simplifies the software development and maintenance by providing some concepts:
·         Object - Any entity that has state and behaviour is known as an object. An Object can be defined as an instance of a class.
·         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.
·         Inheritance - When one object acquires all the properties and behaviours of a parent object, it is known as inheritance.
·         Polymorphism - If one task is performed by different ways, it is known as polymorphism. In Java, we use method overloading and method overriding to achieve polymorphism.
·         Abstraction - Hiding internal details and showing functionality is known as abstraction. In Java, we use abstract class and interface to achieve abstraction.
·         Encapsulation - Binding (or wrapping) code and data together into a single unit are known as encapsulation. A java class is the example of encapsulation. Java bean is the fully encapsulated class because all the data members are private here.
Data Hiding - Data hiding is a software development technique specifically used in object-oriented programming (OOP) to hide internal object details (data members). Data hiding ensures exclusive data access to class members and protects object integrity by preventing unintended or intended changes.
Data hiding also reduces system complexity for increased robustness by limiting interdependencies between software components.

 For Rest of Question 👇👇Click below to download👇👇👇👇👇👇👇👇👇



Comments

Post a Comment

Popular posts from this blog

Asymptotic notations

-
  Data Structure The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on machine specific constants,  and doesn’t require algorithms to be implemented and time taken by programs to be compared. Asymptotic notations are mathematical tools to represent time complexity of algorithms for asymptotic analysis.  The following 3 asymptotic notations are mostly used to represent time complexity of algorithms. 1) Θ Notation, 2) Big O Notation, 3) Ω Notation. Click here to learn more
Read more
-
  STACKS in Data Structure A stack is  an abstract data type that holds an ordered, linear sequence of items . In contrast to a queue, a stack is a last in, first out (LIFO) structure. A real-life example is a stack of plates: you can only take a plate from the top of the stack, and you can only add a plate to the top of the stack... Click here to Know more
Read more

Array

-
Image
  An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. For instance, if we want to store the marks scored by a student in 5 subjects, then there’s no need to define individual variables for each subject. Rather, we can define an array which will store the data elements at contiguous memory locations. · array  marks[5]  defines the marks scored by a student in 5 different subjects where each subject marks are located at a particular location in the array i.e.  marks[0]  denotes the marks scored in first subject,  marks[1]  denotes the marks scored in 2nd subject and so on.
Read more