易安信筆試題分享

時間：2024-08-20 02:52:57 綜合指導(dǎo) 我要投稿

相關(guān)推薦

易安信筆試題分享

　　易安信筆試題分享：

易安信筆試題分享

　　1 protected成員函數(shù)能被腫么調(diào)用

　　2 has-a relationship是指的啥，答案有instance, reference, pointer等……3 int, char, short, long的字節(jié)數(shù)

　　4 在C++中，變量用時聲明是為啥

　　5 命名空間的作用

　　6 int a[10][10];

　　int *b[10];

　　以下哪個正確

　　a[3][4] = 91;

　　b[3][4] = 91;

　　a[1] =NULL;

　　b[1] = a[2];

　　7 12&&10, 12||10, 12&10, 3》1, 3>1的結(jié)果

　　8 x86_64系統(tǒng)下

　　struct

　　{

　　int i;

　　char c;

　　double d;

　　};

　　union

　　{

　　int i;

　　char c;

　　double d;

　　};

　　char s[100];

　　long c;

　　sizeof的值

　　10. An employee has one or two managers, and one manager manages one or more employees. In database conceptual design, the relationship between entity sets employee and manager isA one to one

　　B one to many

　　C many to one

　　D many to many

　　E none of the above

　　11 There are two relations R1（A, B, C） and R2（B, D, E）。 Which of following techniques CANNOT be used to improve the performance of the natural join of the two relations?

　　A make use of multiple parallel processes on a multi-core machine to implement the join algorithmB increase the CPU L2 cache hit ratio of the join algorithm implementationC partition the relations to different machines by using join attributes and execute the join on many machines in parallelD when the number of tuples in R2 is large and the number of tuples in R1 is small, build and index on R1 and use index join methodE none of the above

　　12 Which of the following statements about checkpoints（with log-based recovery schemes） in databases are/is NOT correct?

　　A checkpoints are used to decrease the time used for failure recoveryB checkpoints are done periodically in database to assure ACID properties of transactionsC periodic checkpoints decreased the number of log entries that need to be redone during recoveryD during checkpointing, updated disk blocks are written to diskE none of the above

　　13 There is a huge relation R（A,B,C） of size M and A is the primary key. The tuples in R are sorted by using A and no index is built for R. Each disk block size of b, and each block read takes N seconds. To find a tuple in R with A =17954 the estimated optimized cost isA M*N/b

　　B N*log（M/b）

　　C M*N/（2b）

　　D （M+N）/b

　　E log（M*N）/b

　　14 Which of the following descriptions of reader/writer locks are/is wrong?

　　A caller cannot upgrade its read lock（already obtained） to write lockB caller can downgrade its write lock（already obtained） to read lockC caller can get read lock if there is no write lock held by othersD multiple callers can hold a read lock at the same timeE only one caller can hold a write lock at a time15 兩頁的內(nèi)存，四頁的文件，讀取順序?yàn)?1 2 1 3 1 2 4 2 1 3 1 2 4 2 1 2 3 4 3 1，F(xiàn)IFO，問cache hit ratio為多少16 線程

　　選項 contained with a process

　　share an address space

　　share signals

　　share errno

　　swith的速度比process快

　　17 which one is not above IP

　　DNS, SNMP, HTTP, ARP, NTP

　　18 Map-Reduce Framework

　　19 Buffer overflow

　　20 system virtualization

　　VM, VMM, IO, memory space

　　#include