Write a program that reads words from a filename, which is given as a string argument. It should return the words from the file in a list, sorted in reverse alphabetical order (case insensitive) . For instance, if the file has bell tea Zebra apple yellow Then the output should be ['Zebra', 'yellow', 'tea', 'bell', 'apple'] def reverse_sorted_words(filename): # YOUR CODE HERE raise NotImplementedError()

Write a program that reads words from a filename, which is given as a string argument. It should return the words from the file in a list, sorted in reverse alphabetical order (case insensitive) . For instance, if the file has bell tea Zebra apple yellow Then the output should be ['Zebra', 'yellow', 'tea', 'bell', 'apple'] def reverse_sorted_words(filename): # YOUR CODE HERE raise NotImplementedError()

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

Python write a program in python that plays the game of Hangman. When the user plays Hangman, the computer first selects a secret word at random from a list built into the program. The program then prints out a row of dashes asks the user to guess a letter. If the user guesses a letter that is in the word, the word is redisplayed with all instances of that letter shown in the correct positions, along with any letters correctly guessed on previous turns. If the letter does not appear in the word, the user is charged with an incorrect guess. The user keeps guessing letters until either: * the user has correctly guessed all the letters in the word or * the user has made eight incorrect guesses. one for each letter in the secret word and Hangman comes from the fact that incorrect guesses are recorded by drawing an evolving picture of the user being hanged at a scaffold. For each incorrect guess, a new part of a stick-figure body the head, then the body, then each arm, each leg, and finally…
The function last_words in python takes one parameter, fname, the name of a text file, and returns a list containing the last word from each line of the file. For example, if the file contents are: apples are red bananas are yellow limes are green then the list ["red", "yellow", "green"] should be returned. NOTE: You may assume the file will contain no blank lines. BIG HINT: If line is a string representing a line of text (inside a for loop!), then L = line.split() creates a list of the words in the line. For example: Test Result L = last_words("wordlist1.txt") print(L) ['happy', 'sad', 'angsty', 'euphoric', 'maudlin']
Python please: Given the input file input1.csv write a program that first reads in the name of the input file and then reads the file using the csv.reader() method. The file contains a list of words separated by commas. Your program should output the words in a sorted list. The contents of the input1.csv are: hello,cat,man,hey,dog,boy,Hello,man,cat,woman,dog,Cat,hey,boy Example: If the input is input1.csv the output is: ['Cat', 'Hello', 'boy', 'boy', 'cat', 'cat', 'dog', 'dog', 'hello', 'hey', 'hey', 'man', 'man', 'woman'] Note: There is a newline at the end of the output.
In C++, you are going to write a program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. Letters.txt contains 26 English Letters: Copy the following exactly as it is into own .txt file to test: ABCDEFGHIJKLMNOPQRSTUVWXYZ Sequence.txt contains a list of numbers. Copy the following exactly as is into another .txt file3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the current position will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third element backward from the current position which is ‘A’. You…
For this problem set, you will submit java file named Homework.java Return Growing NumList This function will be given a single number, it should return a list of strings of numbers. Each string in the list will only contain a single number repeated an arbitrary amount of times. The number each string will contain will be equal to the current string's index+1. The number in the string should be repeated the same number of times as the string's index+1. Each number in the string should be separated by a space. This list should stop when its size equals the max number specified. Signature: public static ArrayList<String> returnGrowingNumList(int max) Example: INPUT: 3OUTPUT: [1, 2 2, 3 3 3] INPUT: 6OUTPUT: [1, 2 2, 3 3 3, 4 4 4 4, 5 5 5 5 5, 6 6 6 6 6 6]
The function should be written in python language. Write a function called "zero_triples" to return all triples in a list of integers that sum to zero. You can assume the list won't contain any duplicates, and a triple should not use the same number more than once. [In]: zero_triples([1, 2, 4]) [Out]: [] [In]: zero_triples([-3, 1, 4, 2]) [Out]: [[1, 2, -3]] [In]: zero_triples([-9, 1, -3, 2, 4, 5, -4, -1]) [Out]: [[-9, 4, 5], [1, -3, 2], [-3, 4, -1], [5, -4, -1]]
EQrite a java program to read from a file called "treeList.txt". The file includes tree height, and tree age for unknown number of trees. The file use a comma separated file format, as the sample below. The program should write old trees only into an output file called "oldTrees.txt". A tree is considered old if its height is above 120 and its age is greater than 5 years. Finally print number of old trees at the end of the output file and format the output file to be similar to the given sample. treeList.txt oldTrees.txt 15.000,5 Tree Height Age 130.500,7 1. 130.500 7 140.000,6 2. 140.000 150.800,3 100.200,8 Number of old trees = 2.
In C++ Write a program that replaces words in a sentence. The input begins with an integer indicating the number of word replacement pairs (original and replacement) that follow. The next line of input begins with an integer indicating the number of words in the sentence that follows. Any word on the original list is replaced. Ex: If the input is: 3 automobile car manufacturer maker children kids15 The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. then the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique. For coding simplicity, follow each output word by a space, even the last one. Hint: For words to replace, use two vectors: One for the original words, and the other for the replacements. Your program must define and call the following function that returns index of word's first occurrence in wordList. If not found, then the function…
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The textfile is named inputfilename.txt am trying to read for the matrix 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n =…
Write a function named allUnique in JavaScript that takes an array as input and returns true if each item appears once only on the list and false otherwise. You may assume the list is flat (i.e., no nested lists). For example, allUnique(['a', 'b', 'c', 1, 2)) should return true allUnique(['a', 'b', 'c', 1, 'a')) should return false allUnique([]) should return true -You can check wither an object obj has a key/property item by calling obj.hasOwnProperty(item) IMPORTANT: Make sure the last line of your submission is module.export = allUnique;
Write in Python: A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes in word pairs that consist of a name and a phone number (both strings), separated by a comma. That list is followed by a name, and your program should output the phone number associated with that name. Assume the search name is always in the list. Ex: If the input is: Joe,123-5432 Linda,983-4123 Frank,867-5309 Frank the output is: 867-5309
Write a function list2DigitOdd() that creates and returns a list that contain all positive 2-digit odd numbers. The function call list2DigitOdd() will return a list containing 11, 13, 15, ..., 99.