Which two are equivalent？（） 

A .  Final int k = 4； B .  Public int k = 4； C .  Static int k = 4； D .  Private int k = 4； E .  Abstract int k = 4； F .  Volatile int k = 4；

A .  final int k = 4； B .  public int k = 4； C .  static int k = 4； D .  abstract int k = 4； E .  volatile int k = 4； F .  protected int k = 4；

A .  16>4 B .  16/2 C .  16*4 D .  16>>2 E .  16/2^2 F .  16>>>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 . IP prefix B . Layer 2 circuit C . RSVP request from CE for bandwidth reservation D . BGP MED value

A . shutdown [a b] B . srp shutdown [a b] C . srp ips request manual-switched [a b]

A . FEC might correspond to a destination IP subnet， but it might also correspond to any traffic class that the edge LSR considers significant. B . FEC is a group of IP packets that is forwarded over a different path， but with the same forwarding treatment. C . FEC is a group of IP packets that is forwarded over the same path， and with the same forwarding treatment. D . FEC is a group of IP packets that is forwarded over a different path， but with the different forwarding treatment. E . FEC is a group of IP packets that is forwarded over the same path， but with a different forwarding treatment

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 .  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 . Two LSAs will exist in the network for this destination， and both will be used B . Two LSAs will exist in the network for this destination， but only the one generated by the highest RID ASBR will be used C . Only the LSA generated by the highest RID ASBR will exist in the network D . Only the LSA generated by the lowest RID ASBR will exist in the network

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 . the two methods of authentication using the WEP encryption are open and shared key B . the 802.11 standard defines WEP security using 128-bit keys C . WEP can provide stronger authentication through the use of LEAP， PEAP， or EAP-FAST D . WEP is a scalable encryption solution that uses static keys for authentication E . WEP security provides only one-way authentication F . WEPv2 offers improved encryption by replacing the RC4 encryption mechanism with the AES （symmetric block cipher） mechanism

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 .  final int k = 4： B .  public int k = 4： C .  static int k = 4： D .  private int k = 4： E .  abstract int k = 4： F .  volatile int k = 4： G .  transient int k = 4： H .  protected int k = 4：

A .https://assets.asklib.com/images/image2/2018073115112695987.jpg B .https://assets.asklib.com/images/image2/2018073115114664903.jpg C .https://assets.asklib.com/images/image2/2018073115123688801.jpg D .https://assets.asklib.com/images/image2/2018073115124427624.jpg E .https://assets.asklib.com/images/image2/2018073115125392737.jpg

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