Question

2

The Stack works on a Last In First Out system (LIFO). The newest thing on the stack is the first thing removed.

Group of answer choices

True

False

3

The same thing that makes an Array a solid data structure is also a weakness of the data structure.

Group of answer choices

True

False

4

The Heap allows us to prioritize the storage and retrieval of data in our algorithms. The highest priority item will always be retrieved next.

Group of answer choices

True

False

5

The Linked List data structure is very fast, but has a tendency to be memory inefficient because of the overhead involved in making nodes.

Group of answer choices

True

False

6

The "Heap Property" says that things that are lower priority than me go in the left sub-tree and things that are higher priority go in the right sub-tree.

Group of answer choices

True

False

Answer 1

ans 2 -> TRUE

the stack is lifo data structure as it is a linear data structure whose only one end is open

so any operation insertion or deletion (push or pop) is possible from only one end.

hence it works in lifo manner.

ANS 3 -> TRUE

the array is contiguously stored in array that makes it solid data structure but the size of the array can not b e changed once it is fixed this also makes an array weak data structure.

ANS 4 -> FALSE

it is true that heap data structure uses priority but it is not true that heap always retrieve maximum priority element. it depends on implementation that either it is a max-heap or min-heap.

ANS 5 -> TRUE

the linked data structure are very fast because of the use of the pointers but these pointers are overhead because they are not part of data but we need them to access other elements.

so pointers are actually memory overhead.

while creating a node we also allocate some memory space to pointers which is actually overhead.

ANS 5 ->

the mentioned property is of binary search tree not of a heap

I HOPE YOU WILL GET IT..............YOUR RESPONSE WILL BE HIGHLY APPRECIATED.