How many 10-bit strings (that is, bit strings of length 10) are there which: a. Start with the sub-string 011? b. Have weight 5 (i.e., contain exactly 5 1's) and start with the sub-string 011? c. Either start with 011 or end with 01 (or both)? d. Have weight 5 and either start with 011 or end with 01 (or both)?

How many 10-bit strings (that is, bit strings of length 10) are there which: a. Start with the sub-string 011? b. Have weight 5 (i.e., contain exactly 5 1's) and start with the sub-string 011? c. Either start with 011 or end with 01 (or both)? d. Have weight 5 and either start with 011 or end with 01 (or both)?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

2. How many decimal strings, of length 8, start with the number 33 or start with the number 984 ?
Consider the hex strings A=0xee89e74b88a069db and B=0x2fb6965993e7af84. a) What is A O B in hexadecimal? Please give your answer a leading Ox and use lowercase letters only. Make sure you use exactly 16 hex digits (which may involve typing in leading zeros). 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?
Given a number n, identify and print which in the given set of numbers are factors of n. Should there be no factors listed in the set of numbers, print "I'm alone". For example, given the number 36 and the set of numbers 2, 3, 5, 7, 12. Only print the numbers which are factors of 36, which are 2, 3, 12. Input The first line contains the number n; The second line contains how many numbers there are in the set of numbers; The third line contains the set of numbers. INPUT: 36 5 2·3·5·7·12 Output The set of numbers that are factors of n separated by a new line in order of appearance. If there are none, print "I'm alone" OUTPUT: 2 3 12
Convert the decimal (base 10) number 40 to a binary (base 2) number that has only the digits '0' and '1'. Binary number: (For example, the decimal number 16 is the same as the binary number 10000; the decimal number 13 is the same as the binary number 1101.)
HALP m + n = 2k + 2k = 4k therefore adding even numbers always gives an even number. The above is wrong because.... it doesn't consider the case when adding to odd numbers m and n are different so you cannot use 2k for both it doesn't consider what m and n are for particular values in the integers it doesn't consider the case when m is even and n is odd
Q4:- Rivet-Shamir Adleman(RSA) algorithm is an example of encryption algorithm which is based on public key cryptography that you have been introduced in this module. Answer the following questions: a. Describe the basic steps involved in the process of RSA algorithm. b. Using the prime numbers p=5 and q=7, generate public and private keys for the RSA algorithm. c. If the sender sends a letter e that has a numeric representation of 5, show that the receiver gets letter e.
A corporate executive who is slowly embezzling money from the company's pension fund has instructed his partner in crime, an investment banker, to send all correspondence in code. The computer operators on his staff type the correspondence on cards, each card containing 60 characters. To decode the message, you must first divide up the string into 5 blocks containing 12 characters each, with every twelfth character used to build a word. In addition, each letter is to be replaced with the letter six ahead of it in the alphabet. Thus, A becomes G, B becomes H, and U becomes A, V becomes B, and so on. Write a procedure in PL/I to read the characters from cards, decode the characters of each card, and print the 12 output words, four per line. The program should terminate when a card contains all consonants (consider Y to be a consonant).
This must be done using CORAL language. Primary U.S. interstate highways are numbered 1-99. Odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. Auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. Thus, the 405 services the 5, and the 290 services the 90. Given a highway number, indicate whether it is a primary or auxiliary highway. If auxiliary, indicate what primary highway it serves. Also indicate if the (primary) highway runs north/south or east/west. Ex: If the input is: 90 the output is: The 90 is primary, going east/west. Ex: If the input is: 290 the output is: The 290 is auxiliary, serving the 90, going east/west. Ex: If the input is: 0 or any number not between 1 and 999, the output is: 0 is not a valid interstate highway number.
The following binary sequences are stored in two distinct 16-bit memory locations: A = 10010001 11000111 B = 01111010 11101000 Hint: You can use calculators/tools, but you should show the calculation procedure for each case Find both binary and decimal values of Z=A+B if A, B, and Z are all signed a integers. Find both binary and decimal values of Z=A+B if A, B, and Z are two's b complement numbers. If A and B are two Boolean vectors (vectors in which every element is TRUE or C FALSE), find the outcome of the following bit-wise logical operation: (A&&B)||(!A&&!B). What would be the data type and the corresponding value of Z=A+B (written d in Python) if A and B represent two ASCII Strings (Find ASCII table in appendix). If A represent the first two bytes (network prefix) and B represents the last e two bytes (host suffix) of a class B IPV4 address, find the corresponding IP address.
for the following sequence of keys, do the following: MBX, EXB, GBX,…, ABX, AXB,…, QXB, YXB, … . 1. Fill in the 3 blanks with strings from your first, second, and third name.
You need to measure distance between two binary strings. You want the strings to appear similar if they are the same, but they are out of alignment. Which distance measurement would you choose? Group of answer choices Euclidean Levenshtein Manhattan Hamming
I am trying to convert a string in hexadecimal to an integer, or it's decimal value. For example A6 in hexadecimal is 166 in decimal. How do I do this without using modulus, division, and multiplication?