Questions for C++

本文精选了C++面试中常见的技术问题,并提供了详细的解答。覆盖了从基本概念到高级特性,如重载与覆写区别、多态实现、字符串复制函数编写、数据结构特性比较等,帮助读者深入理解C++编程语言。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Questions for C++

Name:

Position:

Phone Number:

Time: 2 hours

1. What is overload? What is override? Can we overload functions by various kinds of return values? Why? (5)

a.

overload means there are several functions which have the same name in the same class, the function called operation is determined by the parameters number

override means use the same function name, parameter and return value to override the method of parent class in derived class

b.

No

c.

Overload function called is determined by the parameters, has not the relation to return value. So we can’t differ the overload functions by various kinds of return values

2. What is polymorphism in C++? You could draw a picture to depict your understand. (5)

Polymorphism points to the methods that override the parent class’s method with the same name, parameter and return value.

class CPerson

{

public:

void virtual AboutMe()

{

printf("I am CPerson");

}

}

class CMan : public CPerson

{

public:

void virtual AboutMe()

{

printf("I am CNan");

}

}

class CWoman : public CPerson

{

public:

void virtual AboutMe()

{

printf("I am CWoman");

}

}

void main()

{

CPerson * p = new CPerson();

p->AboutMe(); //I am CPerson

p = new CMan();

p->AboutMe(); //I am CNan

p = new CWoman();

p->AboutMe(); //I am CWoman

}

3. Write function “strcpy” without C++/C string library.(7)

char * strcpy(const char * pSrc, char * pDes)

{

assert(pSrc != NULL && pDes != NULL);

char * pTmp = pDes;

while((*pTmp++ = *pSrc++) != '/0');

return pTmp;

}

4. Describe the following data structures; arrays, linked lists, hash tables and binary trees. How are they different? What are the strengths and weaknesses of each? Give an example of a situation you would use each. (8)

Array is continued block in memory, it can only store the same type data and it’s size is determined while compiling.

Hash table can realize the map between key and value, It also requires a continued memory area when stores data. But it’s data locating utilizes hash code. Good hash code generated algorithm can make the memory utilized ratio very high.

Binary tree is a kind of data structure like tree figure. It can not be continual and it’s size is dynamic. We can realize data sort while utilizing it to store data; it’s time complexity is too low while we search, edit it.

5. Does C++ come with in-built threading support? If yes, how to do that? If no, how can you implement threading support in C++? Please write code piece if needed. (6)

No, C++ does not come with in-built threading support.

6. What is the result of the following program?(7)

#include <iostream.h>
class A
{
public:
A(){cout<<"A::A() called./n";}
virtual ~A(){cout<<"A::~A() called./n";}
};

class B:public A
{
public:
B(int i){
cout<<"B::B() called./n";
buf=new char[i];}
virtual ~B()
{
delete []buf;
cout<<"B::~B() called./n";
}
private:
char *buf;
};

void fun(A *a)
{
delete a;
}

void main()
{
A *a=new B(15);
fun(a);
}

直接执行得到输出结果。

7. What errors are caught at compile time vs link time? Please give at least 2 examples for each situation. (7)

8. The following codes are for 32 bits computers. Please calculate the value of sizeof. (8)

char str[] = "Hello" ;

char *p = str ;

int n = 10;

sizeof(str) = __6________

sizeof(p) = ___4_______

sizeof(n) = ____4______

void Func ( char str[100])

{

sizeof(str) = __4________

}

9. Implement Singleton design pattern with C++.(8)

class CSingleton

{

private:

CSingleton * instance;

CSingleton()

{

instance = NULL;

}

public:

CSingleton * getInstance()

{

if(instance == NULL)

instance = new CSingleton();

return instance;

}

}

10. Please analyze codes and tell what will be the results after running and why. (8)

Code 1:

void GetMemory(char *p)

{

p = (char *)malloc(100);

}

void Test(void)

{

char *str = NULL;

GetMemory(str);

strcpy(str, "hello world");

printf(str);

}

Answer 1:

程序会crash。因为GetMemory()并不能传递动态的内存,Test中的str一直都是NULL,strcpy(str, "hello world")这句将将使程序crash。

Code 2:

char *GetMemory(void)

{

char p[] = "hello world";

return p;

}

void Test(void)

{

char *str = NULL;

str = GetMemory();

printf(str);

}

Answer 2:

程序返回的结果可能是乱码。因为GetMemory()返回的是指向栈内存的指针,该指针的内容不是NULL,但其原先的内容已经被清除,新内容不可知。

11. Is it possible to keep 2 stacks in a single array, if one grows from position one of the array, and the other grows from the last position. Write a procedure PUSH(x, s) that pushes element x onto stack S, where S is one or the other of these two stacks. Include all necessary error checks (15)

12. class String

{

public:

String(const char *str = NULL); // constructor

String(const String &other); // copy constructor

~ String(void); // destructor

String & operate =(const String &other);

private:

char *m_data; // save the string

};

Please write the above four functions. (16)

a.

String::~String(void)

{

delete[] m_data;

}

b.

String::String(const char *str = NULL)

{

if(str == NULL)

{

m_data = new char[1];

m_data[0] = '/0';

}

else

{

m_data = new char[strlen(str) + 1];

strcpy(m_data, str);

}

}

c.

String::String(const String &other)

{

m_data = new char[strlen(other.m_data)+1];

strcpy(m_data, other.m_data);

}

d.

String & String::operate =(const String &other)

{

if(other == &otherL)

return *this;

delete[] m_data;

m_data = new char[strlen(other.m_data)+1];

strcpy(m_data, other.m_data);

return *this;

}

内容概要:文章基于4A架构(业务架构、应用架构、数据架构、技术架构),对SAP的成本中心和利润中心进行了详细对比分析。业务架构上,成本中心是成本控制的责任单元,负责成本归集与控制,而利润中心是利润创造的独立实体,负责收入、成本和利润的核算。应用架构方面,两者都依托于SAP的CO模块,但功能有所区分,如成本中心侧重于成本要素归集和预算管理,利润中心则关注内部交易核算和获利能力分析。数据架构中,成本中心与利润中心存在多对一的关系,交易数据通过成本归集、分摊和利润计算流程联动。技术架构依赖SAP S/4HANA的内存计算和ABAP技术,支持实时核算与跨系统集成。总结来看,成本中心和利润中心在4A架构下相互关联,共同为企业提供精细化管理和决策支持。 适合人群:从事企业财务管理、成本控制或利润核算的专业人员,以及对SAP系统有一定了解的企业信息化管理人员。 使用场景及目标:①帮助企业理解成本中心和利润中心在4A架构下的运作机制;②指导企业在实施SAP系统时合理配置成本中心和利润中心,优化业务流程;③提升企业对成本和利润的精细化管理水平,支持业务决策。 其他说明:文章不仅阐述了理论概念,还提供了具体的应用场景和技术实现方式,有助于读者全面理解并应用于实际工作中。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值