Www.monash.edu.au 1 COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf.

Slides:



Advertisements
Similar presentations
CICT Course Introduction The aim of this course is to provide you with practical ICT skills to help with your studies.
Advertisements

1 FIT 1002 Computer Programming: Introductory Lecture.
John Hurley Cal State LA
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Event driven software.
1 CSE1301 Computer Programming: Introductory Lecture.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
MAC 1114 Trigonometry. All changes will be announced during class.
Plagiarism Do not do it!. What is plagiarism? It is cheating, and stealing It is an attempt to gain credit for something that is not your property, not.
Professor Weaver CSC181 Programming I Professor Weaver
CSE1301 Computer Programming: Introductory Lecture Damian Conway Room 132, Building 26
1 TEL 104 / MKK Fundamental Programming: Introductory Lecture.
CS3381 Des & Anal of Alg ( SemA) City Univ of HK / Dept of CS / Helena Wong 0. Course Introduction - 1 CS3381 Design and Analysis of Algorithms.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
1 CSE1301 Computer Programming: Introductory Lecture.
1 CSE1301 Computer Programming: Introductory Lecture.
July 23, 2003 CSI 121 Structured Programming Language Introductory Lecture Sabbir Muhammad Saleh Lecturer Department of CSE University of South Asia.
CMPD 434 MULTIMEDIA AUTHORING
1 CSE1301 Computer Programming: Introductory Lecture.
© Neeraj Suri EU-NSF ICT March 2006 Dependable Embedded Systems & SW Group Introduction to Computer Science 2 SS 2006.
METU Computer Engineering Department
COMPSCI 101 S Principles of Programming Lecture 1 – Introduction.
Placement Reading 90- Accuplacer or THEA (or passing grade on reading 80) Reading 80- Accuplacer or THEA
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
Placement Reading 90- Accuplacer or THEA (or passing grade on reading 80) Reading 80- Accuplacer or THEA
SE-308 Software Engineering-II 7th Term SE University of Engineering & Technology Taxila, Pakistan Software Engineering Department.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
The Examination Period and what happens next Dr Mike Spann 1 st Year Tutor School of Electronic, Electrical & Computer Engineering The University.
© Xiaoying Gao, Peter Andreae Introduction to Computer Program Design COMP T2. Xiaoying (Sharon) Gao Computer Science Victoria University of Wellington.
Welcome to CS 115! Introduction to Programming. Class URL
EEL4712 Digital Design. Instructor Dr. Greg Stitt Office Hours: TBD (Benton 323) Also, by appointment.
Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course , Semester 1, Who I am: Andrew.
CS1201: Programming Language 2 C++(Course Introduction) Level 2 Nouf Aljaffan 1 st Term Nouf Aljaffan (C) CSC 1201 Course at KSU.
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.
Overview Algorithms Baojian Hua
Welcome to CS 221! First Course in Computer Science for Engineers.
Welcome to CS 115! Introduction to Programming. Class URL ~mjspra2/ 115summer/
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
IPC144 An Introduction to Programming Using C. Instructor Murray Saul Office: Rm –Office hours are posted on my IPC144 web page or on bulletin board.
Course Objectives Discuss fundamental concepts of information technology Show how computers are used as practical tools for solving personal, business,
1 [CMP001 Computer Orientation I] Course Guide Ms. Wesal Abdalfattah office#: 357 Ext#: 8612 Prince Sultan University,
Welcome to the MTLC MATH 115 Spring MTLC Information  Hours of Operation  Sunday:4:00pm – 10:00pm  Monday – Thursday: 8:00am – 10:00pm  Friday:8:00am.
King Saud UniversityCSC112 - First Semester CSC 112 Java Programming I Introduction.
ACIS 3504 Accounting Systems and Controls. 2 Dr. Linda Wallace  Office: Pamplin 3092  
CGMB324: MULTIMEDIA SYSTEM DESIGN
COMP1927 Course Introduction 16x1
Cheating The School of Network Computing, the Faculty of Information Technology and Monash as a whole regard cheating as a serious offence. Where assignments.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
Course Information CSE 2031 Fall Instructor U.T. Nguyen Office: CSE Home page:
Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.
Statistics Spring Introduction Dr. Robb T. Koether Office: Bagby 114 Office phone: Home phone: (before 11:00 p.m.) Office hours:
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.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
COMP9024: Data Structures and Algorithms Course Outline Hui Wu Session 1, 2016
CS101 Computer Programming I
COMP9024: Data Structures and Algorithms
Introduction to Programming
ACIS 3504 Accounting Systems and Controls
CSI 121 Structured Programming Language Introductory Lecture
Computer Science 102 Data Structures CSCI-UA
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1301! Principles of Programming I.
Analysis of Algorithms
Presentation transcript:

1 COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of the Copyright Act 1968 (the Act). The material in this communication may be subject to copyright under the Act. Any further reproduction or communication of this material by you may be the subject of copyright protection under the Act. Do not remove this notice.

FIT2004 Algorithms & Data Structures Introductory Information Prepared by: Bernd Meyer July 2008

3 Timetable Synopsis Lectures –Monday 11am (25/S9) –Wednesday 1pm (11/H2) –Practicals/Labs (pracs, see allocate+) –fortnightly (2 hours+1 hour marking) starting Wk 4 Tutorials (tutes, see allocate+) –Wk 2 and Wk 3 then fortnightly (1 hour) starting Wk 2

