Explanation

A void* pointer is a generic pointer that can hold the address of any data type.

Before dereferencing, it must be typecast to the appropriate pointer type.

Explanation

The * operator, called the dereference operator.

It is used to access the value stored at the pointer’s address.

& gives the address, [] is for arrays, and -> accesses members of a struct via pointer.

Explanation

Dynamically allocated memory using functions like malloc or new is stored in the heap segment.

Heap memory persists until explicitly deallocated, unlike stack memory.

Explanation

Stack memory stores return addresses, local variables, and function parameters during a function call.

This allows the program to resume execution correctly after the function finishes.

Explanation

for loops are ideal for iterating over rows and columns in 2D arrays with known sizes.

Nested for loops provide clear structure and indexing for accessing array elements.

Explanation

while loop is ideal when iterations depend on a condition rather than a fixed count.

It continues looping until the condition becomes false, making it flexible for unknown iterations.

Explanation

switch handles multiple discrete values of a variable more clearly than nested if-else statements.

It improves readability and structure in complicated decision-making scenarios.

Explanation

Standard C (before C99) does not have a built-in bool type; _Bool was introduced in C99.

int, long, and char are standard primitive data types in C.

Explanation

2's complement allows easy addition and subtraction of signed integers without extra logic.

It eliminates the problem of having two zeros, unlike sign-magnitude or 1's complement.

Explanation

unsigned int cannot store negative numbers, so its range shifts from -2³¹ to 2³¹-1 to 0 to 2³²-1.

The memory size remains the same (4 bytes).