714-0588/04 – Creation and implementation of algorithm's (VRA)

The main goal of the course is to acquaint with basic principles of problem solving using computers, to acquaint with basic abstract data types and to master their implementation and exploitation. The students shall gain knowledge and skills necessary for algorithm design, coding in a programming language (Delphi) and debugging.

Concepts of algorithmic problem solving, an introduction to programming methodology. Data and control structures of the programming language. Constants, variables, identifiers, expressions. Simple data types, ordinal types. Control structures. Assignment statement, I/O statements, conditional statements, loop statements. Structured data types. Arrays, strings, records, sets, files, text files. Procedure and function definition, call by value parameters, call by reference. Block structure. Local and global variables, recursion.

Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, New Jersey, 1976.

Terms of completing the course ************************************* Credit conditions (full-time): ************************************************** ********** - Participation in seminars, 20% of absence can be excused, - Submission of programs entered in the exercises prescribed treatment, - Passing written tests. For compliance student gets 5 points. For tests, students can gain 0-15 points. (A student who gets the credit, will be evaluated by 5-20 points). Examination Requirements: **************************** The condition for participation in the exam is a written credit of the subject matter. The written part of the exam will be scored 0-60 points for its successful completion will be considered earnings 25 points. The oral part of the exam will be scored 0-20 points for its successful completion will be considered earnings 5 ​​points. After counting the points earned for credit, written and oral exams, students will be rated excellent, very good, good, failed, according to a study table and Examination Regulations VSB - TUO. To register for the tests in the table, the student must successfully complete both parts of the test combined to achieve the required number of points. Scoring: ********************** Earned points Mark -------------------------------- 86-100 perfectly 66-85 very well 51-65 well 0-50 failed A set of questions ********************* Methodology for solving problems on a computer. An algorithm and its properties, methods of registration algorithms. Program Structure in Pascal. Constants and variables identifiers. Simple data objects, their types and possible surgery. Ordinal data types, type interval. Standard features for simple types of arguments. Expressions. Assignment, command input and output, composite command. Conditional statements, CASE, a jump command. Cycles - repeating the process in the program. Field and work with the field. Condensed field types, character string. Working with multidimensional array. Subroutines - principles for assembling complex programs, the use of subroutines. Declarations and procedure calls. Declaring and calling functions. The relationship between formal and actual parameters of the programs, call parameters, value and reference. The block structure of the program. Recursive subroutines forward declaration of subprograms. Records. File and its properties, text files. Modes of work with files.