5. Design an algorithm that asks the user for the name of a text file containing a grid of numbers and loads it into a 2D array of integers (think like an image without the color channel), then outputs the index (row, col) of the SMALLEST number in the array. Libraries: Input: Output: Design Pattern: Search Find Min Find Max Find All Principal Mechanisms (select all that apply): Single Loop Conditional (if/else) statement Nested Loop split() Indexing / Slicing ☐ input () Process (as a concise and precise LIST OF STEPS / pseudocode): (Assume libraries have already been imported.)

5. Design an algorithm that asks the user for the name of a text file containing a grid of numbers and loads it into a 2D array of integers (think like an image without the color channel), then outputs the index (row, col) of the SMALLEST number in the array. Libraries: Input: Output: Design Pattern: Search Find Min Find Max Find All Principal Mechanisms (select all that apply): Single Loop Conditional (if/else) statement Nested Loop split() Indexing / Slicing ☐ input () Process (as a concise and precise LIST OF STEPS / pseudocode): (Assume libraries have already been imported.)

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

Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
Computer Science Java Program Write a program in Java that takes in a user-submitted file that is a grid of 0s and 1s. Represent the grid as a two-dimensional array. Write a program that: a. computes the size of a group when a square in the group is given b. computes the numbers of different groups c. lists all groups Example: userInput.txt: 0 0 0 0 0 0 0 0 0 10 0 0 1 1 0 0 0 0 10 0 0 0 0 0 0 0 0 00 0 0 0 1 0 0 1 0 00 0 0 1 0 0 0 1 0 00 0 0 0 0 0 0 1 1 00 0 0 0 1 1 0 0 0 00 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 The program should output three things: The size of the group in which location specified by the user belongs. then if the user enters 1,2 the answer is 0 1,4 the answer is 2 3,4 the answer is 1 4,7 the answer is 4 The number of each size group Size Count 2 3 1 List of each group’s locations 1: (0,9) (1,9) 2: (1,3) (1,4) 3: (3,4) 4: (3,7) (4,7) (5,7) (5,8) 5: (4,3) 6: (6,4) (6,5)
Language is C++ Lab10B: Binary Bubbles. Binary search is a very fast searching algorithm, however it requires a set of numbers to be sorted first. For this lab, create an array full of 11 integers which the user will generate. Like in the previous lab, assume that the values will be between -100 and +100. Then, using the sorting algorithm called BubbleSort, put the array in the correct order (from lowest to highest number). After this, please printthe array to the screen. Finally, search the array for the target value using Binary Search.The BinarySearch code will implement the algorithm described in the lecture slides. During this, you should print out a few key values which help Binary Search function. For example, this algorithm focuses on a low, mid, and high which correspond to the indices in the array the algorithm is currently considering and searching. Printing these values during the search process will help with debugging and fixing any issues. • BubbleSort sorts the array…
write a program that reads the students.txt file and stores the name of the student and the grade information as a student object in an arraylist sorts the students names based on their first grade in decreasing order using the selection sort algorithm writes the sorted list as the students last name , middle name (if theres one), first name , and grade information into a text file output example: Robison, Lee 95 80 Green, Alex R 85 60 Waston, Zoe G 100 80 use java
A common memory matching game played by young children is to start with a deck of cards that contain identical pairs. For example, given six cards in the deck, two might be labeled 1, two labeled 2, and two labeled 3. The cards are shuffled and placed face down on the table. A player then selects two cards that are face down, turns them face up, and if the cards match, they are left face up. If the two cards do not match, they are returned to their original face down position. The game continues until all cards are face up. Write a program that plays the memory matching game. Use 16 cards that are laid out in a 4  4 square and are labeled with pairs of numbers from 1 to 8. Your program should allow the player to specify the cards that he or she would like to select through a coordinate system. For example, in the following layout: 1 2 3 4 1 8 * * * 2 * * * * 3 * 8 * * 4 * * * * all of the face down cards are indicated by *. The pairs of 8 that are face up are at coordinates (1,1) and…
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
The selection sort algorithm is a simple sorting algorithm based on the idea of finding the minimum in an unsorted array and then putting it in its correct position in an ascending order. It starts by searching for the minimum element in the array and then swapped with the element that is currently located at the first position. A temporary variable is used to do the swap. Write a java class called SelectionSortNoTemp that sorts an array using selection sort. Do not use a temporary variable when you swap two elements. Modify your answer in ‘A’ to sort the array in descending order.
Programming in C language. AskForNumbers Declare an integer array lacally with the size of 200. Create a program that asks the user how many numbers the have. Use your getChoice() function from before. Make sure it does not exceed 200 as the locally declared array has the size of 200. Use a for loop and ask the user to enter each value that must be stored in the array. Use a second loop to display each number, and also determine the average of all values in the array. After the for loop, display the average of all numbers. This program will let you enter a list of numbers into an array. It will then display all of the numbers, and finally display the average of all numbers. How many numbers would you like to enter?5 Please enter a number:22 Please enter a number:33 Please enter a number:44 Please enter a number:55 Please enter a number:66 Number Number 2 is 33 Number 3 is 44 Number 4 is 55 Number 5 is 66 The average is 44 is 22
In PYTHON Define a vector of integers with 10 elements  Write a loop to print the vector as follows From 1st to last element, using a while-do loop, where  Print all odd numbers first Then, print all even numbers  Use one loop only
create an INDEXCEPTION value of the unique vowels and unique consonants that the name that was given to you can create. Use python processStep 1: For every unique vowel of a name, you need to get the first index of that vowel from the original string.Step 2: For each vowel index you get from step 1, you will get the unique consonant from that position. if the index is out of scope of the consonant array, ignore that vowel index.Step 3: For each unique consonant that you get from step 2, you need to get the first index of that consonant from the original string.Step 4: Get the value of indexception by adding all index you get from step 3.outputTO BE DISPLAYED- 2 lists that consists of unique vowels and unique consonants- The vowel, the vowel index, the consonant, the consonant indexFINAL OUTPUT- The total indexception value of the name that was given to you.
Review Loops Write a java program to ask three people three questions about name, number of courses, and number of credit hours. Also, print result in columns as below. Note: the input.nextInt() method reads only the integer value from input buffer.The "\n" is still staying in the input buffer. If you continue reading with input.nextLine(),you will receive the "\n" and CPU will not wait for any input. To fix this problem, you addthe statement input.nextLine() to flush out the "\n" from the input buffer.
Computer Science Create a program to generate 100 random integers between -100 to 100 (all-inclusive). Add these numbers to an ArrayList, then loop through them to remove the negative numbers. Display the remaining numbers in a separate loop. Using Java programming.