0 views

Uploaded by Ben Rick

This is a document

- Technical Aptitude Questions eBook
- 5. Trees-1
- CIE A2 Computer science Practical Notes
- data-lec1-2011
- Banks icde 2002
- Assignment 3
- 70x70
- DS(II) Ch09 PriorityQueues
- back-matter
- MC0068 - Set 1
- AI Architectures
- Design analysis algorithm
- Adobe complete interview
- Rtu Eic Syllabus
- Data Structure Mcq 1
- 1900-8250-1-PB
- zipcfg
- 5.printerscheduling.doc
- 17 Classification Decision Tree 2017.pdf
- OLAP

You are on page 1of 3

QUESTION BANK

1. Define ADT.

2. Asymptotic notations – Define.

3. How to determine the efficiency of an algorithm?

4. Define Amortized analysis.

5. Define Recurrence relations.

6. Calculate the running time for the following code:

for(i=0;i<n;i++)

for(j=0;j<n;j*2)

k++;

7. What do you mean by Balanced trees?

8. What is a leftist heap?

9. Differentiate Binomial heap and Fibonacci heap.

10. What is a priority queue?

11. Define Cascading cut.

12. If we implement the following heap as maximum heap , adding a new node of value 15 to

the left most node of right subtree ,what value will be at leaf nodes of the right subtree of

the heap?

13. Write the pseudo code for merging two Binomial heaps.

14. What are Binary Heaps ? application area of Binary heaps?

15. What is Lazy Binomial heap?

16. Define Skew heap.

17. Define Tries.

18. What are the basic operations on splay trees?

19. What are the advantages of B trees over a binary tree?

20. Define Kd trees.

21. Define AVL tree.

22. What do you mean by Red-Black tree?

23. Give the applications of Kd – tree.

24. When it would be optimal to prefer Red-black trees over AVL trees?

25. Define k-d tree and give its applications.

26. What is 2-3 Trees ?

27. What are the applications of Trie?

28. When do we apply dynamic programming to solve the problems?

29. Write the approximate graph coloring algorithm.

30. Distinguish divide and conquer and dynamic programming.

31. Writ the applications of graph coloring problems

32. Define palindrome partitioning.

33. List out the advantage of dynamic programming over greedy technique.

34. Define 0/1 Knapsack problem.

35. Enlist the different types of Heuristic search methods. Write the components which are

common to these methods.

36. Define local search.

37. Define parallel algorithms.

38. Define Random sampling.

39. What is the need for approximation algorithms?

PART -B

1. Discuss in detail about time complexity and space complexity with an example.

2. Explain the recurrence relation using the forward and backward substitution methods

with examples

3. What are the advantages of Amortized complexity analysis over worst case analysis? Illustrate

with an example.

4. What amortized analysis? Explain in detail.

5. Discuss Min-max heap with an example.

6. Explain min-heap and its operations. Construct min-heap with the set of keys { 10, 2, 7, 6, 5, 9,

12, 35, 22, 15, 1, 3, }. Insert the elements 15, 20 and 45 using bubbling up process. Show the

Min-heap for each insert.

7. Illustrate Leftist heap with an example.

8. Explain the insert and delmin operation with algorithm for a Binomial heap for the following

keys 1,2,3,4,5,6,7

9. Write note on (i) Skew heap (ii) Lazy Binomial Heap

10. Show how do you decrease the key of a node in Fibonacci heap in O(1) amortized time and

how to delete any node from an n-node Fibonacci heap in O(D(n))amortized time.

11. Start with an empty red black tree and insert the following keys in the given order: 20, 10, 5,

30, 40, 57, 3, 2, 4, 35, 25, 18, 22, 21. Draw the figures depicting your tree immediately after

insertion and following the rebalancing rotation or color change. Label all nodes with their

color and identify the rotation type.

12. Explain insertion algorithm to Red-Black tree and insert the following keys:40,10, 30, 35, 25,

27,26, 60, 55,61,80.

13. Define a 2-d tree. Give algorithms for insert and delete operations in 2-d trees.

14. Describe LL rotation, LR rotation in an AVL tree by considering an example

15. Define height-biased min leftist trees. Give an algorithm to meld two such trees that

takes O(log n) time, where n is the total number of elements in the two trees.

16. Explain B-trees with an example. Write the applications of B-trees.

17. Discuss in detail about Binary search trees.

18. Define a 2-3-4 tree. Explain the various operations in 2-3-4 trees with example.

19. Write the general properties of Greedy algorithm.

20. Specify an algorithm for finding convex-hull of set points on a plane.

21. Illustrate Job sequencing with deadlines. Consider a set of given jobs as shown in the

following table. Find a sequence of jobs, which will be completed within their deadlines and

will give maximum profit. Each job is associated with a deadline and profit.

Job J1 J2 J3 J4 J5

