VSFS:B_UPg Introduction to Programming - Course Information

B_UPg Introduction to Programming

Extent and Intensity

2/2. 7 credit(s). Type of Completion: zk (examination).

Teacher(s)

doc. RNDr. Pavel Töpfer, CSc. (seminar tutor)

Guaranteed by

doc. RNDr. Pavel Töpfer, CSc.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Dagmar Medová, DiS.

Timetable of Seminar Groups

B_UPg/cAPH: Mon 10:30–11:14 E303PC, Mon 11:15–12:00 E303PC, P. Töpfer
B_UPg/pAPH: Mon 8:45–9:29 E305, Mon 9:30–10:15 E305, P. Töpfer

Prerequisites

There are no prerequisites for this course.

Course Enrolment Limitations

The course is offered to students of any study field.

Course objectives

This is a basic programming course for first year students of Applied Informatics.
At the end of the course students should be able to:
solve simple algorithmic problems;
use basic constructs of programming languages;
develop and debug computer programs in an integrated devolopmental environment;

Syllabus

• 1. Program development, programming tools, programming language, debugging. Algorithm, correctness proof, algorithm quality comparison, time efficiency and memory efficiency.
• 2. Programming language Pascal. Program structure. Variable, identifier, data types. Constant definition. Summary of Pascal instructions. Integrated development environment – basic functions.
• 3. Assignment. Number expression, evaluation. Conditional statement, composed statement, loop statement. Simple and composed conditions. Integrated development environment – program debugging.
• 4. Initialized variable. Standard procedures read and write, output format. Arithmetic overflow, rounding errors. Logical variables and expressions.
• 5. Procedures and functions – practical use, local variables, identifier visibility. Parameter passing by value and by reference.
• 6. Array. Array sorting and searching – select sort, insert sort, bubble sort.
• 7. Stack and queue. Long numbers - implementation using array. Multidimensional array. Practical use of arrays.
• 8. Characters and strings. Horner schema. Positional number systems, conversions.
• 9. Text file – operations, practical use, output format.
• 10. Record. Data file, direct access. Sorting of files.
• 11. Random numbers. Problem decomposition, interface. Program development methods, examples of program design and debugging.
• 12. Heap, operations with heap, heap implementation, heapsort.

Literature

recommended literature
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 2007 (2. vyd.)
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2005 (více vydání)
• P.Töpfer: Základy programování v úlohách, Scientia Praha 1997

Teaching methods

Lectures and seminars in full-time study, tutorials in part-time study. Minimal required participation is 75% on seminars in full-time study and 50% on tutorials in part-time study. Students with lower than required participation have to fulfill additional study duties.

Assessment methods

The course is completed with a credit and written exam. Several homeworks, which consist in design and debugging of small computer programs, are required to award the credit. In the written exam students should write a program, procedure or function to solve a given task. The method correctness and efficiency and the choice of appropriate programming language tools used in the solution are judged.

Language of instruction

Czech

Follow-Up Courses

• B_Prg Programming

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.
General note: Bb1.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

http://ksvi.mff.cuni.cz/~topfer/vsfs/

• Enrolment Statistics (Winter 2012, recent)
  
• Permalink: https://is.vsfs.cz/course/vsfs/winter2012/B_UPg