Question 1:

Which of the following statements below best describe the process identifier that is used to run OSPF on a router? (Choose two)

A – It is an optional parameter required only if multiple OSPF processes are running on the router

B – It is locally significant

C – It is needed to identify a unique instance of an OSPF database

D – All routers in the same OSPF area must have the same process ID if they are to exchange routing information

Answer: B C

Question 2:

Why R1 can’t establish an OSPF neighbor relationship with R3 according to the following graphic? (Choose two)

A – Configure EIGRP on these routers with a lower administrative distance

B – All routers should be configured for backbone Area 1

C – R1 and R3 have been configured in different areas

D – The hello and dead interval timers are not configured the same values on R1 and R3

Answer: C D

Explanation:

A is not correct because configure EIGRP on these routers (with a lower administrative distance) will force these routers to run EIGRP, not OSPF.

B is not correct because the backbone area of OSPF is always Area 0.

C and D are correct because these entries must match on neighboring routers:

- Hello and dead intervals

– Area ID (Area 0 in this case)

– Authentication password

– Stub area flag

Question 3:

Which items are correct about the routing protocol OSPF? (Choose three)

A – Support VLSM

B – Increase routing overhead on the network

C – Confine network instability to one area of the network

D – Allow extensive control of routing updates

Answer: A C D

Explanation:

Routing overhead is the amount of information needed to describe the changes in a dynamic network topology. All routers in an OSPF area have identical copies of the topology database and the topology database of one area is hidden from the rest of the areas toreduce routing overhead because fewer routing updates are sent and smaller routing trees are computed and maintained (allow extensive control of routing updates and confine network instability to one area of the network).

Question 4:

Which three features are of OSPF routing protocol? (Choose three)

A – Converge quickly

B – OSPF is a classful routing protocol

C – Identify the best route by use of cost

D – Before exchanging routing information, OSPF routers find out neighbors

Answer: A C D

Question 5:

OSPF routing uses the concept of areas. What are the characteristics of OSPF areas? (Chose three)

A – Each OSPF area requires a loopback interface to be configured

B – Areas may be assigned any number from 0 to 65535

C – Area 0 is called the backbone area

D – Hierarchical OSPF networks do not require multiple areas

E – Multiple OSPF areas must connect to area 0

F – Single area OSPF networks must be configured in area 1

Answer: B C E

Explanation:

I used to think the answers should be C D E and here is my explanation:

OSPF can use an active interface for its router ID, so a loopback interface is not a must -> A is incorrect.

OSPF Area is a 32-bit number so we can use up to 232 – 1 = 4294967296 – 1 (since Area 0 is the first area). Remember that only process ID is a 16-bit number and ranges from 1 to 65535 -> B is incorrect.

F is incorrect too because single area OSPF netwoks must be configured in Area 0, which is called the backbone area.

For answer D, it is a bit hard to guess what they want to say about “hierarchical” but we should understand “Hierarchical OSPF networks” as “OSPF networks”. D is correct bercause we can only have one area (area 0 – the backbone area) for our networks.

But TT commented on 01-11-2010:

Especially to note on choice B, D, and E:

Choice B: we all know that The areas can be any number from 0 to 4.2 billion and 1 to 65,535 for the Process ID. As choice B specifies ‘area’ (be aware, it’s not saying ‘process id), there is no reason to say that we cannot assign numbers from 0 to 65535 for area # (it is using ‘may be’, not ‘have to be’ or ‘ought to be’). Hence, we do not worry about assigning ’0′.

Choice E: as Area 0 is the backbone, we all understand that any areas in a OSPF network have to be connected to it. And actually this is implicitly saying that multiple areas form a hierarchical OSPF network, as Area 0 being a root and others being its leaves.

Choice D: when it specifies ‘Hierarchical’, at least 2 areas should be required to form such topology (of course that includes Area 0)

Although Choice B is not an absolutely accurate statement since it not only can be assigned up to 65535, it is still a correct answer. And again, it specifies ‘area’, not ‘process id’, so ’0′ can be included. Finally, it would be meaningless to call OSPF a hierarchical network if no more than one area is present.

—————————————————————————————————-

I reviewed the question and think it is a more suitable solution with choice B than choice D, surely it is a tricky question!

Question 6:

Part of the OSPF network is shown below:

Configuration exhibit:

R1 routing commands:

ip route 0.0.0.0 0.0.0.0 serial0/0

router ospf 1

network 172.16.100.0 0.0.0.3 area 0

network 172.16.100.64 0.0.0.63 area 0

network 172.16.100.128 0.0.0.31 area 0

default-information originate

You work as a network technician, study the exhibits carefully. Assume that all router interfaces are operational and correctly configured. In addition, assume that OSPF has been correctly configured on router R2. How will the default route configured on R1 affect the operation of R2?

A – Any packet destined for a network that is not directly connected to router R2 will be dropped immediately

B – Any packet destined for a network that is not directly connected to router R1 will be dropped

C – Any packet destined for a network that is not directly connected to router R2 will be dropped immediately because of the lack of a gateway on R1

D – The network directly connected to a router R2 will not be able to communicate with the 172.16.100.0, 172.16.100.28 and 172.16.100.64 subnetworks.

E – Any packet destined for a network that is not referenced in the routing table of router R2 will be directed to R1. R1 will then send that packet back to R2 and a routing loop will occur

Answer: E

Explanation:

First, notice that the more-specific routes will always be favored over less-specific routes regardless of the administrative distance set for a protocol. In this case, because we use OSPF for three networks (172.16.100.0 0.0.0.3, 172.16.100.64 0.0.0.63, 172.16.100.128 0.0.0.31) so the packets destined for these networks will not be affected by the default route.

