Programming - SXKDZ

Python 旋风之旅

Python 旋风之旅中文翻译版 Python 官方教程的开头是这样写的：“Python 是一门既容易上手又强大的编程语言。”随着大数据、机器学习与人工智能的兴起，Python 语言正在受到越来越广泛的关注和应用。对爱好Python 的人来说，人生苦短，Python 当歌！简洁轻松的语法，开箱即用的模块，强大快乐的社区，总可以快速构建出简单高效的解决方案。对于希望快速入门 Python 语言的读者们来说，市面上众多像字典一般厚厚的 Python 书籍常常让人感到头皮发麻。为了让对 Python 语言感兴趣的读者能快速入门这门语言，而非过分纠结于Python 细枝末节之处，我们选择并翻译了这本Python 教程：A Whirlwind Tour of Python。这本仅 100 余页的小册子是一本精简的 Python 编程入门教程，介绍了 Python 语言的核心特性以及数据科学领域内一些 Python 第三方扩展包的实际应用，目的是让熟悉其他编程语言的数据科学家快速学习 Python。

Programming

MIT 6.828 JOS Lab 5 Report

MIT 6.828: JOS Lab Lab 5: File System, Spawn and Shell Questions Answer the following questions: Do you have to do anything else to ensure that this I/O privilege setting is saved and restored properly when you subsequently switch from one environment to another? Why? Nothing else needs

Programming

MIT 6.828 JOS Lab 4 Report

MIT 6.828: JOS Lab Lab 4: Preemptive Multitasking Part A: Multiprocessor Support and Cooperative Multitasking Questions Answer the following questions: Compare kern/mpentry.S side by side with boot/boot.S. Bearing in mind that kern/mpentry.S is compiled and linked to run above KERNBASE just like everything

Programming

MIT 6.828 JOS Lab 3 Report

MIT 6.828: JOS Lab Lab 3 Part A: User Environments and Exception Handling Questions Answer the following questions: What is the purpose of having an individual handler function for each exception/interrupt? (i.e., if all exceptions/interrupts were delivered to the same handler, what feature that exists in

Programming

MIT 6.828 JOS Lab 2 Report

MIT 6.828: JOS Lab Lab 2 Questions Assuming that the following JOS kernel code is correct, what type should variable x have, uintptr_t or physaddr_t? mystery_t x; char* value = return_a_pointer(); *value = 10; x = (mystery_t) value; The type of x will have to be

Programming

MIT 6.828 JOS Lab 1 Report

MIT 6.828: JOS Lab Lab 1 Part 2: The Bootloader Exercise 3: Take a look at the lab tools guide, especially the section on GDB commands. Even if you're familiar with GDB, this includes some esoteric GDB commands that are useful for OS work. Set a breakpoint at address

Concurrency Models

Concurrency Models #0: Introduction

Concurrency Models #0: Introduction Concurrency Models #1: Parallel Algorithms Preface Concurrency is nothing new, but it becomes one of hottest topics among sub-disciplines of CS nowadays. It is also the key that unlocks responsiveness, fault tolerance, efficiency, and simplicity in a system. Next semester (Fall 2017) I will share some

Programming

One Historical Story

As recently as the 1980s, it was normal for "real-world" programmers to laugh at the idea of structured programming languages with such arcane features as "while" loops, as opposed to the jump instructions of assembly languages. How could a program written in a structured language possibly

Presentation

Presentation: Going Computational Thinking

This week, I presented a speech on the going computational thinking. This will be the last general-purpose presentation I held in undergraduate school. I still remember that when I was in the primary school, I was the student who always remained silent. Until the middle stage of junior high school,

Hackathon

Penta-Hackathon 2016 参赛总结

11月26 - 27号参加了人生中第一次 Hackathon 类比赛，主题是 Hack for AI (both artificial intelligence and 「愛」)，坐标上海闵行区紫星路999号微软亚太技术支持中心（MS APGC CSS）。 Day 0: Preparation 赛前组队可以说是一个赶鸭子上架的过程，我们 Effervesce 队的四个队员——我、毛毛、小金、一非——都是 freshmen，而且是在报名截止的当天才决定参赛，所以直到参赛之前都觉得有点虚。赛前我们开了一次组会，收集了大家的想法，决定利用微软提供的 HoloLens 开发一个入口类应用，但是由于经验不足，我们的想法显然非常 naive，在手头没有 simulator，完全不会 Unity 建模，完全不熟悉 API 的情况下一天时间上手 HoloLens

Algorithm

Algorithm: An Application of Bitmap Data Structure

0x00: General Introduction Bitmap is a very useful data structure which is widely used in indexing, data compressing and other situations. It doesn't only demand little memory, but also has an optimized time performance. 0x01: Lead-In: Company Problem Description There's a company with a staff of \(n\) numbered from \(1\

Programming

Why Programmers Like to Set Infinity to 0x3f3f3f3f

It's common to set an constant variable representing infinity. For example, to find the minimum number among a list, it's necessary to set an a having the maximum value and change its value later. Obviously, computers have no fixed way representing the concept "Infinity". So we can only

Programming

趣题：程序填空一则

Samhjn在群里分享了一个问题：请补充完成以下 C++ 程序的f函数，使得run函数得到执行。你补充的代码必须符合以下要求：必须在一行之内完成补充的代码；补充部分不得超过19个字符；不能使用如下关键字、标识符或操作符：main、run、asm、#、&、*、%、/、_、(、,；只能使用一个分号。 (Copyright ©️ Microsoft Student Club @ Wuhan University) #include <cstdio> void run(void) { printf("Hello Microsoft Student Club!\n"); return ; } int f(void) { // write your code here } int main(void) { if (f() != f(

Programming

趣题：不用乘除法、循环、分支语句计算等差数列的和

2老师分享了一道有趣的题目：求\( 1+2+\dots+n \)，要求不能使用乘除法、for、while、if else和switch case等关键字以及条件判断运算符 (A ? B : C)。一开始看到这个题确实是蒙的，只想到内嵌asm然后可以通过jmp语句实现跳转。经过samhjn的提醒，可以使用递归，但是还是不会解决跳转的问题。继续提醒在这里需要利用短路求值的特性，以下代码来自swx： #include <iostream> using namespace std; int sum = 0; bool calc(int i) { sum += i; return i && calc(i - 1); // when i reaches 0