Informatics2-2020

A MathWikiből
(Változatok közti eltérés)
a (Midterms)
 
(2 szerkesztő 45 közbeeső változata nincs mutatva)
6. sor: 6. sor:
 
** Monday 9:15-10:00 H601
 
** Monday 9:15-10:00 H601
 
* '''Lab'''
 
* '''Lab'''
** Wednesday 12:15-14:00 (H507)
+
** Wednesday 12:15-14:00 (H27)
 
** Thursday 12:15-14:00 (H601)
 
** Thursday 12:15-14:00 (H601)
  
15. sor: 15. sor:
 
The midterms will worth 20 points each. You have to reach a minimum of 10 points in every midterm!
 
The midterms will worth 20 points each. You have to reach a minimum of 10 points in every midterm!
  
# midterm: 9<sup>th</sup> March, Monday 4pm-5pm
+
# midterm: 9<sup>th</sup> March, Monday 4pm-5pm, room KM34 [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh1_20i2_eng.pdf pdf]
# midterm: 6<sup>th</sup> April, Monday 4pm-5pm
+
#* repetition: 7<sup>th</sup> April, Tuesday 5pm-6pm, in hazi-system
# midterm: 18<sup>th</sup> May, Monday 4pm-5pm
+
# midterm: 14<sup>th</sup> April, Tuesday 6pm-7pm, in hazi-system [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh2_20i2_eng.pdf pdf]
 +
#* again: 28<sup>th</sup> April, Tuesday 6pm-7:15pm [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh2_2_20i2_eng.pdf pdf]
 +
#* repetition: 12<sup>th</sup> May, Tuesday 6pm-7:15pm
 +
# midterm: 19<sup>th</sup> May, Tuesday 6:05pm-7:20pm [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh3_20i2_eng.pdf pdf]
 +
#* repetition: 26<sup>th</sup> May, Tuesday 6pm-7:15pm
 +
* extra repetition: 2<sup>nd</sup> June, 6pm-7:15pm
 +
** You can repeat one of the previously failed midterms.
  
 
=== Quick Quiz ===
 
=== Quick Quiz ===
32. sor: 38. sor:
  
 
# Getting started with Python [http://math.bme.hu/~wettl/okt/info2/2020/e01_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e01_20i2_en.html html]
 
# Getting started with Python [http://math.bme.hu/~wettl/okt/info2/2020/e01_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e01_20i2_en.html html]
#  
+
# Loops and lists [http://math.bme.hu/~wettl/okt/info2/2020/e02_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e02_20i2_en.html html]
#  
+
# Functions [http://math.bme.hu/~wettl/okt/info2/2020/e03_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e03_20i2_en.html html]
#  
+
# Data structures [http://math.bme.hu/~wettl/okt/info2/2020/e04_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e04_20i2_en.html html]
#  
+
# Strings and regular expressions [http://math.bme.hu/~wettl/okt/info2/2020/e05_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e05_20i2_en.html html]
#  
+
# OOP [http://math.bme.hu/~wettl/okt/info2/2020/e06_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e06_20i2_en.html html]
#  
+
# OOP 2. [http://math.bme.hu/~wettl/okt/info2/2020/e07_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e07_20i2_en.html html]
#  
+
# More on functions [http://math.bme.hu/~wettl/okt/info2/2020/e08_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e08_20i2_en.html html]
#  
+
# File operations, command line arguments [http://math.bme.hu/~wettl/okt/info2/2020/e09_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e09_20i2_en.html html] [http://math.bme.hu/~wettl/okt/info2/2020/E0.csv E0.csv]
#  
+
# Programming strategies [http://math.bme.hu/~wettl/okt/info2/2020/e10_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e10_20i2_en.html html]
#  
+
# Binary trees [http://math.bme.hu/~wettl/okt/info2/2020/e11_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e11_20i2_en.html html]
#  
+
# Modules [http://math.bme.hu/~wettl/okt/info2/2020/e12_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e12_20i2_en.html html]
#
+
# Functional programming [http://math.bme.hu/~wettl/okt/info2/2020/e13_20i2_en.ipynb ipynb] [http://math.bme.hu/~wettl/okt/info2/2020/e13_20i2_en.html html]
  
 
== Labs ==
 
== Labs ==
72. sor: 78. sor:
 
For example, the exercise <tt>fahrenheit</tt> should be submitted by sending an email to the given address (before the deadline) with an attachment <tt>fahrenheit.py</tt>, a plain text file containing your code.
 
For example, the exercise <tt>fahrenheit</tt> should be submitted by sending an email to the given address (before the deadline) with an attachment <tt>fahrenheit.py</tt>, a plain text file containing your code.
  
