ECE 264 Advanced C Programming, Fall 2020
Be healthy and safe.
The github repository for this course is https://github.com/PurdueECE264/2020FallProblems-Lu
Frequently Asked Questions
Video Lectures
Week |
Date |
Lecture |
Topic |
Video |
Length |
Slides |
Script |
Program |
1 |
08/25 |
1 |
Welcome |
video |
3:22 |
pptx |
docx |
|
|
|
|
Rules in Programming |
video |
10:55 |
pptx |
docx |
|
|
|
|
C Program 001 |
video |
3:17 |
pptx |
docx |
|
|
|
|
Linux 01 |
video |
12:18 |
pptx |
docx |
|
|
|
|
Linux 02 |
video |
5:16 |
pptx |
docx |
|
|
|
|
Compile and Execute C Program in Linux |
video |
6:28 |
pptx |
docx |
prog01.c |
|
|
|
Version Control |
video |
6:46 |
pptx |
docx |
|
|
|
|
Homework 01 and git |
video |
4:55 |
pptx |
docx |
|
|
|
|
GCC 01 |
video |
4:20 |
pptx |
docx |
prog02.c, prog03.c, prog04.c |
1 |
08/27 |
2 |
Set up Linux Environment (Please attend the online help sessions) |
2 |
09/01 |
3 |
Grading Programming Assignments |
video |
7:52 |
pptx |
docx |
|
|
|
|
Makefile 01 |
video |
7:54 |
pptx |
docx |
|
|
|
|
Makefile 02 |
video |
6:30 |
pptx |
docx |
|
|
|
|
argc and argv 01 |
video |
3:52 |
pptx |
docx |
argcv01.c |
|
|
|
argc and argv 02 |
video |
4:09 |
pptx |
docx |
argcv02.c |
|
|
|
argc and argv 03 |
video |
3:38 |
pptx |
docx |
argcv03.c |
|
|
|
Homework 01 and Makefile |
video |
12:35 |
pptx |
docx |
|
|
09/03 |
4 |
Computer memory |
video |
7:36 |
pptx |
docx |
|
|
|
|
Stack memory 01 |
video |
5:10 |
pptx |
docx |
|
|
|
|
Stack memory 02 |
video |
4:37 |
pptx |
docx |
|
|
|
|
Stack memory 03 |
video |
6:38 |
pptx |
docx |
|
|
|
|
Programming tools 01 |
video |
13:20 |
pptx |
docx |
|
|
|
|
Homework 02 Selection Sort |
video |
16:38 |
pptx |
docx |
|
3 |
09/08 |
5 |
Debugging (Please attend the online help sessions) |
|
09/10 |
6 |
Homework 03 Who gets the cake |
video |
5:23 |
pptx |
docx |
|
|
|
|
Memory and pointer 01 |
video |
7:21 |
pptx |
docx |
|
|
|
|
Memory and pointer 02 |
video |
10:03 |
pptx |
docx |
|
|
|
|
Poiner 03 and type rules |
video |
15:18 |
pptx |
docx |
sizeof1.c, sizeof2.c |
|
|
|
Hierarchical Makefile |
video |
2:31 |
pptx |
docx |
Makefile (hierarchical) |
|
|
|
Heap memory 01 |
video |
11:30 |
pptx |
docx |
|
4 |
09/15 |
7 |
Heap memory 02 |
video |
12:16 |
pptx |
docx |
05.zip |
|
|
|
Heap memory 03 |
video |
6:26 |
pptx |
docx |
|
|
|
|
Homework 04 File (fgetc) |
video |
14:13 |
pptx |
docx |
|
|
|
|
Homework 05 File (fscanf, fgets, fseek, ftell ...) |
video |
10:11 |
pptx |
docx |
|
|
09/17 |
8 |
Homework 06 String |
video |
16:28 |
pptx |
docx |
|
|
|
|
Structure 01 |
video |
14:33 |
pptx |
docx |
|
|
|
|
Structure 02 and Heap Memory |
video |
19:40 |
pptx |
docx |
|
5 |
09/22 |
9 |
Homework 07 qsort |
video |
15:00 |
pttx |
docx |
|
|
|
|
Recursion 01 |
video |
16:45 |
pptx |
docx |
|
|
|
|
Recursion 02 |
video |
10:33 |
pptx |
docx |
|
|
|
|
Recursion 03 |
video |
7:42 |
pptx |
docx |
|
|
09/24 |
10 |
Questions and Answer about Recursion, Demo of GDB (Please bring your questions to the online help sessions) |
6 |
09/29 |
11 |
Review for Exam 1 (Please bring your questions to the online help sessions) |
|
10/01 |
12 |
Exam 1 (take home) |
7 |
10/06 |
13 |
Recursion 04 |
video |
4:33 |
pptx |
docx |
|
|
|
|
Recursion 05, Select Balls |
video |
7:04 |
pptx |
docx |
|
|
|
|
Recursion 06, Partition Integers |
video |
13:07 |
pptx |
docx |
|
|
|
|
Recursion 07, Performance |
video |
9:38 |
pptx |
docx |
|
|
|
|
Quick Sort Algorithm |
video |
10:04 |
pptx |
docx |
|
|
|
|
How to Use Recursion |
video |
4:20 |
pptx |
docx |
|
|
10/08 |
14 |
Homework 08 fread and frwite |
video |
5:45 |
pptx |
docx |
|
|
|
|
Homework 09 Merge Sort |
video |
9:47 |
pptx |
docx |
|
|
|
|
Dynamic Structure and Linked List 01 |
video |
19:58 |
pptx |
docx |
|
|
|
|
Linked List 02: Search |
video |
8:08 |
pptx |
docx |
|
|
|
|
Linked List 03: Destroy |
video |
6:48 |
pptx |
docx |
|
8 |
10/13 |
15 |
Linked List 04: Delete |
video |
6:50 |
pptx |
docx |
|
|
|
|
Linked List 05: Print, Doubly Linked List |
video |
6:17 |
pptx |
docx |
|
|
|
|
Homework 10: Linked List |
video |
2:52 |
pptx |
docx |
|
|
|
|
Homework 11-12: Shuffle Cards |
video |
12:20 |
pptx |
docx |
|
|
|
|
Homework 13-14: Postfix Expression |
video |
14:12 |
pptx |
docx |
|
|
10/15 |
16 |
Questions and Answers about Linked List, Demo of DDD (Please attend the online help sessions) |
9 |
10/20 |
17 |
Binary Tree 01 |
video |
17:06 |
pptx |
docx |
|
|
|
|
Binary Tree 02: Insert |
video |
12:36 |
pptx |
docx |
|
|
|
|
Binary Tree 03: Traverse |
video |
9:31 |
pptx |
docx |
|
|
|
|
Binary Tree 04, Delete |
video |
11:53 |
pptx |
docx |
|
|
10/22 |
18 |
Questions and Answers about Binary Tree, Demo of DDD (Please bring your questions to the online help sessions) |
10 |
10/27 |
19 |
Review for Exam 2 (Please bring your questions to the online help sessions) |
|
10/29 |
20 |
Exam 2 (Take Home) |
11 |
11/03 |
21 |
Homework 15: Binary Tree |
video |
4:04 |
pptx |
docx |
|
|
|
|
Homework 16: Binary Tree |
video |
1:30 |
pptx |
docx |
|
|
|
|
Huffman Compression 01 |
video |
13:04 |
pptx |
docx |
|
|
|
|
Huffman Compression 02 |
video |
9:26 |
pptx |
docx |
|
|
|
|
Bitwise Operations |
video |
8:34 |
pptx |
docx |
|
|
|
|
Huffman Compression 03 |
video |
9:32 |
pptx |
docx |
|
|
11/05 |
22 |
Questions and Answers about Huffman Compression (Please bring your questions to the online help sessions) |
12 |
11/10 |
23 |
Image Processing |
video |
13:57 |
pptx |
docx |
|
|
|
|
Homework 17 and 18: Huffman Compression |
video |
2:56 |
pptx |
docx |
|
|
|
|
Homework 19: Maze |
video |
2:49 |
pptx |
docx |
|
|
|
|
End of ECE 264 course materials. No video for Homework 20 and 21. Students should understand the assignments from the text. |
|
11/12 |
24 |
11/12 materials will not be in exams |
|
|
|
Compare C and C++ |
video |
8:29 |
pptx |
docx |
|
|
|
|
Git Branch |
video |
6:59 |
pptx |
docx |
|
|
|
|
Testing |
video |
9:11 |
pptx |
docx |
|
|
|
|
Take ownership of your project |
video |
4:39 |
|
|
|
|
|
|
Recommendation Letters |
video |
7:39 |
|
|
|
|
|
|
Should I attend graduate school? |
video |
13:12 |
|
|
|
|
|
|
Time Management |
video |
21:57 |
|
|
|
13 |
11/17 |
25 |
Review for Exam 3 (Please bring your questions to the online help sessions) |
|
11/19 |
26 |
Exam 3 (Take Home) |
14 |
11/24 |
27 |
Review (Please bring your questions to the online help sessions) |
|
11/26 |
28 |
No class (Thanksgiving) |
15 |
12/01 |
29 |
Courses after ECE 264, Career, Graduate Schools (please bring your questions to the online help sessions) |
|
12/03 |
30 |
Semester Review (Please bring your questions to the online help sessions) |
|
12/12 |
|
Final Exam (Take Home) |
Frequently Asked Questions
Q: Why is each lectures divided into many short videos?
A: Research on education and learning has concluded that learning becomes less effective after listening for more than 15 minutes. It is better to break a 75-minute lecture into short video so that students have time to think between different videos.
Q: If learning is more effective in 15 minutes intervals, why is each lecture 75 minutes?
A: When lectures are physical, time is spent moving around classrooms. Thus, short lectures are inefficient. Online lectures do not have the restrictions.
Q: Why is the lecture time not added to 75 minutes.
A: It is intended to give students time to think and digest. After watching each video, please spend some time to think and understand. Listening without understanding is not learning. In physical lectures, instructors often pause to give students time to think, discuss, and ask questions. Instructors do not talk for 75 minutes non-stop. Also, students are encouraged to communicate with the instructors, the teaching assistants, and the classmates.
Q: Why do the lectures have different total lengths of videos?
A: Some topics are more complex and need more time to digest time. Thus, some lectures are shorter because the instructor expects students to have more questions. Some topics need to be explained together so that students get the whole idea. The instructor designs the lectures for students to learn better.
Q: During physical lectures, instructors often give practice questions during lectures. Are there practice questions?
A: Yes. Each lecture is accompanied with practice questions in Brightspace.
Q: How is the audio generated?
A: In other to make sure the scripts and the audio match, the audio is generated by using a voice synthesis program.
Q: Why do the script contain grammatical errors or have some "strange" things (such as additional periods)?
A:The scripts are used to generate the sound files. The additional periods are used to add silence. Some words are written in specific ways to guide the synthesis programs for correct pronunciation.
Q: Why do the video lectures disallow comments on Youtube?
A: The class has published lecture videos before and some inappropriate comments were posted (not sure whether they were Purdue students or not).The inappropriate comments interfere with the education purposes.
Q: If I find mistakes in the video or have suggestions, what should I do?
A: Post in Piazza.
Q: In classrooms, students can discuss and learn from each other. Are students allowed to talk in this class?
A: Of course. You are encouraged to talk to your classmates and learn from each other.
Q: Will students be penalized for cheating if they talk to each other?
A: Talking will not produce answers with excessive degrees of similarity. If you do not share homework or exam answers, you do not need to worry. If you are unsure, please talk to the instructor for clarification.
|