Which two combinations are valid PAgP configurations that will set up a PAgP channel？（）

A .  RSVP itself provides bandwidth and delay guarantees. B .  For RSVP to be end-to-end， all devices must support RSVP. C .  RSVP reservations are maintained by a centralized reservations server. D .  An RSVP compatible QoS mechanism must be used to implement guarantees according to RSVP reservations.

A . Form-based logins should NOT be used with HTTPS. B . When using Basic Authentication the target server is NOT authenticated. C . J2EE compliant web containers are NOT required to support the HTTPS protocol. D . Web containers are required to support unauthenticated access to unprotected web resources.

A .  16>4 B .  16/2 C .  16*4 D .  16>>2 E .  16/2^2 F .  16>>>2

A . access-list 10 permit ip 192.168.147.0 0.0.0.255.255 B . access-list 10 permit ip 192.168.149.0 0.0.0.255.255 C . access-list 10 permit ip 192.168.146.0 0.0.0.0.255 D . access-list 10 permit ip 192.168.146.0 0.0.0.1.255 E . access-list 10 permit ip 192.168.148.0 0.0.0.1.255 F . access-list 10 permit ip 192.168.146.0 255.255.255.0

A .  3/2 B .  3<2 C .  3*4 D .  3<<2 E .  3*2^2 F .  3<<<2

A .  3/2 B .  3<2 C .  3*4 D .  3<<2 E .  3*2^2 F .  3<<<2

A . <%! int i； %> B . <%= int i； %> C . <jsp：expr>int i；</jsp：expr> D . <jsp：scriptlet>int i；</jsp：scriptlet> E . <jsp：declaration>int i；</jsp：declaration&gt

A . It is possible for more than two threads to deadlock at once. B . The JVM implementation guarantees that multiple threads cannot enter into a deadlocked state. C . Deadlocked threads release once their sleep（） method’s sleep duration has expired. D . Deadlocking can occur only when the wait（）， notify（）， and notifyAll（） methods are used incorrectly. E . It is possible for a single-threaded application to deadlock if synchronized blocks are used incorrectly. F . If a piece of code is capable of deadlocking， you cannot eliminate the possibility ofdeadlocking by insertinginvocations of Thread.yield（）.

A .  develop a policy for securing the network B .  monitor and test network activities for vulnerabilities C .  implement reflexive access lists D .  implement dynamic access lists E .  select and implement a single comprehensive virus protection program

A .  16 > 4 B .  16 / 2 C .  16 * 4 D .  16 >> 2 E .  16 / 22 F .  16 >>> 2

A .  Dense mode multicast requires explicit join messages from their members. B .  Dense mode multicast uses a push model to flood traffic throughout the network and then prunes the  unwanted traffic. C .  Sparse mode multicast uses a pull model to send multicast traffic to where it is requested.   D .  Sparse mode uses reverse path forwarding （RPF） to prune off redundant flows. E .  The primary use of sparse mode multicast is for test labs and router performance testing.

A . menu B . functions C . data group D . responsibility E . functional grou

A . RSVP itself provides bandwidth and delay guarantees. B . For RSVP to be end-to-end, all devices must support RSVP. C . RSVP reservations are maintained by a centralized reservations server. D . An RSVP compatible QoS mechanism must be used to implement guarantees according to RSVP reservations.

A .  An encapsulated， public class promotes re-use. B .  Classes that share the same interface are always tightly encapsulated. C .  An encapsulated class allows subclasses to overload methods， but does NOT allow overriding methods. D .  An encapsulated class allows a programmer to change an implementation without affecting outside code.

A . DPT/RPR uses a bi-directional ring consisting of two symmetric counter rotating fibre rings. B . DPT/RPR is defined in the IEEE 802.17 standard and it uses Token Bucket system to avoid collisions on the fiber. C . In DPT/RPR rings， data packets can be sent in one direction （downstream） and the corresponding control packets in the opposite direction （upstream），thus using both fibres concurrently to maximise bandwidth. D . DPT/RPR can be deployed in the Core of the SP networks where point-to-point POS links are used tomake best use of the Bandwidth.

A . TRIM B . REPLACE C . TRUNC D . TO_DATE E . MOD F . CASE

A . A received IP packet is forwarded based on the IP destination address and the packet is sent as an IP packet. B . An IP destination exists in the IP forwarding table. A received labeled packet is dropped because the label is not found in the LFIB table. C . There is an MPLS label-switched path toward the destination. A received IP packet is dropped because the destination is not found in the IP forwarding table. D . A received IP packet is forwarded based on the IP destination address and the packet is sent as a labeled packet. E . A received labeled IP packet is forwarded based upon both the label and the IP address. F . A received labeled packet is forwarded based on the label. After the label is swapped，the newly labeled packet is sent.

A . On/On B . On/Auto C . Passive/Active D . Desirable/Auto E . Active/Active F . Desirable/Desirable

A . access-list 10 permit ip 192.168.147.0 0.0.0.255.255 B . access-list 10 permit ip 192.168.149.0 0.0.0.255.255 C . access-list 10 permit ip 192.168.146.0 0.0.0.0.255 D . access-list 10 permit ip 192.168.146.0 0.0.1.255 E . access-list 10 permit ip 192.168.148.0 0.0.1.255 F . access-list 10 permit ip 192.168.146.0 255.255.255.0

A . It is possible for more than two threads to deadlock at once. B . The JVM implementation guarantees that multiple threads cannot enter into a deadlocked state. C . Deadlocked threads release once their sleep() method's sleep duration has expired. D . Deadlocking can occur only when the wait(), notify(), and notifyAll() methods are used incorrectly. E . It is possible for a single-threaded application to deadlock if synchronized blocks are used incorrectly. F . If a piece of code is capable of deadlocking, you cannot eliminate the possibility of deadlocking by inserting invocations of Thread.yield().

A . A finalizer may NOT be invoked explicitly. B . The finalize method declared in class Object takes no action. C . super.finalize（）is called implicitly by any over riding finalize method. D . The finalize method for a given objec twill be called no more than once by the garbage collector. E . The order in which finalize will be called on two objects is based on the order in which the two objects became finalizable.

A .  3 / 2 B .  3 < 2 C .  3 * 4 D .  3 << 2 E .  3 * 22 F .  3 <<<2