sap筆試試題

時(shí)間：2024-08-13 15:59:50 面試筆試我要投稿

相關(guān)推薦

sap筆試試題

　　1.below is usual way we find one element in an array:

sap筆試試題

　　const int ＊find1(const int＊ array, int n, int x)

　　{

　　const int＊ p = array;

　　for(int i = 0; i < n; i++)

　　{

　　if(＊p x)

　　{

　　return p;

　　}

　　++p;

　　}

　　return 0;

　　}

　　in this case we have to bear the knowledge of value type "int", the size of

　　array,

　　even the existence of an array. would you re-write it using template to elim

　　inate all

　　these dependencies?

　　2. assume you have a class like

　　class erp

　　{

　　hr＊ m_hr;

　　fi＊ m_fi;

　　public:

　　erp()

　　{

　　m_hr = new hr();

　　m_fi = new fi();

　　}

　　~erp()

　　{

　　}

　　};

　　if "new fi()" failed in the constructor, how can you detect this problem and

　　release the

　　properly allocated member pointer m_hr?

　　3. check the class and variable definition below:

　　#include

　　using namespace std;

　　class base

　　{

　　public:

　　base() { cout<<"base-ctor"< ~base() { cout<<"base-dtor"< virtual void f(int) { cout<<"base::f(int)"< virtual void f(double) {cout<<"base::f(double)"< virtual void g(int i = 10) {cout<<"base::g()"<};

　　class derived: public base

　　{

　　public:

　　derived() { cout<<"derived-ctor"< ~derived() { cout<<"derived-dtor"< void f(complex) { cout<<"derived::f(complex)"< virtual void g(int i = 20) {cout<<"derived::g()"<};

　　base b;

　　derived d;

　　base＊ pb = new derived;

　　select the correct one from the four choices:

　　cout

　　pb->f(1.0);

　　a.derived::f(complex) b.base::f(double)

　　pb->g();

　　a.base::g() 10 b.base::g() 20

　　c.derived::g() 10 d.derived::g() 20

　　4.implement the simplest singleton pattern(initialize if if necessary).

　　5.name three sort algorithms you are familiar with. write out the correct or