Since we have a virtual address space of 2^32 and each page size is 2^12, we can store (2^32/2^12) = 2^20 pages. Since each entry into this page table has an address of size 4 bytes, then we have 2^20*4 = 4MB. So the page table takes up 4MB in memory.
No, you should not. “Hello world” is a constant string literal, you need to allocate memory using malloc() in C, or new in C++ if you want memory you are free to modify.
The delete operator deallocates memory and calls the destructor for a single object created with new. The delete [] operator deallocates memory and calls destructors for an array of objects created with new []. Using delete on a pointer returned by new [] or delete [] on a pointer returned by new results in undefined … Read more
I have found the answer to my question myself:) So what I didn’t understand was how the glibc could differentiate between a Segfault and a corrupted double-linked list, because according to my understanding, from perspective of glibc they should look like the same thing. Because if I implement a double-linked list inside my program, how … Read more
No, you’re not allocating memory for y->x twice. Instead, you’re allocating memory for the structure (which includes a pointer) plus something for that pointer to point to. Think of it this way: So you actually need the two allocations (1 and 2) to store everything. Additionally, your type should be struct Vector *y since it’s a pointer, and you should never cast the return value … Read more
You can catch it like any other exception: Quite what you can usefully do from this point is up to you, but it’s definitely feasible technically.