!!!Interview Topics
文章平均质量分 85
b_end_an
这个作者很懒,什么都没留下…
展开
-
KNOW: Design Pattern
Strategy Pattern In computer programming, the strategy pattern (also known as the policy pattern) is a software design pattern, whereby an algorithm's behaviour can be selected at runtime. Formally原创 2013-07-22 22:40:08 · 653 阅读 · 0 评论 -
KNOW: Hash Table
CH 5 in DS and AA Definition In computing, a hash table (also hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a h原创 2013-08-06 05:30:06 · 527 阅读 · 0 评论 -
KNOW: Process Thread Sync Deadlock
Thread & Process Difference Between Thread and Process http://stackoverflow.com/questions/200469/what-is-the-difference-between-a-process-and-a-thread A process is an instance of a program in exe原创 2013-10-04 09:12:25 · 516 阅读 · 0 评论 -
KNOW: rand() function & Card Shuffle Algorithm
计算机的随机数都是由伪随机数,即是由小M多项式序列生成的,其中产生每个小序列都有一个初始值,即随机种子。(注意: 小M多项式序列的周期是65535,即每次利用一个随机种子生成的随机数的周期是65535,当你取得65535个随机数后它们又重复出现了。) 我们知道rand()函数可以用来产生随机数,但是这不是真正意义上的随机数,是一个伪随机数,是根据一个数(我们可以称它为种子)为基准以某个递推公原创 2013-05-09 03:54:41 · 951 阅读 · 0 评论 -
KNOW: Bit Manipulation
Bit Manipulation types ~ bitwise NOT ~expr > left/right shift expr1 & bitwise AND expr1 & expr2 ^ bitwise XOR expr1 ^ expr2 | bitwise OR expr1 | expr2 1. l原创 2013-08-06 22:19:47 · 677 阅读 · 0 评论 -
KNOW: Tree, Trie, Graph
Binary Tree A binary tree is a tree in which no node can have more than two children. The depth of an average binary tree is considerably smaller than N. For binary search tree, the average dep原创 2013-08-14 02:56:31 · 785 阅读 · 0 评论 -
KNOW: Sort & Search
Sorting Algorithm http://en.wikipedia.org/wiki/Sorting_algorithm Name Worst Memory Stable Note Chapter Insertion Sort n^2 1 Yes 7.2 Bubble Sort n^2 1 Yes原创 2013-04-12 20:46:50 · 777 阅读 · 0 评论 -
KNOW:Math & Probability
Prime Number every positive integer can be decomposed into a product of primes. 84 = 2^2 * 3^1 * 5^0 * 7^1 Let x = 2^i1 * 3^i2 * 5^i3 * ... Let y = 2^k1 * 3^k2 * 5^k3 * ... If x%y == 0, then for原创 2013-09-26 11:33:56 · 522 阅读 · 0 评论 -
KNOW: BFS & DFS
BFS http://en.wikipedia.org/wiki/Breadth-first_search Definition In graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operat原创 2013-09-05 03:31:06 · 826 阅读 · 0 评论 -
KNOW: List, Stack, Queue
Implementation Ways 1. Simple Array Implementation of List - Insert and Delete are expensive O(N) 2. Linked List Linked List Implementation原创 2013-07-21 08:03:10 · 405 阅读 · 0 评论 -
!!!Interviewer
硅谷一流的互联网公司大都有类似的面试过程。首先是一到两轮的电话面试,通过后到公司现场面试。 电话面试问的大都是算法问题, 对方和应聘者约好时间,在 collabedit.com 上,对方出个题,应聘者直接写程序,对方通过观察应聘者的速度和准确度来判断是否是个优秀的程序员。 如果过不了这关,就直接刷下来。 这种做法有其争议之处,当初因为Google 普遍使用,后来许多人来到Facebook 和L转载 2012-10-14 13:34:30 · 516 阅读 · 0 评论