C/Visual C - Data Structure and Algorithms

 
Vista:

Data Structure and Algorithms

Publicado por Adi sharma (1 intervención) el 22/05/2019 07:02:53
Can anyone tell me the right way to understand Data Structure and Algorithms or any online tutorials?
Valora esta pregunta
Me gusta: Está pregunta es útil y esta claraNo me gusta: Está pregunta no esta clara o no es útil
0
Responder

Data Structure and Algorithms

Publicado por juanba (1 intervención) el 22/05/2019 12:05:32
There are two classical books on Algorithms and Data Structures. Thay are fairly old but still valid. I do not know if any of them is available on the internet in pdf or e-book format but if you can find them they are about the best on these topics.

Algorithms and Data Structures. Niklaus Wirth. Prentice Hall. 1976

Algorithms. Robert Sedgewick. Addison-Wesley. 1983-1984

Godd luck.
Valora esta respuesta
Me gusta: Está respuesta es útil y esta claraNo me gusta: Está respuesta no esta clara o no es útil
0
Comentar
Imágen de perfil de Vijay
Val: 3
Ha aumentado su posición en 6 puestos en C/Visual C (en relación al último mes)
Gráfica de C/Visual C

Data Structure and Algorithms

Publicado por Vijay (1 intervención) el 24/06/2019 11:47:47
Hi Adi,

When I was in my engineering days then i faced the same scenario where I was not able to solve or understand the data structures and Algorithm Questions. Here I am explaining How I learnt Data Structures & Algorithm:

What to study?

Step 0 :

Understand about pointers in C++, structures or classes
Learn how to calculate worst case, best case , average case time complexities

Step 1 :

Learn few basic sorting algorithms along with their use case and time complexity.
Bubble sort
Insertion sort
Selection sort
Learn searching algorithms along with time complexity.
Linear Search
Binary Search

Step 2 :

Stack
Queue
Single Linked List (Insert at front,back,middle; Delete at front back middle)
Double Linked List
Circular Linked List

Step 3 :

Learn the following approaches in algorithms
Divide and Conquer (Merger Sort, Quick Sort, Binary Search are some examples)
Greedy method (Knapsack, Prim’s algorithm, Kruskal’s algorithm, Dijkstra, Bellmanford)
Dynamic programming (0/1 Knapsack, Travelling Salesman Problem, Coin change)
Backtracking (N Queens problem)

Step 4 :

Binary Tree
Binary Search Tree
Height of a Tree
Tree Traversal
BFS
DFS
Searching an element
AVL Tree
Hashing

Where to study from?
Learn Data Structures
MIT Introduction to Algorithm
Valora esta respuesta
Me gusta: Está respuesta es útil y esta claraNo me gusta: Está respuesta no esta clara o no es útil
0
Comentar