Free computer quiz Online Test - MeritNotes

Home
Online Exam

No. of Questions :10

Remaining Time :

1. Which of following data structure is more appropriate for implementing quick sort iteratively?

(a)
Deque
(b)
Queue
(c)
Stack
(d)
Priority queue

2. Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

(a)
Queue
(b)
Linked list
(c)
Binary search tree
(d)
None of above

3. A vertex of in-degree zero in a directed graph is called a/an

(a)
Root vertex
(b)
Isolated vertex
(c)
Sink
(d)
Articulation point

4. A graph is a tree if and only if graph is

(a)
Directed graph
(b)
Contains no cycles
(c)
Planar
(d)
Completely connected

5. To perform level-order traversal on a binary tree, which of the following data structure will be required?

(a)
Hash table
(b)
Queue
(c)
Binary search tree
(d)
Stack

6. The number of edges in a complete graph of n vertices is

(a)
n(n+1)/2
(b)
n(n-1)/2
(c)
n²/2
(d)
n

7. Which of the following piece of information does the data type to the compiler provide?

(a)
The way the data is to be interpreted
(b)
Range of values
(c)
Amount of memory a data element uses
(d)
All of above

8. Minimum number of fields in each node of a doubly linked list is ____

(a)
2
(b)
3
(c)
4
(d)
None of the above

9. The elements of a linked list are stored

(a)
In a structure
(b)
In an array
(c)
Anywhere the computer has space for them
(d)
In contiguous memory locations

10. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

(a)
Threaded tree
(b)
Complete binary tree
(c)
M-way search tree
(d)
Full binary tree

Home

Terms & Conditions

Contact