You can read more about the [[HomeworkSystem|homework tester system]].
+
You can make such a text file with [https://notepad-plus-plus.org/ Notepad++] or in jupyter with '''New -> Text File'''.
  
* 0. homework
+
[[Fájl:textfile.png]]
  
# [[Informatics2-2020/HW1|homework]]
+
You can read more about the [[HomeworkSystem|homework tester system]].
# [[Informatics2-2020/HW2|homework]]
+
=== Homeworks ===
# [[Informatics2-2020/HW3|homework]]
+
* 0. homework
# [[Informatics2-2020/HW4|homework]]
+
** '''<tt>greeting_program</tt>'''
# [[Informatics2-2020/HW5|homework]]
+
** '''<tt>greeting_function</tt>'''
# [[Informatics2-2020/HW6|homework]]
+
** Deadline: 2020.02.23 23:59:59
# [[Informatics2-2020/HW7|homework]]
+
** '''1 point''' if all of the tests are correct in both exercises
# [[Informatics2-2020/HW8|homework]]
+
# homework
# [[Informatics2-2020/HW9|homework]]
+
#* '''<tt>neighbors</tt>'''
 +
#* '''1 point''' if all of the 8 tests are correct
 +
#* Deadline: 2020.03.01 23:59:59
 +
# homework
 +
#* '''<tt>packing</tt>'''
 +
#* '''<tt>evaluate</tt>'''
 +
#* '''<tt>product_x</tt>'''
 +
#* '''<tt>magic_square</tt>'''
 +
#* Deadline: 2020.03.08 23:59:59
 +
#* '''1 point''' each
 +
# homework
 +
#* '''<tt>advanced_indexing</tt>'''
 +
#* '''<tt>matrix_sum</tt>'''
 +
#* '''<tt>divisor_dict</tt>'''
 +
#* '''<tt>midterm_result</tt>'''
 +
#* Deadline: 2020.03.15 23:59:59
 +
#* '''1 point''' per exercise
 +
# homework
 +
#* '''<tt>moduloz_init</tt>'''
 +
#* '''<tt>moduloz_operations</tt>'''
 +
#* '''<tt>matrix_init</tt>'''
 +
#* '''<tt>matrix_operations</tt>'''
 +
#* Deadline: 2020.04.05 23:59:59
 +
#* '''1 point''' per exercise
 +
# homework
 +
#* '''<tt>variadic_intersect</tt>'''
 +
#* '''<tt>quadratic_solve</tt>'''
 +
#* '''<tt>matrix_error</tt>'''
 +
#* '''<tt>moduloz_matrix</tt>'''
 +
#* Deadline: 2020.04.13 23:59:59
 +
#* '''1 point''' per exercise
 +
# homework
 +
#* '''<tt>decode_date</tt>''' 1 point
 +
#* '''<tt>argv_sum</tt>''' 1 point
 +
#* '''<tt>tortoise</tt>''' 1 point
 +
#* '''<tt>midterm_csv</tt>''' 2 points
 +
#* Deadline: 2020.04.26 23:59:59
 +
# homework
 +
#* '''<tt>parenthesis_depth</tt>''' 1 point
 +
#* '''<tt>descartes_product</tt>''' 1 point
 +
#* '''<tt>matrixlog</tt>''' 1 point
 +
#* '''<tt>tree_cut</tt>''' 2 points
 +
#* Deadline: 2020.05.10 23:59:59
 +
# homework
 +
#* '''<tt>calculator_basic</tt>''' 1 point
 +
#* '''<tt>calculator_parenthesis</tt>''' 2 points
 +
#* '''<tt>calculator_function</tt>''' 2 points
 +
#* Deadline: 2020.05.17 23:59:59
 +
# homework
 +
#* '''<tt>num_int</tt>''' 1 point
 +
#* '''<tt>num_diff</tt>''' 1 point
 +
#* Deadline: 2020.05.31 23:59:59
 +
# homework
 +
#* Make any program you want (in python 3.6)
 +
#* Send it to <tt>hazi@math.bme.hu</tt>
 +
#* The attachment should be a <tt>.py</tt> file and the filename should contain '''HW9'''.
 +
#* I will grade the correctness and complexity of the program.
 +
#* You can get maximum 5 points.
 +
#* Deadline: 2020.05.31 23:59:59

A lap jelenlegi, 2020. június 2., 18:43-kori változata

Tartalomjegyzék

General informations

  • Lecturer: Ferenc Wettl (wettl)
  • Labs: Gábor Borbély (borbely)
  • Lecture
    • Monday 9:15-10:00 H601
  • Lab
    • Wednesday 12:15-14:00 (H27)
    • Thursday 12:15-14:00 (H601)

Requirements

Course Requirements

Midterms

The midterms will worth 20 points each. You have to reach a minimum of 10 points in every midterm!

  1. midterm: 9th March, Monday 4pm-5pm, room KM34 pdf
    • repetition: 7th April, Tuesday 5pm-6pm, in hazi-system
  2. midterm: 14th April, Tuesday 6pm-7pm, in hazi-system pdf
    • again: 28th April, Tuesday 6pm-7:15pm pdf
    • repetition: 12th May, Tuesday 6pm-7:15pm
  3. midterm: 19th May, Tuesday 6:05pm-7:20pm pdf
    • repetition: 26th May, Tuesday 6pm-7:15pm
  • extra repetition: 2nd June, 6pm-7:15pm
    • You can repeat one of the previously failed midterms.

Quick Quiz

At the beginning of every lab, there will be a Kahoot quiz, testing the previous material.

  • https://kahoot.it/
  • The maximum point (for the semester) is 10
  • You have to reach a minimum of 5
  • There will be 5 extra quizzes, so the 100% is actually 10 points out of 15!

Lectures

The lectures can be read in html format or you can run them as jupyter notebook.

  1. Getting started with Python ipynb html
  2. Loops and lists ipynb html
  3. Functions ipynb html
  4. Data structures ipynb html
  5. Strings and regular expressions ipynb html
  6. OOP ipynb html
  7. OOP 2. ipynb html
  8. More on functions ipynb html
  9. File operations, command line arguments ipynb html E0.csv
  10. Programming strategies ipynb html
  11. Binary trees ipynb html
  12. Modules ipynb html
  13. Functional programming ipynb html

Labs

We will use jupyter.math.bme.hu on the labs. You can start a similar notebook with the command jupyter notebook on your computer (if it is installed).

  1. lab
  2. lab
  3. lab
  4. lab
  5. lab
  6. lab
  7. lab
  8. lab
  9. lab
  10. lab
  11. lab
  12. lab
  13. lab

Homework

  • There will be 40 points of homeworks during the semester
    • 30 points is considered a 100% so there is 10 points of extra homework
    • You have to reach at least 15 points at the end of the semester
  • You have to submit the homeworks to hazi@math.bme.hu
  • Use your math account!
  • The exercises should be submitted as an attachment file with the same name as the exercise.

For example, the exercise fahrenheit should be submitted by sending an email to the given address (before the deadline) with an attachment fahrenheit.py, a plain text file containing your code.

You can make such a text file with Notepad++ or in jupyter with New -> Text File.

Textfile.png

You can read more about the homework tester system.

Homeworks

  • 0. homework
    • greeting_program
    • greeting_function
    • Deadline: 2020.02.23 23:59:59
    • 1 point if all of the tests are correct in both exercises
  1. homework
    • neighbors
    • 1 point if all of the 8 tests are correct
    • Deadline: 2020.03.01 23:59:59
  2. homework
    • packing
    • evaluate
    • product_x
    • magic_square
    • Deadline: 2020.03.08 23:59:59
    • 1 point each
  3. homework
    • advanced_indexing
    • matrix_sum
    • divisor_dict
    • midterm_result
    • Deadline: 2020.03.15 23:59:59
    • 1 point per exercise
  4. homework
    • moduloz_init
    • moduloz_operations
    • matrix_init
    • matrix_operations
    • Deadline: 2020.04.05 23:59:59
    • 1 point per exercise
  5. homework
    • variadic_intersect
    • quadratic_solve
    • matrix_error
    • moduloz_matrix
    • Deadline: 2020.04.13 23:59:59
    • 1 point per exercise
  6. homework
    • decode_date 1 point
    • argv_sum 1 point
    • tortoise 1 point
    • midterm_csv 2 points
    • Deadline: 2020.04.26 23:59:59
  7. homework
    • parenthesis_depth 1 point
    • descartes_product 1 point
    • matrixlog 1 point
    • tree_cut 2 points
    • Deadline: 2020.05.10 23:59:59
  8. homework
    • calculator_basic 1 point
    • calculator_parenthesis 2 points
    • calculator_function 2 points
    • Deadline: 2020.05.17 23:59:59
  9. homework
    • num_int 1 point
    • num_diff 1 point
    • Deadline: 2020.05.31 23:59:59
  10. homework
    • Make any program you want (in python 3.6)
    • Send it to hazi@math.bme.hu
    • The attachment should be a .py file and the filename should contain HW9.
    • I will grade the correctness and complexity of the program.
    • You can get maximum 5 points.
    • Deadline: 2020.05.31 23:59:59
Személyes eszközök