Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
13 views

Functions & Boolean Expressions

This document discusses functions including: 1. Defining functions and classifying them as algebraic or transcendental 2. Operations on functions such as injective, surjective, bijective, and inverse functions 3. Recursively defined functions and how primitive recursion works to define functions

Uploaded by

abhijeetkumar7985
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Functions & Boolean Expressions

This document discusses functions including: 1. Defining functions and classifying them as algebraic or transcendental 2. Operations on functions such as injective, surjective, bijective, and inverse functions 3. Recursively defined functions and how primitive recursion works to define functions

Uploaded by

abhijeetkumar7985
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Function : Definition, Classification of

Functions, Operations on Functions,


Recursively Defined Functions, Growth of
Functions.

Ques 25 Define the term function. Also, give classification of it.


Answer:
Function:A function is a relation for which each value from the set the first
components of the ordered pairs is associated with exactly one value from the
set of second components of the ordered pair.
A function or mapping (Defined as f:X→Y) is a relationship from elements of
one set X to elements of another set Y (X and Y are non-empty sets).
X is called Domain and Y is called Codomain of function ‘f’.
Function ‘f’ is a relation on X and Y such that for each x∈X, there exists a
unique
y∈Y such that (x,y)∈R. ‘x’ is called pre-image and ‘y’ is called image of function f.
Classification of Functions:

1. Algebraic :

An algebraic function is one whose values are found by solving algebraic


equations. An algebraic equation is one that involves the four elementary
operations plus roots FINITELY many times (so no infinite series).

1. Transcendental:

In mathematics, a function not expressible as a finite combination of the


algebraic operations of addition, subtraction, multiplication, division, raising
to a power, and extracting a root. Examples include the functions log x,
sin x, cos x, ex and any functions containing them.

Ques 26 Give the types/ operations on functions.


Answer:
1.Injective / One-to-one function
A function f:A→B is injective or one-to-one function if for every b∈B, there exists
at most one a∈A such that f(s)=t.This means a function f is injective
if a1≠a2 implies f(a1)≠f(a2)

2.Surjective / Onto function


A function f:A→B is surjective (onto) if the image of f equals its range.
Equivalently, for every b∈B, there exists some a∈A such that f(a)=b. This means
that for any y in B, there exists some x in A such that y=f(x).
3.One to One(Bijective function):
A function f:A→B is bijective or one-to-one correspondent if and only if f is both
injective and surjective.

4.Inverse of a Function
The inverse of a one-to-one corresponding function f:A→B, is the function
g:B→A, holding the following property −
f(x)=y⇔g(y)=x
The function f is called invertible, if its inverse function g exists.

5.Identity Function:
An identity function, also called an identity relation or identity map or identity
transformation, is a function that always returns the same value that was used as
its argument. That is, for f being identity, the equality f(x) = x holds for all x.
6.Many one Functions:
If any two or more elements of set A are connected with a single element of set
B, then we call this function as Many one function.

Ques 27 Determine whether each of these functions is a bijective from R to


R.
f(x) = x2 + 1
f(x) = x3
f(x) = (x2.+ 1)(x2 + 2)
Answer:
Ques 28 If f: A → B, g: B → C are invertible functions, then show that g o
f: A → C is invertible and (g o f)-1 = f-1 o g-1.
Answer:
Ques 29 Explain the following :
Composition of functions
Recursive function
Primitive recursion
Answer:
Composition of functions:
function composition is an operation that takes two functions f and g and
produces a function h such that h(x) = g(f(x)). In this operation, the function g
is applied to the result of applying the function f to x. That is, the functions f : X →
Y and g : Y → Z are composed to yield a function that maps x in X to g(f(x)) in Z.
Recursive function
A recursive function is a function that calls itself during its execution
A recursive function is a function that calls itself, meaning it uses its own previous
terms in calculating subsequent terms.

Primitive recursion
The primitive recursive functions are among the number-theoretic functions,
which are functions from the natural numbers (nonnegative integers) {0, 1, 2, ...}
to the natural numbers. These functions take n arguments for some natural
number n and are called n-ary.
For example, addition and division, the factorial and exponential function, and the
function which returns the nth prime are all primitive recursive
Examples of primitive recursive functions include power, greatest common
divisor, and pn(the function giving the nth prime).

Ques 30 Write a short note on growth of functions.


Answer:
Asymptotic notation is useful because it allows us to concentrate on the main
factor determining a function's growth.
1.Big Oh Notation:
Big-oh notation (O notation) is widely used notation because it defines the worst
case or we can say it presents an asymptotically upper bound function. The
definition is:
O(g(n)) = { f(n) : there exist positive constants c,n0 such that
0 ≤ f(n) ≤ cg(n) for all n ≥ n0 }
O notation only gives upper bound so Θ is more powerful notation than O.
The growth of a function is determined by the highest order term: if you add a
bunch of terms, the function grows about as fast as the largest term (for large
enough input values).

2.Theta Notation:
The complexity function g(n) which complexity given by Θ(g(n)) (that is nothing
but set of functions), T(n) = Θ(h(n)) (pronounced theta), says that the growth rate
of T(n) equals (=) the
growth rate of h(n) [if T(n) = O(h(n)) and T(n) = Ω (h(n)]
the definition is:
Θ(g(n)) = { f(n) : there exist positive constants c1,c2 and n0 such that
0 ≤ c1g(n)≤ f(n) ≤ c2g(n) for all n ≥ n0 }
In above pictures, graph(a) presents Θ(theta) notation which says there will be
function f(n) which will always fall between/on c1g(n) and c2g(n) when n≥n0.
Here c1, c2, n0 are constants, and we can see in the graph at x = n0 where y = f(n)
always falls between y=c1g(n) and y=c2g(n).

3.Little Oh Notation:
Little oh notation (o notation) represents upper bound but may or may not be
asymptotically tight. Little oh notation will denote upper bound which is not
asymptotically tight,T(n) = o(p(n)) (pronounced little oh), says that the growth rate
of T(n) is less than the
growth rate of p(n) [if T(n) = O(p(n)) and T(n) ≠ Θ (p(n))].
definition is:o(g(n)) = { f(n) : there exist positive constants c> 0,n0> 0
such that 0 ≤ f(n) < cg(n) for all n ≥ n0 }
For example for 5n, T(n) = o(n2) but T(n) ≠ o(n)
Algebraic Manipulation of Boolean
Expressions, Simplification of
boolean Functions, Karnaugh Maps

Ques 16 Express each Boolean expression as SOP and then its


complete sum-of products form.
Answer:
Ques 17 Define a Boolean function of degree n. Simplify the
following Boolean expression using Karnaugh maps
xyz + xy’z + x’y’z + x’yz + x’y’z’
Answer:
Ques 18 Simplify the following Boolean functions using three
variable maps:
F(x,y,z) = ⅀(0,1,5,7)
F(x,y,z) = ⅀(1,2,3,6,7)
Answer:
Ques 19 Simplify the following Boolean function using K-
map:
F(x,y,z) = ⅀(0,2,3,7)
Answer:

Ques 20 Simplify the following Boolean expressions using


Kmap:
Y = ((AB)’ + A’ + AB)’
A’B’C’D’+A’B’C’D+A’B’CD+A’B’CD’ = A’B’
Answer:
Ques 21 Find the Boolean algebra expression for the following
system.

Answer:

Ques 22 Find the Sum-Of-Products and Product-Of-sum


expansion of the Boolean function F(x,y,z) = (x+y)z’.
Answer:

You might also like