以前以为EE也就比CS难找工作一点，现在才感慨，原来那是基于很多EE去找CS的工作，而且会付出比别人多的努力。EE的学生虽然也写代码，但是因为没有算法和数据结构的知识，写出的代码质量真的不高，而且要过面试那就更难了。

先说我找工作的经历吧。我是从3月开始准备面试，当时金磊同学告诉我大公司都在招人，然后让我看看careercup和版面总结也去投，他拿了很多面试(大部分都成offer了)。我看这些题真是个吃力啊，因为我对于数据结构，算法，设计模式的基础基本为0，虽然以前写了很多代码，最多也就是UI设计了。不过看看总结也不是特别长，就把那些帖子都翻出来慢慢看，看不明白就去查资料，或者就直接骚扰我同学了。后来发现这些算法也就那会事，看多了就会了。但是会用不一定会写，经常写出来的代码到处是错，从来不会没编译错误的。在看完一次版面总结后，又开始看第二次，并且再写了一次代码。接着在这个版面混了，有人发了面经就把题认真想，然后写代码。我觉得讨论是个好东西，自己想到办法不一定是对的。

复习到8月份开始投简历，对于大公司我是一个一个投，不想有重叠，5个招人挺多的公司，至今还有微软，facebook没面。其实我觉得学习到现在，对算法，编程兴趣都有热爱的心了，每天不看看面经不写写代码还觉得不习惯….

简历篇
需要除了基本语法，突出关键点，需要说的是地址，如果你距离纽约近，就随便找个纽约地址写，我就是写我朋友的地址，经常都有猎头找我。如果你是距离加州近，就写加州。如果都不近，我建议毕业了就2选一先找个便宜的地方住吧。
列出的qualification一定一定是你非常有把握的，不怕少，就怕虚！我在面google的
时候就吃了这个亏，我简历写了多线程，TCP/IP，结果面试官就给我一段TCP/IP的代码，让我找错，而错误又不是语法，而是经验问题。
列出的projects一定一定要熟悉，不一定是你做的，但是你一定一定要把为什么这么设
计非常清楚。
有朋友问fresh哪里有那么多project经验，我觉得对于master有3个就够了，如果不够
怎么办？拿来主义！找同学要project的summary，主要看为啥做这个，怎么做的，为什么这么做，而不用其他办法，代码看个结构。考官喜欢问你为什么这么做，难点是什么，解决方案。

面试准备篇
不打没把握的仗
如果你觉得mitbbs版面总结还有10%以上题不会或者写代码会有错，我不建议去浪费面试机会。
版面总结链接 http://www.mitbbs.com/article/JobHunting/31505215_4.html
如果要准备除了google facebook Microsoft其他公司c++的软件工程师，我个人认为需要看到
几个材料有
1. mitbbs版面总结
2. careercup 150题
3. effective c++
4. 面向对象设计的例子，设计模式至少会3个，懂得这3个用在哪里，能举例子。
5. 多线程同步相关知识
http://www.advancedlinuxprogramming.com/alp-folder
6. stl一定要知道大概每一个是怎么实现的，数据结构是什么，复杂度，什么时候用哪个

对于面很大的公司，需要有针对性准备，比如bloomberg，就要把online test的题搜集起来看，在careercup里面有人总结了的。比如google，Microsoft，facebook，Amazon，需要看海量数据处理，还需要看一些难题，这个需要经常看别人怎么解题的，多做题，多思考，思路就广阔了。
还有就是写代码的熟练度问题，常见题应该都要求自己写代码一次写对。对于比较难得，至少不能有语法错误吧。不是每个公司都要求你写代码这么牛，关键是你练充分了，去面试就不怕别人让你写了，心态就不一样了。

不要认为准备的东西太多就被吓着了，以前我觉得那个贴面google的准备材料那个帖子，很恐怖，后来自己还真把里面的东西都准备了，觉得也不可怕，再说了红宝书都背了，还怕这些？红宝那么枯燥。你可以把自己写的代码都保留下来，虽然经常会重复写，但是你会发现你每次写都会有进步，代码越来越简洁，bug越来越少，而且你会从一个题的解法联想到其他题的解法。

面试不怕失败，失败是成功之母，这句话对也不对。如果你没怎么准备就去了，失败了，那就不是成功之母，那就是浪费机会！机会真的不多，能大量招人的大公司就10多个，其他小公司基本找local。我4月浪费掉bloomberg的机会，让我后悔了很久，因为除了online test，其他面试都不难。于是我苦心练了4个月，然后才开始投amazon，结果又因为系统设计不熟悉，hashtable的设计问题被灭了。
当准备充分后，就可以大量投简历了，面试经常都是recruiter联系后就没回信了，不过不需要难过，因为这种电话其实也挺练习口语的。投简历一定要找他们家要求和自己
qualification 对口的投，不然真的是浪费时间。一周可以集中周2-周3投10-20个简历。如果猎头有contract的工作找你，你最好也别错过了，至少可以练口语，练心态。我面到现在，觉得口语已经有很大突破了，面试官居然夸我口语好。。。。。。其实就是说的太多了，能不好么？