4 Overview of Syllabus Specification & Verification –Abstract Data Types –Correctness Data Structures –particularly dynamic data structures Standard Algorithms –for Sequences (Strings), Lists, Trees, Graphs Algorithm Design Principles –Divide & Conquer, Dynamic Programming, Plane Sweep Complexity Analysis

5 Preliminary Timetable FIT2004

6 This is NOT a Programming Class Note 1 Code is only used to illustrate concepts You need to be able to program! (see literature: D. Bailey’s book)

7 Note 2 If you didn’t learn Java You can solve the pracs and assignments in ‘C’. you won’t be penalized, but don’t expect too much help. If you want to use any other language, ask me.

8 Time Requirements 2 x 1 hour lectures 0.5 x 1 hour tutorial (compulsory) 0.5 x 2 hour practical (compulsory) 0.5 x 1 hour presentation of assignment solutions (usually, during 3 rd hour of practical) … plus preparation at home (nominally 8 hrs!) … read, read, read … try to implement algorithms

9 People Involved Lecturer –A/Prof Bernd Meyer, Building 63 (136) Head Tutor –Dhananjay.Thiruvady, Building 63 (137) Tutors & Demonstrators –Timothy Dolley –Minh Dinh

10 Course Materials Found at the unit’s MOODLE site, including: –Introductory Notes –Lecture Notes –Practicals (Lab) Notes –Tutorial Sheets Remember to: –Set your forward if you need it!!!

11 Textbooks -Mark Allen Weiss: Data Structures and Algorithm Analysis in Java. 2nd Edition. Addison-Wesley. (exact title, there is a different book with a very similar title!!!) -Michael Goodrich and Roberto Tamassia. Data Structures and Algorithms in Java, 3rd or 4th Edition. John Wiley. Also Recommended –Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms. 2nd Edition. The MIT Press & Mc Graw Hill. –Robert Sedgewick. Algorithms in Java, 3rd Edition. Addison-Wesley. (Library online holding available) –Duane A. Bailey. Java Structures. McGraw Hill.

12 Tutorials 1 hour/fortnight compulsory Start in Week 2 Notes made available during the semester –may be downloaded from WWW / Moodle You must prepare tutorials beforehand!

13 Practicals 2 hrs/fortnight compulsory (marking afterwards: 1 hr) Locations and Times see Allocate+ Conducted by “Lab Demonstrators” Start in Week 4 –Organize your computer account before the first prac if you do not already have one ( Notes available in first practical class –may be downloaded from the WWW

14 Practicals Marks 2 hrs/fortnight compulsory (marking afterwards: 1 hr) For repeat students: prac marks can be rolled over if you achieved >= ‘D’ average Marks a preliminary up to the Revision Week Marks are preliminary up to the Revision Week. Read the marking policy on Moodle!

15 Prac Requirements Computer account: –username, Authcate password, Novell password –Where? > >ITS Helpdesk –Bring student ID card

16 Software used in Pracs “Java” programming language Free Implementations and Documentation available at – –and various other places “BlueJ” development environment (educational IDE) Free versions and Documentation are available at –

17 Missed Pracs and Tutorials If you miss a prac, you will be marked ABSENT, unless you do the TWO following things: 1.attend another prac the same week (with the approval of the Head Tutor), AND 2. to head tutor –NAME: –ID NUMBER: –DATE OF REPLACEMENT PRAC: –REGULAR PRAC: (time and room) –REPLACEMENT PRAC: (time and room)

18 Missed Pracs and Tutorials (cont) If you had an illness or emergency, then If you 1.Obtain a Certificate 2.Hand in a Special Consideration Form (see university web pages for SC policy) Then Your mark will be changed from ABSENT to SICK

19 Missed Pracs and Tutorials (cont) At the end of the semester: –provided you attended at least 75% of the pracs –your marks are taken only out of those pracs that you attended.

20 Self-Assessment and Practice Use TRAKLA2 – Electronic exercise system See Moodle web site

21 Assessment Prac Class Assessment: 30% –6 pracs, 10 marks each –Hurdle 1: 50% of the prac mark –Hurdle 2: attempt at least 4 pracs Final exam: 70% –Hurdle 3: 50% of the exam mark

22 Marks and Hurdles To pass FIT2004 –Your marks must average to at least 50% –You must pass each individual hurdle Failure to meet a hurdle will result in a maximum mark of 44N

23 Plagiarism and Cheating Monash University takes plagiarism and cheating very seriously. There are severe penalties for them. See udent/assignments/policies.html udent/assignments/policies.html Plagiarism is legitimately using someone else's work, but not acknowledging it. Cheating is pretending that someone else's work is your own, in order to gain an unfair advantage. It is OK to work together on your assignments, but each person must write the entire assignment alone and be able to explain and modify it on request.

24 Staff Consultations Bernd Meyer –Thursday 4-6 pm –Rm 136, Bldg 63 –

25 Language and Learning Officer Amanda Everaert Individual/group consultations and courses LLS offices, 1st Floor, Union Building (Western extension)

26 Student Responsibilities During lectures: minimize noise/distractions –Do not talk in lectures –Do not pack up early –Use rear door if you must arrive late or leave early –Turn off your mobile phone Lecture attendance –Catch up on missed lectures