Question 11 : The advantage of using linked lists over arrays is that ________
1. Linked list is an example of linear data structure
2. Insertion and deletion of an element can be done at any position in a linked list
3. Linked list can be used to store a collection of homogenous and heterogeneous data types
4. The size of a linked list is fixed
View Answer   Discuss with Members

Question 12 : The size of both stack and heap remains the same during run time.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 13 : The incorrect statement with respect to dangling pointers is ___________
1. Pointer pointing to non-existent memory location is called dangling pointer
2. When a dynamically allocated pointer references the original memory after it has been freed, a dangling pointer arises
3. If memory leak occurs, it is mandatory that a dangling pointer arises
4. Dangling pointer may result in segmentation faults and potential security risks
View Answer   Discuss with Members

Question 14 : Which of the following functions allocates multiple blocks of memory, each block of the same size?
1. malloc()
2. realloc()
3. calloc()
4. free()
View Answer   Discuss with Members

Question 15 : Suppose we have a one dimensional array, named 'x', which contains 10 integers. Which of the following is the correct way to allocate memory dynamically to the array 'x' using malloc()?
1. x=(int*)malloc(10);
2. x=(int*)malloc(10,sizeof(int));
3. x=malloc(int 10,sizeof(int));
4. x=(int*)malloc(10*sizeof(int));
View Answer   Discuss with Members

Question 16 : The free() function frees the memory state pointed to by a pointer and returns ___________
1. the same pointer
2. the memory address
3. no value
4. an integer value
View Answer   Discuss with Members

Question 17 : Array is preferred over linked list for the implementation of ________
1. Radix sort
2. Insertion sort
3. Binary search
4. Polynomial evaluation
View Answer   Discuss with Members

Question 18 : In the function malloc(), each byte of allocated space is initialized to zero.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 19 : Choose the statement which is incorrect with respect to dynamic memory allocation.
1. Memory is allocated in a less structured area of memory, known as heap
2. Used for unpredictable memory requirements
3. Execution of the program is faster than that of static memory allocation
4. Allocated memory can be changed during the run time of the program based on the requirement of the program
View Answer   Discuss with Members

Question 20 : Queue data structure works on the principle of ____________
1. Last In First Out (LIF0)
2. First In Last Out (FILO)
3. First In First Out (FIFO)
4. Last In Last Out (LILO)
View Answer   Discuss with Members