6.2 筆試真題 & 詳解
選擇題:(有單選題也有多選題,注意理解題意)
1.卡巴斯基那一年正式進(jìn)入中國?
A.2002年
C.2004年
B.2003年
D.2005年
2.卡巴斯基獲得下列那些主要操作系統(tǒng)廠商的認(rèn)證?
A.微軟 Windows系列
B.Suse Linux
C.Rat hat linux
D. android
3.下列那些是卡巴斯基產(chǎn)品的優(yōu)勢(shì)?
A.更新速度第一
B.新威脅響應(yīng)第一
C.惡意程序檢出率第一
4.卡巴斯基主要產(chǎn)品線?
A.卡巴斯基郵件網(wǎng)關(guān)
B.卡巴斯基手機(jī)版
C.卡巴斯基 Windows網(wǎng)絡(luò)版
5.以下那些是網(wǎng)絡(luò)版所具有的功能?
A.客戶端統(tǒng)一病毒庫升級(jí)
B.客戶端統(tǒng)一掃描病毒
C.客戶端統(tǒng)一部署
6.以下那些是卡巴斯基網(wǎng)絡(luò)版
A. kis 2011
B.kav 2010
C.卡巴 6.0加強(qiáng)版
D.卡巴斯基管理工具 8.0
7.以下那些操作系統(tǒng)卡巴斯基 Windows工作站 6.0加強(qiáng)版不支持?
A.Windows 98
B.Windows Nt
C.windows 2000
D.windows 2008
E.windows Xp
F.Suse linux
G.Win 7
H.Vista
8.面對(duì)用戶時(shí),我們需要向用戶了解那些用戶網(wǎng)絡(luò)信息?
A.網(wǎng)絡(luò)規(guī)模
B.網(wǎng)絡(luò)結(jié)構(gòu)
C.電腦操作系統(tǒng)類型
D.主要應(yīng)用
E.購買費(fèi)用預(yù)算
9.下面那項(xiàng)不是卡巴斯基 Windows工作站 6.0加強(qiáng)版的功能模塊?
A.文件反病毒
B.郵件反病毒
C.網(wǎng)頁反病毒
D.反黑客
E.家長(zhǎng)控制
10.客戶端電腦的安裝方式有?
A.遠(yuǎn)程推送安裝
B.web網(wǎng)頁下載安裝
C.FTP或共享下載安裝
D.拷到移動(dòng)設(shè)備到桌面安裝
11.卡巴斯基網(wǎng)絡(luò)版采用了什么軟件架構(gòu)?
A.C/S架構(gòu)
B.B/S架構(gòu)
C.混合架構(gòu)
12.下列那些技術(shù)屬于卡巴獨(dú)有?
A.零時(shí)差防護(hù)技術(shù)
B.增量掃描技術(shù)
C.安全流掃描技術(shù)
D.病毒庫壓縮技術(shù)
問答題:
卡巴斯基網(wǎng)絡(luò)版有那幾種安全解決方案? (10分)
卡巴斯基加強(qiáng)版三個(gè)主要程序模塊構(gòu)成?各個(gè)程序的主要作用? (10分)
網(wǎng)絡(luò)版跟單機(jī)版相比，主要優(yōu)勢(shì)體現(xiàn)在什么地方? (10分)
分別給以下網(wǎng)絡(luò)情況的用戶報(bào)價(jià).(10分)
客戶有 3臺(tái)服務(wù)器，40臺(tái)客戶端，請(qǐng)給出 3年的市場(chǎng)報(bào)價(jià);
客戶有 1臺(tái)服務(wù)器，50個(gè)客戶端 1年的市場(chǎng)報(bào)價(jià);
卡巴斯基的筆試
Please consider the code below:
class Buffer
{
public:
Buffer() : size(0), data(0) {}
Buffer(int s, void* d)
{
if (s <= 0) throw std::invalid_argument();
data = d;
size = s;
}
~Buffer() { delete data; }
void** operator&() { return &data; }
private:
Buffer& operator=(const Buffer&);
int size;
void* data;
}
Does this code has any restrictions, which do not allow to use objects of this class into the std containers (std:vector)? Is yes, please describe them.
Please look at the code:
template void Func2(std::auto_ptr v1, std::auto_ptr v2, std::auto_ptr v3)
{
<…>
}
template bool Func1()
{
try
{
std::auto_ptr p(new T);
Func2(p, std::auto_ptr (new T), std::auto_ptr(new T));
p->SomeMethod();
return true;
}
catch(const std::bad_alloc&)
{
return false;
}
}
Answer the questions:
Do you see any problems in this code?
Is this code an exception safe?
If you see any problems please mark all of them (by using the following style: line of code – description of the problem; for example: “printf(s) – uninitialized variable s”).
There's a major problem in the implementation of the class. Can you spot it? Please mark lines and try to describe the problem briefly.
class Base
{
public:
Base()
{
Init();
}
virtual void Init() = 0;
void Shutdown() throw(std::bad_alloc);
~Base()
{
Shutdown();
}
};
class Derived : public Base
{
public:
Derived();
void Init();
void Shutdown();
~Derived()
{
Shutdown();
}
};
void DoSomething(std::auto_ptr) throw(std::exception);
void f()
{
try
{
std::auto_ptr b(new Derived);
DoSomething(b);
}
catch(const std::exception & e)
{
// ...
}
}
Declare a C++ class for a stack if ints, called Stack_Ints. Your declaration have to include member function for
A default constructor, that creates an empty stack
A void function for push (), that insert new value onto top of stack
A void function for pop (), that removes the value from the top
A function top () that returns the value on “the top of the stack” without stack modification.
A bool function isempty () that returns true if stack is empty
A destructor, that safely gets rid of stack elements.
Implement the code for the class using a linked list plus other desired data members. You will also have to declare a “node” class that is used for the linked list nodes.