Skip to content
cookie
Shared flashcard decks

NZ NCEA Level 3 Digital Technologies

NCEA Level 3 · NZQADigital Technologies634 cards

More for NZQA NCEA Level 3 Digital Technologies

Picked for the same course from what people use most, and all of it can be read without an account.

Everything for Digital Technologies

Looking for help with Digital Technologies?

Cookie Tutoring, our own tutoring service, may have tutors for Digital Technologies. Lessons are live and one to one, and the first 15 minutes with any tutor is free.

Find a tutor

Flashcards for NCEA Level 3 Digital Technologies, covering the externally examined standards: each of the areas of computer science named in Analyse an area of computer science (complexity and tractability, computer graphics, computer vision, big data, formal languages and network communication protocols), plus the decisions and implications behind developing and reflecting on a digital outcome. Keep only the areas you are studying.

Adding it gives you your own copy, with every subdeck below. Each card then comes back just before you would forget it, and every one you get right or wrong counts towards your mastery of its topic. You can delete or suspend the parts you are not studying once it is yours.

What is inside (50 subdecks)

  • Big data79 cards
    • 1. Defining big data18 cards
    • 2. Data types and formats15 cards
    • 3. Storage and processing19 cards
    • 4. Analysis, interpretation and bias9 cards
    • 5. Considerations9 cards
    • 6. Applications9 cards
  • Complexity and tractability114 cards
    • 1. Measuring algorithm efficiency12 cards
    • 2. Big O notation22 cards
    • 3. Best, worst and average case14 cards
    • 4. Complexity classes19 cards
    • 5. Classic hard problems21 cards
    • 6. Algorithm design strategies16 cards
    • 7. Applications and trade-offs10 cards
  • Computer graphics85 cards
    • 1. Raster and vector graphics13 cards
    • 2. Colour models and file formats16 cards
    • 3. Geometric transformations18 cards
    • 4. Rasterising lines13 cards
    • 5. Shading and rendering16 cards
    • 6. Applications and people9 cards
  • Computer vision83 cards
    • 1. Images as data12 cards
    • 2. Edge detection18 cards
    • 3. Stereo vision and depth15 cards
    • 4. Feature detection, classification and segmentation16 cards
    • 5. Machine learning in computer vision12 cards
    • 6. Applications and trade-offs10 cards
  • Developing and reflecting on a digital outcome83 cards
    • 1. Decisions in development16 cards
    • 2. Legal, ethical and intellectual property implications25 cards
    • 3. Privacy, accessibility and usability20 cards
    • 4. Sustainability, future-proofing and health and safety13 cards
    • 5. Evaluating a digital outcome9 cards
  • Formal languages99 cards
    • 1. Alphabets, strings and languages12 cards
    • 2. Regular expressions12 cards
    • 3. Finite-state automata19 cards
    • 4. Context-free grammars19 cards
    • 5. The Chomsky hierarchy14 cards
    • 6. Formal languages in compilers13 cards
    • 7. Formal languages, decidability and complexity10 cards
  • Network communication protocols91 cards
    • 1. The internet protocol suite12 cards
    • 2. The link and internet layers19 cards
    • 3. The transport layer21 cards
    • 4. The application layer17 cards
    • 5. Networking for the Internet of Things14 cards
    • 6. Applications and trade-offs8 cards

Some of its cards

  • Context-free grammar
    A set of production rules that generate the strings of a language, where each rule replaces a single non-terminal symbol regardless of what surrounds it
  • Why does an online shop's search feature need to be efficient even as its catalogue grows to millions of products?
    Because a search algorithm with a poor growth rate would become too slow to use as the catalogue grows, even if it worked fine on a small catalogue
  • Brute force
    Solving a problem by trying every possible solution and checking each one
  • Why is testing a digital outcome with real end users more useful than only testing it yourself as its developer?
    Because a developer who is familiar with the outcome can overlook problems that a new user, seeing it for the first time, would notice immediately
  • The first stage of compiling, which scans the source code and groups its characters into tokens such as keywords, identifiers and numbers
    Lexical analysis
  • Data organised into a fixed format with defined fields, such as rows and columns in a table
    Structured data
  • A link-layer standard for connecting devices over a wired local network
    Ethernet
  • Give an example of computer vision used in medicine.
    Analysing X-ray, CT or MRI scans to help detect tumours or other abnormalities
  • A problem that can be solved by an algorithm running in polynomial time
    Tractable problem
  • Best-case time complexity
    The minimum number of steps an algorithm takes, for the input that is most favourable to it

And 624 more once you add the deck.