Question Discussion & Solution

MCQ

The data structure required for Breadth First Traversal on a graph is?

Stack

Array

Queue

Tree

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A data structure where elements can be added or removed at either end but not in the middle is called

linked lists

stacks

queues

dequeue

Discussion

MCQ

A data structure where elements can be added or removed at either end but not in the middle

Linked lists

Stacks

Queues

Deque

Discussion

MCQ

What is the term for inserting into a full queue known as?

overflow

underflow

null pointer exception

all of the mentioned

Discussion

MCQ

Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

Fifo queue

Ascending priority queue

Descending priority queue

None of these

Discussion

MCQ

circular queue

random of queue

priority

dequeue

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics