Question

Task 2: SecretWord class:

Download and save a copy of LinkedLists.py (found at the bottom of this assignment page on eClass). In this file, you have been given the complete code for a LinkedList class. Familiarize yourself with this class, noticing that it uses the Node class from Task 1 and is almost identical to the SLinkedList class given in the lectures. However, it also has a complete insert(pos, item) method (which should be similar to the insert method you implemented in Lab 7) and a getHead() method (which is just a getter for the self.__head attribute). In this same file, you should also find the skeleton code for a SecretWord class. An instance of the SecretWord class represents the randomly chosen word that is being guessed in the Guess the Word game. The SecretWord class contains the private attribute self.__wordLinkedList, which is an instance of the LinkedList class (described above). It also has a private attribute self.__numVisible, which is the number of letters correctly guessed in the word. For example, if the secret word is "YELLOW" and only the letter "L" has been correctly guessed, then self.__numVisible would be 2.

Complete the SecretWord class according to the ADT described below:

 setWord(word) – adds the uppercase letters in the input word to self.__wordLinkedList, so that each node contains one uppercase letter, and the order of the nodes matches the order of the letters in the word. i.e. the head node of self.__wordLinkedList should contain the first letter in the word. Nothing is returned.

 isSolved() – returns True if all of the letters in the secret word have been guessed by the player. Otherwise, returns False.

 update(guess) – updates the isVisible attribute of any node(s) containing data that matches the input guess, so that the letter will be displayed the next time the word is printed to the screen. Returns True if at least one node was updated, False otherwise.

 printProgress() – prints the current status of the secret word. For example, if the secret word is "YELLOW" and only the letter "O" has been correctly guessed, then this method prints "_ _ _ _ O _ ".

 __str__() – creates and returns a string to represent the SecretWord object. This method has been completed for you. You may create additional methods to help you complete the methods above, and add private attributes if needed. The additional methods can be called within the SecretWord class, but NOT outside of it. Only the given methods form the public interface, exactly as presented above. Test your SecretWord class thoroughly before moving on, and be sure to leave those tests under if __name__=='__main__': for the markers to see.

class Node: def __init__(self, initData, initNext, initVisible = False): Constructs a new node and initializes it to contain the given object (initData) and link to the given next node. """ self.__data = initData self.__next = initNext self.__isVisible = initVisible def getData(self): " Returns the element " return self.__data def getNext(self): Returns the next node""" return self.__next 11 11 11 def getIsVisible(self): "" Returns whether or not self.__data should be displayed return self.__isVisible II III def setData(self, newData): IT Sets newData as the element self.__data = newData II II II def setNext(self, newNext): Sets newNext as the next node""" self.__next = newNext 111111 def setIsVisible(self, visible): """ Sets whether or not self.__data should be displayed in the WordGuess progress self.__isVisible = visible 11 11 11
    

    

Answer 1

 class SecretWord: def __init__(self): self.__wordLinkedList = LinkedList() self.__numVisible = 0 def setWord(self, word): letters = list(word.upper()) for letter in letters: if(self.__wordLinkedList.isEmpty()): self.__wordLinkedList.add(letter) else: self.__wordLinkedList.append(letter) def isSolved(self): current = self.__wordLinkedList.getHead() solved = True while current != None and solved: if(not current.getVisible()): solved = False else: current = current.getNext() return solved def update(self, guess): current = self.__wordLinkedList.getHead() updated = False while current != None: if(current.getData()==guess.upper()): current.setVisible() updated = True return updated def printProgress(self): current = self.__wordLinkedList.getHead() status = '' while current != None: if(current.getVisible()): status += str(current.getData()) else: status += '_' print(status)

Note: Implementation details of "Node" class is not given hence the following two implementations of required methods are assumed for "isVisible" attribute of "Node" class. The Variable "isVisible" is assumed to have binary value only.

1. Node().getVisible() : It return the current value of "isVisible" attribute of instance Node().

2. Node().setVisible() : It sets "isVisible" attribute of instance Node() to True value.