Answered: Q.3. (a) Write an algorithm to convert…

Q.3. (a) Write an algorithm to convert infix to postfix expression and explain it with example (b) Write an algorithm to evaluate a postfix expression and explain it with example

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Problem B. Musical Key ConversionThe chromatic scale is a 12-note scale in music in which all notes are evenly spaced: that is, the ratio of the frequency between any two consecutive notes is constant. The notes are typically labeled in the following sequence: A, A#, B, C, C#, D, D#, E, F, F#, G, G# After G#, the labels loop back and start over with A (one octave higher). To convert between musical keys, you can shift all notes in a piece of music a constant number of steps along the scale above. For example, the sequence of notes E, E, F, G, G, F, E, D, C, C, D, E, E, D, D can be converted to another musical key by shifting everything up three steps: E, E, F, G, G, F, E, D, C, C, D, E, E, D, D G, G, G#, A#, A#, G#, G, F, D#, D#, F, G, G, F, F Notice that G was converted to A#, since going three steps up required us to loop off of the top of the scale back to the bottom: G -> G# -> A -> A#. Technically we should note that this would be A# of the next octave up, but we’ll…
Please answer with explanations.
(15) Let M be the language over {a, b, c, d, e, f} accepting all strings so that: 1. There are precisely two e's in the string. 2. Every a is immediately followed by an even number of b's. 3. Every c is immediately followed by an odd number of f's. b's and f's don't occur except as provided in rules 2 and 3. 5. All c's occur after the first e. 4. 6. All a's occur before the second e. 7. In between the two e's there are exactly twice as many c's as a's. Construct a context-free grammar generating M. You do not need an inductive proof, but you should explain how your construction accounts for each rule. 5) We could eliminate one rule from M and make it regular. Which one? Why? (5) Show that the class of context free languages is not closed under intersection by finding two CFLS whose intersection is not a CFL.
1. Give the unifyiing substitition for (x,y,z are variables): f(a) f(b) 2. Give the unifyiing substitition for (x,y,z are variables): g(x,x) g(f(a),f(y)) 3. Give the unifyiing substitition for (x,y,z are variables): g(x,x) g(f(a0,f(b))
Vocabulary Task (C language) Natural language processing (NLP) is a field of artificial intelligence that seeks to develop the ability of a computer program to understand human language. Usually, the first step of an NLP system is to convert words into numeric codes. Thus, the system converts an input text into a sequence of numeric codes before any high-level analysis. This process is known as text preprocessing. We can only perform text preprocessing if we have a vocabulary of words and their associated numeric codes. Your task is to create a vocabulary of unique words for a given text file and assign a different number from 1 to N to each unique word, with N being the total number of unique words. You must perform this assignment so that the first word in alphabetical order gets the number 1, the second word in alphabetical order gets the number 2, and so on. A word is a sequence of letters (uppercase or lowercase). The file is composed of letters and white spaces (spaces, tabs,…
help me to solve the problem
1.)Implement a program using the if-else selection structure. Develop a C program that computes the different roots in a quadratic equation, aX + bX2=0. r = -b ± √ (b2 – 4ac) , r1 is the root when the + is used in the equation and r2 is the root when 2a the – is used. The roots r1 and r2 can only be computed when the discriminant (b2 – 4ac) is greater than the zero else the quadratic equation does not have any roots and therefore the program should display “no roots”. NOTE: sqrt is a built in function in C to extract the roots. The program will prompt to input the values of a, b and c and output the roots r1 and r2 or no roots at all. Check your answer manually. 2.) Implement a program using the if-else selection structure. Input two numbers. Determine and print the larger number, smaller number. Also, print the two numbers in ascending and descending order. Test data: Enter 1st number: 4 /*inputs */ Enter 2nd number: 2 Smaller number : 2…
The Philosophers' Dinner Problem Five philosophers sit around a table and spend their lives dining and thinking. Each philosopher has a bowl of noodles and a fork to the left of your plate. To eat the noodles you need two forks and each philosopher you can only take the ones to your left and right. If any philosopher takes a fork and the other is busy, he will wait, fork in hand, until pick up the other fork, so you can start eating later. If two adjacent philosophers try to pick up the same fork at the same time, a race condition: they both compete to take the same fork, and one of them left without eating. If all the philosophers take the fork to their right at the same time, then everyone will be waiting forever, because someone must release the fork that is lack. No one will because everyone is in the same situation (hoping that someone put down their forks). Then the philosophers will starve. This lock mutual is called deadlock or deadlock. The problem is to find an algorithm that…
Please help me with these question. I am having trouble understanding what to do. Please use HTML, CSS, and JavaScript Thank you
2. Write a program in 'C' language that checks whether a quadratic form in three variables is positive definite or not. It should do the following: (i) Read the coefficients of the quadratic form. (ii) Print the matrix corresponding to the quadratic form. (iii) Check whether the quadratic form is positive definite or not and print the result.
VIII
a) Give an example of a string containing 11 that is accepted by the following automaton. b) Give an example of a string of length 8 that is rejected by the following automaton. c) Describe the language of this automaton in plain English. d) Describe the language of this automaton using Regular expression.