DTA-UIT / Design-Analyse_Algorithm

Design and Analyse algorithms

Design and Analysis of Algorithm

Lecturer:

• Nguyen Thanh Son, MSc

Group ID: N008

Team member:

No.	Full name	Student ID	Team role	Github
1	Dzung Bui Tri	19521386		BTrDung
2	Tan Ngoc Pham	19520925		ngctnnnn
3	An Khanh Vo	19520007		vokhanhan25

Process:

• Week 1

  • 1.1 Introduction

• Week 2

  • 2.1 Computational Thinking
  • 2.2 Abstraction - TaoBien

• Week 3

  • 3.1 Complexity Algorithm
  • 3.2 Assignments
    • 3.2.1 - VT50_SEAWEED
    • 3.2.2 - VR06_BOT
  • 3.3 Analysis Complexity of Heap Sort

• Week 4

  • 4.1 Complexity Recursive Algorithm
  • 4.2 Analysis Complexity of Merge Sort

• Week 5

  • 5.1 Program Correctness
  • 5.2 Assignments
    • 5.2.1 VV27_S-Index
    • 5.2.2 VU33_MAXSTR
    • 5.2.3 VS05_Ceramic

• Week 6

  • 6.1 Brute Force

• Week 7

  • 7.1 Back Tracking
  • 7.2 Assignments
    • 7.2.1 VQ30_Renewed
    • 7.2.2 VS02_NewNum
  • 7.3 Special Assignments
    • 7.3.1 Peg Soliatire

• Week 8

  • 8.1 Divide and Conquer
  • 8.2 Assignments

• Week 9

  • 9.1 Branch and Bound
  • 9.2 Assignments
    • 9.2.1 VQ21_Wall
    • 9.2.2 VU20_Fraction

• Week 10

  • 9.1 Geometry
  • 9.2 Presentation

• Self-practice

  • Atcoder
    • Beginner 205
    • Beginner 206
    • Beginner 207
    • Grand 057
  • Codeforces
    • Round #725 (Div 3)
  • E-Olymp
    • STL Intro
    • Sort & Search