q10answer A and B A) What is the output of the print statements with the following arguments:array = {6, 3, 4, 2, 5}n = 5B) Why is n-1 used in the condition on line 3? Question 10Consider the following pseudocode of selection sort:1 void selectionSort(int arr[], int n)2 {3 for (i = 0; i < n-1; i++)4 {I/ Find the minimum element in unsorted arrayminimum = i;7for (j = i+1; j< n; j++) {8if arr[minimum] > arrfi]minimum = j;10 }I/ Swap the found minimum element with the first element1112print(i)13print(minimum)15swap the elements at i and minimum;16 }17}

Given: We have the pseudo code for minimum print the element and there is 2 question asked on that…

Answered: A) What is the output of the print…

A) What is the output of the print statements with the following arguments: array = {6, 3, 4, 2, 5} n = 5 B) Why is n-1 used in the condition on line 3?

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

Java Selection Sort but make it read the data 64, 25, 12, 22, 11 from a file not an array // Java program for implementation of Selection Sort class SelectionSort { void sort(int arr[]) { int n = arr.length; // One by one move boundary of unsorted subarray for (int i = 0; i < n-1; i++) { // Find the minimum element in unsorted array int min_idx = i; for (int j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element with the first // element int temp = arr[min_idx]; arr[min_idx] = arr[i]; arr[i] = temp; } } // Prints the array void printArray(int arr[]) { int n = arr.length; for (int i=0; i<n; ++i) System.out.print(arr[i]+" "); System.out.println(); } // Driver code to test above public…
List ADT Implementation (via dynamic array) • Implement the following operations of List ADT by using array class (as discussed in the lecture) • Constructors (default, parameterize, copy) & destructor • void printList ( ), int searchElement (int X), void insertElement (int X), void insertElementAt (int X, int pos), bool deleteElement (int X), bool isFull ( ), bool isEmpty ( ), int length ( ), void reverseList ( ), void emptyList ( ), void copyList (...) • Also write a driver (main) program to test your code (provide menu for all operations)
Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array // Java program for implementation of Insertion Sort public class InsertionSort { /*Function to sort array using insertion sort*/ void sort(int arr[]) { int n = arr.length; for (int i = 1; i < n; ++i) { int key = arr[i]; int j = i - 1; /* Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current position */ while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } } /* A utility function to print array of size n*/ static void printArray(int arr[]) { int n = arr.length; for (int i = 0; i < n; ++i) System.out.print(arr[i] + " "); System.out.println(); } // Driver method…
Background for Question 14-20: Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int[] arr) { int n = arr.length; int temp = 0; for (int i = 0; i < n; i++) { for (int j = 1; j < (n - i); j++) { if (arr[j - 1] > arr[j]) { temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp; } } } } Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage? List test path(s) that achieves the edge coverage. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. In your control flow graph, what are the test requirements for…
ALGO2(A)// A is an integer array, index starting at 11:for i=1 to n-1 do2: for j=n to i+1 do3: if (A[j] < A[j-1]) then4: exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n? Option 1) a*(n^2) + b*n +c, where a,b,c are constantsOption 2) a*n + b , where a and b are constantsOption 3) a * n * log(n) + b, where a,b are constantsOption 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constants
array unordered Arr has unsorted integers. SortedArr is an integer array. SortedArr performs which task better than unsortedArr? Use the fastest algorithms. Inserting a new element II Searching for a given element III Calculating the mean of the elements (A) I alone (B) II alone (C) III alone (D) I and II alone (E) I, II, and III
import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
In a non-empty array of integers, the priority of a number is determined by thefrequency of its occurrence. Elements are added as they come but the most frequentelement is deleted first. If two elements have the same priority, then the elementwhich came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3]. Afterthe first deletion now the array will be num={1,2,1,1,2}. Implement a priority queuefor the aforementioned scenario.
Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array “a” from“index” to “n-1” index values.swap is a separate function that swaps elements in the given array “a” between theelements at index “k” and “index” respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then…
Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element? 7 6 14 11 9 4 3 12 6 4 3 7 11 9 14 12 6 3 4 7 9 14 11 12 7 6 4 3 9 14 11 12 Quick sort follows Divide-and-Conquer strategy. True False Assume you have the array 7,9,6,10,3,5,8. What will the array look like after we call build-min-heap on the entire array? 3, 7, 5, 10, 9, 8, 6 3, 5, 6, 7, 8, 9, 10 3, 7, 5, 10, 9, 6, 8 10, 9, 8, 7, 6, 5, 3 3, 5, 7, 10, 9, 6, 8 Assume you have the following array: 30, 50, 20, 80, 10, 90, 100. Assume you were to select the quicksort pivot as the middle element of the array. What are the two sub-arrays to be sorted that result after one iteration of quicksort? 30, 50, 20, 10 | 90, 100 10, 20, 30, 50 | 90, 100 30, 50, 20, 10 | 100, 90 30, 20, 50, 10 | 100, 9
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*; class GFG { // A utility function to swap two elements static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ static int partition(int[] arr, int low, int high) { // pivot int pivot = arr[high]; // Index of smaller element and // indicates the right position // of pivot found so far int i = (low - 1); for (int j = low; j <= high - 1; j++) { // If current element is smaller // than the pivot if…
Trace each pass of selection, insertion, and quick sort for the list of values below. For quick sort, assumethat the pivot is the middle value in the portion of the array to be sorted. If there are an even number ofitems in the unsorted part of the list, so that two values “tie” for the middle value, pick the one on theleft as the pivot.The numbers are: 6, 3, 11, 4, 9, 8, 17 ,7