Skip to content

Summary notes for my "Introduction to Computer Science" class

Notifications You must be signed in to change notification settings

cjmlgrto/fit2085-notes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

36 Commits
 
 
 
 
 
 

Repository files navigation

FIT2085 — Introduction to Computer Science

Summary Notes by By Carlos Melegrito

This is everything I've noted down during the entire semester. Not only will it serve as my revision notes for my exam, but also for reference in the future. Note that a lot of this content stems from Monash University, but these writings are of my own.

If you see an issue, just submit one or contact me from my website. To use these summary notes, just click any of the links in the contents below.

Contents

  1. Sorting
  2. Complexity
  3. MIPS Architecture
  4. MIPS Programming
  5. MIPS Functions and Stack
  6. Abstract Data Types
  7. Object-Oriented Programming
  8. Array Implementations of ADTs
  9. Searching
  10. Linked Structures
  11. Iterators and Generators
  12. Hash Tables
  13. Recursion
  14. Recursive Sorting
  15. Binary Trees
  16. Binary Search Trees
  17. Priority Queues
  18. Heaps

Algorithms

Abstract Data Types

About

Summary notes for my "Introduction to Computer Science" class

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published