Define big theta notation, Data Structure & Algorithms

Define Big Theta notation

Big Theta notation (θ): The upper and lower bound for the function 'f' is given by the big oh notation (θ). Considering 'g' to be a function from the non-negative integers to the positive real numbers, we describe θ(g) as the set of function f  such that  for some real constant c1 and c2 >0 and some non negative integers constant n0 , c1g(n)≤f f(n)≤c2g(n) for all n≥n0.  Mathematically, θ(g(n))={f(n): there exists positive constants c1 and c2 like that c1g(n)≤f f(n)≤c2g(n) for all n, n≥n0} , we say "f is oh of g"

 

Posted Date: 5/10/2013 3:12:47 AM | Location : United States







Related Discussions:- Define big theta notation, Assignment Help, Ask Question on Define big theta notation, Get Answer, Expert's Help, Define big theta notation Discussions

Write discussion on Define big theta notation
Your posts are moderated
Related Questions
Draw the process flow diagram: Anand   Dairy (AD) sources 150,000 litres of milk daily from large number of local villagers .The milk is collected from 4:00 AM to 6:00 am and

The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

Binary search technique:-  This technique is applied to an ordered list where elements are arranged either in ascending order or descending order. The array is separated into t

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

A striking application of DFS is determine a strongly connected component of a graph. Definition: For graph G = (V, E) , where V refer to the set of vertices and E refer to the

one to many one to one many to many many to one

With the help of a program and a numerical example explain the Depth First Traversal of a tree.

Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Question 1. How can you find out the end of a String? Write an algorithm to find out the substring of a string. 2. Explain the insertion and deletion operation of linked lis

A useful tool which is used for specifying the logical properties of a data type is called the abstract data type or ADT. The term "abstract data type" refers to the fundamental ma