design and analysis of algorithm

Attribution Non-Commercial (BY-NC)

259 views

design and analysis of algorithm

Attribution Non-Commercial (BY-NC)

- Sudesh New Resume[1][1]
- Book Details
- relcat (Hodges 2)
- Composite
- 0066333_failed_log
- TransTransactions Study Guideactions Study Guide
- pkanavu1
- VBI-Tree
- Weather Data
- 24_118_ps7
- Sis Pro
- Excel if Function
- Calculus of Relations
- Design And Analysis of Algorithms Lab
- Example
- Palabre Client Uml
- materi-8-aljabar-relasional-3
- Rajnish Dubey RC1200
- Senarios.ds
- TASKS of a Basis Administrator

You are on page 1of 2

OF ENGINEERING

Trade : CSE/IT

UNIT - 2

1. Prove that a red-black tree with n internal node has height at most 2lg(n+1).

2. Show the result of inserting the keys

F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E

in order ,in an empty B-tree.Use t=4, where t is min degree of B-tree.

3. Write an algorithm to perform insertion into a B-tree

4. What are three different cases, where inserting a node into a Red Black Tree ?

Explain with example.

5. Explain the different conditions of getting union of two existing binomial heaps.

UNIT – 3

1. Explain dynamic programming. Apply it on Matrix Chain-Multiplication problem.

2. Explain 0/1 and fractional knapsack problem with the help of greedy algorithm.

3. What are different Greedy Criterion ? Explain.

Consider the five items along with their respective weights and values :

I = { I1, I2, I3, I4, I5 }

W = {5, 10, 20, 30, 40 }

V = { 30, 20, 100, 90, 160 }

The knapsack has capacity W = 60 . Find the solution of the problem using the

Concept of fractional knapsack.

4. Find the amortized cost for Enqueue ( Insertion ) and Dequeue ( Deletion )

Operations in a queue using accounting method.

5. What is backtracking. Explain subset sum problem using backtracking.

UNIT – 4

1. Show how to compute transitive closure of a graph using Floyd – warshell’s

algorithm for all pairs shortest paths.

2. What is minimum spanning tree of a graph ? Describe PRIM’s algorithm to find

MST alongwith its running time

3. Explain and write the Bellman – Ford algorithm. You are also required to find the

running time of the algorithm.

4. Prove that if the weights on the edge of the connected undirected graph are distinct

then there is a unique Minimum Spanning Tree. Give an example in the regard. Also

Discuss Kruskal’s Minimum Spanning Tree in detail.

5. We would like to solve, as efficiently as possible , the single source shortest path

Problems in each of the following graphs. For each graph, state which algorithm

would be best use and give its running time :

(i) A weighted directed acycled graph.

(ii) A weighted directed graph, where all edge weights

(iii) A weighted directed graph in which some, but not all, of the edges,but

negative weights, the graph contains a directed cycle.

UNIT – 5

1. Write knuth-Morris-Pratt algorithm for string matching.

2. Show that 3-CNF is a NP-Complete class of problem.

3. Define approximation algorithms.What is approximation ratio?Approximate the

Traveling salesman problem with triangle inequality.

4. Give the randomized version of Quicksort. Analyse it for finding the expected

running time.

5. Explain and write the Naïve-String string matching algorithm :

Suppose the given pattern P = a a b and given and text T = a c a a b c.

Apply Naïve – String Matching algorithm on above Pattern (P) and Text (T) to find

the number of occurrences of P in T.

