Does polymorph and power word kill instakill? [duplicate]

I have read that the polymorph and power word kill combo can be annoying for DM’s but I’m confused on why it works. In the description for polymorph it states:

The transformation lasts for the Duration, or until the target drops to 0 Hit Points or dies.

Shouldn’t when it dies from power word kill it should revert back to it’s normal form with it’s normal hit points?

Machine has 64 bit architecture and two word long instruction

A machine has a 64-bit architecture, with 2-word long instructions. It has 128 registers, each of which is 32 bits long. It needs to support 49 instructions, which have an immediate operand in addition to two register operands. Assuming that the immediate operand is a signed integer, the maximum value of the immediate operand is that can be stored is?

edit: would 1 word long instruction for this case be of 64 bit and 2 word long instruction be of 128 bits? Also do we have to add an extra bit while calculating the total bits required for 49 instructions?

Finding longest word without help of library functions or regex?

Have the function LongestWord(sen) take the sen parameter being passed and return the largest word in the string. If there are two or more words that are the same length, return the first word from the string with that length. Ignore punctuation and assume sen will not be empty.


Taken from here

Every single solution that came across in Javascript or C# are the ones which use regex. Is it possible to solve this without regex?

I gave it a shot but could not make it work:

function LongestWord(sen) {   let word = [];   let longestword = "";   let longestwordlen = 0;   let wordlen = 0;   for (let i = 0; i < sen.length - 1; i++) {      if (isAlphabet(sen[i]) && !isInvalidChar(sen[i + 1])) {       wordlen++;       word.push(sen[i]);     }     if (isSpace(sen[i + 1])) {       if (wordlen > longestwordlen) {         longestwordlen = wordlen;         longestword = word.join('')       }       wordlen = 0;       word = [];     }    }    return longestword; }  function isSpace(char) {   if (char.charCodeAt(0) == 32) return true   else return false } function isInvalidChar(char) {   if (!isSpace(char) && !isAlphabet(char)) return true   else return false } function isAlphabet(char) {   if ((char.charCodeAt(0) >= 65 && char.charCodeAt(0) <= 90) || (char.charCodeAt(0) >= 97 && char.charCodeAt(0) <= 122)) return true   else return false }  LongestWord("I am going to kill youeeeeee ") 

Is this malware Gen:Variant.Fugrafa.15976 (B) [krnl.xmd] detected on NJStar Chinese word processor a false alarm?

I found this malware Gen:Variant.Fugrafa.15976 (B) [krnl.xmd] on NJStar Chinese word processor using Emisoft Emergency Kit to scan for malware. I have been using NJStar Chinese word processor for a long time and today is the first time I see this malware appearing during scan. I did a recent update of the virus definition.

I tried to google for more information on this malware but could not find anything. Could it be a false alarm?

Extracted from report;

C:\Program Files (x86)\NJStar Chinese WP6\update.dll    detected: Gen:Variant.Fugrafa.15976 (B) [krnl.xmd] 

enter image description here

Is there a word for the fact that all data representations are equal?

For programming languages, we have the concept of Turing completeness which expresses the fact that all computers and all languages are equal in their ability to represent any algorithm so long as we ignore the capacity of the storage medium. Is there a similar word for data encodings/representations?

For example, any number can be represented in unary, binary, ternary form. So long as all the data structures have the same “data capacity” between any given 2 structures A and B there exist functions:

to :: A → B from :: B → A 

Where from ∘ to == id.

This is obviously true for any (context insensitive) data structure that exists in a computer because they are literally all just strings of bits. But what is the word for this?

Arbitrary Turing machine run time analysis on the empty word

Consider $ L = \{ \langle M,n \rangle : M $ accpets $ \epsilon $ in less than $ T(n)$ steps$ \}$

This language is decidable because we can simulate $ M$ on $ \epsilon$ and accept if it accepts and reject if it rejects or passed more than $ T(n)$ steps.

I am interested in the time bounds of a decider of $ L$ , can we find a decider to do so in $ o(T(n))$ time? $ O(T(n)log(n))$ is achieved by simulation time bounds (and maybe even $ O(T(n))$ , I’ve seen somewhere that a linear time simulation can be achieved) but is it possible to do so in some $ o(T(n))$ time? since we are dealing with a constant word, it might have a better time complexity than a general simulation time.

Associative mapped cache, word addressable

I have an associative mapped cache with 10 tag bits and an offset of 7bits.

What is the size of each main memory block in words(word addressable) and main memory size in words?

i worked it out as: block size would 2^7bits. main memory would be 2^17bits.

the issue I am facing is, how do I get them to be word addressable with this much information given. I have managed to get the above result in byte-addressable. Please correct me if i am wrong.