ECE 551

This class is aimed at MS/MEng students who want to focus on Computer Engineering, but whose undergraduate degree is in an area other than Computer Engineernig. This course will bring students up to speed on programming, data structures, and algorithms. C++ is the language of choice in this class because C and C++ are very commonly used by Computer Engineers.

Background, Preparation, and Difficulty

This class requires no previous background in programming, as we start from the beggining, however, students without any prior programming experience must work quite hard to keep up with the rapid pace of the class.    Some students think they have had prior experience as they have had courses which focused on memorizing syntax and library functions.  Such students quickly find that this style of background does little to prepare them for serious programming.

Students who have some background in programming are strongly advised to focus deeply and carefully on the material from the start.  These fundementals form the foundation for more complex material later on, and thus are critical to success in more advanced content.

The pace of this course is quite aggressive: we cover more material in one semester than most undergraduate curriculums do in two semesters.  This pace is required for all Masters students to be "up to speed" for programming in the Spring semester, regardless of the background they came in with.  Accordingly, the workload is high, but not impossible.  Many students have become proficient programmers, even with no prior background.   However, such success requires hard work, discipline, and focus. 

For students who are concerned about their lack of background, and wish to gain some familiarity with programming prior to taking this course, Duke's Coursera Specialization, "Build Software Applications,"  provides a gentle introduction to programming.  Students may also begin reading their textbook and working the practice problems in advance of the course.

Flipped Classroom and Mastery Learning

In this course, we use a flipped classroom approach: students read All of Programming and watch the videos in it outside of class.  During classtime, students ask the instructor questions, and work on programming assignments.  Working on programming assignments in class ensures that help is readily available, as the instructor is on hand to answer questions immediately.   The expectation is that students will not be stuck for long due to this rapid availability of help.  

The assignments in this class follow a "mastery learning" model, meaning that a student must demonstrate mastery of one assignment by scoring sufficiently highly before the student may start on the next assignment.   Students are allowed to resubmit their assignment multiple times, fixing their mistakes, and learning from them each time.


Reading Schedule 

Day Of Week Date Required Pages Optional
Monday 8/29 Appendicies A and B 17 + 17  
Wednesday 8/31 Chapter 1 20  
Friday 9/2 Chapter 2 and C.4 22 + 3 D.1
Monday 9.5 Chapter 3 21 D.2
Wednesday 9/7 Chapter 4 16  
Friday 9/9 Chapter 5 and C.1 14 + 7 D.3
Monday 9/12 Chapter 6 and C.2 17 + 5  
Wednesday 9/14 Chapter 7 14  
Friday 9/16 Chapter 8 20  
Monday 9/19 Chapter 9 and C.3 through C.3.3 12 + 7  
Wednesday 9/21 Chapter 10 28  
Monday 9/26 Chapter 11 17  
Wednesday 9/28 Chapter 12 and Finish C.3 17 + 2  
Monday 10/3 Chapter 13 21  
Wednesday 10/5 Chapter 14 29 D.6.1
Friday 10/7 Midterm Exam
Monday 10/10 Fall Break
Wednesday 10/12 Chapter 15 29 D.6.4 and D.6.5
Monday 10/17 Chapter 16 10  
Wednesday 10/19 Chapter 17 15 D.6.3, .6, .7, and .11
Monday 10/24 Chapters 18 27 D.4 and D.6.8
Wednesday 10/26 Chapter 19 17 D.6.2 and D.6.9
Friday 10/28 Chapter 20 22  
Monday 10/31 Chapter 21 20  
Wednesday 11/2 Chapters 22 21  
Monday 11/7 Chapter 23 12  
Wednesday 11/9 Chapter 24 9  
Monday 11/14 Chapter 25 20  
Wednesday 11/16 Chapter 26 17  
Monday 11/21 Chapter 27 9  
Wednesday 11/23 Thanksgiving Holiday
Monday 11/28 Chapter 28 23  
Wednesday 11/30 Chapter 29 16  
Friday 10/2 Chapters 30 and 34 5 + 2 Chapters 31, 32, and 33