Card sorting is a technique in user experience design in which a person tests a group of subject experts or users to generate a dendrogram (category tree) or folksonomy. It is a useful approach for designing information architecture, workflows, menu structure, or web site navigation paths. Card sorting uses a relatively low-tech approach. The person conducting the test (usability analyst, user experience designer, etc.) first identifies key concepts and writes them on index cards or Post-it notes. Test subjects, individually or sometimes as a group, then arrange the cards to represent how they see the structure and relationships of the information. Groups can be organized as collaborative groups (focus groups) or as repeated individual sorts. The literature discusses appropriate numbers of users needed to produce trustworthy results. A card sort is commonly undertaken when designing a navigation structure for an environment that offers a variety of content and functions, such as a web site. In that context, the items to organize are those significant in the environment. The way the items are organized should make sense to the target audience and cannot be determined from first principles. The field of information architecture is founded on the study of the structure of information. If an accepted and standardized taxonomy exists for a subject, it would be natural to apply that taxonomy to organize both the information in the environment, and any navigation to particular subjects or functions. Card sorting is useful when: * The variety of items to organize is so great that no existing taxonomy is accepted as organizing the items. * Similarities among the items make them difficult to divide clearly into categories. * Members of the audience that uses the environment differ significantly in how they view the similarities among items and the appropriate groupings of items. (Wikipedia).
This is the first of two videos about the insertion sort. This video describes the insertion sort algorithm. The insertion sort is rather like sorting a hand of playing cards. The insertion sort is particularly good for lists that are nearly sorted already, or when you just want to inse
From playlist Sorting Algorithms
Discrete Math - 3.1.3 Sorting Algorithms
Bubble sort and insertion sort algorithms. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz
From playlist Discrete Math I (Entire Course)
In this video, you’ll learn more about sorting data in Excel 2010. Visit https://www.gcflearnfree.org/excel2010/sorting-data/1/ for our text-based lesson. This video includes information on: • Sorting in numerical order • Sorting by date or time • Adding a custom sort • Adding sorting lev
From playlist Microsoft Excel 2010
In this video, you’ll learn more about sorting in Excel 2013. Visit https://www.gcflearnfree.org/excel2013/sorting-data/1/ for our text-based lesson. This video includes information on: • Sorting a sheet and a range • Creating a custom sort • Sorting by cell formatting • Adding sorting le
From playlist Microsoft Excel 2013
From playlist Week 3 2015 Shorts
This is the first in a series of videos about the merge sort. It describes the principle of the merge sort algorithm, which takes a ‘divide and conquer’ approach to the problem of sorting and unordered list. The videos that follow build on these principles, leading towards a recursive im
From playlist Sorting Algorithms
Heap Sort - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
In this video, you’ll learn more about sorting records in Access 2007. Visit https://www.gcflearnfree.org/access2007/sorting-records/1/ for our text-based lesson. This video includes information on: • Sorting records on text values • Sorting records on numerical values • Clearing a sort
From playlist Microsoft Access 2007
Card sorts help students compare, contrast, and group ideas. We'll briefly engage in a few digital card sorts, discuss various ways in which card sorts promote conceptual understanding, and then each create our own ready-to-use resource.
From playlist Webinars While We're Away
SOLITAIRE FROM SCRATCH! - CS50 on Twitch, EP. 39
Join CS50's Colton Ogden for part 1 of a from-scratch implementation of Solitaire, a classic card game immortalized on older versions of Windows. In this episode, we cover creating card objects, a deck with shuffling capability, a game board, and much of the foundation upon which we'll bui
From playlist CS50 on Twitch
SOLITAIRE PART 2! - CS50 on Twitch, EP. 41
Join CS50's Colton Ogden for the second of three parts implementing Solitaire from scratch in LÖVE and Lua. In this episode, we explore laying out the tableaus, "Z-indexing" in the context of our game (in line with a special guest appearance!), discussing parenting, and more. Tune in live
From playlist CS50 on Twitch
Variable Length Features and Deep Learning
If you’re like me, you don’t really need to train self-driving car algorithms or make a cat-image-detectors. Instead, you're likely dealing with practical problems and normal looking data. The focus of this series is to help the practitioner develop intuition about when and how to use Dee
From playlist Python Keras — Deep Learning Building Blocks
21. Fare Policy, Structure, and Technology
MIT 1.258J Public Transportation Systems, Spring 2017 Instructor: Gabriel Sanchez-Martinez View the complete course: https://ocw.mit.edu/1-258JS17 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62AU7iNniqVoMl8C64tIOVk This lecture discussed the objectives of fare polic
From playlist MIT 1.258J Public Transportation Systems, Spring 2017
Super easy #Desmos Cart Sort CL
Easily create self-checking in your #Desmos Card Sort
From playlist Desmos tips and tricks
Puzzle 3: You Can Read Minds (with a little calibration)
MIT 6.S095 Programming for the Puzzled, IAP 2018 View the complete course: https://ocw.mit.edu/6-S095IAP18 Instructor: Srini Devadas Prof. Devadas describes a mind reading trick that allows you to guess the fifth card that the audience thinks of, after you "fail" on the first four! With a
From playlist MIT 6.S095 Programming for the Puzzled, January IAP 2018
NOTACON 6: Notacon Mythbusters: Is Personal Data Stored on Hotel Keys? Using Magstripe Analysis
Speaker: Matt "Zamboni" Neely For years emails and rumors have circulated that personal information such as credit card numbers, names and addresses are stored stored on hotel room keys. The talk starts with an introduction to magstripe cards and how information is encoded onto the cards
From playlist Notacon 6
OHM2013: Another Rambling Talk About EMV
For more information visit: http://bit.ly/OHM13_web To download the video visit: http://bit.ly/OHM13_down Playlist OHM 2013: http://bit.ly/OHM13_pl Speaker: Tim Becker A brief introduction to EMV, the protocol spoken between smart card based credit cards and terminals. A mixture of plast
From playlist OHM 2013
NOTACON 5: Wasn't HyperCard Cool?
Speaker: Drew Ivan HyperCard was a category-crossing software authoring tool that was far ahead of its time. It was a simple database, a message driven programming language, a GUI design tool, and a hypermedia browser. It was distributed for free with every Macintosh sold, making it the n
From playlist Notacon 5
Visual description of the insertion sort algorithm
From playlist Computer Science