Stack Exercises

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

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

• AB + CDE - F *G /

• AB+ CD*E - FG /**

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

The process of accessing data stored in a serial access memory is similar to manipulating data on a ------?

• Linked List

• Stack

• Heap

• Queue

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

• -A/B*C⋀DE

• -/*⋀ACBDE

• -ABCD*⋀DE

• -A/BC*⋀DE

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

• ABCD+/*

• A*BC+/D

• AB*CD/+

• *AB/CD+

What is the worst-case time complexity when looking at the top item from the stack?

• O(n)

• O(2n)

• O(n^2)

• O(1)

Which one of the following is NOT an application of Stack Data Structure?

• Managing function calls

• The stock span problem

• Arithmetic expression evaluation

• Printing Documents with Printer

In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• True

• False

What is output for input "geeksquiz"?

(a)  

Assume that the operators +, -, × 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 × c - d ^ e ^ f is

(Sample answer must with spacing: e.g. - + A B C )

(a)  

The minimum number of stacks needed to implement a queue is

• 1

• 2

• 3

• 4