Write a function called word_length() that does not take any input parameter and returns a 2-D list of length 10. This function repeatedly asks the user to enter words until they enter the word "stop". Every unique word of length k, where 0 ≤ k ≤ 9, that the user enters should be stored in the k'th element of the 2-D list. Words that have a length greater than 9 will be ignored. Sample run: >>> the_list = user_words() Enter a string, enter 'stop!' to quit: a Enter a string, enter 'stop!' to quit: $ Enter a string, enter 'stop!' to quit: a Enter a string, enter 'stop!' to quit: bbbb Enter a string, enter 'stop!' to quit: ccc Enter a string, enter 'stop!' to quit: dd Enter a string, enter 'stop!' to quit: zzzzzzzzz Enter a string, enter 'stop!' to quit: dd Enter a string, enter 'stop!' to quit: efghi Enter a string, enter 'stop!' to quit: abcdefghijk Enter a string, enter 'stop!' to quit: $e#%^ Enter a string, enter 'stop!' to quit: ******* Enter a string, enter 'stop!' to quit: Enter a string, enter 'stop!' to quit: bbbb Enter a string, enter 'stop!' to quit: stop! >>> print(the_list) [[''], ['a', '$'], ['dd'], ['ccc'], ['bbbb'], ['efghi', '$e#%^'], [], ['*******'], [], ['zzzzzzzzz']] Note, both ‘a’ and ‘dd’ have been entered twice, only one copy of each is stored. The input ‘abcdefghijk’ has more than 10 characters so it was not stored. Other than this, the_list[0] contains a string (‘’) of length 0 the_list[1] contains all strings ('a', '$') of length 1 the_list[2] contains all strings ('dd') of length 2 and so on.

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
icon
Related questions
Question

Write a function called word_length() that does not take any input parameter and returns
a 2-D list of length 10. This function repeatedly asks the user to enter words until they enter
the word "stop". Every unique word of length k, where 0 ≤ k ≤ 9, that the user enters should
be stored in the k'th element of the 2-D list. Words that have a length greater than 9 will be
ignored.
Sample run:
>>> the_list = user_words()
Enter a string, enter 'stop!' to quit: a
Enter a string, enter 'stop!' to quit: $
Enter a string, enter 'stop!' to quit: a
Enter a string, enter 'stop!' to quit: bbbb
Enter a string, enter 'stop!' to quit: ccc
Enter a string, enter 'stop!' to quit: dd
Enter a string, enter 'stop!' to quit: zzzzzzzzz
Enter a string, enter 'stop!' to quit: dd
Enter a string, enter 'stop!' to quit: efghi
Enter a string, enter 'stop!' to quit: abcdefghijk
Enter a string, enter 'stop!' to quit: $e#%^
Enter a string, enter 'stop!' to quit: *******
Enter a string, enter 'stop!' to quit:
Enter a string, enter 'stop!' to quit: bbbb
Enter a string, enter 'stop!' to quit: stop!
>>> print(the_list)
[[''], ['a', '$'], ['dd'], ['ccc'], ['bbbb'], ['efghi', '$e#%^'],
[], ['*******'], [], ['zzzzzzzzz']]
Note, both ‘a’ and ‘dd’ have been entered twice, only one copy of each is stored. The
input ‘abcdefghijk’ has more than 10 characters so it was not stored. Other than this,
the_list[0] contains a string (‘’) of length 0
the_list[1] contains all strings ('a', '$') of length 1
the_list[2] contains all strings ('dd') of length 2 and so on.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education