I compiled the fundamentals of two big subjects, computers and electronics in two decks of playing cards. Check the last two images too [OC]
Posted by arjitraj_
I compiled the fundamentals of two big subjects, computers and electronics in two decks of playing cards. Check the last two images too [OC]
Posted by arjitraj_
11 comments
Hi everyone, I designed these two decks of cards. It took me ~9 months to study and design these.
The idea is to give a physical product to anyone curious in the field of computers and electronics that helps him/her to get the complete overview of the field in an organized, engaging and colorful manner.
Request for checking the complete project, joker cards and supporting it on Kickstarter [here](https://www.kickstarter.com/projects/rajarjit/the-computer-deck-and-the-electronics-deck?ref=873a5z). Happy to have your feedback for improvement.
-Arjit
Lately, I’ve been seeing a lot of, like, custom or specialized decks of cards (the viral tiktok bird deck comes to mind), and I have to say this might actually be the coolest one I’ve seen. Keep up the good work! And if the mood takes you, I think you should make more decks that focus on other areas of study!
you should crosspost to r/coolguides
I would hella get this for so many subjects.
Awesome stocking stuffer for STEM kids. Well done.
Please do one for biology or anatomy!!!
Sort and search. You used Bubble Sort as an example sort algorithm, and Binary Search as an example search algorithm.
Bubble Sort is the first sort algorithm most computer science students learn. It’s also the one that every computer science professor will tell them not to actually use in a real application because it’s horribly inefficient. In Big O notation, it’s worst case execution time is O(n^(2)), meaning the number of comparisons will be equal to the square of the number of values in the array.
Binary Search is not the least efficient search algorithm – that would be Linear Search. However, Binary Search only works with sorted arrays, while Linear Search works with unsorted arrays. The worst case execution time for a Linear Search is O(n), which means one comparison for every value in the array.
In other words, you’d get faster results than your example by skipping the sort, and just executing a Linear Search. Heck, you have to look at every value to do the sort – might as well look for the value you’re searching for.
Really love it but I would also love a reference for all your facts
Very cool, but doesn’t fit this sub…
Looks great. Pledged.
I’ve bought all the previous decks and they’re great!
Do you have something like this for HAM radio exam?
Comments are closed.