I think the answer to your question is Linked List. Because in arrays we cannot decide the size at run time. Which means if our array gets completely filled, we will have to copy the contents of created array into larger array. And this will take twice the memory as of array.
You got it right. Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
Oops, you got it wrong. The correct answer is linked list. Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
The answer is ) The linked list implementation (dynamic) Because queue Data structure is a bit more easily to implement and store ‘Delete and remove the data Regards (Ahmad shadab )
Oops, you got it wrong. The correct answer is Linked List.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
You got it right. Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
Based on my comprehension, answering this question with this superficial information was hard.. Array implementation has more effective close bounds in set..
I think the real-life example didn’t much properly because if we want to remove a book we can remove it from the middle-end top anyway and from the line of the people for a ticket cabin we can remove people from anywhere by asking them so at all I think the real-life example is not matching at all Regards
You got it right. Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
I think the answer is Linked List. Linked list allows us to manage memory more efficiently due to it's property to increase size at any instance of program.
You got it right. Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
![Felix "Unfair" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/Oswujxm2Ag0/mqdefault.jpg)
🔥Full Stack Java Developer Program (Discount Code - YTBE15) - www.simplilearn.com/java-full-stack-developer-certification?XSXfBI_0nw&Comments&RUclips
🔥Full Stack Developer - MERN Stack Program (Discount Code - YTBE15) - www.simplilearn.com/full-stack-developer-course-mern-certification-training?XSXfBI_0nw&Comments&RUclips
🔥Caltech Coding Bootcamp (US Only) - www.simplilearn.com/coding-bootcamp?XSXfBI_0nw&Comments&RUclips
Got the hold of concept, Thanks....
You are very welcome. Do subscribe to our channel and stay tuned for more.
Really great video
Glad you enjoyed it
I think the answer to your question is Linked List.
Because in arrays we cannot decide the size at run time. Which means if our array gets completely filled, we will have to copy the contents of created array into larger array. And this will take twice the memory as of array.
You got it right.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
I think the answer is array. Because linked list might need extra memory to store pointers.
Oops, you got it wrong. The correct answer is linked list.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
The answer is )
The linked list implementation (dynamic)
Because queue Data structure is a bit more easily to implement and store ‘Delete and remove the data
Regards (Ahmad shadab )
Thank you mam , good explanation 👍
Most welcome 😊
What software you use to make informational videos like this??
HI, the above video has been made using Adobe Premiere Pro and Microsoft PPTS. Thanks.
Q 》 Array Implementation would be the answer .
Oops, you got it wrong. The correct answer is Linked List.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
I guess the answer is Linked List. Because due to its dynamic nature, it's size can be increased at any instance of our program.
You got it right.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
Based on my comprehension, answering this question with this superficial information was hard.. Array implementation has more effective close bounds in set..
Thanks for watching our video and sharing your thoughts. Do subscribe to our channel and stay tuned for more. Cheers!
I think the real-life example didn’t much properly because if we want to remove a book we can remove it from the middle-end top anyway and from the line of the people for a ticket cabin we can remove people from anywhere by asking them so at all I think the real-life example is not matching at all
Regards
I guess linked lists because it's size is not priorly defined
You got it right.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.
I think the answer is Linked List.
Linked list allows us to manage memory more efficiently due to it's property to increase size at any instance of program.
You got it right.
Explanation: Array is better than a linked list if the list is in close bound. That means the array can be favourable only if we know the size of our list. But if we don't, then a linked list is going to be a better tool as we can increase the size of this data structure at any instance of our program. Further, the speed for performing operations on a linked list is much faster. Hence, the ideal answer for this question will be a linked list considering memory management as a parameter.