Search Header Logo

untitled

Authored by Kanishk R

Computers

University

untitled
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

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 an empty stack it is called _________

Underflow

Empty collection

Overflow

Garbage Collection

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

1

40

74

-18

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The following postfix expression with single digit operands is evaluated using a stack: 8 2 3 ^ / 2 3 * + 5 1 * - Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:

3,2

1,5

6,1

5,7

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

abc × + def ^ ^ -

abc × + de ^ f ^ -

ab + c × d - e ^ f ^

+ a × bc ^ ^ def

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (Assuming stack is implemented efficiently)?

O(1) for insertion and O(n) for deletion

O(1) for insertion and O(1) for deletion

O(n) for insertion and O(1) for deletion

O(n) for insertion and O(n) for deletion

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider n elements that are equally distributed in k stacks. In each stack, elements of it are arranged in ascending order (min is at the top in each of the stack and then increasing downwards). Given a queue of size n in which we have to put all n elements in increasing order. What will be the time complexity of the best known algorithm?

O(n logk)

O(nk)

O(n2)

O(k2)

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time, in what order will they be removed?

ABCD

DCBA

DCAB

ABDC

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?