Stack Data Structure

Stack Data Structure

University

10 Qs

quiz-placeholder

Similar activities

Data Structures

Data Structures

University

10 Qs

Quis Struktur Data dan Algoritma

Quis Struktur Data dan Algoritma

University

10 Qs

Data Structures

Data Structures

University - Professional Development

5 Qs

AVR Assembly

AVR Assembly

University

8 Qs

POP SMOKE!!!!

POP SMOKE!!!!

KG - Professional Development

14 Qs

fidget toys

fidget toys

KG - University

11 Qs

Recordando JavaScript

Recordando JavaScript

University

10 Qs

المسابقة الأولى

المسابقة الأولى

University

10 Qs

Stack Data Structure

Stack Data Structure

Assessment

Quiz

Other

University

Medium

Created by

Padmavati Pise

Used 817+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a stack, if a user tries to remove an element from empty stack it is called _________

Underflow

Empty collection

Overflow

Garbage Collection

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Process of inserting an element in stack is called ____________

Create

Push

Evaluation

Pop

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.

Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).

The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

1

2

3

4 or more

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

User perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(2);

pop();

pop();

push(4);

pop();

pop();

push(5);

Overflow Occurs

Stack Operations will be performed Smoothly

Underflow Occurs

None of these

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the value of the postfix expression 6 3 2 4 + – *

1

40

74

-18

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The following postfix expression with single digit operands is evaluated using a stack:

8 2 3 ^ / 2 3 * + 5 1 * -

6,1

5,7

3,2

1,5

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

To evaluate an expression without any embedded function calls:

One stack is enough

Two stacks are needed

As many stacks as the height of the expression tree are needed

A Turing machine is needed in the general case

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?