When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Card sorting - Wikipedia

    en.wikipedia.org/wiki/Card_sorting

    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.

  3. File:Flash Card Sebagai Media Pembelajaran dan Penelitian.pdf

    en.wikipedia.org/wiki/File:Flash_Card_Sebagai...

    Bahasa Indonesia: Buku ini adalah buku referensi tentang media pembelajaran flash card atau flashcard. Buku ini dapat digunakan oleh semua kalangan (penuntut ilmu, orang tua, mahasiswa, dan pengajar. Buku ini juga memiliki kurang lebih 100 flash card dan 60 judul penelitian yang dapat diunduh secara gratis.

  4. Sorting algorithm - Wikipedia

    en.wikipedia.org/wiki/Sorting_algorithm

    Radix sort is an algorithm that sorts numbers by processing individual digits. n numbers consisting of k digits each are sorted in O(n · k) time. Radix sort can process digits of each number either starting from the least significant digit (LSD) or starting from the most significant digit (MSD). The LSD algorithm first sorts the list by the ...

  5. Talk:Wisconsin Card Sorting Test - Wikipedia

    en.wikipedia.org/wiki/Talk:Wisconsin_Card...

    I have just modified one external link on Wisconsin Card Sorting Test. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

  6. Punched card sorter - Wikipedia

    en.wikipedia.org/wiki/Punched_card_sorter

    A punched card sorter is a machine for sorting decks of punched cards. Sorting was a major activity in most facilities that processed data on punched cards using unit record equipment . The work flow of many processes required decks of cards to be put into some specific order as determined by the data punched in the cards.

  7. Wisconsin Card Sorting Test - Wikipedia

    en.wikipedia.org/wiki/Wisconsin_Card_Sorting_Test

    The Wisconsin Card Sorting Test (WCST) is a neuropsychological test of set-shifting, which is the capability to show flexibility when exposed to changes in reinforcement. [ 1 ] [ 2 ] The WCST was written by David A. Grant and Esta A. Berg.

  8. Sorting - Wikipedia

    en.wikipedia.org/wiki/Sorting

    Such a component or property is called a sort key. For example, the items are books, the sort key is the title, subject or author, and the order is alphabetical. A new sort key can be created from two or more sort keys by lexicographical order. The first is then called the primary sort key, the second the secondary sort key, etc.

  9. Punched card - Wikipedia

    en.wikipedia.org/wiki/Punched_card

    A punched card (also punch card [1] or punched-card [2]) is a piece of card stock that stores digital data using punched holes. Punched cards were once common in data processing and the control of automated machines .