面试经验篇
面试前一定要对公司的产品有很详细了解。
面试一定要有热情，一定要有轻松的心态，从容自若，如有机会可以给面试官开玩笑。比如考官问我自动toll的设计，我就跟他说我最讨厌toll，每次过比吃t。考官喜欢跟幽默的人做同事。
穿着我觉得西裤，衬衣，皮鞋就行了，表示对面试的重视，对面试官的尊重。
找reference也很关键，最好找口语好的同学。找老师就找一个，最信得过的，不一定是advisor。

Interview Qs

Data Structures

   1. Integer
      – find number of 1s
      – next largest smaller
      – smallest larger number
      – determine if is palindrom
      – itoa, atoi
      – add 2 numbers w/o using + or arithmetic operators
      – implement *, -, / using only +
      – find max of two numbers w/o comparison
      – swap two numbers with +/-
      – swap two numbers with ^
      – given an integer, find the closest number that is palindrome
      – implement putlong() by putchar()
   2. Bit array
   3. Linked list
      – find cycle,
      – find position of cycle starts
      – reverse LL
      – delete a node in middle
      – each node contains a value pointer pointing to a node,
        duplicate LL.
      – remove duplicates from sorted/un-sorted LL.
      – find n-th to last node to end
      – number is represented by LL, add 2 numbers
   4. Array
      – Longest common substring (LCSubstr)
      – Longest common subsequence (LCS).
      – Longest increasing subsequence (LIS).
      – Longest palingdrome in string.
      – array, elements are +/-, find subsequence of max sum
      – circular array, elements are +/-, find subsequence of max sum
      – find all pairs of integers add up to a sum
      – find all pairs of integers add up to a sum,
        integers are +/- and sorted
      – find one missing number in N numbers in range [0, N]
      – find two missing number in N numbers in range [0, N].
      – binary search circular array
      – Given {a1, a2, a3, ..}, {b1, b2, b3, …},
        get {a1, b1, a2, b2, …}
      – Given 2 arrays A and B, A large enough to hold both,
        merge B into A.
   5. String
      – KMP, Rabin-Karp, Boyer Moore
      – reverse string
      – reverse words in string 
      – strcpy, strcmp, strstr, atoi, itoa, strdup
      – remove duplicate characters in O(1) space
      – Given dictionary, transform one word to another of same length.
      – Given large text, find min cover distance of n words.
      – find longest word made of other words
      – find first non-repeated char
      – remove specified char from a string
   6. Matrix
      – matrix elements are +/-, find submatrix of max sum
      – rotate a matrix by 90 degrees
      – each cell is black/white, find max subsquare with black border.
      – binary matrix, find largest square matrix with 1s
      – binary matrix, find largest rectangle matrix with 1s
   7. Stack
      – implement stack by queue.
      – augmented stack with O(1) push, pop, min
      – use single array to implement 3 stacks
      – sort a stack in ascending order using only
        push/pop/top/isEmpty/isFull
   8. Queue
      – implement queue by 2 stacks
   9. Priority Queue
  10. Heap
      – create heap on array
  11. Young Tableau
      – find element
      – get k-th element
  12. BST
      – pre/in/post-order traversal, recursive and iterative
      – pre/in/post-order traversal, recursive and iterative,
        with parent pointer
      – find height
      – determine IsBST
      – find "next" node of a given node in inorder sequence
      – find k-th inorder element
      – find range of elements
      – find diameter
      – find all path adding to a sum
      – Check if a tree is balanced
      – Convert sorted array into balanced BST
      – Find first common ancestor of two nodes in a BT or BST
      – Link each node to its right sibling
      – Print by level (BFS)
      – Print by level (BFS) in reverse order
      – Determine if 2 BSTs have the same structure
      – Create a mirror BT of a BT
      – Replicate a linked structure
  13. 2-3-4 Tree
  14. Red-Black Tree
  15. Splay Tree
  16. AVL Tree
  17. Trie
  18. Suffix Array
  19. Suffix Tree 
      – LCSubstr (longest common substring)
      – Longest repeated substring
      – longest palindrome
      – substring search
      – data compression
  20. B-Tree
  21. KD Tree
  22. Range Tree
  23. Hash Table
  24. Bloom filter
  25. Disjoint set
  26. Graph
      – DFS, BFS
      – find path existence between two nodes
      – Min vertice set covering all edges
      – shortest path
      – minimum spanning tree
      – min edge coverage by vertex

