Programming Data Structure Online Test | Online Quiz | Mock Exam

On which principle does stack work?

Can linked list be implemented using arrays?

On which principle does queue work?

AVL trees have a faster __________

Which of the following statements hold true for binary trees?

The time required in best case for search operation in binary tree is

Can stack be described as a pointer?

What is the peculiarity of red black trees?

Which of the following ways is a pre-order traversal?

Which of the following ways is a in-order traversal?

Which of the following linked list below have last node of the list pointing to the first node?

Items in a priority queue are entered in a _____________ order

A tree cannot contain cycles.

Breadth First search is used in

A ___________ tree is a tree where for each parent node, there is only one associated child node

In graphs, A hyperedge is an edge that is allowed to take on any number of _____________

An empty list is the one which has no

Key value pair is usually seen in

In a heap, element with the greatest key is always in the ___________ node

In _____________tree, the heights of the two child subtrees of any node differ by at most one

The element indices of an array can be computed at

B-Tree is an acronym for Binary tree

Insertion in a B tree starts from

Which of the following below are applications of B-tree’s?

R tree’s are typically used in which way that differs from B tree?

Which is the fastest sorting algorithm to sort a list?

___________ is one of the fastest ways to store and retrieve data

A minimum spanning tree is a spanning tree organized so that the total ___________ between nodes is minimized

____________ are used to store information in a matrix form.

___________ method is used to remove elements from a stack