## Data Structures and Algorithms(MidQuiz-1,Quiz-2&Midterm Exam)

### Question 1

Marked out of 1.00
Flag question

#### Question text

The complexity of linear search algorithm.

Select one:

### Question 2

Marked out of 1.00
Flag question

#### Question text

State True or False for internal sorting algorithms.

i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

Select one:

### Question 3

Marked out of 1.00
Flag question

#### Question text

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:

### Question 4

Marked out of 1.00
Flag question

#### Question text

The worst case occurs in linear search algorithm when ________________.

Select one:

### Question 5

Marked out of 1.00
Flag question

#### Question text

The complexity of merge sort algorithm.

Select one:

### Question 6

Marked out of 1.00
Flag question

#### Question text

Which of the following is not the required condition for binary search algorithm?

Select one:

### Question 7

Marked out of 1.00
Flag question

#### Question text

The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.

Select one:

### Question 8

Marked out of 1.00
Flag question

#### Question text

___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.

Select one:

### Question 9

Marked out of 1.00
Flag question

#### Question text

The average case occurs in linear search algorithm _______________.

Select one:

### Question 10

Marked out of 1.00
Flag question

#### Question text

The method used by card sorter.

Select one:

### Question 1

Marked out of 1.00
Flag question

#### Question text

This is a terminal node in a binary tree.

Select one:

### Question 2

Marked out of 1.00
Flag question

#### Question text

A connected graph T without any cycles is called a ____________.

Select one:

### Question 3

Marked out of 1.00
Flag question

#### Question text

State True or False for internal sorting algorithms.

i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

Select one:

### Question 4

Marked out of 1.00
Flag question

#### Question text

This is a binary tree whose every node has either zero or two children.

Select one:

### Question 5

Marked out of 1.00
Flag question

#### Question text

The complexity of merge sort algorithm.

Select one:

### Question 6

Marked out of 1.00
Flag question

#### Question text

The average case occurs in linear search algorithm _______________.

Select one:

### Question 7

Marked out of 1.00
Flag question

#### Question text

In a graph, if e=[u,v], then u and v are called _______________

Select one:

### Question 8

Marked out of 1.00
Flag question

#### Question text

Which indicates pre-order traversal?

Select one:

### Question 9

Marked out of 1.00
Flag question

#### Question text

___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.

Select one:

### Question 10

Marked out of 1.00
Flag question

#### Question text

The worst case occurs in linear search algorithm when ________________.

Select one:

### Question 2

Marked out of 1.00
Flag question

#### Question text

The complexity of linear search algorithm.

Select one:

### Question 5

Marked out of 1.00
Flag question

#### Question text

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

Select one:

### Question 7

Marked out of 1.00
Flag question

#### Question text

Another name for directed graph.

Select one:

### Question 8

Marked out of 1.00
Flag question

#### Question text

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:

### Question 1

Marked out of 1.00
Flag question

#### Question text

In a graph, if E=(u,v), it means _____________.

Select one:

### Question 2

Marked out of 1.00
Flag question

#### Question text

The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.

Select one:

### Question 3

Marked out of 1.00
Flag question

#### Question text

A connected graph T without any cycles is called ________________.

Select one:

### Question 4

Marked out of 1.00
Flag question

#### Question text

The complexity of linear search algorithm.

Select one:

### Question 5

Marked out of 1.00
Flag question

#### Question text

Another name for directed graph.

Select one:

### Question 6

Marked out of 1.00
Flag question

#### Question text

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

Select one:

### Question 7

Marked out of 1.00
Flag question

#### Question text

Which of the following is not the required condition for binary search algorithm?

Select one:

### Question 8

Marked out of 1.00
Flag question

#### Question text

The method used by card sorter.

Select one:

### Question 9

Marked out of 1.00
Flag question

#### Question text

The depth of complete binary tree is given by ________________.

Select one:

### Question 10

Marked out of 1.00
Flag question

#### Question text

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:

### Question 1

Marked out of 1.00
Flag question

#### Question text

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

Select one:

### Question 2

Marked out of 1.00
Flag question

#### Question text

A pointer variable which contains the location at the top element of the stack.

Select one:

### Question 3

Marked out of 1.00
Flag question

#### Question text

The term push and pop is related to _____________.

Select one:

### Question 4

Marked out of 1.00
Flag question

#### Question text

New nodes are added to the ________ of the queue.

Select one:

### Question 5

Marked out of 1.00
Flag question

Select one:

### Question 6

Marked out of 1.00
Flag question

#### Question text

This is the insertion operation in the stack.

Select one:

### Question 7

Marked out of 1.00
Flag question

#### Question text

The retrieval of items in a stack is ___________ operation.

Select one:

### Question 8

Marked out of 1.00
Flag question

#### Question text

The complexity of linear search algorithm.

Select one:

### Question 9

Marked out of 1.00
Flag question

#### Question text