Sorting

   1. Bubble sort
   2. Insertion sort
   3. Selection sort
   4. Shell sort
   5. Heap sort
   6. Quick sort
   7. Merge sort
   8. N-way merge sort (external sort)
   9. Counting sort
  10. Bucket sort

Search

   1. Linear search
   2. Binary search
      – Binary search, iterative/recursive
      – find missing number is sorted array
      – search in circular sorted array
   3. Quick Select

Dynamic programming

   1. BST
   2. COV
   3. ILP
   4. KS
   5. LCS
   6. LSP
   7. MCM
   8. ODP
   9. SCP
  10. SPA
  11. SPC
  12. TSP
  13. Given array a[], when i < j, get max(a[i] – a[j]).
  14. levenshtein edit distance
  15. Coin Change problem.

Large-scale system

   1. Bloom filter
   2. Bit-array/bit-map
   3. Heap
   4. Hash table
      – d-left hashing
   5. Sub-division
   6. Database indexing
   7. Inverted index
   8. External sort
   9. Map-reduce

Discrete math, Probability and Statistics, Numerical Computation

   1. Permutation
      – 3 colors, how many ways to color a cube?
      – robot, ways to go to diagonal corner on NxN matrix?
      – print all combinations of valid n-pairs of parentheses
      – print all subsets of a set
   2. Combination
   3. Sampling
   4. Random number generator
      – What’s a good random number generator?
      – Given random generator [1, 2, 3, 4, 5],
        generate random in [1..7].
   5. Reservoir sampling
   6. Find median in stream
   7. Card shuffling
   8. Primality testing
   9. Find prime numbers: naive, sieve of Eratosthenes, sieve of Atkin
  10. Randomized primality testing, what’s good random generator
  11. Fibonacci sequence
  12. Factorial numbers
  13. Frobenous numbers
  14. Newton-Ralphson algorithm
  15. Bayes theorem

Computational algebra

   1. Convex-hull
   2. Closest pairs

Computational theory

   1. Automata theory
   2. DFA
   3. NFA
   4. Regular language
   5. Pumping lemma
   6. Turing machine
   7. NP-completeness
         1. TSP
         2. Vertex-cover problem
         3. Set-covering problem.
         4. Subset-sum problem.

OS

   1. Process and thread
   2. Semaphore, mutex, monitor
   3. Function call/call frame
   4. Context switch
   5. Multi-threading
   6. Multi-process
   7. Thread safety
   8. Big/Little-endian
   9. Heap/stack
  10. Malloc/free
  11. Virtual memory, page fault, thrashing
  12. DMA (Direct Memory Access)

Networking

   1. 7-layer OSI model
   2. 4-layer TCP/UDP model
   3. TCP/UDP
   4. TCP 3-way handshake (ACK machanism),
      flow control, congestion control
   5. Things happen after entering url
   6. Routing protocols: BGP, OSPF, RIP
   7. Subnet mask, packet routing on same/different network.
   8. Performance

Database

   1. Normalization
   2. External sorting
   3. B-tree, B+-tree.
   4. Relational algebra

Compiler

   1. LL, SLR, LALR, LR, GLR
   2. recursive precedence
   3. Operator precedence
   4. Postfix evaluation of arithmetic expression
      – implement a calculator

C/C++/Java

   1. const char *, char * const, const char * const
   2. static
   3. volatile
   4. explicit
   5. Object/class
   6. Inheritance
   7. Encapsulation
   8. Polymorphism
   9. operator overloading
  10. Composition/inheritance
  11. Interface, abstract class
  12. Struct/class
  13. 4 default methods of a C++ struct/class
  14. deep copy/shallow copy
  15. C++ name hiding
  16. C++ smart pointer
  17. friend function/class
  18. Multiple inheritance
  19. Virtual inheritance
  20. Constructor
  21. Copy/assignment constructor
  22. Virtual destructor
  23. Virtual function, vtable
  24. Pure virtual function
  25. Macro, typedef, inline
  26. C, C++, Java comparison
  27. Garbage collection
  28. Dangling pointer, free null pointer, memory leak
  29. New/Delete
  30. Malloc/free/realloc/calloc
  31. Lock
  32. Dead lock’s four conditions
  33. #pragma directive
  34. Exception handling
  35. try/catch/finally
  36. final, finally, finalize
  37. Java object reflection
  38. C++ templates, java generics
  39. Effect of keeping constructor private
  40. Pass by Value, reference, pointer
  41. Reference v.s. pointer
  42. In-memory file system data structures and algorithms?
  43. Implement singleton
  44. Implement singleton w/o static/global variable
  45. Thread programming possible problems
  46. sizeof operator.
  47. Java: vector v.s. ArrayList
  48. int (a*)[10]
  49. Implement a lock.
  50. Implement a buffer for DataOutputStream.
  51. awk, tr, uniq, grep

