N9
发帖数: 92 | 1 BS41's is not a 5-way binding post which allows the banana plug to insert.
It is a simpler one -- a bolt with a hole then a cap/acorn screwing over it.
Banana plug may be able to go through the hole in the bolt but bare wire
seems more than enough. |
|
|
l******g
发帖数: 6771 | 3 新手，最近看看音响,看看电影，唱唱卡拉OK，人笨不太会考古搜精华，所以就放狗搜
，看到这个深入浅出，转到版上分享一下，抛砖引玉。。。
http://thecreativealternative.com/best-home-theater-receiver-gu
#####################################################################
AV Receiver Guide – Home Theater
Posted on April 14, 2013 by mychaelp
Check out some of the latest models with 4K Ultra HD compatibility now
included in this AV Receiver Guide for Home Theater
The A/V Receiver… Some have referred to this device as “The “Heart of the
Home Theater”. And for good reas... 阅读全帖 |
|
w*w
发帖数: 64 | 4 7mins to PATH
3 bed rooms + 2bath rooms + one ketch + one living room.
Move-in date: Oct.18th
Very new apartment, 10 years old, and very good arrangement.
Myself: female, working in Manhatton,
(1) prefer one female to share the apartment, so we will have our own bath
room. One simpler bath room is in the master room and it does not have a
tub. You can choose the mater room or one room + bath room
The other spare room can be a shared study room, or whatever
Rent $700+1/2 utility
or (2) two p... 阅读全帖 |
|
s********n
发帖数: 1962 | 5 Okay, use the last 4 month data, I got the following linear relationship.
QQQ = 0.01705*Naz + 1.9770
QQQ = 0.02465*Ndx + 0.2936 (Ndx: Nasdaq 100)
Approximately:
QQQ = Naz/59 + 2 or Naz = (QQQ-2 ) * 59
QQQ = Ndx/41 + 0.3 or Ndx = (QQQ-0.3) * 41
Even simpler: |
|
b****e
发帖数: 460 | 6 Well, My strategy is much simpler than you can imagine. Iff I can figure out
a sweet deal/opportunity, I will bet on it. Sometimes, this someones do
dumb things, but that's not necessary to leave a sweet deal/opportunity to
me. |
|
K****D
发帖数: 30533 | 7 What you said is completely correct. But there is one more point
I would like to raise.
As I mentioned before, I hold the idea that the more complex
a product is, the easier it is for smart-a$$ Ph.D. Chinese to
beat an average customer.
The reason we enjoy 2% cashback on our credit cards is those
冤大头 who pays 18.99% APR every month. Checking accounts are
much simpler, but we can't get cashback either -- the most we
can get is 2% per year on the average principal.
Therefore, although IUL is more |
|
s********n
发帖数: 1962 | 8 It's always much simpler for 长期投资 --- just DCA. |
|
K****D
发帖数: 30533 | 9 I recommended not to report any transaction done in Roth.
Your broker usually doesn't report your Roth transactions
to IRS.
However, I wouldn't recommend doing this intentionally.
If you sell something with a loss, make sure you don't buy
the same thing inside an IRA +/- 30 days, to make things
simpler. IRS has the right to audit anything. |
|
t*m
发帖数: 4414 | 10 you are right. but my "rollover IRA" is pre-tax money. It comes from a
401K (a traditional 401K, not a roth 401K). Per IRS rules, at ROTH
conversion, I have to look at all Non-ROTH IRAs.
For example,
(1) I have $10000 rollover IRA, which is pre-tax money (my cost basis is 0,
because I didn't pay tax on it yet)
(2) Today, I contribute $5000 non-deductible IRA (my cost basis is $5000,
because I already paid tax on it)
(3) Tomorrow, I will convert this non-deductible IRA into ROTH IRA
How much ta... 阅读全帖 |
|
k***n
发帖数: 3158 | 11 to do it simpler, I would just buy and hold KO in an account following
a similar strategy, maybe add COP too.
People love diversification, but I don't think studying and picking many
other stocks would reduce much risk comparing to just buying and holding KO.
Besides, you don't need to spent much time on it.
China is slowing down, EU is in a mess and certainly in a recession, US
is turning to a recession at best. From this perspective, stock market
seems to heading lower. But there are tons of c... 阅读全帖 |
|
k***n
发帖数: 3158 | 12 to do it simpler, I would just buy and hold KO in an account following
a similar strategy, maybe add COP too.
People love diversification, but I don't think studying and picking many
other stocks would reduce much risk comparing to just buying and holding KO.
Besides, you don't need to spent much time on it.
China is slowing down, EU is in a mess and certainly in a recession, US
is turning to a recession at best. From this perspective, stock market
seems to heading lower. But there are tons of c... 阅读全帖 |
|
f*******n
发帖数: 12623 | 13 Of course you are paying back after-tax money, but you got after-tax money
out to begin with; this is no different from how all loans (e.g. ones you
get from the bank) work. Talking about "taxed again" is misleading. It's
much simpler to think about it this way:
Taking a 401k loan at 4% is EXACTLY the same as the these two things
combined:
1. In the 401k, investing in an investment with a fixed return of 4%, and
2. Getting a regular loan from a bank that you have to pay back at 4%
interest
That'... 阅读全帖 |
|
S**C
发帖数: 2964 | 14 1 Develop a workable plan (If that plan doesn't work, be prepared to change
it when the market tanks.)
2 Invest early and often (Except during those times when you can't bear to
look at your account and you're selling)
3 Never bear too much or too little risk (If you're implementing Plan B, it
's your own fault because you took too much risk.)
4 Diversify (When exercising Plan B and selling like crazy, keep your sales
in proportion to your pre-crash allocation.)
5 Never try to time the marke... 阅读全帖 |
|
S**C
发帖数: 2964 | 15 The Prophet is always more flexible than the acolytes.
And stick to the bogleheads 10 Commandments
1 Develop a workable plan (If that plan doesn't work, be prepared to change
it when the market tanks.)
2 Invest early and often (Except during those times when you can't bear to
look at your account and you're selling)
3 Never bear too much or too little risk (If you're implementing Plan B, it
's your own fault because you took too much risk.)
4 Diversify (When exercising Plan B and selling lik... 阅读全帖 |
|
f******r
发帖数: 2975 | 16 刚才研究到的
Backdoor Roth: A Complete How-To
by Harry Sit on December 20, 2010 —366 Comments
backdoor
[Last updated on July 14, 2014, with new contribution limits and links to
follow-up articles on tax reporting.]
Although I believe a traditional deductible IRA is often better than a Roth
IRA, a Roth IRA is still better than a taxable account if you aren’t
eligible for a deductible contribution to a traditional IRA. When you aren’
t allowed to contribute to a Roth IRA because your income is too high,... 阅读全帖 |
|
i*******h
发帖数: 216 | 17 ?????:
1.repeat m-n until the result is smaller than n, also count how many repeats.
2.Assume that we have 1 cent denominator. This is reasonable, why? :)
sort the denominators array in reversed order.
int count=0
for each denominator[i]
{
count += sum/denominator[i];
sum = sum%denominator[i];
}
3.1
int max=0;
int count=0;
int old=a[0];
for(int i=1;i
{
if(a[i]>old)
count++;
else
{count=0;
if(max
max=count;
}
old = a[i];
}
3.2
This is a classi... 阅读全帖 |
|
i*******h
发帖数: 216 | 18 ?????:
1.repeat m-n until the result is smaller than n, also count how many repeats.
2.Assume that we have 1 cent denominator. This is reasonable, why? :)
sort the denominators array in reversed order.
int count=0
for each denominator[i]
{
count += sum/denominator[i];
sum = sum%denominator[i];
}
3.1
int max=0;
int count=0;
int old=a[0];
for(int i=1;i
{
if(a[i]>old)
count++;
else
{count=0;
if(max
max=count;
}
old = a[i];
}
3.2
This is a classi... 阅读全帖 |
|
y********a
发帖数: 138 | 19 just like accounting, applied discipline,
intermediate analysis,neither need to generate data nor really understand data
most jobs may be even simpler than programmer:no coding or algorithm development
don't be surprised seeing so many female biostat faculties
hehe |
|
|
k*k
发帖数: 49 | 21 i was asked this question
i proposed solution mentioned in this post except max+min heap.
seems max+min heap is the best solution....
sigh... wish i saw this post earlier....
in the end, they asked for the board-coding of a simpler getMedian() for a
collection in which the value of elements are constrained such as (1..100) |
|
g*******y
发帖数: 1930 | 22 a third way:
you can get:
DATA_TYPE nodes[N]; //node[i] = node_i -> data;
int left[N]; //left[i]=j means node[i] has a left child of node[j]
int right[N]; //left[i]=k means node[i] has a right child of node[k]
by using BFS (actually any traversal works, but bfs is simpler I think) |
|
d****n
发帖数: 233 | 23 Even simpler one:
Node* insertInOrder(Node *head, int value)
{
Node *newHead = newNode(value, head);
Node *tNode = newHead;
while(tNode && tNode ->next && tNode ->value < tNode->next->value)
{
tNode->value ^= tNode->next->value;
tNode->next->value ^= tNode->value;
tNode->value ^= tNode->next->value;
tNode = tNode->next;
}
return newHead;
} |
|
c******n
发帖数: 4965 | 24 point is, the interview questions are much much stupider and simpler
than the code jam questions.
yes code jam winners can finish the interview questions immediately,
but answering the interview questions does not show any linkage to ability
to win a code jam
more |
|
L*******e
发帖数: 114 | 25 I know for y=x++, definitely a temp variable holds the old value.
How about this: for(int i=0;i<100;i++) or even simpler i++?
From the claim from http://www.gotw.ca/gotw/002.htm, but I do not agree this claim, why a temp var is created but not used at all? see the following sample program and generated assembly.
Any thoughts?
int i = 0;
i++;
++i;
int k=i++;
assembly generated by g++:
movl $0, -12(%ebp) #, i
addl $1, -12(%ebp) #, i
addl $1, -12(%ebp) |
|
g******0
发帖数: 221 | 26 why can't we find the boundary first, then take the lowest cell h in the
boundary. For every interior cell, we know it can be filled up to h. It
seems much simpler this way... or did I miss something? |
|
b********n
发帖数: 5997 | 27 oh yes, this is right. I thought wrong. this is a simpler case. I just
overthought. |
|
x*****p
发帖数: 1707 | 28 Then for another understanding is the conditional probability. Given my
birthday, find the probability that no one has the same birthday as mine
among the other 49 people.
So the probability is
(364/365)^49 = 0.874 = 87.4%
This is much simpler. Will it be in the interview? |
|
x*****p
发帖数: 1707 | 29 Then for another understanding is the conditional probability. Given my
birthday, find the probability that at least one has the same birthday as
mine among the other 49 people.
So the probability is
1 - (364/365)^49 = 0.874 = 0.126 = 12.6%
This is much simpler. Will it be in the interview? |
|
d******g
发帖数: 34 | 30 1. Numbers are generated randomly and passed to a method. Write a program to find the median value as new numbers are generated.
I told the interviewer about the method using two heaps. He doesn't like it (said it could be simpler), and asked for another way to do it. I gave up...
2. Find the median value for an array of values (without sorting it)
Thank you for your insights! |
|
g*********s
发帖数: 1782 | 31
program to find the median value as new numbers are generated.
it (said it could be simpler), and asked for another way to do it. I gave
up...
Do you mean you will have a randomly generated integer stream and you need
to update the median dynamically along the stream? How does your 2-heap
solution work? |
|
h***n
发帖数: 276 | 32 according to your description, I think the solution of using two heaps would
be:
maintain a min-heap & a max-heap, which satisfying that
1) all numbers in min-heap are larger or equal than that of max-heap
2) the difference of the numbers in two heaps should be no more than 1, depe
nding on that the total number of numbers is odd or even
with the above property, the median can be easily derived from top elements
on heap(s)
therefore, the algorithm is designed to maintain the above two properties... 阅读全帖 |
|
b*****e
发帖数: 474 | 33 1. build a binary search tree. Node contains the size of the tree under it.
O(log(n)) average. (Since input is random, depth should be O(log(n))
expected.
2. quick select is one way. O(N) average, O(N^2) worst case. Or build BST;
use a heap, etc
to find the median value as new numbers are generated.
it (said it could be simpler), and asked for another way to do it. I gave up
... |
|
l*********3
发帖数: 26 | 34 我想可以这样做：
1）
定义一个堆栈类，push(),pop(),size(),max/min()。以上操作都可以在O(1)完成
维持两个堆栈，一个max栈，一个min栈。max栈中记录所有比median小的数，min栈中记录所有比median大的数。
接受新数时，决定插入max栈或是min栈，如果max和min栈不平衡，rebalance，pop多的栈，作为新median，将老median插入少的栈中。
每个元素都可以在O(1)时间内完成操作。
2）
输入数组，一次调用第一题中的方法，时间复杂度O(n)。
to find the median value as new numbers are generated.
it (said it could be simpler), and asked for another way to do it. I gave up
... |
|
d****2
发帖数: 12 | 35 shouldn't this be simpler by just using an array based stack, so that you
don't have to maintain link node and allocate new memory? A c++ version:
void MovingWindowMax(int* a, int n, int w, int* b)
{
Stack* stack = new Stack(w); //an array implementation of stack.
max capacity is w at any time.
for(int i=0; i
{
while(!stack.Empty() && stack.Peek() < a[i])
stack.Pop();
stack.Push();
if(i
continue;
b[i-w+1] = s... 阅读全帖 |
|
g*********s
发帖数: 1782 | 36 no, this is over-qualified. must be something simpler. maybe binary matrix
operations like graph adjacency matrix's closure? |
|
c***2
发帖数: 838 | 37 I met a very nice Chinese interviewer from MS:
1) Did not do well on the first coding
2) Re-did it next day, forwarded to him and asked for another try
3) He agreed and gave me a simpler coding question
Also talked a lot about how to get better codes :-) |
|
f*****y
发帖数: 444 | 38 phone interview with hiring manager & hw engineer - 1 hour
1. brief introduction of company
2. resume questions
3. Difference between i2C and SPI bus? CAN bus?
4. what is size of char, char*, void*, int?
5. What debugger tools do you use? Are you familiar with ICE?
6. Node a and b has resistor r1 and node b has resistor r2 to ground.
Node a have Va, what is Vb? why use this circuit? if exchange r2 to a
capacitor, what circuit is this? can this circuit be implemented by software
and how?
7. how d... 阅读全帖 |
|
O******n
发帖数: 1505 | 39 anyone can think of a simpler formula?
size = 7
matrix = [[0]*size for i in range(size)]
current = 1
for layer in range(size/2+1):
for offset in range(size-1-2*layer):
matrix[layer][layer+offset] = current
current = current+1
for offset in range(size-1-2*layer):
matrix[layer+offset][size-1-layer] = current
current = current+1
for offset in range(size-1-2*layer):
matrix[size-1-layer][size-1-layer-offset] = current
current = current+1
... 阅读全帖 |
|
s*****y
发帖数: 897 | 40 During the interview, how could we implenment this interval tree as it seems
belong to red-black tree.
Yous is much simpler and easier to understand. |
|
s*******i
发帖数: 698 | 41 I personally don't think the soccer and basket ball questions are very
important ....
From my understanding, the interviews for EEers are much simpler than CSer.
Sometime they already decide to hire you or not before your
interview... If they decide to hire you, they will ask questions to
confirm that you really have the experiences listed on your resume; if not, the interviewer will sometime ask some weird questions
just for fun.... since the interviews are part of their assigned job, and
they ... 阅读全帖 |
|
s*******f
发帖数: 1114 | 42 basically idea is maxheap + minheap as u, but can be simpler.
i lost in this problem, though i figured it out at last. |
|
P*******U
发帖数: 203 | 43 In lz's description, only required to decide whether merge, but not asked to
find the merge place. Then comparing the last element is enough and much
simpler than your algo. |
|
h**i
发帖数: 219 | 44 Is not using stack simpler? When you see an operator, pop two operands from
the stack, perform the operation and push the result into the stack. |
|
|
G******i
发帖数: 5226 | 46 ☆─────────────────────────────────────☆
zmhzs (中美合作所) 于 (Tue Dec 6 00:07:18 2011, 美东) 提到:
见到板上大多都是喜报， 我仍然相信还是有一部分人和我一样平凡的人在找工作， 不
断收到打击， 然后不断在原地站起来再前进的人。 与这部分人共勉。
本人EE 小硕， 最近硕士要毕业了， 开始找工作， 学的EE。
初次找工作投了5家公司， 结果全都有回音。 接下来电面或者ON SITE。
结果2家倒在HR电面这一关， 3家倒在ON SITE。 个人觉得背景还不错， 有大公司实习
经验。
但是我总结失败的原因， 有如下几点：
1 英文口语还是欠火候。 我的英语口语水平是那种说自己熟悉的东西能唬住别人的那
种， 然后人家问些莫名其妙的问题， 没有准备过的， 有时候就会卡壳或者词穷。
真是伤不起啊。
不知道有没有和我一样情况的兄弟姐妹。 看板上这些人找工作， 似乎大家英文都很
溜， 根本存在这方面的问题， 但是我仍然相信会有和我有共同心声的人在。
2 behavior question 准备不全面。 ... 阅读全帖 |
|
w**z
发帖数: 8232 | 47 还是学Java 吧， 虽然facebook will try to compile php to run on VM，并不是说
直接用Java， 但Java clearly is more popular choice of programming language
than others. And more clearly, JVM is the most popular platform.
http://nerds-central.blogspot.com/2012/08/facebook-moving-to-jv
Facebook Moving To The JVM
The Big Guns get behind mlvm. I mean, BIG like GE, and Facebook!
"Are interpreters immoral?" A question I posed some months ago which might
soon become irrelevant. General purpose interpretors are about to go t... 阅读全帖 |
|
d******i
发帖数: 76 | 48
This is my solution I got during the interview.
Suppose there are N lists. and the longest list has M intervals.
There are two similar solutions.
one gives (M*N)log(M*N), the other one gives (M*N)log(M);
I wrote down the first solution, cus codes are simpler than the second one,:
D. and later I discussed about the second one with the interviewer.
The first one is a straightforward one.
put all of the intervals into one minHeap.
Each time get the top of the heap, and decide if it could be merge... 阅读全帖 |
|
w****a
发帖数: 186 | 49 Yes, it is one of the simple blurring technique, called box filters. It is
simpler and faster than the Gaussian blur and other blurring technique. |
|
c***p
发帖数: 221 | 50 Two's complement 居多。比如: x86, amd64, sparc都用 Two's complement.
http://en.wikipedia.org/wiki/Two's_complement
The two's-complement system has the advantage that the fundamental
arithmetic operations of addition, subtraction, and multiplication are
identical to those for unsigned binary numbers (as long as the inputs are
represented in the same number of bits and any overflow beyond those bits is
discarded from the result). This property makes the system both simpler to
implement and capable of eas... 阅读全帖 |
|
