By Vasudev Ram
Saw this recently.
basecs: Exploring the basics of computer science, every Monday, for a year.
It's by Vaidehi Joshi, a software engineer who works at Tilde, a company that includes Yehuda Katz, who worked or works on Ember.js, Rails, JQuery and Rust.
Browsed a few of the posts there. Seems good.
- Vasudev Ram - Online Python training and consulting
I conduct online courses on Python programming, Unix/Linux (commands and shell scripting) and SQL programming and database design, with personal coaching sessions.
Here are the course details and some testimonials.
DPD: Digital Publishing for Ebooks and Downloads.
Learning Linux or any other Unix-like OS, like macOS or *BSD?
Hit the ground running with my vi quickstart tutorial. I wrote it for two Windows system administrator friends who were given charge of Unix systems. They said it made it easy for them to start using vi on Unix. Since vim is a superset of vi, it works for vim too.
Check out WP Engine, powerful WordPress hosting.
Creating or want to create online products for sale? Check out ConvertKit, email marketing for online creators.
Teachable: feature-packed course creation platform, with unlimited video, courses and students.
Posts about: Python * DLang * xtopdf
My ActiveState Code recipes
Follow me on:
Showing posts with label computer-science. Show all posts
Showing posts with label computer-science. Show all posts
Sunday, October 28, 2018
Thursday, June 14, 2018
VIDEO: Good article and video about asymptotic complexity of algorithms
By Vasudev Ram
I saw this nice tutorial about the asympotic complexity of algorithms (Big-Oh notation etc.) via this HN thread:
A Gentle Introduction to Algorithm Complexity Analysis (discrete.gr)
It is by Dionysis Zindros of the University of Athens, Greece.
The HN thread has only a few comments as of now, but one of them led to another good resource on this topic:
Asymptotic Notation, by Jackson Steinkamp of Harvard's CS50 program
The video is also embedded below. It is short, but gives a good idea of the topic.
In my next post, I'll do that analysis of the prime number checker that I ported from Q to Python.
Here is the embedded video:
- Enjoy.
- My Codementor profileGet fast web hosting with A2Hosting.comGet updates (via Gumroad) on my forthcoming apps and content. Jump to posts: Python * DLang * xtopdf Subscribe to my blog by email My ActiveState Code recipesFollow me on: LinkedIn * Twitter Are you a blogger with some traffic? Get Convertkit:Email marketing for professional bloggers
I saw this nice tutorial about the asympotic complexity of algorithms (Big-Oh notation etc.) via this HN thread:
A Gentle Introduction to Algorithm Complexity Analysis (discrete.gr)
It is by Dionysis Zindros of the University of Athens, Greece.
The HN thread has only a few comments as of now, but one of them led to another good resource on this topic:
Asymptotic Notation, by Jackson Steinkamp of Harvard's CS50 program
The video is also embedded below. It is short, but gives a good idea of the topic.
In my next post, I'll do that analysis of the prime number checker that I ported from Q to Python.
Here is the embedded video:
- Enjoy.
- My Codementor profileGet fast web hosting with A2Hosting.comGet updates (via Gumroad) on my forthcoming apps and content. Jump to posts: Python * DLang * xtopdf Subscribe to my blog by email My ActiveState Code recipesFollow me on: LinkedIn * Twitter Are you a blogger with some traffic? Get Convertkit:Email marketing for professional bloggers
Sunday, April 15, 2018
compilerbook.org - Introduction to Compilers and Language Design by Prof. Douglas Thain
By Vasudev Ram
Came across this book today:
Introduction to Compilers and Language Design (compilerbook.org)
(a free online textbook by Douglas Thain)
Prof. Douglas Thain is Associate Professor, Computer Science and Engineering, University of Notre Dame, USA.
Excerpts from the page:
[ This online textbook is being released chapter-by-chapter during 2017. The complete book will be available for purchase in the spring 2018 semester.
This textbook is suitable for a one semester undergraduate course in compilers. Guided by this book, students can undertake construction of a compiler which accepts a C-like language and produces working X86 code. The textbook and materials have been developed by Prof. Douglas Thain as part of the CSE 40243 compilers class at the University of Notre Dame.
You are free to download, use, and print these PDFs for personal and academic use. Commercial printing or distribution is prohibited. Instead of copying PDFs, please point students to this page (compilerbook.org) so that they can access the latest version. If you enjoy holding a physical book (like I do!) you will be able to order an inexpensive hardcover edition in 2018. ]
I just read a bit of the book so far, but it seems quite good.
- Vasudev Ram - Online Python training and consultingGet fast reliable hosting with A2Hosting.comGet updates (via Gumroad) on my forthcoming apps and content. Jump to posts: Python * DLang * xtopdf Subscribe to my blog by email My ActiveState Code recipesFollow me on: LinkedIn * Twitter Do you create and sell digital products? Get Convertkit:Email marketing for online creators
Came across this book today:
Introduction to Compilers and Language Design (compilerbook.org)
(a free online textbook by Douglas Thain)
Prof. Douglas Thain is Associate Professor, Computer Science and Engineering, University of Notre Dame, USA.
Excerpts from the page:
[ This online textbook is being released chapter-by-chapter during 2017. The complete book will be available for purchase in the spring 2018 semester.
This textbook is suitable for a one semester undergraduate course in compilers. Guided by this book, students can undertake construction of a compiler which accepts a C-like language and produces working X86 code. The textbook and materials have been developed by Prof. Douglas Thain as part of the CSE 40243 compilers class at the University of Notre Dame.
You are free to download, use, and print these PDFs for personal and academic use. Commercial printing or distribution is prohibited. Instead of copying PDFs, please point students to this page (compilerbook.org) so that they can access the latest version. If you enjoy holding a physical book (like I do!) you will be able to order an inexpensive hardcover edition in 2018. ]
I just read a bit of the book so far, but it seems quite good.
- Vasudev Ram - Online Python training and consultingGet fast reliable hosting with A2Hosting.comGet updates (via Gumroad) on my forthcoming apps and content. Jump to posts: Python * DLang * xtopdf Subscribe to my blog by email My ActiveState Code recipesFollow me on: LinkedIn * Twitter Do you create and sell digital products? Get Convertkit:Email marketing for online creators
Thursday, November 15, 2012
Thursday, August 16, 2012
Free Computer Science online course: the Saylor Foundation
Computer Science « The Saylor Foundation
Foundation creator and trustee Michael Saylor is also the founder and CEO of Business Intelligence firm MicroStrategy.
Read the Saylor FAQ for the terms of the course. It is free and online-only. No degree given though.
- Vasudev Ram
www.dancingbison.com
Wednesday, August 15, 2012
Free new Computer Science course at Khan Academy
John Resig - Redefining the Introduction to Computer Science
Looks interesting. Suitable for beginners.
Its mainly programming for now but they say it will evolve into more of actual CS.
Uses some more interactive methods which may make for more motivated students and faster learning.
Hacker News thread about it:
http://news.ycombinator.com/item?id=4382076
- Vasudev Ram
www.dancingbison.com
Sunday, September 11, 2011
A Stanford-quality Masters in Computer Science online for $2000
By Vasudev Ram - dancingbison.com | @vasudevram | jugad2.blogspot.com
Just saw this tweet by Dr. Sebastian Thrun ( http://twitter.com/#!/SebastianThrun ):
"Who here would love to get a CS Master's degree online, if it is of Stanford quality and only costs $2000 in tuition? Please reply."
Link to the tweet, in original form (not shortened):
http://twitter.com/#!/SebastianThrun/status/112397835370115072
Looks like he may be planning to organize and offer such a course if there is enough interest. The online AI Class (
http://www.ai-class.com ) to be taught by him and Peter Norvig (this fall / autumn), and which will also be based on the same content as taught to that class at Stanford, has gotten a huge number of signups - over 50 or 70 thousand or maybe even over a 100 thousand by now - I saw reports earlier of 50K (sure) and 70K (IIRC), but that was some days ago and I did not track it after that.
So reply to that tweet of his if you are interested - the more people indicate interest, the more likely that the course will happen.
Posted via email
Subscribe to:
Posts (Atom)
