std::array: The Middle Ground Between C Arrays and std::vector

C++ Bits: Post 3 The sizeof Trap: Why Is Your Class Bigger Than You Think? Quick what's the output of the code in the image given below? If you said both are 4... you just fell into one of C++'s most classic interview traps. sizeof(A) is indeed 4 bytes , just one int, nothing else. But sizeof(B)? On most 64-bit systems, it's 16 bytes. Not 4. Not even 12. Where did the extra 12 bytes come from? The moment you add the virtual keyword, the compiler secretly injects a hidden pointer called the vptr (virtual pointer) into every object of that class. This vptr points to a vtable , a per-class lookup table of function pointers that enables runtime polymorphism. On a 64-bit system, that hidden pointer is 8 bytes. So your object is now 4 (int) + 8 (vptr) = 12 bytes. But wait , the compiler also adds padding to align the object to an 8-byte boundary. So 12 becomes 16. Let's break it down: → class A: [int x = 4B] → Total: 4 bytes → class B: [vptr = 8B] + [int x = 4B] + [padding = 4B] → Total: 16 bytes One keyword. Triple the memory. And if you're allocating millions of objects, that difference isn't trivial ,it's a design decision. This is exactly why some performance-critical codebases (game engines, embedded systems) deliberately avoid virtual functions. The overhead isn't the virtual call , it's the memory bloat across millions of objects. Next time someone says "just make it virtual," remember: polymorphism isn't free. The compiler is quietly billing you 8 bytes per object, plus padding. What's the sneakiest sizeof result you've encountered in an interview or codebase? Let's hear it below. #CPP #Cplusplus #SoftwareEngineering #TechTrivia #Programming #BackendDevelopment

👉 Question-51 A strong understanding of memory usage, pointer aliasing, and variable lifetime is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> #include <stdlib.h> int main() { int *p = (int *)malloc(sizeof(int) * 2); int *q = p; p[0] = 10; p[1] = 20; free(p); q[0] = 30; int *r = (int *)malloc(sizeof(int) * 2); printf("%d %d\n", q[0], r[0]); return 0; } Options: A) 30 0 B) 30 30 C) Garbage Garbage D) Runtime error / undefined behavior 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> p and q point to same memory --> After free(p) → memory is invalid --> malloc may reuse same memory --> Behavior becomes unpredictable #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

There was a project some years ago where the customer wanted the firmware written in C++. Object oriented, clean abstractions, the works. The hardware was a small microcontroller with extremely limited RAM and no dynamic memory allocation — no heap, effectively. C++ without new and delete feels like cooking without fire. Technically possible. Deeply uncomfortable at first. The team's initial reaction was to push back and ask for either more capable hardware or permission to use C. Neither was on the table. The hardware was fixed. The language preference was fixed. So we had to figure it out. What followed was one of the more interesting firmware exercises I have been part of. We used placement new to work with statically allocated memory pools. Every object had a fixed home determined at compile time. Templates replaced what would normally be runtime polymorphism. The linker script became something we understood intimately rather than accepted as given. It was constrained. It was occasionally maddening. But the output was genuinely clean firmware that the customer's team — used to higher level C++ — could read and maintain without needing to relearn how to think. The lesson I took from it was not a technical one. It was that constraints force a quality of thinking that comfort never does. Some of the cleanest designs I have seen came out of situations where the easy path was simply not available. The projects that stretch you the most are rarely the ones with the best specs. What is the tightest constraint a project has ever pushed you through? #CPlusPlus #EmbeddedSystems #Firmware #Engineering #PandianPosts #Embien

👉 Question-55 A strong understanding of double pointers, dynamic memory allocation, pointer arithmetic, and function behavior is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> #include <stdlib.h> void modify(int **p) { *p = (int *)realloc(*p, sizeof(int) * 3); (*p)[2] = (*p)[0] + (*p)[1]; (*p)[0] = 100; } int main() { int *arr = (int *)malloc(sizeof(int) * 2); arr[0] = 10; arr[1] = 20; int **ptr = &arr; modify(ptr); printf("%d %d %d\n", arr[0], arr[1], arr[2]); free(arr); return 0; } Options: A) 100 20 30 B) 10 20 30 C) 100 20 120 D) Garbage value 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> realloc may change memory location --> (*p)[2] depends on old values --> Order of updates matters --> Double pointer allows modification of original pointer #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

