MCQ online, Quiz Online, MCQ Computer, MS Office, MS Excel, MS Word, MCQ Iternet, MCQ Quiz Publish Service Commission, MCQ Science, MCQ NTS GAT, and all other categories by educatepk.com...!

MCQs on Data structures and Algorithms

MCQs on Data structures and Algorithms

Data structures and Algorithms MCQs and Quiz

Q No.1 of 10

The complexity of Bubble sort algorithm is

Option 1

O(n)

Option 2

O(n²)

Option 3

O(log n)

Option 4

O(n log n)

Q No.2 of 10

The indirect change of the values of a variable in one module by another module is called

Option 1

internal change

Option 2

inter-module change

Option 3

side effect

Option 4

side-module update

Q No.3 of 10

Which of the following data structure is linear data structure?

Option 1

Arrays

Option 2

Trees

Option 3

Graphs

Option 4

None of these

Q No.4 of 10

To represent hierarchical relationship between elements, which data structure is suitable?

Option 1

Deque

Option 2

Priority

Option 3

Tree

Option 4

None of these

Q No.5 of 10

Which of the following data structure is linear type?

Option 1

Strings

Option 2

Lists

Option 3

Queues

Option 4

All of these

Q No.6 of 10

A binary tree whose every node has either zero or two children is called____________.

Option 1

Complete binary tree

Option 2

Binary search tree

Option 3

Extended binary tree

Option 4

None of these

Q No.7 of 10

When representing any algebraic expression E which uses only binary operations in a 2-tree

Option 1

the variables and operations in E will appear only in internal nodes

Option 2

. the operations in E will appear as external nodes and variables in internal nodes

Option 3

the variable in E will appear as external nodes and operations in internal nodes

Option 4

. the variables and operations in E will appear only in external nodes

Q No.8 of 10

When converting binary tree into extended binary tree, all the original nodes in binary tree are

Option 1

external nodes on extended tree

Option 2

internal nodes on extended tree

Option 3

vanished on extended tree

Option 4

None of these

Q No.9 of 10

An algorithm that calls itself directly or indirectly is known as

Option 1

Polish notation

Option 2

Recursion

Option 3

Sub algorithm

Option 4

Traversal algorithm

Q No.10 of 10

Which of the following sorting algorithm is of divide-and-conquer type?

Option 1

Bubble sort

Option 2

Insertion sort

Option 3

Quick sort

Option 4

None of these

Correct Answers