CMPE13Cyrus Bazeghi 1 Welcome to CMPE 13 Computing Systems and C Programming Spring 2009 Cyrus Bazeghi

CMPE13Cyrus Bazeghi About the Instructor Have been teaching at UCSC since 1999 –CMPE3 –CMPE12 –CMPE100 –CMPE123A/B –CMPE222/223 Architect and logic designer Embedded system developer 2

CMPE13Cyrus Bazeghi 3 What we will cover in this class oComputer Systems & Abstraction oANSI C oControl loops oData Types / Variables oControl Loops oFunctions oData structures oPointers & linked lists

CMPE13Cyrus Bazeghi 4 What we will cover in this class oEmbedded C oTargeting a microcontroller oMaybe using a soft processor and an FPGA!! oRecursion oTesting and Debugging oPossibly some scripting with Perl and Tcl

CMPE13Cyrus Bazeghi 5 Extended Course Description Required skills to pass the course. 1.Unix tools for programming, including compilers, debuggers, and Makefiles, such as gcc, gdb, and make. 2.Knowledge of software design principles, including: 1.Top-down and bottom-up design 2.Documentation, inline and external 3.Coding style 4.The use of local variables 3.C programming fundamentals 1.Data types, declarations, assignments 2.Functions 3.Conditional and loop structures 4.Static and dynamic memory allocation and manipulation 5.I/O library and string functions 4.Interfacing of C with embedded systems 1.Using C to control hardware 2.Developing mixed assembly language and C programs. 5.Ability to use C to solve programming problems. 6.Ability to manipulate dynamic data structures such as linked lists, multi- dimensional arrays, and function pointers. 7.Understanding of exception processing in C. 8.Ability to design, implement, test, and debug solutions to open-ended programming problems using the C language.

CMPE13Cyrus Bazeghi 6 Extended Course Description Core topics (must be taught) 1.Basic unix review and gcc 2.Data types and operations, memory allocation of variables 3.Control structures 4.Functions, syntax, run-time stack, activation records 5.Pointers and arrays, strings 6.Testing and debugging, gdb, Make 7.Recursion and run-time stack 8.I/O libraries 9.Static structures (typedef, struct) 10.Dynamic memory allocation, single and multi- dimensional arrays 11.Linked lists, stacks, queues in C 12.Introduction to Java or scripting languages

CMPE13Cyrus Bazeghi 7 Course Work (CMPE13) Tentative o20% Homework o10 %Quizzes o30% Midterm Exam oBased on homework, lab and lecture material o40% Final Exam oComprehensive

CMPE13Cyrus Bazeghi 8 Lab Work (CMPE13L) oUNIX/Linux basics oProgramming in C using “gcc” oEmbedded C oScripting with Perl and Tcl oMaybe some “hardware” both on the computer and building kits

CMPE13Cyrus Bazeghi 9 Attendance oMandatory (well..) for both class and lab oBoth lab sections are required oYou must pass the class to pass the lab, you can pass the class but fail the lab

CMPE13Cyrus Bazeghi 10 Cheating o What is it? o What happens if I get caught? o Why even do it?

CMPE13Cyrus Bazeghi 11 Assignment oRead the class website: oRead Chapter 11 & 12 of the text book. oCheck out course book website: oHomework #1 is posted oCheck out the course discussion forum: forums.soe.ucsc.edu forums.soe.ucsc.edu