H****r
发帖数: 2801 | 1 The problem:
Create a solution that can manage a variable number of FIFO byte queues,
each with a variable length that is located in a small, fixed amount of
memory.
You cannot use dynamic memory allocation (new, malloc). All memory
allocation must be static. The maximum size allowed for storage of the
queued data is MAX_DATA_SIZE. You may statically allocate as much additional
memory as you choose, but remember that efficiency is important.
On average, while the system is running, there will be | H****r
发帖数: 2801 | 2 哎怎么没人回。 用linked list + freeList做了下，果然只能处理到8个80byte的
queue...
第一个post出正确思路的有包子...
additional
queues
have
【在 H****r 的大作中提到】
: The problem:
: Create a solution that can manage a variable number of FIFO byte queues,
: each with a variable length that is located in a small, fixed amount of
: memory.
: You cannot use dynamic memory allocation (new, malloc). All memory
: allocation must be static. The maximum size allowed for storage of the
: queued data is MAX_DATA_SIZE. You may statically allocate as much additional
: memory as you choose, but remember that efficiency is important.
: On average, while the system is running, there will be
| m********0
发帖数: 2717 | 3 我是路过的，你贴的这个网站有意思。
education：
Masters Degree in Computer Science with Distinction
2004 - 2007 New York Institute of Technology
Bachelors Degree in Computer Information Systems
Minor in Computer Graphic Design
2000 - 2004 Baruch College
竟然在about me中间大言不惭地说：
.: Why I am better than the other guy
I am one of the rare few that loves coding.
I code for fun. I code whenever I have spare time.
I feel that this shows that I have plenty of promise and strong
determination to not only work but thrive in | j**4
发帖数: 10425 | 4 why 大言不惭? very normal ah. |
|
