Computer Science flashcards

What this deck covers

• Unit 3: Network communications (8 cards, 2 dot points)

  • IP addressing, subnetting, DNS, ports and network components: WACE Computer Science Unit 3 (5)
  • OSI and TCP/IP models, protocols, TCP vs UDP and packets: WACE Computer Science Unit 3 (3)
• Unit 3: Programming (7 cards, 3 dot points)

  • Arrays, dictionaries, searching, sorting and Big O: WACE Computer Science Unit 3 (1)
  • Data types, control structures, functions and scope: WACE Computer Science Unit 3 (3)
  • Development process, testing and debugging, OOP and developer obligations: WACE Computer Science Unit 3 (3)
• Unit 4: Cyber security (6 cards, 2 dot points)

  • Privacy law, cyber threats, CIA, AAA and ethical hacking: WACE Computer Science Unit 4 (3)
  • Symmetric and asymmetric encryption, certificates and TLS: WACE Computer Science Unit 4 (3)
• Unit 4: Data management (7 cards, 2 dot points)

  • Relational databases, ER diagrams, integrity and normalisation to 3NF: WACE Computer Science Unit 4 (3)
  • SQL, data import, ODBC, ACID and data management issues: WACE Computer Science Unit 4 (4)

Sample cards from this deck

1. Definition · IP addressing, subnetting, DNS, ports and network components: WACE Computer Science Unit 3

   Define IPv4

   32 bits written as four octets (192.168.1.10). About 4.3 billion addresses, now exhausted.

2. Definition · Data types, control structures, functions and scope: WACE Computer Science Unit 3

   Define Logical

   AND, OR, NOT. Remember precedence: NOT, then AND, then OR (use brackets to be clear).

3. Definition · Privacy law, cyber threats, CIA, AAA and ethical hacking: WACE Computer Science Unit 4

   Define Ethical hackers

   Ethical hackers (penetration testers) attack systems with permission to find weaknesses before criminals do. Red teams simulate attackers; blue teams defend, detect and respond. Ethical hacking requires written authorisation, a defined scope and responsible reporting.

4. Definition · Relational databases, ER diagrams, integrity and normalisation to 3NF: WACE Computer Science Unit 4

   Define Relational notation

   TABLE(PrimaryKey, Attribute, ForeignKey), with the primary key underlined (shown bold here) and foreign keys marked.

5. Fill the gap · OSI and TCP/IP models, protocols, TCP vs UDP and packets: WACE Computer Science Unit 3

   A packet has a ___ (addresses, sequence numbers, protocol information, time to live), a payload (the data) and often a trailer (error checking, at the frame level).

   A packet has a header (addresses, sequence numbers, protocol information, time to live), a payload (the data) and often a trailer (error checking, at the frame level).

6. Fill the gap · Development process, testing and debugging, OOP and developer obligations: WACE Computer Science Unit 3

   A typical framework: ___ (requirements), design (algorithms, data structures, interfaces), develop (code), test, implement, evaluate and maintain.

   A typical framework: analyse (requirements), design (algorithms, data structures, interfaces), develop (code), test, implement, evaluate and maintain.

7. Fill the gap · Symmetric and asymmetric encryption, certificates and TLS: WACE Computer Science Unit 4

   One ___ encrypts and decrypts (for example AES).

   One shared secret key encrypts and decrypts (for example AES).

8. Definition · SQL, data import, ODBC, ACID and data management issues: WACE Computer Science Unit 4

   Define Aggregates

   COUNT, SUM, AVG, MIN, MAX with GROUP BY; HAVING filters groups.

9. Key fact · Arrays, dictionaries, searching, sorting and Big O: WACE Computer Science Unit 3

   Tell me about Big O notation

   Big O describes how the number of steps grows as input size $n$ grows (usually the worst case). For 1000 items: O(log n) is about 10 steps, O(n) is 1000, O(n²) is 1 000 000.