NivaarExam PrepOfficial exam papers ↗

25-Comp-B11 Advanced Software Design · Undated paper

Question 24 of 28: Sample Code for Polymorphism, Dynamic Binding, Overloading, and Overriding

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

Notes on this paper

17-Comp-B11 Advanced Software Design — National Exams, May 2019. 3 hours, closed book exam with two aid sheets allowed (written on both sides), no calculator permitted. The paper is organized into five parts, and candidates were instructed to answer any five (5) questions in Part I, any three (3) in Part II, any four (4) in Part III, any two (2) in Part IV, and any five (5) in Part V — only the first questions answered, in each part, as they appear in the answer book are marked. All questions carry equal weight, so the 19 questions actually marked (5+3+4+2+5 of 28) each count for 100/19 ≈ 5.26% of the paper. All 28 questions are answered below for completeness.

Reference texts: Sommerville, Software Engineering (10th ed., Pearson) — software processes, requirements engineering, design principles, testing, dependability, reuse; Pressman, Software Engineering: A Practitioner's Approach (9th ed.) — supplementary process/metrics/quality coverage; Gamma, Helm, Johnson & Vlissides (GoF), Design Patterns: Elements of Reusable Object-Oriented Software — pattern-language structure, the GoF pattern catalogue, and the "favor object composition over class inheritance" / "program to an interface, not an implementation" principles; Sebesta, Concepts of Programming Languages (12th ed.) — polymorphism, dynamic binding, visibility, encapsulation, interfaces; Bertrand Meyer, Object-Oriented Software Construction — design by contract, preconditions/postconditions/class invariants; Barbara Liskov's 1987 substitutability paper for Question 12; Stroustrup, The C++ Programming Language, for friend/access-control semantics (Question 25).

Question 12 prints “Liskpv substitution principle”, a typo in the paper; it is answered as the Liskov substitution principle.

PART I — General Principles (answer any 5 of 7)

Question 24: Sample Code for Polymorphism, Dynamic Binding, Overloading, and Overriding (Part V)

Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.

Polymorphism is the ability of a single name (here, a Shape reference) to refer to objects of more than one type. Dynamic binding is the runtime mechanism that resolves shape.area() to the actual overriding method based on the object's real type. Overriding is Circle/Square each supplying their own area() with the identical signature declared in Shape. Overloading is describe() appearing twice with different parameter lists, resolved at compile time.

abstract class Shape {
    abstract double area();                 // overridden below
}
class Circle extends Shape {
    double radius;
    Circle(double r) { radius = r; }
    double area() { return Math.PI * radius * radius; }   // OVERRIDING
}
class Square extends Shape {
    double side;
    Square(double s) { side = s; }
    double area() { return side * side; }                 // OVERRIDING
}
class Printer {
    void describe(Shape s) {                               // OVERLOADED #1
        System.out.println("Shape area: " + s.area());
    }
    void describe(String label, Shape s) {                 // OVERLOADED #2
        System.out.println(label + " area: " + s.area());
    }
}
// POLYMORPHISM + DYNAMIC BINDING:
Shape[] shapes = { new Circle(2.0), new Square(3.0) };
Printer p = new Printer();
for (Shape shape : shapes) {
    p.describe(shape);   // shape.area() dispatches at RUNTIME to Circle.area() or Square.area()
}

The shapes array holds references of the single declared type Shape (polymorphism), yet each call to shape.area() inside the loop resolves at runtime to whichever concrete subclass's overriding method the object actually is (dynamic binding) — whereas the choice between describe(Shape) and describe(String, Shape) is settled by the compiler from the number/type of arguments at the call site (overloading), with no runtime dispatch involved at all.