Q.2 Consider the following statements on Array : S1: Array is static in nature whose size needs to be declared first. S2 : Increasing the size of array takes O(n) time. Now choose the correct option : S1 is correct and S2 is the reason of A S1 being correct. Both S1 and S2 are correct but they В are uncomparable. S2 is correct and S1 is the reason for S2 being correct. D S1 is correct but S2 is not correct.

Q.2 Consider the following statements on Array : S1: Array is static in nature whose size needs to be declared first. S2 : Increasing the size of array takes O(n) time. Now choose the correct option : S1 is correct and S2 is the reason of A S1 being correct. Both S1 and S2 are correct but they В are uncomparable. S2 is correct and S1 is the reason for S2 being correct. D S1 is correct but S2 is not correct.

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

int main() { int inStock[10][4]; int alpha[20]; int beta[20]; int gamma[4] = {11, 13, 15, 17}; int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11,1, 8};. . .} a. Write the definition of the function setZero that initializes any onedimensional array of type int to 0. b. Write the definition of the function inputArray that prompts the user to input 20 numbers and stores the numbers into alpha. c. Write the definition of the function doubleArray that initializes the elements of beta to two times the corresponding elements in alpha. Make sure that you prevent the function from modifying the elements of alpha. d. Write the definition of the function copyGamma that sets the elements of the first row of inStock to gamma and the remaining rows of inStock to three times the previous row of inStock. Make sure that you prevent the function from modifying the elements of gamma. e. Write the definition of the function copyAlphaBeta that stores alpha into the first five rows of inStock and beta into the…
3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
Using Kotlin Make up four students - add them into an array. Create a function for the class that checks if a given student name is in an array. Check if student (pick a name from your array) is in the array and print the result. Use the in operator. my code so far fun main() { // create 4 students var student1 = Student("JIm", 47, "3432") var student2 = Student("Bill", 35, "1222") var student3 = Student("Mary", 21, "58F5") var student4 = Student("Graham", 29, "8958") var students=arrayOf(student1, student2, student3, student4) for (student in students) { student.nameExists) } } class Student(var name: String, var age: Int, var classID: String){ fun nameExists() { if("Mary" in name) { println("Name is in the array") } } }
Suppoce we're given numpy arrays of names and scores, where each row in the scores array lists the midterm and final scores for that respective student. For example, Carol has a 75 on the midterm and 99 on the final. names = np. array([ "Alice" "Bob". "Carol","Derek ","Erin"]) Scores = np.array([ [95, 98], [82, 88], [75, 99], [80, 90], 85, 82 ]]) Write function avgMidtermNoC that takes ve parameters names and score arrays, and returns the average score on the midterm, exduding anyone who's name starta with C.
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
Can you help me please: have the program know when numbers out of the array boundaries are received and mitigate those problems. The given code intentionally induces numbers out of bounds and the student’s portion must correct for this. As always use a header file and implementation file to do those calculations. Remember not to change the given code below in any way Design and implement the class myArray that solves the array index out of bounds problem and also allows the user to begin the array index starting at any integer, positive or negative. Every object of type myArray is an array of type int. During execution, when accessing an array component, if the index is out of bounds, the program must terminate with an appropriate error message. Consider the following statements:myArray list(5);                                  //Line 1 myArraymyList(2, 13);                     //Line 2myArray yourList(-5, 9);                    //Line 3The statement in Line 1 declares list to be an…
Write 3 functions: Write int readNumbersIntoArray(int numbers[], int size); // Reads up to size numbers or a non-numeric and puts them in the array. // Returns how many numbers read. Write int minOrMax(int numbers[], int size, bool Max); // Returns the minimum or the maximum value in the array depending on "Max". // If "Max" is true, then it returns the maximum. // If "Max" is false, then it returns the minimum. Write double trimmedAvg(int numbers[], int size); // Returns the trimmed average of the array. // A trimmed average is a normal average but leaves out the first instance of // the smallest and largest value in the array when doing the calculation. // HINT: use calls to minOrMax() to get the largest and smallest number. Write int main(): // Prompt the user for between 3 and 20 numbers and use readNumbersIntoArray() to // read them into an array. Print an error message and exit if less than three numbers. // Print out the min, max, and trimmedAverage of the array using calls…
Write 3 functions: Write int readNumbersIntoArray(int numbers[], int size); // Reads up to size numbers or a non-numeric and puts them in the array. // Returns how many numbers read. Write int minOrMax(int numbers[], int size, bool Max); // Returns the minimum or the maximum value in the array depending on "Max". // If "Max" is true, then it returns the maximum. // If "Max" is false, then it returns the minimum. Write double trimmedAvg(int numbers[], int size); // Returns the trimmed average of the array. // A trimmed average is a normal average but leaves out the first instance of // the smallest and largest value in the array when doing the calculation. // HINT: use calls to minOrMax() to get the largest and smallest number. Write int main(): // Prompt the user for between 3 and 20 numbers and use readNumbersIntoArray() to // read them into an array. Print an error message and exit if less than three numbers. // Print out the min, max, and trimmedAverage of the array using calls…
2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.Whereas a binary search always looks at the middle item in an array, an interpolation searchlooks where the sought-for item is more likely to occur. For example, if you searched yourtelephone book for Victoria Appleseed, you probably would look near its beginning ratherthan its middle. And if you discovered many Appleseeds, you would look near the lastAppleseed. Instead of looking at the element a[mid] of an array a, as the binary search would,an interpolation search examines a[index], where p = (desiredElement - a[first]) / (a[last] - a[first]) index = first + [(last – first) × p]Implement an interpolation search of an array. For particular arrays, compare the outcomesof an interpolation search and of a binary search. Consider arrays that have uniformlydistributed entries and arrays that do not. Modify and save the file asSearchComparerYourlastname.java.
Part 1 Write a function that takes an integer array and the size of the array The array is supposed to have 'N' integers in it, where N-1 integers are repeated even number of times and one integer is repeated odd number of times For example array = {1,5,5, 1,2,5,2,2,5}. 1 and 5 are repeated even number of times whereas 2 is odd number times. The function should find the element which is repeated odd number of times and return it. In the case of the example shown above, the function should return 2. int FindSingleElement(int arr[], int size) { } int main(int argc, char *argv[]) { return 0; } THIS IN C++.
In the following code both myList and yourList are dynamic arrays of the same size. The code initializes the array myList to certain values. The value in each element of yourList should be twice the value in the corresponding element in myList. However, the output of this code would show that is not the case. Provide the correct code to accomplish the desired results. int *myList;int *yourList;myList = new int[5];myList[0] = 8;for (int i = 1; i < 5; i++)myList[i] = i * myList[i - 1];yourList = myList;for (int i = 0; i < 5; i++)yourList[i] = 2 * myList[i];