n,則這種技術(shù)叫做(1),若m>n,且n=1,則這種技術(shù)這叫做(2)。(1)A.動態(tài)地址翻譯B.靜態(tài)地址翻譯C.地址偽裝D.地址變換(2)A.動態(tài)地址翻譯B.靜態(tài)地址翻譯C.地址偽裝D.地址變換" />

黄色大片免费在线观看,国产免费啪啪,在线亚洲欧洲,91视频男人的天堂,日韩在线播放一区,一级特黄录像播放,综合久久91

軟題庫 學習課程
試卷年份2014年上半年
試題題型【單選題】
試題內(nèi)容

NAT技術(shù)解決了IPv4地址短缺的問題,假設(shè)內(nèi)網(wǎng)的地址數(shù)是m,而外網(wǎng)地址數(shù)n,若m>n,則這種技術(shù)叫做(1),若m>n,且n=1,則這種技術(shù)這叫做(2)。
(1)A.動態(tài)地址翻譯
B.靜態(tài)地址翻譯
C.地址偽裝
D.地址變換
(2)A.動態(tài)地址翻譯
B.靜態(tài)地址翻譯
C.地址偽裝
D.地址變換

查看答案

相關(guān)試題

49題: IEEE802.11規(guī)定了多種WLAN通信標準,其中( )與其他標準采用的頻段不同,因而不能兼容。
A.IEEE802.11a
B.IEEE802.11b
C.IEEE802.11g
D.IEEE802.11n
答案解析與討論:www.jycxcx.com/st/2382817955.html

50題: IEEE802.11定義的AdHoc網(wǎng)絡是由無線移動結(jié)點組成的對等網(wǎng),這種網(wǎng)絡的特點是(1),在這種網(wǎng)絡中使用的DSDV(Destination-sequencedDistancevector)路由協(xié)議是一種(2)。
(1)A.每個結(jié)點既是主機,又是交換機
B.每個結(jié)點既是主機,又是路由器
C.每個結(jié)點都必須通過中心結(jié)點才能互相通信
D.每個結(jié)點都發(fā)送IP廣播包來與其他結(jié)點通信
(2)A.洪泛式路由協(xié)議
B.隨機式路由協(xié)議
C.鏈路狀態(tài)路由協(xié)議
D.距離矢量路由協(xié)議
答案解析與討論:www.jycxcx.com/st/2382926421.html

51題: OSPF協(xié)議將其管理的網(wǎng)絡劃分為不同類型的若干區(qū)域(Area),其中標準區(qū)域特點是(1);存根區(qū)域(stub)的特點是(2)。
(1)A.不接受本地AS之外的路由信息,也不接受其他區(qū)域的路由匯總信息
B.不接受本地AS之外的路由信息,對本地AS之外的目標采用默認路由
C.可以接收任何鏈路更新信息和路由匯總信息
D.可以學習其他AS的路由信息,對本地AS中的其他區(qū)域采用默認路由
(2)A.不接受本地AS之外的路由信息,也不接受其他區(qū)域的路由匯總信息
B.不接受本地AS之外的路由信息,對本地AS之外的目標采用默認路由
C.可以接收任何鏈路更新信息和路由匯總信息
D.可以學習其他AS的路由信息,對本地AS中的其他區(qū)域使用默認路由
答案解析與討論:www.jycxcx.com/st/2383027389.html

53題: CIDR技術(shù)解決了路由縮放問題,例如2048個C類網(wǎng)絡組成一個地址塊,網(wǎng)絡號從192.24.0.0~192.31.255.0這樣的超網(wǎng)號應為(1),其地址掩碼應為(2)。
(1)A.192.24.0.0
B.192.31.255.0
C.192.31.0.0
D.192.24.255.0
(2)A.255.255.248.0
B.255.255.255.0
C.255.255.0.0
D.255.248.0.0
答案解析與討論:www.jycxcx.com/st/2383224030.html

54題: 網(wǎng)絡系統(tǒng)設(shè)計過程中,物理網(wǎng)絡設(shè)計階段的任務是( )。
A.依據(jù)邏輯網(wǎng)絡設(shè)計的要求,確定設(shè)備的具體物理分布和運行環(huán)境
B.分析現(xiàn)有網(wǎng)絡和新網(wǎng)絡的各類資源分布,掌握網(wǎng)絡所處的狀態(tài)
C.根據(jù)需求規(guī)范和通信規(guī)范,實施資源分配和安全規(guī)劃
D.理解網(wǎng)絡應該具有的功能和性能,最終設(shè)計出符合用戶需求的網(wǎng)絡

答案解析與討論:www.jycxcx.com/st/2383312964.html

55題:

The traditional way of allocating a single channel among multiple competing users is to chop up its (1) by using one of the multiplexing schemes such as FDM (Frequency
Division Multiplexing). If there are N users, the bandwidth is divided into N equal-sized portions, with each user being assigned one portion. Since each user has a private frequency (2), there is no interference among users.When there is only a small and constant number of users, each of which has a steady stream or a heavy load of (3), this division is a simple and efficient allocation mechanism. A wireless example is FM radio stations. Each station gets a portion of the FM band and uses it most of the time to broadcast its signal.However, when the number of senders is large and varying or the traffic is (4), FDM presents some problems. If the spectrum is cut up into N regions while fewer than N users are currently interested in communicating, a large piece of valuable spectrum will be wasted. If more than N users want to communicate, some of them will be denied (5) for lack of bandwidth.??
(1)A.capability   
B.capacity   
C.ability  
D.power
(2)A.band   
B.range  
C.domain   
D.assignment
(3)A.traffic   
B.date   
C.bursty  
D.flow
(4)A.continuous   
B.steady   
C.bursty   
D.flow
(5)A.allowance  
B.connection   
C.percussion  
D.percussion

答案解析與討論:www.jycxcx.com/st/2383421378.html