1. Create a script that will take 4 vertices (total 8 numbers) then make decision whether those vertices form a square, a rectangular, a diamond (A.K.A Rhombus), a parallelogram, or just a quadrilateral. Also, the area of the shapes if the shape is a square or rectangular. [CREATE AN ARRAY FOR 4 VERTICES (TOTAL 8 NUMBERS, THEN REPEAT THE SAME PROCEDURE. The WHOLE COMPUTATION NEEDS TO BE DONE BY ACCESSING ELEMENTS IN THE ARRAY .) Taking values for the ARRAY has to be done within main(). But computation and displaying the result should be done with the USER DEFINED FUNCTION!) C language please

1. Create a script that will take 4 vertices (total 8 numbers) then make decision whether those vertices form a square, a rectangular, a diamond (A.K.A Rhombus), a parallelogram, or just a quadrilateral. Also, the area of the shapes if the shape is a square or rectangular. [CREATE AN ARRAY FOR 4 VERTICES (TOTAL 8 NUMBERS, THEN REPEAT THE SAME PROCEDURE. The WHOLE COMPUTATION NEEDS TO BE DONE BY ACCESSING ELEMENTS IN THE ARRAY .) Taking values for the ARRAY has to be done within main(). But computation and displaying the result should be done with the USER DEFINED FUNCTION!) C language please

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Create a 2D array of size 14x14 having same values ranging from 0 to 255 in each row. You are free to specify the values of this array. For instance, consider a 3x3 array as;Array [3] [3]= {{12,12,12}, {75, 75, 75}, {247, 247, 247}}12, 75, and 247 pixel values are specified in a way that they are in a range of 0 to 255 and they are same in a row.Write a code namely arraytoimage.c using any pgm (portable gray map) format image that represents an image in a text file in which each pixel is represented by a number ranging from 0 and 255. In this code, write:-P2 (magic number)-Width and height of the image-Maximum grayscale value-Gray scale intensity values you specify in the arrayin an order to this image
Consider the above code snippet (that is given in the following image) and rewrite it with the execution code by ensuring 100% encapsulation.
. Implement a program that randomly generates 10 integers from -100 to 100, stores them in a 1D array, and finds their maximum value. Calculate the execution time of finding a maximum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Implement a Java program that will populate a 5x5 matrix with randomly generated integers from 0 to 100. (1) print your matrix in a table form. (2) modify your code to multiply all even numbers by 10 and print the matrix. Your output of questions (1) and (2) should match the format of the following sample outputs:
Given an integer array, find the length of the longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values, and the character set should be consecutive, irrespective of its order. For example: Input: [2, 0, 6, 1, 5, 3, 7] Output: 4 Input: [2, 4, 6, 3, 7, 4, 8, 1] Output 4 Explanation: The longest subsequence formed by the consecutive integers is [2, 0, 1, 3]. It has distinct values and length 4. Explanation: The longest subsequence formed by the consecutive integers is (2, 4, 3, 4, 1]. The distinct subsequence is [2, 4, 3, 1] having length 4. a) Design a brute-force algorithm to solve this problem , and analyse the 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. [Important instruction to be followed: Create an arbitrary input of at least 5 elements and use it to provide full explanation of how your proposed algorithm should work step…
You can see in the above display, we first sort each row of the 2D array; we then take the transpose of a two D array, i.e., all the row elements becoming the column elements; we then sort each row of the 2D again. If you read the final array, each row is sorted; each column is also sorted. The smallest element obviously is the 1st element of the two D array and the last element is the largest element of a two D array. Let us now look at the following UML diagram: (Note that additional methods are allowed; proposed methods and instance variable cannot be changed) Main method firstly constructs a 2D array of certain sizes and then construct a TwoD object and drive the task according to the above runtime interactions and displays. TwoD class has only one instance variable which is a two D array of numbers ( int or double). The constructor must do some “deep” copying. A copy constructor. The other three methods are obvious in definition: to sort each row, to rotate the 2D array (i.e.,…
D1) Suppose that we have t = 5 treatments and we can only have blocks of size three. .(a) Find the smallest BIBD (fewest number of blocks). Give the values of r and λ .(b) If we could have blocks of size four, can we run a BIBD? Is there an advantage over the design in part (a)? .(c) Write out the layout of the design from part (b) showing how to arrange the treatments in blocks.
Can you help me trying to do this code because I am struggling big time with this. question that i need help with: the Eight Puzzle consists of a 3 x 3 board of sliding tiles with a single empty space. For each configuration, the only possible moves are to swap the empty tile with one of its neighboring tiles. The goal state for the puzzle consists of tiles 1-3 in the top row, tiles 4-6 in the middle row, and tiles 7 and 8 in the bottom row, with the empty space in the lower-right corner.you will develop two solvers for a generalized version of the Eight Puzzle, in which the board can have any number of rows and columns. A natural representation for this puzzle is a two-dimensional list of integer values between 0 and r · c -1 (inclusive), where r and c are the number of rows and columns in the board, respectively. In this problem, we will adhere to the convention that the 0-tile represents the empty space.tasks:In the TilePuzzle class, write an initialization method __init__(self,…
1) You need to use JavaScript to modify a repeated element of unknown count on the page that is different on each page visit. What is the best way to do this?: A) Use document.getElementsByTagName(), then use the return like an array. B) Manually label each element Id, then use document.getElementById(). C) Give the same Id to each element, then use getElementById() like an array. D) Use the highest common parent element, then use recursive search. 2) You are in charge of writing a JavaScript code to tell the user how well his/her password is as it is typed in. What is the best approach? A) Add onsubmit to submit button. Show message if password is weak and return false. B) Add onsubmit to submit button. Disable update button if password is too weak. C) Add onchange to password field. Update a message as password is changed. D) Add onfocusout to password field. Update a message as password is changed 3) What event can we use to animate a picture once it is downloaded?: A) onchange B)…
Write a code segment IN PYTHON that displays the items in a three-dimensional array. Each line of data should represent all the items at a given row and column, stretching back from the first depth position to the last one. The traversal should start at the first row, column, and depth positions and move through depths, columns, and rows
Take an array of length n where all the numbers are nonnegative and unique. Find the element inthe array possessing the highest value. Split the element into two parts where the first part containsthe next highest value in the array and the second part holds the required additive entity to get thehighest value. Return the array index value. Consider the negative numbers as well.Input: [4, 8, 6, 3, 2]Output: [4, 6, 2, 6, 3, 2]
Please keep the simulation neat and well organized. It is a request. Perform QuickSort on the given array. You need to show the whole simulation. A = [10,3,9,18,21,26,30,8,15,6,17].
You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Results: [7, 10] (the underlined portion above)