TIN093 Assignment 1
Danqing Li - 950121-C669 Robert Grzelka - 911009-T437
1.1. Complexity analysis of prime(n):
In the basic programming course (at least on Physics dept.) there has been a programming assignment where you generate all primes between 2..n. One simple way of doing it is to use Eratosthenes sieve:
- create an array 2..n filled with “true” booleans.
|#Dependencies: Install Mono from the official repositories;|
|#the version in most distribution repositories is too out of date.|
|#The mono-devel package is what you need.|
|sudo apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv-keys 3FA7E0328081BFF6A14DA29AA6A19B38D3D831EF|
|echo "deb http://download.mono-project.com/repo/ubuntu xenial main" | sudo tee /etc/apt/sources.list.d/mono-official.list|
|sudo apt-get -y update|
|#Create an empty base directory|
|git clone git://github.com/rafi/vim-config.git ~/.RafiVim|
|ln -sf ~/.RafiVim ~/.config/nvim|
|pip3 install --user --upgrade PyYAML|
|Hi @robgrzel , there are two files for user customization|
|~/.EverVim.vimrc is for global user config that will override the default|
|YOUR_PROJECT/.EverVim.project is for per-project settings that overrides the default and the global user config. You can just simply put this file in the project root directory.|
|As for user-defined keymappings, it's just how you normally define vim keymaps. You can add key mapping to one of those files above. For example|
|" in one of your project root|
|nnoremap <Leader>mb :!cd build; cmake ..; make -j|
|#Ubuntu LLDB for vim config|
|sudo apt install -y clang libclang-$_V_ libclang-dev \|
|liblldb-3.8 libllvm-3.8 python3-future python-lldb-$_V_ lldb-$_V_ && \|
|cd /usr/lib/llvm-$_V_/lib/python2.7/site-packages/lldb && \|
|sudo ln -sf ../../../liblldb.so.1 _lldb.so && \|
Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help
This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.
Data Structure Basics
- Stores data elements based on an sequential, most commonly 0 based, index.
- Based on tuples from set theory.