Homework Answers
Inserting back of vector will take constant time
Removing from the front of a deque is linear time
Inserting to the back of a deque is constant time
Removing from the front of a linked list is constant time
Add Answer to:
4. (2 pts) For each operation below indicate if it will take constant time (i.e. O(1))...
Match each problem to the time complexity class it likely belongs to: 1. O(1): Constant 2....
Match each problem to the time complexity class it likely belongs to: 1. O(1): Constant 2. O(n): Linear 3. O(n!): Factorial 4. O(logn): Logarithmic 5.O(n2): Quadratic 6. O(n3): Cubic OPTIONS: a. Find an element in an unsorted array b. Shortest path between two nodes in a graph c. Matrix multiplication d. Generate permutations of a string e. Add an element to the front of a linked list f. Find an element in a binary search tree
Complete the following table by identifying the Big-O complexity of the operation when performed on each...
Complete the following table by identifying the Big-O
complexity of the operation when performed on each data structure
as implemented by the C++ Standard Template Library (STL). Select
"Not Available" if the STL does not support the
operation.
This is only for std::list<T> (Doubly Linked
List)
Operation Description std::array<T> (Fixed Sized Vector) std::vector<T> (Extendable Sized Vector) std::forward_list<T> (Singly Linked List) std::list<T> (Doubly Linked List) default construction create container with no arguments empty checks whether the container is empty size returns...
True or false for each, and explain why (4 pts) The height of a binary tree is bounded by O(n2), where n is the size...
True or false for each, and explain why
(4 pts) The height of a binary tree is bounded by O(n2), where n is the size of the C. tree. d. (4 pts) dynamic array and O(1) time if L is a linked list. Given a list L of n > 2 elements, the following code takes O(n) time if L is a iterator i = L. iterator () i.next); i.next); i.remove ); binary tree T that has size n and...
1) (10 pts) What are the worst case run times of each of the following operations?...
1) (10 pts) What are the worst case run times of each of the following operations? Make sure to list your answer in terms of the appropriate variables in the prompt. Note that on occasion, some of the run times won't be dependent on some of the variables listed in the prompt. (a) Inserting an item to the front of a linked list of n elements. (b) Sorting n integers using Quick Sort. (c) Merging a sorted list of a...
(Deque) A deque is a data structure consisting of a list of items on which the...
(Deque) A deque is a data structure consisting of a list of items on which the following operations are possible: a. push (x) : Insert item x on the front end of the deque. b. pop ): Remove the front item from the deque and return it. c. inject(x): Insert item x on the rear end of the deque. d. eject ): Remove the rear item from the deque and return it. Write routines to support the deque that take...
Simple test in text: int main() { Deque dq1; cout << dq1.empty() << " - 1"...
Simple test in text:
int main()
{
Deque dq1;
cout << dq1.empty() << " - 1" << endl;
dq1.insertFront(42);
dq1.insertBack(216);
cout << dq1.peekFront() << " - 42" << endl;
cout << dq1.peekBack() << " - 216" << endl;
cout << dq1.size() << " - 2" << endl;
Deque dq2(dq1);
Deque dq3;
dq3 = dq1;
cout << dq1.removeFront() << " - 42" << endl;
cout << dq1.removeBack() << " - 216" << endl;
cout << dq2.peekFront() << " - 42" <<...
Use the header and other files listed below for problems 1 and 2. Each problem has...
Use the header and other files listed below for problems 1 and 2. Each problem has 3 files that correspond to the problem. Problem 1, linked list deque and bag implementations. First, complete the linked list implementation of the deque and bag ADTs in C language. To do this, implement all functions with the // FIXME... comments in linkedList.c (File included below). These functions listed are the ones that need to be fixed. init addLinkBefore removeLink linkedListAddFront linkedListAddBack linkedListFront linkedListBack...
1. State and explain the definition of big-O. 2. Explain why we use big-O to compare...
1. State and explain the definition of big-O. 2. Explain why we use big-O to compare algorithms. 3. Explain why binary search runs in O(log n) time. 4. Under what conditions is it possible to sort a list in less than O(nlog n) time? 5. List and explain the worst-case and average-case running times for each Vector method below: (a) insert(iterator here, Object item) (b) insertAtHead (c) insertAtTail (aka push back) (d) get(iterator here) (e) get(index i) (f) remove(iterator here)...
Template Deque Class (C++) In this assignment, we will use a given test menu for the template Deq...
Template Deque Class (C++)
In this assignment, we will use a given test menu for the
template Deque Class (a Linked List based Double Ended Queue,
Deque) that you have put together.
Recommended Steps
testDeque.cpp :
// C++ implementation of doubly linked list Deque doubly linked
list
#include <bits/stdc++.h>
using namespace std;
class Timer {
// To replace with the full timer class definition
// inside this folder: LearnCpp9_18_timeSortArray.cpp
};
// Node of a doubly linked list
template<class T>
class...
1. (10 points) Write an efficient iterative (i.e., loop-based) function Fibonnaci(n) that returns the nth Fibonnaci...
1. (10 points) Write an efficient iterative (i.e., loop-based) function Fibonnaci(n) that returns the nth Fibonnaci number. By definition Fibonnaci(0) is 1, Fibonnaci(1) is 1, Fibonnaci(2) is 2, Fibonnaci(3) is 3, Fibonnaci(4) is 5, and so on. Your function may only use a constant amount of memory (i.e. no auxiliary array). Argue that the running time of the function is Θ(n), i.e. the function is linear in n. 2. (10 points) Order the following functions by growth rate: N, \N,...
Complete the following table by identifying the Big-O
complexity of the operation when performed on each data structure
as implemented by the C++ Standard Template Library (STL). Select
"Not Available" if the STL does not support the
operation.
This is only for std::list<T> (Doubly Linked
List)
Operation Description std::array<T> (Fixed Sized Vector) std::vector<T> (Extendable Sized Vector) std::forward_list<T> (Singly Linked List) std::list<T> (Doubly Linked List) default construction create container with no arguments empty checks whether the container is empty size returns...
True or false for each, and explain why
(4 pts) The height of a binary tree is bounded by O(n2), where n is the size of the C. tree. d. (4 pts) dynamic array and O(1) time if L is a linked list. Given a list L of n > 2 elements, the following code takes O(n) time if L is a iterator i = L. iterator () i.next); i.next); i.remove ); binary tree T that has size n and...
1) (10 pts) What are the worst case run times of each of the following operations? Make sure to list your answer in terms of the appropriate variables in the prompt. Note that on occasion, some of the run times won't be dependent on some of the variables listed in the prompt. (a) Inserting an item to the front of a linked list of n elements. (b) Sorting n integers using Quick Sort. (c) Merging a sorted list of a...
(Deque) A deque is a data structure consisting of a list of items on which the following operations are possible: a. push (x) : Insert item x on the front end of the deque. b. pop ): Remove the front item from the deque and return it. c. inject(x): Insert item x on the rear end of the deque. d. eject ): Remove the rear item from the deque and return it. Write routines to support the deque that take...
Simple test in text:
int main()
{
Deque dq1;
cout << dq1.empty() << " - 1" << endl;
dq1.insertFront(42);
dq1.insertBack(216);
cout << dq1.peekFront() << " - 42" << endl;
cout << dq1.peekBack() << " - 216" << endl;
cout << dq1.size() << " - 2" << endl;
Deque dq2(dq1);
Deque dq3;
dq3 = dq1;
cout << dq1.removeFront() << " - 42" << endl;
cout << dq1.removeBack() << " - 216" << endl;
cout << dq2.peekFront() << " - 42" <<...
Template Deque Class (C++)
In this assignment, we will use a given test menu for the
template Deque Class (a Linked List based Double Ended Queue,
Deque) that you have put together.
Recommended Steps
testDeque.cpp :
// C++ implementation of doubly linked list Deque doubly linked
list
#include <bits/stdc++.h>
using namespace std;
class Timer {
// To replace with the full timer class definition
// inside this folder: LearnCpp9_18_timeSortArray.cpp
};
// Node of a doubly linked list
template<class T>
class...
1. (10 points) Write an efficient iterative (i.e., loop-based) function Fibonnaci(n) that returns the nth Fibonnaci number. By definition Fibonnaci(0) is 1, Fibonnaci(1) is 1, Fibonnaci(2) is 2, Fibonnaci(3) is 3, Fibonnaci(4) is 5, and so on. Your function may only use a constant amount of memory (i.e. no auxiliary array). Argue that the running time of the function is Θ(n), i.e. the function is linear in n. 2. (10 points) Order the following functions by growth rate: N, \N,...
Most questions answered within 3 hours.
-
find the critical value associated with a right sided hypothesis of
the mean using a sample...
asked 1 hour ago -
Which of the following statements is true with respect to a
simple linear regression model?
a....
asked 2 hours ago -
The energy required to remove an electron from a surface of a
solid element is called...
asked 3 hours ago -
How would you train your employees to avoid risks of using
mobile devices?
asked 4 hours ago -
Assume Kw = 1.01 ✕ 10−14
For pure water, we can calculate [H3O+ ] = [OH...
asked 5 hours ago -
Suppose that on a temperature scale X, water boils at 203.0°X
and freezes at -105.7°X. What...
asked 5 hours ago -
BaS crystallizes in a cubic unit cell with S2- ions on each
corner and each face....
asked 6 hours ago -
A. 0≤P(Oi)≤10≤P(Oi)≤1 for each i
B. P(Oi)≤0P(Oi)≤0
C. P(Oi)=1+P(OCi)P(Oi)=1+P(OiC)
D. P(Oi)≥1P(Oi)≥1
If an experiment consists of...
asked 7 hours ago -
A battery has an emf of 9.20V and an internal resistance of 1.20
ohm. a)What resistance...
asked 7 hours ago -
The area of an elastic circular loop decreases at a constant
rate, dA/dt = −6.60×10−3 m2/s...
asked 9 hours ago -
The denaturation of proteins can be described by the
equilibrium
F⇌U
where F and U represent...
asked 10 hours ago -
Please answer what the maximum and minimum force is, and the
angle on the ion is...
asked 10 hours ago