IAG0582 Introduction.

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

1 ENGI 2420 Structured Programming (Lab Tutorial 0) Memorial University of Newfoundland.
COMP171 Data Structures and Algorithms Spring 2009.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
COMP152 Object-Oriented Programming and Data Structures Spring 2011.
CS-2852 Data Structures LECTURE 1A Andrew J. Wozniewicz Image copyright © 2010 andyjphoto.com.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Computer Network Fundamentals CNT4007C
Introduction. » How the course works ˃Homework ˃Project ˃Exams ˃Grades » prerequisite ˃CSCI 6441: Mandatory prerequisite ˃Take the prereq or get permission.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
Course Introduction Software Engineering
Computer Science Department Data Structure & Algorithms Lecture 8 Recursion.
CS 23021–600 Computer Science I Dr. Angela Guercio Spring 2010.
Bilgisayar Mühendisliği Bölümü CENG 102 – Computer Programming Melek OKTAY Syllabus Administrative Information.
1 Principles of Computer Science I Note Set 1 CSE 1341.
Introduction to Data Structures
Introduction. » How the course works ˃Homework ˃Project ˃Exams ˃Grades » prerequisite ˃CSCI 6441: Mandatory prerequisite ˃Take the prereq or get permission.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
CSC 213 – Large Scale Programming Prof. Matthew Hertz WTC 207D /
Project 1 (CGNB 413) Briefing
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.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
PROGRAMMING I Lecture: Vladimir Viies Lab: Margit Aarna & co Location: ICT – 502 Nesting ground: ICT- 517 margit(at)ati.ttu.ee.
C Programming Lecture 1 : Introduction Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang University.
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
Introduction to Management
Data Structures and Algorithms in Java AlaaEddin 2012.
BIT 143: Programming-Data Structures1 Before Class Begins: Sit in front of a computer Log in –IF you don’t yet have an account, you can use the guest account.
Computer Networks CNT5106C
CompSci 101 Introduction to Computer Science November 11, 2014 Prof. Rodger CompSci 101 Fall Review for exam.
Selection Using IF THEN ELSE CASE Introducing Loops.
Chapter 3 Lists, Stacks, Queues. Abstract Data Types A set of items – Just items, not data types, nothing related to programming code A set of operations.
Lecture 1 Data Structures Aamir Zia. Introduction Course outline Rules and regulations Course contents Good Programming Practices Data Types and Data.
CMSC201 Computer Science I for Majors Lecture 19 – Recursion
Programming and Data Structures
CSc 120 Introduction to Computer Programing II
Computer Network Fundamentals CNT4007C
CS101 Computer Programming I
IE102 A Process Outlook for Industrial Engineering
Everything you need to know!
CSc 1302 Principles of Computer Science II
Computer Networks CNT5106C
CS 215 Final Review Ismail abumuhfouz Fall 2014.
GC101 Introduction to computers and programs
Algorithm Analysis CSE 2011 Winter September 2018.
Computer Networks CNT5106C
Foundation Degree IT Project
CS 1302 Programming Principles II
Lesson Objectives Aims
Introduction to Programming Using C++
CSE 214 – Computer Science II B-Trees
EE422C Software Design and Implementation II
Today’s Objectives Week 2 Announcements HTML Bonus Lab 1
Programming II IAX0584 Lecture + lab: Risto Heinsar & Co Vladimir Viies Declare subject to: Vladimir Viies.
Beginning C for Engineers
Tonga Institute of Higher Education IT 141: Information Systems
C Programming Lecture 1 : Introduction
Computer login Reboot to Linux
Software Usability Course notes for CSI University of Ottawa
Functions continued.
C Programming Lecture 1 : Introduction
Bubble sort.
CSc 2310 Principles of Programming (Java)
Computer Networks CNT5106C
Tonga Institute of Higher Education IT 141: Information Systems
CS313T Advanced Programming language
Presentation transcript:

