13.4 CodingBird (Array): flip Create an array of ints length 7, return the elements in reverse order without the first element, so {1, 2, 3, 4, 5, 6, 7) becomes (7, 6, 5, 4, 3, 2). Ex: If the input is: 1 2 3 4 567 the output is: 7 6 5 4 3 2 Ex: If the input is: 2 4 6 8 10 12 14 the output is: 14 12 10 864 449182.3196742.qx3zqy7 LAB ACTIVITY 1 import java.util.Scanner; 3 public class flip { 4 5 6 7} 8 13.4.1: CodingBird (Array): flip public static void main(String[] args) { /* Type your code here. */ } flip.java 0/10 Load default template...

13.4 CodingBird (Array): flip Create an array of ints length 7, return the elements in reverse order without the first element, so {1, 2, 3, 4, 5, 6, 7) becomes (7, 6, 5, 4, 3, 2). Ex: If the input is: 1 2 3 4 567 the output is: 7 6 5 4 3 2 Ex: If the input is: 2 4 6 8 10 12 14 the output is: 14 12 10 864 449182.3196742.qx3zqy7 LAB ACTIVITY 1 import java.util.Scanner; 3 public class flip { 4 5 6 7} 8 13.4.1: CodingBird (Array): flip public static void main(String[] args) { /* Type your code here. */ } flip.java 0/10 Load default template...

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

6.9 LAB: All permutations of names Write a program that lists all ways people can line up for a photo (all permutations of a list of Strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia import java.util.Scanner;import java.util.ArrayList; public class PhotoLineups { // TODO: Write method to create and output all permutations of the list of names.public static void allPermutations(ArrayList<String> permList, ArrayList<String> nameList) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in);ArrayList<String> nameList = new ArrayList<String>();ArrayList<String> permList = new ArrayList<String>();String name;//…
TODO 1.2 Make an array with the values [100, 50, 32, 1000]. Put the results in a variable named array_from_list. # TODO 8.2 array_from_list = print(f"array_from_list output: \n{array_from_list}") print(f"array_from_list shape: {array_from_list.shape}") todo_check([ (array_from_list.shape == (4,),'array_from_list did not have the shape (4,)'), (list(array_from_list) == [100,50,32,1000],'array_from_list did not contain the values [100, 50, 32, 1000]') ])
Needs help to complete this activity Image is attached
13.3 LAB: Algorithm 2 Bubble Sort CORAL LANGUAGE PLEASE This zyLab is about Bubble Sort Algorithm.The first number is the size of the arrayThe rest of the numbers are the values of arrayexample 1:Input7 44 94 27 89 48 58 4Output4 27 44 48 58 89 94example 2:Input9 22 56 33 78 16 99 17 8 2Output2 8 16 17 22 33 56 78 99
Can you help me write this code?
5.16 LAB: Cryptographic Hashing Algorithms Encryption methods, such as the Caesar Cipher encryption, allow us to encrypt and decrypt text using a special key. Another method of encrypting text / passwords is called hashing. Hashing uses special algorithms to 'scramble' the text, which is tougher to be hacked. The hash function can take numbers, letters, and symbols as input, then the function applies one of the special algorithms to output the scrambled text. The longer the output string is, the harder to hack the hashed data. The difference between hashing and the Caesar Cipher encryption is that one cannot 'decrypt' a hashed data to its original text. Since a hashed data cannot be decrypted, a user must enter the original text, which will be hashed by the program. Then the program compares the hashed value with the hashed data stored previously for the original text. A salt is used, at times, to create a random sequence that is added to the original text before using the hashing…
8.13 LAB: Library book sorting Two sorted lists have been created, one implemented using a linked list (LinkedListLibrary linkedListLibrary) and the other implemented using the built-in Vector class (VectorLibrary vectorLibrary). Each list contains 100 books (title, ISBN number, author), sorted in ascending order by ISBN number. Complete main() by inserting a new book into each list using the respective LinkedListLibrary and VectorLibrary InsertSorted() methods and outputting the number of operations the computer must perform to insert the new book. Each InsertSorted() returns the number of operations the computer performs. Ex: If the input is: The Catcher in the Rye 9787543321724 J.D. Salinger the output is: Number of linked list operations: 1 Number of vector operations: 1 Which list do you think will require the most operations? Why? Main.cpp: #include "LinkedListLibrary.h"#include "VectorLibrary.h"#include "BookNode.h"#include "Book.h"#include <fstream>#include…
5.19 LAB: Adjust list by normalizing When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Assume that the list will always contain less than 20 floating-point values. For coding simplicity, follow every output value by a space, including the last one. And, output each floating-point value with two digits after the decimal point, which can be achieved as follows:printf("%0.2lf ", yourValue); Ex: If the input is: 5 30.0 50.0 10.0 100.0 65.0 the output is: 0.30 0.50 0.10 1.00 0.65 The 5 indicates that there are five floating-point values in the list, namely 30.0, 50.0, 10.0, 100.0, and 65.0. 100.0 is the largest value in the list, so each value is divided by 100.0.…
19.3 LAB: Hailstone sequence Given a positive integer n, the following rules will always create a sequence that ends with 1, called the hailstone sequence: If n is even, divide it by 2 If n is odd, multiply it by 3 and add 1 (i.e. 3n +1) Continue until n is 1 Write a program that reads an integer as input and prints the hailstone sequence starting with the integer entered. Format the output so that ten integers, each separated by a tab character (\t), are printed per line. The output format can be achieved as follows:print(n, end='\t') Ex: If the input is: 25 the output is: 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 Use Python, please.
7.16 LAB: JavaScript Tic-Tac-Toe In this lab, you will write JavaScript to implement a Tic-Tac-Toe game, as shown below. The human is X, and the computer is O. A "New game" button starts a new game. Investigate the page elements The given index.html file contains all needed page elements for a game of Tic-Tac-Toe: A div with ID gameBoard and 9 buttons forms the game board. CSS in tictactoe.css converts the div and buttons into a 3x3 grid. A paragraph with ID turnInfo, initially containing text "TURN INFO", indicates the turn is the player's or computer's. A "New game" button with ID newGameButton allows the player to clear the board and start a new game. Investigate the stylesheet The given tictactoe.css file contains .x and .o rules to set the X and O button colors. Other CSS rules style the grid and buttons. Investigate the JavaScript The given tictactoe.js script has six declarations: playerTurn: Boolean variable that is true when the turn belongs to the player and false…