avatar
l*2
2
1. tree level order traversal
2. number of 1 bits
3. multiple readers, multiple writers
readers can read same time
only one writer can write at the same time
when there is one reader reading, no writing is allowed.
when there is one writer writing, no reading is allowed
4. write a program to occupy 50% CPU
50% time busy, 50% idle
avatar
h*n
3
google freerapid

【在 s*********0 的大作中提到】
: 下载成video或者audio?
: 付费软件也行啊
: 谢谢

avatar
w*3
4
lz最后一题是个什么思路?
avatar
l*i
5
火狐的插件
avatar
l*2
6
take a system time,
then do a for loop of 1000 times,
check system time again
then we know how much time 1000 loop will take
and then take more loop if needed to get 1ms of cpu busy,
then sleep 1ms.

【在 w*********3 的大作中提到】
: lz最后一题是个什么思路?
avatar
l*2
7
take a system time,
then do a for loop of 1000 times,
check system time again
then we know how much time 1000 loop will take
and then take more loop if needed to get 1ms of cpu busy,
then sleep 1ms.

【在 w*********3 的大作中提到】
: lz最后一题是个什么思路?
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。