Amy, Brian, and Cindy get together once a week to go to dinner at one of their 2 favorite restaurants: Zero-Burgers or One-of-a-Kind Pizzeria. The friends vote on which restaurant to go to and the majority wins. Make a truth table using 3 inputs to represent the votes of the three friends and a single binary output to represent which restaurant has been selected. Then move to a k-map to create an SOP (Sum of Products) equation for the solution

Amy, Brian, and Cindy get together once a week to go to dinner at one of their 2 favorite restaurants: Zero-Burgers or One-of-a-Kind Pizzeria. The friends vote on which restaurant to go to and the majority wins. Make a truth table using 3 inputs to represent the votes of the three friends and a single binary output to represent which restaurant has been selected. Then move to a k-map to create an SOP (Sum of Products) equation for the solution

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter4: Making Decisions

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

We assume that the standard input contains a sequence of non-zero integers between - 121 and 121, which ends with 0. This sequence will be given by the user. 1. Write an algorithm, called Decomposition_Powers_Three, which produces the decomposition of each integer using powers of 3, namely 1, 3, 9, 27, and 81, and the + and – operators. Each power of 3 should appear at most once in the decomposition. Examples: 1 = 1 2 = 3 – 1 3 = 3 4 = 3 + 1 7 = 9 – 3 + 1 14 = 27 – 9 – 3 – 1 43 = 81 – 27 – 9 – 3 + 1 121 = 81 + 27 + 9 + 3 + 1 2. Show that the algorithm Decomposition_Powers_Three is correct using an informal proof (i.e., discussion). 3. Give a program corresponding to Decomposition_Powers_Three, using any of your favorite programming languages. Observation: The intervals [-121,-41], [-40,-14], [-13,-5], [-4,-2], [-1,-1], [1,1], [2,4], [5,13], [14,40], and [41,121] play a particular role. explain the algorithm and output as well. expected output for the program is 1 = 1 2 = 3 – 1 3 = 3…
5. Practice with RSA algorithma. Pick two prime numbers p, q, for example,• const int P=23;• const int Q=17;• int PQ=P*Q; b. Find a e that is relatively prime with (p-1)(q-1)Call RelativelyPrime () c. Calculate the inverse modulo (p-1)(q-1) of e to be your dUse inverse () c++
Show the output that would be generated by each of the following program fragments:a) for ch in "aardvark" :print (ch)b) for w in "Now is the winter of our discontent ... ". split () :print (w)c) for w in "Mississippi ". split (" i") :print (w, end=" ")d) msg = ""for s in " secret " . split ("e") :msg = msg + sprint (msg)e) msg = ""for ch in " secret ":msg = msg + chr (ord(ch) +1)print (msg
Given: NFA M1 = ({A,B,C}, {a,b}, delta, A, {C}) where delta: (A,a) -> {A}, (A,b) -> {A,B}, (B,a) -> {C}, (B,b) -> null, (C,a) -> null, (C,b) -> null. Get the equivalent DFA of the given NFA. What is the next state for input pair (C,a) in the equivalent DFA? Choices A B C D
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assmue that the positions of bits count from right to left.That is, the first bit is the least significant bit.
Determine the output of the following: A = {2, 1, 5, 6} B = {3, 4, 6, 10, 11} def dispOut(outp): for x in outp: print(x, end=' ') print()1. dispOut(B-A) 2. dispOut(A & B) 3. dispOut(A.symmetric_difference(B)) 4. dispOut(A - B) 5. dispOut(A | B)
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
Correct answer will be upvoted else downvoted. Each decimal number has a base k same. The singular digits of a base k number are called k-its. How about we characterize the k-itwise XOR of two k-its an and b as (a+b)modk. The k-itwise XOR of two base k numbers is equivalent to the new number framed by taking the k-itwise XOR of their relating k-its. The k-itwise XOR of two decimal numbers an and b is signified by a⊕kb and is equivalent to the decimal portrayal of the k-itwise XOR of the base k portrayals of an and b. All further numbers utilized in the assertion underneath are in decimal except if indicated. When k=2 (it is in every case valid in this form), the k-itwise XOR is as old as bitwise XOR. You have hacked the criminal data set of Rockport Police Department (RPD), otherwise called the Rap Sheet. However, to get to it, you require a secret word. You don't have any acquaintance with it, yet you are very certain that it lies somewhere in the range of 0 and n−1…
Chandu and chandni Talk on phone for a long time daily. Being afraid that someone will hear their private conversation chandu suggested chandni an idea. He suggested that he will talk only with encrypted strings with her and only she would know, how to decrypt the string. So that even if someone hears, He/She would not be able to anticipate their conversation. Rules of encryption are as follows:1. String on length N is assumed to be cyclic consisting of lower case English alphabets.2. In each iteration, we pick the last character and put it in starting of the string. For example: april performing iterations and collecting each string formed in a set until we get the original string. Ex: {april,lapri, ilapr, rilap, prila}3. sort the set of string in lexicographically reverse order. Ex: {rilap, prila,lapri, ilapr, april }4. Taking the last character of each string in the set is the encrypted string. Ex: pairl Chandu also sends the position(K) of first letter in encrypted string from…
When trying to find a solution, you should give serious attention to employing both the selective-repeat technique and the Go-Back-N strategy if the sequence number space is wide enough to incorporate k bits of information. If the sequence number space is not big enough, you should not even bother trying to find a solution. In its whole, what is the maximum size that the sender window that we are allowed to use is authorised to be allowed to be?
Question v Give a DFA that recognizes all binary sequences of 0’s and 1’s whose length is both 1 mod 5 and 1 mod 3. (e.g. length 1 or length 16 are such strings.) Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
designed an iterative algorithm for separating n VLSIchips into those that are good and those that are bad by testing two chips at a time andlearning either that they are the same or that they are different. To help, at least half ofthe chips are promised to be good. Now design (much easier) a randomized algorithmfor this problem. Here are some hints. Randomly select one of the chips. What is the probability that the chip is good? How can you learn whether or not the selected chip is good? If it is good, how can you easily partition the chips into good and bad chips? If the chip is not good, what should your algorithm do? When should the algorithm stop? What is the expected running time of this algorithm?