Consider the hex strings A=0x274dce4716a5705c and B=0x98d54fc92cd0eed0. a) What is A O B in hexadecimal? Please give your answer a leading Ox and use lowercase letters only. hexadecimal: b) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A is 1? c) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A O B is 1?

Consider the hex strings A=0x274dce4716a5705c and B=0x98d54fc92cd0eed0. a) What is A O B in hexadecimal? Please give your answer a leading Ox and use lowercase letters only. hexadecimal: b) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A is 1? c) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A O B is 1?

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

Q3) Solve each of the following: a) (0 10011000 10000100010100110000000)Floating Point = (?)2 b) If A = 10101010, B = 01010101, and C = 00110011, then find X = A ∨ B ∧ ￢C c) Create a truth table for the Boolean function Y = ￢(A ∧ Β). d) Using the value –128, write it as an integer literal in decimal, hexadecimal, and binary formats that are consistent with MASM syntax. e) Write the real number –7.823 × 10-38 as a real number literal using MASM syntax.
Given two numbers: n: number of consecutive letters beginning at a k: string length Output all possible k-length possible strings containing the first n letters of the alphabet. Letter repeats are allowed. Sample Run: # of letters: 4 length: 3 aaa aab aac aad aba abb abc abd aca acb acc acd ada adb adc add baa bab bac bad bba bbb bbc bbd bca bcb bcc bcd bda bdb bdc bdd caa cab cac cad cba cbb cbc cbd cca ccb ccc ccd cda cdb cdc cdd daa dab dac dad dba dbb dbc dbd dca dcb dcc dcd dda ddb ddc ddd
Let B be the set of all binary strings of length 8. {“00000000”, “00000001”, … “11111110”, “11111111”} How many elements of B have no adjacent digits with the same value? How many elements of B are palindromes? How many elements of B contain two or more 0s?
Q-2 Suppose that you pick a bit string from the set of all bit strings of length ten. What is the probability that the bit string has more 0s than 1s?
how many 11 - strings (that is, bit strings of length 11) are there which: a. start with sub - string 011 b. have weight 8 (i.e contain exactly 8 1's ) and start with the sub - string 011 c. either start with 011 or end with 01 (or both) d. have weight 8 and either start with 011 or end with 01 (or both)
Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?
How many 14-bit strings (that is, bit strings of length 14) are there with: (a) start with sub-string 011? (b) have weight 7 (i.e., contain exactly 7 1’s) and start with the sub-string 011? (c) either start with 011 or end with 01 (or both)? (d) have weight 7 and either start with 011 or end with 01 (or both)?
Using the Huffman Algorithm, encode the following string “Dear Enam,”. Where Surname is your official or formal registered Surname as a student in GCTU. Determine (a) The Huffman-tree. (b) The Huffman-code (c) The average code length of bits saved. (d) The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
Consider a binary code to distinguish the elements of a set {a, b, c, d}, with P(a) = 0.7, P(b)=0.15, P(c)=0.1 and P(d)=0.05. On average, how many bits will be used by a sequence of 20 elements confirming to the probability distribution given above. i.e. aaaaaaaaaaaaabbbccd Group of answer choices a. 18 b. 26 c. 2 d. 40
Let L={ w in(0 + 1)* 1 | w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L? (A) (0* 10* 1)* (B) 0* (10* 10* )* (C) 0* (10* 1* )* 0* (D) 0* 1(10* 1)* 10*
CRYPTOGRAPHY.In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of 0's and 1's. The input is the 64 bit block 00000000000000100000000000000010000001000000010001000000000000000000000000000010000000000000001000000100000001000100000000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000001000000000000000000000000000000000000000000000001000000000000000000000000000000 What does the 64 bit state look like after the IP transformation is applied to the input? Now find L0L0 and R0R0, the left and right halves of the state.L0=L0= R0=R0= What is the result of applying the expansion box to R0R0? E(R0)=E(R0)= What is the result of XORing the subkey with E(R0)E(R0)? k1⊕E(R0)=k1⊕E(R0)= We now apply the S-box transformation. S(k1⊕E(R0))=S(k1⊕E(R0))= Finally we apply the permutation box to complete the function ff. f(R0)=P(S(k1⊕E(R0)))=f(R0)=P(S(k1⊕E(R0)))= We…
Using the Huffman Algorithm, encode the following string “Dear Asiamah,”. Where Surname is your official or formal registered Surname as a student in GCTU. Determine (a) The Huffman-tree. (b) The Huffman-code (c) The average code length of bits saved. (d) The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.