The following is the pseudocode for which type of algorithm?For start = each array subscript, from the first to the next-to-lastminindex = startminValue = array[start]For index = start + 1 To size - 1If arrayfindex] < minValueminValue = array[index]minindex = indexEnd IfEnd Forswap array[minindex] with array[start]End ForSelect one:a. selection sortb. bubble searchc. bubble sortd. binary sort What is wrong with the following code fragment?const int MAX SIZE =5;double scores [MAX_SIZE];for (int k=0; k<=MAX_SIZE;i++){cout << "Enter a score\n";cin >> scores [k] ;}Select one:a. Should be cin >> scores[0];b. Array indexes must be less than the size of the arrayc. Arrays must be integersd. Array indexes start at 1 not 0

1) Selection sort Selection sort is an algorithm that selects the smallest element from an unsorted…

The following is the pseudocode for which type of algorithm? For start = each array subscript, from the first to the next-to-last minindex = start minValue = array[start] For index = start +1 To size - 1 If array[index] < minValue minValue = array[index] minindex = index End If End For swap array [minIndex] with array[start] End For Select one: O a. selection sort O b. bubble search c. bubble sort d. binary sort

The following is the pseudocode for which type of algorithm? For start = each array subscript, from the first to the next-to-last minindex = start minValue = array[start] For index = start +1 To size - 1 If array[index] < minValue minValue = array[index] minindex = index End If End For swap array [minIndex] with array[start] End For Select one: O a. selection sort O b. bubble search c. bubble sort d. binary sort

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

Can you please explain this C code beside every code on each line: #include <stdio.h> int main() { long long int level; long long int time; long long int orderTime; long long int minimumTime = 0; scanf("%d", &level); getchar(); long long int array1[level]; long long int array2[level + 1]; long long int array3[level + 1]; for(int i = 0; i < level - 1; i++) { scanf("%lld", &array1[i]); getchar(); } for(int i = 0; i < level; i++){ scanf("%lld", &array2[i]); getchar(); } for(int i = 0; i < level; i++){ scanf("%lld", &array3[i]); getchar(); } for(int i = level - 1; i >= 1; i--) { if(array3[i] > array2[i]) { time = array3[i] - array2[i]; array2[i - 1] = array2[i - 1] - time; array2[i] = array2[i] + time; orderTime =…
If the following array declarations are valid, write "VALID". Otherwise, make assumptions and write a correct declaration. int[50] list; 1. int size; double[] list=new double[size]; 2. int[] test=new int[-5]; 3. double[] sales=new double[25.5]; 4. int x,y; char[x][y] board=new board[][] 5.
You need to find errors of this code and write line numbers seperating with spaces (Ex: 1 2 3) 1 #include <iostream>2345 int sum_of_even_items(int _array[],int size){67 int i=0;8 int sum = 0;9 for(,i<size,i++){1011 if(*(_array+i) % 2 = 0){1213 sum = sum + *(_array+i);15 }1617 }18 return sum19 }2021 int main()22 {23 int a[10];24 int i;252627 std::cout<<"Array : ";2829 for(i=0;i<10;i++){3031 a(i) = 1 + rand()%45;3233 std::cout<<a[i]<<” “;34 }35 std::cout<<endl;3637 std::cout<<"Sum of even array items : “<<sum_of_even_items(a[0],10);3839 std::cout<<"Odd items : \n";4041 for(i=0;i<10;i++){4243 if(a[i]%2=1){44 std::cout<<a[i];45 }46 }47 std::cout<<std::endl;4849 return 0;50 }
Given the Array declaration below, determine the output: int T[8] = {2, 3, 7, 9, -1, 2, 4, 5}; int x = 5; cout << T[x-2] / T[12-2*x]; int y = -3; cout << pow(T[y+4],T[3-y]);
Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
what is the output of following java code segment? int array[]={3,2,5}; for(int j:array) system.out.print("%d" , j); system.out.println();
Language: C Pascal’s triangle is a triangular array, useful for calculating the binomial coefficients, n k , that are used in expanding binomials raised to powers, combinatorics and probability theory. 0 0 1 0 1 1 2 0 2 1 2 2 3 0 3 1 3 2 3 3 4 0 4 1 4 2 4 3 4 4 Evaluating the values of the binomial coefficients, you get the following pattern, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 The number of the entries in each row is increased by one, as we move down. Each number in the triangle, is constructed by adding the number above it and to the left, with the number above it and to the right. The blank entries as treated as 0. Using the recursion, implement the function that computes the Pascal’s triangle. Pr
Can you correctly complete the blank code sections? #include <stdio.h> #include <stdlib.h> struct Part { int part_num; int year; int num_ordered; }; typedef struct Part Part; Blank 1 create_part(int part_num, int year, int num_ordered) { Blank 2; part->part_num = part_num; part->year = year; part->num_ordered = num_ordered; return part; } int main () { int size = 10; Blank 3; int cnt = 0; if(cnt < size) { partsBoş 4 = create_part(3, 2009, 10000); cnt++; } else { Blank 5; Blank 6; } for(int i = 0; i < size; i++) free(parts(i)); free(parts); return 0; }
Write a function that receives a string consisting of several lines of text (paragraph) andreturns an array indicating the number of occurrences of each letter of the alphabet in thetext.void countLetters(char* str, int*& array, int & size) note: Do not use any String or math libraries (such as cmath, cstring, string etc) and also do notuse built-in function (such as strlen, strcmp etc).
Write a program that defines a multidimensional array $clubs that stores information about four football clubs, including the name, and the year founded. The program should print the contents of the array using a foreach loop. The program should also sort the array by the club name using the sort() function. Finally, it should print the sorted array.Complete the code:<?php// Define a multidimensional array$clubs = array(array("Newcastle United","England", 1892),array("Gezira Sporting Club", "Egypt", 1882),array("Zamalek Sporting Club", "Egypt", 1911),array("Bidvest Wits South Africa", "Egypt", 1921));// Print the contents of the arrayecho "List of football clubs:\n";foreach ( //Add code) {//Add code}// Sort the array by the first columnsort(//Add code);// Print the sorted arrayprint_r(//Add code);?>
Consider a two-by-three integer array t. h) Write a series of statements that initializes each element of t to zero. Do not use a repetition statement. i) Write a nested for statement that initializes each element of t to zero. j) Write a nested for statement that inputs the values for the elements of t from the user. k) Write a series of statements that determines and displays the smallest value in t. l) Write a printf statement that displays the elements of the first row of t. Do not use repetition. m) Write a statement that totals the elements of the third column of t. Do not use repetition. n) Write a series of statements that displays the contents of t in tabular format. List the column indices as headings across the top, and list the row indices at the left of each row.
Write a lambda expression to count odd numbers in the following array, using a seed value of 0. Display your result on Console. int[] array = { 8,2,2,24,5,7,5,3,2,10};