•• 7. It is a common error to to accidentally repeat a word. Write a program that reads a sentence, a word at a time, and removes any adjacent duplicates. The sentence ends when you read a word that ends in a period. The sentence will have at least two words. RemoveDuplicateWords.java 1 import java.util.Scanner; 2 3 public class RemoveDuplicatewords 4 { 5 public static void main(String[] args) Scanner in = new Scanner(System.in); String word = in.next(); 10 boolean done = false; 11 while (!done) 12 codecheck-bjlo-1e-04 19 String previous = in.next(); word = in.Hasnext(); if (word.endsWith(".")) { word = in.next(); done = true; } if (compare.wordWith(".")) { System.out.print(previous + 13 14 15 16 17 18 19 20 21 22 "); 23 24 } 25 System.out.print (word + "."); 26 27 } CodeCheck Reset Score: 0

•• 7. It is a common error to to accidentally repeat a word. Write a program that reads a sentence, a word at a time, and removes any adjacent duplicates. The sentence ends when you read a word that ends in a period. The sentence will have at least two words. RemoveDuplicateWords.java 1 import java.util.Scanner; 2 3 public class RemoveDuplicatewords 4 { 5 public static void main(String[] args) Scanner in = new Scanner(System.in); String word = in.next(); 10 boolean done = false; 11 while (!done) 12 codecheck-bjlo-1e-04 19 String previous = in.next(); word = in.Hasnext(); if (word.endsWith(".")) { word = in.next(); done = true; } if (compare.wordWith(".")) { System.out.print(previous + 13 14 15 16 17 18 19 20 21 22 "); 23 24 } 25 System.out.print (word + "."); 26 27 } CodeCheck Reset Score: 0

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.29 LAB: Remove all even numbers from an array Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method…
Exercise 20 the string below comes from an alphabet consisting of only characters A and B. Accordingly, write the full code of the program (Use the given space below the question. If you struggle to fit into the space then upload a file) that prints the permutation list that can be formed with the characters A or B, which can replace the question marks, into a text file. (Hint: give a go to recursion) A?AA?BB?A? The output will be like the list below: ABAABBBBAB ABAABBBBAA ABAABBBAAB ABAABBBAAA ABAAABBBAB ABAAABBBAA ABAAABBAAB ABAAABBAAA AAAABBBBAB AAAABBBBAA AAAABBBAAB AAAABBBAAA AAAAABBBAB AAAAABBBAA AAAAABBAAB AAAAABBAAA
2. Identify and correct the errors in each of the following statements: a) if ( c !< 17 ); window.alert( "c is not less than 17" ); b) if ( c =< 17 ) window.alert( "c is equal to or less than 17" ); c) while ( c <= 5 ) { product *= c; ++c; d) if ( gender == 1 ) document.writeln( "Woman" ); else; document.writeln( "Man" ); e)var a = new Array( 20); for ( varj = 0; j = 30, ++i ){ a[ j ] = 0; }
PLEASE CODE IN PYTHON Crypto Columns The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword has 6 letters, we write the message (ignoring spacing and punctuation) in a grid with 6 columns, padding with random extra letters as needed: MEETME BYTHEO LDOAKT REENTH Here, we've padded the message with NTH. Now the message is printed out by columns, but the columns are printed in the order determined by the letters in the keyword. Since A is the letter of the keyword that comes first in the alphabet, column 2 is printed first. The next letter, B, occurs twice. In the case of a tie like this we print the columns leftmost first, so we print column 1, then column 4. This continues, printing the remaining columns in order 5, 3 and finally 6. So, the order the columns of the grid are printed would be 2, 1, 4, 5, 3, 6, in…
1) Create a array of Fahrenheit temperatures, as follows int fahr []= {0,1,2,3,4,5,6,7,8,9,10,32,33,34,35,36,37,38,39,40}; 2) create a function convert(int fahr) that converts Fahr to Cels, such as you did in class, outside of main(), above it. 3) create a loop, that prints side by side Fahrenheit temperatures from the array above (in a similar way how you printed an array in class) and Celsius temperature by calling function convert(...) in the loop to get a matching Celsius temperature for each Fahrenheit temperature that you print. Do you program in C++ compiler online. Compile it step by step, making sure your code does not have syntax errors as you add new contents.
File CountLetters.java contains a program that reads a word from the user and prints the number ofoccurrences of each letter in the word. In reviewing the code, note that the word is converted to allupper case first, then each letter is translated to a number in the range 0.25 (by subtracting 'A' ordecimal 65) for use as an index. See Appendix C for the Unicode character set.1. Run CountLetters and enter a phrase, that is, more than one word with spaces or otherpunctuation in between. It should throw an ArrayIndexOutOfBoundsException, because anon-letter will generate an index that is not between 0 and 25. It might be desirable to allownon-letter characters, but not count them. Of course, you could explicitly test the value of thecharacter to see if it is between 'A' and 'Z'. However, an alternative is to go ahead and use thetranslated character as an index and catch an ArrayIndexOutOfBoundsException if itoccurs. Since don't want to do anything when a non-letter occurs, the handler…
6.28 LAB: Check if array is sorted Use java Programming Write the inOrder() method, which has an array of integers as a parameter, and returns true if the numbers are sorted (in order from low to high) or false otherwise. The program outputs "In order" if the array is sorted, or "Not in order" if the array is not sorted. Ex: If the array passed to the inOrder() method is [5, 6, 7, 8, 3], then the method returns false and the program outputs: Not in order Ex: If the array passed to the inOrder() method is [5, 6, 7, 8 , 10], then the method returns true and the program outputs: In order public class LabProgram {public static boolean inOrder(int [] nums) {/* Type your code here. */ }public static void main(String[] args) {// Test out-of-order example.int [] nums1 = {5, 6, 7, 8, 3};if(inOrder(nums1)){System.out.println("In order");}else{System.out.println("Not in order");}// Test in-order example.int [] nums2 = {5, 6, 7, 8, 10};if(inOrder(nums2)){System.out.println("In…
3. Please create a program in Java that will read through a file of 25 words(one of them being Waldo) and will store them in an array. The program should have two types of search (sequential and binary search). Use .equals() to find Waldo and System.nanoTime to find the time it took each of the methods to find Waldo. After that, print both times and in a separate line print which method was the fastest.
5. Write a Python function that inputs an array of integers and returns the maximum value in this array. Do not use the max method on array class. 6. Write a Python program that inputs a sentence string by the user and counts the number of words in the sentence
5.15 LAB: Reverse array Use Python. Complete reverse() method that returns a new character array containing all contents in the parameter reversed. Ex: If the input array is: ['a', 'b', 'c'] then the returned array will be: ['c', 'b', 'a'] import java.util.*;public class LabProgram {// This method reverses contents of input argument arr.public static char[] reverse(char[] arr) { /* Type your code here. */ } public static void main(String[] args) {char [] ch = {'a','b','c'}; System.out.println(reverse(ch)); // Should print cba}}
Task 1: Find the longest word Implement the function findLongestWord that takes as an argument an array of words and returns the longest one. If there are 2 with the same length, it should return the first occurrence. Write the JS code in a separate file. You can use the following array to test your solution: var words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpott'];
c++ The Lock class of the preceding problem has a small problem. It does not support combinations that start with one or more zeroes. For example, a combination of 0042 can be opened by entering just 42. Solve this problem by choosing a different representation. Instead of an integer, use a string to hold the input. Once again, the combination is hardwired. You will see in Section 9.6 how to change it. Complete the following file: