Function foo and two pointers p,sp are given below.63 template64 void foo(shared_ptr ptr)65 {66*ptr = T();67 }68 auto p= new int();make_shared();69 auto sp• Are the following function calls legal?• Any memory leak for each function call?Briefly explain your answers.(a) foo(sp);Enter your answer here(b) foo(p);Enter your answer here(c) foo(shared_ptr(p));Enter your answer here

Let’s say, you call a function named sum from main. In this case, main is the ‘calling’ function and…

Answered: ate Foo(shared_ptr ptr) otr = TO:

Engineering

Computer Science

ate Foo(shared_ptr ptr) otr = TO:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

C++ Data Structure:Create an AVL Tree C++ class that works similarly to std::map, but does NOT use std::map. In the PRIVATE section, any members or methods may be modified in any way. Standard pointers or unique pointers may be used.** MUST use given Template below: #ifndef avltree_h#define avltree_h #include <memory> template <typename Key, typename Value=Key> class AVL_Tree { public: classNode { private: Key k; Value v; int bf; //balace factor std::unique_ptr<Node> left_, right_; Node(const Key& key) : k(key), bf(0) {} Node(const Key& key, const Value& value) : k(key), v(value), bf(0) {} public: Node *left() { return left_.get(); } Node *right() { return right_.get(); } const Key& key() const { return k; } const Value& value() const { return v; } const int balance_factor() const {…
typedef struct node_t node_t; struct node_t { }; int32_t value; node_t* next; node_t* insert (node_t* list, int32_t v, int32_t* flag); 3) As you may have noticed from MT1, Howie is lazy. He wants you to write the interface for the following implementation of function copy_to_linked_list. He really appreciates your help! /* copy_to_linked_list int32_t copy_to_linked_list (int32_t a[], int32_t size, node_t** list_p) { int32_t flag, i; for (i = 0; i < size; ++i) { *list_p = insert (*list_p, a[i], &flag); if (-1== flag) return -1; } return 0;
Which of the following statements is NOT correct? Group of answer choices C++ language provides a set of C++ class templates to implement common data structures, which is known as Standard Template Library (STL); In STL, a map is used to store a collection of entries that consists of keys and their values. Keys must be unique, and values need not be unique; In STL, a set is used to store a collection of elements and it does not allow duplicates; Both set and map class templates in STL are implemented with arrays.
1. Write a function invert_dict to reverse a dictionary, for example: >>> eng2sp = {'one': 'uno', 'two': 'dos', 'three': 'tres'} >>> sp2eng = invert_dict(eng2sp) >>> sp2eng {'uno':'one', 'dos':'two', 'tres':'three'} 2. Write a function print_dict to print all the key-values in a dictionary, for example: >>> d2 {'a': 'one', 'b': 'two', 'c': 'Three'} >>> print_dict(d2) a:one b:two c:Three
#include <iostream>//#include <vector> using namespace std; class Vec {public:Vec() {sz = 0;cap = 1;p_arr = new int[cap];} int size(){return this->sz;}int capacity(){return this->cap;}void reserve( int n ){// TODO:// (0) check the n should be > size, otherwise// ignore this action.if ( n > sz ){// (1) create a new int array which size is n// and get its address//cout << "Adress:"<< &n << endl;int *newarr = new int [n];//cout << "Address: " << newarr << endl; // location // (2) use for loop to copy the old array to the// new arrayfor(int i = 0; i < sz; i++){newarr[i] = p_arr[i];}// (3) update the variable to the new addressthis->cap=n; // (4) delete old arraydelete[] newarr;}}void push_back( int v ){// TODO:if ( sz == cap ){ cap *= 2; reserve(cap);}p_arr[sz++] = v;// complete others}int at(int idx){return this->p_arr[idx];}private://vector<int> arr;int *p_arr;int sz = 0;int cap = 0; }; int main(){Vec v;…
C:/Users/r1821655/CLionProjects/untitled/sequence.cpp:48:5: error: return type specification for constructor invalidtemplate <class Item>class sequence{public:// TYPEDEFS and MEMBER SP2020typedef Item value_type;typedef std::size_t size_type;static const size_type CAPACITY = 10;// CONSTRUCTORsequence();// MODIFICATION MEMBER FUNCTIONSvoid start();void end();void advance();void move_back();void add(const value_type& entry);void remove_current();// CONSTANT MEMBER FUNCTIONSsize_type size() const;bool is_item() const;value_type current() const;private:value_type data[CAPACITY];size_type used;size_type current_index;};} 48 | void sequence<Item>::sequence() : used(0), current_index(0) { } | ^~~~ line 47 template<class Item> line 48 void sequence<Item>::sequence() : used(0), current_index(0) { }
#include <iostream> #include <string> #include <cstdlib> using namespace std; template<class T> class A { public: T func(T a, T b){ return a/b; } }; int main(int argc, char const *argv[]) { A <float>a1; cout<<a1.func(3,2)<<endl; cout<<a1.func(3.0,2.0)<<endl; return 0; } Give output for this code.
C++ Given code #include <iostream>using namespace std; class Node {public:int data;Node *pNext;}; void displayNumberValues( Node *pHead){while( pHead != NULL) {cout << pHead->data << " ";pHead = pHead->pNext;}cout << endl;} //Option 1: Search the list// TODO: complete the function below to search for a given value in linked lsit// return true if value exists in the list, return false otherwise. ?? linkedlistSearch( ???){ } //Option 2: get sum of all values// TODO: complete the function below to return the sum of all elements in the linked list. ??? getSumOfAllNumbers( ???){ } int main(){int userInput;Node *pHead = NULL;Node *pTemp;cout<<"Enter list numbers separated by space, followed by -1: "; cin >> userInput;// Keep looping until end of input flag of -1 is givenwhile( userInput != -1) {// Store this number on the listpTemp = new Node;pTemp->data = userInput;pTemp->pNext = pHead;pHead = pTemp;cin >> userInput;}cout <<"…
Operator__________ can be used to downcast base-class pointers safely
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
5- int arr[4]= {2, 4, 5, 3); for (int i= 0; i<4; i++) cout<
write a complete member function in class set defined by you in this code to count number of elements in intersection between 2 sets : the code is ::: using C++ Programming #include <iostream> using namespace std; class Set{int n,set[10]; public: void create (){cout<<"Enter Number Of Elements:";cin>>n;int val;cout<<"Enter Elements in set:"<<endl;cin>>set[0];for (int i=1;i<n;i++){cin>>val;for (int j=0;j<i;j++){if (set[j]==val){i--;break;}else{set[i]=val;}}}cout<<"Set Created"<<endl;} void display (){for (int i=0;i<n;i++){cout<<set[i]<<" ";}cout<<endl;} void setUnion (Set *s2){Set s3;int x=0,y=0,z=0;while (x<n && y<s2->n){if (set[x]<(*s2).set[y]){s3.set[z]=set[x];x++;z++;}else if (set[x]==(*s2).set[y]){s3.set[z]=set[x];x++;y++;z++;}else{s3.set[z]=(*s2).set[y];y++;z++;}}while (x<n){s3.set[z]=set[x];x++;z++;}while (y<(*s2).n){s3.set[z]=(*s2).set[y];y++;z++;}s3.n=z;s3.display ();}…