Discuss the CBO-Approach in the context of the Aga Khan Rural Support Program (AKRSP).

Describe the contribution of Tarun Bhart Sangh (TBS) to watershed development in rural area.

Explain the objectives and guiding principles of Global Donor Platform for Rural Development (GDPRD).

Describe the basic features of funding by Indian State for giving financial assistance to Voluntary Organizations.

Discuss the Gandhian conception of voluntarism and rural reconstruction during freedom struggle.

Discuss the essential tenets of Voluntary Associations in a democratic society.

Analyse why there is a need for eco-cities in India.

Describe the concept of Economic Base Theory and discuss its limitation.

Discuss the significance of urban forests in achieving the UNSDGs.

Explain the concept of Urban Ecology. Write the major challenges of Managing life support resources in urban environment.

Consider the following undirected graph G with vertices labeled from 1 to 5:

Determine if there exists a clique of size 3 in the graph G. If yes, provide the vertices forming the clique.

Illustrate, giving all the steps, the operation of the counting sort algorithm on the array

A = 3,4,2,7,5,4,2,1,3,1,7 .

Check whether the following array represents a max-heap. If not run an algorithm to convert it into a max-heap:

6, 20, 18, 15, 17, 11, 12, 13

Explain the breadth first search algorithm using the graph given below with v1 as the source vertex:

For each stage of the algorithm give:

i) ),v(d π )v( for each vertex, where )v(d is the distance from the source to the vertex v and is the predecessor of v.

ii) White and gray vertices

iii) Vertices in the queue

Also, give the breadth search tree.

Write the steps to search the numbers 18 and 45 in the binary search tree:

Illustrate the working of the function PARTITION of the quicksort algorithm using the array and using the last element as PIVOT:

< 35, 22, 11, 45, 26, 71, 82, 37 >

Let α = 352 b, = 671. Find s and t such that as + bt = gcd ).b,a( Show the steps of the algorithm

Find the minimum spanning tree for the following graph using Kruskal’s algorithm: 

Find the Huffman code for the following set of characters: 

Show all the steps of the algorithm. Also compute the number of bits require to encode the data.

Find a minimal spanning tree for the following graph using the Prim’s algorithm, showing all the steps. Take v1 as the root.

What is the weight of the minimal spanning tree you get? Give reasons for your answer.