As you are looking for pune university B.E. Computer Engineering program Syllabus, so on your demand I am providing same for you:


Unit
Content
Hrs
I
Problem solving and Algorithmic Analysis
6
Problem solving principles: Classi cation of problem, problem solving
strategies, classi cation of time complexities (linear, logarithmic etc)
problem subdivision { Divide and Conquer strategy.
Asymptotic notations, lower bound and upper bound: Best case, worst case,
average case analysis, amortized analysis. Performance analysis of basic
programming constructs. Recurrences: Formulation and solving recurrence
equations using Master Theorem.
II
Greedy and Dynamic Programming Algorithmic Strategies
6
Greedy strategy:
Principle, control abstraction, time analysis of control
abstraction, knapsack problem, scheduling algorithms-Job scheduling and
activity selection problem.
Dynamic Programming:
Principle, control abstraction, time analysis of
control abstraction, binomial coe
cients, OBST, 0/1 knapsack, Chain Matrix
multiplication.
III
Backtracking and Branch-
n
-Bound
8
Backtracking:
Principle, control abstraction, time analysis of control
abstraction, 8-queen problem, graph coloring problem, sum of subsets
problem.
Branch-
n
-Bound:
Principle, control abstraction, time analysis of control
abstraction, strategies { FIFO, LIFO and LC approaches, TSP, knapsack
problem.
IV
Complexity Theory
6
Overview:
Turing machine, polynomial and non-polynomial problems,
deterministic and non-deterministic algorithms, P class, NP class &
NP complete problems- vertex cover and 3-SAT and NP{hard problem {
Hamiltonian cycle. The menagerie of complexity classes of Turing degrees.
Concept of randomized and approximation algorithms: Solving TSP by
approximation algorithm, Randomized sort algorithms and Approximating
Max Clique.
V
Parallel and Concurrent Algorithms
6
Parallel Algorithms:
Sequential and parallel computing, RAM &
PRAM models, Amdahl's Law, Brent's theorem, parallel algorithm analysis
and optimal parallel algorithms, graph problems (shortest paths and
Minimum Spanning Tree, Bipartite graphs )
Concurrent Algorithms:
Dining philosophers problem

Pune university B.E. Computer Engineering program Syllabus,

Attached Files

Pune university B.E. Computer Engineering program Syllabus.pdf (267.2 KB, 54 views)