The course aims to familiarize student the history of computer technology, computers and science. The emphasis is on self-study of relevant information sources and a final seminar paper on the subject by self-managed work.

DLUHOŠ, J. – VALA, M. Vybrané kapitoly z dejin techniky. Ostrava : PdF OU, 1996. 61 s. ISBN 80-7042-112-6.

HOUDEK, F. Objevy a vynálezy tisíciletí. Praha : NLN, 2002. 456 s. ISBN 80-7106-475-0.

PATURI, F. Kronika techniky. Bratislava : Fortuna Print, 1993. 654 s. ISBN 80-7153-065-4.

REID, S. Vynálezy a objevy. Ostrava : Blesk, 1994. 128 s. ISBN 80-85606-52-6.

ZEITHAMMER, K. Vývoj technik. 2. vyd. Praha : ČVUT, 1998. 274 s. ISBN 80-01-01725-7.

ZELENÝ, J. – MANNOVÁ, B. Historie výpočetní techniky. Praha : Scientia, 2006. 184 s. ISBN 80-86960-04-8.

ZWETLER, O. – NEČAS, C. Dejiny věd a techniky I. Brno : MU, 1992. 97 s. ISBN 80-210-0401-0.

None.

continuous student’s work 50%

• Introduction to the study subject (literature study and the requirements for credit).

• The importance of understanding the history of computer science and computer technology.

• General patterns of development of science and technology in a historical cross-section.

• Mathematical theory, which had a decisive influence on the development of computer science, computing and digital technologies.

• The history of the underlying computer science departments - physics.

• The history of the underlying computer science departments - electrical engineering, electronics, cybernetics.

• The history of computer technology, computer evolution (characteristic of generations)

• The history of information and communication technologies.

• The history record information, media and multimedia.

• The history of information science.

• Profiles of prominent personalities of Computer Science in the world.

• Profiles of prominent personalities of Computer Science at the national level.

Method of evaluation and completion of the course: graded credit

Continuous assessment (for example: test, individual work ...): continuous student’s work 50%

Final assessment (for example: examination, final paper ...): final work (project) 50%

final work (project) 50%

• Introduction to the Discrete Mathematics, principle of Mathematical induction,

• Set Theory – basic terms, set operations,

• Relations and mappings, composition of mappings, equivalence relation,

• Cardinality of sets, finite and nonfinite sets, computable sets,

• Combinatorics – combinations and variations (with and without repetition),

• Permutations (with and without repetition), combinatorial identities,

• Binomial and Polynomial theorem,

• Propositions and logical operations, tautologies,

• Boolean algebra – binary Boolean functions, realization of Boolean functions by formulas,

• Equivalence of Boolean formulas, properties of elementary Boolean functions, principle of duality,

• Canonic form of Boolean functions, full disjunctive normal form,

• Functional completeness and closure, most important closed classes, Completeness theorem,

• Minimization of Boolean functions.

The course provides an introduction into microeconomics. The most important issues of microeconomics such as behaviour of individual households and allocation of limited resources will be discussed. It also examines how the decisions are made at micro-level. One of the aims is to improve the students’ problem solving skills. The theoretical background will enable the students to understand the problems and be better in problem solving.

Varian, H. R.: Mikorekonómia középfokon, 2001, Praha

Szabó I.: Mikroekonómia, 2006, UJS Komárno

Mikroökonómia (Szerk.: Kopányi Mihály), Műszaki Könyvkiadó – AULA Budapest, 1996, 2.

Berde Éva-Petró Katalin: Mikroökonómiai példatár. Műszaki Könyvkiadó 1995.

Lisý, J. a kol. 2005. Ekonómia v novej ekonomike. Bratislava, Iura Edition, 2005. 622 s. ISBN 80-8078-063-3

Basic concepts, general equilibrium

Theory of consumption

Utility curve

Production process analysis

Cost analysis

Equilibrium in perfect and imperfect competition

Oligopoly market structure

