Question

1.

program to use with number 1.

2.

Comparing Python and Java Discussion Forum 14 days ago Use the Python IDLE editor to create the source code for the "numberguess.py" pro- gram. This program is in the "Basic Python Pro- gramming" chapter in its "An Example Python Program: Guessing a Number" section. If you mistakenly create syntax errors, find and fix them. Run the program and test it with various values. Refer to the "numberguess.py Program document to see example output. Describe the number guessing strategy you used to guess the program's secret number in as few guesses as possi- ble. Research the "binary search algorithm" and compare it to your guessing strategy. Look over the program to find differences between Python and Java. Describe some of the differences you find. Are they major or minor differences? Evaluate some of the differences you find. Which do you prefer and why? numberguess.py Program The "mumberguess py' program in the Python IDLE editor t numberqueoy CFtes GhMOGMC CI21amplesumberguesspy .4.33 F t Fome u Wn H ushe P e he er wish he e t npes eand et sass e d et the sg ot rs ae s ge te er a put er e e ay n c taller, age cout a qu your gue st ueuge a pes o got it i, count,e The next page shows example output Eample outout Python 3.43 Shell Tre "oregh eredst er "im for more anformenson ESTART ter the aier rs Esser your que Tee arge ma tsse you quea a Data Structures Primary Be- haviors Discussion Forum 15 days ago As defined in the textbook slides: "A data structure is a set of data objects that are organized in some way. "A collection is a container for zero or more data objects. "An abstract data type (ADT) separates the user or client of a data structure from the implementer or server "An ADT provides an interface or public set of abstract operations for accessing the ob- jects in the data structure. We see that data structures, collections, and abstract data types are closely related concepts. Objects that are contained within these en- tities are typically called items or elements. From the object-oriented perspective, data structures have both private data and public behaviors. The behaviors define data structures in an abstract, implementation independent man- ner Other equivalent terms used for behaviors are operations, methods, public interface, and usage interface. In this discussion, we explore the primary behaviors needed to use data structures Some of these behaviors include: Determine its size (number of items) Test for item membership (presence or absence of an item) -Traverse through all its items -Get an item -Insert an item -Remove an item Replace an item Discuss these behaviors You don't have to address them all Select one or more that interest you What do they do? Are they needed or simply convenient? How are they the same across different types of data structures? How do they vary across different types of data structures? Do they have any efficiency issues? You could give a real-world example for one of the behaviors You could give a visual depiction of one of the behaviors. You could discuss other primary behaviors not listed here. ww Author: Ken Lambert Plays a game of guess the number with the user. import random def main (): "wwInputs the bounds of the range of numbers, and lets the user guess the computer's number until the guess is correct."" Smaller int (input ("Enter the smaller number: ")) larger int (input ("Enter the larger number: ")) myNumber random. randint (smaller, larger) count 0 while True: count +1 userNumber int (input ("Enter if userNumber myNumber: print ("Too large ") ")) your guess: else: print ("You've got it in", count, "tries! ") break if main ( name main he next page shows example output RE >>> >>> Enter the smaller number: 1 Enter the larger number: 100 Enter your guess: 50 Too small Enter your guess: 75 Too large Enter your gue ss: 60 Too small Enter your guess: 65 Too small Enter your guess: 70 Too large Enter your guess: 67 Too small Enter your quess: 68 You've got it in 7 tries!

Answer 1

a.py C/Users/delll/a.py (3.6.2) File Edit Format Run Options Window Help import random def main ( smaller-int (input ("Enter the smaller nummber") ) larger int (input ("enter the larger number")) myNumber-random.randint (smaller, larger) count 0 while True: count+-1 userNumber=int (input ("Enter your guess: ")) if userNumber<=myNumber print ("Too small") elif userNumber>myNumber print ("Too large") else: print ("You've got it in ",count,"tries !") break if main name main LIn: 18 Col 10 7:49 AM alll 07-Jun-19

Python 3.6.2 Shell File Edit Shell Debug Options Window Help Python 3.6.2 (v3.6.2:5 fd3 3b5, Jul Type "copyright", "credits" or "license ()" for more information 8 2017, 04:14:34) [MSC v.1900 32 bit (Intel) ]on win32 >>> ======== RESTART: C:/Users/delll/a.py == ===== Enter the smaller nummberl enter the larger number100 Enter your guess: 50 Too small Enter your guess: 75 Too small Enter your guess: 60 Too smal1 Enter your guess: 65 Too small Enter your guess: 70 Too small Enter your guess: 67 Too small Enter your guess: 68 Too small Enter your guess: 100 Too small Enter your guess: 50 Too small Enter your guess: 63 Too small Enter your guess: || Ln: 27 Col: 1 7:45 AM 07-Jun-19

source code given in  numberguess.py uses a logic that is completely based on random numbers.

it is not possible to describe the strategy of source code of numberguess.py.

code given below is based on the following strategy

1)it is based on binary search

2)It has a list of integers in ascending order

3)minimun value is 4 and maximum value is 18

4.if user input is less than 6, number will be small.

5. if user input is greater than 10 number is Large

6. if user input is not present in the list of integers, then guess is too far away from the expectation.

