Consider the following algorithm Algorithm Mystery(A[0..n-1, 0..n - 1]) //Input: A matrix A[0..n-1, 0..n - 1] of real numbers for i ← 0 to n - 2 do for ji+ 1 to n - 1 do if A[i, j] = A[j,i] return true return false a. What does this algorithm compute? b. What is its input size? c. What is its basic operation? d. How many times is the basic operation executed? e. What is the efficiency class of this algorithm? f. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.

Consider the following algorithm Algorithm Mystery(A[0..n-1, 0..n - 1]) //Input: A matrix A[0..n-1, 0..n - 1] of real numbers for i ← 0 to n - 2 do for ji+ 1 to n - 1 do if A[i, j] = A[j,i] return true return false a. What does this algorithm compute? b. What is its input size? c. What is its basic operation? d. How many times is the basic operation executed? e. What is the efficiency class of this algorithm? f. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.

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

Similar questions

A matrix is an array of numbers of size m by n (i.e., m x n). When we multiply 2 matrices, we multiply the matching numbers, then sum them up. Multiplying a matrix of size m x n with another matrix of size n x q will result in a matrix of size m x q. An example is shown in Figure 1: [ ? ? ? ? ? ? ] x [ ? ? ? ? ] = [ ?? +?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ?? + ?? ] Matrix 3 x 2 Matrix 2 x 2 Matrix 3 x 2 Figure 1: Multiplication of Matrix 3 x 2 and 2 x 2 Write a C++ program that multiplies 2 matrices and return the sum of the transposed matrix. Your program shall include the following: a) Define two 2 dimensional arrays, M and N that each represents a matrix of size 3 x 2 and a matrix of size 2 x 2. Request the user to enter the values for the 2 arrays using advanced pointer notations (refer to your slides for the list of array pointer notations). b) Create a function named multMatrix() that passes as arguments, the values of array M and N, multiplies them and store the results in a new…
Given an n×n matrix M in which every entry is either a 0 or 1. Present an algorithm that determines if ∃i, 1 ≤ i ≤ n, such that M[i, j] = 0 and M[j, i] = 1, ∀j, 1 ≤ j ≤ n ∧ j 6= i, using examining an entry of M as the key operation. Your algorithm must examine at most 3n − ⌊lg n⌋ − 3 entries of M.
Consider the following algorithm, which takes as input asequence of n integers a_1, a_2,… , a_n and produces as output a matrix M = {m_(ij)} where m_(ij) is the minimum termin the sequence of integers a_i, a_(i+1),… , a_j for j ≥ i andm_(ij) = 0 otherwise.initialize M so that m_(ij) = a_i if j ≥ i and m_(ij) = 0otherwisefor i := 1 to nfor j := i + 1 to nfor k := i + 1 to jm_(ij) := min(m_(ij), a_k)return M= {m_(ij)} {m_(ij) is the minimum term ofa_i, a_(i+1),… , a_j}a) Show that this algorithm uses O(n^3) comparisons tocompute the matrix M. b) Show that this algorithm uses Ω(n^3) comparisons tocompute the matrix M. Using this fact and part (a),conclude that the algorithms uses Θ(n^3) comparisons.[Hint: Only consider the cases where i ≤ n∕4 andj ≥ 3n∕4 in the two outer loops in the algorithm.]
Given a sorted array of n comparable items A, and a search value key, return the position (array index) of key in A if it is present, or -1 if it is not present. If key is present in A, your algorithm must run in order O(log k) time, where k is the location of key in A. Otherwise, if key is not present, your algorithm must run in O(log n) time.
Get the time complexity function from the pseudocode for the addition of the 2 matrices below, and prove whether the big-oh is O(n^2) so that it satisfies the rule f(n) <= c g(n); / add two matricesfor(i = 0 ; i < rows; i++){for(j = 0; j < columns; j++)matrix2[i][j] = matrix1[i][j] + matrix2[i][j];}// display the resultfor(i = 0 ; i < rows; i++){for(j = 0; j < columns; j++){printf("%d ", matrix2[i][j]);}printf("\n");}
(c) Consider an n x n array ARR stored in memory consisting of 0’s and 1’s such that, in a row of ARR, all 0’s comes before any of 1’s in the row. Write an algorithm having complexity O(n), if exists, that finds the row that contains the most 0’s. Step by step explain your algorithm with an illustrative example.
In Python, generate a random matrix A with 100 entries each of which is an independent numberpseudo-randomly drawn (uniformly) from the interval (0, 1). Let B = A + AT . Use Python to calculatethe diagonal matrix D with the same eigenvalues as B. Then use the QR method to block-diagonalize Bover R. Do at least 100 steps of the QR switching. You should end up with a matrix E which is differentthan D. Answer the question of why.
Given an integer array [A], efficiently find a descending sorted triplet such that: A[i]> A[i]> A[k] and 0 <=i<j <k <n, where n is the array size. For example, Input: A[] = {9, 1, 6, 7, 3, 4, 5) Output: Any one of the following triplets: (9, 7,5) (9, 7, 4) (9, 7, 3) (9, 6, 5) (9, 6, 4) (9, 6, 3) a) Design a brute-force algorithm to solve this problem complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity and analyse the complexity of your solution. c) Develop a python code to implement your efficient algorithm. depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
Using Oz Programming, how would one create a program for finding the nth Fibonacci number in the sequence? I know it has matrix, though I can't seem to get that working in Oz. The main goal was finding an implementation with an O (log n) time complexity. Thanks!
Suppose you are given a very long array A, whose first n elements are integers (in arbitrary order) and the remaining elements are the special symbol 1. You can access any position I in A by referring to A[i]. However, you do not known. Give a n algorithm for determining n. Analyze the number of accesses to A made by your algorithm ,in terms of n. For full credit, your algorithm must make O(logn) accesses to A
For the problem, give pseudocode for your solution, and remember to include a proof of correctness and runtime. Note that in general, faster algorithms will receive more credit, so a brute force O(n 2 ) algorithm will not get many points if there is a faster O(n) or O(n log n) alterative. In IR2 , we define a slab to be a pair of parallel lines. Given a set of points P in IR2 , find the narrowest slab containing P, where the width of the slab is the vertical distance between its bounding lines.
Find a sorted matrix: The input is a real number x and a matrix A[1..n, 1..m] of nm real numbers, with each row A[i, 1..m] and column A[1..n, j] sorted. The objective is to locate the largest array entry A[i, j] that is less than or equal to x, or to report that all components of A are greater than x. Create and test an iterative method that analyses as few matrix elements as feasible. Be cautious if you assume a simple binary search would fix the problem. Find a sorted matrix: The input is a real number x and a matrix A[1..n, 1..m] of nm real numbers, with each row A[i, 1..m] and column A[1..n, j] sorted. The objective is to locate the largest array entry A[i, j] that is less than or equal to x, or to report that all components of A are greater than x. Create and test an iterative method that analyses as few matrix elements as feasible. Be cautious if you assume a simple binary search would fix the problem.