News:

Daffodil International University Forum contains information about Open Text material, which is only intended for the significant learning purposes of the university students, faculty, other members, and the knowledge seekers of the entire world and is hoped that the offerings will aide in the distribution of reliable information and data relating to the many areas of knowledge.

Main Menu

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

Started by rashidacse, November 28, 2015, 12:53:22 PM

Previous topic - Next topic

rashidacse

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

kaushik.swe

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