Mang's Website

Longest Increasing Subsequence

The longest increasing subsequence is definied as follows: in a given array of numbers, to find a subsequence (not necessarily contiguous) that is strictly increasing which has the maximum length. The following algorithm finds the longest increasing subsequence in O(n log n) time. Key Implementation Data Structure This algorithm

CPU-Simulator

This is a project required by Prof. Stephen Kaisler in Course: Computer System Architecture. Purpose To simulate a small classical CISC computer. It has the following characteristics Registers: General Purose Registers (GPRs), Index Registers, Program Counter, etc. 18-bit words Memory of 2048 words. (Size can be set in config file)