Describe a Turing machine which decides for any two words w,v in {a}* whether or. not their lengths have the same parity

Describe formally (by means of a transition function) a Turing machine which decides for any two words w, v in {a}* whether or not their lengths have the same parity (i.e., either both lengths are even or both lengths are odd). You may assume that the input is the word of the kind w*v, where * is a new letter.

How safe is a password generated from words?

I loathe passwords with completely random letters and digits. It’s so much nicer to have a password made up of proper words. Even if the total length is much longer, it’s easier to memorize, transcribe, etc.

So I thought of this password generation scheme:

result = ""  while (result.length < 12)   result += randomWord()  if (result.length < 16)   result += shortRandomWord()  result += randomInteger(1000, 9999) 

In this example, assume that randomWord() returns an English dictionary word of length 4 to 10, and shortRandomWord() returns one of length 4 to 5. This is sure to give you a password of length 16 to 21, made up of 2 to 5 words, plus the 4 random integers.

Is this a good password generator? How does its entropy compare to a function that generates a password of length 8 with random letters and digits?

Calculate the number of blocks and size of main memory in words for fully-associative cache

In order to organise the cache, main memory is divided up into blocks, and each block contains a certain number of words. The cache is divided up into lines; a block can fit in one line. A cache line has control and tag bits, allowing the cache to be searched for the required word. Cache A is the single cache for a small main memory. Cache A has been organised in a particular way, giving the following control and tag bits for cache A lines: Tag (10-bits) Offset (7-bits)

How many blocks are there in the main memory that cache A is supporting?

What is the size of main memory in words?

Is there any search platform which computes indexes based on semantics of words in text?

I want to store emails for my data science project and search for different phrases in my entire collection. The phrases I will be searching might be different than the actual words, but I should always get those emails in return.

What is the best platform to do this? I need a search db that computes indexes in an email based on the semantics (consider stemmers, synonyms etc), elasticsearch or cloudsearch directly won’t work.

Also, how effective is FREETEXT function in SQL Server? Can it serve the purpose?

What are filler words that you can use for responding to users’ saying in user interview?

In user interviews, I often say “very interesting” or “that’s an interesting point” or “very helpful” in response to users answer. “Interesting” is a perfect word choice because it has a neutral feeling, doesn’t really mean good or bad. Sometimes it would be very repetitive for keep saying those in a long conversation. Would you suggest any other phrases or words to response to users?

Negative words in url/domain

I have added a negative word in ser and ran the project but still many links got built having the neg word in url and domain. I have tried running multiple projects but still happening the same.

Also in using domain extension skip filters like !edu!gov, still lots of redirects got build which dont have the edu or gov extensions.

Actually facing this from a long time but was trying to put some time in manual links removal but still I am reporting to get it checked. I hope it will be checked and worked on. Thanks

Is Resistance/Vulnerability applied before or after Cutting Words?

College of Lore bards get the Cutting Words feature at 3rd level:

When a creature that you can see within 60 feet of you makes an attack roll, an ability check, or a damage roll, you can use your reaction to expend one of your uses of Bardic Inspiration, rolling a Bardic Inspiration die and subtracting the number rolled from the creature’s roll. You can choose to use this feature after the creature makes its roll, but before the DM determines whether the attack roll or ability check succeeds or fails, or before the creature deals its damage.

When a bard uses Cutting Words to reduce damage, is resistance/vulnerability applied before or after the damage is reduced?

Is Resistance/Vulnerability applied before or after Cutting Words?

College of Lore bards get the Cutting Words feature at 3rd level:

When a creature that you can see within 60 feet of you makes an attack roll, an ability check, or a damage roll, you can use your reaction to expend one of your uses of Bardic Inspiration, rolling a Bardic Inspiration die and subtracting the number rolled from the creature’s roll. You can choose to use this feature after the creature makes its roll, but before the DM determines whether the attack roll or ability check succeeds or fails, or before the creature deals its damage.

When a bard uses Cutting Words to reduce damage, is resistance/vulnerability applied before or after the damage is reduced?

Is Resistance/Vulnerability applied before or after Cutting Words?

College of Lore bards get the Cutting Words feature at 3rd level:

When a creature that you can see within 60 feet of you makes an attack roll, an ability check, or a damage roll, you can use your reaction to expend one of your uses of Bardic Inspiration, rolling a Bardic Inspiration die and subtracting the number rolled from the creature’s roll. You can choose to use this feature after the creature makes its roll, but before the DM determines whether the attack roll or ability check succeeds or fails, or before the creature deals its damage.

When a bard uses Cutting Words to reduce damage, is resistance/vulnerability applied before or after the damage is reduced?