This form of access is used to add/remove nodes from a stack.

Select one:

### Question 10

Marked out of 1.00
Flag question

#### Question text

Linked lists are best suited _____________________.

Select one:

### Question 11

Marked out of 1.00
Flag question

#### Question text

Which is the pointer associated with the stack?

Select one:

### Question 12

Marked out of 1.00
Flag question

#### Question text

A connected graph T without any cycles is called a ____________.

Select one:

### Question 13

Marked out of 1.00
Flag question

#### Question text

This is a linear list in which insertions and deletions are made to form either end of the structure.

Select one:

### Question 14

Marked out of 1.00
Flag question

#### Question text

This is a binary tree whose every node has either zero or two children.

Select one:

### Question 15

Marked out of 1.00
Flag question

#### Question text

Which of the following names does not relate to stacks?

Select one:

### Question 16

Marked out of 1.00
Flag question

#### Question text

Which of the following is two way lists?

Select one:

### Question 17

Marked out of 1.00
Flag question

#### Question text

The worst case occurs in linear search algorithm when ________________.

Select one:

### Question 18

Marked out of 1.00
Flag question

#### Question text

___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.

Select one:

### Question 19

Marked out of 1.00
Flag question

#### Question text

State True or False for internal sorting algorithms.

i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

Select one:

### Question 20

Marked out of 1.00
Flag question

#### Question text

This refers to a linear collection of data items.

Select one:

### Question 21

Marked out of 1.00
Flag question

#### Question text

In linked representation of stack, the null pointer of the last node in the list signals _____________________.

Select one:

### Question 22

Marked out of 1.00
Flag question

#### Question text

In a linked list, the ____________ contains the address of next element in the list.

Select one:

### Question 23

Marked out of 1.00
Flag question

#### Question text

Each node in singly linked list has _______ fields.

Select one:

### Question 24

Marked out of 1.00
Flag question

#### Question text

The situation when in a linked list START=NULL is ____________________.

Select one:

### Question 25

Marked out of 1.00
Flag question

Select one:

### Question 26

Marked out of 1.00
Flag question

#### Question text

Which is the pointer associated with the availability list?

Select one:

### Question 27

Marked out of 1.00
Flag question

#### Question text

The elements are removal from a stack in _________ order.

Select one:

### Question 28

Marked out of 1.00
Flag question

#### Question text

Which of the following is an application of stack?

Select one:

### Question 29

Marked out of 1.00
Flag question

#### Question text

In a graph, if E=(u,v), it means _____________.

Select one:

### Question 30

Marked out of 1.00
Flag question

#### Question text

The complexity of merge sort algorithm.

Select one:

### Question 31

Marked out of 1.00
Flag question

#### Question text

The method used by card sorter.

Select one:

### Question 32

Marked out of 1.00
Flag question

#### Question text

The average case occurs in linear search algorithm _______________.

Select one:

### Question 33

Marked out of 1.00
Flag question

#### Question text

The depth of complete binary tree is given by ________________.

Select one:

### Question 34

Marked out of 1.00
Flag question

#### Question text

This is the term used to delete an element from the stack.

Select one:

### Question 35

Marked out of 1.00
Flag question

#### Question text

Which indicates pre-order traversal?

Select one:

### Question 36

Marked out of 1.00
Flag question

#### Question text

A linear list in which the pointer points only to the successive node.

Select one:

### Question 37

Marked out of 1.00
Flag question

#### Question text

This may take place only when there is some minimum amount or no space left in free storage list.

Select one:

### Question 38

Marked out of 1.00
Flag question

#### Question text

Another name for directed graph.

Select one:

### Question 39

Marked out of 1.00
Flag question

#### Question text

A linear list in which the last node points to the first node.

Select one:

### Question 40

Marked out of 1.00
Flag question

#### Question text

A connected graph T without any cycles is called ________________.

Select one:

### Question 41

Marked out of 1.00
Flag question

#### Question text

This indicates the end of the list.

Select one:

### Question 42

Marked out of 1.00
Flag question

#### Question text

The operation of processing each element in the list is known as ________________.

Select one:

### Question 43

Marked out of 1.00
Flag question

#### Question text

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:

### Question 44

Marked out of 1.00
Flag question

#### Question text

In a graph, if e=[u,v], then u and v are called _______________

Select one:

### Question 45

Marked out of 1.00
Flag question

#### Question text

The term used to insert an element into stack.

Select one:

### Question 46

Marked out of 1.00
Flag question

#### Question text

Each node in a linked list must contain at least ___________________.

Select one:

### Question 47

Marked out of 1.00
Flag question

#### Question text

This is a terminal node in a binary tree.

Select one:

### Question 48

Marked out of 1.00
Flag question

#### Question text

What happens when you push a new node onto a stack?

Select one:

### Question 49

Marked out of 1.00
Flag question

#### Question text

This form of access is used to add and remove nodes from a queue.

Select one: