Let Σ = {a, b, c, d, e} be an alphabet. We define an encoding scheme as…

PYQ GATE 2003

Let Σ = {a, b, c, d, e} be an alphabet. We define an encoding scheme as follows:

g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11.

Let pi denote the i-th prime number (p1 = 2).

For a non-empty string s = a1 ... an, where each ai ∈ Σ, define f(s) = ∏i=1n pig(aᵢ).

For a non-empty sequence ⟨s1 ... sn⟩ of strings from Σ+, define h(⟨s1 ... sn⟩) = ∏i=1n pif(sᵢ).

Which of the following numbers is the encoding, h, of a non-empty sequence of strings?

  1. A.

    27 · 37 · 57

  2. B.

    28 · 38 · 58

  3. C.

    29 · 39 · 59

  4. D.

    210 · 510 · 710

Attempted by 65 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…