# Data Structure Online Test

30 Questions | Total Attempts: 3626  Settings  Total Questions-> 30Full Time-> 10 minutesNegative marking->0. 15 for each question if answered wrongTotal Marks-> 30 (1 for each question)Before starting the test please fill out the form below as it will be needed to generate the Certificate. <=50% -> Certificate will be provided

• 1.
A linear collection of data elements where the linear node is given by means of pointer is
• A.

• B.

Node list

• C.

Primitive list

• D.

None of these

• 2.
Representation of data structure in memory is known as:
• A.

Recursive

• B.

Abstract data type

• C.

Storage structure

• D.

file structure

• 3.
An adjacency matrix representation of a graph cannot contain information of :
• A.

Nodes

• B.

Edges

• C.

Direction of edges

• D.

Parallel edges

• 4.
Quick sort is also known as
• A.

Merge sort

• B.

Heap sort

• C.

Bubble sort

• D.

None of these

• 5.
Which of the following data structure is linear data structure?
• A.

Trees

• B.

Graphs

• C.

Arrays

• D.

None of above

• 6.
The best average behaviour is shown by
• A.

Quick Sort

• B.

Merge Sort

• C.

Insertion Sort

• D.

Heap Sort

• 7.
A queue is a,
• A.

FIFO (First In First Out) list.

• B.

LIFO (Last In First Out) list.

• C.

Ordered array.

• D.

Linear tree.

• 8.
Which data structure is needed to convert infix notation to postfix notation?
• A.

Branch

• B.

Queue

• C.

Tree

• D.

Stack

• 9.
The postfix form of the expression (A+ B)*(C*D− E)*F / G is
• A.

AB+ CD*E − FG /**

• B.

AB + CD* E − F **G /

• C.

AB + CD* E − *F *G /

• D.

AB + CDE * − * F *G /

• 10.
A full binary tree with n leaves contains
• A.

N nodes.

• B.

Log n 2 nodes.

• C.

2n –1 nodes.

• D.

n 2 nodes.

• 11.
Data is nothing but
• A.

Collection of node

• B.

Collection of information

• C.

Set of value

• D.

Set of node

• 12.
Overflow condition in stack is called
• A.

• B.

Stack implementation Error

• C.

Indifinite Error

• D.

Syntax Error

• 13.
Stack is work on the principal of
• A.

LILO

• B.

FIFO

• C.

FILO

• D.

LIFO

• 14.
Under which condition circular queue is Full
• A.

Front=-1

• B.

Front=(rear+1)%maxsize

• C.

Front=(front+1)%maxsize

• D.

Rear=(rear+1)%maxsize

• 15.
Which is not application of stack
• A.

Reversal of string

• B.

Evaluation of arithimatic operation

• C.

Real operating system

• D.

Recursion

• 16.
A  B-tree is called
• A.

Binary tree

• B.

Binary search tree

• C.

Bst with Height balance

• D.

Multi way search tree with Height balance

• 17.
Time complexity of linear search is
• A.

0(n)

• B.

0(1)

• C.

O(log n)

• D.

0(n log n)

• 18.
Highest precedence is
• A.

*

• B.

-

• C.

+

• D.

^

• 19.
Binary search tree is also called two way search tree
• A.

True

• B.

False

• 20.
The value of structure is resizing during run time by using
• A.

Malloc

• B.

Calloc

• C.

Free

• D.

Realloc

• 21.
How many types of queue's are available
• A.

0

• B.

1

• C.

2

• D.

4

• 22.
For a binary search algorithm to work, it is necessary that the array (list) must be
• A.

Unsorted

• B.

Sorted

• C.

In a heap

• D.

Popped out of stack

• 23.
Queue data structure works on
• A.

FIFO

• B.

LIFO

• C.

FILO

• D.

None of the above

• 24.
Quick sort algorithm is an example of [Blank]
• 25.
1.44 log n is the worst case height of an AVL tree.
• A.

True

• B.

False

Related Topics Back to top