Faculty of Information Technology, BUT

Course details

Introduction to Programming Systems

IZP Acad. year 2012/2013 Winter semester 7 credits

Algorithms and problem solving: strategy of problem solving, structured decomposition, concept, and features of algorithm. Basic programming construction: syntax and semantics of high programming language, variables, types, expressions, control structures, procedures and functions, parameter passing, input/output, exceptional state processing. Basic data structures: simple data types, structured data types: array, record, file, strings. Dynamic data structures, concept of pointers. Strategy for selecting appropriate data structure. Recursion, concept of recursion. Global and local variables. Simple recursive functions (procedures). Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language. (ISO/IEC 9899:1999 Programming languages - C)

Guarantor

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

39 hrs lectures, 12 hrs exercises, 8 hrs pc labs, 6 hrs projects

Assessment points

55 exam, 12 half-term test, 8 exercises, 25 projects

Department

Lecturer

Instructor

Horáček Petr, Ing. (DIFS FIT BUT)
Charvát Lukáš, Ing. (DITS FIT BUT)
Martinek David, Ing. (DIFS FIT BUT)
Müller Petr, Ing. (DITS FIT BUT)
Rozman Jaroslav, Ing., Ph.D. (DITS FIT BUT)
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT)
Solár Peter, Ing. (DIFS FIT BUT)
Sopuch Zbyněk, Ing. (DIFS FIT BUT)
Šebeň Patrik, Ing. (DIFS FIT BUT)
Zůna Pavel, Ing. (DITS FIT BUT)

Subject specific learning outcomes and competences

Student acquaints with the methods of analysing and designing simple computer algorithms. The fundamental concepts of programming languages will be introduced to the student. Student will learn how to write programs in high programming languages and how to understand and use the EBNF to describe programming language syntax. Student will also acquire basic English terminology of programming, syntax, and semantics of programming language.

Generic learning outcomes and competences

Student will learn the computer-aided solving of simple problems by elaborating projects. Student will learn to create the program documentation and defend the results of project solving.

Learning objectives

To grasp an analysis of problems and to determine basic algorithms for their solving. To acquaint oneself with principles and features of high programming language and to possess them for implementing of algorithms. To learn how to use tools for program debugging. To get basic knowledge of data representation in memory. To make the acquaintance of evaluate algorithm complexity. To make the acquaintance of testing principles of programs. To possess active basic algorithms. To learn how to document, present, and defend the reached results.

Prerequisite kwnowledge and skills

This course is placed in the winter term of the first year of the bachelors study programme. Thus, we expect that students have the high school level knowledge of using computers.

Study literature

  • McConnell, S.: Code Complete, Microsoft Press, 2004, ISBN 0735619670
  • Kernighan, B. W.: The Practice of Programming, ADDISON-WESLEY, 2003, ISBN 020161586X
  • Teaching materials available on WWW

Fundamental literature

  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937.
  • The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X
  • Schildt, H.: Teach Yourself C, McGraw-Hill Companies, 2001

Syllabus of lectures

  1. Properties of algorithms, notations for describing algorithms.
  2. Problem solving techniques. Design and implementation of algorithms.
  3. Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers repesentation, labels.
  4. The concept of data. Simple data types. Expressions and statements.
  5. Control structures. Blocks, scope, and activation.
  6. Functions, parameters of functions.
  7. Text files, standard input and output.
  8. Structured data types.
  9. Recursion.
  10. Pointer types and dynamic variables. Linked structures.
  11. Sorting.
  12. Searching.
  13. Program verification, debugging, documentation.

Syllabus - others, projects and individual work of students

  1. Histogram making.
  2. Recurrence problem solving.
  3. Solution eight directions.

Progress assessment

Evaluated home assignments with the defence: 25 points. Computer practises: 8 points. Mid-term written examination: 12 points. Final written examination: 55 points.

Controlled instruction

  • Realisation and delivery of 3 home assignments.
  • Demonstration of home assignments during lab experiments.
  • 5 computer practises.
  • Delivered and controlled documentation of one project.
  • Mid-term written test.
  • Final written examination.

Exam prerequisites

Student has to get at least 20 of the points from the projects, practise and mid-term test for receiving the credit and then for entering the final exam.
Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

Course inclusion in study plans

  • Programme IT-BC-3, field BIT, 1st year of study, Compulsory
Back to top