• 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

Diagonal Traversal of Binary Tree

Serialise Deserialise N-ary Tree

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

Maximum sum contiguous subarray of an Array

Cisco Hiring Event 21st – 22nd Feb 2015

25 horses 5 tracks Find 3 fastest puzzle

Knight Tour Problem (Graph – Breadth First Search)

BlueStone E-commerce Interview Experience

strtok()

Find min element in Sorted Rotated Array (With Duplicates)

Print Power Set of a Set

Length of the longest substring without repeating characters

Doubly linked list

Amazon Interview On-Campus For Internship – 1

Connect n ropes with minimum cost

Add Sub Multiply very large number stored as string

Test Cases for Round Function

Find if a binary tree is height balanced ?

Printing Longest Common Subsequence

HackeEarth Flipkart’s Drone

Find min element in Sorted Rotated Array (Without Duplicates)

Introduction To Number Theory ( Part 1 )

Printing each word reverse in string

Common Ancestor in a Binary Tree or Binary Search Tree

Best Java Book | Top Java Programming Book for Beginners

Circular Linked List

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Stock Buy Sell to Maximize Profit

Subset Sum Problem Dynamic programming

Binary Tree in Java

Copyright © 2026 · Genesis Framework · WordPress · Log in