int *ptr;

*int ptr;

pointer int ptr;

int ptr;

To create a new thread in a program.

To initialize variables to zero.

To allocate memory dynamically.

To free up memory after use.

Use 'free(pointer)' for malloc/calloc/realloc and 'delete pointer' for new.

Use 'dispose(pointer)' for malloc/calloc/realloc

Invoke 'clear(pointer)' to free memory

Call 'remove(pointer)' for new allocations

'fopen' opens a file; 'fclose' closes a file.

'fopen' opens a directory; 'fclose' opens a file.

'fopen' deletes a file; 'fclose' creates a file.

'fopen' reads a file; 'fclose' writes to a file.

Use read() to directly access the file contents.

Use file_get_contents() to read the entire file at once.

Use fopen() to open the file, then read with fscanf() or fgets(), and close with fclose().

Open the file with open() and read using readlines().

A structure in C is a way to define constants.

A structure in C is a function that performs calculations.

A structure in C is a user-defined data type that groups different data types together.

A structure in C is a built-in data type for integers.

struct { member1: dataType; member2: dataType; };

struct StructName { dataType member1; dataType member2; dataType member3; };

struct StructName { member1, member2; };

struct StructName { dataType member1; dataType member2; ... };

Dynamic memory allocation allows programs to allocate memory during execution, adapting to varying data needs.

Dynamic memory allocation refers to the fixed allocation of memory for data structures.

Dynamic memory allocation is the process of allocating memory at compile time.

Dynamic memory allocation is a method to free up all memory used by a program at once.

int *array = (int *)malloc(n * sizeof(int));

int array[n];

int *array = (int *)malloc(sizeof(int));

int *array = malloc(n);

To determine the size of a data type or object in bytes.

To find the maximum value of a data type.

To convert data types between different formats.

To calculate the memory allocation for a variable.

Call fwrite() without opening a file first.

Use scanf() to read data from a file.

Use fclose() before writing any data.

Use fopen() to open a file, fprintf() or fwrite() to write data, and fclose() to close the file.

A linked list is a static data structure that cannot change size.

A linked list is a linear data structure where each element points to the next, forming a chain.

A linked list is a collection of unordered elements.

A linked list is a type of tree structure.

Use an array to store the elements directly.

Create a class for the linked list instead of a struct.

Implement linked list using only pointers without a struct.

Define a struct for the node, e.g., 'struct Node { int data; struct Node* next; };'.

Stack memory is for dynamic allocation and is slower.

Stack memory can grow indefinitely while heap memory is fixed.

Stack memory is for static allocation and is faster; heap memory is for dynamic allocation and is more flexible.

Heap memory is for static allocation and is less flexible.

Use the '*' operator to dereference the pointer.

Use the '->' operator to get the value of the pointer.

Access the pointer value directly without dereferencing.

Use the '&' operator to access the pointer.