Questions: 856

Answers by our Experts: 763

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

Convert the following infix expressions to their postfix equivalents:

(a) A – B + C

(b) A * B + C / D

(c) (A – B ) + C * D / E – C

(d) (A * B) + (C / D) – ( D + E)


Write an algorithm to convert the input inch(es) into its equivalent centimeters. One inch is equivalent to 2.54cms. Then display the result.


Write and run an algorithm for a TCP client and a TCP server with the


following specifications:


(i) The server should be able to handle at least 5 clients concurrently


(ii) A client program sends a string to a server.


(iii) The server program converts lower case latters to upper case


letters and vice versa.


(iv) The converted string is returned to the client.


(v) The client program prints the result.

Write an algorithm to convert the input inch(es) into its equivalent centimeters. One inch is equivalent to 2.54cms. Then display the result.

Write an algorithm that will ask for a price. If the price is greater than 1000, compute a 10% discount from the original price and 5% discount for 1000 and below. Display the computed discount.

Write an algorithm to compute the average of three input quizzes. Then display The result.

An investment firm wants to sell N shares of a particular stock. The firm receives “m” bids of the form “ni shares for ₹ ri”. How will you characterize this as fractional knapsack problem and 0-1

Knapsack problem.

Bidders are only interested in acquiring their complete order. If the the firm wants to service the maximum number of bidders, suggest an algorithm to solve the problem.

Let = {I1, I2, I3, I4, I5, I6, I7} be a collection of items with (weight, values) pairs:

Item Weight Value I1 2 4

I2 3 6

I3 1 5

I4 3 7

 I5 1 3

 I6 2 1

 I7 1 6

Consider items are divisible (can be broken), find a subset of items that can fit into the bag of weight capacity 7 and value of the items collected in the bag should be maximized? Show your work.


Draw the flowchart design for an algorithm to find the minimum of an array A containing 100 integers


do the hand tracing with any value to find the area

Accept the two sides and an angle included by these two sides, and find the area and third side of a triangle.

 (1) Display "Enter two sides and an angle:"

(2) Accept a, b,theta

(3) ang = theta * 3.14 / 180;

(4) third_side = sqrt (a*a + b*b - 2*a*b* cos(ang))

(5) area = ½*a*b* sin(ang)

(6) Display "Third_side =",third_side,"Area =", area

(7) Exit


Give the infix expression of the following prefix expressions.

(A) * – + A B C D

(B) + – a * B C D


LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS