Quiz-1

June 23, 2019

Hello PrepSter,

If you find any errors in the quiz below kindly comment in the comment section and we will make it our priority to fix it.

Also if you have a better of the solution to the questions, please do comment them below and if we find it better than ours, we will post it in our website.

Question 1

Time: 00:00:00
 Process of inserting an element in stack is called ____________

Create

Create

Push

Push

Evaluation

Evaluation

Pop

Pop

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 2

Time: 00:00:00
Process of removing an element from stack is called __________

Create

Create

Push

Push

Evaluation

Evaluation

Pod

Pod

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 3

Time: 00:00:00
In a stack, if a user tries to remove an element from empty stack it is called _________

Underflow

Underflow

Empty collection

Empty collection

Overflow

Overflow

Garbage Collection

Garbage Collection

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 4

Time: 00:00:00
Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

Overflow

Overflow

Crash

Crash

Underflow

Underflow

User flow

User flow

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 5

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

A collection of stacks is sortable

A collection of stacks is sortable

Stack entries may be compared with the ‘<‘ operation

Stack entries may be compared with the ‘<‘ operation

The entries are stored in a linked list

The entries are stored in a linked list

There is a Sequential entry that is one by one

There is a Sequential entry that is one by one

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 6

Time: 00:00:00
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

Queue

Queue

Stack

Stack

Tree

Tree

Linked list

Linked list

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 7

Time: 00:00:00
A queue is a ?

FIFO (First In First Out) list

FIFO (First In First Out) list

LIFO (Last In First Out) list

LIFO (Last In First Out) list

Ordered array

Ordered array

Linear tree

Linear tree

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 8

Time: 00:00:00
In Breadth First Search of Graph, which of the following data structure is used?

Stack

Stack

Queue

Queue

Linked list

Linked list

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 9

Time: 00:00:00
 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

ABCD

DCBA

DCBA

DCAB

DCAB

ABDC

ABDC

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 10

Time: 00:00:00
A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Queue

Queue

Circular queue

Circular queue

Dequeue

Dequeue

Priority queue

Priority queue

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]
×

Please login to report

Hey ! Follow us on G+