Government of Karnataka

Department of Technical Education

Bengaluru

Course Title: Design and Analysis of Algorithms

Course Code:
Scheme (L:T:P) : 4:0:0 Total Contact Hours: 52
15CS53T
Type of Course: Lectures, Self Core/ Elective:
Credit :04
Study & Student Activity. Core
CIE- 25 Marks SEE- 100 Marks

Prerequisites:

Knowledge of Data Structures.

Course Objectives

Study the concepts of fundamentals of algorithm, Analysis of algorithm efficiency, Brute

force techniques, Divide-and-Conquer, Decrease-and-Conquer, Greedy techniques.

Course Outcome

On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked PO Teaching
Course outcome
Hours
CO1 Discuss the fundamentals of algorithm. 10
R,U 1,2,3,7,8,9,10
CO2 Describe the analysis of algorithm 10
R,U,A,AL 1,2,3,7,8,9,10
efficiency using different notations.
CO3 Discuss various problems using Brute 12
U,A,AL 1,2,3,7,8,9,10
force technique.
CO4 Describe various problems using Divide- 08
U,A,AL 1,2,3,7,8,9,10
and-Conquer Technique.
CO5 Describe various problems using 06
U,A,AL 1,2,3,7,8,9,10
Decrease-and-Conquer
CO6 Discuss Greedy Techniques 06
U,A 1,2,3,7,8,9,10

Total 52

Legends: R = Remember U= Understand; A= Apply AL=Analyze E=Evaluate C= Create

and above levels (Bloom’s revised taxonomy)

Course-PO Attainment Matrix

Course Programme Outcomes

1 2 3 4 5 6 7 8 9 10
Design and Analysis of
3 3 3 - - - 3 3 3 3
Algorithms

Directorate of Technical Education Karnataka State CS&E 15CS53T

 Level 3- Highly Addressed, Level 2-Moderately Addressed, Level 1-Low Addressed.
Method is to relate the level of PO with the number of hours devoted to the COs which address the given PO.
If >40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 3
If 25 to 40% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 2
If 5 to 25% of classroom sessions addressing a particular PO, it is considered that PO is addressed at Level 1
If < 5% of classroom sessions addressing a particular PO, it is considered that PO is considered not-addressed.

Course Content and Blue Print of Marks for SEE

Unit Hour Questions to be set Marks Marks

No Unit Name for Weightage Weightage
SEE (%)
R U A AL A
I Introduction 10 10 15 05 - 30 20.68
II Fundamentals of the 10 05 05 10 10 30 20.68
Analysis of
Algorithm
Efficiency
III Brute Force 12 10 10 15 35 24.14

IV Divide-and-Conquer 08 - 05 05 10 20 13.79

V Decrease-and- 06 - 05 05 05 15 10.35
Conquer
VI Greedy Technique 06 - 05 05 05 15 10.35
Total 52 15 45 40 45 145 100

UNIT I : Introduction 10 Hrs

What is an Algorithm? Fundamentals of Algorithmic problem solving, Important problem

types. Fundamental data structures

UNIT II: Fundamentals of the Analysis of Algorithm Efficiency 10 Hrs

Analysis Framework, Measuring the input size, Units for measuring Running time, Orders of
Growth, Worst-case, Best-case and Average-case efficiencies, Asymptotic Notations and
Basic Efficiency classes, Informal Introduction, O-notation, Ω-notation, θ-notation,
mathematical analysis of non-recursive algorithms, mathematical analysis of recursive
algorithms.

UNIT III: Brute Force & Exhaustive Search 12 Hrs

Introduction to Brute Force approach, Selection Sort and Bubble Sort, Sequential search,
Exhaustive Search- Travelling salesman Problem and Knapsack Problem, Depth First Search,
Breadth First Search

UNIT IV: Divide-and-Conquer 08 Hrs

Introduction, Merge Sort, Quick Sort, Binary Search, Binary Tree traversals and related
properties.

UNIT V: Decrease-and-Conquer 06 Hrs

Directorate of Technical Education Karnataka State CS&E 15CS53T

Decrease-and-Conquer: Introduction, Insertion Sort, Topological Sorting.

UNIT VI: Greedy Technique 06 Hrs

Greedy Technique: Introduction, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s

Algorithm

®Text books
1. Introduction to the Design and Analysis of Algorithms, 3rd edition, Anany Levitin,
Pearson Publication, ISBN: 9789332583771