The course provides a common sense approach to the macroeconomics. It helps to understand the behavior of the entire economy and is aimed at using macroeconomic analysis in problem solving at a national scale.

G. Mankiw (1999): Makroekonómia, Osiris Kiadó

P.R. Krugman – M. Obstfeld (2000): International Economics, Addison Wesley Longman

Simon András (1999): Útmutató a makroökonómiához, Osiris Kiadó

Pete Péter (1998): Monetáris makroökonómia, Osiris Kiadó

Husár, J.: Makroekonómia. Bratislava, Karprint 1998

Felderer – Homburg: Makroekonomika a nová makroekonomika, Bratislava – ELITA 1996

GDP, revenue, consumption, savings, investment

production curve, labor demand and supply, inter-temporal optimization, income distribution

revenues and consumption, investments, interest rate changes

long term growth. Solow model, models after Solow

factors of production, Heckscher-Ohlin model

price mechanism, aggregate demand – aggregate supply, labour market,effective wage, hysteresis. Phillips-curve, Friedman-Lucas supply curve

the notion of money and its role, price level and inflation, demand and supply for money, money market equilibrium, alternative models of money demand and supply

Keynesian cross diagram, origins, restrictions, IS-LM model

theory of economic cycles, Real Business Cycle

open economy:balance of payments, arbitrage

open economy: currency system, Mundell-Fleming model, monetary policy, national debt,

tariffs, quotas, import restrictions

To achieve strategic objectives and specific results the organization should carry out activities in a specified time and budget line, along with a unique and complex tasks which are different from the daily operational activities (such as production or services). Organizations therefore need to implement projects in order to change. It follows that the projects are the building blocks of organizational strategy. This course provides students with an overall view of the tasks of management.

1/ Görög Mihály:Bevezetés a projektmenedzsmentbe,Aula Kiadó, Budapešť, 1999, 3. kiadás

2/ Dupaľ, Majtán: Manažmentprojektov – EKONÓM, Bratislava 2004

test

• The project time-, resource- and cost-planning.

• Risk Analysis

• Framework of project management

• Project Control

• The elements of project strategy and project strategic choice method

• Recommendation of the bid evaluation, contract

• Project success and project marketing

• Project Documentation

• European funds and business support

exam

The curse aims to introduce students the market related measures of a company. The subject analyses the basic terms of marketing: market, customer and shopping behavior, intra organizational behavior. Furthermore the subject examines different specific marketing tools in business marketing. The bases of building-up a marketing system are detailed analyzed, such as: marketing research, organizational questions and strategy.

1/Bauer András – Berács József: Marketing, 620 strán, AULA 1998, 2. vydanie

2/ Kita Jaroslav: Marketing – prípadové štúdie – EKONÓM, Bratislava 1999

3/ Čimo Jozef: Marketingové aplikácie. 1.vyd. – EKONÓM, Bratislava 2004

4/ Richterová Kornélia: Marketingový výskum. 1.vyd. – EKONÓM, Bratislava 2005

5/ Kita Jaroslav a kol.: Marketing. 3.vyd. – IURA EDITION, Bratislava 2005

test

Theory of marketing, marketing orientation by companies;

Market and competition, market segments, strategy; Customer behavior as a meta-theory; Intra-organizational customer behavior, relationship marketing.

Retail brands and products. Fight for the money of customers. The product policy, product development, portfolio analysis.

Price policy, pricing methods; Product life-cycle, Sales system, logistics and other functions. Participants of sales system, trends in retailing, personal selling.

Advertising and communication, forms of advertising. Efficiency of advertizing and the related research. MIS – Marketing Information System and market knowledge. Institutionalization of marketing information, view in marketing organization. Marketing strategy in international environment.

written and oral exam

• Introduction to the Operating systems, basic terms,

• History and classification of operating systems,

• Architecture of operating systems,

• Graphical User Interface and Application Programming Interface of operating systems,

• File management,

• Authorization and access control,

• Disk management,

• Resource management,

• Processor and process management,

