<--- Back to Details
First PageDocument Content
Formal languages / Pattern matching / Holism / Source code / Subroutine / University of Cambridge Computer Laboratory / Algorithm / Test / Assembly language / Computing / Computer programming / Software engineering
Date: 2009-11-22 22:52:54
Formal languages
Pattern matching
Holism
Source code
Subroutine
University of Cambridge Computer Laboratory
Algorithm
Test
Assembly language
Computing
Computer programming
Software engineering

2009 HSC Exam Paper - Software Design and Development

Add to Reading List

Source URL: www.boardofstudies.nsw.edu.au

Download Document from Source Website

File Size: 114,95 KB

Share Document on Facebook

Similar Documents

Computer programming / Software engineering / Declarative programming / Recursion / Functional programming / Computability theory / Theoretical computer science / Programming paradigms / Algebraic data type / Fold / Pattern matching / Conditional

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK

DocID: 1xVgx - View Document

SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2

DocID: 1vgge - View Document

Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, France

DocID: 1v6Pd - View Document

LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression Grammars

DocID: 1utvV - View Document

Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID#

DocID: 1uq9c - View Document