8/10/2019 Teaching Plan DAA
1/6
PRIYADARSHINI BHAGWATI COLLEGE OF ENGINEERING,NAGPUR
(Formerly known as Smt. Bhagwati Chaturvedi College of
Engineering)
____________________________________________________________________________________________
Department of Computer S !en e
A a"em! Se##!on $%&'(&) *o"" #eme#ter+IDEAL TEACHING
PLAN
Name of #ta -r#. /0u#01oo 2a!n
YearSu13e tDepartment
B.E. F!ft0 Seme#terDe#!4n 5 Ana67#!# of A64or!t0m#Computer S !en
e
Num1er of 6e ture#per 8ee9
) T0eor7
O13e t!:e:
The objective is to study paradigms and approaches used to
analyze and designalgorithms and to appreciate the impact of
algorithm design in practice. It also ensures thatstudents
understand how the worst-case time complexity of an algorithm is
defined, howasymptotic notation is used to provide a rough
classification of algorithms, how a number of algorithms for
fundamental problems in computer science and engineering work and
comparewith one another, and how there are still some problems for
which it is unknown whether thereexist efficient algorithms, and
how to design efficient algorithms.
Ut!6!t7; ome current day uses of algorithm design can be found
in internet retrieval processesof web crawling, packet routing and
caching. !ainframe programming languages such as "#$%#&for
Algorithmic l anguage', (%)T)"* , +% %# , # I, "I# , and *% %# are
computing tools to
implement an /algorithm design/... but, an /algorithm design/
&a d' is not a language. "n a d can be a hand written process,
e.g. set of e0uations, a series of mechanical processes done by
hand,an analog piece of e0uipment, or a digital process and or
processor.
Un!t No.
5 Name
No.
of
Wee9
#
No.
of
Per!o
"# ;
0
0% 0 !0 !#01$ multistage graphs,
0$ 0 !0 !#01$ all pairs shortest path,
0' 11!0 !#01$
single sourceshortest paths,
0" 1#!0 !#01$
single sourceshortest paths,
%
01 1%!0 !#01$ optimal binary search trees,
0# #0!0 !#01$ optimal binary search trees,
0% #1!0 !#01$ traveling salesman problem,
0$ ##!0 !#01$
#ongest +ommonubse0uence problem
0' #%!0 !#01$
#ongest +ommonubse0uence problem
0" #'!0 !#01$ 6 7 5napsack roblem,
%?
01 #"!0 !#01$
+hained !atrix !ultiplication
0# # !0 !#01$
+hained !atrix !ultiplication
UNIT >; 0% # !0 !#01$
asic Traversal and earch Techni0ues,
0$ 01!0 !#01$
breadth first search and depth first search,
0' 0#!0 !#01$
breadth first search and depth first search,
0" 0#!0 !#01$
connectedcomponents.
8/10/2019 Teaching Plan DAA
6/6
%?
01 0$!0 !#01$
acktracking basic strategy, 8-9ueen:s problem,
0# 0'!0 !#01$
8-9ueen:s problem
0% 0"!0 !#01
$
graph coloring,
0$ 10!0 !#01$
;amiltoniancycles etc,
0' 11!0 !1$ Introduction to "pproximation algorithm
Un! No; >I 0" 11!0 !1$ * -hard and * -complete problems,
basic concepts,
10
01 1#!0 !1$ non-deterministic algorithms,
0# 1%!0 !1$ non-deterministic algorithms
0% 1"!0 !1$ * -hard and * -complete
0$ 1 !0 !1$ decision and optimization problems,
0' #0!0 !1$
##!0 !#01$
graph based problems on * rinciple.
*+*,- 10 "0
Signature SignatureSignature
hush/oo ain r. .S.Chaudhari2r. 3. ..Choudhari(Su/4e5t *ea5her)
(6+2 CSE 2e7tt.)
( 8rin5i7al )
