zhenghaoz

#include <memory>
#include <vector>
#include <iostream>

template <unsigned N, typename Key, typename Value>
class BTree
{
	template <typename T> using vector = std::vector<T>;
	template <typename T> using shared_ptr = std::shared_ptr<T>;

kowakowa93

#CMU Course Info 整理自一亩三分地

##08722 – Data Structurefor application programmers 这门课主要是开给EBIZ和MISM的，在MISM那边的课号是95772. 但是很多ECE, INI的同学，以及咱ME转CS帮都在上这门课。这门课只有半学期，一共6个credits，相当于1.5学分。内容非常基础，但是我觉得帮助挺大的，对于非CS科班出身想转CS的同学非常建议上一下， 基础越弱收获越大，要是基础比较硬的话就不用上了。LZ上的其它CS的课几乎都是各种牛校的PHD出身，这门课的老师好像都没有PHD学位，肯定没法去上15的课，但是讲课挺用心，讲的也很清楚。讲课这东西真的不是老师自己越牛就讲的越好。尤其数据结构这种比较基础的内容。这门课从最简单的内容讲起，包括array, arraylist, linked list, stack, queue,sorting(bubble, selection, insertion, merge, quick, heap), hashTable, hashMap,hashSet, BST, TreeMap, TreeSet, Huffman coding, Heap. 每周一次quiz, lab, homework。讲的时候内容都围绕Java Collection 来讲，还涉及与collection有关的comparator, iterator 等内容。这门课完全就是针对面试的，作业要求先手写代码（虽然大部分时候都是先ECLIPSE敲好再抄到纸上的）。

6次homework，前面的非常简单，后面稍微麻烦一点，难度都不大，就是让你去熟悉这些数据结构能自己implement，也能用JAVA COLLECTION。

1. 自己implement 一个 arraylist 实现各种要求
2. Queue, stack 的implement和应用

kowakowa93

(text of an email to the class from Dave O'Hallaron)

I've noticed that a number of you are having trouble getting started
with Lab 6. The purpose of this note is to help you get started by
guiding you through the initial steps I take when I do the lab.

This lab is too hard to do all at once, so I break it up into more
managable pieces. I start by developing a simple implicit list
allocator. Later, I will improve this code with a faster and more
memory efficient free list organization. But by starting with the

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD