• 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

Find next greater number with same set of digits

HackeEarth Flipkart’s Drone

Reliance Jio Software Developer Interview Experience

C++ OOPs Part1

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

SAP Off Campus Hiring_ March 2015 Computer Skills

LeetCode: Binary Tree Maximum Path Sum

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Minimum insertions to form a palindrome

Common Ancestor in a Binary Tree or Binary Search Tree

Client Server C program

Get K Max and Delete K Max in stream of incoming integers

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

Given a string, find the first character which is non-repetitive

Generic Object Oriented Stack with Template

Length of the longest substring without repeating characters

Linked List V/S Binary Search Tree

Print all nodes that are at distance k from a leaf node

Regular Expression Matching

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

Find min element in Sorted Rotated Array (Without Duplicates)

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

flattens 2 D linked list to a single sorted link list

Stock Buy Sell to Maximize Profit

Fibonacci Hashing & Fastest Hashtable

Apriori algorithm C Code Data Mining

Trapping Rain Water

Maximum of all subarrays of size k

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Generate next palindrome number

Copyright © 2026 · Genesis Framework · WordPress · Log in