• Memory management,

• Virtual memory management.

The topic of course is to acquire an algorithmic thinking of students, manage formal coding of algorithm, learn to use basic tools and elements of programming language, to be able to transform solution to the programming language.

BENKŐ, T. – BENKŐ, L. – TÓTH, B. – VARGA, B. Programozzunk Turbo Pascal nyelven! Objektum orientált programozás. Budapest : Computer Books, 2008. 552 s. ISBN 9789636183233.

BENTLEY, J. Programming Pearls. 2. vyd. Boston : Addison-Wesley Professional, 2000. 239 s. ISBN 0-201-65788-0.

MOLNÁR, Cs. – SÁGI G. Programozás Turbo Pascal nyelven. (Programovanie v jazyku Turbo Pascal). Budapest : BBS-E Betéti Társaság, 2001. 232 s. ISBN 963 03 7152 9.

PONGOR, Gy. Szabványos Pascal programozás és algoritmusok. (Štandardné programovanie v Pascale a algoritmy). Műszaki könyvkiadó : Budapest, 2002. 424 s. ISBN 9631625737.

STOFFA, V. Algoritmizáció és programozás. (Algoritmizácia a programovanie). 1. vyd. Komárno : Univerzita J. Selyeho v Komárne, 2005. 174 s. ISBN 80-969251-7-2.

VITEK, A. a kol. Problems in Programming. Experience through Practice. New York : John Wiley & Sons Inc., 1991. 330 s. ISBN 978-0471930174.

None.

tests 50%

• Algorithms - Basic properties of algorithms, creation and the;

• Purpose and graphic expression of algorithm;

• Basic algorithmic structures and their use;

• Programming - Structure of the programming language. The syntax and semantics;

• The data types and their implementation, standard programming language data types;

• Basic standard data structures and program commands;

• Standard functions and procedures;

• Programming, problem solving (basic sorting algorithms).

• Procedures and functions: hierarchy structure of the program. Defining your own functions, global and local variables;

• Procedures without parameters, and with parameters;

• Expansion of the data type of the other standard data types and static data structures and their importance in solving problems (set, record, file)

• File a useful tool to transfer data between programs. File structure, declaration, file type, file entry, file access, file operations;

• Standard procedures for processing files. Methods for working with files.

• Complete solution of various problems.

Method of evaluation and completion of the course: credit, exam

Continuous assessment (for example: test, individual work ...): continuous tests 50%

Final assessment (for example: examination, final paper ...): written and speech exam 50%

written and speech exam 50%

The aim is to strengthen and develop the necessary skills and abilities of students to create algorithms and programs. Another goal is to teach them how to analyze problems and solve complex tasks in the form of the program.

BENKŐ, T. - BENKŐ, L. - TÓTH, B. - VARGA, B. Programozzunk Turbo Pascal nyelven! Objektum orientált programozás. Budapest : Computer Books, 2008. 552 s. ISBN 9789636183233.

BENTLEY, J. Programming Pearls. 2. vyd. Boston : Addison-Wesley Professional, 2000. 239 s. ISBN 0-201-65788-0.

MIKULA, P.: Pascal 7.0 od príkladu k príkazum. Praha : Grada, 1993. 523 s. ISBN 80-85623-91-9.

MOLNÁR, Cs. - SÁGI G. Programozás Turbo Pascal nyelven. (Programovanie v jazyku Turbo Pascal). Budapest : BBS-E Betéti Társaság, 2001. 232 s. ISBN 963 03 7152 9.

PONGOR, Gy. Szabványos Pascal programozás és algoritmusok. (Štandardné programovanie v Pascale a algoritmy). Műszaki Könyvkiadó : Budapest, 2002. 424 s. ISBN 9631625737.

STOFFA, V. Algoritmizáció és programozás. (Algoritmizácia a programovanie). Komárno : Univerzita J. Selyeho v Komárne, 2005. 174 s. ISBN 80-969251-7-2.

