隐秘恋情大放送:靖王粗暴狂吻夏冬# TVChinese - 中文电视
x*k
1 楼
一家IB的Analytics developer的onsite,只记得部分题目,一些比较简单的题目就不
写了。括号后是我认为的答案或者提示。
1. write a iterative function to calculate fibonacci sequence
2. what is the difference of Delete table and truncat table.(about sql &
database)
3. what is ACID.(about sql or database)
4. write a find() for BST, How to decide the element could not be found.((
less than && No left child) || (large than && no right child))
5. how to reverse a link list using one point
(should I use recursive calling)
6. find the sizeof(int) without using sizeof(). (大家可以讨论一下,我用(~
0x0)右移位做的,但是不对方希望的答案)
7. main()
{
folk();
folk();
folk();
printf("abc\n");
}
How many abc will be printed?
8. what is the difference between.
kill proces_id
kill -9 process_id
另外一家类似职位的电面,全部是stl的问题,很简单。
1. new a vector, what is the size(),
2. how to prevent relocation when push elements into a vector. (reserve())
3. why vector use relocation instead of chunks of memory.(keep compatible
with C array)
4. how is deque implemented?(uses chunks of memory)
5. the different of set & map? what is the return value of find()? (an
iterator of element )
6. what is the member function needed to use set.find() or map.find().(less(
))
7. what if the element class doesn't have less() operator? (pass a functor
to constructor as comparing function)
8. for loop to find a element in a vector, what is the method the class need
to support? (equal operator)
9. For smart pointer, How it implement the reference counter(a pointer to a
int or unsigned int)
发挥得一般,不是技术问题,感觉表现得不够活跃。面完后觉得还是很不错的职位。求
bless!
写了。括号后是我认为的答案或者提示。
1. write a iterative function to calculate fibonacci sequence
2. what is the difference of Delete table and truncat table.(about sql &
database)
3. what is ACID.(about sql or database)
4. write a find() for BST, How to decide the element could not be found.((
less than && No left child) || (large than && no right child))
5. how to reverse a link list using one point
(should I use recursive calling)
6. find the sizeof(int) without using sizeof(). (大家可以讨论一下,我用(~
0x0)右移位做的,但是不对方希望的答案)
7. main()
{
folk();
folk();
folk();
printf("abc\n");
}
How many abc will be printed?
8. what is the difference between.
kill proces_id
kill -9 process_id
另外一家类似职位的电面,全部是stl的问题,很简单。
1. new a vector, what is the size(),
2. how to prevent relocation when push elements into a vector. (reserve())
3. why vector use relocation instead of chunks of memory.(keep compatible
with C array)
4. how is deque implemented?(uses chunks of memory)
5. the different of set & map? what is the return value of find()? (an
iterator of element )
6. what is the member function needed to use set.find() or map.find().(less(
))
7. what if the element class doesn't have less() operator? (pass a functor
to constructor as comparing function)
8. for loop to find a element in a vector, what is the method the class need
to support? (equal operator)
9. For smart pointer, How it implement the reference counter(a pointer to a
int or unsigned int)
发挥得一般,不是技术问题,感觉表现得不够活跃。面完后觉得还是很不错的职位。求
bless!