B_UPG Introduction to Programming

University of Finance and Administration
summer 2012
Extent and Intensity
2/2. 7 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Ondřej Čepek, Ph.D. (seminar tutor)
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: Ivana Plačková
Prerequisites
There are no prerequisites for this course.
Course Enrolment Limitations
The course is offered to students of any study field.
Course objectives
Basic programming course for first year students of Applied Informatics.
The course covers basics of algorithmization; basic constructs of programming languages; development and debugging of computer programs in an integrated environment; solutions to simple algorithmic problems.
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. Record. Random numbers, random number generator. Problem decomposition, interface, program development methods. Examples of program design and debugging.
  • 10. Text file – operations, practical use, output format.
  • 11. Data file, direct access. Sorting of files.
  • 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; compulsory seminar participation is 75% in full-time study, compulsory tutorial participation is 50% in part-time study.
Assessment methods
The course is completed with a credit and exam. Several specific studies (design and debugging of small computer programs) are required to award the credit. A practical test (write a program, procedure or function) is required to pass the exam.
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Information on completion of the course: ISP
The course can also be completed outside the examination period.
Information on the extent and intensity of the course: 14 hodin KS/semestr.
Teacher's information
http://ksvi.mff.cuni.cz/~topfer/vsfs/
The course is also listed under the following terms Winter 2007, Summer 2008, Winter 2008, Summer 2009, Winter 2009, Summer 2010, Winter 2010, Summer 2011, Winter 2011, Winter 2012, Winter 2013, Winter 2014, Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2021, Winter 2022, Winter 2023, Winter 2024.
  • Enrolment Statistics (summer 2012, recent)
  • Permalink: https://is.vsfs.cz/course/vsfs/summer2012/B_UPG