An input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network.

An input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network.

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

Build a _lengOfSt function in MIPS, that takes an argument in $a1 which is the address of a null-terminated string, returning the length of the given string (number of characters excluding the null-character) in $v0.
(you should achieve O(n) time)When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm?
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*
How many bit strings contain exactly five 0s and fourteen 1s if every 0 must be immediately followed by two 1s? write an algorithm in C/C++ to implement this computation
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
Draw the PDA that checks if a binary string M is of the form: {M = anbmcr where n = 2*m and r = n /2 } .
kindly do it ASAP Write a code to implement the combination of RSA and AES algorithms. In your implementation, first the RSA will be used to encrypt the secret key for sending from Alice to Bob. On the other hand, the AES will be used for encryption and decryption of long messages between the Alice and Bob. Remember in such type of combination, first the Bob will generate its public and private keys and share its public key with the Alice. The Alice encrypt the short message (secret key for communicating the long messages) using RSA and send it to the Bob. Then Bob decrypts the short message (secret key for communicating the long messages) using its private key and found the short message (secret key for communicating long messages). After that both Alice and Bob use this same secret key for the encryption and decryption of long messages.
write a sender and receiver side bit stuffing program in which a frame is to be simulated with header , payload and trailer . in that demonstrate bit stuffing concept. c/c++/java can be used for processing a given file/string of binary bits. [starting and ending flags/indicator are 01111110].
I am analysing a pcap file using Python and wireshark. Currently, I have it counting the number of packets I would like to count the number of SYN and ACK packets with this function? My main piece of code thus far is n is an int please show me how to write the code for this.
The Lingala Language of Republic of Congo has 35 letters. Consider an Affine cipher, which encrypts each letter according to the rule: C=(p×k1+k2) mod 35. Here C, p, k1, and k2 are each members in the range 0 to 34, where C represents the ciphertext letter, p the plaintext letter, and k1 and k2 are constant keys. How many possible keys does this affine system have? Explain in details.
Alice is using the one-time pad and notices that when her key is all-zeroes ? = 0^?, then Enc(?, ?) = ? and her message is sent in the clear! To avoid this problem, she decides to modify the scheme to exclude the all-zeroes key. That is, the key is now chosen uniformly from {0, 1}^?\ {0^?}, the set of all ?-bit strings except 0^? . In this way, she guarantees that her plaintext is never sent in the clear. Is this variant still one-time perfectly secure? Justify your answer.
**Please do C****C IS different from B** a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given…