Qualification	Qualification: B.Tech/B.E. (Nsec - 2006)
Experience	Experience: Teaching computer engineering subjects for last 12 years.
Options	Options: Home Tuition
Hourly Fees	Hourly Fees: INR 2000

Teaches

Data Science / DBMS	Data Science / DBMS: DBMS & RDBMS, PL/SQL
Engineering Subjects	Engineering Subjects: Computer
Programming Language	Programming Language: C, C++, Java And J2EE

About

Area	Area: Howrah, Shibpur, Liluah, Salkia, Dasnagar, Ichapur, Kadamtala, Liluah, Panchanantala, Ramrajatala, Salkia, Santragachi, Shibpur, Tikiapara

We use cookies

Choose Country Code

Direction

Ask a Question

Learning with Sourav Singha Roy: Tutoring Sessions

Sourav Singha Roy

Tutoring

Teaches

About

Online Tutoring

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

Answer

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

Answer

Question:
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:

Answer

Question:
Which of these best describes an array?

Answer

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

Answer

Question:
The postfix form of the expression (A+ B)(CD- E)*F / G is?

Answer

Question:
Process of removing an element from stack is called __________

Answer

Question:
Convert the following infix expressions into its equivalent postfix expressions

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

Answer

Question:
Here is an infix expression: 4 + 3(63-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?

Answer

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

Answer

Popular Subjects

Find a Great Teacher

We use cookies

Choose Country Code

Direction

Ask a Question

Learning with Sourav Singha Roy: Tutoring Sessions

Sourav Singha Roy

Tutoring

Teaches

About

Online Tutoring

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

Answer

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

Answer

Question: 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:

Answer

Question: Which of these best describes an array?

Answer

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

Answer

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

Answer

Question: Process of removing an element from stack is called __________

Answer

Question: Convert the following infix expressions into its equivalent postfix expressions (A + B ⋀D)/(E – F)+G

Answer

Question: 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?

Answer

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

Answer

Popular Subjects

Find a Great Teacher

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

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

Question:
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:

Question:
Which of these best describes an array?

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

Question:
The postfix form of the expression (A+ B)(CD- E)*F / G is?

Question:
Process of removing an element from stack is called __________

Question:
Convert the following infix expressions into its equivalent postfix expressions

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

Question:
Here is an infix expression: 4 + 3(63-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?

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