Computer Programming 1 - course description

General information

Course name	Computer Programming 1
Course ID	11.3-WK-MATP-PK1-L-S14_pNadGen1CNU5
Faculty	Faculty of Mathematics, Computer Science and Econometrics
Field of study	Mathematics
Education profile	academic
Level of studies	First-cycle studies leading to Bachelor's degree
Beginning semester	winter term 2019/2020

Course information

Semester	1
ECTS credits to win	6
Course type	obligatory
Teaching language	polish
Author of syllabus	dr Florian Fabiś

Classes forms

The class form	Hours per semester (full-time)	Hours per week (full-time)	Hours per semester (part-time)	Hours per week (part-time)	Form of assignment
Laboratory	30	2	-	-	Credit with grade
Lecture	30	2	-	-	Exam

Aim of the course

The ability of elementary programming in Pascal with application of basic data structures, with regard to principles of structured programming. Knowledge and skills in basics of analysis of algorithms. The knowledge of basic methods of effective algorithms’ constructing.

Prerequisites

Advanced skills in computer operating. The competences in maths at secondary school level.

Scope

Lecture
1. Computer system. Hardware and software. Algorithm, program, compiler, block diagram. (2 h)
2. Structured programming in Pascal. Programming paradigms. Program structure and syntax. Data simple types: integer, real, boolean, character, string. Variables declarations. Assignment statements. Input and output standard procedures. Procedures and functions: declaring procedures and functions, local declarations, value and variable parameters, constant parametrs, untyped parameters, string parameters, array parameters, open parameters, recursion, standard procedures and functions. Conditional and repetitive statements. Arrays. Strings (18 h)
3. Algorithmics. Computational complexity. Correctness of algorithms. Asymptotics. (5 h)
4. Techniques of constructing effective algorithms. Divide and conquer , greedy methods, dynamic programming. The basic algorithms of sorting. (5 h)
Laboratory
1. Block diagrams. (2 h)
2. Data simple types. Variables declarations. Assignment statements. Input and output standard procedures. (2 h)
3. Design, code, and debug simple programs with assignment statements, conditional statements and input-output standard procedures. (2 h)
4. Design, code, and debug programs with application of procedures and functions. (2 h)

5. Design, code, and debug programs with application of repetitive statements. (6 h)
6. Processing of arrays. (10 h)
7. Processing of strings. (4 h)
8. Run self written application, including all Pascal elements learned during the classes with documentation according to assigned specification. (2 h)

Teaching methods

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. Students will work on some programs in groups consisting of 2-3 persons.
Besides, each student is required to present on last classes a self written application, including all Pascal elements learned during the classes, with documentation according to assigned specification.

Learning outcomes and methods of theirs verification

Outcome description	Outcome symbols	Methods of verification	The class form

Assignment conditions

Lecture. Written examination verifying the education outcome in area of knowledge and skills.
Laboratory. Final grade is granted based on number of points received during studies. Points are received for written tests, active participation in classes and on last classes presented application.
Final course grade consists of laboratory classes’ grade (60%) and examination grade (40%). Positive grade from laboratory classes is the necessary condition for participation in examination. The positive grade from examination is the necessary condition for course completion.

Notes

Modified by dr Robert Dylewski, prof. UZ (last modification: 19-09-2019 13:27)

Generate PDF for this page