I've searched the forums high and low about the different approaches on optimization, memory management, and speed, but whenever I find something interesting, either the next poster or a simple test proves it wrong, so I have a couple of questions, mostly basics, that I'd really like to know:

1-Why is boolean 16-bit? Isn't it supposed to hold 1 bit of data, either 1 or 0? Why not switch all booleans with bytes then?

2-Is there any difference in the performance of IF-blocks and SelectCase-blocks?

3-Could someone please explain in-depth what the 'Advanced Optimizations' do? Ok, I understand that "Remove Array Bound Checks" removes arrays boundaries, but what does aliasing mean? It isn't visual aliasing, is it? Or what are "FDIV" checks?

4-From my tests, it seems that each time an array(I tested mostly with UDT arrays) is redimensioned with only one element(0), some parts of it are left in memory, which clogs it quite a lot over time. Is there a way around this?

5-In binary reading mode, skipping data with Seek doesn't seem to give different performance from Getting the data. Is that correct?

6-Using a benchmarking module by one of the forum members(sorry, can't remember the UN), I found that simple mathematical operations on integers\longs are performed faster than on bytes. Is the module flawed, or is it supposed to happen?

7-Getting the data by small chunks seem to be around 10x slower than reading it once. Why would that happen?

Thanx in advance!