Problem 1: Create a deck of 52 cards without repetition and insert in a template Stack Array.

Write a virtual base class having two derived class one for StackFullException and other for

StackEmptyException. Catch the errors when the array is empty or out of bound.

Problem 2: Create a template Stack Array of unlimited size based on tight strategy and another

based on growth strategy. Show in the tight strategy total cost is O(n

2

/c) where c is the size of

expanded array when full, and the total cost in growth strategy is

(4n-1).

Problem 3. Convert the following infix expression to a prefix expression by Stack operation.

A + B* C + (D^E) * F/G/H + I

Evaluate the value of prefix expression when A=5, B=10, C=3, D=12, E=3, F=5, G=8, H=4,

I=100

need code for this in c++

Ausm.instructure.com Online C+Compiler online editor Get Homework Help With Chegg Study Chegg... X Files YouTube Take a screenshot on your Mac - Apple Support +. Homework CSC 307/2146) deadline by midnight of 4th March 2020.docx Download Info X Close 0 - ZOOM + Akhil Sai Nelakuditi Dashboard Courses Homework 19h February 2020 CSC 307 (Class 2146) The deadline of submission is by midnight 4th March 2020. Those who submit homework by 8.00 am of 3rd March 2020 would have extra credits. Calendar - Inbox Problem 1: Create a deck of 52 cards without repetition and insert in a template Stack Array. Write a virtual base class having two derived class one for StackFullException and other for StackEmptyException. Catch the errors when the array is empty or out of bound. Problem 2: Create a template Stack Array of unlimited size based on tight strategy and another based on growth strategy. Show in the tight strategy total cost is O(ne) where c is the size of expanded array when full, and the total cost in growth strategy is 0 (4n-1). Problem 3. Convert the following infix expression to a prefix expression by Stack operation. A+B* C+ (DE) * F/G/H-I Evaluate the value of prefix expression when A=5, B=10, C=3, D=12, E=3, F=5, G=8, H=4, 1=100 Ausm.instructure.com Online C+Compiler online editor Get Homework Help With Chegg Study Chegg... X Files YouTube Take a screenshot on your Mac - Apple Support +. Homework CSC 307/2146) deadline by midnight of 4th March 2020.docx Download Info X Close 0 - ZOOM + Akhil Sai Nelakuditi Dashboard Courses Homework 19h February 2020 CSC 307 (Class 2146) The deadline of submission is by midnight 4th March 2020. Those who submit homework by 8.00 am of 3rd March 2020 would have extra credits. Calendar - Inbox Problem 1: Create a deck of 52 cards without repetition and insert in a template Stack Array. Write a virtual base class having two derived class one for StackFullException and other for StackEmptyException. Catch the errors when the array is empty or out of bound. Problem 2: Create a template Stack Array of unlimited size based on tight strategy and another based on growth strategy. Show in the tight strategy total cost is O(ne) where c is the size of expanded array when full, and the total cost in growth strategy is 0 (4n-1). Problem 3. Convert the following infix expression to a prefix expression by Stack operation. A+B* C+ (DE) * F/G/H-I Evaluate the value of prefix expression when A=5, B=10, C=3, D=12, E=3, F=5, G=8, H=4, 1=100