Scribd
Upload
7 views3 pages

Daa - Imp Topics

Uploaded by

B34-Samruddhi Latore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views3 pages

Daa - Imp Topics

Uploaded by

B34-Samruddhi Latore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Ono CLnaly81S of AlgoiAaum

Des'g

Unit ll Greedy And Dynamic Programming algorithmic 08 Hours


Strategies

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,

binomialcoefficients,
OBST
0/1 knapsack,
Chain Matrix multiplication.

Unit IV Backtracking and Branch-n-Bound 08 Hours


Backtracking:
Principle,
control abstraction,

time analysis of control abstraction,

8-queen problem,
graph coloring problem,
sum of subsets problem.

Branch-n-Bound: s Gacklsde kiuq diffrece


Principle,
Study material provided by: Vishwajeet Londhe

Join Community by clicking below links

Telegram Channel

https://t.me/SPPU_TE_BE_COMP
(for all engineering Resources)

WhatsApp Channel
(for all tech updates)

https://whatsapp.com/channel/0029ValjFriICVfpcV9HFc3b

Insta Page
(for all engg & tech updates)

https://www.instagram.com/sppu_engineering_update
Cmd amalySIS
Deiq
Algoihum Parallel loops,
Race conditions.

Problem Solving using Muitithreaded Algorithms

Multithreaded matrix multiplication,


control abstraction,
Multi threaded merge sort.
time analysis of control abstraction,
Distributed Algorithms
strategies
Introduction,
FIFO,
Distributed breadth first search,
LIFO and LC approaches, Distributed Minimum
TSP,Taelhnqlale perdon)
SpanningTree.)
knapsack problem.
String Matching
Introduction,
Unit VAmortized Analysis 07 Hours
The Naive string matching algorithm,
Amortized Analysis:
The Rabin-Karp algorithm.
Aggregate Analysis,
Accounting Method,
Potential Function method,

Amortized analysis

binary counter,
stack Time-Space tradeoff,

Introduction io Traciahle and Non-

tractable Problems,
Introduction to Randomized and Approximate algorithms,

Embedded Algorithms:

Embedded system scheduling (power optimized scheduling algorithm),


Sorting algorithm for embedded systems.

07 Hours
Unit VI Multithreaded And Distributed Algorithms
Multithreaded Algorithms

Introduction,
Performance measures,

Analyzing multithreaded algorithms,

You might also like