Let X be the set {1,2,3,4,5}and Y be the set {6,7,8,9,10}.The unary function f:XYand the binary function g:X×YYare described in the following tables.

g12345f(n)67676 g123456789101010101010789106789106789106789106

a. What is the value of f(2)?
b.What are the range and domain of f?
c. What is the value of g (2, 10) ?
d. What are the range and domain ofg?
e. What is the value ofg(4, f (4))?

Short Answer

Expert verified

a. 7

b. Range R=6,7, Domain D=1,2,3,4,5

c. 6

d. Range localid="1657785531784" R=6,7,8,9,10

localid="1660886309964" DomainD=1,6,1,71,8,1,91,10,2,62,7,2,82,9,2,103,6,3,73,8,3,93,10,4,64,7,4,84,9,4,105,6,5,75,8,5,9,5,10

e. 8

Step by step solution

01

Calculating the value of f (2)

  1. From the first table, it can be concluded that the value of the function f at n = 2 is 7. So,f2=7
02

Finding the range and domain of the function f

  1. A range can be defined as the set of all the outputs generated by the given function. A domain can be defined as the set of all accepted inputs by the given function.

From the first table, we can see that for the set of different inputs, thefunctionis giving only 6 and 7. So, the range is6,7

All the different values of n are the inputs of the given function. So, the collection of different values of n are the domain of given function. Therefore,DomainD=1,2,3,4,5

03

Calculating the value of g2,10

  1. gi,jcorresponds the value of the function where denotes the row index and denotes the column index. Therefore, the value of gi,jis 6 from the second table.
04

Finding the range and domain of the function g

  1. The range of the function g is6,7,8,9,10because the output contains only these values in the table.

Domain D is the cartesian product of X and Y, therefore it can be evaluated using the cartesian product of X and Y. Therefore the domain will be:

X=1,2,3,4,5Y=6,7,8,9,10

localid="1660886897865" D=1,6,1,71,8,1,91,10,2,62,7,2,82,9,2,103,6,3,73,8,3,93,10,4,64,7,4,84,9,4,105,6,5,75,8,5,9,5,10

05

Calculating the value of g4,f4

f4=7G4,f4=g4,7g4,7=8

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

LetMAX-CLIQUE={(G,k)|alargestcliqueinGisofsizeexactlyk}. Use the result of Problem 7.47 to show that MAX-CLIQUEis DP-complete.

Recall, in our discussion of the Church–Turing thesis, that we introduced the language is a polynomial in several variables having an integral root}. We stated, but didn’t prove, thatis undecidable. In this problem, you are to prove a different property of—namely, thatDis -hard. A problem is -hard if all problems in are polynomial time reducible to it, even though it may not be inNPitself. So you must show that all problems in NPare polynomial time reducible to D .

Question:Let T={i,j,k|i,j,kN}.Show that is countable.

Rice’s theorem. Let P be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine’s language has property P is undecidable. In more formal terms, let P be a language consisting of Turing machine descriptions where P fulfils two conditions. First, P is nontrivial—it contains some, but not all, TM descriptions. Second, P is a property of the TM’s language—whenever LM1=LM2, we haveM1P if and only iffM2P . Here, M1 and M2 are any TMs. Prove that P is an undecidable language.

Read the informal definition of the finite state transducer given in Exercise 1.24. Give the state diagram of an FST with the following behaviour. Its input and output alphabets are 0,1 . Its output string is identical to the input string on the even positions but inverted on the odd positions. For example, on input 0000111 it should output 1010010 .

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free