Presentation is loading. Please wait.

Presentation is loading. Please wait.

CSE Spring 2015 INTERMEDIATE PROGRAMMING

Similar presentations


Presentation on theme: "CSE Spring 2015 INTERMEDIATE PROGRAMMING"— Presentation transcript:

1 CSE1320-001-Spring 2015 INTERMEDIATE PROGRAMMING
Dr. Sajib Datta Jan 21, 2015

2 Course Syllabus Instructor: Sajib Datta TA and office hours:
Office Location: ERB 336 Address: Web Site: 1/cse spring-2015.html Office Hours: TuTh: 3:30 PM - 5:00 PM TA and office hours: Fariba Zohrizadeh Office hours: Monday and Wednesday 10-12 Office number: ERB 424

3 Course Syllabus -Course Description
Learn to program in C at a level beyond an introductory programming course. Exposure to basic data structures Learn the concept of object-oriented programming in C++ Learn to use the Linux operating system

4 Course Syllabus W. D. Foster and L. S. Foster: C By Discovery (4th Edition)

5 Course Syllabus -Labs and Exams
All labs (5) will be posted on the course website and announced in class. Each lab will be distributed one week before the due time. No late Labs will be accepted except for university-excused absences with documentation submitted before or less than 3 calendar days after the due date. Two exams and Final exam Comprehensive

6 Course Syllabus -Grading
Pop Quizzes 15% Labs 30% (5 labs) Exams 30% (2 midterms, 15% each) Final Exam 25% Final grades are based on the standard ranges of A: 90–100, B: 80–89, C: 70–79, D: 60–69, F: 0–59 Instructor reserves the right to change the distribution

7 To succeed in this course
Practice!!! Test code (debug)

8 What’s Programming What is computer programming? What is an algorithm?
Interpretation of a task or algorithm in a computer language. What is an algorithm? A set of instructions for accomplishing a task. Input and Output

9 What’s Programming How about preparing salad? Steps:
Clean and cut vegetables Put sauce & cheese Stir

10 What’s Programming -An example
The algorithm for sorting three integers in ascending order, given 20, 5, 8. Steps: 5, 8, 20 To determine the concrete steps involved in solving a problem, we may Logically represent the problem Implement the logic in computer languages (c, c++, java, python, perl…) Given a thousand integers?

11 Why Programming Manually operating – not possible
Google search engine (Searching in a File)

12 Basic Components of a Computer
CPU – central processing unit RAM – random access memory Computer data storage Integrated circuits – randomly access with constant time Permanent memory – hard disk Computer peripheral – mouse, keyboard

13 Programming Platform For omega access, each student that needs to have access to it will need to contact the help desk and request it. The best way is to call them at and ask to have omega access added to your NetID account. Visual Studio download information: al-studio-2010/index.php

14 First Example

15 First Example # include <stdio.h> int main( ) /* a … */
Tell compiler to include the information included in studio.h int main( ) A function name C programming consists of one or more functions (basic modules) Parenthesis identify a function Similar to the function defined in math Arguments and return /* a … */ Enclose comments (block), “//” – single line Intended for the reader and ignored by the compiler

16 First Example { - the beginning of the function body (statements separated by “;”) int num; A declaration statement num is an identifier Declare a variable before using it Traditionally, declare it at the beginning Lowercase letters, uppercase letters, digits, the underscore First character must be a letter or an underscore Not key words

17 First Example num = 1; printf(“ ”) \n an assignment statement
Set space in memory Reassign later printf(“ ”) Part of the standard C library, a function \n Start a new line

18 First Example %d return - a return statement of a function
Placeholder/format specifier - where and in what form to print return - a return statement of a function } – the end of the function

19 A “Good” Program There are different criteria by which one program may be considered better than another. Some examples are: Readability – collaborative work Maintainability – self-updated Scalability – large-scale data set Performance (e.g., how fast it runs or how much memory it uses)


Download ppt "CSE Spring 2015 INTERMEDIATE PROGRAMMING"

Similar presentations


Ads by Google