Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
CCS0007 Module 6
| Question | Answer |
|---|---|
| Which of the following is true about the linked list? It is dynamic Elements are at contiguous location Random access is allowed It has fixed size | It is dynamic |
| What is the value of the last pointer in a linked list? | Null |
| The last node of a linked list is called ____________. | Tail |
| A node contains: | Data Item and Address |
| Which of the following is not correct about the linked list? It is dynamic Random access is not possible. Insertion/deletion is easier Random access is possible | Random access is possible |
| Lists that has a dynamic size in memory | Linked List |
| What is the operation used to delete an item (or node) from the linked list? | Deletion |
| It holds the addresses of the neighboring nodes or of those nodes which are associated with the given node as dictated by the application | Link |
| It is the process of going through all the nodes from one end to another end of a linked list | Traversing |
| Which of the following is the data part of the node? struct Node { int d; Node *n; }; | d |
| The address value of the last node: | Null |
| Which of the following has a dynamic memory allocation? | Linked List |
| Starting node of a linked list is also known as: | Head |
| What is the basic component of a linked list? | Node |
| A type of Linked list where items can be navigated forward and backward. | Doubly Linked list |
| .Nodes in a linked list can be deleted: All are statement are possible Beginning of the list Specific location End of the list | All are statement are possible |
| A node is composed of: | Data and address |
| Removes a node in a linked list | Deletion |
| An operation which adds a node in the list | Insertion |
| It is a linear collection of varying lengths of homogeneous components. | List |
| Lists that have a fixed size in memory | Array |
| It is a linear data structure, in which the elements are not stored at contiguous memory locations. | Linked List |
| It is the process of appending the second list to the end of the first list. | Concatenation |
| It holds the information content or data to be represented by the node. | Data Item |
| The operation used to create a linked list node | Creation |
| What does the following code do? struct Node { int data; Node* next;}; | Creates a Pointer |
| It is a linear data structure where each element is a separate object | Linked List |
| Ending node of a linked list is also known as | Tails |
| Which of the following is true about the linked list? | It is dynamic |
| Means to visit every element or node in the list beginning from first to last | Traversal |
| #include <iostream> using namespace std; struct Node { int data; Node *next; }; int main() { Node *p; p = new Node; p -> data = 70; p -> next = NULL; cout << "Data " | Data 70 |
Created by:
bobo ni jabez