I need help I don’t know wats wrong trpentin x| SerpentineAptCosmosProgram x E New tab x Celebrity xE New tab XOHumy x> RunBETAmain.py ×print("list of pets")pets=['dog', cat', 'elephant', 'bird', 'ferret']pets.sort(reverse=True)for i in range (len (pets)) :print (it1,pets[il)print()print("-"*50)Console ShellFile "main.py", line 5print (i+1,pets[i])IndentationErIOI: expected an indented block7.8.count=0Pyfor pet in pets:10count=count+1;pet=input ("Enter a pet type(nothing to stop):")while pet!="":pets.append(pet)pet=input("Enter a pet type(nothing to stop) :") if pet=="":1112131415breakpets.sort()for pet in pets:print(pet)print("There are", len(pets), "pets in the list. “)1617181920749 Sunny56

Task : Given the python. The task is to correct the given code and find its output.

Run main.py print("list of pets") pets=['dog', cat', 'elephant', 'bird', 'ferret'] pets.sort(reverse=True) for i in range (len (pets)) : print (i+1,pets[i]) print() print("-"*50) 2. Console S File "m print Indentati >0 8. count=0 for pet in pets: count=count+1; pet=input("Enter a pet type(nothing to stop):") while pet!="": pets.append(pet) pet=input("Enter a pet type(nothing to stop) :") if pet=-"": break 6. 10 11 12 13 14 15 pets.sort() for pet in pets: print(pet) print("There are", len(pets), "pets in the list. ") 16 17 18 19 20

Run main.py print("list of pets") pets=['dog', cat', 'elephant', 'bird', 'ferret'] pets.sort(reverse=True) for i in range (len (pets)) : print (i+1,pets[i]) print() print("-"*50) 2. Console S File "m print Indentati >0 8. count=0 for pet in pets: count=count+1; pet=input("Enter a pet type(nothing to stop):") while pet!="": pets.append(pet) pet=input("Enter a pet type(nothing to stop) :") if pet=-"": break 6. 10 11 12 13 14 15 pets.sort() for pet in pets: print(pet) print("There are", len(pets), "pets in the list. ") 16 17 18 19 20

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

Fix an error and show it please?
Course: Data Structurre and algorithms Language: Java Make a Program in java. Read the properly its easy but explained in theory. You have to solve ( make program ) the question by properly as you can error and ommisions will be accepted please. Kindly make it unque dont copy paste. <You have to solve this question as you can kindly dont excusses> Implement a global function“CompareNumbers”which is passed twoSlinkedListobjects as parametersnamed list1, and list2. The function will compare both the numbers corresponding to the lists and will return 0 if both the numbers are equal, return 1 if number corresponding to list1 is greater and will return 2 if number corresponding to list2 is greater. For this task you have to choose an appropriate data structure that will help you do this task in the most efficient manner with regard to time and space complexity.You are allowed to reverse the linked lists for this task. intCompareNumbers(SlinkedList list1, SlinkedList list2)
def strPattern(mystr):lenght = len(mystr)mystr1 = ""for i in range(lenght - 1):mystr1 = mystr1 + mystr[i].upper() + str(i + 1)if lenght == 0:return mystr1return mystr1 + mystr[-1].upper()s = input("enter a word: ")print(strPattern(s)) s = input("enter a word: ") EOFError: EOF when reading a line HOW CAN I FIX THIS QUESTION?
The function that will a single items to the list is Oextend (...) Oadd(...) Oappend(...) Olengthen(...)
Problem Attached
Repost Please help me explain the whole program step by step such as explain all the functions, the element, the operation, all the struct functions and so on. The coding: #include<iostream>#include<iomanip>#include<ctype.h>#include<string.h>using namespace std; struct nodeWords{ char words[100]; struct nodeWords* next;};struct undoWords{ char unwords[100]; struct undoWords* next;};undoWords* untop;undoWords* newundoNode; nodeWords* top; //these pointers are used to hold the linked list.nodeWords* current; //use for traversalnodeWords* newNode; //use to create new node for new recordnodeWords* pop; void Push() //push an element into the stack{ char answer; do { newNode = new nodeWords; cout << "\nWrite what's in your mind.." << endl; cout << "Your words > "; cin >> ws; cin.getline(newNode->words, 100); newNode->next = top; top = newNode; cout…
from typing import List, Tuple, Dict from poetry_constants import (POEM_LINE, POEM, PHONEMES, PRONUNCIATION_DICT, POETRY_FORM_DESCRIPTION) # ===================== Provided Helper Functions ===================== def transform_string(s: str) -> str: """Return a new string based on s in which all letters have been converted to uppercase and punctuation characters have been stripped from both ends. Inner punctuation is left untouched. >>> transform_string('Birthday!!!') 'BIRTHDAY' >>> transform_string('"Quoted?"') 'QUOTED' >>> transform_string('To be? Or not to be?') 'TO BE? OR NOT TO BE' """ punctuation = """!"'`@$%^&_-+={}|\\/,;:.-?)([]<>*#\n\t\r""" result = s.upper().strip(punctuation) return result def is_vowel_phoneme(phoneme: str) -> bool: """Return True if and only if phoneme is a vowel phoneme. That is, whether phoneme ends in a 0, 1, or 2. Precondition:…
Programming language is latest version of python
def cartesianproduct(lst): """Takes a list of sets/frozensets and computes their Cartesian product""" cartesianproduct: This function should accept a list of one or more sets or frozensets (you can convert between them using set(fro_st) and frozenset(st)). Its output is a set or frozenset encoding the cartesian product; thus a list of two sets [{0,1}, {1,2}] could give back {(0,1),(0,2),(1,1),(1,2)}. In general, an input list of length N will yield a set of tuples of length N each.
Alert dont submit AI generated answer.
In C++
def drop_uninformative_objects(X, y):# your code herereturn X_subset, y_subset # TEST drop_uninformative_objects functionA = pd.DataFrame(np.array([[0, 3, np.nan],[4, np.nan, np.nan],[np.nan, 6, 7],[np.nan, np.nan, np.nan],[5, 5, 5],[np.nan, 8, np.nan],]))b = pd.Series(np.arange(6))A_subset, b_subset = drop_uninformative_objects(A, b) assert A_subset.shape == (3, 3)assert b_subset.shape == (3,)