Kurt's Blog

We can be heroes, just for one day


  • Home

  • About

  • Archives

  • Tags

COMP2511 Design Pattern (Part 2)

Posted on 2018-11-05 | | Visitors
Week 4 (OO Design Principle)Design Principle 3Identify aspects of your code that varies and encapsulate and separate it from code that stays the same, ...
Read more »

MATH2871 Review (Part 2)

Posted on 2018-10-31 | | Visitors
Chapter 8: Validating and Cleaning Data Data errors occur when data values are not appropriate for the SAS statements that are specified in a program ...
Read more »

MATH2871 Review (Part 1)

Posted on 2018-10-30 | | Visitors
This is a review of MATH2871, just to prepare for my final exam. Chapter 2: Getting Started Data step are typically used to create SAS data sets. Proc ...
Read more »

COMP2511 Review (Part 1)

Posted on 2018-10-28 | | Visitors
Haven’t write any thing since last year, thinking might be better to write something than just leave this blog as it is. This article is a brief revie ...
Read more »

R Notes | Set 0

Posted on 2017-08-21 | | Visitors
这学期选了一门课,叫 Statistics Test (STAT2912)讲的是各种奇奇怪怪的 test,包括 parametric test & non-parametric test并不喜欢这门课,数学里最讨厌的就是统计和概率论了 最初为什么要选这门课啊 ==__== 简直是作死但现在都 ...
Read more »

2017年8月14号的一些闲言碎语

Posted on 2017-08-14 | | Visitors
2017-08-21 Update之前写过很多字,现在删掉了 一切都好,只缺烦恼 – 王菲《浮躁》 :)
Read more »

MOOC List (持续更新)

Posted on 2017-08-14 | | Visitors
在计算机领域有很多好学校,像 MIT,Princeton,Stanford ……当然也有很多 Online Course Website:edX, Coursera, Udacity ……很多课都非常厉害,感觉不好好学简直就是暴殄天物啊打算在这一篇文章中整理一下我想学的,已经学过的和正在学的公开课 ...
Read more »

Algorithms | BFS & DFS

Posted on 2017-08-12 | | Visitors
这一篇笔记来谈谈有关图的算法 先来看看图的分类:一般来说,图分为有向图和无向图两种,在此基础上每条边可能还会有 weight在图中,每个点称为 vertex,每条边称为 edge,图用 G = (V, E) 来表示V 是所有 vertex 的集合,E 是每条边 (v, w) 的集合 上图里左边表示 ...
Read more »

Princeton Algorithms Notes | Set 1

Posted on 2017-07-29 | | Visitors
这是 Princeton Algorithms Course 的第二篇笔记对应的 lecture 是 coursera 上的第二周的内容包括了 Bags, Stack, Queue, Iterator & Elementary Sort由于之前我们已经讨论过 Stack 和 Queue,在此 ...
Read more »

MIT 6.006 Notes | Heap & Heap Sort

Posted on 2017-07-26 | | Visitors
Priority Queue: A data structure implementing a set S of elements, each associated with a key, supporting the following operations:1234insert(S, x): i ...
Read more »
123
Kurt

Kurt

Living Like Jim Morrison

21 posts
9 tags
github
© 2017 - 2018 Kurt
Powered by Hexo
Theme - NexT.Pisces