To take use of OOP, which C++ header file should be included? Which (2) attribute allows for open recursion?

I need help with this C++ question Write a program that uses Stacks and/or Queues from the C++ Standard Template Library (STL) to reverse a word entered by the user (you cannot use arrays).

4. Implement the find() function for a Set STL data structure in C++ that takes an integer x as the parameter and returns true if x is present in the set. Otherwise, returns false.

Which link types of link list do not require a pointer to point at the starting element and still be able to access all the elements by traversing for C++?

use Advanced C++ techniques, containers and features to refactor the C/C++ algorithm. The purpose is toreplace appropriate declarations and code segments with Advanced C++ declarations and code. * Replace all arrays with appropriate STL containers. * Use STL algorithms to REPLACE existing logic where appropriate. * Use smart and move pointers where pointers are needed. * Use lambda expressions where appropriate. * Use C++ style casting when needed. * Look for opportunities where tuples could be used. * The code listing is in C and C++. If you don't understand someof the C code or C functions, please google. If there are logic or syntax problems, please fix. int Algorithm(int a[], int x, int y) { int p, i, j = x; p = y; for(int i=x; i < y; i++) { if(a[i] < a[p]) { swap(&a[i], &a[j]); j++; } } swap(&a[p], &a[j]); return j;}

What are some possible vulnerabilities with integers and functions in the C++ iostream library?

use Advanced C++ techniques, containers and features to refactor the C/C++ algorithm. The purpose is toreplace appropriate declarations and code segments with Advanced C++ declarations and code. * Replace all arrays with appropriate STL containers. * Use STL algorithms to REPLACE existing logic where appropriate. * Use smart and move pointers where pointers are needed. * Use lambda expressions where appropriate. * Use C++ style casting when needed. * Look for opportunities where tuples could be used. * The code listing is in C and C++. If there are logic or syntax problems, please fix. #define BIND(A,L,H) ((L)<(A)?(A)<(H)?(A):(H):(L)) char dih[50],dah[50],medium[30],word[30],*dd[2] = {dih,dah};const char *ascii = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789.,?'!/()&:;=+-_\"$@", *itu[] =...

: Implement a function void reverse( char* str) in C or C++ which reversesa null-terminated string.

Provide full C++ code Building a playlist (of songs) using a linked list and making some operations such as adding songs, removing songs, shuffling them, etc. (Some parts of this lab will closely follow lab 08 - it is imperative that you complete that lab before working on this project). A Node representing a song has the following data members (similar to struct Node of lab 08, except it doesn't have one member for storing data): string uniqueID string songName string artistName int songLength Node* nextNodePtr Your code must have the following three files: Playlist.h - Class declaration for a linked list of Nodes (very similar to lab 08 but with some changes to methods, as described below) with following private data members: private:Node* first;Node* last;int size; Playlist.cpp - Class definition main.cpp - main() function Checkpoint A For checkpoint A, you need to build a playlist (of songs) by readings data members of several songs from a file and printing them. Implement...

Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++. Please explain with detailed. Thank you!

use Advanced C++ techniques, containers and features to refactor the C/C++ algorithm. The purpose is toreplace appropriate declarations and code segments with Advanced C++ declarations and code. * Replace all arrays with appropriate STL containers. * Use STL algorithms to REPLACE existing logic where appropriate. * Use smart and move pointers where pointers are needed. * Use lambda expressions where appropriate. * Use C++ style casting when needed. * Look for opportunities where tuples could be used. * The code listing is in C and C++. If there are logic or syntax problems, please fix. char algorithm1(char c,int s){ if (isalpha(c)) { c = toupper(c); c = (((c - 65) + s) % 26) + 65; } return c;} int algorithm2(string input){ do { string output = ""; int shift = rand() % 26; for (int x = 0; x < input.length(); x++) output += algorithm1(input[x],shift); cout << output << endl; } while...

Write C++ code to display all even numbers in the a doubly linked list pointed to by Dlist. Use while loop to scan all nodes from the start to the end. (Each node has three fields: a data field that contains the information, and right and left fields contain pointers to nodes on either side. Ex. p->left represents the address of the node to the left of node p) (any number of nodes in the linked list) Dlist 4 3 8 HIIN 7 1