Daffodil International University

Faculty of Science and Information Technology => Science and Information => Topic started by: rashidacse on November 28, 2015, 12:53:22 PM

Title: How can one be well prepared to answer data structure/algorithm questions in int
Post by: rashidacse on November 28, 2015, 12:53:22 PM

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

Title: Re: How can one be well prepared to answer data structure/algorithm questions in int
Post by: kaushik.swe on December 15, 2015, 03:39:34 PM

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.