How can one be well prepared to answer data structure/algorithm questions in int

Author Topic: How can one be well prepared to answer data structure/algorithm questions in int  (Read 1235 times)

Offline rashidacse

  • Full Member
  • ***
  • Posts: 103
  • Test
    • View Profile
Here was the list I used:

    LinkedList
    Stack
    Queue
    Priority Queue
    Graph
    Heap


    Depth-First Search
    Breadth-First Search
    Dijkstra's algorithm
    Floyd-Warshall
    Traveling Salesman


    Bubble Sort
    Quick Sort in-place
    Insertion Sort
    Heap Sort
    Bucket Sort
    Radix Sort


    Binary Search
    Binary Search Tree
    AVL Tree
    Red-Black Tree

Offline kaushik.swe

  • Full Member
  • ***
  • Posts: 140
    • View Profile
    • Site at DIU
Last two weeks I was looking for a list of algorithms for an interview i may face near future.

Thank you very much for listing them all together and sharing the list here in the forum.
Kaushik Sarker
Associate Head & Assistant Professor
Department of Software Engineering, FSIT
Daffodil International University