【 以下文字转载自 JobHunting 讨论区 】 发信人: xiongyp (dreamrain), 信区: JobHunting 标 题: 让大家了解工业界Java/J2EE面试题的难度 发信站: BBS 未名空间站 (Fri Jul 2 16:55:08 2010, 美东) 1. How to implement your own HashSet by using ArrayList? (From Goldman & Sachs) 2. How to solve the Lazy Initialization Exception problem in Hibernate? (From JPMC) 3. How to inject a session bean into a singleton bean in Spring? (from S&P) 每题3分钟答上来,差不多可以应付各种面试了.
z*f
3 楼
想要采用两状态的Markov模型模internet信道,计算不同的FEC解码后(采用RS(N,K) )的residule丢包率(计算n个包里丢掉k个以上包的概率),我用matlab实现了(应该 没错),具体代码如下,但是运行速度巨慢,计算一个RS(16,9)的残差丢包率需要 十几秒,如果再放进优化循环里面的话,估计是不能忍了,所以想问问有没有快一点的 实现?此外,好像结果也不对:残差丢包率竟然比原来的丢包率还高一点点。不知道是 错在哪儿了? 所以还请大牛们指点指点!!!谢谢啦!!! function P_res = Func_ResidualPLR(P_GB, P_BG, PB, N, K) P_res = 0; for m = N-K+1:N P_res = P_res + Func_P(P_GB, P_BG, PB, m, N); end % g(v) function gv = Func_g(P_GB, P_BG, v) if v == 1 gv = 1 - P_BG; else gv = P_BG * (1-P_GB)^(v-2) * P_GB; end
【在 q*********u 的大作中提到】 : 【 以下文字转载自 JobHunting 讨论区 】 : 发信人: xiongyp (dreamrain), 信区: JobHunting : 标 题: 让大家了解工业界Java/J2EE面试题的难度 : 发信站: BBS 未名空间站 (Fri Jul 2 16:55:08 2010, 美东) : 1. How to implement your own HashSet by using ArrayList? (From Goldman & : Sachs) : 2. How to solve the Lazy Initialization Exception problem in Hibernate? : (From JPMC) : 3. How to inject a session bean into a singleton bean in Spring? (from : S&P)
L*A
6 楼
我以前是用的第1种方法,不过据说第2种方法更科学,也更省鸡粪。建议你选用第2 种。
s*8
7 楼
add GC, JPM, SP to my black list.
t*0
8 楼
好的,谢谢楼上两位MM:)
b*t
9 楼
3. use JndiObjectFactoryBean for wrap ejb into spring.
Shipping is too expensive on amazon. Go to craiglist to find chicken manure from your local farmers. I bought my rabbit manure this way. Hope this helps.
【在 Z**X 的大作中提到】 : Shipping is too expensive on amazon. Go to craiglist to find chicken manure : from your local farmers. I bought my rabbit manure this way. Hope this helps.