Typedef Questions and Answers

Q: Which of the following is an example of static memory allocation?

Correct answer: ArrayAn array declared with a fixed size has its storage settled at compile time, in the stack frame or the data segment according to where it is declared. Nothing is requested at run time and nothing is freed.The other three are dynamic structures built from nodes obtained with malloc as they are needed. A stack and a queue can be implemented over a fixed array, but as abstract structures they grow and shrink, which is what places them on the dynamic side of the distinction.

61.

Which of the following is an example of static memory allocation?

A.Linked list
B.Stack
C.Queue
D.Array

Answer: D

Correct answer: Array

An array declared with a fixed size has its storage settled at compile time, in the stack frame or the data segment according to where it is declared. Nothing is requested at run time and nothing is freed.

The other three are dynamic structures built from nodes obtained with malloc as they are needed. A stack and a queue can be implemented over a fixed array, but as abstract structures they grow and shrink, which is what places them on the dynamic side of the distinction.

Discuss in Forum

62.

Array is preferred over linked list for the implementation of ________

A.Radix sort
B.Insertion sort
C.Binary search
D.Polynomial evaluation

Answer: C

When we try to implement binary search using linked list, the traversal steps per element increases in order to find the middle element. Thus, this process is slow and inefficient. This process is much faster using an array, hence it is preferable to use an array for the implementation of binary search.

Discuss in Forum

63.

The advantage of using linked lists over arrays is that ________

A.Linked list is an example of linear data structure
B.Insertion and deletion of an element can be done at any position in a linked list
C.Linked list can be used to store a collection of homogenous and heterogeneous data types
D.The size of a linked list is fixed

Answer: B

Correct answer: Insertion and deletion of an element can be done at any position in a linked list

A linked list stores each element with a pointer to the next, so inserting or removing one is a matter of adjusting two pointers rather than shifting every following element as an array requires. The other options fail: both structures are linear, both hold homogeneous data, and it is the array whose size is fixed while the list grows as needed.

Discuss in Forum

Typedef Questions and Answers

Topics

Other Subjects

About Us

Typedef Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications