Lecture 8, 10, 11

What does a bubble sort do?

Sorts a list by comparing two items that are side by side, to see which is out of order

Consider the following sorting algorithms. I. Quicksort and II. Mergesort Which of them perform in least time in the worst case?

II

Which of the following algorithm design technique is used in merge sort?

Divide and Conquer

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task?

Insertion sort

Consider an array of elements arr[5]= {5,4,3,2,1}, what are the steps of insertions done while doing insertion sort in the array.

4 5 3 2 1 3 4 5 2 1 2 3 4 5 1 1 2 3 4 5

In a max-heap, element with the greatest key is always in the which node?

root node

The worst case complexity of deleting any arbitrary node value element from heap is

O(logn)

An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

O(n*logn)

Heap exhibits the property of a binary tree?

true

What is the complexity of adding an element to the heap?

O(log n) & O(h)

What is the time complexity to get the max element in a heap?

O(1)

The Process of inserting an element in stack is called

Push

Process of removing an element from stack is called __________

pop

Pushing an element into stack already having five elements and stack size of 5, then stack becomes

Overflow

Entries in a stack are “ordered”. What is the meaning of this statement?

There is a Sequential entry that is one by one

Which of the following is not the application of stack?

Data Transfer between two asynchronous process

A queue follows __________

FIFO (First In First Out) principle

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________

Queue

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

ABCD

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

tail= MAX_SIZE – 1

A stack follows __________

LIFO (Last in First Out)

Which of the following is not an advantage of a priority queue?

Easy to delete elements in any case

What is the time complexity to insert an element in a priority queue?

O(logn)