SylabUZ
Nazwa przedmiotu | Programowanie komputerów 1 |
Kod przedmiotu | 11.3-WK-IiEP-PK1-W-S14_pNadGenAOBCW |
Wydział | Wydział Matematyki, Informatyki i Ekonometrii |
Kierunek | Computer science and econometrics |
Profil | ogólnoakademicki |
Rodzaj studiów | pierwszego stopnia z tyt. licencjata |
Semestr rozpoczęcia | semestr zimowy 2019/2020 |
Semestr | 1 |
Liczba punktów ECTS do zdobycia | 6 |
Typ przedmiotu | obowiązkowy |
Język nauczania | polski |
Sylabus opracował |
|
Forma zajęć | Liczba godzin w semestrze (stacjonarne) | Liczba godzin w tygodniu (stacjonarne) | Liczba godzin w semestrze (niestacjonarne) | Liczba godzin w tygodniu (niestacjonarne) | Forma zaliczenia |
Wykład | 30 | 2 | - | - | Egzamin |
Laboratorium | 30 | 2 | - | - | Zaliczenie na ocenę |
Gaining the ability to write simple programs using basic data structures. Acquiring knowledge and skills by the student in the basics of algorithm analysis.
Advanced skills in computer operating. The competences in maths at secondary school level.
Lecture:
Hardware and software. Algorithm, programming language, program, compiler, flowcharts. Computer arithmetic. Programming methodologies.
Basics of programming in Java. Program structure. Primitive data types. Variable declarations. Assignment Instruction. Conditional and iterative instructions. Arrays, operations on arrays. The concept of object and class. Math and String class. Static methods. Enumerated type.
Properties of algorithms. Computational complexity of algorithms. Semantic correctness of the algorithm. Asymptotics. Methodology for solving algorithmic problems
Laboratory:
1. Flowcharts.
2. Basic elements of Java language. Primitive data types, arithmetic and logical expressions, variable declarations.
3. Writing and running simple programs with assignment and conditional instructions.
4. Writing and running programs containing iterative instructions.
5. Array processing.
6. String processing.
7. Static methods: creation and invocation.
8. Launching a self-prepared application that uses all the skills acquired in class.
Lecture: problem lecture.
Laboratory: laboratory exercises in computer lab – writing and running programs on assigned leading themes, analysis of these programs and analysis of algorithms applied.
Opis efektu | Symbole efektów | Metody weryfikacji | Forma zajęć |
Lecture. Examination of learning outcomes in terms of knowledge and skills. The exam consists of two parts, written and oral. The condition of joining the oral part is obtaining 30% of points from the written part. Obtaining 50% of the points from the written part guarantees a positive assessment.
Laboratory. The final grade is issued on the basis of points obtained in class. Points are obtained for tests written during classes and activity during classes.
Final course grade. The final grade consists of the laboratory grade (50%) and exam grade (50%). The condition of taking the exam is a positive grade from the laboratory. The condition of passing the subject is a positive grade from the exam.
1. J. Cutajar, Beginning Java Data Structures and Algorithms, Packt Pub, 2018.
2. T. Gaddis, Starting Out with Java: From Control Structures through Objects (7th Edition)., Pearson, 2019
1. T.H. Cormen, Ch.E. Leiserson, R.L. Rivest: Wprowadzenie do algorytmów, WNT, 1997.
2. P. Wróblewski: Algorytmy, struktury danych i techniki programowania, wyd. II popr., Helion, 2001.
Zmodyfikowane przez dr Alina Szelecka (ostatnia modyfikacja: 21-11-2020 06:10)