DS QUIZ 01

DS QUIZ 01

Professional Development

35 Qs

quiz-placeholder

Similar activities

UG Code Breaker Challenge Round-1

UG Code Breaker Challenge Round-1

Professional Development

30 Qs

ADA CS402

ADA CS402

Professional Development

30 Qs

Quiz Wizard'24

Quiz Wizard'24

Professional Development

30 Qs

DSA Quiz

DSA Quiz

Professional Development

30 Qs

Smart Programmer Crew

Smart Programmer Crew

Professional Development

32 Qs

JS array & object

JS array & object

Professional Development

37 Qs

Stack and Queue

Stack and Queue

Professional Development

30 Qs

Data Structures

Data Structures

Professional Development

40 Qs

DS QUIZ 01

DS QUIZ 01

Assessment

Quiz

Computers

Professional Development

Medium

Created by

shivakumar reddy

Used 2+ times

FREE Resource

35 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Process of inserting an element in stack is called

Create

Push

Evaluation

Pop

2.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

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

Underflow

Empty collection

Overflow

Garbage collection

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Consider the following operations on stack of size 5.

After completion of all the operations,the no of elements present on stack is

1

2

3

4

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

If the array index starts with 0, the maximum value of top which does not cause stack overflow is?

8

9

10

11

5.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Stack belong to which order

FIFO

LIFO

FILO

LILO

6.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Process of removing an element from stack is called

Create

Push

Pop

Evaluation

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the time complexity of following code:

O(N)

O(N*LOG(N))

O(N*N)

O(N*sqrt(N))

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?