In below program, what would you put in place of “?” to print “Quiz”? #include <stdio.h> int main() { char arr[] = "CCCSRMQuiz"; printf("%s", ?); return 0; }

• arr
• arr+3
• arr+6
• not possible

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

• AB+ CD*E - FG /**
• AB + CD* E - F **G /
• AB + CD* E - *F *G /
• AB + CDE * - * F *G /

The postfix form of A*B+C/D is?

• *AB/CD+
• AB*CD/+
• A*BC+/D
• ABCD+/*

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

• -/*⋀ACBDE
• -ABCD*⋀DE
• -A/B*C⋀DE
• -A/BC*⋀DE

The prefix form of an infix expression p + q - r * t is?

• + pq - *rt
• - +pqr * t
• - +pq * rt
• - + * pqrt

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

• 600
• 350
• 650
• 588

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

• (A B D ⋀ + E F - / G +)
• (A B D +⋀ E F - / G +)
• (A B D ⋀ + E F/- G +)
• None

Convert the following Infix expression to Postfix form using a stack x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

• xyz*+pq*r+s*+
• xyz*+pq*r+s+*
• xyz+*pq*r+s*+
• none

Consider Stack is implemented using the array. #define MAX 10 struct STACK { int arr[MAX] int top = ___________; } What will be the initial value with which top is initialized.

• Garbage
• 1
• -1
• 0

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 corresponding to the infix expression a + b X c – d ⋀ e ⋀ f is

• abc X+ def ⋀ ⋀ -
• abc X+ de⋀f⋀ -
• ab+c Xd – e ⋀f⋀
• -+aXbc⋀ ⋀def