adplus-dvertising
frame-decoration

Question

If we define the functions f, g and h that map R into R by :

f(x) = x4, g(x) = √x2 + 1, h(x) = x2 + 72,  then the value of the composite functions ho(gof) and (hog)of are given as

a.

x^8 - 71 and x^8 - 71

b.

x^8 - 73 and x^8 - 73

c.

x^8 + 71 and x^8 + 71

d.

x^8 + 73 and x^8 + 73

Answer: (d).x^8 + 73 and x^8 + 73

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If we define the functions f, g and h that map R into R by : f(x) = x4, g(x) = √x2 + 1, h(x) = x2 + 72,  then the value of the composite functions ho(gof) and (hog)of are given...

Similar Questions

Discover Related MCQs

Q. Dijkstra algorithm, which solves the single-source shortest-paths problem, is a_______________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _____________.

Q. Equivalent logical expression for the Well Formed Formula (WFF), ~(∀ x)F[x] is

Q. An A * algorithm is a heuristic search technique which

Q. The resolvent of the set of clauses (A v B, ~ A v D, C v ~B) is

Q. How many strings of 5 digits have the property that the sum of their digits is 7 ?

Q. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?

Q. In how many ways can 15 indistinguishable fishes be placed into 5 different ponds, so that each pond contains atleast one fish ?

Q. Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg (v) >= n / 2 for each vertex of G
(b)  | E(G) | >= 1 / 2 (n-1) (n-2) + 2 edges
(c) deg (v) + deg (w) >= n for every v and w not connected by an edge

Q. An all-pairs shortest-paths problem is efficiently solved using :

Q. The travelling salesman problem can be solved in :

Q. Let f (n) and g(n) be asymptotically non-negative functions. Which of the following is correct?

Q. Given the following equalities :

E1 : nK+∈ + nK lg n = Ф(nK+∈) for all fixed K and ∈, K ≥ 0 and ∈ > 0.

E2 : n32n + 6n23n = O(n32n)

Which of the following is true ?

Q. How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements

Q. Suppose that R1 and R2 are reflexive relations on a set A.
Which of the following statements is correct ?

Q. There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. we pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed ?

Q. The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is:
(Where P is number of predicate nodes in flow graph V(G)

Q. How many multiples of 6 are there between the following pairs of numbers?
0 and 100 and -6 and 34

Q. Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)|=n≥3. Then which of the following is true?

Q. Which of the following statements is false?
(A) Optimal binary search tree construction can be performed efficiently using dynamic programming.
(B) Breadth-first search cannot be used to find connected components of a graph.
(C) Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely.
(D) Depth-first-search can be used to find the components of a graph.

Q. Which of the following strings would match the regular expression: p+[3-5]*[xyz] ?

I. p443y
Il. p6y
III. 3xyz
IV. p35z
V. p353535x
Vl. ppp5