CSE 130 1st Lecture

Published on: Tue Jan 26 2010

CSE 130 1/25/10 Introduction to C. I liked this class immediately. The professor seems very passionate and knowledgeable about his subject. To start with the professor handed out his syllabus and went over the basics of the class, like homework, exams and grading. The professor covered two general areas relating to C today. The first one was the definition of computer programming and the second one was the steps involved in the programming process, ending with an algorithm translated into Binary (A series of Ones and Zeros which a computing machine can understand and follow). Computer Programming: Algorithmic problem solving What is an Algorithm? Step-by-step description of the problem to be solved The Programming Process 1. Specifications 2. Pseudo-code (Previously I used pseudo code by writing in comments first) 3. Programming Language code 4. Compile (That is, have another program translate your programming code into a machine readable language and package it into a binary or an executable) 5. Execute 5a. Debug (Not part of the lecture, but we probably just didn’t get to it yet) Other notes of interest  C is NOT object oriented  C was developed by Dennis Richie at Bell Labs so he could program UNIX CSE 130 Class notes (provided at class website) Reviewed Package 1 – This did not seem to be completely covered in class, but that is why there are notes to review. Algorithm Attributes: Complete, Precise, Finite Developing an Algorithm 1) Available Input / Desired Output 2) Break into small chunks 3) Refine 4) Write Pseudo code 5) Convert to programming language Problem Solving Process: Analysis, Design, Implementation, Testing Analysis: Determine problem features Design: Describe objects and methods Implementation: Produce the classes and code Testing: Test components individually and collectively