Course: Data structure and algorithms: Topic: Algorithm Complexity: Please solve it o emergency basis: Question 2: Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem.

Course: Data structure and algorithms: Topic: Algorithm Complexity: Please solve it o emergency basis: Question 2: Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Q2. By applying the concept of array in C language, solve the equation as shown in Figure Q2 below where the values of n is the last digit of student matrix number (e.g. CD12345), and u is the second digit of student matrix number (e.g. CD12345). User need to insert the value in array x[i] series, for example, EE x; = x [0] + x[1]+ x[2],where xri is a series of value in data set. n+2 n+3 10+i V2i f (x) = 2x[i]? i=1 i=0 Figure Q2: (x) equation.
Consider the following game: Each of two players rolls a dice and whoever rolls the highest number (between 1 and 6 inclusive) gets 4 points, and if it is a draw, both players get 2 points. The player with the highest number of points after 10 rounds of the game is the winner(or the game could be drawn).The following arrays contain the results of dice rolls of each of two players in 10 consecutive rounds of the game.player1=[3, 2, 5, 6, 2, 5, 1, 6, 4, 5]player2=[4, 2, 4, 3, 6, 5, 3, 2, 4, 1] Write a program that computes the running total points of each player and displays one of the following messages (whichever applies) after each round n for n = 1, 2, . . . , 10:Player 1 is leading Player 2 is leading It is a tie [Hint: Use an if construct.] Also, at the end of the program, use the find command to identify (and display) the rounds in which dice rolls were the same for the two players, and use the length command to compute(and display) the number of such rounds. Include appropriate…
ABC zoo wants to keep track of how many pounds of food each of its four monkeys eats each day during a typical week. Stores this information in a two dimensional 4× 7 array, where each row represents a different monkey and each column represents a different day of the week. First let the user input the data of food eaten by each monkey then it should create a report that includes the following information: Average amount of food eaten by each monkey for the whole week. The least amount of food eaten during the week by any one monkey.
Airport security officials have confiscated several item of the passengers at the security check point. All the items have been dumped into a huge box (array). Each item possesses a certain amount of risk[0,1,2]. Here, the risk severity of the items represent an array of N number of integer values. The task here is to sort the items based on their levels of risk in the array. The risk values range from 0 to 2. Example: Input : 7 Value of N [1,0,2,0,1,0,2]-> Element of arr[0] to arr[N-1], while input each element is separated by new line. Output: 0001122 Element after sorting based on risk severity
A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.
weight You are given 4 items as {value, weightpairs in this format {{20,5}, {60, 20}, {25, 10}, {X, 25}}You can assume that the array is sorted based on the value ratio. The capacity of knapsack is 50. The item no. 4 (whose weightis 25 ) is taken fractionally to fill upto the knapsack capacity. That fraction is represented informat. What is the lowest possible value of 6? For the question above, assume the total value stored in the knapsack is 135 after you have filled upto the knapsack capacity. What is the value of X(in other words, the value of the item no. 4) ? Give your answer to at least two decimal places.
Background: This assignment will help you further learn to use multidimensional arrays. You will need a 10x2 matrix for this problem. Consider 10 points on a map, You need to identify the distance between each point (or vertex). A vertex requires two pieces of information. An x,y coordinate (think longitude and latitude.) This is why you have a matrix of 10x2, each entry is the two values you will need. You can think of these points a cities, or friend's houses. We're only looking for a direct route (as the crow flies) not taking roads to make it simpler. You can find the distance between any two points by use of: sqr_root((x1 - x2)^2 + (y1 - y2)^2) You will need to fill your matrix with some random values. Then you will need to calculate the distance between each possible point, eventually displaying it on a matrix in output. Think something like: 1 2 3 4 5 1 0 8 12 4 6 2 8 0 7 .... 3 12 7 .... 4 4 ... 5 6 ... Hint:…
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
Best Partition You are given an array of positive numbers of size N and an integer K. You need to partition the array into K continuous segments. For each segment, the sum of its elements needs to be calculated. The segment with the minimum sum is called the bestSegment and the sum of the elements of the bestSegment is called the bestSum. For all possible combinations of partitions of the array when divided into K segments, their bestSum needs to be calculated and the one among them with maximum value needs to be returned. Input Specification: input1: an array of N positive numbers input2: an integer N denoting the length of the array input3: an integer K Output Specification: Return an integer denoting the maximum value of all possible bestSum. Example 1: input1: (1,2,3,4} input2: 4 input3: 2 Output: 4 Explanation: You can partition the given array into 2 continuous segments in the following manner- • 123 14- the sum of individual segments is (6,4) and the bestSum is 4 • 12134- the…
If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code
Python Write a Python program that performs a linear (sequential) search. Define an array of 10 non-sequential numbers. Ask the user for a number, such as "Enter a number to be found:" Search the array for the user's number. If present, display "Successful search, the element is found at position " and its position. Otherwise, display "Number not found."
If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element. Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. use python to code If an array is given, identify the next bigger element for each…