ग्रामीण और प्रवासी माताएँ

 पुरुषत्व के स्वरूप

Describe the myths and misconceptions related to transmission of HIV/AIDS.

यौन पदानुक्रम

लिंग और जेंडर

Explain the current scenario of HIV/AIDS globally and its impacts on poverty and hunger.

Graph Colouring Problem

Vertex cover problem

3-CNF SAT

3-CNF SAT

What are NP-Hard and NP-Complete problem? What is the role of reduction? Explain with the help of an example.

Define P and NP class of Problems with the help of examples. How are P class of problem different from NP class of Problems.

What are decision problems and Optimisation problems? Differentiate the decision problems and Optimisation problems with the help of at least two problem statements of each.

Action research

Social movement

Social conflict

Consider the following Graph: 

Figure 1: Graph for Problem 3(a) and 3(b)

a) Write the Kruskal’s algorithm and Prim’s algorithm to find the minimum cost
spanning tree of the graph given in Figure 1. Show all the steps of computation.
Also, compute the time complexity of both the algorithms.
b) In the Figure 1, find the shortest path from the vertex ‘a’ using Dijkstra’s shortest
path algorithm. Show all the steps of computation. Also, find the time complexity
of the algorithm.
c) What is dynamic programming? What is the principle of Optimality? Use the
dynamic programming approach to find the optimal sequence of chain
multiplication of the following matrices:

d) Make all the possible Binary Search Trees for the key values 25, 50, 75. e) Explain the Knuth Morris Pratt algorithm for string matching. Use this algorithm to find a pattern “algo” in the Text “From algae to algorithms”. Show all the steps. What is the time complexity of this algorithm.

Elements of sampling

National mental health programme

Mental health