Question

Using Big O notation, indicate the time requirement of each of the following tasks in the...

Using Big O notation, indicate the time requirement of each of the following tasks in the worst case.

Computing the sum of the first n even integers by using a for loop

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Displaying all n integers in an array

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Displaying all n integers in a sorted linked chain

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Displaying all n names in an array of linked chains

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Displaying one array element

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Displaying the last integer in a linked chain

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Searching an array of n items for a particular value by using a sequential search

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Searching an array of n items for a particular value by using a binary search

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Adding an item to a stack of n items

           [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)         

Adding an item to a bag of n items

        [ Choose ] O(1) O(2n) O(n*log n ) O(2^n) O(log n) O(n^2) O(n) O(2) O(n^3)

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Answer :

Computing the sum of the first n even integers by using a for loop : O(n).

Displaying all n integers in an array : O(n).

Displaying all n integers in a sorted linked chain : O(n).

Displaying all n names in an array of linked chains : O(n).

Displaying one array element : O(1).

Displaying the last integer in a linked chain : O(n).

Searching an array of n items for a particular value by using a sequential search : O(n).

Searching an array of n items for a particular value by using a binary search : O(log n).

Adding an item to a stack of n items : O(1).

Adding an item to a bag of n items : O(1).

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Find the complexity of the algorithm using big O notation for each of the following tasks....
Find the complexity of the algorithm using big O notation for each of the following tasks. You must justify your answer. Insert a new element into an unsorted array Insert a new element into a sorted array Remove the minimum element in an unsorted array Remove the minimum element in a sorted array
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number...
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number in A and an O(log n)-time computation for each odd number in A. What is the best-case running time of Algorithm X? What is the worst-case running time of Algorithm X? 2. Given an array, A, of n integers, give an O(n)-time algorithm that finds the longest subarray of A such that all the numbers in that subarray are in sorted order. Your algorithm...
#data structures Give the appropriate execution time efficiency of the following array algorithms using Big-O notation....
#data structures Give the appropriate execution time efficiency of the following array algorithms using Big-O notation. Assume the size of the array is n. a)   Linear Search (average case)   ______________________    b)   Binary Search (worst case)       ______________________    c)   Insertion Sort (best case)       ______________________    d)   Insertion Sort (average case)           ______________________    e)   Quick Sort (average case)           ______________________
Given the following list of functions, determine the order of growth of each using big-Theta notation...
Given the following list of functions, determine the order of growth of each using big-Theta notation and put all the functions in order from slowest-growing to fastest-growing. Be sure to put functions of equal growth rate on the same level. Unless otherwise noted, you can assume all logarithms are base-2. 6nlog(2n)+8n 4n2log(log(8n))+8n2+n 500 n3+7nlog(n2) + 4n 2n+2n+1 log(4n2)+3n+1 12 8log(24n)+10 8n2log(5n2)+7n+200 4log(n3)+1000 100log(16n)log(n6)+23 8nlog(log(n4))+6n+32 9log(log(8n))
Analysing Asymptotic Bounds (Marks: 3) Prove the following using the definition of asymptotic order notation. Example:...
Analysing Asymptotic Bounds (Marks: 3) Prove the following using the definition of asymptotic order notation. Example: 15n 3 + 10n 2 + 20 ∈ O(n3 ) Hint: Consider C = 15 + 10 + 20 = 45 and n0 := 1. Then 0 ≤ 12n 3 + 11n 2 + 10 ≤ Cn3 for all n ≥ n0. a) n 2 + 3n 2 /(2+cos(n)) ∈ O(n 2 ) b) 2n 2 (log n) ∈ Ω(n(log n) 2 ) c)...
What is the complexity of this algorithm? Assign each student in the class a number from...
What is the complexity of this algorithm? Assign each student in the class a number from 1 to n, where n is the number of students. Then ask each of the odd-numbered students whether he or she is left-handed. a. O(1) b. O(n) c. O(n ^ 2) d. O(log n) What is the complexity of this algorithm? In a very difficult CS class, half the n students who originally signed up drop the course after the first quiz. After each...
1) Put these integers into a binary search tree and then state the output of a...
1) Put these integers into a binary search tree and then state the output of a preorder traversal. Put EXACTLY ONE SPACE between each integer, so your output looks like this: 1 2 3 4 5 These are the integers to put into the tree: 41 17 80 25 8 11 50 60 100 Output: ____ 2) Put these integers into a binary search tree and then state the output of a preorder traversal. Put EXACTLY ONE SPACE between each...
Suppose that you want to add items to an array such that the items are always...
Suppose that you want to add items to an array such that the items are always ordered in ascending order; e.g., [1, 2, 2, 4, 5, 8, 9, 14, 32], and any duplicate values are adjacent to each other. We haven’t talked about sorting algorithms yet, so assume you want to be able to keep the items in the array in order without having to sort them. So for example, suppose you want to add the integer value 7 to...
Present the running time (in terms of Big-Oh notation) of the operations search, insert, delete, print...
Present the running time (in terms of Big-Oh notation) of the operations search, insert, delete, print all elements, find median, find min/max, successor while implementing a dictionary ADT using (1) Unsorted arrays (2) sorted arrays (3) Balanced BST.
Data Structures using C++ Searching a Linked List Here are the declarations for a simple unsorted...
Data Structures using C++ Searching a Linked List Here are the declarations for a simple unsorted linked list of ints that ends in a null pointer. //=============================================================== class Cell { friend class UList; private: int data; Cell* next; Cell( int dt, Cell* nx=nullptr ) : data(dt), next(nx) {} }; //=============================================================== class UList { private: Cell* head = nullptr;    // stationary head pointer. Cell* scan = nullptr;          // for walking down the List. Cell* follow = nullptr; public: void find( int...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT