|
Lecturer(s)
|
-
Nejedlová Dana, Ing. Ph.D.
-
Nisler Stanislav, Mgr.
|
|
Course content
|
Lectures (topics): 1. Basic data types and problems of their computer representation. 2. Programming languages and compilers. Paradigm of programming languages. 3. Efficiency of the algorithm. Asymptotic analysis of the algorithm. Algorithms of polynomials and others.* 4. Characteristics of programming language C. Origin of program written in language C. Program structure in language C.* 5. Simple data types, variables, constants, operators, type conversion. Terminal input and output.* 6. Control structures: conditions, cycles, jumps. Working with files, standard input and output.* 7. Memory Function and Allocation, Function Parameters. Validity area of identifiers. 8. Pointers and Functions. Pointers and memory. Static and dynamic one-dimensional fields. 9. Chains. Multidimensional arrays. 10. Structures, union and enumeration types. Bit operations. 11. Visual Basic C. Files and operating system libraries. 12. Preprocessor of the language C. Conditional translation of the program. Separate translation of the program. 13. Pointers and multidimensional arrays. Recursive functions. Dynamic data structures. 14. Sorting. Search. List comparison. Seminars (themes): 1. Getting acquainted with the development environment. 2. Data types, constants, operator sizeof (), zero division, overflow, Boolean value print. 3. Printf () function and format string control. 4. Priority and Associativity of Operators, Postfix and Decree and Increment Prefix. 5. Schedule with while a for. 6. Program with if, else, switch. A shortened Boolean expression. 7. Program with user menu, scanf () function, gectchar (), buffer cleanup. Formatting the source code. 8. Text files, getc () and putc () functions, the feof () function along with the fscanf () function. 9. Redirection and executable batch file. 10. Functions with parameters passed by the value. Numeric input function with authentication. 11. Pointers. Functions with parameters passed by a link. 12. Functions and procedures. Pointer to function. 13. Main () parameters. Working with strings. 14. Defense of the projects.
|
|
Learning activities and teaching methods
|
|
Monological explanation (lecture, presentation,briefing), Working activities (workshops)
|
|
Learning outcomes
|
The course acquaints students with the problems of creating software applications.The programming language C is used as a learning environment. C is a low-level, compiled, relatively minimalist programming language. It is powerful enough for most system programming (drivers and OS kernel), the rest can be solved by so-called inline assembler, the method of writing the assembler directly into the code. The source code C is much more readable than the assembler, it is easier to write, and moreover it is easier to transfer to other processors and computer architectures.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral exam, Written exam, Practical demonstration of acquired skills, Systematické pozorování studenta, Written assignment
Credit requirements: A test from the theory discussed at the lectures. Exam: Students will demonstrate knowledge of the programming basics and defend their own program created in C language.
|
|
Recommended literature
|
-
BROOKSHEAR, J. G., D. T. SMITH a D. BRYLOW. Informatika. Brno: Computer Press, 2013. ISBN 978-80-251-3805-2.
-
DICKINS, R. Počítače a programování: podívej se pod okénko. Praha: Svojtka, 2016. ISBN 978-80-256-1793-9.
-
KOCHAN, S. G. Programming in C. 4. vyd.. Pearson Education, 2015. ISBN 0-321-77641-0.
-
PERRY, G. a D. MILLER. C Programming Absolute Beginner's Guide. 3. vyd.. Pearson Education, 2014. ISBN 0-789-75198-4.
-
SCOTT, M. L. Programming Language Pragmatics. 4. vyd.. Waltham: Morgan Kaufmann, 2015. ISBN 978-01-241-0409-9.
-
WARREN, H. S. Hacker's Delight. 2. vyd.. London: Pearson Education, 2013. ISBN 0-321-84268-5.
-
WENGROW, J. A Common-Sense Guide to Data Structures and Algorithms, 2nd. ed.. USA: The Pragmatic Programmers, LLC., 2020. ISBN 978-1-68050-722-5.
|