*** (2) Below the tree (with two blank lines), output this cat. ^ ^ Hint: A backslash \ in a string acts as an escape character, such as with a newline \n. So, to print an actual backs by prepending another backslash. Ex: The following prints a single backslash: print('\\') 454192.2153518.qx3zqy7 LAB ACTIVITY 1.21.1: LAB*: Program: ASCII art 1 # Draw tree 2 print('*') 3 print ( ***** 4 print(' ******) 5 print (*********) 6 print (****) 7 8 print('\n / /\') 9 print('\n 00¹) 10 print("\n -') 11 print("\n main.py

*** (2) Below the tree (with two blank lines), output this cat. ^ ^ Hint: A backslash \ in a string acts as an escape character, such as with a newline \n. So, to print an actual backs by prepending another backslash. Ex: The following prints a single backslash: print('\\') 454192.2153518.qx3zqy7 LAB ACTIVITY 1.21.1: LAB: Program: ASCII art 1 # Draw tree 2 print('') 3 print ( * 4 print(' ) 5 print (***) 6 print () 7 8 print('\n / /\') 9 print('\n 00¹) 10 print("\n -') 11 print("\n main.py

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

Sorting Words with a TreeSet: Write a program that uses a String method split to tokenize a line of text input by the user and places each token in a TreeSet. Print the elements of the TreeSet.
Thank you! but for nextTweet and removeTweet. can u rewrite base on the specs: public String nextTweet() Returns the next tweet from the tweet list. If all the tweets in the list are exhausted, cycle around to the start of the list. For example, the following code snippet should produce the output in the comments. Suppose that tweets stores a list of Tweets ["A tweet about something controversial", "Remember to vote!", "Look at this meme :O"]. TweetBotbot=newTweetBot(tweets); System.out.println(bot.nextTweet()); // A tweet about something controversial System.out.println(bot.nextTweet()); // Remember to vote! System.out.println(bot.nextTweet()); // Look at this meme :O System.out.println(bot.nextTweet()); // A tweet about something controversial Think about how to get the next tweet from the list of tweets, and how you can cycle around to the start once you've gone through all the tweets! One Special Case! As you're working on your TweetBot and testing your implementation,…
Write a method that returns a sorted string using thefollowing header:public static String sort(String s)For example, sort("acb") returns abc.Write a test program that prompts the user to enter a string and displays the sortedstring.
1 # Given an encoded string, return it's decoded string. 234 5 6 18 7 8 9 10 # Furthermore, you may assume that the original data does not contain any 11 #digits and that digits are only for those repeat numbers, k. 12 # For example, there won't be input like 3a or 2[4]. 13 14 15 16 #s="3[a]2[bc]", return "aaabcbc". 17 # S = "3[a2[c]]", return "accaccacc". 19 20 21 22 23 24 25 26 27 28 18 #s="2[abc]3[cd]ef", return "abcabccdcdcdef". 29 30 31 32 # The encoding rule is: k[encoded_string], where the encoded_string # inside the square brackets is being repeated exactly k times. # Note that k is guaranteed to be a positive integer. 33 34 35 36 # You may assume that the input string is always valid; No extra white spaces, # square brackets are well-formed, etc.. 37 20 # Examples: def decode_string(s): www :type s: str :rtype: str stack = []; cur_num= 0; cur_string for c in s: if c == '[': stack.append((cur_string, cur_num)) cur_string cur_num = 0 elif c == '1': prev_string, num = stack.pop()…
True/False 7. The split method breaks a string into a list of substrings, and j oin does the opposite.
Use for loop in Java language Write the method stringSplosion().* * The method takes one parameter, a non-empty String str (such as "Code") and* returns a String in the form "CCoCodCode". Notice that this includes the* first character of the original String, followed by the first two characters,* and so on until the whole String is used.* * Examples: stringSplosion("Code") returns "CCoCodCode" stringSplosion("abc")* returns "aababc" stringSplosion("x") returns "x"* * @param str the input String to process.* @return a new String as described above.
def while_loops(string1: str, string2: str) -> str:""" Given two strings <string1> and <string2>, return a new string that contains letters from these two strings "interwoven" together, starting with the first character of <string1>. If the two strings are not of equal length, then start looping "backward-and-forwards" in the shorter string until you come to the end of the longer string. We ask that you use while loops and keep them simple and precise.>>> while_loops("abcde","12")'a1b2c1d2e1'>>> while_loops("ab","123")'a1b2a3'>>> while_loops("abcdfe","123")'a1b2c3d2f1e2'>>> while_loops("c","ab")'cacb'""" don't use any reverse or any other def do in on def while_loop, prove these doctests and write the code in python and don't add any import or any dictionaries or dictionary methods or any try-except statements
1. Let L = {w {a, b}* : w contains bba as a substring that starts in an odd numbered position in the string (where numbering starts at 1)}. For example, bbbbaaaab L, while bbbaaaab L. Show an NDFSM that accepts L
Counting hashtags Write Python code to count the frequency of hashtags in a twitter feed. Your code assumes a twitter feed variable tweets exists, which is a list of strings containing tweets. Each element of this list is a single tweet, stored as a string. For example, tweets may look like: tweets = ["Happy #IlliniFriday!", "It is a pretty campus, isn't it, #illini?", "Diving into the last weekend of winter break like... #ILLINI #JoinTheFight", "Are you wearing your Orange and Blue today, #Illini Nation?"] Your code should produce a sorted list of tuples stored in hashtag_counts, where each tuple looks like (hashtag, count), hashtag is a string and count is an integer. The list should be sorted by count in descending order, and if there are hashtags with identical counts, these should be sorted alphabetically, in ascending order, by hashtag. From the above example, our unsorted hashtag_counts might look like: [('#illini', 2), ('#jointhefight', 1),…
def while_loops(string1: str, string2: str) -> str:""" Given two strings <string1> and <string2>, return a new string that contains letters from these two strings "interwoven" together, starting with the first character of <string1>. If the two strings are not of equal length, then start looping "backward-and-forwards" in the shorter string until you come to the end of the longer string.we ask that you used while loops and keep them simple and precise.>>> while_loops("abcde","12")'a1b2c1d2e1'>>> while_loops("ab","123")'a1b2a3'>>> while_loops("abcdfe","123")'a1b2c3d2f1e2'>>> while_loops("c","ab")'cacb'""" prove these doctests and write the code in python and don't add any import or any dictionaries or dictionary methods or any try-except statements
def loopy_madness(string1: str, string2: str) -> str: """ Given two strings <string1> and <string2>, return a new string that contains letters from these two strings "interwoven" together, starting with the first character of <string1>. If the two strings are not of equal length, then start looping "backwards-and-forwards" in the shorter string until you come to the end of the longer string. "interwoven" (or "interweaving") means constructing a new string by taking the first letter from the first string, adding the first letter of the second string, adding the second letter of the first string, adding the second letter of the second string, and so on. "backwards-and-forwards" is a custom looping term. First the loop starts at position 1 (index 0) and goes until position n (i.e., the end). Once the loop reaches position n, it goes backwards, starting at position n - 1 and goes to position 1 (index 0). This repeats until…
Artificial Intelligence- Java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.