Scribd
Upload
3 views

Algo

The document outlines various fundamental concepts in algorithms, including definitions, complexities, and specific algorithms such as sorting and searching techniques. It covers topics like asymptotic notation, different algorithmic strategies (Divide and Conquer, Greedy, Dynamic Programming), and data structures like stacks, queues, and trees. Additionally, it discusses graph theory, hashing, and string matching algorithms, providing a comprehensive overview of algorithmic principles and their applications.

Uploaded by

haranbasak0001
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
3 views

Algo

The document outlines various fundamental concepts in algorithms, including definitions, complexities, and specific algorithms such as sorting and searching techniques. It covers topics like asymptotic notation, different algorithmic strategies (Divide and Conquer, Greedy, Dynamic Programming), and data structures like stacks, queues, and trees. Additionally, it discusses graph theory, hashing, and string matching algorithms, providing a comprehensive overview of algorithmic principles and their applications.

Uploaded by

haranbasak0001
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/ 2

Algo

1. What is an algorithm and what is the Complexity of the Algorithm?

2. Stack – PUSH , POP algorithm, Queue- Enqueue, Dequeue algorithm.

3. What is asymptotic notation? Types & Difference.

4. Short note on : Divide and Conquer, Greedy & Dynamic Prog.

5. Difference between Divide and Conquer, Greedy & Dynamic Prog.

6. Algorithm of bubble sort, quick sort, insertion sort with example.

7. Time complexity analysis of merge sort, heap sort, quick sort.

8. Difference between merge sort and quick sort.

9. Difference between insertion sort and selection sort.

10. short note on the following:

a) Counting sort

b) Radix sort

e) Bucket sort

d) Shen sort

11. Binary search iterative & recursive algorithm with time complexity.

12. Define Hashing.

13. What is collision? Different Collison avoidance/resolution techniques.

14. Explain Linear Probing & Quadratic Probing with example.

15. AVL Tree construction & algorithm.

16. Different terminologies of graph.

17. What is MST? Prims & Krushkal algo numericals.

18. Representation of graph.

19. What is a complete graph? Show that the sum of degree of all the vertices in a graph is always
even.

20. Explain Dijkstra algorithm & its numericals.

21. Explain Bellman ford algorithm & its numericals.

22. What is topological sorting with examples.

23. What Rabin-Karp algorithm? Explain it with an example.

24. What are the components of Knuth Morris Pratt algorithm? Explain it with example.
25. Explain Boyer Moore string matching algorithm.

26. Which sorting algorithm should we use for string? Describe with its features.

27. Time complexity related numerical (Substitution method, tree based method, master theorem).

You might also like