Anda di halaman 1dari 9

# Objective Oriented Learning Process Format RBT (OLF)

## Branch: B Tech IT Semester: VI

Subject code & Title: 15IT604 Design and Analysis of AlgorithmsUnit/Lesson No: III-1

## T-L tools: Multimedia Faculty name:Dr.S.SUNDARAMURTHY/

Mr. R.VINOTHSARAVANAN

Prerequisite Knowledge:

##  Counting and Probability

 Algebra
 Recurrence Relations

## Micro planning Chart

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
1. Topic for Learning through evocation:

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
To be used by teacher as a teaching learning process guideline for classrooms and laboratory
2. Topic Introduction:

## 2.1. General Objective:

 To analyze the various sorting techniques’ worst, best and average case time complexity
when the input size increases and analyze the binary and linear search techniques’
worst, best and average case time complexity.

2.3. Specific Objectives (Maximum 4): Include the STEM concept for each specific objective within brackets as
(S) (T) (E) (M).

1. Compare the various sorting techniques with its input size. (T)
2. Compare the linear search and binary search with its time complexity. (T)
3. Compare the various sorting techniques with its time complexity. (T)

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
Taxonomy of Objectives
Knowledge Dimension The Cognitive Process Dimension
Remember Understand Apply Analyse Evaluate Create
A. Factual Knowledge
B. Conceptual
Knowledge
C. Procedural 1,2,3
Knowledge
D. Meta Cognitive
Knowledge
Explanatory Notes: (This is not the notes for the topic. It is an explanatory notes to remember the reason for doing a
particular mapping in the table above)

A. Factual Knowledge: It is a knowledge that contains the basic elements students must know if they are to be acquainted with the discipline or to
solve any of the problems in it.
B. Conceptual Knowledge: It includes knowledge of categories and classifications and the relationships between and among them.
C. Procedural Knowledge:It is the knowledge that takes the form of series of logical steps to be followed. It is more skill oriented and can include
algorithms, techniques and methods.
D. Meta Cognitive Knowledge:It is the knowledge of one’s own cognition.

## 2.4: Key words:

 Time efficiency
 Space efficiency
 Sorting
 Searching

## 2.5: Key diagrams (if any):

3. Discussion:

The students will be asked to discuss the relevant topic among their team/other team/Faculty. The students
those who have not taken part will be noted and kindle them to do.

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
4. Mind Map:(It must revolve around the concept)

Sorting Definition
Searching
&
Searching

Sorting

Binary Search
Linear Search
Mergesort
selection
sort and
bubble sort Quicksort

5. Summary:

 Four different sorting algorithms: two O(N2) sorts (selection sort and bubble sort), and
two O(NlogN) sorts (quicksort and merge sort). Each sorting algorithm has its advantages

 Selection sort’s advantage is that the number of swaps is O(N), since we perform at most
one data swap per pass through the algorithm. Its disadvantage is that it does not stop
early if the list is sorted; it looks at every element in the list in turn.

 Bubble sort’s advantage is that it stops once it determines that the list is sorted. Its
disadvantage is that it is O(N2) in both swaps and comparisons. For this reason, bubble
sort is actually the least efficient sorting method.

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
 Quicksort is the fastest sort: it is O(NlogN) in both the number of comparisons and the
number of swaps. The disadvantages of quicksort are that the algorithm is a bit tricky to
understand, and if we continually select poor pivots then the algorithm can approach
O(N2) in the worst case.

 Merge sort is as fast as quicksort: it is O(NlogN) in both swaps and comparisons. The
disadvantage of merge sort is that it requires more copying of data from temporary lists
back to the “full” list, which slows down the algorithm a bit.

a. “AH5P0Z”
b. “AI3Q5Y”
c. “AG2N2Q”

## 1. Running merge sort on an array of size n which is already sorted is

a) O(n)
b) O(nlogn)
c) O(n2)
d) O(n2logn)

2. The time complexity of a quick sort algorithm which makes use of median, found by an O(n)
algorithm, as pivot element is

a) O(n2)
b) O(nlogn)
c) O(nloglogn)
d) O(n)

## 3. The time complexity of heap sort in worst case is

a) O(logn)
b) O(n)
c) O(nlogn)
d) O(n2)

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
4. If the given input array is sorted or nearly sorted, which of the following algorithm gives the best
performance?

a) Insertion sort
b) Selection sort
c) Quick sort
d) Merge sort

5. Consider the situation in which assignment operation is very costly. Which of the following sorting
algorithm should be performed so that the number of assignment operations is minimized in
general?

a) Insertion sort
b) Selection sort
c) Heap sort
d) Merge sort

## 6. Time complexity to sort elements of binary search tree is

a) O(n)
b) O(nlogn)
c) O(n2)
d) O(n2logn)

7. The lower bound on the number of comparisons performed by comparison-based sorting algorithm
is

a) Ω (1)
b) Ω (n)
c) Ω (nlogn)
d) Ω (n2)

## A. Item is somewhere in the middle of the array

B. Item is not in the array at all
C. Item is the last element in the array
D. Item is the last element in the array or item is not there at all

## A. must use a sorted array

B. requirement of sorted array is expensive when a lot of insertion and deletions are needed
C. there must be a mechanism to access middle element directly
D. binary search algorithm is not efficient when the data elements more than 1500.

## 10. Binary search algorithm cannot be applied to ...

To be used by teacher as a teaching learning process guideline for classrooms and laboratory
B. sorted binary trees
C. sorted linear array
D. pointer array

8. References: (Books/Periodicals/Journals)

## 1. Sara Basse, A V Gelder, Computer Algorithms, Pearson 2012.

2. T H Cormen, Leiserson, Rivest and Stein, Introduction of Computer algorithms, PHI 2011.
3. E Horowitz, S Sahni, and S Rajsekaran, Fundamentals of Computer Algorithms, Galgotia Publication,
2008.
4. Goodman, Introduction to the Design and Analysis of Algorithms, Tata McGraw Hill, 2002.
5. Donald E Knuth, The Art of Computer Programming, Volume I & II, Third Edition, AddisionWessely,
2000.

## Mrs. G. Srinitya Dr.S.Sundaramurthy

To be used by teacher as a teaching learning process guideline for classrooms and laboratory