Search Header Logo

Stack-ADT

Authored by Kanishk R

Computers

University

Used 8+ times

Stack-ADT
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

7 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

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 /

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

The data structure required to check whether an expression contains balanced parenthesis is?

Stack

Queue

Array

Tree

3.

MULTIPLE CHOICE QUESTION

5 mins • 1 pt

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

*AB/CD+

AB*CD/+

A*BC+/D

ABCD+/*

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Which data structure is used for implementing recursion?

Queue

Stack

Array

List

5.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

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

600

350

650

588

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

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

Reversing a string

Evaluation of postfix expression

Implementation of recursion

Job scheduling

7.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Which of the following application generally use a stack?

Parenthesis balancing program

Syntax analyzer in compiler

Keeping track of local variables at run time

All of the above

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers