单选

●对于一个具有n个结点和e条边的无向图，若采用邻接表表示，则所有边链表中边结点的总数为 (39) 。
(39)

A．2e &n
bsp; B．e/4
C．e／2
D．n+2e

试题出自试卷《2011年程序员考试考前密卷（七）-上午试题》

参考答案

查看试卷详情

相关试题

●When
- a string constant is written in C program，the compiler creates&n
- bsp;(75) of
- characters containing the characters of the string，an
- d terminating it with"＼0". (75) A．a group
- B．an array
- C．a stack
- D．a series
点击查看答案
●
- A disk scheduling mechanism in an operating system causes the disk arm to sweep
- ba
- ckan
- d forth across the disk Surface servicing all requests in its path．This is a (73) ． (73) A．First Come First Serve
- B．Shortest Seek Time First
- C．Scan
- D．None of the above
点击查看答案
● (74) functions with two l
- ayers of protocols．It can connect networks of different speeds and can
- be adapted to an environment as it expands． (74) A．The hub
- B．The bridge
- C．The router
- D．The proxy
点击查看答案
●Which of the following st
- atements a
- bout obje
- ct oriente
- d database is not correct? (72) ． (72) A．Each object has a unique object identify in the system
- B．Encapsulation and inheritance are two important features of object oriented database
- C．A subclass can inherit the attributes and methods of all its superclasses
- D．A supereloss includes the attributes and methods at all subclasses
点击查看答案
●In C progr
- am，all varia
- bles must be (70) before use，usually at the beginning of the fun
- ction before any (71) statements. (70) A．state
- d
- B．writed
- C．illustrated
- D．declared (71) A．operate
- B．active
- C．executable
- D．processing
点击查看答案
●Let R
- and S
- be the relation respe
- ction respectively： Relation R:A B C Relation S:B C
- D 1 2 3 2 3 4 6 7 8 2 3 5 9 7 8 7 8 1 The number of tuples that the result of the expression R∞S(Here if natural join of relations R and S) is (69)
- B．4
- C．7
- D．10
点击查看答案
●In terms of M．J．Flynn'S t
- axonomy，the systolic array falls into&n
- bsp;(68) ． (68) A．SISD
- B．MIMD
- C．MIS
- D
- D．SIMD
点击查看答案
●The Progr
- amming Counter(PC)is normally used to point out&n
- bsp;(67) ． (67) A．Programmed exe
- cution instruction
- B．5The a
- ddress of last execution instruction
- C．The address of current execution instruction
- D．The address of next execution instruction
点击查看答案
●For rel
- ation where primary key contains multiple attri
- butes，no non-key attribute should be fun
- ctionally
- dependent on a part of primary key．This relation R is at least in (66) . (66) A．3NF
- B．2NF
- C．INF
- D．BCNF
点击查看答案
●计算机网络按照其覆盖的地理区域大小可分为 (65) 。
(65)
- A．广域网、校园网、接入网 &n
- bsp; B．广域网、城域网、局域网
- C．校园网、地区网、接入网
- D．电信网、校园网、城域网
点击查看答案

●对于一个具有n个结点和e条边的无向图，若采用邻接表表示，则所有边链表中边结点的总数为 (39) 。(39)

●对于一个具有n个结点和e条边的无向图，若采用邻接表表示，则所有边链表中边结点的总数为 (39) 。
(39)