4. (a) Consider two already created singly linked lists List_A and List_B. Define pseudocode/algorithm for two functions i.e., differenceAB( ) and intersectAB ( ), wherein the function differenceAB( ) generates the list which contains the nodes only in List_A and not in List_B. Whereas the function intersectAB( ) generates the resultant list which contains the nodes common in both List_A and List_B. (b) Given five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB and 700 KB. How would the first-fit, best-fit, worst-fit and next-fit algorithms place processes of 312 KB, 517 KB, 212 KB and 526 KB.

A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner a…

When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely differe…