The Gateway to Computer Science Excellence
+1 vote
934 views

A cryptarithmetic problem of the type

Can be solved efficiently using

  1. depth first technique
  2. breadth first technique
  3. constraint satisfaction technique
  4. bidirectional technique
in Computer Networks by Veteran (105k points)
recategorized by | 934 views

1 Answer

+1 vote
C)  Constraint satisfaction is the ans

in this cryptoarithmetic problem  there are some constraints like 1) no two alphabets can have same number

2)every number can have values in the range 0-9

by considering these constraints we will solve the above problem which satsify these constraints   like M will be 1 as it is carry and so on
by Boss (48.8k points)
0
@Sanjay Sharma Sir,Can you please work out your steps?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,523 answers
195,611 comments
101,287 users