In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main (), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId () which returns the id of the manager if present or else returns -1. The function managerId () takes two arguments - the square matrix of N *N and its size N. Call managerId() from the main () output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.

In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main (), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId () which returns the id of the manager if present or else returns -1. The function managerId () takes two arguments - the square matrix of N *N and its size N. Call managerId() from the main () output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Consider the vector x= [0:.01:1] with values from 0 to 1 with distance 0.01, i.e. x₁ = xi-1 +0.01.…

A: NumPy: NumPy means Numerical Python. NumPy is an open source Python library. It is used in almost…

Q: In Python, generate a random matrix A with 100 entries each of which is an independent…

A: The objective of the question is to generate a random matrix, perform certain operations on it, and…

Q: Write a function linear_independence that takes a collection of vectors with integer entries (each…

A: Linear independence is defined as the central concept in linear algebra as a set with one vector is…

Q: MATLAB question For input vector x, write a function to check whether there exists exactly 4…

A: MATLAB program : function result = myFunc(x) %function definition c=0; %counter for element that…

Q: A matrix M with i rows, j columns can be transposed into a matrix N having j rows and i columns by…

A: //a.) Code : //Include necessary header files#include <stdio.h>// Defining a Function that…

Q: Let A be the n x n matrix with n = 1000 and entries A(i, i) = i, A(i, i + 1) = A(i + 1, i) = 1/2,…

A: In this question we have to write a python code for the given problem statement Let's code and hope…

Q: Write a new viterbi function to calculate the most likely path of a sequence given A, E, and I matri…

A: Here is a Python implementation of the Viterbi algorithm to calculate the most likely path of a…

Q: Write a Python function that stores its matrix A in a banded form.

A: A matrix of given size is banded matrix where bandedMatrix(i,j) = 0 , If (j < i-k1) or (j >…

Q: onsider the challenge of determining whether a witness questioned by a law enforcement agency is…

A: BELOW STEP BY STEP COMPLETE SOLUTION REGARDING YOUR PROBLEM WITH EXPLANATIONS :

Q: Create a dfa for L = {w ∈ {a, b}∗|na(w) and nb(w) are both even.}

A: To create a DFA with a's and b's, there will be 4 cases or conditions to consider. They are: Even…

Q: for linear algebra in solving a sytem of linear equations in form AX = B. True or false. 1.the…

A: Here in this question we have given a linear equations inform of AX= B.and we have asked to comment…

Q: iterse def squares_intersect (s1, 82): An axis-aligned square on the two-dimensional plane can be…

A: # TEXT CODE:

Q: Comparison with analytic solution The analytic solution for free-fall with v²-dependent air drag is:…

A: we need to write a Python code to implement v_analyt, as given in the question.

Q: A set of linear equations are given as follows: |-14 x -19 y +18 z = 307 +5 x +10 y -2 z = -112 -4 x…

A: 1) Matrix A

Q: Task 1. Area between two curves solve by matlab id number: 202102435 - Consider the graphs of the…

A: Here we have given solution for the questions asked Matlab. You can find the solution in step 2.

Q: 5. Determine if the following matrix is diagonally dominate. 9052 1 3 9 12 1 0 1 7 2 3 4 2 3 12 2…

A: As per our company guidelines, only one question will be answered. So, please repost the remaining…

Question

In a company, there are several branches. Let us consider a branch of that company having N
employees, if the manager is allotted to that branch(s) then he is known to everyone else in that
branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find
the manager in that branch. Input from the user in main (), the square matrix M where if an element
of row i and column j is set to 1 it means that ith person knows jth person. You need to write a
function managerId () which returns the id of the manager if present or else returns -1. The function
managerId () takes two arguments - the square matrix of N *N and its size N. Call managerId ()
from the main () output the information about the manager. Assume all diagonal elements to be 1
(as everyone knows him/herself) and there is at most one manager in the company.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

A sequence (bn)neNo is called strictly increasing if b₁ M. We can represent a sequence (bn) by a Python function that takes n as its argument (of type int) and returns bn (of type float). Write a function threshold_index that takes two arguments: The first one is a Python function representing a strictly increasing, divergent sequence. The second one is a threshold value M. The function threshold_index should return the smallest index n for which the sequence passes the threshold (i.e., bn ≥ M).
Suppose you are in Canada's Thousand Islands National Park, and in one particular lake there are n small islands that park officials want to connect with floating bridges so that people can experience going between islands without a canoe. The cost of constructing a bridge is proportional to its length. Assume the distance between every pair of islands is given to you as a two dimensional matrix (an example of such a table for n = 8 islands is shown below). A B C Ꭰ E F G H A 240 210 340 280 200 345 120 B 240 265 175 215 180 185 155 C 210 265 - 260 115 350 435 195 Ꭰ 340 175 260 160 330 295 230 E 280 215 115 160 360 400 170 F 200 180 350 330 360 175 205 G 345 185 435 295 400 175 305 H 120 155 195 230 170 205 305 Design an algorithm for determining which bridges they should build to connect the islands at minimal cost. Write down the pseudocode and explain why your algorithm correctly computes the set of bridges of minimal cost. Analyze the runnning time of your algorithm.
You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 3 69 10 0 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 5 999 2 999 999 0 6 999 1 999 6 17 999 999 2 6 0 999 7 999 7 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 9 999 999 999 999 999 999 4 80 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial 1 2 3 4 5 6 7 8 9 nearest 1 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
Type in Latex **Problem**. Let $$A = \begin{bmatrix} .5 & .2 & .3 \\ .3 & .8 & .3 \\ .2 & 0 & .4 \end{bmatrix}.$$ This matrix is an example of a **stochastic matrix**: its column sums are all equal to 1. The vectors $$\mathbf{v}_1 = \begin{bmatrix} .3 \\ .6 \\ .1 \end{bmatrix}, \mathbf{v}_2 = \begin{bmatrix} 1 \\ -3 \\ 2 \end{bmatrix}, \mathbf{v}_3 = \begin{bmatrix} -1 \\ 0 \\ 1\end{bmatrix}$$ are all eigenvectors of $A$. * Compute $\left[\begin{array}{rrr} 1 & 1 & 1 \end{array}\right]\cdot\mathbf{x}_0$ and deduce that $c_1 = 1$.* Finally, let $\mathbf{x}_k = A^k \mathbf{x}_0$. Show that $\mathbf{x}_k \longrightarrow \mathbf{v}_1$ as $k$ goes to infinity. (The vector $\mathbf{v}_1$ is called a **steady-state vector** for $A.$) **Solution**. To prove that $c_1 = 1$, we first left-multiply both sides of the above equation by $[1 \, 1\, 1]$ and then simplify both sides:$$\begin{aligned}[1 \, 1\, 1]\mathbf{x}_0 &= [1 \, 1\, 1](c_1\mathbf{v}_1 +…
For input vector x, write a function to check whether there exists at most 5 elements in x whose values are less than 7.
A sequence (bn)neN is called strictly increasing if b, M. We can represent a sequence (bn) by a Python function that takes n as its argument (of type int) and returns bn (of type float). Write a function threshold_index that takes two arguments: The first one is a Python function representing a strictly increasing, divergent sequence. The second one is a threshold value M. The function threshold_index should return the smallest index n for which the sequence passes the threshold (i.e., bn ≥ M).
You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 10 10 3 9 11 0 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 567 999 2 999 999 0 6 999 1 999 17 999 999 2 6 0 999 7 999 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 0 8 9 999 999 999 999 999 999 4 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial nearest 1 2 3 4 5 6 7 8 9 16 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
6. X is (a,b,c,d), Y is {1,2,3,4). {(a,1), (b,2), (c,2), (d,4)) is a function from X to Y.
The determinant of a 2x2 matrix is A is given by :• Write a function named det2 that accepts a 2x2 numpy array as aparameter, and returns the determinant. solve in python coding
linear system: Ax = b 3 x1 + 2x2 + x3 = 1 3x1 + 5x2 - x3 = 2 x2 + x3 = 10 Find the solution to the system of linear equations given above. You should use NumPy methods. The answer should be an ndarray (a vector).