Introduction to Programming Systems
|Hour/sem||Lectures||Sem. Exercises||Lab. exercises||Comp. exercises||Other|
|Guarantee:||Kreslíková Jitka, doc. RNDr., CSc., DIFS|
|Lecturer:||Kreslíková Jitka, doc. RNDr., CSc., DIFS|
Smrčka Aleš, Ing., Ph.D., DITS
|Instructor:||Horáček Petr, Ing., DIFS|
Charvát Lukáš, Ing., DITS
Martinek David, Ing., DIFS
Müller Petr, Ing., DITS
Rozman Jaroslav, Ing., Ph.D., DITS
Smrčka Aleš, Ing., Ph.D., DITS
Solár Peter, Ing., DIFS
Sopuch Zbyněk, Ing., DIFS
Šebeň Patrik, Ing., DIFS
Zůna Pavel, Ing., DITS
|Faculty:||Faculty of Information Technology BUT|
|Department:||Department of Information Systems FIT BUT|
| || ||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.|
| || ||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)|
|Knowledge and skills required for the course:|
| || ||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.|
|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.|
|Syllabus of lectures:|
- Properties of algorithms, notations for describing algorithms.
- Problem solving techniques. Design and implementation of algorithms.
- Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers repesentation, labels.
- The concept of data. Simple data types. Expressions and statements.
- Control structures. Blocks, scope, and activation.
- Functions, parameters of functions.
- Text files, standard input and output.
- Structured data types.
- Pointer types and dynamic variables. Linked structures.
- Program verification, debugging, documentation.
|Syllabus of laboratory exercises:|
| ||1st week: Operating instructions, log in intranet, registration at laboratory, email instruction, news groups IZP, Unix for beginner, Dev C++ environment.|
2nd - 3th weeks: Open laboratory for the stand-alone home works solving.
4th - 12th weeks: Computer practises, the projects and programs debugging consultation. Defences of 3 projects.
|Syllabus of computer exercises:|
| ||Demonstration lessons:
- Development of C programs in MS Windows and Linux. Getting started. Editing of programs. Program structure. Help. Tools for debugging.
- Simple programs in C, processing of command line parameters. Standard I/O.
- Iterative calculations, analyse, design of the 2nd project. Illustration of documentation.
- Working with arrays, matrices and files.
- Standard libraries. Simple programs in C language.
- Creation of modules, processing dynamically allocated data structures.
|Syllabus - others, projects and individual work of students:|
- Histogram making.
- Recurrence problem solving.
- Solution eight directions.
- 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
- 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
| || |
- 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.
| || ||Evaluated home assignments with the defence: 25 points. Computer practises: 8 points. Mid-term written examination: 12 points. Final written examination: 55 points.|
| || ||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.