Do not copy. I need the code in c++ format. 4. Take input from a file (Input-Assignment1-Problem-2.txt), which will first havethe number of test cases (T).For each case/line, there will be• n (array's size)• 0/1 (i.e. zero OR one), indicating whether sorting is to be done inascending order or descending order for this test case,o 0- Ascending order1- Descending order• 0/1/2 (zero OR one OR two), indicating which sorting technique will beused for this test case.o 0- Selection Sort will be calledo 1- Insertion Sort will be calledo 2- Merge Sort will be calledFollowed by Array's elements.For each test case, you have to write to an output file the ascending ordescending sorted order. You have to write in the following format.Maintain the exact format.Output file will be named -Output-Assignment-1-Problem-2.txtEg.If your roll is 1505022, then output file will be1505022-Output-Assignment1-Problem2.txt[See next page for sample input and output formats]Sample Input (Input-Assignment1-Problem-2.txt):340022 4 5110 1112 10 31 22 8 11 15 19 5312132Sample Output (eg. 1505022-Output-Assignment1-Problem2.txt)Test Case #1Size: 4, Order: Ascending, Technique: Selection145 22Test Case #2Size: 10, Order: Descending, Technique: Insertion31 22 19 15 11 10 9521Test Case #3Size: 3, Order: Descending, Technique: Merge321

n- array size 0/1- Ascending/Descending 0/1/2- Selection Sort/ Insertion Sort/ Merge Sort

4. Take input from a file (Input-Assignment1-Problem-2.txt), which will first have the number of test cases (T). For each case/line, there will be • n (array's size) • 0/1 (i.e. zero OR one), indicating whether sorting is to be done in ascending order or descending order for this test case. o 0- Ascending order o 1- Descending order • 0/1/2 (zero OR one OR two), indicating which sorting technique will be used for this test case. o 0- Selection Sort will be called o 1- Insertion Sort will be called o 2- Merge Sort will be called

4. Take input from a file (Input-Assignment1-Problem-2.txt), which will first have the number of test cases (T). For each case/line, there will be • n (array's size) • 0/1 (i.e. zero OR one), indicating whether sorting is to be done in ascending order or descending order for this test case. o 0- Ascending order o 1- Descending order • 0/1/2 (zero OR one OR two), indicating which sorting technique will be used for this test case. o 0- Selection Sort will be called o 1- Insertion Sort will be called o 2- Merge Sort will be called

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

Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Solution should avoid Runtime Error
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
Use Java to properly read the data from the text file, then creates a two-dimensional array with the assignment specifications. After that, a proper slice is taken from the two-dimensional array. All is printed. File Name is IN300_Dataset2.txt Write a Java program that: A. Reads the text file. B. Using that data, create a two-dimensional array that is 2,500 rows by 100 columns. C. Slice the two-dimensional array using a starting column index of 2 and an ending column index of 5. Print the results of the arrays and slice.
You are given an array called source, with length n, and a set of m arrays called target, each also with length n. The arrays contain only positive integers. The arrays are unsorted. For any number x, the smallest number in target[x] is guaranteed to be smaller than target[x+1]. All the numbers in target are unique. The following figure illustrates an example of valid source and target arrays for this case, where n=5 and m=6. source = [14, 13, 15, 11, 12]target[0] = [4, 2, 1, 3, 5]target[1] = [6, 8, 7, 10, 9]target[2] = [14, 15, 12, 11, 13]target[3] = [17, 20, 16, 18, 19]target[4] = [22, 21, 24, 23, 25]target[5] = [30, 29, 28, 27, 26] The smallest number in each array in target is styled with bold. You can quickly see that the smallest number in target[0] is smaller than the smallest number in target[1], the smallest number in target[1] is smaller than the smallest number in target[2], and so on. You can also see that there is no duplicate number within the arrays in target. You are…
Please help me with this: using js create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your…
7. Write a program that will create a dynamically created 1D array of length n (given by the user) and store first n odd numbers in it. Try printing the size of the array using size of() function. Are you satisfied with the result of size of() function? If no, explain why? need the solve in c++
Here is --Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] Example 2: Input: strs = [""] Output: [[""]]. Asap.
Create two Arrays A with 10 unsorted integer elements and B with 10 unsorted floatelements. Find the largest element in A and B and then sum both of them calling afunction SumAB() by reference. Sort A and B and then call another function StichAB()to merge B with A. Be careful about memory leakage.
For this assignment please use 2 arrays. Write a program DiscreteDistribution.java that will take an integer command-line argument m, followed by a sequence of positive integer command-line arguments a1,a2,…,ana1,a2,…,an, and will print m random indices (separated by whitespace), choosing each index i with probability proportional to ai.
in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);