Answer:
I am going to use the Python programming language to answer this. The source code is given below:
print("Enter your tweet here")
user_tweet = input()
decoded_tweet = user_tweet.replace('TTYL', 'talk to you later')
print("This is the decoded tweet: ")
print(decoded_tweet)
Explanation:
In the program the replace() module was used to replace 'TTYL' with 'talk to you later.'
Attached is the screenshot of the output.
Maturity Stage – During the maturity stage, the product is established and the aim for the manufacturer is now to maintain the market share they have built up. This is probably the most competitive time for most products and businesses need to invest wisely in any marketing they undertake. They also need to consider any product modifications or improvements to the production process which might give them a competitive advantage. i think this would be the best time for the company to purchase an emerging technology.
Answer and Explanation:
Find / -name "IT4983"
See what it will do is it will find the file named IT4983 in the root directory.
run this commmand with sudo just in case for permission issues.
then it will give you the location of that file we want to find.
Or
$ file /home/IT4983 ( you can type this command from whichever directory you are )
output : IT4983 , ASCII TEXT
Answer:
Pseudocode is as follows:
// below is a function that takes two parameters:1. An array of items 2. An integer for weight W
// it returns an array of selected items which satisfy the given condition of sum <= max sum.
function findSubset( array items[], integer W)
{
initialize:
maxSum = 0;
ansArray = [];
// take each "item" from array to create all possible combinations of arrays by comparing with "W" and // "maxSum"
start the loop:
// include item in the ansArray[]
ansArray.push(item);
// remove the item from the items[]
items.pop(item);
ansArray.push(item1);
start the while loop(sum(ansArray[]) <= W):
// exclude the element already included and start including till
if (sum(ansArray[]) > maxSum)
// if true then include item in ansArray[]
ansArray.push(item);
// update the maxSum
maxSum = sum(ansArray[items]);
else
// move to next element
continue;
end the loop;
// again make the item[] same by pushing the popped element
items.push(item);
end the loop;
return the ansArray[]
}
Explanation:
You can find example to implement the algorithm.
