Scribd
Upload
218 views

Handout Preparation Model

This document provides information about a course on design and analysis of algorithms taught at Gudlavalleru Engineering College. It includes the course objectives, outcomes, topics, schedule, textbooks, and other learning resources. The course aims to teach fundamental algorithm design techniques like divide-and-conquer, greedy methods, dynamic programming, backtracking, and branch-and-bound. It will cover the analysis of common algorithms like binary search, quicksort, matrix chain multiplication, and traveling salesperson. Students will learn to identify, formulate, and solve algorithmic problems.

Uploaded by

PrasadDam
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
218 views

Handout Preparation Model

This document provides information about a course on design and analysis of algorithms taught at Gudlavalleru Engineering College. It includes the course objectives, outcomes, topics, schedule, textbooks, and other learning resources. The course aims to teach fundamental algorithm design techniques like divide-and-conquer, greedy methods, dynamic programming, backtracking, and branch-and-bound. It will cover the analysis of common algorithms like binary search, quicksort, matrix chain multiplication, and traveling salesperson. Students will learn to identify, formulate, and solve algorithmic problems.

Uploaded by

PrasadDam
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

GUDLAVALLERU ENGINEERING COLLEGE

(An Autonomous Institute with Permanent Affiliation to JNTUK, Kakinada)

Seshadri Rao Knowledge Village, Gudlavalleru 521 356.

Department of Computer Science and Engineering

HANDOUT
on

DESIGN AND ANALYSIS OF ALGORITHMS

Vision

Mission

Program Educational Objectives

HANDOUT ON DESIGN AND ANALYSIS OF ALGORITHMS


Class & Sem.

: III B.Tech II Semester

Year

: 2016-17

Branch

: CSE

Credits

: 3

============================================================================
1. Brief History and Scope of the Subject
An algorithm is a recipe or a systematic method containing a sequence of instructions to solve a
computational problem. It takes some inputs, performs a well defined sequence of steps, and
produces some output. Once we design an algorithm, we need to know how well it performs on
any input. In particular we would like to know whether there are better algorithms for the
problem. An answer to this first demands a way to analyze an algorithm in a machineindependent way. Algorithm design and analysis form a central theme in computer science.
Advanced topics in Algorithms include a study of randomized algorithms (where an algorithm
can make some careful random choices and one is interested in the expected runtime of the
algorithm, as opposed to the worst case) and parallel algorithms (where the algorithm can make
use of several available processors simultaneously).
2. Pre-Requisites
Mathematical Foundation of Computer Science
Data Structures
Programming Language such as C/C++/JAVA
3. Course Objectives:

4. Course Outcomes:
CO1:
CO2:
CO3:
CO4:
CO5:
5. Program Outcomes:
Graduates of the Computer Science and Engineering Program will have
a) an ability to apply knowledge of mathematics, science, and engineering
b) an ability to design and conduct experiments, as well as to analyze and interpret data
c) an ability to design a system, component, or process to meet desired needs within realistic
constraints such as economic, environmental, social, political, ethical, health and safety,
manufacturability, and sustainability
d) an ability to function on multidisciplinary teams
e) an ability to identify, formulate, and solve engineering problems
f) an understanding of professional and ethical responsibility
g) an ability to communicate effectively
h) the broad education necessary to understand the impact of engineering solutions in a global,
economic, environmental, and societal context
i) a recognition of the need for, and an ability to engage in life-long learning,
j) a knowledge of contemporary issues
k) an ability to use the techniques, skills, and modern engineering tools necessary for
engineering practice.
6. Mapping of Course Outcomes with Program Outcomes:

CO1
CO2
CO3
CO4
CO5

7. Prescribed Text Books


a. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam,
Universities Press.
b. Design and Analysis of Algorithms, S Sridhar, Oxford.
c. Design and Analysis of Algorithms, Parag Himanshu Dave, Himansu Balachandra Dave, 2 nd
ed, Pearson Education.
8. Reference Text Books
a. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
b. Introduction to the Design and Analysis of Algorithms, Anany Levitin, PEA
c. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest and
C.Stein,PHI Pvt.Ltd.
d. Algorithm Design, Foundation, Analysis and internet Examples, Michel T Goodrich, Roberto
Tamassia, Wiley
9. URLs and Other E-Learning Resources
a. Algorithm base:
www.intelligenceunited.com
b. Analysis of algorithms: http://pauillac.inria.fr/algo/AofA
c. Problems in Analysis of algorithm: http://pauillac.inria.fr/algo/AofA/problems/
d. Quick sort animation:http://pages.stern.nyu.edu/~panos/java/Quicksort/index.html
10. Digital Learning Materials:
http://nptel.ac.in/courses/106101059
https://onlinecourses.nptel.ac.in
http://nptel.ac.in/courses/106106131/
http://nptel.ac.in/courses/106101060/
http://192.168.0.47/NPTEL%20Video%20Lectures%20Notes/CSE/Data%20Structures
%20And%20Algorithms-Naveen%20Garg/lec1-Introduction%20to%20Data%20 Structures
%20 and%20 Algorithms .pdf
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-andanalysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_Notes.pdf

11. Lecture Schedule / Lesson Plan


Topic
UNIT 1: Introduction
Algorithm

No. of Periods
Theor
Tutorial
y
1

Pseudo code for expressing algorithms


Space complexity
Time complexity
Big oh notation, Omega notation
Theta notation and Little oh notation
probabilistic analysis
Amortized analysis

2
1
2
1
1
2
2

UNIT 2: Divide and Conquer


General method
Binary search
Quick sort
Merge sort

2
2
2
2

UNIT 3: Greedy Method


General method
Job sequencing with dead lines
0/1 knapsack problem
Minimum cost spanning trees
Single source shortest path problem
UNIT 4: Dynamic Programming
General method
Matrix chain multiplication
Optimal binary search trees
0/1 knapsack problem
All pairs shortest path problem
Traveling sales person problem
Reliability design

1
2
1
2
2
1
1
2
2
2
2
2

UNIT 5: Backtracking
General method
N-queen problem
Sum of subsets problem
Graph coloring
Hamiltonian cycles

1
2
1
2
2

UNIT 6: Branch And Bound


General method
Traveling sales person problem
0/1 knapsack LC BB solution
0/1 knapsack FIFO BB solution
Total No.of Periods:
12. Seminar Topics
Game Trees

UNIT I

Objective:

2
2
2
2
56

2
2

2
2

2
2

2
2
2

2
2

2
2
28

Syllabus:

Learning Outcomes:

Learning Material

Assignment-Cum-Tutorial Questions
A. Questions testing the remembering / understanding level of students
I)

Objective Questions

1)
2)
3)

II) Descriptive Questions


1)
2)
3)
4)

B. Question testing the ability of students in applying the concepts.


I) Multiple Choice Questions:
1)
2)
3)
4)
5)

II) Problems:
1)
2)
3)
4)
C. Questions testing the analyzing / evaluating ability of students
1)
2)

UNIT II
Objective:

Syllabus:

Learning Outcomes:

Learning Material

Assignment-Cum-Tutorial Questions
A. Questions testing the remembering / understanding level of students
I)

Objective Questions

1)
2)
3)

II) Descriptive Questions


1)
2)
3)
4)

B. Question testing the ability of students in applying the concepts.


I) Multiple Choice Questions:
1)
2)
3)
4)
5)

II) Problems:
1)
2)
3)
4)
C. Questions testing the analyzing / evaluating ability of students
1)
2)

Academic Calendar
(Current Semester)

Department Laboratory Facilities: (Images with titles)

You might also like