EBK DATA STRUCTURES AND ALGORITHMS IN C
EBK DATA STRUCTURES AND ALGORITHMS IN C
4th Edition
ISBN: 9781285415017
Author: DROZDEK
Publisher: YUZU
bartleby

Videos

Question
Book Icon
Chapter 2, Problem 1E

a) f(n) is O(1)

Program Plan Intro

Asymptotic Notations:

For asymptotic analysis of algorithms, some mathematical tools are used to represent time complexity of algorithm, such mathematical tools are known as Asymptotic notations. Some of the asymptotic notations are described below:

Big-O:

A function  “g(n)” is O(f(n)) if there exists a constant c > 0 such that “cf(n)” grows faster than "g(n)" for all n>=n0 , that is, “g(n)” is O(f(n)) iff for some constants “c” and “n0”  , g(n)<=cf(n) for all n>=n0. Here, “f(n)” denotes the upper bound for “g(n)”. The above statement can be read as follows :

  • “n” is the data set size.
  • “f(n)” denotes a function that is calculated while taking n as the parameter.
  • O(f(n)) means that curve denoted by “f(n)” is an upper bound for a function’s need for resources.

Big Theta:

A function  “g(n)” is Θ(f(n)) iff two positive constants “c1” and “c2” and a positive integer n0 exists such that c1f(n)g(n)c2f(n) for all n>=n0, that is, “f(n)” denotes the exact bound for “g(n)”, which denotes that the growth rate of “g(n)” and “f(n)” are equal. The above statement can be read as follows :

  • “n”  is the data set size.
  • “f(n)” denotes a function that is been calculated taking n as the parameter.
  • Θ(f(n)) means that curve denoted by “f(n)”  is an exact bound for the resource needs of a function.

a) f(n) is O(1)

Expert Solution
Check Mark

Explanation of Solution

Explanation:

The function "f(n)" is O(1) means that constant “c” denotes the upper bound for the function "f(n)".

Hence, function "f(n)"  would never exceed the value of a certain constant “c”.

b) f(n) is Θ(1)

Explanation of Solution

Explanation:

The function "f(n)" is Θ(1) means that the constant “c” denotes the exact bound for the function "f(n)" .

Hence, function "f(n)"  would be a constant function.

c) f(n) is nO(1)

Explanation of Solution

Explanation:

The function "f(n)" isnO(1) means that function "f(n)" would never exceed the value of power function nc for any constant “c”.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.
Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…
What did you find most interesting or surprising about the scientist Lavoiser?
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
Boolean Algebra - Digital Logic and Logic Families - Industrial Electronics; Author: Ekeeda;https://www.youtube.com/watch?v=u7XnJos-_Hs;License: Standard YouTube License, CC-BY
Boolean Algebra 1 – The Laws of Boolean Algebra; Author: Computer Science;https://www.youtube.com/watch?v=EPJf4owqwdA;License: Standard Youtube License