choose the correct answer An application requires to maintain the history of past events. the best data structure is: a. Linked List with History b. Queue c. Stack d. Linked List An application requires frequent insertion and deletion of data. The data to be inserted is large. Which data structure you will choose? a. Array b. Stack c. Linked List d. queue An application requires strict ordering of jobs to be processed on a first-come-first-served basis. Which data structure you will choose? inked List b. Double Linked List c. Stack d. Queue Consider a linked List with just one node. The first node in the list is referred by 'head'. Now, if we execute the code: head=head.next What will happen? a. Another 'head' is assigned to the first node b. head points to the last node which is not null c. head points to the next node which is not null d. We lose the linked list
choose the correct answer
An application requires to maintain the history of past events. the best data structure is:
a. |
Linked List with History |
|
b. |
Queue |
|
c. |
Stack |
|
d. |
Linked List |
An application requires frequent insertion and deletion of data. The data to be inserted is large. Which data structure you will choose?
a. |
Array |
|
b. |
Stack |
|
c. |
Linked List |
|
d. |
queue |
An application requires strict ordering of jobs to be processed on a first-come-first-served basis. Which data structure you will choose?
inked List |
||
b. |
Double Linked List |
|
c. |
Stack |
|
d. |
Queue |
Consider a linked List with just one node. The first node in the list is referred by 'head'. Now, if we execute the code: head=head.next
What will happen?
a. |
Another 'head' is assigned to the first node |
|
b. |
head points to the last node which is not null |
|
c. |
head points to the next node which is not null |
|
d. |
We lose the linked list |
Step by step
Solved in 2 steps