int count; int entry[MAX]; Write the following functions that do not belong to the class: (a) Function int size(Stack &s) leaves the Stack s unchanged and returns a count of the number of entries in the Stack. (b) Function void deleteAll(Stack &s, stackEntry x) deletes all occurrences (if any) of x from s and leaves the remaining entries in s in the same relative order.

int count; int entry[MAX]; Write the following functions that do not belong to the class: (a) Function int size(Stack &s) leaves the Stack s unchanged and returns a count of the number of entries in the Stack. (b) Function void deleteAll(Stack &s, stackEntry x) deletes all occurrences (if any) of x from s and leaves the remaining entries in s in the same relative order.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

#include <iostream>using namespace std;class st{private:int arr[100];int top;public:st(){top=-1;}void push(int ItEM) {top++;arr[top]=ItEM; }bool ise() {return top<0;} int pop(){int Pop;if (ise()) cout<<"Stack is emptye ";else{Pop=arr[top];top--;return Pop;}}int Top(){int TOP;if (ise()) cout<<" empty ";else {TOP=arr[top];return TOP;}}void screen(){ for (int i = 0; i <top+1 ; ++i) {cout<<arr[i];} }};int main() {st c;c.push(1);c.push(2);c.push(3);c.push(4);c.pop();c.push(5);c.screen();return 0;} alternative to this code??
C++ Code /////// #include <iostream> class BTNode {public:int item;BTNode *left;BTNode *right;BTNode(int i, BTNode *l=nullptr, BTNode *r=nullptr):item(i),left(l),right(r){}}; BTNode *root = nullptr; void insert(int i) {//implement code here} int main(){insert (5);insert (10);insert (1);if (root){std::cout << "root = " << root->item << std::endl;if (root->left)std::cout << "root->left = " << root->left->item << std::endl;if (root->right)std::cout << "root->right = " << root->right->item << std::endl;}return 0;}
PROGRAMMING LANGUAGE: C++ // vectors: overloading operators example#include <iostream>using namespace std;class counter{private:int count;public:counter():count(0){}counter(int c):count(c) {} int get_count(){return count;} counter operator++ (int){return counter(count++); } counter operator-- (int){return counter(count--);}};int main(){counter c1, c2, c3;c1++;c2--;cout<<'\n'<<c1.get_count();cout<<'\n'<<c2.get_count();cout<<endl;c3 = c1++;cout<<'\n'<<c1.get_count();cout<<'\n'<<c3.get_count();getch();return 0;} Go through the above code and write the output of the given code segment. counter c1(5), c2(10), c3;c3=c1++;c2=--c3;;cout<<”\n”<<c1.get_count();cout<<”\n”<<c2.get_count();cout<<”\n”<<c3.get_count();
C++ ProgrammingActivity: Deque Linked List Explain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) {     DLLDeque* deque = new DLLDeque();     int test;     cin >> test;     //Declarations     int tempnum;     int num;     int sum;     int count;     bool addfirst = false;     bool addlast = false;     bool remfirst = false;     bool remlast = false;     switch (test) {         case 0:         //Implementation             do{                 cin >> num;                 if(num == 0){                     break;                 }                                  //Reset                 tempnum = num;                 count = 0;                 sum = 0;                 addfirst = false;                 addlast = false;                 remfirst = false;                 remlast =…
C++ Program #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() { return (rand() % 100);} class Node {public: int data; Node* next;}; class LinkedList{public: LinkedList() { // constructor head = NULL; } ~LinkedList() {}; // destructor void addNode(int val);   void addNodeSorted(int val);   void displayWithCount(); int size();   void deleteAllNodes();   bool exists(int val);private: Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){       if (head == NULL) { return false; } else { Node* temp = head; while (temp != NULL) {              if(temp->data == val){               return true;           } temp = temp->next; } }   return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){       if (head == NULL) {       cout << "List is empty, No need to delete…
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data;     Node next;   Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
Object Oriented Programing: Create a class template for a class named GeneralStackthat holds • A single data member as an array named stack of size 50 to store certain elements • Three member functions i.e. push(type) to add elements in the Stack, pop() to remove elements from the stack, and currentStatus() to check whether the array is filled or not. (A filled array is an array that has non-zero value at all of its indexes). In the main() function, create three objects with different data types of class General Stack and test the functionality of member functions for various values of data members for these objects.
Data Structure & Algorithum java program Do the following: 1) Add a constructor to the class "LList" that creates a list from a given array of objects.2) Add a method "addAll" to the "LList" class that adds an array of items to the end of the list. The header of the method is as follows, where "T" is the generic type of the objects in the list. 3) Write a Test/Driver program that thoroughly tests all the methods in the class "LList".
Course: Data Structure and Algorithms Language: C++ Question is well explained Question #2Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below: class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); public bool removeSecondLastValue (); public void findMiddleValue(); public void display(); };
// JAVA program to calculate the average score // import utility class for list collectionimport java.util.*; // class definitionpublic class Main{// main methodpublic static void main(String[] args) { // Variable declarationchar middle_initial;int id;double score1, score2, score3, average;String first_name, last_name, choice; // Scanner to read user inputsScanner sc = new Scanner(System.in); // integer counter to count number of studentsint counter = 0; // run a do-while loop until the user enters N or Nodo{// prompt user to enter first name, middle initial, and last nameSystem.out.print("Enter student's First Name:");first_name = sc.next();System.out.print("Enter student's Middle Initial:");middle_initial = sc.next().charAt(0);System.out.print("Enter student's Last Name:");last_name = sc.next(); // Add fullName of student in the Name listName.add(first_name + "." + middle_initial + "." + last_name); // enter idSystem.out.print("Enter student's Id:");id = sc.nextInt(); // add Id…
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java and attach output screen with program: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: classBSTNode { Node left; Node right; int data; publicBSTNode(int _data);// assign data to_data and assign left and right node to null } class BST { BSTNoderoot; public BST();// assign root to null void insert(int data);// this function insert the data in tree which maintain property of BST boolean Search(int key); this function search the data in bst and return true if key is found else return false public void EvenPrint(Node n)// this function only print the data which are even, make this function resursive public void OddPrint(Node n)// this function only print the data which are odd, make this function resursive public void PrimePrint(Node n)// this function only…
Write JAVA code General Problem Description: It is desired to develop a directory application based on the use of a double-linked list data structure, in which students are kept in order according to their student number. In this context, write the Java codes that will meet the requirements given in detail below. Requirements: Create a class named Student to represent students. In the Student class; student number, name and surname and phone numbers for communication are kept. Student's multiple phones number (multiple mobile phones, home phones, etc.) so phone numbers information will be stored in an “ArrayList”. In the Student class; parameterless, taking all parameters and It is sufficient to have 3 constructor methods, including a copy constructor, get/set methods and toString.