【名词&注释】
二叉排序树(binary sort tree)、网络时代(network times)、商业模式(business model)、设计方案(design scheme)、主要功能(main function)、绝对值(absolute value)、数据仓库功能
[单选题]商业智能描述了一系列的概念和方法，通过应用基于事实的支持系统辅助制定商业决策，商业智能的主要功能不包括( )。
A. 数据使用培训(数据使用方法论的创建，宣贯和实施落地)
B. 数据ETL(数据的抽取，转换和加载)
C. 数据统计输出(统计报表的设计和展示)
D. 数据仓库功能(数据存储和访问)
查看答案&解析
举一反三：
[单选题]电子商务是网络时代的( )。
A. 生活模式
B. 商业模式
C. 学习模式
D. 工作模式
[单选题]由元素序列{27，16，75，38，51}构造平衡二叉树，则首次出现的最小不平衡子树的根(即离插入节点最近且平衡因子的绝对值(absolute value)为2的节点)为(9)。
A. 27
B. 38
C. 51
D. 75
[多选题]●Border Gateway Protocol(BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) ．A router that recevives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an Internet is usually too big for this routing method. To use link state routing for the whole internet would require each routex to have a huge link state database. It would also take a long time for each router to calculate its rousting (75) using the Dijkstra algorism.（71）
A. routing
B. switching
C. transmitting
D. receiving
E. (72)
F. path
G. hop `
H. route
I. packet
J. (73）
K. connection
L. window
M. source
N. destination
O. (74)
P. status
Q. search
R. state
S. research
T. (75）
U. table
V. state
W. metric
X. cost
[单选题]信息系统设计招标中，评标、决标考虑的因素主要是(49)。
A. 设计方案的优劣
B. 设计任务完成的进度
C. 设计取费的标准
D. 设计单位的资历
本文链接：https://www.zhukaozhuanjia.com/download/vrq0vy.html
