Course software

We use 7zip as default zip/unzip tool (only for Windows OS). Download and install 7zip, and add its installation path to user's environment Path variable.

We use Visual Studio Code (VS Code) as default IDE for all programming tasks. Download and install VS Code to your computer. Start VS code, add C/C++ IntelliSense and Code Runner extensions.

We use GNU C/C++ compiler as default C compiler. If you use Windows OS, you can install the MinGW (Minimalist GNU for Windows) by downloading this cp264 software package (cp264_software_mingw64.zip) and follow the instructions in the included README.md file to install and configure the MinGW compiler and included utility programs.

For Mac or Linux users, there are equivalent C compilers. The quick solution is to open a terminal, and issue command gcc, that will prompt you to install the developer package with GNU compiler.

Code examples

The following code examples are for illustrating features of C programming language and data structures, not for production programming. Some of these examples are used in lessons.

1. C program structure and organization
• Basic program structgure example addsubtest.c
• header file addsub.h
• implementation file addsub.c
• main program file addsub_main.c
• header file muldiv.h
• implementation file muldiv.c
• main program file arithmetic_main.c, using addsub and muldiv, build and use static and shared libraries
2. Data type, variables and constants:
• basic data types and variable sizes
• constant
3. Basic operations:
• arithmetics casting and overflow
• variable casting
• compiler evaluation 
4. Bitwise operations:
• bitwise operations
• bit field
• efficient power function
5. Flow controls:
• list prime numbers
• gcd and lcm
• goto statement example
• prompt for user input
6. Functions
• function concept
• function concept in assembly
• function concept at runtime,
• function - pass by values
• function - pass by references
• swap function
• recursive function (recursive algorithm vs iterative algorithm
7. Specifiers and scope
• variable specifiers and scope
• extern.h
8. Pointers:
• value, address, pointer
• void pointer, pointer size
• pointer of pointer
9. Arrays
• global array and local array
• array by pointer
• pass array to function
• issue of array index range
• read to array
10. Array sort:
• selection sort array and pointers
• merge sort by recursive and iterative algorithms
11. 2D arrays
• 2D array
• 2D array to function
12. String
• simple string
• array of string pointers
• command line arguments
• string copy by string.h functions
• string comparison
• print all fixed length string of given symbols
13. Structure
• structure structure pointer
• structure as function parameter
• function return structure
• array of structure and function
14. Union
• simple union
• union with structure
15. Enumeration
• simple enum
• enumeration with default value
• enumeration with assigned value
16. File read
• file read
• file read string by fgets
• file read multipl strings
• file read by fscanf
17. File write
• file write
• file copy
• file write by fwrite
• fread/fwrite/fseek
• file write binary (structure)
• file read binary (structure)
18. csv file read and write
• csv file write
• csv file read
• csv file write with string value
• csv file read with string value
19. Linked lists
• simple/singly linked list
• doubly linked list
• circular linked list
20. Linked list with separated files
• linked list header
• linked list function implementation
• linked list main test program
21. Queues
• array queue
• circular array queue
• singly linked list queue
• deques by array
• priority queue by linked list
• Josephus Problem
22. Stacks
• array stack
• linked list stack
23. Stack applications:
• backtracking and reverse order by stack
• parenthesis check
• infix to postfix conversion
• postfix evaluation
• Hanoi tower by recursive function
• play tic-tac-toe with AI
• play nim with AI
24. Trees
• simple general binary tree
• simple binary search tree
• threaded tree
• tree serialization
25. Tree applications
• expression tree to infix/postfix/prefix
• infix to expression tree
• Huffman coding with compressing and decompressing
26. AVL trees
• AVL tree rotation/insertion/deletion with recursive algorithms
• AVL tree insertion/deletion with iterative algorithms
• Bidirectioal AVL tree insertion/deletion with iterative algorithms
27. Red-Black-tree and others
• red black tree and insert/delete operations by iterative algorithms
• splay tree search/insert/delete operations
• B-tree
28. Hash tables
• simple hash table
• linked hash table (chaining hash table)
29. Heaps
• simple binary heap by array
• binary heap by linked binary tree
• Binomial heap
• Fibonacci heap
30. Graph representations and operations
• graph by adjacent matrix representation
• graph by adjacency list representation
• graph by linked node representation
• graph by adjacency matrix with topology sort
31. Application algorithms on graphs
• weighted graph by adjacency matrix with minimum spanning tree Kruskal's algorithm
• weighted graph by adjacency matrix with minimum spanning tree Prim's algorithm
• weighted undirected graph by adjacency matrix with Dijkstra's shortest path algorithm
• weighted undirected graph by adjacency matrix with Floyd-Warshall algorithm for all-pair shortest path
• Solving 8-puzzle game by graph BFS