| Line 8: | Line 8: | ||
== Interesting pages related to ECE264== | == Interesting pages related to ECE264== | ||
| − | *[[Need to Know|Need to Know this]] (by Kritin Gokharu) | + | *[[Need to Know|Need to Know this]] (by Kritin Gokharu) |
| − | + | ||
| − | + | ||
*[[Binary Tree: In Order and Post Order|Binary Trees: In order, Post Order]] (by Kyle Donnelly) | *[[Binary Tree: In Order and Post Order|Binary Trees: In order, Post Order]] (by Kyle Donnelly) | ||
*[[Binary_tree_ECE264S11|Binary Trees]] | *[[Binary_tree_ECE264S11|Binary Trees]] | ||
Revision as of 06:14, 11 July 2012
Contents
ECE 264: Advanced C Programming
Peer Legacy
Share advice with future students regarding ECE264 on this page.
- Need to Know this (by Kritin Gokharu)
- Binary Trees: In order, Post Order (by Kyle Donnelly)
- Binary Trees
- Debugging with #ifdef (by Kyle Donnelly)
- Exam 3 Review Notes (by Yuanhua Cheng)
- MUST CONSIDER !!! Setting up Wubi/ Ubuntu (by Yuanhua Cheng) vs. Using Putty
- Binary Search and Selection Sort (by Nick Caprioli)
- Header Files (by Kritin Gokharu)
- Binary Trees, by John Jachna
- Dealing with Files in C (by Nick Caprioli)
Related Videos
- How to write a C program using Eclipse, by Prof. Yung Lu
- How to debug using DDD, by Prof. Yung Lu.
