150 likes | 292 Views
TEL 104 / MKK F undamental Programming: Introductory Lecture. People Involved. Lecturer Achmad Yani Basic Electronic Lab., 2nd Floor, Electrical Engineering Department, Gadjah Mada University Email Address: achmad_y@te.ugm.ac.id. Fundamental Programming LECTURE OBJECTIVE.
E N D
People Involved • Lecturer • Achmad Yani • Basic Electronic Lab., 2nd Floor, Electrical Engineering Department, Gadjah Mada University • Email Address: achmad_y@te.ugm.ac.id
Fundamental ProgrammingLECTURE OBJECTIVE • Getting to know the basic idea of Programming (ie. creating a Computer Program), by: • Understanding how the computer works. • Translating the problem into algorithm • Converting the algorithm into pseudocode, etc. • Prove the algorithm‘s correctness
Course Materials • Class Slides (can be downloaded at Papirus System soon) • Class and Online assignments
Textbooks • Prescribed: • L. A. Robertson, Program Design Approach, Thomson Course Technology 2004 • Recommended: • L.L. Wear, Computers, McGraw-Hill 1991 • A.B. Tucker, Fundamentals of Computing I, McGraw-Hill 1995 • A.B. Tucker, Fundamentals of Computing II, McGraw-Hill 1995
Assessment • Final Exam : 60 % • Midterm : 20 % • Assignment : 20 %
Class 1, 16 February 2005: Lectures Overview Class 2, 23 February 2005: Computer System Overview and Algorithm Class 3, 2 March 2005 : Data Type, Pseudocode, Designing solution algorithm Class 4, 9 March 2005 : Selection Control Structures Class 5, 16 March 2005 : Repetition Control Structures Midterm 23 March 2005 Class 6, 30 March 2005 : Combination of Selection, Sequence and Repetition Control Structures Class 7, 6 April 2005: Array Pocessing Class 8, 13 April 2005: Modularisation I Class 9, 20 April 2005: Modularisation II, Cohesion and Coupling Class 10, 27 April 2005: General Algorithms for common Business problems Class 11, 4 May 2005 : Introduction to Object Oriented Design Class 12, 11 May 2005 : Simple Object Oriented Design for Multiple Classes Class 13, 18 May 2005 : Flowcharts Class 14, 25 May 2005 : Nassi-Schneiderman diagrams Class 15, 1 June 2005 : Special Algorithms Class 16, 8 June 2005 : Conclusion Lecture Schedule
Marks and Hurdles • To pass TEL 104 / MKK • Your marks must average to at least 50% of the maximum score • You must submit all of assignment
Student Responsibilities regarding Lectures • Minimize noise • Do not talk in lectures • Donot pack up early • Minimize distractions • Use rear door if you arrive late or leave early • Turn off your mobile phone • Lecture attendance • Catch up on missed lectures • Bring ID card, and produce when required
Lecturer Responsibilities • Prepare and deliver lectures • Start and finish lecture on time • Official start: hour + 0:05 • Official end: hour + 0:55 • Advertise: • Consultation hours • Method of assessment
How is Uni different from school? • Studying is your responsibility • You are in charge of • Lectureattendance • handing in assignments • checking whether your marks have been recorded • Lecturers are not “teachers” • Lecturers do teaching, research and admin
Problem • What is problem? • Reality ≠ Ideality • Cases: • 13 Balls. All with the same weight except 1. Recognize this ball by using weight measure, with 3 attempts.
How do we solve problems? • We "just do" • Guesswork-and-luck • Trial-and-error • Experience (possibly someone else's) • "Scientifically"