|
Tridip Bhattacharjee wrote: is there any book which i can download its pdf version
Do not ask that here again!
Most (if not all) PDF copies of books are in violation of copyright: and we do not support that in any way, shape, or form. Bear in mind that nearly all of the 11 million member here are in the business of getting paid to write something it is very easy to copy and download and you might see part of why! You will not get links to anything illegal or immoral here.
And if you ask again, there is a good chance you may be banned from the site...permanently.
There are several different type of heap in .NET - and it really does get complicated. Seriously, find a book - and buy it - it will be able to go into such things in a lot more detail than we can here.
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
|
i am very sorry but it would be helpful if you suggest any book name which help me to understand memory management including heap & stack. looking for help. thanks
tbhattacharjee
|
|
|
|
|
No, since you have already indicated that you are planning on downloading it.
We don't encourage that at all.
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
|
OriginalGriff wrote: Most (if not all) PDF copies of books are in violation of copyright:
Eh?
There are most definitely books one can download in pdf format for free which do not violate copyright.
Given the sum total of all books ever in print then one might suppose that pdfs of all of those, percentage wise, would be violating copyrights.
However books published in the past 20 years, either popular ones or those with a low sell rate can be found for free, legally, or for sale, again legally, at various places. All in pdf format.
And this includes programming.
One might hypothesize that most, percentage wise, of the good books on programming would in fact require a payment. But would be downloadable.
And if one expands the definition the percentage is going to go up when one considers content from e-books.
|
|
|
|
|
just tell me a books name which discuss in details how memory is allocated when we run our program. thanks
tbhattacharjee
|
|
|
|
|
Have a search through the MSDN magazine back issues. They have a lot of great information there.
|
|
|
|
|
if possible give me some good link from MSDN magazine which relevant for my question.
tbhattacharjee
|
|
|
|
|
There's a legal PDF Book linked here: http://www.codeproject.com/Messages/4977275/free-introductory-book-on-Csharp-programming-from.aspx[^]
I don't know if it covers memory management but it probably contains other useful stuff.
Tridip Bhattacharjee wrote: share knowledge if you know what is high frequency heap?
The CLR (Common Language Runtime) uses the high frequency heap to store frequently used data required to run a .Net program, e.g. method tables. It's nothing that's particularly important to know for writing a .Net application.
|
|
|
|
|
thanks for your time and explanation. would you mind to discuss briefly what is high frequency heap and how it is different than a normal heap?
i hard the static class related info stored in high frequency heap but not sure is it true or not. why static class related info stored in heap? looking for your guidance.
tbhattacharjee
|
|
|
|
|
Seriously, we aren't here to do your thinking and research for you. I take it you have an interview soon. You cannot possibly cram in enough to bluff your way through based on random questions. You have been posting questions here long enough to have figured out that you need to learn the basics first. Richard has given you a great book to get started with. Beyond this, if you need to know things like the high frequency heap, then you need to learn how to use google and apply some critical thinking. Learning is your responsibility.
|
|
|
|
|
Tridip Bhattacharjee wrote: i heard that reference type stored in heap and their corresponding value stored in stack.
No. The instance (which holds the actual values) is always on the heap: only the reference to the instance is ever on the stack.
Let's think about instances for a moment.
What is an instance?
Basically, it's a specific example of something. "Car" is a generic idea - you know what a car is, it's got an engine, four wheels, that sort of thing. But a generic idea is not something you can drive to the shops in: for that you need "this car", "that car", "your car", "my car" - these are instances of the generic idea. Consider this:
What colour is a Car?
You can't answer, because a generic idea doesn't have a colour.
What colour is your car?
That's a lot easier: "your car is red", or "your car is blue" - because now you are talking about an instance instead of the generic idea.
So in terms of variables all instances of a Car are stored on the Heap, but the references to them are stored on the stack:
Car myCar = new Mercedes("Red");
Car yourCar = new Bugatti("Black"); "myCar" and "yourCar" are the variables and they are on the stack - but the actual Cars the refer to are on the heap.
And when I change cars:
myCar = new BrokenDownHeapOfJunkThatWasABMWOnce(); That only changes the reference that "myCar" held - it doesn't destroy the "old" car I used to have, it just lets it be referenced by it's new owner. If you crash your car, then I could sell you my car, to get a new one myself:
yourCar.Dispose();
yourCar = myCar;
myCar = new BrokenDownHeapOfJunkThatWasABMWOnce(); The variables are the same, but the items they reference have changed.
Make sense?
Bad command or file name. Bad, bad command! Sit! Stay! Staaaay...
|
|
|
|
|
5+ from me also. 
|
|
|
|
|
See if this helps, click through the various parts
http://blogs.msdn.com/b/ericlippert/archive/2009/04/27/the-stack-is-an-implementation-detail.aspx[^]
1 The OS is asked for memory to be reserved to hold the contents of the object, the object is stored at that address on the heap. As already mentioned, the variable that points to the object is on the stack.
2 Heap
3 Performance. Allocating and deallocating memory is expensive (have a for loop from 1 to 1000000 and in that loop update an int "i = i + 1", do a second loop and in that loop concat a string s = s & "x". Time how long both loops take to execute - the string loop is doing memory allocation, the int loop isn't). With the stack the memory is already allocated, you can put things on the stack and take them off "for free". Every time you put something in the heap you need to request a memory allocation, when you take things off that memory has to eventually be deallocated.
Because the stack is a known fixed size you can't go storing Word documents in it, it would run out (make a function that just calls itself, every call puts an exit reference on the stack, after a second or so you'll get a stack overflow as you will have run out of stack space).
Also things on the stack are "last on first out", they remain in sequential order at known addresses. As the stack is pre-allocated, a "pointer" is held that references the next bit of free space. As you put something on the stack the pointer goes up, you take something off it goes down. If you have, say, an int (10), a string ("ab") and an int (20) on the stack;
Stack add 0 - 10
Stack add 1 - a
Stack add 2 - b
Stack add 3 - 20
Stack add 4 - < stack pointer points here, put something else on and this is where it goes
and then wanted to change the string from "ab" to "abc"...where do you store the "c"? There is no space as your second int is on top of it so to increase the string from "ab" to "abc" would require reordering everything above it. So you can only put things on the stack that don't change in size. An int is always going to be 32 bits for example (depending on os and hardware).
5 Value types, things of known, unchangeable sizes, tend to go on the stack. "objects" of unknown sizes that can grow and shrink go on the heap. Of course value types can end up on the heap too due to things already mentioned, due to boxing, static variables etc, but reference types will never end up on the stack.
Note to everyone: Obviously many things in here are simplified for basic understanding, there's no need to be pedantic
|
|
|
|
|
thanks for the answer but still few lines are not very clear. can u plzz explain it more elaborately in easy way.
you said not clear "As you put something on the stack the pointer goes up, you take something off it goes down. If you have, say, an int (10), a string ("ab") and an int (20) on the stack;
Stack add 0 - 10
Stack add 1 - a
Stack add 2 - b
Stack add 3 - 20
Stack add 4 - < stack pointer points here, put something else on and this is where it goes
and then wanted to change the string from "ab" to "abc"...where do you store the "c"? There is no space as your second int is on top of it so to increase the string from "ab" to "abc" would require reordering everything above it. So you can only put things on the stack that don't change in size. An int is always going to be 32 bits for example (depending on os and hardware).
2) you said but not clear "Of course value types can end up on the heap too due to things already mentioned, due to boxing, static variables etc,"
tbhattacharjee
|
|
|
|
|
The heap is just a big section of memory that you can allocate if you need, it's a free-for-all where objects are placed wherever there is space. A stack in a small, pre-allocated piece of memory that you use in a specific way.
Imagine a stack of plates. Each time you want to store something you place it on the top of the stack of plates. On top of the existing plates is the only place a new plate can go. To take plates off, you can only take off the top plate.
Think of this code
function A()
{
int x = 1;
Person p = new Person();
B();
int y = 2;
}
function B()
{
int x = 100;
}
When "A" is run, 1 is put on the stack for x
Stack address: value at that address
0: 1 (x)
1: 0
3: 0
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
A new "Person" is created so a memory allocation request is made and the OS gives you memory address 10,000, so your Person data is stored at memory address 10,000 on the heap. "p" is actually the number 10,000, ie the place on the heap the Person can be found, so p goes on the stack
0: 1 (x)
1: 10,000 (p)
3: 0
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
The code has to call "B", however it needs to know where to come back to after B, so the address in memory of the current line of code is stored on the stack. Let's say that is address 1234
0: 1 (x)
1: 10,000 (p)
3: 1234 (ref to code in function A)
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
Now stack slots 0, 1 and 3 belong to function "A" and we start running code in "B". "B" defines x as 100 so that goes on the stack.
0: 1 (x)
1: 10,000 (p)
3: 1234 (ref to code in function A)
4: 100 (x)
5: 0
6: 0
7: 0
8: 0
9: 0
So stack spots 0-3 belong to A and 4 belongs to B. B is done so we de-allocate everything it put on the stack
0: 1 (x)
1: 10,000 (p)
3: 1234 (ref to code in function A)
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
To work out where to go back to we read the top-most value of the stack (1234) and resume executing the code at that address. As we have read the value off the stack we also remove it
0: 1 (x)
1: 10,000 (p)
3: 0
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
This will take us back to the "int y = 2" line in A. Note that not only are we back in the code for A right where we left off, but all of A's variables are on the stack for us to access. So define y = 2
0: 1 (x)
1: 10,000 (p)
3: 2 (y)
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
A finishes so all of its variables are taken from the stack, and as "p" was a reference, the object at that reference is disposed and eventually the garbage collection will deallocate its memory, allowing address 10,000 to be freed for use by other things.
0: 0
1: 0
3: 0
4: 0
5: 0
6: 0
7: 0
8: 0
9: 0
|
|
|
|
|
Go back and read OriginalGriff's post agian.
Tridip Bhattacharjee wrote: a string ("ab")
A String[^] is not a value type, so it does not go on the stack. You really need to go and study some reference guides. Asking questions here is not a good way to learn the internal structure or implementation of a programming language.
|
|
|
|
|
ok i will try to find out right book for memory management.
just tell me i have this code
String s="Hello";
when the above line execute then what will happen? where the value "Hello" will be stored?
in stack or heap? and where the memory location for "s" will be stored?
thanks
tbhattacharjee
|
|
|
|
|
Did you actually read the explanation that OriginalGriff posted, or the previous message that I wrote? A string is not a value type so its data will be stored on the heap. Its reference pointer s will be on the stack. If you want a simple explanation then read Charles Petzold's excellent .NET Book Zero[^].
|
|
|
|
|
|
And in response to the message you sent and then deleted: unless you actually read the book you are not likely to learn anything.
|
|
|
|
|
i read many write up like how data reader fetch data. here are few links
http://stackoverflow.com/questions/1696128/sqldatareader-a-firehose-cursor-no-buffering?lq=1
http://stackoverflow.com/questions/23467482/how-does-sqldatareader-handle-really-large-queries?lq=1
http://stackoverflow.com/questions/1383920/how-datareader-works
http://stackoverflow.com/questions/22554158/how-much-data-can-be-stored-in-network-buffer-when-datareader-is-used
people are saying that data reader fetch data in chunk and store in network buffer and display from there. when all data read completed from buffer then again database round trip occur. that why people say data reader is efficient for data reading purpose because it minimize the db round trip but still many things are not clear to me
suppose i issue a sql query like Select empid,Name from employee table there are 10,000 rows then what will happen. how much data sql server will send to client?
suppose network buffer could store 8kb data then sql server may send more than 8kb data or sql server know the client pc network buffer size in advance?
suppose first 100 data is stored in network buffer so when again db trip will occur for next 100 data then same query will executed so how sql server will know that that time sql server has to send data from 101 to 200 etc?
i like to know the above internal process in details regarding interaction between sql server and data reader. so please share the know if some one knows it in details.
one bit different question. how we can determine each row size in byte or kb programmatically by c#. if possible give me direction with sample code. thanks
tbhattacharjee
|
|
|
|
|
I wouldn't trust stackoverflow for accurate details like that. Though I don't know either, and it's not something I think the average developer really needs to know about.
Bear in mind also that each ADO.net Provider may implement different strategies to improve performance.
Tridip Bhattacharjee wrote: database round trip occur
That seems untrue, particularly for a query.
Tridip Bhattacharjee wrote: how we can determine each row size in byte
Call the GetSchemaTable method of the DataReader (https://msdn.microsoft.com/en-us/library/system.data.idatareader.getschematable(v=vs.110).aspx[^]), it will give you a DataTable describing the content of the data, including a ColumnSize column, sum up those values. Note: MAX-sized character columns may cause confusion.
modified 26-Feb-15 9:43am.
|
|
|
|
|
Hi
Dears i want to design a project in c#. i need a class library in c# who read sms from gsm modem and auto respond to that sms, auto reply sms and sms sender want to apply for leave in his company. my system read sms and apply for leave to already designed database in oracle.
please guide me with example and some comand strings for sending sms
thanks
|
|
|
|
|
|
say i hard many people like started in interview face question like to find out palindrome word writing program. so is there any web site which show basic question asked for various algo during interview.
i like similar question like palindrome word or number which many people learn during programming with c and c++ for developing logic sense.
anyone can redirect me to those web site from where i can acquire many also like palindrome which people learn during programming and also asked during interview. thanks
tbhattacharjee
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
