Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Making Common Behaviour Abstract
Let us define abstraction "Abstraction means to focus on the necessary, inherent aspects of an entity and ignoring its accidental features". Or we can say, if a set of operations and/or attributes seem to be repeated in two classes. There is a chance of applying inheritance. It is possible that two classes are really specialised variations of something when viewed at a higher level of abstraction.
When general behaviour has been recognised, a common super class can be created which implements the shared features, leaving only specialised features in subclasses. This transformation of the object model is known as abstracting out a common super class or common behaviour. Generally, the resulting super class is abstract, meaning that there are no direct instances of it, but behaviour it defines belongs to all instances of its subclasses. Such as, again we take a draw operation of any geometric figure on display screen requires setup and rendering of geometry. The rendering varies between different figures, such as circles, , spines and lines, but the setup, such as setting the colour, line thickness and other parameters, can be inherited directly by all figure classes from abstract class figure.
The creation of abstract super classes also enhances the extensibility of software product, by keeping space for further addition on base of abstract class
Create a Student database and Retrieve the names of all students majoring in ‘CS' Consider the following relational database: STUDENT (name, student#, class, major) COURSE (co
What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.
What are the categories of SQL command? SQL commands are separated in to the following categories: 1. Data - Definitition Language 2. Data Manipulation language 3. Dat
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
In an E-R diagram an entity set is represent by? In an E-R digram entity set is represted by rectangle.
What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.
We face problem of stock Opening balance and closing balance in Minus
Project Description: Critical Project for VMware Technical support. VMWare ESXi 5.1 support for upgradation and migration problem. Technical expert of Vmware needed. Sk
Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))
what are the limitations of dbms?
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd