Title:

Algorithms

Code:IAL
Ac.Year:2012/2013
Term:Winter
Study plans:
ProgramBranchYearDuty
IT-BC-3BIT2ndCompulsory
Language:Czech
Credits:5
Completion:accreditation+exam (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:3900013
 ExaminationTestsExercisesLaboratoriesOther
Points:51140035
Guarantee:Honzík Jan M., prof. Ing., CSc., DIFS
Lecturer:Honzík Jan M., prof. Ing., CSc., DIFS
Instructor:Ďurfina Lukáš, Ing., DIFS
Křena Bohuslav, Ing., Ph.D., DITS
Křivka Zbyněk, Ing., Ph.D., DIFS
Křoustek Jakub, Ing., DIFS
Masařík Karel, Ing., Ph.D., DIFS
Vrábel Lukáš, Ing., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Introduction to Programming Systems (IZP), DIFS
Follow-ups:
Java Programming Language (IJA), DITS
Pascal and Modula Languages (IPM), DIFS
Principles of Programming Languages (IPP), DIFS
Smalltalk and Rapid Prototyping (IST), DITS
The C++ Programming Language (ICP), DITS
VHDL Seminar (IVH), DCSY
Substitute for:
Algorithms and Data Structures (ADS), DIFS
 
Learning objectives:
To acquaint with the principles of methods of proving of correctness of programs and with basic concepts of construction of proved programms. To learn the fundamentals of algorithm coplexity. To learn the principles of dynamic memory allocation. To acquaint with basic abstract data types and to command its implementation and exploitation.  To learn and command recursive and non recursive notation of basic algorithms. To overrule the implementation and analysis of most used algorithms for searching and sorting.
Description:
Overview of fundamental data structures and their exploitation. Principles of dynamic memory allocation. Specification of abstract data types (ADT). Specification and implementation of ADT's: lists, stack and its exploitation, queue, set, array, searching table, graph, binary tree. Algorithms upon the binary trees. Searching: sequential, in the ordered and in not ordered array, searching with the guard (sentinel), binary search, search tree, balanced trees (AVL). Searching in hash-tables. Ordering (sorting), principles, sorting without the moving of items, sorting with multiple keys. Most common methods of sorting:Select-sort, Bubble-sort, Heap-sort, Insert-sort a jeho varianty, Shell-sort, recursive and non-recursive notation of the Quick sort, Merge-sort,List-merge-sort, Radix-sort. Recursion and backtrack algorithms. Searching the patterns in the text. Proving of correctness of programs, construction of proved programs.
Knowledge and skills required for the course:
  • Basic knowledge of the programming in procedural programming language
  • Knowledge of secondary school level matematics
Subject specific learning outcomes and competences:
  • Student will acquaint with the methods of proving of correctness of programs and with construction of proved programms and learn their significance. 
  • Student will learn the fundamentals of algorithm coplexity and their intention and will be able to use them for evaluation of designed programmes. 
  • He/she acquaints with basic abstract data types and to commands its implementation and exploitation. 
  • Student will learn the principles of dynamic memory allocation. 
  • He/she learns and commands to use recursive and non recursive notation of basic algorithms. 
  • Student overrules the implementation and analysis of most used algorithms for searching and sorting.
Generic learning outcomes and competences:
  • Student learns terminology in Czech ane English language
  • Student learns to participate on the small project as a member of small team
  • Student learns to present and defend the results of the small project
Syllabus of lectures:
  1. Overview of data structures. Abstract data type and its specification.
  2. Specification, implementation and exploitation of ADT list.
  3. Specification, implementation and exploitation of ADT stack, queue. Numeration of expressions with the use of stack.
  4. ADT array, set, graph, binary tree.
  5. Algorithms upon the binary tree.
  6. Searching, sequential, in the array, binary search.
  7. Binary search trees, AVL tree.
  8. Hashing-tables.
  9. Ordering (sorting), principles, without movement, multiple key.
  10. Most common methods of sorting of arrays, sorting of files.
  11. Recursion, backtracking algorithms.
  12. Proving the programs, costruction of proved programmes.
Syllabus - others, projects and individual work of students:
  1. Two home assignments
  2. Project with a mini-defence for a team of students.
Fundamental literature:
  1. Knuth, D.: The Art of Computer programming, Vol.1,2,3. Addison Wesley, 1968
  2. Wirth, N.: Alorithms+Data Structures=Programs, Prentice Hall, 1976
  3. Horovitz, Sahni: Fundamentals of Data Structures.
  4. Amsbury, W: Data Structures: From Arrays to Priority Cormen, T. H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
  5. Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
  6. Kruse, R.L.: Data Structures and Program Design. Prentice- Hall,Inc. 1984
  7. Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
Study literature:
  1. Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř.VUT Brno,1991.
Progress assessment:
  • Evaluated home assignments - 20 points
  • Mid-term written examination - 14 point
  • Evaluated project with the defense - 15 points
  • Final written examination - 51 points; The minimal number of points which can be obtained from the final written examination is 20. Otherwise, no points will be assigned to a student.
Exam prerequisites:
  • to earn min. 20 points within the semester

  • Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.