2011/12/08: Lecture 28 CMSC 104, Section 4 Richard Chang

Slides:



Advertisements
Similar presentations
Introduction to C++ An object-oriented language Unit - 01.
Advertisements

Course Outline Presentation Term: F09 Faculty Name : Asma Sanam Larik Course Name :INTRO TO COMPUTING Course Code : CSE145 Section :1 Semester : 1.
Automatic Memory Management Noam Rinetzky Schreiber 123A /seminar/seminar1415a.html.
Engineering EG167C - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect M1 P. 1Winter Quarter Midterm I Review.
1 Undergraduate Curriculum Revision Department of Computer Science February 10, 2010.
Computer Science It’s more than programming Eric Lantz.
Introduction to Computer Science CS 21a: Introduction to Computing I Department of Information Systems and Computer Science Ateneo de Manila University.
INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.
1 CSE1301 Computer Programming: Revision 1. 2 Topics Type of questions What do you need to know? About the exam Exam technique Staff consultation Sample.
COMPSCI 125 Spring 2011 Section What is computer science? … the study of the theoretical foundations of information and computation and their implementation.
MS DB Proposal Scott Canaan B. Thomas Golisano College of Computing & Information Sciences.
CSCI 3 Introduction to Computer Science. CSCI 3 Course Description: –An overview of the fundamentals of computer science. Topics covered include number.
Wednesday, 12/11/02, Slide #1 CS 106 Intro to Comp. Sci. 1 Wednesday, 12/11/02  QUESTIONS??  Today: CLOSING CEREMONIES!  HW #5 – Back Monday (12/16)
CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
Wednesday, 10/9/02, Slide #1 CS 106 Intro to CS 1 Wednesday, 10/9/02  QUESTIONS ??  Today:  Discuss HW #02  Discuss test question types  Review 
1 CSE1301 Computer Programming: Lecture 35 Revision.
C Language Summary HTML version. I/O Data Types Expressions Functions Loops and Decisions Preprocessor Statements.
What is Computer Science?
Monday, 11/18/02, Slide #1 CS 106 Intro to CS 1 Monday, 11/18/02  QUESTIONS??  Today:  Hand back, discuss HW #4  Discussion of Lab 10  Exam #2 Friday.
CSE1301 Computer Programming: Revision. Topics Type of questions What do you need to know? About the exam Exam technique Sample questions.
Prof. dr Slobodanka Đorđević-Kajan Dr Dragan Stojanović
CS 21a: Intro to Computing I Department of Information Systems and Computer Science Ateneo de Manila University.
1 CSE1301 Computer Programming: Revision. 2 Topics Type of questions What do you need to know? About the exam Exam technique Staff consultation Revision.
© 2007 Pearson Addison-Wesley. All rights reserved 0-1 Spring(2007) Instructor: Qiong Cheng © 2007 Pearson Addison-Wesley. All rights reserved.
CS212: Object Oriented Analysis and Design Lecture 10: Copy constructor.
M.S in CS Introduction & more How do I select a concentration area? by Xudong Yu What is a concentration area? What is a topic paper? Thesis...is that.
CIS-165 C++ Programming I CIS-165 C++ Programming I Bergen Community College Prof. Faisal Aljamal.
Copyright © 2012 Pearson Education, Inc. 9/4/1435 h Sunday Lecture 1 Array’s Terminologies.
1 CSE1301 Computer Programming: Revision. 2 Topics Type of questions What do you need to know? About the exam Exam technique Staff consultation Revision.
Computing Ontology Part II. So far, We have seen the history of the ACM computing classification system – What have you observed? – What topics from CS2013.
CMSC104 Problem Solving and Computer Programming Spring 2009 Sections 0201 & 0301 Ms. Dawn Block.
Main MenuExercise Set 1Exercise Set 2 Interactive Exercises Set 1 Exercise 1.1 Exercise 1.2 Exercise 1.3.
A-1 © 2000 UW CSE University of Washington Computer Programming I Lecture 21: Course Wrap-up and Look Ahead.
Master’s Degree in Computer Science. Why? Acquire Credentials Learn Skills –Existing software: Unix, languages,... –General software development techniques.
C LANGUAGE Characteristics of C · Small size
College of Computer Science, SCU Computer English Lecture 1 Computer Science Yang Ning 1/46.
By: Nelson Webster. Algorithm Engineers Algorithm engineers study the effectiveness and efficiency of procedures of solving problems on a computer.
INTRODUCTION TO COMPUTER ENGINEERING (ECE 001) Dr. Ahmed Bayoumi Dr. Shady Yehia Elmashad 1.
1 CSE1301 Computer Programming: Where are we now in the CSE1301 syllabus?
TCCICOMPUTERCOACH ING.COM.  TCCI-Tririd Computer Coaching Institute provides best teaching in basic computer programming language at tcci-ahmedabad.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Programming and Data Structures
Accelerated B.S./M.S An approved Accelerated BS/MS program allows an undergraduate student to take up to 6 graduate level credits as an undergraduate.
Subject : Computer Science
Brendan Murphy CS 377 Discussion 1 Brendan Murphy
Electrical Engineering
CMSC104 Problem Solving and Computer Programming Spring 2008
Introduction To Computer Engineering (ECE 001)
Basic 1964 PC general purpose Imperative Small Easy to use.
Should we have specialisations at all?
CS 21a: Intro to Computing I
Introduction to C Programming Language
ECET 370 HELPS Education Your Life-- ecet370helps.com.
Introduction to GSL CS 3414 From GNU Scientific Library Reference Manual at
Software Usability and Design
Advanced Programming Basics
2011/11/10: Lecture 21 CMSC 104, Section 4 Richard Chang
Review for Test1.
Review for Midterm Exam
Review for Final Exam.
Linked Lists Chapter 4.
Review for Midterm Exam
Last Class We Covered Asymptotic Analysis Run “time” Big O
Review for Midterm Exam
Review for Final Exam.
Review for Midterm Exam
Review for Midterm Exam
CompSci 1: Principles of Computer Science Lecture 1 Course Overview
Data Structures and ADTs
CMSC104 Problem Solving and Computer Programming Spring 2010
Presentation transcript:

2011/12/08: Lecture 28 CMSC 104, Section 4 Richard Chang Semester Summary 2011/12/08: Lecture 28 CMSC 104, Section 4 Richard Chang [Based on dblock spr’06lecture, slightly modified]

What we covered structured programming (if, while, for, ...) overview of C programming language basic coding skills enough exposure to decide if you are “good at” and/or interested in more CS courses

What we didn’t cover some terminology (a.k.a. jargon) e.g., declarations vs definition, lexical scoping, function signature, binary search, side effects, ... stuff that would require more memorization e.g., operator precedence, ... recursion memory allocation multi-dimensional arrays

What we didn’t cover (cont’d) short-circuit evaluation if ( n != 0 && k / n > 5 ) more data types unsigned int, long int, enumeration types, const, bool, struct, type definition type casting x = (double) n ; file input/output fopen, fclose, fprintf, fscanf

Looking ahead object-oriented programming design data structures efficiency concerns domain knowledge

Domain knowledge from www.usabilityfirst.com knowledge about a specific field of interest; knowledge about the content area for which a piece of software is being designed, as opposed to programming knowledge.

Some Areas of CS Computer Graphics Games Databases Computer Networks Algorithms Scientific Computing Parallel Computing Artificial Intelligence Natural Lang. Proc. Computer Security Theory of Computation Architecture Operating Systems ...