test 1

Is this your test? Login to manage it. If not, you can generate an assessment just like it.

This is a non-interactive preview of the quiz content.

1 point

.......... is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

Extraction

Distribution

selection

Insertion

1 point

A doubly linked list has .......... pointers with each node.

1 point

The number of comparisons done by sequential search is

n/2+1

(n-1)/2

(n+1)/2

(n+2)/2

1 point

There is a extra element at the head of the list is called _______

List Header

List Head

Antinel

Sentinel

1 point

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

average time

average-case complexity

running time

case-complexity

1 point

Linear array is also called as ________

Straight line array

Horizontal array

Vertical array

One Dimensional array

1 point

Binary search algorithm cannot be applied to ...

sorted linear array

sorted binary trees

pointer array

sorted linked list

1 point

State True (or) False
Binary search is used for searching in a sorted array
Time complexity of a binary search is O(log n)

False,True

False,False

True,True

True,False

1 point

A ..... list is a header list where the node points back to the header node.

Circular header

Grounded header

Two way header

One way header

10.

1 point

............ is the method used by card sorter.

Radix sort B. Insertion C. Heap Quick

Insertion

Radix sort

Heap

Home Features Pricing FAQs Legal Sample Tests Build a Test Login/Sign Up