The default route configured on R1 “ip route 0.0.0.0 0.0.0.0 serial0/0″ will send any packet whose destination network is not referenced in the routing table of router R2 to R1, it doesn’t drop anything so answers A, B and C are not correct. D is not correct too because these routes are declared in R1 and the question says that “OSPF has been correctly configured on router R2″, so network directly connected to router R2 can communicate with those three subnetworks.

As said above, the default route configured on R1 will send any packet destined for a network that is not referenced in its routing table to R2; R2 in turn sends it to R1 because it is the only way and a routing loop will occur.

最短路径树 php,CCNA-开放式最短路径优先(OSPF)真实考题相关推荐

  1. 最短路径树(SPT)介绍及matlab代码

    文章目录 前言 一.最短路径树是什么? 二.最短路径树的算法 1.Dijkstra算法(我比较常用和喜欢的算法) 2.Floyd算法 总结 前言   最短路径树是路由算法设计中常用到的一种树,往往我们 ...

  2. OSPF(Open Shortest Path First开放式最短路径优先)

    **协议** OSPF(Open Shortest Path First开放式最短路径优先)是一个内部网关协议(Interior Gateway Protocol,简称IGP),用于在单一自治系统(a ...

  3. 互联网协议 — OSPF 开放式最短路径优先协议

    目录 文章目录 目录 OSPF OSPF 的网络架构 支持的网络类型 DR/BDR 选举 OSPF 支持区域的划分,可以缩小路由器的 LSDB 规模,减少网络流量. OSPF 区域内部的路由器使用 S ...

  4. ospf(开放式最短路径优先协议)

    OSPF:开放式最短路径优先协议---标准的链路状态协议 一.基本概念 无类别链路状态路由协议---组播更新协议:224.0.0.5/6     触发更新.周期更新(30min):  跨层封装到网络层 ...

  5. OSPF开放式最短路径优先

    OSPF(Open Shortest Path First开放式最短路径优先),属于内部网关协议. 动态的LS(link-state---链路状态)路由协议---在邻居之间传递LSA(链路状态通告), ...

  6. OSPF(Open Shortest Path First)开放式最短路径优先协议03

    OSPF的LSA类型: 1.Router-LSA:   一类LSA所有路由器都会产生,本区域扩散.LINK ID:指的是始发路由器的RID. 同一区域内的路由,是靠1类LSA来通告的. 2.Netwo ...

  7. 点分治问题 ----------- P2993 [FJOI2014]最短路径树问题 [最短路径树+点分治+采坑]

    题目链接 解题思路: 首先我们知道最小路径树实际上就是Dijkstra算法在找最短路的时候转移的过程就是一个最短路径树. 那么我们就可以先跑个最短路,记录一下各个最短路的路径.然后就是很裸的点分治.分 ...

  8. HDU 5385 The path(贪心、构造、最短路径树)

    HDU 5385 题目大意:给定一个图,dis表示第i个点到1点的最短路,dis1=0,给有向图上的边赋权值(1~n)满足dis1<dis2<dis3<--<disk>d ...

  9. Bzoj4016/洛谷P2993 [FJOI2014] 最短路径树问题(最短路径问题+长链剖分/点分治)

    题面 Bzoj 洛谷 题解 首先把最短路径树建出来(用\(Dijkstra\),没试过\(SPFA\)\(\leftarrow\)它死了),然后问题就变成了一个关于深度的问题,可以用长链剖分做,所以我 ...

最新文章

  1. 原创|一文读懂主成分分析(PCA)
  2. 十二月份找工作好找吗_注会过两门好找工作吗?好找
  3. 熵(Entropy),交叉熵(Cross-Entropy),KL-松散度(KL Divergence),似然(Likelihood)
  4. P5662-纪念品【dp】
  5. 魔兽三国服务器维护,魔兽三国开服七天技巧
  6. 麦克劳林展开式_数学家麦克劳林与牛顿的故事
  7. flutter text 最大长度_Flutter小技巧之TextField换行自适应
  8. 哀悼地震遇难者--5月19至21日为全国哀悼日
  9. sqli-lab———writeup(11~17)
  10. Linux命令之感叹号 !
  11. vector与list的区别
  12. DJFP2FP2计算机电缆,ZR-DJFP2FP2-22 (ZR-DJFP2FP2-22计算机电缆)(百勤石油)
  13. 关键业务开放平台助金融行业数字化转型
  14. 数据分析为周杰伦打榜的夕阳红老年团,告诉你他们真实年龄!
  15. CoppeliaSim用户手册中文翻译版(一)
  16. uni-app开发环境搭建创建uni-app项目
  17. 单片机C语言程序设计心得,单片机心得体会4篇
  18. 单片机是嵌入式的子类
  19. 大数据、数据分析和数据挖掘的区别
  20. 《沸腾十五年》 豆瓣评分[8.20]覆雨翻云的中国网事; 荡气回肠的产业传奇;虚拟世界的真实讲述;万象网络的还原走笔。...

热门文章

  1. Delphi 7 在程序中直接执行SQL脚本文件
  2. 可在广域网部署运行的QQ高仿版 -- GG叽叽(开源)
  3. Web UI设计的关键要素!
  4. Ajax Toolkit日历控件CalendarExtender求教!
  5. bufferedreader读取中文乱码_Python读取excel的两种方法
  6. 服务器物理内存高,服务器的物理内存高
  7. 在组策略中用户策略仅对特定计算机生效,如何对本地组策略设置使之不对特定用户生效?...
  8. 服务器出口ip怎样修改,服务器出口ip设置
  9. 正则表达式之?、(?:pattern)、(?!pattern)、(?=pattern)理解及应用
  10. 2字节取值范围_第二篇——整数和浮点数在计算机中的表示(2)