IAG0582 Introduction

Contacts Margit Aarna Risto Heinsar Nesting grounds: ICT-517 margit [ät] ati.ttu.ee Risto Heinsar risto.heinsar [ät] ttu.ee Nesting grounds: ICT-517 https://blue.pri.ee/ttu 2017

Group selection – this one is special This is a lecture + lab type of class. The following rules only apply to our English lab time! There is no separate lecture The tests are conducted during the labs Everything will be submitted to and graded by us Transfers to and from the other lab (running concurrently with us) are allowed for the first three weeks. 2017

Prerequisites C program structure Variable declarations Arrays, up to 2 dimensions Loops Conditionals Strings Functions Ability to create a decent title page and write documentation 2017

What to expect Pointers Binary operations File access Programming microcontrollers Structures Database connections (SQL) Dynamic memory management etc. Recursions Advanced data structures (stack, linked list) 2017

Coding style Using our coding style is highly recommended, but not mandatory. If you already have a commonly acceptable style, we’ll allow it. However the following is mandatory Meaningful comments (functions, files, complex operations, conditions etc.) Different naming schemes for variables, functions, macros Whitespace (empty lines, spaces) Line length Uniformity – sticking with the style throughout the code 2017

Borrowing ideas and code When using code written by someone else, you must understand exactly what it does and how it does it. When working together in the lab, everybody involved must have full understanding of the code. We may ask you to defend your lab tasks, homework, test or exam code. In this case, the score will be 0 until a successful defense. Obvious and intentional plagiarism will be dealt with according to the procedure for processing contemptible behavior. 2017

Your grade 15p homework I 15p homework II 10p homework III 65p exam 2p for advanced solutions 15p homework II 10p homework III 65p exam “5” 90p+ “4” 80 – 89p “3” 70 – 79p “2” 60 – 69p “1” 50 – 59p “0” 0 – 49p 2017

The exam Prerequisite = tests (40p) + lab (36p) + bonus (10p) Pre-exam Exam Prerequisite 60p During a lab time Some topics removed Prerequisite 50p During the examination session All of the topics Prerequisite = tests (40p) + lab (36p) + bonus (10p) You can only use the lab computer Exam will consist of code and a written part 2017

Homework I and II Homework I (15p base + 2p bonus) Using structures Files Homework II (15p base + 2p bonus) Dynamic memory management Error-proofing … and everything we’ve learnt so far (style, functions etc.) Each week past deadline reduces the score by 1p (up to -5p)* 2017

Homework III Database Programming a microcontroller Your own project Communicating with a database Creating a simple UI Programming a microcontroller TBD Your own project If you have something in mind that’s related to this subject and you really want to do it Only with specific per-project agreements 2017

Labs and bonus points A total of 36p (attendance, solving tasks, pop quizzes, etc.) Only accepted face to face When finished, let us know Most tasks have advanced subtasks/extras If you didn’t finish in time, do it at home and show at a later date. The bonus points are earned by implementing additional functionality to your code that wasn’t specified in the requirements 2017

Tests Test 1 (20p) Pointers Files Structures Test 2 (20p) Dynamic memory allocation Stack Relations Recursion Tests will consist of code and a written task (questions about material) 2017

Deadlines and dates Item Date Comment Homework I 05.03.2017   Homework II 23.04.2017 Homework III xx.05.2017 Date is provided by task supervisor! Homework III custom 28.04.2017 Agreement only Test I 08.03.2017 During the lab Test II TBD Tests lock 17.05.2017 12:00 16th week lab time Labs, bonus lock 05.05.2017 Hard deadline, no longer accepted HWI, HWII lock Pre-exam 2017

Consultations For now: use any of our other programming II lab times Wed 8:00 – 11:30 Fri 10:00 – 12:30 Fri 13:00 – 15:30 There will be a dedicated time announced later 2017

Questions? 2017