240-222 CPT: Prelim/01 Computer Programming Techniques v Objectives –to give some background on this subject 240-222 CPT, Semester 1 2001-2002 0. Preliminaries.

Slides:



Advertisements
Similar presentations
Cpt S 122 – Data Structures Course Introduction
Advertisements

COMP171 Data Structures and Algorithms Spring 2009.
Discrete Maths Objective to give some background on the course , Semester 2, Who I am: Andrew Davison WiG Lab
COMP171 Data Structures and Algorithms Spring 2009.
Lecture Notes (L01) Computers and Programming I Dr. Ming Zhang Tel: (757) Fax: (757) Office: Gosnold Subject.
Welcome to MAT 210. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 12 noon - 1 pm Wednesday 8:30 am –
COMP 14 Introduction to Programming Mr. Joshua Stough January 12, 2005 Monday/Wednesday 11:00-12:15 Peabody Hall 218.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
CENG 213 Data Structures Department of Computer Engineering Middle East Technical University Fall 2014 CENG 213 Data Structures 1.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 12 noon - 1 pm Wednesday 8:30 am –
ECE230 Course Introduction Ying Wu Electrical & Computer Engineering Northwestern University ECE230 Lectures Series.
METU Computer Engineering Department
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Dr. Iyad Jafar Embedded Systems CPE 333. Instructor Information Dr. Iyad F. Jafar Office : Room 002 Computer Engineering Office Hours Sunday & Tuesday.
Cli/Serv.: Prelim/01 Client/Server Distributed Systems v Lecturer:Dr. Andrew Davison Info. Eng. Research Lab (rm 101)
AGD: 1. Preliminaries1 Objective o to give some background on the course Animation and Games Development , Semester 1, Who we.
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
Seminar II: Prelims/0 1 Seminar II Objective – –to give some background on the course , Semester 2, Who I am: Andrew Davison WiG.
Welcome to CS 115! Introduction to Programming. Class URL
Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course , Semester 1, Who I am: Andrew.
OOP (Java): Prelim/ OOP (using Java) Objective – –to give some background on the course Semester 2, Who we are: Andrew Davison.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
ASDA: Prelim/ Advanced Data Structures and Algorithms Objective – –to give some background on the course Semester 2, Who I am: Andrew.
Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
CSEB114: PRINCIPLE OF PROGRAMMING Course Introduction.
COMP2012 Object-Oriented Programming and Data Structures Fall 2015.
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Course Introduction.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Jongwook Woo CIS 520 Software Engineering (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information System.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Introduction to CMPT 281. Outline Admin information Textbooks and resources Moodle site Grading Assignments Project.
Jongwook Woo CIS 528 Introduction to Big Data Science (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information.
CZ1102 Scientific Problem Solving and Computation Monday/Thursday 2:00pm, LT22 Your lecturer: Dr. Wang Jian-Sheng.
King Saud UniversityCSC112 - First Semester CSC 112 Java Programming I Introduction.
OSes: 0. Prelim 1 Operating Systems v Objectives –to give some background on this subject Certificate Program in Software Development CSE-TC and CSIM,
Adv. UNIX: Prelim/01 Advanced UNIX v Who I am: –Andrew Davison CoE, Info. Eng. Research Lab. (Room 101) v Objectives –to.
JTA. Prelim/01 Java Technology and Applications v Objective –to give some background on the course CoE Masters Programme, PSU Semester.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
Fall 2012 Professor C. Van Loan Introduction to CSE Using Matlab GUIs CS 1115.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Compilers: Prelim/0 1 Compiler Structures Objective – –to give some background on the course , Semester 1, Who I am: Andrew Davison.
King Saud University1 CSC 112 Java Programming I Introduction.
Data Structures and Algorithms in Java AlaaEddin 2012.
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
Data Structures By Dr. Mehedi Masud ِAssociate Professor, Computer Science Dept. College of Computers and Information Systems Taif University 1.
B.A. (Mahayana Studies) Introduction to Computer Science November March Preliminaries Some background information for this course.
Course Information CSE 2031 Fall Instructor U.T. Nguyen Office: CSE Home page:
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
1 CENG 707 Data Structures and Algorithms Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University Fall 2013.
CENG 213 Data Structures1 Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University.
CENG 213 Data Structures Nihan Kesim Çiçekli
CENG 707 Data Structures and Algorithms
CSc 020: Programming Concepts and Methodology II
CENG 213 Data Structures Nihan Kesim Çiçekli
CENG 213 Data Structures Dr. Cevat Şener
BIL 104E Introduction to Scientific and Engineering Computing
Computer Science 102 Data Structures CSCI-UA
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
CENG 213 Data Structures Nihan Kesim Çiçekli
Revision exercise #2 Goal: submit an improved version of your lab 6 (MIMT) report Take your report to the University Writing Center for feedback in paper.
Signals and Systems Chapter 0: Course Policies
Compiler Structures 0. Preliminaries
Presentation transcript:

CPT: Prelim/01 Computer Programming Techniques v Objectives –to give some background on this subject CPT, Semester Preliminaries Please ask questions

CPT: Prelim/02 Overview 1. Lecturers 2. Outline of the Course 3.Meeting Time / Location 4. Workload 5. Course Materials 6. Books

CPT: Prelim/03 1. Lecturers v This course (CPT) will be taught by two Ajarn: –Dr. Pichaya Tandayya Room 101, CoE –Dr. Andrew Davison Room 101, CoE

CPT: Prelim/04 A. Introduction to UNIX –taught in two 2nd year labs –your project work will be on a UNIX machine B. Review of Basic C –control flow, functions, character processing, arrays, user-defined type, testing and debugging –sections 1-7 –taught quickly 2. Outline of the Course continued

CPT: Prelim/05 C. Pointers, etc. –introduction to pointers, array with pointers, strings, structures with pointers, file processing –sections 8-13; lab D. Abstract Data Types –what is an ADT?, various forms of lists, various forms of trees, stacks, graphs –sections –labs on lists, stacks, binary trees continued

CPT: Prelim/06 E. Searching and Sorting –measuring complexity, various forms of searching, various forms of sorting –sections 17,18 –lab on searching and sorting

CPT: Prelim/07 3. Meeting Time / Location v Wednesday, pm, R200 v Friday, 11.00am -- noon, R201 v These times/places may change.

CPT: Prelim/08 4. Workload (% of total score) v 2 Exercises:10% total –each exercise is worth 5% –ex1: starts Wednesday 20th June (week 3) u 1 week long; hand in Wed. 27th June –ex2: starts Friday 27th July (week 8) u 1 week long + 1 exam week; hand in Friday 10th August continued

CPT: Prelim/09 v 1 Project:20% –starts Wednesday 29th August (week 13) –lasts 2 weeks; hand in Wed. 12th September –coded on the UNIX student machine ( calvin ) continued

CPT: Prelim/010 v Mid-term Exam:30% (2 hours) –4th August, week 9, pm v Final Exam:40% (3 hours) –26th September, pm

CPT: Prelim/011 Non-Attendance Penalty v We may take registration at the start of a class. v If someone does not attend a class, they lose 0.5% (unless they have a good excuse). v A maximum of 10% can be lost –deducted from final mark

CPT: Prelim/ Course Materials v You should buy a copy of the CPT book from the copy shop in the Engineering faculty –it contains hard copies of the slides v We will hand out one copy of the exercises, past exam papers, and extra slides. continued

CPT: Prelim/013  The code examples from the C text book (D&D) can be found on calvin in: ~ad/teach/cpt/dandd/ v The examples can also be downloaded from the D&D Web site (see slide 14).

CPT: Prelim/ Books v Any good book on UNIX –there are several in the CoE library v For example: –A Practical Guide to the UNIX System Mark G. Sobell Benjamin/Cummings, 1995, (3rd ed.) continued

CPT: Prelim/015 v Any good book on C. We will use: –C: How to Program H.M. Deitel & P.J. Deitel Prentice Hall, 1994 (2nd ed.) – v We call the book ‘D&D’. v A copy is in the CoE library, and we have a copy that can be borrowed.