CA | 1

Test I

Question 1: Delete nodes in linked list

Question 2: Find all connected (disconnected) nodes in a network or graph given a base node.

Question 3: Minimum cost of spanning nodes in a tree or network or graph

Question 4: Given a list, add the elements to get the maximum sum provided no two adjacent elements are added/chosen in the selected list of elements.