Stack and Queue

Stack and Queue

University

25 Qs

quiz-placeholder

Similar activities

Midterm InfoTech2

Midterm InfoTech2

University

20 Qs

PRELIM-SW2

PRELIM-SW2

University

20 Qs

MS WORD- CHAPTER 11

MS WORD- CHAPTER 11

University

20 Qs

Java Control and Loop -2

Java Control and Loop -2

University

20 Qs

Logika & Pemrograman (ID)

Logika & Pemrograman (ID)

10th Grade - Professional Development

20 Qs

CN_Minor2

CN_Minor2

University

20 Qs

Information Management - QUIZ

Information Management - QUIZ

University

20 Qs

LINKEDLIST- DSA -2-3

LINKEDLIST- DSA -2-3

University

20 Qs

Stack and Queue

Stack and Queue

Assessment

Quiz

Computers

University

Hard

Created by

Jyoti Jadhav

Used 90+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Choose correct output for the following sequence of operations.

push(5)

push(8)

pop

push(2)

push(5)

pop

pop

pop

push(1)

pop

8 5 2 5 1

8 5 5 2 1

8 2 5 5 1

8 1 2 5 5

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Stack can be implemented using _________ and ________ ?

Array and Binary Tree

Linked List and Graph

Array and Linked List

Queue and Linked List

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When the function calls another function then the details of the previous function are stored in Stack?

Yes

No

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider an empty stack of an integers. Let the numbers 4,5,6,7,8 to be pushed on to this stack only in the order they appeared from left to right. Let P indicates PUSH and Q indicates POP operation. What sequence of operations should be performed on stack in order to get the output as 548.

PPPXPPXX

PPXPPPXX

PPXXPPPX

PXXPPXPX

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the postfix expression for the corresponding infix expression?

a+b*c+(d*e)

abc*+de*+

abc+*de*+

a+bc*de+*

abc*+(de)*+

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the postfix expression for the infix expression?

a-b-c

abc--

ab – c –

– -abc

-ab-c

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

operand is always placed in the output

operator is placed in the stack when the stack operator has lower precedence

parenthesis are included in the output

higher and equal priority operators follow the same condition

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?