Sender-site Algorithm for Stop- And - Wait Protocol

Q1 PART 1 There are several bitwise operators to help manipulate bits: · & - Operates on the corresponding bits of two strings of bits. The result is a 1 if both bits were 1, O if not. •|- Operates on the corresponding bits of two strings of bits. The result is a 1 if either bit was 1, O if not. .^ - Operates on the corresponding bits of two strings of bits. The result is a 1 if only one bit was 1, 0 if not. .» (number) - Operates on one string of bits. Shifts all bits to the right equivalent to the number provided. .< (number) - Operates on one string of bits. Shifts all bits to the left equivalent to the number provided. .N- Operates on one string of bits. Inverses all of the bits. Consider variable string1 = Ox12345678 and variable mask = OxC Fill in the missing value (???) by inputting what it should be in the Solutions boxes adjacent to the respective Task below. Each Task is distinct so earlier tasks have no bearing on the following ones (updating string1 will only be for that…

In C++ language Magic Decoder Ring. A one-time pad is a coding device that uses each character of a key string only once to encode and decode a corresponding character in a message string. Thus, the first character in the key is used to encode and decode the first character in the clear message, the second character in the key is used with the second character in the message, etc. No portion of the key is reused in subsequent messages, making for a very solid coding system, assuming a randomly generated key. You will need to create a class titled MagicDecoderRing that contains the variables and functions needed for obtaining the clear and key texts, encoding and decoding the messages, writing out the encoded message etc. You will need to instantiate an instance of this class in your main function to run your program and encode and decode messages. You need to further break your MagicDecoderRing code down into many small functions that each can be described with a single sentence…

list all the steps the naive string matcher uses to find all the occurrences of the pattern ACG in the text TACAGACG