ALGORITHMS AND DATA STRUCTURE

Add to Favourites
1 1 1 1 1
Price: 3663 EUR 3663 EUR
Contact Piazza Pugliatti, 1, Messina , 98122, Sicilia, Italy

Description

Course programinorder - Binary search trees: definition, operations (insert, delete, search) - Python implementation of trees using dictionaries - Binary heaps: max-heap, min-heap, insert / remove elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms. inserting / removing elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms. inserting / removing elements, Python heapq module - Graphs: definitions, data structures (edge ​​list, adjacency list, adjacency matrix). Exploration of a graph (in depth and in breadth). Minimum paths from single source: Dijkstra algorithm. Minimum coverage trees: Prim-Jarnik and Kruskal algorithms. - Python implementation using dictionaries 4. Sorting - Heapsort - Quicksort - Linear sorting: counting sort - Computational cost of the sorting algorithms.

Specific details

Category of Education Computer Sciense and IT
Sectors Other service activities
Classification Other personal service activities

Location

Italy
Piazza Pugliatti, 1, Messina , 98122, Sicilia, Italy

External Links

More details

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

Approximation algorithms, Part I How efficiently ...
Statistical experiment design and analytics are at ...
The courses in the XSeries are designed to help pe ...
The goal of this course is to give you solid found ...

 

©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net