Data Structures and Algorithms in C++
Data Structures and Algorithms in C++
2nd Edition
ISBN: 9780470383278
Author: Michael T. Goodrich
Publisher: Wiley, John & Sons, Incorporated
bartleby

Videos

Question
Book Icon
Chapter 1, Problem 5R
Program Plan Intro

Operator precedence in java:

  • The C++ has well-defined set of rules that specifies the order in which the operators in an expression gets evaluated.
  • For example, in C++ it is defined that the multiplication and division has higher precedence than subtraction or addition.
  • The operations multiplication, division and modulus have same precedence.
  • The operations addition, subtraction and modulus have same precedence.
  • The operators *, / and % are higher precedence than operators + and -.
  • In C++, the parenthesis gets more priority than any other operator.
  • Example for evaluation of expression with parenthesis:
  • Consider the below expression,

4*(2*(3+2))

  • In the above expression, the innermost parenthesis gets evaluated first. That is (3+2) is evaluated and it results 5. Then this 5 is multiplied using 2 and the result is 10. Then 10 are multiplied with 4 and the result is 40.
  • Example for evaluation of expression without parenthesis:
  • Consider the below expression,

4*2*3+2

  • If there is no parenthesis, the result of this expression will be 26. This is found according to the operator precedence. The operator (*) has higher precedence than “+”.
  • If an expression contain more than one operator with same precedence, their associatively defines the order of evaluation. Then the evaluation does either using left-to-right or right-to-left order.

Blurred answer
04:34
Students have asked these similar questions
Using the notation

you can select multipy options
For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.

Chapter 1 Solutions

Data Structures and Algorithms in C++

Knowledge Booster
Background pattern image
Computer Science
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.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Algebraic Expressions – Algebra Basics; Author: TabletClass Math;https://www.youtube.com/watch?v=U-7nq7OG18s;License: Standard YouTube License, CC-BY
Python Tutorial for Beginners 3 - Basic Math, Mathematical Operators and Python Expressions; Author: ProgrammingKnowledge;https://www.youtube.com/watch?v=Os4gZUI1ZlM;License: Standard Youtube License