Lecturer(s)


Nejedlová Dana, Ing. Ph.D.

Course content

Lecture 1. Computer representation of integer numbers. 2. Computer representation of real (floatingpoint) numbers and characters. 3. The concept of an algorithm. Ways to design effective algorithms. 4. Algorithm representation. 5. Efficiency of algorithms demonstrated on searching in a list. 6. Asymptotic analysis of algorithms demonstrated on sorting. 7. Polynomial and nonpolynomial algorithms. Complexity of typical problems. 8. Polynomial, NP, NPcomplete and NPhard problems. 9. Implementation as a connection between HW and SW. 10. Programming languages. 11. Data structures. 12. Dynamic data structures. Files. 13. Recursive algorithms efficiency. 14. The most important information from students' papers selected for theoretical test in Computers II. Tutorials 1. MS Excel: formatting, series, lock, comments, hypertext links, formulas, graphs. 2. MS Excel: absolute and relative addressing in formulas, functions IF and VLOOKUP. 3. MS Excel: working with large lists, their sorting and filtering. 4. MS Excel: pivot (contingency) tables. 5. MS Excel: Goal Seek and Solver addin applied to production planning and transport problem. 6. MS Excel: preparation for test. 7. MS Excel: test. 8. MS Word: styles, creation of large documents, sections. 9. MS Word: multilevel numbering of chapters, insertion of graphs, tables, equations, cross reference, table of contents. 10. MS Excel: solutions of various types of problems using Solver addin. 11. MS Excel: data validation and conditional formatting. 12. MS Excel: matrix formulas, naming ranges. 13. MS Excel: dynamic contingency table and histogram using matrix formulas and Analysis ToolPak addin. 14. MS Excel: function INDIRECT combined with matrix formulas.

Learning activities and teaching methods

Monological explanation (lecture, presentation,briefing), Working activities (workshops)
 Class attendance
 56 hours per semester

Learning outcomes

The aim of the course is to improve analytical thinking and independent decisionmaking based on the information acquired and their ability to solve problems with computer support. Students are taught to create their own computer applications in any programming language. Algorithms, their structure, development and effectiveness are emphasized. Part of the course is run on Microsoft Office.
Students obtain knowledge in given course in accordance with requirements and course programme.

Prerequisites

Basic computer literacy Basic experience with word processor and spreadsheet

Assessment methods and criteria

Oral exam, Written exam, Essay, Systematické pozorování studenta, Oral presentation of selfstudy, Written assignment
Active participation in tutorials. 5 minute long or 2 page paper on computersrelated topic. Test in spreadsheet MS Excel.

Recommended literature


BROOKSHEAR, G., BRYLOW, D. Computer Science: An Overview (12th Edition). Pearson, 2014. ISBN 9780133760064.

GÁLA, L., POUR, J., TOMAN, P. Podniková informatika. Grada, 2006. ISBN 8024712784.

MAŘÍK, V., ŠTEPÁNKOVÁ, O., LAŽANSKÝ , J., kol. Umělá inteligence 3. díl. Academia Praha, 2003. ISBN 8020004726.

STAIR, R., REYNOLDS, G. Principles of Information Systems (12th Edition). Course Technology, 2015. ISBN 9781285867168.
