Create a Hierarchy chart that will accurately represent the information in the scenario below:
“A main programme calls three modules: getDetails(), calculateFees(), and register(). The calculateFees() module calls a module called courses() and a module called courseCost(). The register() module calls a module called printProof().”
Write a python program to create the dataframe to perform binary functions on it
1. Show that 3-SAT problem is in NP appealing to the definition of the NP class .
2. Finding a vertex cover of a graph, is a problem of finding a set of vertices of minimum size such that each edge in the graph is covered with at least one vertex. Formulate a decision version of the vertex cover problem.
3. Suppose A and B are two different decision problems and furthermore assume that problem A is polynomial-time reducible to problem B. If problem B is NP-complete, is problem A NP-complete ? Justify your answer.
Write a program to 4 X 4 matrix. Input the elements in the matrix and rotate the elements by one position of each row.