Sort short_names in reverse alphabetic order. Sample output with input: 'Jan Sam Ann Joe Tod' ['Tod', 'Sam', 'Joe', 'Jan', 'Ann'] Code writing challenge activity demo 461710.3116374.qx3zqy7 1 user_input = input() 2 short_names = user_input.split() 3 Your solution goes here *** 4 5 6 print (short_names)

Sort short_names in reverse alphabetic order. Sample output with input: 'Jan Sam Ann Joe Tod' ['Tod', 'Sam', 'Joe', 'Jan', 'Ann'] Code writing challenge activity demo 461710.3116374.qx3zqy7 1 user_input = input() 2 short_names = user_input.split() 3 Your solution goes here *** 4 5 6 print (short_names)

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

IN JS ONLY NEEDED SOLUTION Your local bank has decided to upgrade its ATM machines by incorporating motion sensor technology. The machines now interpret a series of consecutive dance moves in place of a PIN number. Create a program that converts a customer's PIN number to its dance equivalent. There is one dance move per digit in the PIN number. A list of dance moves is given in the code. Examples danceConvert ("0000") → ["Shimmy", "Shake", "Pirouette", "slide"] danceConvert ("3856") → [ "slide", "Arabesque", "Pop", "Arabesque" ] danceConvert ("9999") → [ "Arabesque", "Shimmy", "Shake", "Pirouette" ] danceConvert ("32a1") → "Invalid input." (Ctrl)
use java
def sind_approx(x: float) -> float: """ sind_approx(x) returns the Bhaskara I's sine approximation for sine in degrees. This approximation is only valid within the range [0, 180]. The sine approximation is given as: 4 * x * (180 - x) / (40500 - x * (180 - x)) example: sind_approx(90.0) -> 1.0 example: sind_approx(0.0) -> 0.0 example: sind_approx(180.0) -> 0.0 example: sind_approx(45.0) -> 0.7058823529... TODO: add param and return descriptions here """ pass # TODO: replace 'pass' with the function implementation
re Write a program which ends when a user types a user- defined letter. 1. Get an english letter as a sentinal value(a condition of termination). 2. The user will be asked to type an english letter until a user types above sentinel value. Hint: Use char type variables for english letters. e Sample output1: Pick an english letter to terminate: t Type an english letter: y Type an english letter: w Type an english letter: p Type an english letter: h Type an english letter: t Вye. Sample output2: e Pick an english letter to terminate: g Type an english letter: h Type an english letter: g Вye.
def g11_3(N) :'''Assume that N is a positive integer.Returns the sum from 1 to N inclusive, but omitting the numbers that are of type series1, meaning omit numbers that can be written as 1 + 2 + 3 + 4 + ... + k for some positive integer k. Hint: write a boolean function that checks if an integer is of typeseries1. For example, the first few series1 numbers are 1, 3, 6, 10, ...So, g11_3(10) returns 35since the numbers to add are: 2, 4, 5, 7, 8, 9, where weare not using 1, 3, 6 and 10 because they are of type series1.'''pass# --------------------------------------------------------------# The Testing# --------------------------------------------------------------class myTests(unittest.TestCase):def test1(self):ans = g11_3(1)self.assertEqual(ans, 0)def test2(self):ans = g11_3(2)self.assertEqual(ans, 2)def test3(self):ans = g11_3(10)self.assertEqual(ans, 35)def test4(self):ans = g11_3(100)self.assertEqual(ans, 4595)def test5(self):ans = g11_3(1000)self.assertEqual(ans, 485320)if __name__…
*C Programming This exercise is to help you learn how to debug compiler warnings/errors and other common errors in your code. For each part labeled P(n), there is a warning/error/problem that goes with it. Write down what the issue was in the `Error:` section of each problem. Work on `segfault.c` along with your fixes and error comments. segfault.c file // P0#include <stdio.h>#include <stdlib.h>/* Error: */ void fib(int* A, int n); intmain(int argc, char *argv[]) {int buf[10];unsigned int i;char *str;char *printThisOne;char *word;int *integers;int foo;int *bar;char *someText; // P1for (i = 0; i <= 10; ++i) { buf[i] = i;}for (i = 0; i <= 10; ++i) { printf("Index %s = %s\n", i, buf[i]);}/* Error: */ // P2str = malloc(sizeof(char) * 10);strcpy(str, "Something is wrong");printf("%s\n", printThisOne);/* Error: */ // P3word = "Part 3";*(word + 4) = '-';printf("%s\n", word);/* Error: */ // P4*(integers + 10) = 10;printf("Part 4: %d\n", *(integers +…
Pls help ASAP. Language is C#
2. count_fred_and_ted Given a list of strings called names , count up how many of those names are either "fred" or "ted", and return the count. Sample calls should look like: >>> count_fred_and_ted(["sarah", "bimmy", "fred", "eliza", "ted", "ted"]) 3 >> count_fred_and_ted(["sarah", "bimmy", "bimmy", "bimmy", "bimmy"]) >>> count_fred_and_ted(["fred", "ted", "fred", "ted"]) 4 >>> count_fred_and_ted([])
1. Divisors: In a class Divisors.java, read in a maximum integer n and use nested loops to print a list of divisors for each of 1 through n as shown in the following transcript. Sample transcript (input underlined): Largest integer? 100 1: 1 2: 1 2 3: 1 3 4: 1 2 4 95: 1 5 19 95 96: 1 2 3 4 6 8 12 16 24 32 48 96 97: 1 97 98: 1 2 7 14 49 98 99: 1 3 9 11 33 99 100: 1 2 4 5 10 20 25 50 100
The top three most popular male names of 2017 are Oliver, Declan, and Henry, according to babynames.com. Write a program that modifies the male_names set by removing a name and adding a different name. Sample output with inputs: 'Oliver' 'Atlas' { 'Atlas', 'Declan', 'Henry' } NOTE: Because sets are unordered, the order in which the names in male_names appear may differ from above. Code writing challenge activity demo 461710.3116374.qx3zqy7 1 male_names 2 name_to_remove = input() 3 name_to_add=input() 4 = 11 { 'Oliver', 'Declan', 'Henry' } 5 6 7 print (male_names) Your solution goes here '''
Regex, APIs, BeautifulSoup: python import requests, refrom pprint import pprintfrom bs4 import BeautifulSoup complete the missing bodies of the functions below: def mathmatic(target):"""Question 1You are doing fun math problems. Given a string of combination of '{}', '[]','()', you are required to return the substring included by the outermost '{}'.You need to write your code in one line.Args:target (str): the string to search inReturns:str>>> mathmatic('{[[[[]()]]]}')'[[[[]()]]]'>>> mathmatic('[(){([{}])}]')'([{}])'"""pass test code: # print(mathmatic('{[[[[]()]]]}'))# print(mathmatic('[(){([{}])}]'))
In pythonWrite a function called compter_les_votes that accepts a list of ballots as input (of arbitrary length) and produces a report as a dictionary. The ballots have the form of a couple (valid, condidat) where candidate is the name of one of the candidates in the election, and valid is a boolean that indicates whether or not the ballot is valid. For example, for the following list of bulletins: [(True, 'Pierre'), (False, 'Jean'), (True, 'Pierre'), (True, 'Jacques')]Your function must return the following dictionary: { "number of ballots": 4, "invalid ballots": 1, "results": { "Stone": 2, "Jacques": 1 }}Note that you do not have to display the dictionary, only return it.