Problem 1: LAB NR. 13 C PROGRAMMING January 27, 2023 Modify the program from the last lab in a way, that it will now read the strings from the text file, and put it into dynamically allocated array. Use you own exemplary file with ten lines. Problem 2: Now, sort the array using the bubble sort algorithm. Problem 3: Dump the strings in the sorted array into the separate text file. Free all the memory before finishing the program.

Problem 1: LAB NR. 13 C PROGRAMMING January 27, 2023 Modify the program from the last lab in a way, that it will now read the strings from the text file, and put it into dynamically allocated array. Use you own exemplary file with ten lines. Problem 2: Now, sort the array using the bubble sort algorithm. Problem 3: Dump the strings in the sorted array into the separate text file. Free all the memory before finishing the program.

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

Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
1) Demonstrate that when a ten element array, a, is passed, if the the called method can change the value of each element, and those changes will also change the array elements in main(); the called method must not have a return statement Before passing the array, have main() display it, and write it to a file named beforechangeAfter the change, display it and write its contents to a file named afterchange After the called method completes, main() displays the contenets of both files, beforechange afterchange Before populating array, a, from the keyboard, verify the entry is what the program expects Note:- Please type and execute this java program as soon as possible and also need an output for this java program.
Create a new SCRIPT file called additup.m, inside this file, a) Use a for loop to sum the elements in the following vector: X=[1,23,43,72,87,56,98,33] b) Check your answer with the sum function. c) Solve the problem a third time, this time using a while loop.
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
1. Reads 10 integer numbers (34, 57, 13, 82, 11, 8, 69, 44, 6, and 26) from a text file and sorts them in an array. Uses merge sort algorithm to store those numbers in an array. 2. Searches for any number within the sorted list using Binary search. Searches for any number that is not exist in the sorted list. Use exception handling to print out the corresponding error message
Question 1.1Write a function, ReadFile(), that reads the contentof the provided text file “numbers.txt” (seeAppendix A) and stores it in an array. The functionreceives as parameter a pointer to a characterarray where the content of the text file should bestored. The number of lines that was read from thetext file must be returned to the calling statement. Question 1.2Write a function, analyseStNumber(), whichreceives a number as parameter and determineswhether the number is a valid student number ornot. Use the following validity test to determine thevalidity of a student number:Student number: 20570856sum = (2*8)+(0*7)+(5*6)+(7*5)+(0*4)+(8*3)+(5*2)+(6*1)result = sum%11If the result equals 0, the number is a valid studentnumber; if the result is not equal to 0, the numberis an invalid student number.The function MUST use a loop to analyse thenumber by looking at each individual digit in thenumber.The function returns a 1 (valid) or 0 (invalid) to thecalling statement.Hint: Repeatedly…
Select true or false for the statements below. Explain your answers if you like to receive partial credit 9) Which of the following is true about the Mergesort algorithm applied to an array ofnumbers that are all different?a. Memory usage is efficient because all swaps take place within the same arrayb. Performance is consistently at O(n log n) for all array scenariosc. When the partition function completes on the array, the pivot element willalways be in the exact center of the array
Quicksort's partition function might be modified as follows: Count the amount of values that are strictly fewer than the leftmost value to determine where the leftmost value should go. The final figure is the precise index for the required value. The value at the indexed position should be swapped out with the value on the left. Does this provide an accurate quicksort with the remaining code in place? If not, please explain.
Computer Science Write a shell program to demonstrate array operations using switch case. The operations are print all values of an array, print specific values of an array, print range values, get the size of an array, search and replace value, add new value to existing array, remove a value of an array, deleting Arrays, copy an array, combining arrays, and load Content of a File into an array
Create a file called unsorted.dat and copy (or type) the following floating point numbers into that file. 12.75 9.39 -15.25 18.34 12.65 -23.78 15.25 10.42 7.39 Now, create a program file called Time3.cpp with the following requirements. • In your main function, read the unsorted.dat file in an array. You do not know exactly how many numbers there are in the file (your program should be generic), so declare an array of sufficiently large size and use the while loop to read the numbers into the array. • Then, use a programmer-defined function to sort this array in ascending order. You cannot create a separate array for this purpose. You need to call this function and pass the array to this function from the main function. • In your main function, write the sorted array to an output file named sorted.dat.
Demonstrate that when a ten element array, a, is passed, if the the called method can change the value of each element, and those changes will also change the array elements in main(); the called method must not have a return statement Before passing the array, have main() display it, and write it to a file named beforechange After the change, display it and write its contents to a file named afterchange After the called method completes, main() displays the contenets of both files, beforechange afterchange Before populating array, a, from the keyboard, verify the entry is what the program expects Java Programming
C++ LANGUAGE In this assignment, you will be writing two objects to heuristically compare the performance of the bubble sort, selection sort, and insertion sort algorithms. To do this, a “Timer” object will be created and compositionally related to a storage class that will load the file contents, execute the sorts in an unbiased manner, handle any memory allocations that need to be made in order to do this, and reports back the execution times of each algorithm on the provided input files for that machine. First you will need to make a Timer object. This object should function like a traditional stopwatch with methods for starting, stopping, resetting, and reporting back times. The design of the object itself is up to you (it should minimally contain methods for the aforementioned ideas), but it must consist of a solitary object that provides interfaces appropriate for being compositionally included as part of a sorting object to facilitate the timekeeping portion of this exercise.…