- Sudesh New Resume[1][1]Uploaded bymanvar5
- Book DetailsUploaded bySrinivasan Mathesu
- relcat (Hodges 2)Uploaded byAndrés Villaveces N.
- CompositeUploaded byRoszelan Majid
- 0066333_failed_logUploaded byBilly Turner
- TransTransactions Study Guideactions Study GuideUploaded bymarkyray
- pkanavu1Uploaded byapi-3775585
- VBI-TreeUploaded bySuradet Chaimongkol
- Weather DataUploaded bysumeet9surana9744
- 24_118_ps7Uploaded bySaifHakim
- Sis ProUploaded byeltinahut
- Excel if FunctionUploaded byMichael
- Calculus of RelationsUploaded bydaukszda
- Design And Analysis of Algorithms LabUploaded byRajendraYalaburgi
- ExampleUploaded byMani Bharathi
- Palabre Client UmlUploaded bytiaches
- materi-8-aljabar-relasional-3Uploaded byRoma Maulana Zein
- Rajnish Dubey RC1200Uploaded byjeetendrasidhi
- Senarios.dsUploaded bySrikanth Reddy
- TASKS of a Basis AdministratorUploaded byjatincoolwadhwa
- easy GameUploaded byakhil
- 28618_1_Capstone Project Report FormatUploaded byNehaVerma
- 1 set theory.pdfUploaded byAaron Marquez
- Prepare _ CodeChefUploaded byJOYDIP SARKAR
- Theodore Sider - Logic for Philosophy.pdfUploaded byAnonymous pYK2AqH
- 11_sm_2017_math_eng export (1).pdfUploaded byaakash
- Functionsandrelations4.8Uploaded byYJ OS
- LabProgsUploaded bySuper Man
- Sched LogUploaded byDa Boss
- Tugas SoftTesting.docUploaded byMuhammad Rahfiqa Zainal

- e Com AnswersUploaded byziddirazan
- AI Q1. Attempt Any FourUploaded byziddirazan
- SMP25QuesUploaded byziddirazan
- OS-25-quesUploaded byziddirazan
- E- Commerce and IWTUploaded byziddirazan
- ERP SystemUploaded byziddirazan
- computer network imp questionsUploaded byziddirazan
- Iepm AnswerUploaded byziddirazan
- Industrial Economics and Principles of ManagementUploaded byziddirazan
- ziddi razanUploaded byziddirazan

- Software Protection Through Dynamic Code MutationUploaded byAdarsh
- R LanguageUploaded byNaga Pradeep Veerisetty
- Interview prepUploaded byGaurav Sharma
- Ashutosh Jain (CISA-Qualified, CEH, M.sc IT)Uploaded byAmit Kumar
- data structure and algorithmsUploaded byamernassiri
- (Neuro Linguistic Programming) Olivia Bennett-Psychology of Success_ NLP Techniques to Master Life and Take Control Like the 1% (2014)Uploaded bySai Charan Alladi
- A Randomized Linear-time Algorithm to Find Minimum Spanning Trees (KARGER, David R.; KLEIN, Philip N.; TARJAN, Robert E., 1995)Uploaded byGaKeGui
- 99417 19020 System Software Lab ManualUploaded bystyle_kar
- ResumeUploaded byJulianWeber
- resume game jiawei guUploaded byapi-316663272
- Android.pptxUploaded byjillnuorukadhal
- Gaia_JadeUploaded byNhật Quang
- Memory ManagementUploaded byవంశీ క్రిష్ణ
- Ch01 IntroductionUploaded byMiha Essie
- 1504.05158v1Uploaded byJustin Walker
- Compiler Design Synopsis PresentationUploaded byvision_2050
- DS assignment2final.docxUploaded byVipul Nair
- Human Computer Interaction OverviewUploaded bywedanurdayat
- Database Managment SystemUploaded byMonty Aryan
- aruksha resumeUploaded byapi-304262732
- COD Lab SessionUploaded byMuhammad Salman
- The Social Design of Technical SystemsUploaded byAdrian Dabu
- confidential reportUploaded byapi-278578610
- Mixed Integer Linear ProgrammingUploaded byGaurav
- Powertrain Diagnostics Development ValidationUploaded bymnvijaybabu
- Theory of ComputationUploaded bykiransurekir
- Life Cycle of a ThreadUploaded byDilip
- p5 notes flood fill algorithm for polygon fillingUploaded byapi-263987257
- 07A5EC07-COMPUTERORGANIZATIONUploaded byRam Krish
- daa2Uploaded byEko Pradipta Mustofa Toha