Know yourself, others and the world ™️

SUPERSET

POSTERIOR

C++ Programming

Questionnaire Completed Successfully

Thank you for completing this questionnaire. Your results have been saved.

Ready to begin?

This questionnaire contains 2 problems.

Provide Your Information

First Name:

Phone Number:

Questionnaire Completed Successfully!

Thank you for your responses. Your questionnaire has been successfully completed and submitted.

Problem 1 of 2

Diamond Problem

Given inputs

N0sDo/JYlzrozAp8UwMOfwoBr0qfvsTrCv3aZT0I0mXl75tiaQ6vR3b7uU4BDKdKJ5e2Cwh/SLh9+PyxTqdoomFyDQcEG/jJxkP1bKdhrCnEMMM+wGm+ImTKC8RnROnIwWkCmrIZ0T/sm2sjFzGyjmCLMjme7EIvAlCGBWAlEhzJVKiIDwCtceltorcHKDKx63eGlu7g1GO3zFVzEqrmL4NeGgwDlR8pvIaZBsIYVyP7agbzYirb8U6VPXLcH6lTU1Pe6Fty12sjjg9efcfS+X73eNkKcmxEQEevqDrB+63F3ZmorpDN/kTl5Ml1hU1v9sSkRQ9hyT2vVyvCOUVDZrtk/CErVA+yd/3mM5UkkeNmledBMsjdhS76cgMUm8VhFcmXSTs5QVY5iJIBaveZjoNE7gZ2W3bUmnq1JMDuXR0tH8rdy7f80OLCUVwFfgklTC36+5EZvqeDG24ZWoK1ymPa2Uz5PmFUNffuymtJbcU3PIb338RsbQZW/osNYJ8irII5208olIkEW/ND5T2BLg==

You have a class MarketMachine that has two children Bond and Stock. These inturn are parent classes for the ConvertibleBond class.

You want to call the ConvertibleBond method price().

Requirements

Price the convertible bond without experiencing the Diamond Problem.

Test cases

Output

Code interpreter

Language

Output

Notes

Note: Click and hold to view problem and solutions.

Circular Counting Problem

Solutions for this problem:

Weak Pointer — The Investor Saviour

Diamond Problem

Givens:

You have a class MarketMachine that has two children Bond and Stock. These inturn are parent classes for the ConvertibleBond class.

You want to call the ConvertibleBond method price().

Requirements:

Price the convertible bond without experiencing the Diamond Problem.

C++ structure

#include <iostream>

class MarketMachine{
    int price(){
        return 0;
    };
};

class Stock: public MarketMachine{
    public:
        int price(){
            return 15;
        };
};

class Bond: public MarketMachine{
    public:
        int price(){
            return 5;
        };
};

class ConvertibleBond: public Stock, public Bond{
};

class Solution{
   public:
   int solve(){
        ConvertibleBond cb;
		return cb.price();
	};
};

Test cases

Output
```
10
```

Handling Multiple Inheritances

Answer

#include using namespace std; class MarketMachine { public: virtual int price() { return 0; } }; class Stock : public MarketMachine { public: int price() override { return 15; } }; class Bond : public MarketMachine { public: int price() override { return 5; } }; class ConvertibleBond : public Stock, public Bond { public: int price() { Stock s; Bond b; return (s.price() + b.price()) / 2; } }; class Solution { public: int solve() { ConvertibleBond cb; return cb.price(); } };

Circular Counting Problem

Givens:

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758

// Circular Counting Dependency pathological case example //

#include <iostream>
#include <vector>
#include <memory>
using namespace std;

class Fund; // TODO: Forward declaration.

class Investor{
    public:
        // Attributes.
        string name;
        vector<shared_ptr<Fund>> myFunds;
        // Methods.
        Investor(string name) {
          cout << name + " created." << endl;
          name = name;
        }
        ~Investor(){
          cout << name + " destroyed." << endl;
        }
};        

