Implementation of Stacks and Queues

Implementation of Stacks and Queues

12th Grade - University

16 Qs

quiz-placeholder

Similar activities

DataStructure

DataStructure

University

15 Qs

Data structure test1

Data structure test1

12th Grade

20 Qs

Abstract Data Types

Abstract Data Types

12th Grade

20 Qs

Data Structure Basics

Data Structure Basics

University

20 Qs

Stacks and Queues Quiz

Stacks and Queues Quiz

University

15 Qs

Data Structures

Data Structures

10th Grade - University

18 Qs

quiz 2 SDA

quiz 2 SDA

University

20 Qs

Data Structure

Data Structure

University

14 Qs

Implementation of Stacks and Queues

Implementation of Stacks and Queues

Assessment

Quiz

Education, Computers

12th Grade - University

Medium

Created by

Yomna Elkholy

Used 3+ times

FREE Resource

16 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The process of inserting an element in a stack is called ____________

Create

Push

Evaluation

Pop

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The process of removing an element from a stack is called ____________

Create

Push

Evaluation

Pop

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Pushing an element into a stack that already contains five elements and astack size of 5, results in a stack

Overflow

Crash

Underflow

User flow

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Entries in a stack are “ordered”. What is the meaning of this statement?

A collection of stacks is sortable

Stack entries may be compared using the ‘<’ operation

The entries are stored in a linked list

There is a sequential entry that is one by one

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following applications does not use a stack?

A parentheses balancing program

Tracking of local variables at run time

Compiler Syntax Analyzer

Data Transfer between two asynchronous process

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

1

40

74

-18

7.

MULTIPLE CHOICE QUESTION

30 sec • 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 /

Answer explanation

Best explanation: (((A+ B)*(C*D- E)*F) / G) is converted to postfix expression as

(AB+(*(C*D- E)*F )/ G)

(AB+CD*E-*F) / G

(AB+CD*E-*F G/).

Thus Postfix expression is AB+CDE-*F*G/

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?