Use a stack implementation, to check that a given an arithmetic expression, that uses braces “{“ & ”}” or parenthesis ”(“ &, ”)” or brackets ”[“ & ”]” as grouping symbols, is using them in a matching and balanced way. Hint: The book has an example function, called isBalance( ), that takes the input string as an argument and returns 0 if it is unbalanced or 1 if it is balanced. (Examples below are given only for illustrative purposes, you may come up with your own.)

Use a stack implementation, to check that a given an arithmetic expression, that uses braces “{“ & ”}” or parenthesis ”(“ &, ”)” or brackets ”[“ & ”]” as grouping symbols, is using them in a matching and balanced way. Hint: The book has an example function, called isBalance( ), that takes the input string as an argument and returns 0 if it is unbalanced or 1 if it is balanced. (Examples below are given only for illustrative purposes, you may come up with your own.)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a JAVA program to find maximum sum subarray such that start and end values are same for instance given arr = [9, 9,1,1,10,2,4,10] output: Subarray : (9, 9) sum= 18Subarray : (1, 1) sum= 2Subarray : (10, 2, 4, 10) sum= 26 The Subarray with the largest sum is : (10, 2, 4, 10) and the Sum is : 26
Develop a brute-force algorithm that finds the longest common sequential elements of two given lists with the Java programming language. For example, the following two lists are given: S1 = [B,C,D,A,A,C,D] S2 = [A,C,D,B,A,C] Common lists are: [B,C], [C,D,A,C], [D,A,C], [A,A,C], [A,C], [C,D], … Note that although both lists have a common [C,D,A,C] (sub)list, both list items are skipped and the left-to-right order is intact. Apply the brute force algorithm. Explain Time Complexity?
Modeling the spread of a virus like COVID-19 using recursion. Let N = total population (assumed constant, disregarding deaths, births, immigration, and emigration). S n = number who are susceptible to the disease at time n (n is in weeks). I n = number who are infected (and contagious) at time n. R n = number who are recovered (and not contagiuous) at time n. The total population is divided between these three groups: N = S n + I n + R n There are several hidden assumptions here that may or may not apply to COVID-19, such as a recovered person is assumed to not be able to get the disease a second time, at least within the time window being examined. On week 0 (the start), you assume a certain small number of people have the infection (just to get things going). Everyone else is initially susceptible, and no one is recovered. There are two constants of interest: Let period = time period that it takes for an infected person to recover (recover meaning they become not infectious to…
There is a cube and an ant is performing a random walk on its vertices,every step it will start from one vertex and walk to another along the connected edge, it willrandomly select any of the 3 adjoining vertices with equal probability. If it starts at one vertex,what is the expected number of steps it needs to reach the diagonally opposite vertex? Write a c++ program for the same
Write codes to implement particle swarm algorithm with population size of 3 (set initial positions and velocities to x-[3.3],x-[8,8].x [6,6],[1,1]') and = = @=0.9,₁ =c₂=2.
The pushdown automaton P=<Q,Σ,Γ,δ,q0,Z0,F> is given, where:Q = {q0,q1,q2,qF}Σ = {0,1,s}Γ = {N,E}q0 = q0Z0 = Z0F = {qF}δ:(q0,0,Z0) -> (q1,NZ0)(q0,1,Z0) -> (q1,EZ0)(q1,0,N) -> (q1,NN)(q1,1,N) -> (q1,EN)(q1,0,E) -> (q1,NE)(q1,1,E) -> (q1,EE)(q1,s,N) -> (q2,N)(q1,s,E) -> (q2,E)(q2,0,N) -> (q2,ε)(q2,1,E) -> (q2,ε)(q2,ε,Z0) -> (qF,ε) Which of the listed languages are accepted by the given PDA P? L(P) = {ww; wϵ(0+1)*} L(P) = {wwwR; wϵ(0+1)*} L(P) = {wswR; wϵ(0+1)*} L(P) = {wwR; wϵ(0+1)*} Can you explain which one and why ?
Suppose a genetic algorithm uses chromosomes of the form x = abcdefghwith a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual x be calculated as: ?(?)=(?+?)−(?+?)−(?+?)−(?+ℎ) And let the population consist of fiveindividuals with the following chromosomes: ?1=12345678 ?2=23456781 ?3=45637281 ?4=53617284 ?5=23921285 a)Computethe fitness value for each individual and sort them in order with the fittest first and the least fit last. b)To create mating pool, roulette wheel selection is used. You will select the individuals. The random values to perform roulette wheel selection are 0.15, 0.56, 0.50, 0.68, and 0.95respectively. Please construct the mating pool step by step and write the selected individuals clearly. c)Perform thefollowing crossover operations in the mating pool: i)Cross the fittest two individuals using one–point crossover at the middle point. ii)Cross the second and third fittest individuals using a two–point crossover…
1. Consider the following dynamic programming implementation of the Knapsack problem: #include int find_max(int a, int b) { if(a > b) return a; return b; } int knapsack(int W, int *wt, int *val,int n) { int ans[n + 1][W + 1]; int itm,w; for(itm = 0; itm <= n; itm++) ans[itm][0] = 0; for(w = 0;w <= W; w++) ans[0][w] = 0; for(itm = 1; itm <= n; itm++) { for(w = 1; w <= W; w++) { if(wt[itm - 1] <= w) ans[itm][w] = ______________; else ans[itm][w] = ans[itm - 1][w]; } } return ans[n][W]; } int main() { int w[] = {10,20,30}, v[] = {60, 100, 120}, W = 50; int ans = knapsack(W, w, v, 3); printf("%d",ans); return 0; } Which of the following lines completes the above code? A. find_max(ans[itm – 1][w – wt[itm – 1]] + val[itm – 1], ans[itm – 1][w]) B. find_max(ans[itm – 1][w –…
Suppose that you want to implement an algorithm that will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. What advantage would this algorithm have over Minimax? (if none, Justify).
What is the running time for this java code? I want the complexity and asymptotic upper bound using Big-Oh notation class lcs { static void LongestCommonArraySubsequence(int X[], int Y[], int n, int m) { // dp[][] array int[][] dp = new int[n + 1][m + 1]; // dp matrix initialization for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) dp[i][j] = 0; for (int i = n - 1; i >= 0; i--) { for (int j = m - 1; j >= 0; j--) { if (X[i] == Y[j]) dp[i][j] = dp[i + 1][j + 1] + 1; // bottom up fill } } int max = 0; // maximum length int Xindex = 0; // starting index of array X int Yindex = 0; // starting index of array Y for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { // calculating the maximum value in dp matrix if (dp[i][j] > max) {…
The Fibonacci series is an infinite sequence of natural numbers, starting from 0 and 1, from which the terms are generated from the sum of the previous sequence elements. a0=0, a1=1, a2=a0+a1, ... , an+1=an+an-1 Implement an algorithm in Java that get n from console and that print the first n terms of the Fibonacci series.
Generate a graph of performance improvement for code below. Tip: Figure 5.17 in the textbook provides an example of a graph depicting performance improvements associated with loop unrolling. code: //normal code int main() { int n, sum=0; n=50; int a[50]; { for(int i=0; i<n; i++) { sum= sum +a[i]; } printf("sum is %d", sum); return 0; } //with unrolling int main() { int n, sum=0; n=50; int a[50] for(int i=0; i<n; i+=10) { scanf("%d", &a[i]); } sum= sum + a[0]; sum= sum + a[1]; sum= sum + a[2]; sum= sum + a[3]; sum= sum + a[4]; sum= sum + a[5]; sum= sum + a[6]; sum= sum + a[7]; sum= sum + a[8]; sum= sum + a[9]; printf("sum is %d", sum); return 0; }