class Fund{
    public:
        // Attributes
        string name;
        vector<shared_ptr<Investor>> investors;
        // Methods
        Fund() {
          cout << name + " launched." << endl;
        }
        ~Fund() {
          cout << name + " closed." << endl;
        }
        void getNoOfInvestor(){
            cout << investors.size() << endl;
        }
};




int main()
{
    shared_ptr<Fund> indiaFund = make_shared<Fund>();
    shared_ptr<Fund> pakistanFund = make_shared<Fund>();
    shared_ptr<Investor> rajSharma = make_shared<Investor>("Raj");
    rajSharma->myFunds.push_back(indiaFund);
    pakistanFund->investors.push_back(rajSharma);
    rajSharma->myFunds.push_back(pakistanFund);
    cout << rajSharma.use_count() << endl;
    rajSharma.reset(); // Acts on pointer.
    cout << rajSharma.use_count() << endl;    
    cout << indiaFund->investors.front()->name << endl; // :)
    return 0;
}

Requirements:

The problem: impossible to unsubscribe investor from a fund, even if he is dying to get out. Sounds like a feature? No — it is a bug. So let’s fix it.

Weak Pointer — The Investor Saviour

Answer

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162

// Circular Counting Dependency resolution example //

#include <iostream>
#include <vector>
#include <memory>
using namespace std;

class Fund; // Forward declaration.

class Investor{
    public:
        // Attributes.
        string name;
        vector<weak_ptr<Fund>> myFunds;
        // Methods.
        Investor(string name = "Investor") : name(name){
            cout << "Creating " + name + "."<< endl;
        };
        ~Investor(){
            cout << "Destroying " + name + "." << endl;
        };
};

class Fund{
    public:
        // Attributes
        string name;
        vector<weak_ptr<Investor>> investors;
        // Methods
        Fund(string name) : name(name) {
            cout << "Established fund " + name + "." << endl;
        };
        ~Fund(){
            cout << "Destroyed fund " + name + "." << endl;
        };
        void getNoOfInvestor(){
            cout << name + " has " + to_string(investors.size()) + " investors." << endl;
        }
};

int main()
{
    shared_ptr<Fund> indiaFund = make_shared<Fund>("India Fund");
    weak_ptr<Fund> weakIndiaFund(indiaFund);
    shared_ptr<Fund> pakistanFund = make_shared<Fund>("Pakistan Fund");
    weak_ptr<Fund> weakPakistanFund(pakistanFund);
    shared_ptr<Investor> rajSharma = make_shared<Investor>("Raj Sharma");
    weak_ptr<Investor> weakRajSharma(rajSharma);
    weakIndiaFund.lock()->investors.push_back(weakRajSharma);
    weakRajSharma.lock()->myFunds.push_back(weakIndiaFund);
    weakPakistanFund.lock()->investors.push_back(weakRajSharma);
    weakRajSharma.lock()->myFunds.push_back(weakPakistanFund);
    indiaFund->getNoOfInvestor();
    pakistanFund->getNoOfInvestor();
    cout << weakRajSharma.lock().use_count() << endl;
    rajSharma.reset(); // Acts on pointer.
    cout << weakRajSharma.lock().use_count() << endl;    
    cout << weakIndiaFund.lock()->investors.front().lock()->name << endl; // :)
    indiaFund->getNoOfInvestor();
    pakistanFund->getNoOfInvestor();    
    return 0;
}

PRIOR

SUBSET

Conflict

Discard your changes?

Warning

Login

Forgot Password

Registration

Conflict

Discard your changes?

Warning

C++ Programming

Questionnaire Completed Successfully

Ready to begin?

Provide Your Information

Questionnaire Completed Successfully!

Diamond Problem

Given inputs

Requirements

Test cases

Code interpreter

Output

Notes

Circular Counting Problem

Solutions for this problem:

Diamond Problem

Givens:

Requirements:

C++ structure

Test cases

Handling Multiple Inheritances

Answer

Circular Counting Problem

Givens:

Requirements:

Weak Pointer — The Investor Saviour

Answer