b.py-C:/Users/delll/b.py (3.6.2) File Edit Format Run Options Window Help def bin_Search (list2, item) : first= 0 last len (list2) -1 found False while first<=last and not found: mid point = (first + last)//2 if list2 [mid point] == item: found True else: if item < list2 [mid_point] mid_point-1 last= else: first mid point+1 return found list1-[4,5,6, 7,8,9,10,11,12,16, 18] ans-y while ans=='y': num-int (input ("Enter number in a range 4 to 18")) if bin Search (list1, num): if num 10: print ("Too Large") ans'y elif num6 print ("Too Small") ans'y else: print ("Your guess is corect") ansn else: print ("Your guess is too far away from the expectation") ans-'y Ln: 1 Col: 28 8:40 AM al 07-Jun-19

Python 3.6.2 Shell File Edit Shell Debug Options Window Help 8 2017, 04:14:34) [MSC v.1900 32 bit (Intel) ]on win32 Python 3.6.2 (v3.6.2:5 fd3 3b5, Jul Type "copyright", "credits" or "license " for more information >>> ====== RESTART: C:/Users/delll/b.py == Enter number in a range 4 to 1817 Your guess is too far away from the expectation Enter number in a range 4 to 1816 Too Large Enter number in a range 4 to 1815 Your guess is too far away from the expectation Enter number in a range 4 to 1814 Your guess is too far away from the expectation Enter number in a range 4 to 1813 Your guess is too far away from the expectation Enter number in a range 4 to 1812 TOo Large Enter number in a range 4 to 1811 Too Large Enter number in a range 4 to 1810 Your guess is corect > Ln: 21 Col: 4 8:31 AM lll 07-Jun-19
code given below uses following strategy

1)It uses exception handling

2)user input less than 10 is small

3)user input greater than 10 is large

4 only user input 10 is correct

c.py-C:/Users/delll/c.py (3.6.2) File Edit Format Run Options Window Help class ValueToo Small (Exception) (self,arg) : def init self.args-arg class ValueTooLarge (Exception) init self.args arg (self, arg) def number 10 while True: try: i num = int (input ("Enter a number: ")) if i num < number raise Value Too Small ("Too small") elif i num > number: raise ValueTooLarge|("Too large") break except Value Too Small as e for i in e.args print (i,end-"") print ("\n") except Value TooLarge as e for i in e.args print (i,end="") print ("\n") print ("Congratulations! You guess is correct.") Ln: 14 Cot 30 8:46 AM illf 07-Jun-19

Python 3.6.2 Shell File Edit Shell Debug Options Window Help 8 2017, 04:14:34) [MSC v.1900 32 bit (Intel) ]on win32 Python 3.6.2 (v3.6.2:5fd33b5, Jul Type "copyright", "credits" or "license ()" for more information >>> ==== RESTART: C:/Users/dell1/c.py == Enter a number: 2 Too smal1 Enter a number: 23 Too large Enter a number: 12 Too large Enter a number: 9 Too smal1 Enter a number 10 Congratulations! You guess is correct > || Ln: 19 Col: 4 &:46 AM all 07-Jun-19

Python vs java

1)python code is simple, java code is difficult

2)python code is small(compact), java code is large.

d.py -C:/Users/delll/d.py (3.6.2) File Edit Format Run Options Window Help listl-[1,3,6,2,7,5,8,9,3,5] #size print ("Size of list is ",len (list1)) num int (input ("enter number to search")) #check presence if num in list1: print ("found") else: print ("Not found") #traversal for x in list1: print (x, end=" ") print #get an item print (list1 [0] #insert an item listl.insert (0,100) print (list1) #remove an item list1.pop ) print (listl) #replace list1[0] 500 print (list1) Ln: 1 Col: 12 9:02 AM al 07-Jun-19

Python 3.6.2 Shell File Edit Shell Debug Options Window Help Close 8 2017, 04:14:34) [MSC v.1900 32 bit (Intel) ]on win32 Python 3.6.2 (v3.6.2:5fd33b5, Jul Type "copyright", "credits" or "license ()" for more information >>> ==== RESTART: C:/Users/dell1/d.py ====== = Size of list is enter number to search2 found 1 3 6 2 7 5 893 5 10 1 100, 1, 3, 6, 2, [100, 1, 3, 6, 2, 7, 5, 8, 9, 3] [500, 1, 3, 6, 2, 7, 5, 8, 9, 3] >>> 8, 9, 3, 5 7, 5, ====== RESTART: C:/Users/dell1/d.py ======= ==== size of list is 10 enter number to search5 found 1 3 6 2 7 5 8 9 3 5 1 7, 5, 8, 9, 3, 51 100, 1, 3, 6, 2, [100, 1, 3, б, 2, 7, 5, 8, 500, 1, 3, 6, 2, 7, 5, 8, > | 9, 31 9, 3] Ln: 23 Col: 4 9:02 AM lll 07-Jun-19

simirarily
all the above behavior are required in all datastructures
because there is a need to search item/delete item/mofify item/traverse and so on.
these operations are required in every data structure

difference
there are two types of data structures
1)linear
2)non linear

there is more complexity to perform above operation in case of non linear data structure such as tree graph .