易安信 2021 技术类面试题
小编:管理员 542阅读 2021.09.29
在C++中,变量用时声明是为什么
第2题:
命名空间的作用
第3题:
protected成员函数能被怎么调用
第4题:
int, char, short, long的字节数
第5题:
int a[10][10];
int *b[10];
以下哪个正确
a[3][4] = 91;
b[3][4] = 91;
a[1] =NULL;
b[1] = a[2];
第6题:
12&&10, 12||10, 12&10, 3>>1, 3>1的结果
第7题:
x86_64系统下
struct
{
int i;
char c;
double d;
};
union
{
int i;
char c;
double d;
};
char s[100];
long c;
sizeof的值
第8题:
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 is
A one to one
B one to many
C many to one
D many to many
E none of the above
第9题:
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 algorithm
B increase the CPU L2 cache hit ratio of the join algorithm implementation
C partition the relations to different machines by using join attributes and execute the join on many machines in parallel
D 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 method
E none of the above
第10题:
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 recovery
B checkpoints are done periodically in database to assure ACID properties of transactions
C periodic checkpoints decreased the number of log entries that need to be redone during recovery
D during checkpointing, updated disk blocks are written to disk
E none of the above
第11题:
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 is
A M*N/b
B N*log(M/b)
C M*N/(2b)
D (M+N)/b
E log(M*N)/b
第12题:
Which of the following descriptions of reader/writer locks are/is wrong?
A caller cannot upgrade its read lock(already obtained) to write lock
B caller can downgrade its write lock(already obtained) to read lock
C caller can get read lock if there is no write lock held by others
D multiple callers can hold a read lock at the same time
E only one caller can hold a write lock at a time
第13题:
两页的内存,四页的文件,读取顺序为 1 2 1 3 1 2 4 2 1 3 1 2 4 2 1 2 3 4 3 1,FIFO,问cache hit ratio为多少
第14题:
which one is not above IP
DNS, SNMP, HTTP, ARP, NTP
第15题:
#include
using namespace
void main()
{
cout << “hello world” << endl;
}
修改程序,不能修改主程序,使其输出为
initiate
hello world
destroy
第16题:
spinlock 与mutex
1. explain
2. write the struct definition of spinlock and mutex
3. write the release function of mutex
4. implement the reader/writer locks
相关推荐
- 德尔福 2021 技术类面试题 第1题:The difference between Traditional EEPROM and Emulation EEPROM?第2题:Talk about Big-endian and little-endian.十六进制数F652在Big-endian 和 little-endian时 分别是怎么存储的?第3题:#define COUNT(x) (x*x*x){ int x=6; COUNT(++…
- 易安信 2021 技术支持面试题 第1题:What is a file system? List all types of file system that you know.第2题: What is the benefit of STP? List all types of STP that you know and describe them one by one.第3题:How to change the root password on a Linux system?第4题:…
- 经典笔试题-JDBC及Hibernate篇 五、JDBC 及Hibernate:(共12 题:基础10 道,中等难度2 道)110、数据库,比如100 用户同时来访,要采取什么技术解决?【基础】 答:可采用连接池。111、什么是ORM?【基础】 答:对象关系映射(Object—Relational Mapping,简称ORM)是一种为了解决面向对象…