References
1. http://nptel.ac.in/courses/106101060/
2. http://www.tutorialspoint.com/data_structures_algorithms/
3. Design & Analysis of Algorithms, S. Nandagopalan, Sapna Book House.

Suggested list of student activities

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc.
1. Each individual student should do any one of the following type activity or any other
similar activity related to the course and before conduction, get it approved from concerned
course coordinator and programme coordinator.
2. Each student should conduct different activity and no repeating should occur

1 Build and execute programs from the unsolved exercises given from the course
textbook at the end of each chapters.
2 Quiz

Course Delivery

The course will be delivered through lectures and Power point presentations/ Video

Course Assessment and Evaluation Scheme

Method What To When/Where Max Evidence collected Course outcomes
who (Frequency in the Marks
m course)
CIE IA Three IA tests 1 to 6
Direct Assessment

(Average of three
20 Blue books
tests will be
Students

computed)
Student activities 05 Report 1 to 6
Total 25
SEE End End of the course Answer scripts at 1 to 6
Exam 100
BTE
Middle of the course 1, 2, 3 Delivery of
Feedback forms
Indirect
Assessment

course
Students

End of Course End of the course 1 to 6 Effectiveness

Survey of Delivery of
Questionnaires
instructions &
Assessment Methods
Note: I.A. test shall be conducted for 20 marks. Average marks of three tests shall be rounded off
to the next higher digit.

Directorate of Technical Education Karnataka State CS&E 15CS53T

 Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 30
4 Analysis 30

Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.

FORMAT OF I A TEST QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time
Ex: I test/6 th week V SEM
20
of sem 10-11 Am Year:
Name of Course coordinator :
Units:__ CO’s:____
Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).

MODEL QUESTION PAPER (CIE)

Test/Date and
Semester/year Course/Course Code Max Marks
Time
Design and Analysis
V SEM
Ex: I test/6 th week of Algorithms
20
of sem 10-11 AM Course code:
Year: 2017-18
15CS53T
Name of Course coordinator :
Units:1,2 Co: 1,2
Note: Answer all questions
Questio
Question CL CO PO
n no
1 Explain Euclid’s algorithm for computing GCD of two U, 1,2 1,2,3,7,8,
numbers.(5) OR A 9,10
Explain Linear data structures with example. (5)
2 Write an algorithm for sequential search and analyse its U, 1,2 1,2,3,7,8,
worst-case, best-case and average-case efficiencies. (5) A 9,10
OR
Write a recursive algorithm for computing the factorial

Directorate of Technical Education Karnataka State CS&E 15CS53T

 function for an arbitrary non-negative integer.(5)
3 Apply selection sort to the following array A, 2 1,2,3,7,8,
45,23,89,10,11,27,38 (5) AL 9,10
4 Differentiate undirected and directed graphs with U 1 1,2,3,7,8,
examples. (5) 9,10

Format for Student Activity Assessment

DIMENSION Unsatisfactory Developing Satisfactory Good Exemplary Score

1 2 3 4 5

Collection of Does not Collects Collects Collects Collects a 3

data collect any very limited some basic relevant great deal of
information information; information; information;information;
relating to the some relate refer to the concerned all refer to
topic to the topic topic to the topicthe topic
Fulfill team’s Does not Performs Performs Performs allPerforms all 4
roles & duties perform any very little nearly all duties duties of
duties assigned duties duties assigned
to the team team roles
role with
presentation
Shares work Always relies Rarely does Usually Does the Always 3
equally on others to do the assigned does the assigned job does the
the work work; often assigned without assigned
needs work; rarely having to be work
reminding needs reminded. without
reminding having to be
reminded
and on
given time
frame
Listen to Is always Usually Listens, but Listens and Listens and 3
other Team talking; never does most sometimes contributes contributes
mates allows anyone of the talk too to the precisely to
else to speak talking; much relevant the relevant
rarely topic topic and
allows exhibit
others to leadership
speak qualities
TOTAL 13/4=3.25=4
Note: This is only an example. Appropriate rubrics/criteria may be devised by the concerned
course co-ordinator for assessing the given activity.

MODEL QUESTION PAPER Code: 15CS53T

Diploma in Computer Science & Engineering
V Semester
Course Title: Design and Analysis of Algorithms

Directorate of Technical Education Karnataka State CS&E 15CS53T

