1 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Introduction in Computer Science 2 Administrative Information DEEDS Group.

Slides:



Advertisements
Similar presentations
John Hurley Cal State LA
Advertisements

Lecture 1: Overview CMSC 201 Computer Science 1 (Prof. Chang version)
COMP171 Data Structures and Algorithms Spring 2009.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
1 Course Information Parallel Computing Fall 2008.
1 Course Information Parallel Computing Spring 2010.
CS 201: Introduction To Programming With Java
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
Using MyMathLab Features You must already be registered or enrolled in a current MyMathLab class in order to use MyMathLab. If you are not registered or.
PROBABILITY AND STATISTICS FOR ENGINEERS Session 1 Dr Abdelaziz Berrado MTH3301 —Fall 09.
© Neeraj Suri EU-NSF ICT March 2006 Dependable Embedded Systems & SW Group Introduction to Computer Science 2 SS 2006.
1 ©2010 DEEDS Group Operating Systems II Administrative/Intro Operating Systems II: Dependability and Trust SS 10 Prof. Neeraj Suri DEEDS (Dependable Systems.
COMP 151: Computer Programming II Spring Course Topics Review of Java and basics of software engineering (3 classes. Chapters 1 and 2) Recursion.
New experiences with teaching Java as a second programming language Ioan Jurca “Politehnica” University of Timisoara/Romania
COMPSCI 101 S Principles of Programming Lecture 1 – Introduction.
Object-Oriented Programming Dr. Napoleon H. Reyes, Ph.D. Computer Science Institute of Information and Mathematical Sciences Rm QA, IIMS, Albany.
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
Cpt S 471/571: Computational Genomics Spring 2015, 3 cr. Where: Sloan 9 When: M WF 11:10-12:00 Instructor weekly office hour for Spring 2015: Tuesdays.
MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
COMP Introduction to Programming Yi Hong May 13, 2015.
EECE 310 Software Engineering Lecture 0: Course Orientation.
Please initial the appropriate attendance roster near the door. If you are on the Wait List you will find your name at the bottom. If you are not on the.
Object Oriented Programming (OOP) Design Lecture 1 : Course Overview Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang.
Introduction to Computer Science A Professor Uday Reddy
Object Oriented Programming (OOP) Design Lecture 1 : Course Overview Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Welcome to IIT and cs115!.
© Xiaoying Gao, Peter Andreae Introduction to Computer Program Design COMP T2. Xiaoying (Sharon) Gao Computer Science Victoria University of Wellington.
GdI/ICS 1 WS 2008/2009 Telecooperation/RBG Prof. Dr. Max Mühlhäuser, Dr. Guido Rößling, Melanie Hartmann, Daniel Schreiber.
Prof. Barbara Bernal NEW Office in J 126 Office Hours: M 4pm - 5:30 PM Class Lecture: M 6 PM - 8:30 in J133 Weekly Web Lecture between Tuesday to Sunday.
1 Project Information and Acceptance Testing Integrating Your Code Final Code Submission Acceptance Testing Other Advice and Reminders.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Principles of Financial and Managerial Accounting II Spring Semester Orientation.
Bilgisayar Mühendisliği Bölümü CENG 102 – Computer Programming Melek OKTAY Syllabus Administrative Information.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
CSE 3358 NOTE SET 1 Data Structures and Algorithms.
1 WELCOME TO COMPUTER SCIENCE 1027b COMPUTER SCIENCE FUNDAMENTALS II Lecturers: Eric Schost (001) John Barron (002)
COMP2012 Object-Oriented Programming and Data Structures Fall 2015.
IT Semester 1 Course Introduction IT Portfolio IT 1140 ( Semester 1) Hong Kong Baptist University IT 1140 – IT Portfolio – Course Introduction.
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
CSE 3358 NOTE SET 1 Data Structures and Algorithms.
© Xiaoying Gao, Peter Andreae Introduction to Computer Program Design COMP T2. Xiaoying (Sharon) Gao Computer Science Victoria University of Wellington.
Object Oriented Programming (OOP) Design Lecture 1 : Course Overview Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Using MyMathLab Features of MyMathLab You must already be registered or enrolled in a current MyMathLab class in order to use MyMathLab. If you are not.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
Group 1, Group 2, and Group 3. Your Proficiency Score Will Delegate Your Group Group 1 Group 2 Has passed their reading proficiency. Has NOT passed their.
GdI/ICS 1 WS 2009/2010 Telecooperation/RBG Prof. Dr. Max Mühlhäuser Dr. Guido Rößling Dr. Dirk Schnelle-Walka, Stefan Radomski.
COMP1927 Course Introduction 16x1
INTRODUCTION: WELCOME TO STAT 200 January 5 th, 2009.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Data Structures Curriculum, Trainers, Evaluation, Exams SoftUni Team Technical Trainers Software University
Design and Analysis of Algorithms CS st Term Course Syllabus Cairo University Faculty of Computers and Information.
Distributed Systems Course Overview Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2015/2016.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
Computer Engineering Department Islamic University of Gaza
Cpt S 471/571: Computational Genomics
EECE 310 Software Engineering
Cpt S 471/571: Computational Genomics
PHYS 202 Intro Physics II Catalog description: A continuation of PHYS 201 covering the topics of electricity and magnetism, light, and modern physics.
Programming Assignment Tutorial
Presentation transcript:

1 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Introduction in Computer Science 2 Administrative Information DEEDS Group - TU Darmstadt Prof. Neeraj Suri Constantin Sarbu Brahim Ayari Dan Dobre Abdelmajid Khelil

2 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative English Lectures (ICS2): Prof. Neeraj Suri ‣ ‣ Office Hours: Tuesdays, 14:30 – 15:30 German Lectures (GdI2): Prof. Johannes Buchmann ‣ ‣ Office Hours: Wednesdays in S2/02-B202 Exercises: Erik Dahmen, Richard Lindner ‣ {dahmen, ‣ Office Hours: Wednesdays in S2/02-B216 Labs: Constantin Sarbu, Brahim Ayari ‣ or ‣ Office Hours: Wednesdays, 14:30 – 15:30 Contact Info

3 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Course runs parallel to the German version “Grundlagen der Informatik 2”, Prof. Johannes Buchmann All announcements, dates and important documents: ‣ ICS2: ‣ GdI2: No mailing lists Forum: Both courses are synchronized for: ‣ Labs ‣ Exercises Information Channels

4 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative ICS2 Lectures: ‣ Mondays S1 03 | 23 ‣ Tuesdays11:40-13:20S3 11 | 006 Please be on time! Exams are from the foils AND material covered in the class!!! Lectures

5 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Reference Material Intro. to Algorithms, by Thomas Cormen et al., 2 nd Edition, MIT Press, 2001 ‣ Complexity, Sorting, Data Structures (trees, hash tables), Dynamic programming, Graph algorithms (shortest-paths, flows) ‣ Covers more things beyond the course + ~60 EUR, but our library has some copies (S2|02 A020): Additional Material in German (“Scripts”): ‣ Prof. Dr. T. Härder (Uni Kaiserslauten) Komplexität, Sortieren, Kodierung, Suchen, allg. Speicherstrukturen (auf der Webseite) ‣ Prof. Dr. H. Waldschmidt (TUD) Graphen (erhältlich bei Copies etc., Holzstr. € 5,40)

6 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Total of 200 points to be earned during the semester: ‣ 10 exercise assignments, 8 points each,80 points ‣ 5 lab assignments,16 points each,80 points ‣ 1 test exam, 30 points ‣ 1 programming mini-course,10 points To enroll for the exam you need at least: ‣ 8 exercises out of 10 with a score of at least 2 points each ‣ 50 points out of 80 for the lab assignments ‣ a total score of 100 out of 200 possible points Scores & Evaluation

7 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative The accumulated points can be transformed into bonus points only if the exam is passed (i.e., you scored > 50% in the exam) The bonus points are only valid for the exam held in Autumn 2008, not for subsequent ones! Transformation: ‣ For a bonus points amount of : you will get a grade benefit of: points 0.3 grade points points 0.7 grade points from 180 points 1.0 grade points Marks

8 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative 10 exercise sheets, with homework assignments (one per week) 8 exercise assignments must be handed in at exercises to pass for the exam, you need at least 2 point for each. These will be corrected by the tutors. Per home assignment: max. 8 points (so 80 points in total) Exercises start from third week: you will have to download the exercise sheets from the lecture’s webpage and print them English speaking tutors: ‣ David Becker: Mondays, 16:15 – 17:55 ‣ Martin Tjokrodiredjo: Tuesdays, 15:20 – 17:00 Exercises

9 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Programming mini-course In the past, many GdI2/ICS2 students complained that the programming tasks pose difficulties, language-wise Especially, MCS students claimed that they have too little programming experience This time we offer a programming mini-course in the first three lecture weeks. You have to solve 3 very small programming tasks, assisted by tutors The programming mini-course will familiarize you with: ‣ The pool room (C005) and computer environment used there ‣ Java 1.5 basic language syntax and constructs and a Java IDE ‣ Our tutors ;) Beside these benefits, attending and solving the tasks brings 10 bonus points!!!

10 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Programming Language: Java Assisted by tutors in RBG-Pool room (S2|02 C005) Mo-Fr: 08:00-18:45 (Fr: 08:00-18:00) Each student must register (see slide 13 for reg. deadlines) for the lab (WebReg), and will be assigned to a slot in the testing weeks 5 programming tasks ‣ 16 points for each one, so maximum 80 points ‣ A tutor will assess each student, and give points whether: Does the solution work? (e.g. 7p) Is the student able to show how the algorithm works (on paper)? (e.g. 3p) Is the student able to explain the code? (e.g. 3p) Do the additional test-cases work? (e.g. 3p) Teams of max 3 students Each student is tested individually on clearly stated deadlines (date & time); no delayed solution submission is allowed Labs

11 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Labs Schedule (tentative) * May 1 st – free -> test on May 8 th ; ** May 12 th – free -> test on May 19 th Time to solve each lab assignment: 3 weeks There are overlaps (with the programming course or other lab)! ‣ start working as soon as possible, get the work done on the early side ‣ next lab assignment is available in the testing week for the current assignment Get the points sooner! The labs 4 and 5 bear the most overlap, so don’t depend on the last lab to accumulate the bonus points. English-speaking Tutors: ‣ David Becker:Mondays, 11:40 – 13:20 and 14: :05 ‣ Martin Tjokrodiredjo:Wednesdays, 14:25 – 16:05 and 16: :55 LabHanded outDeadlineTesting week : * : ** : : :

12 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative 1 Test exam ‣ May 19 th (tentative!) ‣ Will be corrected and evaluated in the lecture theatre, and discussed in the next exercise ‣ 30 points Final exam ‣ 25. September, 9-11, location to be announced well in advance ‣ The same content as GdI2 exam (the 2 exams will take place simultaneously) ‣ Only 1x A4 sheet with hand-written notes is allowed ‣ One can only attend iff at least 100 points and 8/10 exercises were accumulated (depending on DPO) ‣ The points are transformed to bonus iff the exam is passed (50%) Exams

13 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Separate exercise and lab registration only possible via Internet: ‣ For exercises: Grundlagen der Informatik II - Übung (LV-Nr ) ‣ For labs: GdI II / ICS 2 – Praktika (LV-Nr ) WebReg System ‣ You’ll need an RBG Account (card?) ‣ preferences and exclusion times Assignment based on exclusion times will be avoided Preferences will be considered, when possible No late registration/changes ‣ workgroups of up to 3 people are possible You can register from: from: Wednesday, 2st of April, 10:00 till: Thursday, 7th of April, 20:00 Assignments are announced on: soon after Registration

14 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Make your own assignments, don’t “borrow” from colleagues, Internet etc. Copy-pasting of code will be noticed and punished: JPlag ( Changing variable/method/class names doesn’t help; JPlag detects these; the program structure is weighted more when simmilarity score is computed Only students belonging to the same team are allowed to present the same code, inter-team work is not allowed and the team that copied the solution will get no points for the respective lab assignment We heard before: “I actually worked with a student from another team for this lab”  tell us if you want to change team BEFORE submitting! Plagiarism

15 ©2008 DEEDS Group Introduction to Computer Science 2 - SS 08 Administrative Bad news: ‣ ICS2 has been responsible for many drop-outs and failed exams ‣ ICS2 contains a lot of material ‣ ICS2 seems easy at first sight, but it is not trivial Good news: ‣ ICS2 contains extremely basic and useful principles of computer science ‣ ICS2 is not so difficult ‣ You can take an A4 “help-sheet” to the exam ICS2 Reputation…