Zusammenfassung der Ressource
Frage 1
Frage
How is the procedure of adding a new node in a linked list of size 2 between the existing nodes?
Antworten
-
Create the new node, link it to the first one and link the new one to the last one.
-
Create the new node, move the last one to the right, and place the node between them.
-
Create the new node, link it to the last one, and link the first one to the new one.
Frage 2
Frage
If a programmer wants to print the data of a linked list in reverse order, what type of linked list should he/she use in order to maximise efficiency?
Antworten
-
Linear Linked List
-
Two-Way Linked List
-
Circular Linked List
Frage 3
Frage
What does dynamic data structure do to manage memory and where does it keep it?
Antworten
-
It creates a virtual memory in the hard drive that can be used by any program when needed.
-
It creates static blocks of memory in the RAM that is always used by a program.
-
It creates blocks of memory in the heap that can be used by any program.
Frage 4
Frage
It is a disadvantage of linear linked lists (Check only one box)
Antworten
-
It can only be browsed forward and backwards, so you can't use an ekement by calling its position.
-
It uses two values in each node, instead of only one as an array... Needless to say, it requires more memory.
-
It always uses the same amount of memory because it is linear.
Frage 5
Frage
Check the box of two advantages of using a static data structure
Frage 6
Frage
Choose one disadvantage of using dynamic data structures (Only check one box)
Frage 7
Frage
Each node contains two fields: A "data" field to store any data the element holds and a "next" field which is a place used to link one node to the next one.
Frage 8
Frage
Choose the diagram that represents a linear linked list
Frage 9
Frage
Choose the diagram that represents a two-way linked list
Frage 10
Frage
Choose the diagram that represents a circular linked list
Frage 11
Frage
It is possible to delete a value in the middle of a linked list and then to re-link all the list
Frage 12
Frage
Which is the right combination (linked list type/Data structure) to represent a queue?
Antworten
-
Circular/Static
-
Circular/Dynamic
-
Linear/Static
-
Linear/Dynamic