• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Interfaces in C++ (Abstract Classes in C++)

November 5, 2014 by Dhaval Dave

Capabilities of a C++ class without committing to a particular implementation of that class.
The C++ interfaces are implemented using abstract classes

A class is made abstract by declaring at least one of its functions as pure virtual function. A pure virtual function is specified by placing “= 0” in its declaration as follows:

class Shape 
{
public:
// pure virtual function providing interface framework.
virtual int getArea() = 0;
void setWidth(int w)
{
width = w;
}
void setHeight(int h)
{
height = h;
}
protected:
int width;
int height;
};

The purpose of an abstract class is to provide an appropriate base class from which other classes can inherit. Abstract classes cannot be used to instantiate objects and serves only as an interface. Attempting to instantiate an object of an abstract class causes a compilation error.

Thus, if a subclass of an ABC needs to be instantiated, it has to implement each of the virtual functions, which means that it supports the interface declared by the ABC. Failure to override a pure virtual function in a derived class, then attempting to instantiate objects of that class, is a compilation error.

Classes that can be used to instantiate objects are called concrete classes.

// Derived classes
class Rectangle: public Shape
{
public:
int getArea()
{
return (width * height);
}
};
class Triangle: public Shape
{
public:
int getArea()
{
return (width * height)/2;
}
};

int main(void)
{
Rectangle Rect;
Triangle Tri;

Rect.setWidth(5);
Rect.setHeight(7);
// Print the area of the object.
cout
<< "Total Rectangle area: " << Rect.getArea() << endl;

Tri.setWidth(5);
Tri.setHeight(7);
// Print the area of the object.
cout
<< "Total Triangle area: " << Tri.getArea() << endl;

return 0;
}

When the above code is compiled and executed, it produces the following result:

Total Rectangle area: 35
Total Triangle area: 17

Similar Articles

Filed Under: problem Tagged With: c

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Calculate price of parking from parking start end time prices

BlueStone E-commerce Interview Experience

Find the smallest window in a string containing all characters of another string

Leetcode: Edit Distance

Difference between a LinkedList and a Binary Search Tree BST

Connect n ropes with minimum cost

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Find if a binary tree is height balanced ?

Coin Collection Dynamic Programming

Practo Hiring Experience

Urban Ladder Written Test.

SAP Interview Questions

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Check if an array has duplicate numbers in O(n) time and O(1) space

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Binary Tree in Java

Search element in a matrix with all rows and columns in sorted order

LeetCode: Container With Most Water

Trapping Rain Water

Code Chef PRGIFT Solution

The greedy coins game Dynamic Programming

K’th Largest Element in BST when modification to BST is not allowed

Skiing on Mountains Matrix

Reverse a Linked List in groups of given size

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Find min element in Sorted Rotated Array (With Duplicates)

Daughter’s Age VeryGood Puzzle

Leetcode: Merge Intervals

Apriori algorithm C Code Data Mining

Possible sizes of bus to carry n groups of friends

Copyright © 2025 · Genesis Framework · WordPress · Log in