Search Results

Search found 4 results on 1 pages for 'user297850'.

Page 1/1 | 1 

• LRU cache design

  - by user297850

  Least Recently Used (LRU) Cache is to discard the least recently used items first How do you design and implement such a cache class? The design requirements are as follows: 1) find the item as fast as we can 2) Once a cache misses and a cache is full, we need to replace the least recently used item as fast as possible. How to analyze and implement this question in terms of design pattern and algorithm design?

  Read the article

• Will the following program cause any problem during compiling and execution process?

  - by user297850

  Will the following program cause any problem during compiling and execution process? class A{ public: virtual void foo(){} }; class B:public A{}; int main(){ B b; b.foo(); }

  Read the article

• What's the difference of pData1 and pData2, which are build as follows

  - by user297850

  What's the difference of pData1 and pData2, which are build as follows: Blockquote pData1 = (int*) calloc (i,sizeof(int)); Blockquote int * pData2 = (int*) calloc (i,sizeof(int));

  Read the article

• Comparing the "array" with "single direction linked list", what are the pros and cons?

  - by user297850

  Comparing the "array" with "single direction linked list", what are the pros and cons?

  Read the article

1