Data Structures and Memory Management

What is a structure in C and how is it defined?

• A structure in C is defined using the 'struct' keyword, followed by the structure name and its members enclosed in braces.

• A structure in C is a type of function that returns a value.

• A structure in C is defined using the 'class' keyword.

• A structure in C is defined with a semicolon followed by its members.

Explain the concept of a stack data structure.

• A stack can only store integers and cannot hold other data types.

• A stack is a data structure that allows random access to elements.

• A stack is a FIFO data structure that allows adding and removing elements from the bottom.

• A stack is a LIFO data structure that allows adding and removing elements from the top.

What are the main operations of a queue data structure?

• push and pop

• add and remove

• insert and extract

• enqueue and dequeue.

How do you implement a linked list in C?

• struct LinkedList { int size; struct Node* head; };

• struct Node { int data; struct Node* next; };

• struct Element { char data; struct Element* next; };

• struct List { int value; struct List* prev; };

What is the difference between an array and a linked list?

• A linked list has a fixed size and allows for fast access.

• An array can only store integers, while a linked list can store any data type.

• An array allows for fast access and fixed size, while a linked list allows for dynamic size and efficient insertions/deletions.

• An array is a type of linked list.

Define a 1D array and provide an example of its declaration.

• float numbers[5];

• int numbers[5];

• int[] numbers = new int[5];

• char numbers[5];

What is a 2D array and how is it accessed in C?

• A 2D array is a single-dimensional array in C, accessed using array[index].

• A 2D array is an array of arrays in C, accessed using array[row][column].

• A 2D array is a matrix of pointers in C, accessed using pointer[row][column].

• A 2D array is a collection of strings in C, accessed using array[row].

Explain the concept of pointers in C programming.

• Pointers are a type of function in C programming.

• Pointers are used to create loops in C programming.

• Pointers can only store integer values.

• Pointers are variables that store memory addresses of other variables, enabling dynamic memory management and efficient data handling.

How do you dynamically allocate memory in C?

• Use 'malloc' to allocate memory and 'free' to deallocate it.

• Use 'alloc' to allocate memory and 'release' to deallocate it.

• Use 'realloc' to allocate memory and 'dispose' to deallocate it.

• Use 'calloc' to allocate memory and 'delete' to deallocate it.

What is the purpose of the 'malloc' function?

• To create a new variable in the stack.

• To allocate memory dynamically during runtime.

• To initialize memory with zeros.

• To free up memory after use.