0
Which layer enables the receiving node to send an ackowledgment?
Wiki User
∙ 12y agoWant this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Suppose that at the receiving node a frame's FCS doesn't match the FCS is was issued at the transmitting node what happens as a result?
The receiving nodes data link layer requests a retransmission.
Write an iterative function to search an element in a binary search tree?
_node* search (_node* head, _key key) { _node* node; for (node=head; node != NULL;;) { if (key == node->key) return node; else if (key < node.>key) node = node->left; else node = node->right; } return node; }
Algoritm for deleting the last element from a list?
Given a list and a node to delete, use the following algorithm: // Are we deleting the head node? if (node == list.head) { // Yes -- assign its next node as the new head list.head = node.next } else // The node is not the head node { // Point to the head node prev = list.head // Traverse the list to locate the node that comes immediately before the one we want to delete while (prev.next != node) { prev = prev.next; } end while // Assign the node's next node to the previous node's next node prev.next = node.next; } end if // Before deleting the node, reset its next node node.next = null; // Now delete the node. delete node;
Is null node equal to leaf node?
No. A leaf node is a node that has no child nodes. A null node is a node pointer that points to the null address (address zero). Since a leaf node has no children, its child nodes are null nodes.
How many pointers will have to be changed if a node is deleted from a linear linked list?
For a singly-linked list, only one pointer must be changed. If the node about to be deleted (let's call it node for the sake of argument) is the head of the list, then the head node pointer must be changed to node->next. Otherwise, the node that comes before the deleted node must change its next pointer to node->next. Note that given a singly-linked node has no knowledge of its previous node, we must traverse the list from the head in order to locate that particular node, unless the node is the head of the list: void remove (List* list, Node* node) { if (!list !node) return; // sanity check!if (list->head == node) {list->head = node->next;} else {Node* prev = list->head;while (prev->next != node) prev = prev->next; // locate the node's previous nodeprev->next = node->next;}} Note that the remove function only removes the node from the list, it does not delete it. This allows us to restore the node to its original position, because the node itself was never modified (and thus still refers to its next node in the list). So long as we restore all removed nodes in the reverse order they were removed, we can easily restore the list. In order to delete a node completely, we simply remove it and then free it:void delete (List* list, Node* node) {if (!list !node) return; // sanity check!remove (list, node);free (node);} For a doubly-linked list, either two or four pointers must be changed. If the node about to be deleted is the head node, then the head node pointer must be changed to n->next and n->next->prev must be changed to NULL, otherwise, n->prev->next becomes n->next. In addition, if the node about to be deleted is the tail node, then the tail node pointer must be changed to n->prev and n->prev->next must be changed to NULL, otherwise, n->next->prev becomes n->prev. Deletion from a doubly-linked list is generally quicker than deletion from a singly linked list because a node in a doubly-linked list knows both its previous node and its next node, so there's no need to traverse the list to locate the previous node to the one being deleted. void remove (List* list, Node* node) {if (!list !node) return; // sanity check!if (list->head == node) {list->head = node->next;node->next->prev = NULL;} else {node->prev->next = node->next; }if (list->tail == node) {list->tail = node->prev;node->prev->next = NULL;} else {node->next->prev = node->prev; }} Again, to physically delete the node we simply remove and then free the node:void delete (List* list, Node* node) {if (!list !node) return; // sanity check!remove (list, node); free (node); }
Which OSI layer enables the receiving node to send an acknowledgement?
Transport Layer
Suppose that at the receiving node a frames FCS doesn't match the fcs it was issues at the transmitting node What happens as a resoult?
The receiving node's Data Link layer requests a retransmission.
Suppose that at the receiving node a frame's FCS doesn't match the FCS is was issued at the transmitting node what happens as a result?
The receiving nodes data link layer requests a retransmission.
What node in synchronous communications recognizes that it should be receiving data by looking at the time on the clock?
receiving
FTP work at which layer of osi?
ftp i.e file transfer protocol,used to transfer a file from node to node FTP works at OSI layer 7, the Application layer
How to rectify rdi alarm?
RDI stands for Remote Defect Indication. RDI Alarms comes when a node is not receiving the signal from the corresponding Node, but only transmits. As this Alarm comes on Physical Layer, hence the Alarm can be rectify by cleaning/replacing the Patch Cords/Electrical Jumper Wires.
What are session functions in OSI layer?
Session Layer, this layer helps out with the task to carry information from one node (workstation) to another node (workstation). A session has to be made before we can transport information to another computer.
What Is a data link layer term describing a device connected to a network?
Node
What is the function of the distribution layer in a campus network?
It distributes temporary IP addresses to each node.
What tasks are the responsibility of the physical layer?
the responibilty of physcial layer is to move data(bits) from one node to another in the form of electro manetic signal.
How electricity is moved from an outlet to appliance?
An Outlet has two nodes, one is positive and one is negative. You will not feel anything to a negative node and it is for receiving the supply of electricity released from positive node. As you connect a appliance to outlet the electricity has to pass through out that appliance to reach to the negative node.
Within ethernet frame types what signals to the receiving node that data is incoming and indicates when the data flow is about to begin?
preamble
