RESERVE MY SPOT
Norge was born in 1992 in Cuba. He started his Computer Science Bachelor in University of Havana in 2011 graduating with honors in 2016.
While studying in Havana he started training for programming competitions being able to participate in the 2016 ACM-ICPC World Finals in Phuket, Thailand.
After graduation started working as a professor of Compilation and Formal Language Theory and as a trainer for teams starting in competitive programming.
He then started working at Harbour.Space University as Lecturer in the Data Science Program.
The class covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming, and many others.
You will learn how to sort and search data, how to break a large problem into pieces and solve them recursively; how to pack your knapsack using greedy algorithms, and how to search for similarities between genes using dynamic programming.
You will practice solving computational problems, designing new algorithms, and implementing them as efficient software tools.
SKILLS:
- Deep Learning
- Machine Learning
- Computer Science
- Discrete Mathematics
- Software Engineering
- Algorithms & Data Structures
- C++
- Python
- Java
DATE: 18 Feb - 8 Mar, 2019
DURATION: 3 Weeks
LECTURES: 3 Hours per day
LANGUAGE: English
LOCATION: Barcelona, Harbour.Space Campus
COURSE TYPE: Offline
WHAT YOU WILL LEARN
COURSE OUTLINEABOUT NORGE
BIBLIOGRAPHYHARBOUR.SPACE 
The best-chosen algorithm makes sure the computer will do the given task in the best possible manner.
In cases where efficiency matters, a proper algorithm is really vital to be used. An algorithm is important in optimising a computer programme according to the available resources.
NORGE VIZCAY
HARBOUR.SPACE UNIVERSITY
DATE: 18 Feb – 8 Mar, 2019
DURATION: 3 Weeks
LECTURES: 3 Hours per day
LANGUAGE: English
LOCATION: Barcelona, Harbour.Space Campus
COURSE TYPE: Offline
Session 2
Binary search
Session 3
Big-O Notation
Session 1
Intro to Algorithms
All rights reserved. 2018
Session 4
Master Theorem
The best-chosen algorithm makes sure the computer will do the given task in the best possible manner.
In cases where efficiency matters, a proper algorithm is really vital to be used.
An algorithm is important in optimising a computer programme according to the available resources.
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, & Clifford Stein The MIT Press, 3d Edition, 2009)
INTRO TO ALGORITHMS & DATA STRUCTURES
INTRO TO ALGORITHMS & DATA STRUCTURES
