Exercise 1: Estimate 30 to 60 minutes.This must be done during the lab session.Based on the above program, create a function void reverseWord (string word),which accept word input (as string) and reverse the word using stack. Example: if input is"HELLO", the reverse word will be "OLLEH". Implement the function call from main.Exercise 2: Estimate 30 to 60 minutes.Using STL stack to check sequence of parenthesis input.Create a program to read input for the user a sequence of parenthesis input, {}(]() and checkwhether each parenthesis symbols are opened and closed perfectly using STL stack.Example run:Input: {([))}([}{}(0)TrueInput: {(}}False Part 1: Basic Stack. Using C++ Standard Template Library (STL)Discussion (requirement for STL):1. #include 2. Operations on stack s:a. s.empty() – determine whether the stack is empty.b. s.size() - how many items are in stack.c. s.push(t) - add t to the stack.d. s.pop() – remove the top element of the stack.e. s.top()- return the top element of the stack.Copy and paste the following program in your IDE, inspect the output and do the exercise.#include #include using namespace std;int main (){stack stackObj;stackobj.push ('A');stackobj.push ('B');stackobj.push ('C');stackobj.push ('D');cout <« "There are " << stackobj.size () << " object in the stack." << endl;cout << "The top item" << stackObj.top () << endl << endl;cout << "Time to take out from the stack:" << endl;while (!stackobj.empty ()) {cout <« "Popping: ";cout << stackobj.top () << endl;stackobj.pop ();cout << endl;cout << "There are<« stackobj.size () <« " object in the stack." << endl;return 03;

EXPLANATION: Make expression as a string which will be our input on which we will check for balanced…

Answered: This must be done during the lab…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

It is possible to demonstrate the return address of a function by using a series of instructions. Keep in mind that any modifications to the stack must not prohibit the process from returning control to the person who called it.
1. A company wants to evaluate employee records in order to lay off some workers on the basis of service time (the most recently hired employees are laid off first). Only the employee ids are stored in stack. Write a program using stack and implement the following functions: Main program should ask the appropriate option from the user, until user selects an option for exiting the program. Enter_company (emp_id)- the accepted employee id(integer) is pushed into stack. Exit_company ()- The recently joined employee will be laid off from the company Show employee ()- display all the employees working in the company. count()- displays the number of employees working in the company. i) ii) iii) iv)
Using the PEP 8 machine. Create a function that takes 2 arguments and returns a result. When I say function I mean that the parameters and the return value are passed on the stack . You code must have a function and a main program that calls the function using the stack. Assignment will not be accepted if you are not passing parameters and return value in the stack. Please note a complete "pass by stack" example is below. The function adds two numbers. Feel free to use that as starter code. The function you do should be one of three operations: 1) multiply - return the product of the two factors 2) divide - return the quotient ( integer arithmetic ) 3) remainder / modulo - return the remainder of the division of the two factors.
Complete the following ():a. A stack is used by the system when a function call is madeb. A stack can become full during program execution
stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).
Using c++ Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…
Practice recursion on lists Practice multiple base conditions Combine recursion call with and,or not operators Search for an element in a list using recursion Instructions In this lab, we will write a recursive function for searching a list of integers/strings. Write a recursive function to determine if a list contains an element. Name the function recursive_search(aList, value), where aList is a list and value if primitive type is the object we want to search for. Return a boolean, specifically True if and only if value is an element of aList else return False from the function Examples: recursive_search([1,2,3], 2) == True recursive_search([1,2,3], 4) == False recursive_search([ ], 4) == False recursive_search([ [ 1 ], 2 ], 1) == False # -----> (because the list contains [ 1 ] and 2, not 1) Hint: Think about what the base case is? When is it obvious that the element is not in the list? If we are not at the base case, how can you use the information about the first element of the…

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS