CS1010 Notes
Ctrlk
  • 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
Powered by GitBook
On this page
Edit
  1. Lec/Tut/Lab/Exes

Lecture

Lecture Notes

Lec 01 - Computational Problem SolvingLec 02 - Functions and TypesLec 03 - Basic C ProgrammingLec 04 - ConditionalsLec 05 - LoopsLec 06 - Call Stacks, ArraysLec 07 - Pointers, Memory managementLec 08 - Multi-d Array, EfficiencyLec 09 - Searching and SortingLec 10 - More RecursionLec 11 - Strcut & Standard I/OLec 12 - Recap
PreviousWelcomeNextLec 01 - Computational Problem Solving

Last updated 1 year ago