Time for a C-Programming Deep Dive! Pointers are often where the gap between "knowing" C and "mastering" C becomes clear. Can you predict the exact output of this code without running it in a compiler? The Challenge: #include <stdio.h> int main() { int arr[] = {10, 20, 30, 40, 50}; int *ptr = arr; printf("%d, ", *ptr++); printf("%d, ", *++ptr); printf("%d, ", ++*ptr); printf("%d", (*ptr)++); return 0; } How to participate: Work out the logic for each printf statement. Drop your answer in the comments below. Explain why the third and fourth outputs are particularly tricky! I’ll be liking the correct answers and posting the full technical breakdown of the operator precedence involved in 24 hours. Let's see who gets it 100% right! 🎯 #CProgramming #EmbeddedSystems #VLSI #CodingChallenge #SoftwareEngineering #Pointers #ProgrammingQuiz

👉 Question-47 A strong understanding of dynamic memory allocation, pointer arithmetic, and memory boundaries is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> #include <stdlib.h> int main() { int *p = (int *)malloc(sizeof(int) * 2); p[0] = 10; p[1] = 20; *(p + 2) = 30; printf("%d %d %d\n", p[0], p[1], p[2]); return 0; } Options: A) 10 20 30 B) 10 20 Garbage value C) Runtime error / undefined behavior D) 30 20 10 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> Memory allocated for only 2 integers --> Accessing p[2] is out of bounds --> Leads to undefined behavior #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

👉 Question-41 A strong understanding of strings, pointers, pointer arithmetic, and memory behavior is essential in systems programming and embedded development. Assume: --> char = 1 byte --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> int main() { char str[] = "ABCDE"; char *p = str; p[2] = '\0'; printf("%s %lu %lu\n", str, sizeof(str), strlen(p)); return 0; } Options: A) ABCDE 6 5 B) AB 6 2 C) AB 5 2 D) ABC 6 3 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> '\0' terminates string early --> sizeof gives total array size --> strlen stops at first '\0' #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

👉 Question-40 A strong understanding of pointers, functions, parameter passing, and side effects is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> void fun(int *p, int q) { *p = *p + q; q = q + 10; } int main() { int a = 5, b = 10; fun(&a, b); printf("%d %d\n", a, b); return 0; } Options: A) 15 20 B) 15 10 C) 5 20 D) 5 10 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> *p modifies original variable --> q is passed by value --> Changes to q do NOT reflect in main() #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

👉 Question-50 A strong understanding of stack vs heap memory, variable lifetime, and pointer behavior is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> #include <stdlib.h> int* fun() { int x = 10; return &x; } int main() { int *p = fun(); printf("%d\n", *p); return 0; } Options: A) 10 B) 0 C) Garbage value D) Compilation error 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> x is stored in stack --> Returning address of local variable is invalid --> Memory becomes undefined after function returns #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers

👉 Question-54 A strong understanding of malloc, realloc, NULL handling, and memory allocation failure is essential in systems programming and embedded development. Assume: --> int = 4 bytes --> Default compiler behavior 👉 What will be the output of the following code❓ #include <stdio.h> #include <stdlib.h> int main() { int *p = (int *)malloc(sizeof(int) * 2); p[0] = 5; p[1] = 10; int *temp = (int *)realloc(p, 0); if (temp == NULL) printf("Freed\n"); else printf("%d\n", temp[0]); return 0; } Options: A) 5 B) 10 C) Freed D) Garbage value 💬 Kindly drop your answer in the comments along with your reasoning. ⚠️ Small hint: --> realloc(ptr, 0) behaves like free(ptr) --> May return NULL --> Memory is released #CProgramming #EmbeddedSystems #FirmwareDevelopment #Pointers