Informatics2-2019
A MathWikiből
(Változatok közti eltérés)
a (→Lectures) |
a (→Midterms) |
||
(egy szerkesztő 13 közbeeső változata nincs mutatva) | |||
13. sor: | 13. sor: | ||
# midterm: March 4<sup>th</sup>, 4pm, room E1C [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh1_19i2_eng.pdf pdf] | # midterm: March 4<sup>th</sup>, 4pm, room E1C [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh1_19i2_eng.pdf pdf] | ||
#* repetition: March 26<sup>th</sup>, 6pm-7pm, room T601/2 | #* repetition: March 26<sup>th</sup>, 6pm-7pm, room T601/2 | ||
− | # midterm: April 8<sup>th</sup>, 6pm-7pm, room E1A | + | # midterm: April 8<sup>th</sup>, 6pm-7pm, room E1A [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh2_19i2_eng.pdf pdf] |
− | # midterm: May 13<sup>th</sup>, | + | #* repetition: April 23<sup>rd</sup>, 3pm-4pm, room T601/2 |
+ | # midterm: May 13<sup>th</sup>, 6pm, room: E1C [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/zh3_19i2_eng.pdf pdf] | ||
+ | #* the covered materials: functions, references, recursion, dynamic programming, finite state automaton, binary trees, numpy | ||
+ | #* repetition: May 20<sup>th</sup>, 12pm-1pm, room: H45A | ||
=== Lab room === | === Lab room === | ||
37. sor: | 40. sor: | ||
# OOP II. [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e07_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e07_19i2_eng.ipynb ipynb] | # OOP II. [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e07_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e07_19i2_eng.ipynb ipynb] | ||
# Functions, references [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e08_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e08_19i2_eng.ipynb ipynb] | # Functions, references [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e08_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e08_19i2_eng.ipynb ipynb] | ||
− | # | + | # Recursion, dynamic programming, finite state automaton [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e10_18i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e10_18i2_eng.ipynb ipynb] |
− | # | + | # Binary trees [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e11_18i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e11_18i2_eng.ipynb ipynb] |
− | # | + | # Modules, numpy [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e12_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e12_19i2_eng.ipynb ipynb] |
− | # | + | # Functional programming [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e13_19i2_eng.html html] [http://sandbox.hlt.bme.hu/~gaebor/ea_anyag/Info2/e13_19i2_eng.ipynb ipynb] |
== Labs == | == Labs == | ||
54. sor: | 57. sor: | ||
# [[Informatics2-2019/Lab09|lab]] | # [[Informatics2-2019/Lab09|lab]] | ||
# [[Informatics2-2019/Lab10|lab]] | # [[Informatics2-2019/Lab10|lab]] | ||
+ | # [[Informatics2-2019/Lab11|lab]] | ||
== Homeworks == | == Homeworks == | ||
66. sor: | 70. sor: | ||
# [[Informatics2-2019/HW7|Homework]] | # [[Informatics2-2019/HW7|Homework]] | ||
# [[Informatics2-2019/HW8|Homework]] | # [[Informatics2-2019/HW8|Homework]] | ||
+ | # [[Informatics2-2019/HW9|Homework]] |
A lap jelenlegi, 2019. május 16., 17:11-kori változata
Tartalomjegyzék |
Informatics 2
General informations
- Lecturer and labs: Gábor Borbély borbely
- Lecture
- Thursday 9:15-10:00 H601
- Lab
- Thursday 12:15-13:45 H601
- Requirements.
Midterms
- midterm: March 4th, 4pm, room E1C pdf
- repetition: March 26th, 6pm-7pm, room T601/2
- midterm: April 8th, 6pm-7pm, room E1A pdf
- repetition: April 23rd, 3pm-4pm, room T601/2
- midterm: May 13th, 6pm, room: E1C pdf
- the covered materials: functions, references, recursion, dynamic programming, finite state automaton, binary trees, numpy
- repetition: May 20th, 12pm-1pm, room: H45A
Lab room
The room H507 has a magnetic card lock but it will be open during the labs. If you want to use it off the class, then you can request a card from Ibolya Elekné Barna. You will have to leave a 2000HUF deposit. Please return the card if it is no longer necessary. Also, you can work on your own computer or use a remote login, please ask for help if needed. The room H601 is opened only for the lectures.
Cloudcoder
On the labs and mostly on the homeworks we will use the following tool.
- https://ccweb.math.bme.hu/cloudcoder/
- If something doesn't work, don't hesitate to ask the lecturer!
Lectures
The lectures can be read in html format or you can run them as jupyter notebook.
- Getting started html ipynb
- Programming paradigms html ipynb
- Functions html ipynb
- Data types html ipynb
- Strings and formatting html ipynb
- OOP I. html ipynb
- OOP II. html ipynb
- Functions, references html ipynb
- Recursion, dynamic programming, finite state automaton html ipynb
- Binary trees html ipynb
- Modules, numpy html ipynb
- Functional programming html ipynb
Labs
Homeworks
0th Homework