Explore Questions on "Programming Language - C / C++"

Could you please explain with right option?

Write a program with the help of the image.

What is the difference between conventional Prog & OOP.

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

 Assume that the operators +,-, X are left associative and ^ is right associative.
The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is

Which of the following is not an inherent application of stack?

Consider the following operation performed on a stack of size 5.

Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, the number of elements present in stack are

Convert the following infix expressions into its equivalent postfix expressions

(A + B ⋀D)/(E – F)+G

The prefix form of A-B/ (C * D ^ E) is?

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) are:

Entries in a stack are “ordered”. What is the meaning of this statement?
 

Pushing an element into stack already having five elements and stack size of 5, then stack becomes

 In a stack, if a user tries to remove an element from empty stack it is called _________

Process of removing an element from stack is called __________

Which of these best describes an array?

Is Python faster than C++?

Write a program for producer-consumer problem?