Core Computer Science
Skip navigation Structured Programming Research School of Computer Science Search query Search ANU web, staff & maps Search current site content Search Menu Search query Search COMP1110/6710 Lectures Labs Assessments Help Search ANU web, staff & maps Search current site content COMP1110/6710 Lectures Labs Assessments Help menu Search query Search COMP1110/6710 Search query Lectures Lectures Complete Lectures Introduction Admin Java Object Orientation Software Engineering Core Computer Science Abstract Data Types JavaFX Guest Lectures Biographies Revision Bonus Related sites Piazza You are here » Lectures » Core Computer Science C1 Recursion (45 mins) Topics: Recursive algorithms Java Visualizations: Maternal Line References: Recursion Fibonacci number Mergesort Mike Bostock: mergesort animation Mike Bostock: visualizing algorithms Demonstration of Lab 7 Maze Relevant ACM Curriculum Learning Outcomes: SDF Fundamental Programming Concepts 1 SDF Fundamental Programming Concepts 8 C2 Hash Functions (10 mins) Topics: Hash functions | Choosing a good hash function References: Hash function Properties of a good hash function C3 Hashing Applications (85 mins) Topics: Java hashCode() | Applications of hashing References: Hash function Uses of hash functions Object as superclass (see hashCode()) hashCode() Luhn algorithm Hamming codes rsync MD5 C4 Files (50 mins) Topics: Java file I/O | Streams | Standard I/O | Random access files | Buffering References: Basic I/O I/O streams I/O from the command line Random access files Buffered streams Data buffer Memory hierarchy Magnetic tape data storage C5 Computational Complexity (60 mins) Topics: Time and space complexity | Big O notation | Examples | Practical study: sets References: Time complexity Big O notation Analysis of algorithms Space-time tradeoff Relevant ACM Curriculum Learning Outcomes: AL Basic Analysis 8 AL Basic Analysis 9 AL Fundamental Data Structures and Algorithms 2 C6 Formal Grammars (35 mins) Topics: Formal grammars | EBNF References: Formal grammars Extended Backus-Naur form Chomsky Niklaus Wirth John Backus Peter Naur Relevant ACM Curriculum Learning Outcomes: PL Syntax Analysis 1 C7 Threads (15 mins) Topics: Concurrency References: Concurrency Concurrency Thread Process Relevant ACM Curriculum Learning Outcomes: OS Scheduling and Dispatch 4 Updated: 22 Jan 2021 / Responsible Officer: Head of School / Page Contact: Josh Milthorpe Contact ANU Copyright Disclaimer Privacy Freedom of Information +61 2 6125 5111 The Australian National University, Canberra CRICOS Provider : 00120C ABN : 52 234 063 906 You appear to be using Internet Explorer 7, or have compatibility view turned on. Your browser is not supported by ANU web styles. » Learn how to fix this » Ignore this warning in future
