✔ Complete H1 Summary Notes ✔ COMP10002: Foundations of Algorithms and C

Description

This note set covers the full subject of COMP10002 – Foundations of Algorithms for the 2020 Semester 2 Curriculum, including all covered concepts. The content of these notes were derived from the textbook, lecture notes, lecture recordings, workshop/tutorial content and examples. These notes include: - Easy to read code and clear examples in correct C syntax and font of all concepts - Numerous example programs with personalised comments that aid in understanding - Comprehensible diagrams for algorithms such as searching and sorting - Summary tables that compare the concepts taught - Clear separation and format of concepts into topics and sections - Hyperlinked bookmarks of sections that can be easily navigated if opened with a PDF reader software The main topics covered include (but are not limited to): - Basics of C programming (variables, conditions, iterations, functions, recursion) - Advanced functions - Arrays and pointers - Strings (characters and string library functions) - Structures and lists - Dynamic memory - String algorithms (pattern searching, indexing, sorting) - Algorithms (correctness and performance measurements, searching, sorting) - Dictionaries and data structures - Text and binary files including their associated functions - Integer representations in programming (binary, bits, floats) - The C preprocessor These notes helped me obtain an H1 in COMP10002: Foundations of Algorithms. They are perfect for both cramming and continuous study throughout the subject. The topics are covered in mostly the same order as they are covered in lectures, and is succinct and compact. All information included is relevant and important for the exam.