1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
spin [16.1K]
3 years ago
10

Complete this assignment in Python 3.x. Make sure you have downloaded the software, and it is installed correctly.

Computers and Technology
1 answer:
Masja [62]3 years ago
6 0

Answer:

The program code is completed below

Explanation:

Program Code:

"""

  Your Name

  Course Name, Section (example: ENTD200 B002 Spr15)

  Instructor name

  Week #

  Date completed

"""

months = ["January ", "February", "March", "April", "May", "June", "July"

, "August", "September", "October", "November", "December"]

for i in range(0,12):

print("Month",i+1, "is" , months[i])

You might be interested in
Select the correct answer from each drop-down menu. A company is recruiting for a web designer. What kind of candidate should th
prisoha [69]

Answer:a

Explanation:

8 0
3 years ago
Read 2 more answers
Please help it's on scratch coding !
NeTakaya

True, you can because in Scratch, you actually can use an if statement block and use an if touching another sprite.

5 0
2 years ago
Read 2 more answers
_____ are likely to support bigger government, social welfare programs, and legalized abortion.
Amanda [17]
Democrats are likely to support bigger government, social welfare programs, and legalized abortion.
8 0
3 years ago
Read 2 more answers
a) (20 points) Define the method inDogish recursively such that it returns true if the word is in dog-ish and false if it is not
tia_tia [17]

Answer:

/ Main.java

class Main {

     public static void main(String[] args) {

           //System.out.println(inDogish("aplderogad"));

           //System.out.println(inXish("aplderogad", "dog"));

     }

     // returns true if the word is in dog-ish

     // returns false if word is not in dog-ish

     public static boolean inDogish(String word) {

           /**

           * Note: we can use the inXish() method to complete this method in a

           * single line if you want. just write 'return inXish(word,"dog");' and

           * you are done.

           */

           // if word is null or empty, returning false

           if (word == null || word.length() == 0) {

                 return false;

           }

           // converting word to lower case

           word = word.toLowerCase();

           // if 'd' does not exist on the word, returning false

           if (!dogishHelper(word, 'd')) {

                 return false;

           }

           // removing the characters upto first 'd' in word

           word = word.substring(word.indexOf('d') + 1);

           // if 'o' does not exist on the word, returning false

           if (!dogishHelper(word, 'o')) {

                 return false;

           }

           // removing the characters upto first 'o' in word

           word = word.substring(word.indexOf('o') + 1);

           // if 'g' does not exist on the word, returning false, otherwise

           // returning true

           if (!dogishHelper(word, 'g')) {

                 return false;

           } else {

                 return true;

           }

     }

     // necessary to implement inDogish recursively.

     // returns true if letter is in word, else not.

     public static boolean dogishHelper(String word, char letter) {

           // if word is empty, returning -1

           if (word == null || word.length() == 0) {

                 return false;

           }

           // if first character in word is letter, returning 0

           if (word.charAt(0) == letter) {

                 return true;

           }

           return dogishHelper(word.substring(1), letter);

     }

     // the best thing about the above helper method is that we can use it in

     // inXish method also

     // a generalized version of the inDogish method

     public static boolean inXish(String word, String x) {

           // if x is empty, returning true (base case, which means all the letters

           // in x are in word in that order)

           if (x.length() == 0) {

                 return true;

           }

           // getting first character of x

           char first = x.charAt(0);

           // if first character does not exist on the word, returning false

           if (!dogishHelper(word, first)) {

                 return false;

           }

           // calling and returning inXish recursively, passing the word after

           // removing characters upto first occurrance of char first, and x after

           // removing first character from it

           return inXish(word.substring(word.indexOf(first) + 1), x.substring(1));

     }

}

Explanation:

7 0
4 years ago
How to insert header and page number in word 2016?
AleksAgata [21]
Insert - Header - choose header of your choice. Page numbers are below the Header icon

3 0
3 years ago
Other questions:
  • 1.an electronic index of books A. web page
    12·1 answer
  • What are some cloud storage devices?​
    10·1 answer
  • Why is fluency in information technology becoming increasingly important for many college majors?
    9·2 answers
  • What is a piece of information sent to a function
    15·1 answer
  • If you decide you want to meet someone you met online, what should you do first? A. Tell your best friend. B. Call the person yo
    12·1 answer
  • In this program we are going to practice using the Math class by computing some important values on the unit circle. Using the a
    5·1 answer
  • Is EXE is the extension of MS Excel file.<br> subject: ICT for GR 5
    10·1 answer
  • PLEASE HELP ME !!!!
    15·1 answer
  • Viết thuật toán và chương trình: Tính tổng:<br> S=1+2+...i
    8·1 answer
  • When investigating the serial position curve, delaying the memory test for 30 seconds
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!