Other problems

   1. 2 eggs, 100 floors, find floor that breaks egg
      minimizing number of drops.
   2. 5 quart jug and 3 quart jug, measure 4 quarts of water.
   3. 100 lockers, open every other i-th locker (i = 1, 2, …, 100).
      Final open?
   4. Men on island, can see hat on others only. N men, C hats,
      days to remove?
   5. 8/12 balls, find the one lighter/heavier
   6. 8/12 balls, find one weighs different
   7. 2 fuses each burns in 1 hour, measure 45 minutes
   8. Bridge crossing, 1, 2, 5, 10. Minual number to pass bridge
   9. Orange, apple, orange and apple, all labeled wrong. Find out.
  10. 3 light switches, only one can be on at a time. Find it out.
  11. Find the biggest, 2 biggest, biggest & smallest
  12. n*m*k cube, how many are on the surface?
  13. Test a pen, ATM machine, webpage, vending machine, program crash?
  14. Given phone #, print all word representations on phone pad.
  15. Find overlap of rectangles
  16. Find median of two sorted arrays.
  17. N computers each hold N numbers. Find median of these N*N numbers.
  18. Recontruct a BT from pre/in/post-order traversal
  19. Recontruct a BST from pre/in/post-order traversal
  20. Find longest prefix common to all strings
  21. Implement LRU cache system, O(1) find and update
  22. Shifted sorted array, rotate.
  23. Histogram, find max internal rectangle.
  24. Tournament problem
  25. N people, 1 celebrity, find celebrity in O(n) time.
  26. 4 jars, 1 polluted so pills weigh +1, find out which jar
  27. 25 horses, 5 horses maximal each match. Find the fastest 3
  28. Mirror, why left/right reversed, not up/down?
  29. How is next_permutation() in STL implemented?
  30. N line segments on number axis, calculate common coverage
  31. wild card match on patterns * (0-n) and ? (1).
  32. Find number of trailing zeros in n!
  33. Print square matrix in a spiral inwardly.
  34. Find one’s phone number given resume only
  35. N stairs, each time can go up 1 or 2. How many ways to go up?
  36. Find majority element in an array.
  37. Two cubes as a calendar
  38. Coin change problem
  39. Josephus Circle, last survivor?
  40. Pick marbles, strategy to win?
  41. Get sequence 1, 11, 21, 1211, …
  42. C program that prints itself
  43. Print week given date
  44. enter code, allow one miss
  45. Check equality of two number sets
]]> http://chengjun198247.wordpress.com/2010/05/13/%e5%87%86%e5%a4%87interview%ef%bc%8b%e7%9c%8bnba/feed/ 8 chengjun198247 http://chengjun198247.wordpress.com/2009/12/04/%e6%9a%b4%e7%ac%91%e7%9a%84paper%ef%bc%8c%e5%a4%aa%e6%9c%89%e6%89%8d%e4%ba%86/ http://chengjun198247.wordpress.com/2009/12/04/%e6%9a%b4%e7%ac%91%e7%9a%84paper%ef%bc%8c%e5%a4%aa%e6%9c%89%e6%89%8d%e4%ba%86/#comments Fri, 04 Dec 2009 06:49:11 +0000 chengjun198247 http://chengjun198247.wordpress.com/2009/12/04/%e6%9a%b4%e7%ac%91%e7%9a%84paper%ef%bc%8c%e5%a4%aa%e6%9c%89%e6%89%8d%e4%ba%86 ]]>   今天在网上搜了几篇paper看，没想到看到一篇非常有才的paper。这审查paper的人也太水了吧。

]]> http://chengjun198247.wordpress.com/2009/07/06/erie-lake%e4%b8%80%e6%97%a5%e6%b8%b8%e7%8b%82%e5%90%83%e6%a8%b1%e6%a1%83/feed/ 4 chengjun198247 http://chengjun198247.wordpress.com/2009/06/24/%e7%a0%94%e7%a9%b6%e5%a4%a7%e9%9d%9e%e4%b9%8b%e9%97%b4%e7%9a%84%e6%95%85%e4%ba%8b/ http://chengjun198247.wordpress.com/2009/06/24/%e7%a0%94%e7%a9%b6%e5%a4%a7%e9%9d%9e%e4%b9%8b%e9%97%b4%e7%9a%84%e6%95%85%e4%ba%8b/#comments Tue, 23 Jun 2009 19:24:16 +0000 chengjun198247 http://chengjun198247.wordpress.com/2009/06/24/%e7%a0%94%e7%a9%b6%e5%a4%a7%e9%9d%9e%e4%b9%8b%e9%97%b4%e7%9a%84%e6%95%85%e4%ba%8b ]]>

 

    最近研究了下最近涨得比较厉害的个股，当然除了钢铁，铁路，银行，高速等大盘股，以及st例外。前期长期放量，有大资金明显介入，但之后缩量横盘