Exambodh - Practice Aptitude, Reasoning & GK Questions
Play Quiz
Logical Reasoning
hardQ. No. 16478-in-a-certain-code-dream-is-written-as-guhdp-how-will-nest-be-written-in-that-code

In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?

Last Updated:

This bilingual Coding-Decoding question tests the exact transformation used in “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?”. It requires the learner to align letter positions, identify the position-wise alphabetic progression shown by consecutive terms, apply the rule consistently and verify QHVW against every position.

AOFTU
BPGUV
CMDRS
DQHVW
Correct Answer: QHVWYour Answer: D

Explanation

The verified answer to “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?” is QHVW, option D. The source working states: Correct answer: QHVW (Option A). Apply the same unchanged rule to NEST: N→Q, E→H, S→V, T→W. Therefore the required code is QHVW. Wrong options: OFTU is wrong because it does not reproduce the verified rule at every position; PGUV is wrong because it does not reproduce the verified rule at every position; MDRS is wrong because it does not reproduce the verified rule at every position. Even one mismatched position invalidates a code, so only Option A is correct. This observation must be confirmed across every available letter position or every consecutive term before it is applied to the missing code. Applying the verified rule to the target expression produces QHVW. The alternatives OFTU, PGUV and MDRS fail because at least one position does not obey the same transformation. A useful final check is to map QHVW backward through the inverse operation and confirm that the original target is recovered.

Important Notes

  • The exact rule used in “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?” is the position-wise alphabetic progression shown by consecutive terms.
  • The codes OFTU, PGUV, MDRS fail at one or more positions in “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?”.
  • Apply the inverse rule to QHVW and recover the target from “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?”.

Related Questions

View All

Test your Coding Decoding knowledge

Start Topic Test

FAQ

Coding Decoding FAQs

Common questions and clear answers for this topic.

What is the verified answer to “In a certain code, DREAM is written as GUHDP. How will NEST be written in that code?”?

QHVW, option D.

Which coding rule is applied?

The question uses the position-wise alphabetic progression shown by consecutive terms.

Why are the other options incorrect?

OFTU, PGUV, MDRS violate the verified transformation at one or more positions.

How can the code be checked?

Apply the inverse transformation to the selected code and verify the original target.

What is Coding Decoding in Logical Reasoning?

Coding Decoding is a type of Logical Reasoning question where words or letters are coded in a specific pattern and you need to decode them. For example if CAT is coded as FDW then each letter is shifted by 3 positions. It is one of the most important topics in SSC CGL, Bank PO, IBPS, and Railway competitive exams.

What are the types of Coding Decoding questions in competitive exams?

Types of Coding Decoding questions: Letter Coding (letters replaced by other letters), Number Coding (words coded as numbers), Symbol Coding (letters replaced by symbols), Mixed Coding (combination of numbers and letters), and Coding by Analogy. All these types are asked in SSC CGL, RRB NTPC, and Bank exams.

In a certain code, DREAM is... | Coding Decoding MCQ | Exambodh