Question

Please answer 5,6 and 7

5) when an entry is removed from a list, what is an additional consequence of that removal? 6) write the code segment that inserts into a linear linked list the node to which newPtr points betweern the two nodes pointed to by the variables prevPtr and curPtr. 7) When choosing between two algorithms, under what conditions can the efficiencies of the algorithms be ignored?

Answer 1

5. While the item is being removed from the list, the corresponding operations depends upon the location of item being removed.

If the item is head of the list: move head pointer to point to next element in the list. And remove the required item.

If the item is in between the list: create prevPointer to point to the previous node of the item being removed.COnnect prevPointer to the node after the item being removed. Remove required item.

If the item being removed is the last item: create prevPointer and make it to point to previous node of the item being removed. Make prevPointer next to point to null, and remove last item.

6. struct Node{

int data;

struct *Node next;

};

void insert(int k, struct *head, struct *prevPtr, struct *currPtr){

struct *newPtr = (struct * Node)malloc(sizeof(struct Node));

newPtr -> data = k;

newPtr -> next = NULL;

struct *temp = head;

while(temp != prevPtr){

temp = temp -> next;

}

newPtr->next = currPtr;

  temp -> next = newPtr;

}

7.correctness, efficiency and easy to implement are three important measures of any algorithm. We can not achieve all of these properties together in all situations. Hence in some cases where correctness, speed and easy implementation is required then efficiency can be ignored even if most effective alternate algorithm is available.