An algorithm that finds the solution to a given problem by reducing the problem to smaller versions of itself is called a(n) ____.

In SharePoint, an SAP ________ site aggregates all user business tasks

A) Process Repository B) Business Intelligence C) Wiki D) Workflow

Write a computer program to add three new links greedily in an N-node string topology network (see Figure 5.17(a) for a reference). Note that the greedy global decision–based link addition should optimize the average path length of the network after addition of each link. Also, there are no self-loops or parallel edges in the network (before or after new link addition).

What will be an ideal response?