av片一区二区三区-av片亚洲-av片免费看-av片免费观看-欧美视频色-欧美视频三区

當(dāng)前位置:高考升學(xué)網(wǎng) > 招聘筆試題 > 正文

2019年易安信筆試題和面試題答案

更新:2023-09-16 09:16:06 高考升學(xué)網(wǎng)

  如下這份易安信筆試題,是一位網(wǎng)友筆試完跟大家分享的,大家敬請(qǐng)關(guān)注!
  1 protected成員函數(shù)能被腫么調(diào)用

  2 “has-a” relationship是指的啥,答案有instance, reference, pointer等。。。

  3 int, char, short, long的字節(jié)數(shù)

  4 在C++中,變量用時(shí)聲明是為啥

  5 命名空間的作用

  6 int a[10][10];

  int b[10];

  以下哪個(gè)正確

  a[3][4] = 91;

  b[3][4] = 91;

  a =NULL;

  b = a;

  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 is

  A 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 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

  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 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

  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 is

  A MN/b

  B Nlog(M/b)

  C MN/(2b)

  D (M+N)/b

  E log(MN)/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 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

  15 兩頁(yè)的內(nèi)存,四頁(yè)的文件,讀取順序?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,問(wèn)cache hit ratio為多少

  16 線程

  選項(xiàng) 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

  21

  #include

  using namespace

  void main()

  {

  cout << “hello world” << endl;

  }

  修改程序,不能修改主程序,使其輸出為

  initiate

  hello world

  destroy

  22 process & thread

  virtual memory space

  kernel register, stack

  fork

  copy-on-write

相關(guān)文章

最新圖文

2020年河北新聞網(wǎng)兩學(xué)一做

時(shí)間:2023-09-18 07:0:24

2020年河北新聞網(wǎng)兩學(xué)一做

時(shí)間:2023-09-15 11:0:59

兩學(xué)一做學(xué)習(xí)教育知

時(shí)間:2023-09-21 06:0:30
主站蜘蛛池模板: 电影宝贝| 韩国三及| 大尺度激情吻戏| 同乐赛鸽公棚| 白洁少妇董汐星空传媒影视| cgtn news| 宋学士濂文言文翻译| 我的亲爱| 韩漫画未删减男同| 露底| 李坤忆| 电影《忠爱无言》| 极品电影网| 影库| 母亲电影韩国完整版免费观看| 二年级拍手歌生字组词| 寡妇4做爰电影| 电影男女| 武林外传一共多少集| 听说 电影| 江苏诗歌网| 麦当娜简历| 喜羊羊电影| 学校要的建档立卡证明| 女儿的朋友4| 邓稼先教学设计一等奖优秀教案| 情欲禁地| 卓别林走路视频| 天下第一楼剧情介绍| 亚里沙| 婴儿几个月添加辅食最好| 张小波简历及个人资料简介| yy五项滚刀骂人套词| 红海行动2虎鲸行动在线播放国语| 欧美一级毛片免费视频| 北风那个吹全集免费观看| 黄视频免费观看网站| 秀人网门户首页| 狗年电影| 电影网1905免费版| 戚继光电影|