LIST I | LIST II |
---|---|
(A) Circular Linked List | (I) Recursive Function Calls |
(B) Doubly Linked List | (II) Round Robin Queue in CPU |
(C) Stack | (III) Hash Tables |
(D) Singly Linked List | (IV) Undo and Redo Functionality |
The value printed by the given C program is __________ (Answer in integer).
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ___________ (answer in integer).
Let LIST be a datatype for an implementation of a linked list defined as follows:
Suppose a program has created two linked lists, L1 and L2, whose contents are given in the figure below (code for creating L1 and L2 is not provided here). L1 contains 9 nodes, and L2 contains 7 nodes. Consider the following C program segment that modifies the list L1. The number of nodes that will be there in L1 after the execution of the code segment is: