CS1010 Notes
search
⌘Ctrlk
CS1010 Notes
  • Welcome
  • Lec/Tut/Lab/Exes
    • Lecture
      • Lec 01 - Computational Problem Solving
      • Lec 02 - Functions and Types
      • Lec 03 - Basic C Programming
      • Lec 04 - Conditionals
      • Lec 05 - Loops
      • Lec 06 - Call Stacks, Arrays
      • Lec 07 - Pointers, Memory management
      • Lec 08 - Multi-d Array, Efficiency
      • Lec 09 - Searching and Sorting
      • Lec 10 - More Recursion
      • Lec 11 - Strcut & Standard I/O
      • Lec 12 - Recap
    • Tutorial
    • Lab
    • Exercises
  • Past Year Exam
    • Midterm PE
    • Midterm Paper
    • PE1 Review
    • PE2 Review
    • Final Paper
  • Current Year Exam
    • PE0 (AY24/25)
    • PE1 (AY24/25)
    • PE2 (AY24/25)
    • Final (AY24/25)
  • Toolbox
    • Vim & Unix
    • GDB
  • After CS1010
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
githubEdit
  1. Lec/Tut/Lab/Exes

Lecture

Lecture Notes

Lec 01 - Computational Problem Solvingchevron-rightLec 02 - Functions and Typeschevron-rightLec 03 - Basic C Programmingchevron-rightLec 04 - Conditionalschevron-rightLec 05 - Loopschevron-rightLec 06 - Call Stacks, Arrayschevron-rightLec 07 - Pointers, Memory managementchevron-rightLec 08 - Multi-d Array, Efficiencychevron-rightLec 09 - Searching and Sortingchevron-rightLec 10 - More Recursionchevron-rightLec 11 - Strcut & Standard I/Ochevron-rightLec 12 - Recapchevron-right
PreviousWelcomechevron-leftNextLec 01 - Computational Problem Solvingchevron-right

Last updated 1 year ago