Time: 3 Hours Max Marks: 100
PART-A
Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks
1. Explain Euclid’s algorithm for computing GCD of two numbers.
2. Differentiate undirected and directed graphs with examples.
3. Write a pseudo code for finding the value of the largest element in a list of n numbers.
4. Write a recursive algorithm for computing the factorial function for an arbitrary non-
negative integer.
5. Define Brute force and explain it with example.
6. Define binary tree. Explain its traversals.
7. Derive an expression for worst case analysis of binary search algorithm
8. Apply Prim’s algorithm for the graph shown below
7
A C
6
8 4 5
D
2 E
B
4

9. Write Greedy algorithm and explain

PART-B
Answer any SEVEN questions. Each carries 10 marks. 7X10=70 Marks
1. Explain the steps involved in designing and analysing an algorithm.
2. Write a note on Sorting and Searching problem types.
3. Write an algorithm for sequential search and analyse its worst-case, best-case and
average-case efficiencies.
4. Apply selection sort to the following array : 45,23,89,10,11,27,38
5. Explain bubble sort method with an example. Use Brute Force approach.
6. Solve using DFS algorithm

B C

D E F G

8. Write an algorithm of Quick Sort and trace it for an example data set.
9. Compute time complexity of insertion sort in the best, worst and average cases.
10. Write the Kruskal’s algorithm to find the minimum cost spanning tree.

MODEL QUESTION BANK

Diploma in Computer Science & Engineering
V Semester
Course Title: Design and Analysis of Algorithms

Directorate of Technical Education Karnataka State CS&E 15CS53T

CO Question CL Marks
Define Algorithm. Give an example illustrating the notion of an R
algorithm.
Explain Euclid’s algorithm for computing GCD of two numbers. U,A
Explain Linear data structures with example. U
Define Graph, Vertex, Edge, Path and Length of a path with example R 05
I for each.
Write a note on Weighted graph with an example. U
Give the differences between sets and dictionaries. R
Explain the steps involved in designing and analysing of an algorithm. U
Write a note on Sorting and Searching problem types. U 10
Explain Rooted Trees and Ordered Trees with example for each. U
Write an algorithm for sequential search. U,A
Write a pseudo code for finding the value of the largest element in a U,A
list of n numbers. 05
Write a recursive algorithm for computing the factorial function for U,A
an arbitrary non-negative integer.
Illustrate an algorithm for sequential search and Analyse its worst- AL
II case, best-case and average-case efficiencies.
Explain Big-oh notation, Big-omega notation and Big-theta notation AL 10
along with its graph.
Explain basic Asymptotic efficiency classes. U
Illustrate the recursive solution to the Tower of Hanoi Puzzle. A,AL
Define Brute force and explain it with example. R,U
Write an algorithm for closest pair problem using brute force. U,A 5
Illustrate an algorithm for Selection sort with example. A,AL
Illustrate an algorithm for Bubble sort with example. A,AL
Illustrate Travelling salesman problem with example. A,AL
Explain Breadth First Search algorithm A,AL 10
III Consider knapsack for the instance given below A,AL
N=3
[ w1,w2,w3]=[100,10,10]
[p1,p2,p3]=[20,15,15]
M=105
Find all feasible and infeasible solutions
Explain Depth First Search algorithm A,AL
Write an algorithm for binary search. U,A
Define binary tree. Explain its traversals. R,U 5
IV Explain Divide-and-Conquer technique with neat diagram. U
Explain Merge sort algorithm with example. A,AL
Write Quick Sort algorithm and trace it with an example. A,AL 10
Analyze the binary search algorithm for best case, worst case and AL
average cases.
Explain Decrease-and-Conquer technique with neat diagram. U 05
Explain topological sorting with example. A
Write an algorithm for Insertion sort with example. A,AL 10
V Compute time complexity of insertion sort in the best, worst and AL
average cases.
Explain greedy method with appropriate example U,A 5

Directorate of Technical Education Karnataka State CS&E 15CS53T

 Can the Prim’s algorithm be applied for directed graphs? justify U,A
VI Write the algorithm to find the minimum cost spanning tree based on A,
Prim’s logic AL
Explain Kruskal’s algorithm for constructing a minimum spanning AL 10
tree.
Write Prim’s algorithm for constructing a minimum spanning tree AL
Explain Dijkstra algorithm with an example. AL

Directorate of Technical Education Karnataka State CS&E 15CS53T