Deadline 2 1 3 2 1

Profit 60 100 20 40 20

22. Describe the dynamic programming algorithm for solving the 0-1 knapsack problem. Analyse

its complexity.

23. Explain the approximate vertex cover problem with a neat diagram. Explain its operation

through pseudo code.

24. Explain Quick sort with an example.

25. Write a note on Tree vertex splitting using greedy algorithm.

26. Explain Strassen’s matrix multiplication. Give its applications.

27. Explain palindrome partitioning with suitable example.

28. Write notes on (i) Multistage graph (ii) Palindrome partitioning.

29. Give a detailed account on models of parallel algorithm.

30. Explain various heuristic algorithms in detail.

31. Explain NP hard TSP problem using approximate algorithm.

32. Write notes on (i) Simulated Annealing (ii) Distributed Computation.

33. Elucidate various heuristics algorithms and their applications.

- Technical Aptitude Questions eBookUploaded byCijo Robert
- 5. Trees-1Uploaded bySarthak Patel
- CIE A2 Computer science Practical NotesUploaded bySulaiman Javed
- data-lec1-2011Uploaded bySaurabhMishra
- Banks icde 2002Uploaded byTejesh Kumar
- Assignment 3Uploaded bySai Charan
- 70x70Uploaded bylazygurram
- DS(II) Ch09 PriorityQueuesUploaded bymadirikiran
- back-matterUploaded bysonara28
- MC0068 - Set 1Uploaded bynikeneel
- AI ArchitecturesUploaded bydagush
- Design analysis algorithmUploaded byshruti5488
- Adobe complete interviewUploaded byDiwas Sharma
- Rtu Eic SyllabusUploaded bymanish_chaturvedi_6
- Data Structure Mcq 1Uploaded byAnser Pasha
- 1900-8250-1-PBUploaded byWalter Mayor
- zipcfgUploaded byGilsonCosta
- 5.printerscheduling.docUploaded bySuganya Periasamy
- 17 Classification Decision Tree 2017.pdfUploaded byihab79
- OLAPUploaded bysudh
- PhysRevLett.103.218701Uploaded bypinakichem
- Interview GuideUploaded byMohammad Asif
- R1-99d79Uploaded byDorothy Manrique
- Technical Aptitude Questions eBookUploaded byjoshidivyasri
- nwerc09Uploaded byQharl0s
- CS2201 Data Structure TutorialUploaded byYogesh Yadav
- Lowest Common AncestorUploaded byRaqibul Islam
- Technical Aptitude QuestionsUploaded byMuthu Krishnan
- DDS ManualUploaded byPedro Ignacio Toledo Muñoz
- B_Trees_And_B__TreesUploaded byDavid_18360

- JNTUKAcademics.docUploaded byBhanusekharKalaga
- Software Quality AssuranceUploaded byalhassan007
- DS oopsUploaded bySharmila Packiavathy
- JOURNAL IMPACT FACTOR 2015.pdfUploaded bymalini72
- face recognitionUploaded byGeorgeAzmir
- Tejaa.CSIRUploaded bysree7krish
- CMG Numerical MethodsUploaded bytsanshine
- autoprob3Uploaded byAnuja Tandale
- Coa 1Uploaded byAdarsha Bhattarai
- 2018 Luv SupercomputersUploaded byLev Lafayette
- ABAP Interview Questions and AnswersUploaded bydipanshuroy
- Slides12 Viola Jones Face DetectionUploaded byMinh Trung Lương
- lecture04-4Uploaded bykavithaangappan
- CS2352 - Principles of Compiler Design.pdfUploaded byprashant078
- Problem - Counting InversionsUploaded bySalman Ahmed
- Tut3 Sofware EngineUploaded byHazwan Afiq Kaswuri
- CFPRM ColdFire Programmer Reference ManualUploaded bykiwiapple8888
- (Www.examforyou.blogspot.com)-ABB Placement Sample Paper 1Uploaded byChandra Sekhar Naidu Atchuta
- Project ReportUploaded byHimani Pandey
- Chapter 2.1.pptUploaded byHosam Ali
- ICCSA 2016 ProgramUploaded byZellagui Energy
- EOC1.pdfUploaded byAiynna Adnan
- Exam2Uploaded byhamz56787298
- Applying Genetic Algorithms to Evolve Strategy in Mastermind GameUploaded byFabrício Henrique Rodrigues
- Huong Dan Lap Trinh Vdk Arm Co BanUploaded byLu Xu Bu
- mem5Uploaded byapi-3738981
- CS504Final_Term_11_Aug_2010_Solved.docUploaded byhassan_m2222
- Cognitive Science, Daniel AndlerUploaded byaltemio
- 08IntractabilityIIUploaded bySheetanshu Sinha
- Turing MachinesUploaded bykmatombo