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.
Types of Linked List
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 and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
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 different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
please answer question completely using C language only
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
