Answer Posted / Sumeet Bhandari

1. Create a stack and an empty output string.
2. Traverse the input infix expression from left to right (inorder).
3. If the current character is an operand, append it to the output string.
4. If the current character is an operator, pop two operands from the stack and append the operator along with them in the reverse order to the output string. Perform the operation if necessary.
5. If the current character is a left parenthesis '(', push it onto the stack.
6. If the current character is a right parenthesis ')', pop operators from the stack and append them to the output string until a matching left parenthesis is found.
7. After traversing the entire infix expression, all remaining operands in the stack are popped and appended to the output string.

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1294

What sort of serious problems have you experienced, and how have you handled them?

1035

For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

1406

Can you declare an array without assigning the size of an array?

1225

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1508

Write a program for Sorting an Array. Which sorting will you prefer?

1049