• Create a program that will take a string input from a user to check for the max depth of nested parenthesis given within that string. The max depth will be returned as an integer to the user. Conditions for the string input is to expect the user to input only a mix of integer values, parenthesis )' or (' and operators (+,-,-,/,*) symbols, no error checking is necessary on the programmers side for these inputs. Inputs with only parenthesis are also valid such as "() ()" and "(000)". these inputs would have a maximum nested depth of 1 and 2 respectively, whereas input such as ")(" and "((()" would not be valid and have a depth of zero (as they are not properly nested and closed)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Topic Video
Question

Python programing

Question(Paranthesis Count)

Sample example 1:
User input: "(2 - (4*4) * (1)+9))"
Output: 3 (the 1' is nested within 3 times)
Sample example 2:
User input: "(9*9) + 8/3+(4*4)"
Output: 1
Sample example 3:
User input: "7"
Output: 0
Transcribed Image Text:Sample example 1: User input: "(2 - (4*4) * (1)+9))" Output: 3 (the 1' is nested within 3 times) Sample example 2: User input: "(9*9) + 8/3+(4*4)" Output: 1 Sample example 3: User input: "7" Output: 0
Create a program that will take a string input from a user to check for the
max depth of nested parenthesis given within that string. The max depth
will be returned as an integer to the user.
Conditions for the string input is to expect the user to input only a mix of
integer values, parenthesis )' or (' and operators (+,-,-,/,*) symbols, no
error checking is necessary on the programmers' side for these inputs.
Inputs with only parenthesis are also valid such as "() ()" and "O(00)"
these inputs would have a maximum nested depth of 1 and 2 respectively,
whereas input such as ")(" and "((()" would not be valid and have a depth
of zero (as they are not properly nested and closed)
Further examples and explanation on the next slide.
Transcribed Image Text:Create a program that will take a string input from a user to check for the max depth of nested parenthesis given within that string. The max depth will be returned as an integer to the user. Conditions for the string input is to expect the user to input only a mix of integer values, parenthesis )' or (' and operators (+,-,-,/,*) symbols, no error checking is necessary on the programmers' side for these inputs. Inputs with only parenthesis are also valid such as "() ()" and "O(00)" these inputs would have a maximum nested depth of 1 and 2 respectively, whereas input such as ")(" and "((()" would not be valid and have a depth of zero (as they are not properly nested and closed) Further examples and explanation on the next slide.
Expert Solution
steps

Step by step

Solved in 5 steps with 3 images

Blurred answer
Knowledge Booster
Instruction Format
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education