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

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

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 ?
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.)
A binary number is to be transfromed by appending three 0's to the end of the number. For example , 11101 is transformed to 11101000. Which of the following best dewcribes the relationship between the transformed number and the original.- The transfromed number is 3 times the value of the original number- The transformed number is 4 times the value of the original number- the transformed number is 8 times the value of the original number- The transformed value is 1000 times the value of the original number
this code only prints random dna letters where is the game there are the questions below Find the complement of a DNA strand: recall that a DNA strand is a combination of fouruppercase letters; A, T, C, and G. The letters A and T are complements, and the letters Cand G are complements. To find the complement of a DNA strand you must replace eachcharacter with its complement. For example, ATCGG is the complement of TAGCC andCCC is the complement of GGG. Your program must show a DNA of a predefined lengthto the player and ask for its complement.2. Find the reversed DNA strand: the order of the characters in a DNA strand should bereversed. Examples: GCTAA is the reverse of AATCG and AA is the reverse of AA. Yourprogram must show a DNA of a predefined length to the player and ask for the reversedstrand.3. Find the compressed DNA strand: all repeated characters in a DNA strand should bereplaced by the number of repeats followed by that character once. For example, 2C3ATis the compressed…
Given 2 strings, return their concatenation, except remove the last character of each and swap the order of the inputted words. The strings will be at least length 3. Ex: If the input is: bird penguin the output is: pengiubir Ex: If the input is: loving csce the output is: csclovin
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.
if A = [1 2 3;4 5 6;7 8 9]; and B = [9 87;6 5 4 3 2 1]; then C= dot(a,b) = O C = 2-1 40 O C = 12 35 44 C = 54 57 54 O None of the above if a= [4 -1 2]; and b=[2 -2 -1], then C= dot(a,b) = O C= 8 O C= 10 O C= 1 O None of the above
Q3: Consider binary strings (made of 0 and 1) of length 6. How many strings you can make? How many of them begin with 11 and end with 00
5. Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1..
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
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
Rahul is a maths genius so he came up with a game and as raj is Rahul's best friend so Rahul decided to play the game with raj. Rahul gives raj two numbers LL and RR and asks raj to find the count of numbers in the range from LL to RR (LL and RR inclusive) which are a digit palindromic. A number is a digit palindromic if its first digit is the same as its last digit. As raj is not very good at maths so your task is to help Raj find out how many numbers are a digit palindromic in the range LL to RR. For example if LL = 88 and RR = 2525 .The following numbers are a digit palindromic in the range of LL to RR: 8, 9, 11, and 22. If LL = 12511251 and RR = 12661266. The digit palindromic numbers are 1251 and 1261. Input format The first line contains an integer denoting the number of test cases. Each test case is described by a single line that contains two integers LL and RR. Output format For each test case output, an integer denoting how many a digit palindromic numbers are there in the…