![3. You are given a three dimensional array defined as A:(1:n, 1:m, 1:k] char; This array is written randomly small characters](http://img.homeworklib.com/questions/3bc04cb0-4fd3-11eb-ba12-8bfced5bd184.png?x-oss-process=image/resize,w_560)
Homework Answers
int small=0,capital=0, decimal=0,i,k,l;
for i=0 to n-1{
for j=0 to m-1{
for l=0 to k-1{
if(A[i][j][l] >= 'a' && A[i][j][l] <= 'z') small++;
else if(A[i][j][l] >= 'A' && A[i][j][l] <= 'Z') capitak ++;
else decimal++;
}
}
}
Add Answer to:
3. You are given a three dimensional array defined as A:(1:n, 1:m, 1:k] char; This array...
You will be given an array of N elements sorted small to large. For the X...
You will be given an array of N elements sorted small to large. For the X and Y values that satisfy the X ≤ Y condition, draw the flow diagram of the algorithm that finds the start and end addresses of the region with the numbers greater than X and less than Y with the divide and manage approach and with O (logN) complexity. Also code the algorithm in c language. (not c++) Example: A[0…8] array 3, 5, 7, 9,...
Suppose that you are given an array of N elements. Develop an optimum algorithm that finds...
Suppose that you are given an array of N elements. Develop an optimum algorithm that finds the minimum k elements of this array in at most nlogn time. Try your algorithm on an example N-sized array and some value of k.
Given an array A[1..n] of positive integers and given a number x, find if any two...
Given an array A[1..n] of positive integers and given a number x, find if any two numbers in this array sum upto x. That is, are there i,j such that A[i]+A[j] = x? Give an O(nlogn) algorithm for this. Suppose now that A was already sorted, can you obtain O(n) algorithm?
An m×n array A of real numbers is a Monge array if for all i,j,k, and l such that 1≤i<k≤m and ...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
Define a two-dimensional int array which has 5 rows and 3 columns. The elements in array...
Define a two-dimensional int array which has 5 rows and 3 columns. The elements in array is randomly initialized (using Math.random()). Write a method to find the maximum value in this two dimensional array; Write a method to find the average value in the array; Write a method to count how many elements are smaller than average; Write a method to copy contents in a two-dimensional array to a one-dimensional array. The method will return this one-dimensional array. Method is...
4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up t...
4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up to n, anda number num which we wish to insert into A, in the proper sorted position. The function Search finds the minimum index i such that num should be inserted into Ali]. It searches the array sequentially until it finds the location i. Another function MakeRoom moves A[i], .., AIn] to Ali+1]...AIn+1] same sort...
1.The code box below includes a live 2 dimensional array variable called gridNums. This array holds...
1.The code box below includes a live 2 dimensional array variable called gridNums. This array holds integers. You cannot see its declaration or initialization. What value is in the zeroth (initial) position of the second row? Print this array entry to the console. (Note: remember that the second row is actually row 1). Enter your code in the box below. 2.The code box below includes a live 3x3 2-dimensional array variable called fredsNums. This array holds integers. You cannot see...
Note: when a problem has an array of real numbers, you cannot use counting sort or...
Note: when a problem has an array of real numbers, you
cannot use counting sort or radix sort.
For this problem, you are given a number t and an array A with n real numbers that are not sorted. Describe an algorithm that finds the t numbers in A that are closest to the median of A. That is, if A = {x1, . . . , xa) and xrn is the median, we want to find the t...
Suppose you have an array S indexed from 1 to n which contains n numbers, not...
Suppose you have an array S indexed from 1 to n which contains n numbers, not in any particular order, and you wish to count how many times a given number x occurs in S. Consider the recursive algorithm below for this which finds the number of occurrences of x in the index range i...j in S. Of course, solving the problem would involve an initial call to the algorithm for the range 1.n: int CountOccur (int i,j) { int...
7. i) Let n and k be some given positive integers, and x a 1-dimensional NumPy...
7. i) Let n and k be some given positive integers, and x a 1-dimensional NumPy array of length n. Write a Python code that creates the 2-dimensional NumPy array which has k columns all identical to x. You may import numpy as np Perform the test case: ne5 k-3 x = np.arange(0,1,0.2) # the output should be [[. 0. 0.] [0.2 0.2 0.2] [0.4 0.4 0.4) (0.6 0.6 0.6) [0.8 0.8 0.8]] 7. ii) Let a, b, c be...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
4) [15 points total (5 points each)] Assume you are given a sorted array A of n numbers, where A is indexed from 1 up to n, anda number num which we wish to insert into A, in the proper sorted position. The function Search finds the minimum index i such that num should be inserted into Ali]. It searches the array sequentially until it finds the location i. Another function MakeRoom moves A[i], .., AIn] to Ali+1]...AIn+1] same sort...
Note: when a problem has an array of real numbers, you
cannot use counting sort or radix sort.
For this problem, you are given a number t and an array A with n real numbers that are not sorted. Describe an algorithm that finds the t numbers in A that are closest to the median of A. That is, if A = {x1, . . . , xa) and xrn is the median, we want to find the t...
Suppose you have an array S indexed from 1 to n which contains n numbers, not in any particular order, and you wish to count how many times a given number x occurs in S. Consider the recursive algorithm below for this which finds the number of occurrences of x in the index range i...j in S. Of course, solving the problem would involve an initial call to the algorithm for the range 1.n: int CountOccur (int i,j) { int...
7. i) Let n and k be some given positive integers, and x a 1-dimensional NumPy array of length n. Write a Python code that creates the 2-dimensional NumPy array which has k columns all identical to x. You may import numpy as np Perform the test case: ne5 k-3 x = np.arange(0,1,0.2) # the output should be [[. 0. 0.] [0.2 0.2 0.2] [0.4 0.4 0.4) (0.6 0.6 0.6) [0.8 0.8 0.8]] 7. ii) Let a, b, c be...
Most questions answered within 3 hours.
-
What social, political, and organizational behavior can
influence change in criminal justice agencies?
asked 1 minute ago -
Explain the value chain defined by Michael Porter, and compare
it with the REA ontology definition....
asked 4 minutes ago -
Question:
A simple random sample of size n = 15 is collected for the
duration of...
asked 11 minutes ago -
you are required to select three countries or region with
distinctive cultural contexts. for each country/region...
asked 9 minutes ago -
Jozy Altidore invested $8,600 at 9% annual interest, and left
the money invested without withdrawing any...
asked 11 minutes ago -
How would you respond to this post?
On occasion, management is faced with a dilemma, and...
asked 14 minutes ago -
Chocolate Market research has revealed the following information
about the market for chocolate bars. The demand...
asked 29 minutes ago -
Question 19
For the reaction A(g) → 2B(g), Keq
= 4.5 x 105. Which statement is...
asked 42 minutes ago -
What is a machine? What are some mechanical advantages to
using a machine? How do you...
asked 47 minutes ago -
A 1.07 10-3 µF capacitor has an initial charge of 0.100 C. When
a resistor is...
asked 53 minutes ago -
A local food delivery company “quiksnak” wants to improve its
process to provide better customer service....
asked 49 minutes ago -
A building will require capital improvements of $1 million in
five years. Assuming monthly cash flow...
asked 57 minutes ago