Artificial Intelligence Cryptarithmetic Problems Aptitude Questions and Answers (MCQ)

Aptitude Questions and Answers (MCQ) | Cryptarithmetic Problems: This section contains aptitude questions and answers on Cryptarithmetic Problems in Artificial Intelligence.
Submitted by Monika Sharma, on March 30, 2020

1) Which of the following types does the Cryptarithmetic problem belong to?
  1. Encryption Problem
  2. Constraint Satisfactory Problem
  3. Number problem
  4. All of the above

2) Which of the following mentioned properties are valid for a Cryptarithmetic problem?
  1. A number 0-9 is assigned to a particular alphabet.
  2. Each different alphabet has a unique number.
  3. All the same alphabets have the same numbers.
  4. The numbers should satisfy all the operations that any normal number does.


  1. Only iv.
  2. All i., ii., iii. and iv.
  3. ii. and iv.
  4. None of the above

3) Which of the mentioned point are not valid with respect to a Cryptarithmetic problem?
  1. Constraints should be taken care of while solving the problem
  2. The text is converted from readable format to non-readable format
  3. If numbers are not sufficient, we can use special symbols like $#@% to encrypt the text
  4. None of the above

4) Consider the following statement:
"The Cryptarithmetic problem in Artificial Intelligence is a type of encryption problem in which the written message in an alphabetical form which is easily readable and understandable is converted into a numeric form which is neither easily readable nor understandable."
By reading the above statement, what are the places where this technique can be applied?
  1. To share passwords
  2. To encode number plates of vehicles
  3. To encode their names by students while filling the answer sheet
  4. None of the above

5) Provide the answer for the following Cryptarithmetic problem:
  1. S=12; E=5; N=6; D=8; M=1; O=0; R=8; Y=2
  2. S=9; E=5; N=6; D=7; M=1; O=0; R=8; Y=2
  3. S=5; E=5; N=6; D=7; M=1; O=0; R=8; Y=2
  4. S=9; E=5; N=9; D=7; M=1; O=0; R=8; Y=2

Comments and Discussions!

Load comments ↻

Copyright © 2024 All rights reserved.