• 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

Right view of Binary tree

Printing intermediate Integers between one element & next element of array

Reversal of LinkedList

25 horses 5 tracks Find 3 fastest puzzle

Hackerearth : Counting Subarrays

Given Set of words or A String find whether chain is possible from these words or not

Code Chef PRGIFT Solution

SAP Off Campus Hiring_ March 2015 Computer Skills

Maximum occurred Smallest integer in n ranges

Find if a binary tree is height balanced ?

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Stickler thief

Doubly linked list

VMWare Openings

Count number of ways to reach a given score in a game

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Skiing on Mountains Matrix

Maximum of all subarrays of size k

flattens 2 D linked list to a single sorted link list

Reverse a Linked List in groups of given size

Common Ancestor in a Binary Tree or Binary Search Tree

Python String and numbers

Closed Parentheses checker

Sort Stack in place

BlueStone E-commerce Interview Experience

Fibonacci Hashing & Fastest Hashtable

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Given a float number convert it into the string WITHOUT using any inbuilt Function

How Radix sort works

Copyright © 2026 · Genesis Framework · WordPress · Log in