VITEK, A. a kol. Problems in Programming. Experience through Practice. New York : John Wiley & Sons Inc., 1991. 330 s. ISBN 978-0471930174.

None.

continuous student’s work 50%

• Algorithms – formal expression of algorithms;

• Purpose and graphic registration algorithm for solving tasks of everyday life;

• Basic algorithmic structures and their expression in graphic form a structured algorithmic language;

• Programming - program structure, basic elements of language, syntax and semantics;

• Simple data types, solving problems (numerical and non-numeric types);

• The structure of the command language, the definition and syntax, branching and repetition in the program. (Types of branching and cycles);

• Standard functions and procedures;

• The standard structured data types (array, set, record, file) and use them to simplify the solution;

• Procedures and functions, their importance in programs;

• Procedures with no parameters, and parameters - Declaration subroutine call;

• Own work of students - projects;

Method of evaluation and completion of the course: graded credit

Continuous assessment (for example: test, individual work ...): continuous student’s work 50%

Final assessment (for example: examination, final paper ...): final work (program) 50%

final work (program) 50%

• Introduction to the Theory of Formal Languages and Automata

• Basic terms, grammars, languages, Chomsky language classes

• Regular grammars,

• Finite automata,

• Equivalence between nondeterministic and deterministic finite automata,

• Equivalence between regular languages and finite automata,

• Regular expressions,

• Context-free languages,

• Push-down automata,

• Nondeterministic push-down automata,

• Equivalence between context-free languages and push-down automata,

• Top-down parsing,

• Bottom-up parsing.

• Algorithm, properties of algorithms,

• Correctness of algorithms, proving correctness of algorithms,

• Complexity of algorithms – time and space complexity. Asymptotic complexity,

• Sorting algorithms and their complexity I.,

• Sorting algorithms and their complexity II.,

• Mathematical modells of computers: Turing machine, RAM,

• Complexity classes P and NP,

• NP-complete problems,

• Algorithmically unsolvable problems, the Halting problem for Turing machines.

The subject aim is to explain to students the basic principles of information display on computer and easy ways of processing. Students will learn how they are implemented, displayed and processed by simple data types. Understand how to perform each machine instruction, what the instruction cycle is, and what a memory cycle is.

BLATNÝ, J. – KRIŠTOUFEK, K. – POKORNÝ, Z. – KOLENIČKA, J. Číslicové počítače. 2. vyd. Praha : SNTL, 1982. 493 s.

ČERNÍK, A. Počítač včera, dnes a zajtra 1. Bratislava : IRIS, 1997. 340 s. ISBN 80-8878-46-8.

GROŠEK, O. – PORUBSKÝ, Š. Šifrovanie – algoritmy, metódy, prax. Bratislava : GRADA, 1992. 272 s. ISBN 80-85424-62-2.

STOFFA, V. – CSÍZI, L. – SZŐKÖL, I. – TÓTH, K. – VÉGH, L. Az informatika alapjai I. (Základy informatiky I.) Komárno : Univerzita J. Selyeho v Komárne, 2007. 269 s. ISBN 978-80-89234-29-5.

STOFFOVÁ, V. a kol. Informatika, informačné technológie a výpočtová technika. Terminologický a výkladový slovník. Nitra : FPV UKF, 2001. 230 s. ISBN 80-8050-450-4.

None.

continuous tests 50%

• Coding of information, binary code, character encoding (ASCII code);

• Positional number system, binary number system

• Internal implementation of numerical information in a computer, basic arithmetic operations (+ - * /)

• Simple data types

• Display and processing of integers (fixed point);

• Inverse and additional code;

• Display and processing of real numbers (floating point presentation);

• Coding of the instructions (instruction set of processor, instruction execution cycle)

• View the program source code;

• Translation and execution of the program.

Method of evaluation and completion of the course: credit, exam

Continuous assessment (for example: test, individual work ...): continuous tests 50%

Final assessment (for example: examination, final paper ...): written and speech exam 50%

written and speech exam 50%