stack

stack

University

8 Qs

quiz-placeholder

Similar activities

Analisis Struktur Data

Analisis Struktur Data

10th Grade - University

12 Qs

DS(Part2)-After

DS(Part2)-After

University

11 Qs

Kuis StrukDat

Kuis StrukDat

University

10 Qs

ReflectiveQuiz_03092020

ReflectiveQuiz_03092020

University

10 Qs

Data Structures Quiz 1

Data Structures Quiz 1

University

10 Qs

DS Quiz1

DS Quiz1

University

10 Qs

TECH QUIZ - ASCEND (ROUND 3)

TECH QUIZ - ASCEND (ROUND 3)

University

10 Qs

CSS TECH TRIVIA - MEDIUM LEVEL

CSS TECH TRIVIA - MEDIUM LEVEL

University

10 Qs

stack

stack

Assessment

Quiz

Computers

University

Hard

Created by

fathima haqul

FREE Resource

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

stack is a ..............data structure

LIFO

FIFO

STATIC

Answer explanation

LAST IN FIRST OUT

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

QUEUE IS ....................data structure

LIFO

STATIC

FIFO

Answer explanation

FIRST IN FIRST OUT

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not the correct statement for a stack data structure?

Arrays can be used to implement the stack

Stack follows FIFO

Elements are stored in a sequential manner

Top of the stack contains the last inserted element

4.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

When will the Underflow condition in stack arises

insertion

deletion

both

NONE

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Operation that returns the topmost element of the stack

Top

Empty

Size

Swap

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a linear data structure?

Graph

Binary Tree

Linked list

AVL Tree

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Consider the following operations performed on a stack of size 5

Push(a)

Pop()

Push(b)

Push(c)

Pop()

Push(d)

Pop()

Pop()

Push(e)

Which of the following statements is correct?

Stack operations performed smoothly

Underflow occurs

Overflow occurs

None of the above

8.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as___

Overflow

Successful Insertion

Underflow

Garbage Collection