A band of thieves comes up with a series of rules for hiding their loot so that they are always able to find it. The rules are as follows: If the house is next to a lake, then the treasure does not go in the kitchen If the tree in the front yard is an elm, then the treasure is in the kitchen The tree in the front yard is an elm or the treasure is buried under the flagpole If the tree in the backyard is an oak then the treasure is in the garage. You observe that the house where the treasure is hidden is next to a lake. Where is the treasure? discrete math

cryptology

solve using paython language and take screenshot contains the code

3. A safe is locked by a combination of of four binary digits (that is, 0 or 1), but the owner has forgotten the combination. The safe is designed in such a way that no matter how many digits have been pressed, if the correct combination of three digits is pressed at any point, then the safe automatically opens (there is no "enter" key). Our goal is to find the minimum number of digits that one needs to key in in order to guarantee that the safe opens. In other words, we wish to find the smallest possible length of a binary sequence containing every four-digit sequence in it. (a) Create a digraph whose vertex set consists of three-digit binary sequences. From each vertex labelled ryz, there is one outgoing edge (labelled 0) leading to vertex yz0, and another outgoing edge (labelled 1) leading to vertex yz1. (b) Explain why every edge represents a four digit sequence and why an Eulerian tour of this graph represents the desired sequence of keystrokes. (c) Find the minimum number of…

Devon designs a computer algorithm that gives users a movie recommendation based on information entered into a viewer profile. Users are asked to rate the recommendation as either "good" or "bad." After testing the algorithm, Devon concludes that the algorithm offers good movie recommendations in 87% of all cases, with a 3% margin of error. Devon expects the algorithm to offer approximately 5,000 movie recommendations this month, and he wants to calculate the number of recommendations that are expected to be "good." What would the likely range of "good" recommendations be? A. 1,400 to 4,550 good recommendations B. 4,100 to 4,550 good recommendations C.4,200 to 4,500 good recommendations D. 4,285 to 4,459 good recommendations

A 0/1 knapsack can carry a maximum weight of 60. There are 4 items with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items you can carry using the knapsack?

Suppose you have a knapsack that can carry up to 17 pounds. You can only put certain items, and each item has a weight and a value. You want to put the items that will give you the highest possible value, but you can only carry up to 15 pounds. Here are the items you can put and their weights and values:         I Weight value Value/Weight 1 2 10 5 2 4 30 7.5 3 6 50 8.33 4 9 70 7.78 5 10 80 8         Table 1: Caption Your task is to solve the Knapsack Problem using a greedy approach.Hints:- Sort the items by their value-to-weight ratio in descending order. Start with the item with the highest value-to-weight ratio and add it to the knapsack. - Continue adding items to the knapsack in descending order of their value-to-weight ratio until the knapsack is full or there are no more items left. - Your solution should output the total value of the items in the knapsack and the list of items that you have put. -This…

Write a program using Python to solve the locker riddle which reads as follows: Imagine 100 lockers numbered 1 to 100 with 100 students lined up in front of those 100lockers:The first student opens every locker.The second student closes every 2nd locker.The 3rd student changes every 3rd locker; if it’s closed, she opens it; if it’s open, she closes it.The 4th student changes every fourth locker (e.g., 4th, 8th, etc.).The 5th student changes every 5th locker (e.g., 5th, 10th, etc.).That same pattern continues for all 100 students.  Which lockers are left open after all 100 students have walked the rowof lockers?

The game is played in the magic maze, as shown below. The squares are flaming lava pools. If you try to cross them you will die. The grid lines are passageways and are safe to travel in. You can start at any location on the grid but must travel in the passageways. You may travel as far as you want in any direction, but once you turn, you must repeat that distance and you may only make left turns.   You may not reverse direction inside the tight passageways. You must end up at the same spot you started at. If you successful, then you gain a magic coin, which automatically appears.  You can start over again and again in a different or same starting spot and earn new magic coins, but the routes you take must differ somehow for each magic coin.  That is, no magic coins for the exact same route as previously done.  If the route varies in any way (perhaps it is the same starting location and ending location as a previous route, but longer), it will earn a new magic coin.  Mad Madame Mim has…

Crossover    and    Mutation    The    two    main    operations    in    evolutionary    computing    are    crossover    and    mutation.    Crossover    works    like    this:    Randomly    choose    two    parents    from    the    population.    Let’s    say    these:    Parent    1:        T        F        T        F        T        T        F    Parent    2:        T        T        T        F        F        T        T    Those    two    parents    will    create    a    child    whose    DNA    is    related    to    the    parents’.    It    works    like    this:    for    each    of    the    seven    genes    in    the    chromosome,    we    will    randomly    pick    a    number    between    1    and    10    and    use    it    to    choose    which    parents’    value    the    child    will    get.    If    the    random    number    is    1    through    5,    we    will    use    Parent    1’s    included    value    for    the    child;    if    it    is    6…