[ KLIKNIJ I WPISZ NAZWĘ PRZEDMIOTU ]...rules, the pigeonhole rule, the Dirichlet rule, permutations, variations , combinations, generating algorithms, combinatorial algorithms and

FACULTY OF ELECTRICAL ENGINEERING, COMPUTER SCIENCE AND TELECOMMUNICATIONS

ERASMUS PROGRAMME

FIELDS OF STUDY:

COMPUTER SCIENCEUNDERGRADUATE PROGRAMMEUNDERGRADUATE PROGRAMME

Faculty of Electrical Engineering, Computer Science and TelecommunicationComputer Science

P R O B AB I L I S T I C M E T H O D SP R O B AB I L I S T I C M E T H O D S

Course code: 11.1-WE-I-MP-PP13_S1S

Type of course: compulsory

Entry requirements: Mathematical analysis, linear algebra with analytical geometry

Language of instruct ion: Polish

Director of studies: Professor Dariusz Uciński

Name of lecturer: Professor Dariusz Uciński

Form of instruct ion

Number of

teaching

hours per

semester

Number of

teaching

hours per

week

Semester

Form of receiving a credit

for a course

Number of ECTS

credits al located

Ful l - t ime studies

5

Lecture 2 30

II

Grade

Class 2 30 Grade

Laboratory

Seminar

Project

COURSE CONTENTS:Measurement uncertainty. Propagation of uncertainty. Random and systematic errors. Statistical sampling study. Frequency distribution. Histogram. Summary statistical measures of location, variability, asymmetry and concentration. Rejection of outliers.Probability. Sample space. Basic definitions of probability: classical, frequency and modern. Fundamental properties of probability. Conditional probability. Independence. Total probability theorem. Bayes’ Theorem.Discrete and continuous random variables. Discrete random variables. Distributions: binomial, Bernoulli, Poisson and geometric. Functions of random variables. Expected value and variance. Joint probabilisty distributions of many random variables. Independence of random variables. Continuous random variables. Uniform distribution. Exponential distribution. Cumulative distribution function of a random variable. Normal distribution.Fundamentals of statistical inference. Types of random samples. Simple random sample. Distributions: chi-square, t-Student and Fisher-Snedecor. Point and interval estimation. Unbiasedness, consistency, efficiency and sufficiency. Parameter and non-parameter estimation. Confidence intervals for the mean. Limit theorems. Interval estimates of the proportion, variance, standard deviation, differences between proprtions and means. Determining the required sample size.Hypothesis testing. One- and two-sided tests of the mean. Testing the proportion. Testing the variance. Selecting the test procedure.


Regression and correlation analysis. Linear regression using least squares. Correlation and regression. Statistical regression using the regression line. Correlation analysis. Curvilinear regression. Multiple regression and correlation.

LEARNING OUTCOMES:Basic knowledge and competence in practical application of probability theory to construct probabilistic models of phenomena, as well as practical use of statistical methods and techniques to solve various problems encountered in computer science and other areas of engineering.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Practice – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.

RECOMMENDED READING:

1. Bertsekas D.P. and Tsitsiklis J.N.: Introduction to probability, 2nd Ed., Athena Scientific, Belmont, MA, 2008

2. Verzani J.: Using R for introductory statistics, Taylor and Francis, Boca Raton, FL, 2005

3. Hsu H.P: Probability, random variables, and random processes, McGraw-Hill, New York, 1997

4. Der G., Everitt B.S.: A handbook of statistical analyses using SAS, Chapman & Hall/CRC, Boca Raton, 2002

5. Papoulis A.: Probability, random variables, and stochastic processes, McGraw-Hill, New York, 1991

OPTIONAL READING:1. -

REMARKS:


F O U N D AT I O N O F D I S C R E T E S Y S T E M SF O U N D AT I O N O F D I S C R E T E S Y S T E M S

Course code: 11.9-WE-I-PSD-PP15_S1S


Entry requirements:Mathematical analysis, linear algebra and analytic geometry, algorithms and data structures


Director of studies: Professor Roman Gielerak

Name of lecturer: Professor Roman Gielerak


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a courseNumber of

ECTS cred i ts a l located


3

Lecture 1 15

II

Exam

Class 1 15 Grade

Laboratory

Seminar

Project

COURSE CONTENTS:Introduction: elementary sets algebra, elementary properties of functions and sequences: terminology and notations used, binary relations versus graphs versus matrices,equivalence relations ,ordering relations and theirs properties, asymptotic behaviour: notations Ω( .) ,Ξ(.), o(.), O(.), elementary rules of mathematical reasoning, formal sentences calculus, tautologies,logical equivalence of propositions, Bool's algebra model, predicates and quantifiers.Induction and recurrence: The mathematical induction concept and their applications, binomial formula, inductive and recursive procedures, algorithms and definitions, recurrence equations, linear recurrence equations and their solutions, characteristic polynomials method, generating functional method, universal recurrences and theirs applications to complexity evaluation of some recursive algorithms,Combinatorial problems: elementary counting rules, divisions, set theory methods, inclusion-exclusion rules, the pigeonhole rule, the Dirichlet rule, permutations, variations , combinations, generating algorithms, combinatorial algorithms and their complexity, applications in elementary probability calculus.Graphs theory problems: binary relations and their graphs representation, directed and undirected (multi)-graphs, matrices calculus applications for graphs structure analysis, basic graph theory algorithms: searching, sorting, spanning trees searching, optimal paths searching problems, optimal flow problem: The Salesman problem. Number theory problems : divisibility relations, modular arithmetics, linear modular equations, Chinese theorem on remainders, the problem of order of element, discrete logarithm problem, Euler theorem and


little Fermat theorem, fast modular exponentiation algorithm, essence of RSA cryptographic protocol, pseudo-primes tests, Miller-Rabin probabilistic test.Complements: more on formal relations theory, formal languages, complexity theory foundations, NP class of problems, NP-complete problems: examples and their relevance in Computer Science.

LEARNING OUTCOMES:The course has been specifically tailored for students of computer science. After passing over this course the average student should be able to estimate the computational complexity of the algorithms used to supply a computer programs to solve a particular problem.After passing over this course the student will be familiar with topics from logic include truth tables, predicates, quantifiers, and inference rules. Additional mathematical topics include elements of set theory, mathematical induction, relations and functions, number theory, and probability. The student will be able to select and use mathematical technologies which are used in a public cryptographic systems.

ASSESSMENT CRITERIA:Lecture: The grade will be calculated from a final exam. Approach to final exam is possible after pass a practice.Practice: The grade will be calculated from four in-class exams and positive grade of activity for in-class time.


1. T.H.Cormen, Ch.E. Leiserson,R.L. Rivest, Introduction to Algorithms (in Polish),Wydawnictwo Naukowo-Techniczne, Warszawa 1997.

2. Kenneth A. Ross, Charles R. B. Wright, Discrete Mathematics, Prentice Hall Inc. 1992.3. J. Flachmeyer, Combinatorics ( in Polish ), Państwowe Wydawnictwa Naukowe, Warszawa 1987.4. Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Practicał Mathematics, Państwowe

Wydawnictwa Naukowe, Warszawa 1998.5. S. W. Jabłoński, Introduction to Discrete Mathematics ( in Polish), Państwowe Wydawnictwa

Naukowe, Warszawa, 1991.6. Witold Lipski, Kombinatoryka dla programistów, Wydawnictwo Naukowo-Techniczne, Warszawa

1982.7. E.M. Reingold, J.Nievergelt, N.Deo, Algorytmy Kombinatoryczne, Państwowe Wydawnictwa

Naukowe, Warszawa 1985.8. Robin J. Wilson, Introduction to Graphs Theory,Wydawnictwo Naukowe PWN, Warszawa 1998.

OPTIONAL READING:-

REMARKS:


E X P E R I M E N T AL T E C H N I Q U E S I IE X P E R I M E N T AL T E C H N I Q U E S I I

Course code: 06.0-WE-I-TE2-PP17_S1S


Entry requirements: Experimental techniques I.


Director of studies: Professor Ryszard Rybski

Name of lecturer: Professor Ryszard Rybski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS

cred i ts a l located


4

Lecture 15 1

II

Grade

Class

Laboratory 30 2 Grade

Seminar

Project

COURSE CONTENTS:Principles of planning the instrumental realization of the experiment. Nature of the research object and assumed objective of the experiment – their influence on the choice of measurement method and procedure, and measurement instruments and systems.

Basic measurement methods and measuring instruments. Metrological properties of measuring instruments. Selected analogue electronic instruments.

Digital processing of measurement signals. Sampling, quantisation and coding. Analog-to-digital and digital-to-analog converters. Digital measuring instruments.

Measurements of selected non-electric quantities. General characteristics of sensors. Principle of operation and properties of selected sensors. Smart sensors.General characteristics of measurement systems. Types and configurations of measurement systems. Basic functional blocks of measurement systems. Converters and system instruments, sub-systems for measuring Signal acquisition, fieldbus, interface, system controller.

LEARNING OUTCOMES:Skills and competences in: basic measurement methods and measuring instruments as means for measurement realisation – a basic element of the experiment methodology; basics in analogue, analogue-digital and digital-analogue measurement signal processing, general knowledge of measurement systems.


ASSESSMENT CRITERIA:Lecture – the credit is given for obtaining positive grades in written tests carried out at least once a semesterLaboratory – the credit is given for obtaining positive grades in all laboratory exercises to be carried out according to the laboratory syllabus.

RECOMMENDED READING:1. Tumanski S.: Principles of electrical measurement. Taylor & Francis, 2006.2. Bhargawa S.C: Electrical measuring instruments and measurements. CRC Press, 2012.3. Horowitz P., Hill W.: The art electronics. Cambridge University Press, 1999.4. Dunn P.F.: Fundamentals of sensors for engineering and science. CRC Press, 2011.5. Miłek M.: Electrical metrology of nonelectrical quantities. Oficyna Wydawnicza Uniwersytetu Zielonogórskiego, Zielona Góra, 2006 (in Polish)

OPTIONAL READING:-

REMARKS:



C O M P U T E R AR C H I T E C T U R E IC O M P U T E R AR C H I T E C T U R E I

Course code: 06.0-WE-I-AK1-PK18_S1S


Entry requirements: None


Director of studies: Professor Andrzej Pieczyński

Name of lecturer: Professor Andrzej Pieczyński


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



2

Lecture 15 1 Grade

Class


Seminar

Project

COURSE CONTENTS:Point of work of computer system: von Neumann and Harvard models. Rules of cooperation between CPU and memory in data processing. Input – output operations. Memory hierarchy, address structure. Multi-processor systems. Flynn classification, SIMD, MISD, MIMD machines.Programmatic model of CPU. Machine levels and machine languages, instructions list architecture. Data representation and types. Integer number coding. Floating point representation of numbers. IEEE 754 standard. Data processing. Add, substract, multiply and divide algorithms. Arithmetic operations rate. Addressing modes. Program controlling. Conditions and branches.Connection with environment. Buses (ISA, EISA, LB, PCI, AGP). Peripherals – monitor, keyboard, mouse. Principles of operation and terms of use. Multimedia environment.Memory arrangement and hierarchy. Cache memory – control and handling. Cache integrity problem. MESI model. Mass storage. Methods of data writing on magnetic and optical carrier. Disk controllers.Instructions pipelining. Cooperation of many executive units. Branch prognose and implementation. Information processing models.RISC architectures and characteristics. Parallel programs and machines. Acceleration mechanisms. Pipelining. Branch prognosis. Branch acceleration implementation. Separate and multilevel cache memory. Memory system arrangement. Review of modern RISC architectures. CISC class processors architecture.Architectures classification. Parallel executing of programs in multiprocessor systems. Parallel machines classification. Methods of parallel systems programming. Communication and synchronisation techniques. Decomposition of problem for parallel computing. Distributed systems.


LEARNING OUTCOMES:Knowledge of computer structure, conditions of data transfer, storage and processing, basic rules of computer operation. Parallel architectures of computers.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.

RECOMMENDED READING:1. Chevance R.J.: Server Architectures: Multiprocessors, Clusters, Parallel Systems, Web Servers, and Storage Solutions, Elsevier Digital Press, 2004.2. Hyde R.: Write Great Code: Volume I: Understanding the Machine, No Starch Press, 2004.3. Metzger P.: PC Anatomy, wydanie VI, Helion, 2003 (in polish).4. Mueller S.: PC upgrade and service, Helion, 2001 (in polish).5. Nisan N.: The Elements of Computing Systems: Building a Modern Computer from First Principles, MIT Press (MA), 2005.6. Tanenbaum A.: Structured Computer Organization, Prentice Hall, 1998.

OPTIONAL READING:-

REMARKS:


P R I N C I P L E S O F P R O G R AM M I N GP R I N C I P L E S O F P R O G R AM M I N G

Course code: 11.3-WE-I-PP-PK19_S1S



Language of instruct ion: English

Director of studies: Wojciech Zając, Ph.D.

Name of lecturer: Wojciech Zając, Ph.D.


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 30 2

I

Grade

Class


Seminar

Project

COURSE CONTENTS:Computer system architecture and resources. Operating system. Program design. Programming languages. The data and its representation. Algorithm visualisation. Algorithmic languages. Program performance analysis.C programming. Program structure, commands syntax. Constants, variables, data types. Operators, expressions and basic instructions of C.Basic operations on variables. Arithmetical operators, hierarchy. Data input and output. Printout formatting with printf function. Flag, field width, precision, formatting character. Character conversion. ASCII table.Complex instructions, expressional instruction, empty instruction, grouping instruction. Control instructions: if-else, switch. Loops: do, while, for.Expressions and operators. Functions: structure, arguments, result, prototype, declaration, calling out. Communication with other elements. Use of functions. Recurrence functions.Pointers: rules of operation, declaration, using the address and the pointed value. Use of pointers to communicate with other elements. Tables: declaration, usage, examples. String as a table of characters. Name of a table as a pointer. Tables of tables: declaration, usage, examples.Data structures. Features, operation. Tables of structures. Fields. Unions.Disk file. Definition, structure, buffering. Directory, path. File operations: creating a stream, file opening, reading/writing, closing.


LEARNING OUTCOMES:Abilities and competence in computer system operation understanding and programming in C.

ASSESSMENT CRITERIA:Lecture – written test.Laboratory – written test.

RECOMMENDED READING:1. Brad Jones. Teach Yourself C in 21 Days, Macmillan Computer Publishing, http://lib.daemon.am/Books/C/2. Mike Banahan, Declan Brady and Mark Doran, The C Book, Addison Wesley, 1991, available free on-line: http://publications.gbdirect.co.uk/c_book/3. K. N. King, C Programming: A Modern Approach, 2008

OPTIONAL READING:-

REMARKS:


OBJECT-ORIENTED PROGR AMMINGOBJECT-ORIENTED PROGR AMMING

Course code: 11.3-WE-I-PO-PK20_S1S


Entry requirements: Principles of programming, algorithms and data structures


Director of studies: Dr. Paweł Majdzik

Name of lecturer: Dr. Paweł Majdzik


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



7

Lecture 2 30

II

Exam

Class


Seminar

Project

COURSE CONTENTS:Introduction to object programming. Concept of abstract data typing. Class definition. Encapsulation – declaration and definition of class member methods. Passing parameters to member functions: via value and via reference. Private and public class members. Constructors and destructors. Default and copy constructors. Constructor initialization list. Synthesized constructors. Destructors. Operator overloading. User defined conversions: converting function, converting constructor. Functions overloading: friend functions and inline functions, constructor and operator conversion.Inheritance rules. Inheritance and the composition of objects. Protected members. Multiple and multi-base inheritance. Problem of variable names in multi-base inheritance. Polymorphism. Virtual functions. Pure virtual functions. Early and late binding. Time and memory costs connected with application of polymorphism. Abstract classes - defining and examples of abstract classes application in object-oriented programs. Standard Template Library. Function templates. Specialized functions. Phases of function adjustment. Class templates. Definition of class templates. Class templates versus micro- definitions. Containers and algorithms, iterators, associative containers, function objects. Designing of object-oriented programming. Design pattern . Adapter pattern, facade pattern, bridge pattern, etc.


LEARNING OUTCOMES:The aim of the subject is to acquaintance students with the object programming paradigm. In particular the lectures include: abstract data typing definition with member functions (encapsulation), inheritance, polymorphism and virtual functions, templates of classes and functions. The aim of the laboratory is to teach how to design programs and utilize tools (e.g. tools from Standard Template Library) created to support a programmer's work.

ASSESSMENT CRITERIA:Lecture – the condition of passing is obtaining positive grade from written exam. Laboratory – the condition of passing is obtaining positive grades from all laboratory subjects according to the program of the laboratory.

RECOMMENDED READING:1. Eckel B.: Thinking in C++, Prentice Hall, US Ed edition, 2002.2. Kerighan B., Ritchie D.: Programowanie w języku C, WNT, Warszawa, 2000.3. Stroustrup B.: The C++ Programming Language, Addison – Wesley, 2004.4. Lippman S.B.: Inside the C++ Object Model, Addison – Wesley, 1996

OPTIONAL READING:-

REMARKS:


D I G I T AL S Y S T E M D E S I G ND I G I T AL S Y S T E M D E S I G N

Course code: 06.0-WE-I-UC-PK22_S1S


Entry requirements:Mathematical foundations of engineering, logic for computer science, Experiment methodology I, computer architecture I


Director of studies: Professor Marian Adamski

Name of lecturer: Professor Marian Adamski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 30 2

II

Grade

Class


Seminar

Project

COURSE CONTENTS:Digital Computers and Information. Binary signals. Number systems, operations and conversions: decimal, binary, octal, hex. Codes: BCD, parity, Gray.Combinational Logic. Logic gates. Logic functions. Standard forms: minterms/maxterms, SoP, PoS. Karnaugh maps. Two-level/Multilevel circuit optimization and implementations.Combinational Functions and Circuits. Decoders/Encoders. Multiplexers, implementation. Iterative Circuits. Binary Adder/Subtractors. Sequential Circuits. Latches. Flip-flops. Finite State Machines. Mealy vs. Moore machines. Sequential Circuit Design: state assignment, designing with D and JK flip-flops. Registers. Registers with Load Enable and with Parallel Load. Register Transfers. Shift Registers, Shift Registers with Parallel Load, Bidirectional/Universal Shift Registers.Counters. Ripple Counters. Synchronous Binary Counters: design with D and JK flip-flops. Binary Up-Down Counter. Binary Counter with Parallel Load. BCD and Arbitrary Sequence Counters. Modulo N counters. Introduction to VHDL Language.


LEARNING OUTCOMES:Demonstrate knowledge of fundamental Boolean principles and manipulation and their application to digital design. In-depth understanding of combinational and sequential digital/logic circuits, and modular design techniques. Ability to analyze and synthesize logic circuits. Basic understanding of datapath and control unit design and memory basics.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises.

RECOMMENDED READING:1. R.H.Katz, G.Borriello: Contemporary Logic Design, 2nd Edition, Pearson Education, 20052. K.Skahill: VHDL for Programmable Logic, Addison-Wesley Publishing, 19963. J.F.Wakerly: Digital Design, Principles and Practices, 4th Edition, Prentice-Hall, 20054. Μ.Μ.Mano, M.D.Ciletti: Digital Design, 4th Edition, Prentice-Hall, 2007 5. M.Zwolinski: Digital System Design with VHDL, 2nd Edition, Prentice-Hall, 2003

OPTIONAL READING:-

REMARKS:


C O M P U T E R N E T W O R K S IC O M P U T E R N E T W O R K S I

Course code: 11.3-WE-I-SK1-PK23_S1S


Entry requirements: none


Director of studies: Dr Marcin Mrugalski

Name of lecturer: Dr Marcin Mrugalski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



2

Lecture 30 2

II

Grade

Class

Laboratory

Seminar

Project

COURSE CONTENTS:Introduction to computer networks: Classification of computer networks. Reference models: ISO/OSI and TCP/IP.Physical layer: Types of physical media: copper wire, optical fiber and wireless. Physical topology. Collision domains. Network devices of physical layer: hub and repeater. Data link layer: Concepts and technologies. Logical topologies. LAN networks segmentation. Network devices of data link layer: NIC, bridge and switch. Fundamentals of switch configuration. LAN networks standards: Fast Ethernet, Gigabit Ethernet and 10 Gigabit Ethernet.Network layer: Routing and addressing. Routing protocols and routed protocols. Network layer device: router. IPv4 address management. Transport layer: Functions and TCP and UDP transports protocols. Session, presentation and application layers: Functions and protocols. Internet technology components. Introduction to routers: Router components and operation. User interface and configuration principle. Troubleshooting.

LEARNING OUTCOMES:Abilities and competence in implementation and configuration of simple local area network connected to Internet, IP address management, switch and router configuration.

ASSESSMENT CRITERIA:


Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.

RECOMMENDED READING:1. Dye M., McDonald R., Rufi A.: CCNA 1 Exploration Network Fundamentals. Cisco Networking

Academy, Indianapolis, Indiana, 2012. 2. Graziani R., Johnson A.: CCNA2 Routing Protocols and Concepts: CCNA Exploration Companion

Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.

OPTIONAL READING:-

REMARKS:


OPERATING SYSTEMS IOPERATING SYSTEMS I

Course code: 11.3-WE-I-SO1-PK25_S1S


Entry requirements:Principles of Programming, computer architecture I and II, algorithms and data structures.


Director of studies: Professor Krzysztof Patan

Name of lecturer: Professor Krzysztof Patan


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 30 2

III

Grade

Class


Seminar

Project

COURSE CONTENTS:Computer system structure: Operating memory, CPU, I/O devices, idea of the interupt, dual model of system operation.Operating systems types: Batch systems, multiprogramming systems, time-sharing (multi-tasking) systems, parallel systems, distributed systems, networked systems, real-time operating systems.Operating systems design. Basic components of operating systems. Operating systems services. Kernel based systems, virtual machines. System calls.CPU scheduling. Scheduling criteria, scheduling algorithms. Evaluation of scheduling algorithms. Round robin, priority scheduling, preemptive scheduling.Memory management. Logical and physical addresses space. Contiguous allocation. Fragmentation: external and internal. Packing. Paging. Segmentation.Virtual memory. Demand paging. Page replacement. Performance of demand paging. Algorithms of page replacement. Allocation of frames. Demand segmentation.File system. File concept. Directory structure. File system structure. Allocation methods. Free-space management. File system structure. Windows Vista/7/8, Windows Server 2008. System configuration, administration tasks, administration tools. Managing files and directories. User accounts, group accounts. Rights to files, directories and system components. Audit of system components. Monitoring operating system. Analysis of system components.


LEARNING OUTCOMES:Skills and competences in computer systems and operating systems design. To learn about process scheduling, memory management, file system design. Ability to administrate and configure the operating systems Windows XP/Vista/7/8 and Windows Server 2008.

ASSESSMENT CRITERIA:Lecture – the passing condition is to obtain a positive mark from the final test.Laboratory – the passing condition is to obtain positive marks from all laboratory exercises to be planned during the semester.

RECOMMENDED READING:1. Silberschatz A., Galvin P.B., Gagne G.: Operating system concepts. Seventh Edition, Wiley, 2005.

2. Tanenbaum A.: Modern operating systems, Prentice Hall, 2001.

3. Stallings W.: Operating Systems: Internals and Design Principles, Fourth Edition, Prentice Hall, 2000.

OPTIONAL READING:-

REMARKS:


C O M P U T E R G R AP H I C SC O M P U T E R G R AP H I C S

Course code: 11.3-WE-I-GK-PK26_S1S


Entry requirements: Principles of programming, software tools.


Director of studies: Professor Sławomir Nikiel

Name of lecturer: Professor Sławomir Nikiel


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



5

Lecture 30 2

III

Grade

Class


Seminar

Project

COURSE CONTENTS:Human factors. Human perception of visual stimuli. Digital content creation process. Models for computer graphics. Introduction to computer graphics and digital imaging. Input/output devices, acquisition and display of digital images. Application cases in education, entertainment, architecture, industry and healthcare.Raster images. Color models, models of digital images. Desk-Top Publishing (DTP). Image processing, digital image analysis. Textures. Fractals in computer graphics.Vector models. Geometry models for graphical objects. Interpolators. Hierarchical structure of a graphical model. Definition of rendering pipeline. 3D scene construction. Computer Aided Design (CAD). Transformations and rendering of 3D geometry. Shading and shadows. Photo-realistic synthesis of images. Ray Tracing, Radiosity, Environmental Mapping and Image-based Rendering. Stereoscopy.Programming form computer graphics. OGL, DirectX, Cg, PYTHON.

LEARNING OUTCOMES:


Skills and competences in programming and design for computer graphics, digital image synthesis and image processing. Awareness of the nature of the interface between application software and graphics packages. Modeling two- and three-dimensional geometry and object representation.

ASSESSMENT CRITERIA:Laboratory – coursework involving design and development of an application that requires graphical input, manipulation and output.

RECOMMENDED READING:1. Hearn. D, Baker D.: Computer Graphics- C version, Prentice Hall, 1997.2. Xiang Z., Plastock R.: Shaum’s outline of computer graphics, McGraw-Hill, 2000.3. Preparata P., Shamos N.: Computational geometry. Introduction, Springer, 1993.4. Sun Microsystems: From pixels to pictures, Addison Wesley, 1991.5. Various web-based sources.

OPTIONAL READING:-

REMARKS:


S O F T W AR E E N G I N E E R I N GS O F T W AR E E N G I N E E R I N G

Course code: 11.9-WE-I-IO-PK27_S1S


Entry requirements: Principles of programming, high level programming





Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 30 2

IV

Class

Laboratory

Seminar

Project 15 1

COURSE CONTENTS:Introduction to software engineering. Why engineering software is different? Software lifespan and maintenance. Lifecycle models with specified project phases.Information systems. System and software design. Models for information systems.Software process. Requirements analysis and specification. Guidelines and forms for specification.Design. Purpose of design. Fundamental design concepts. Design strategies. Design quality metrics.Reliability and system security.Implementation. Review of structural programming. Error handling and defensive programming. Aids to maintainability. Coding for performance.Testing. Reasons for testing. Black box and structural testing. Testing strategies. Tools for testing


CASE. Computer Aided Software Engineering. Upper and Lower CASE, CASE workbenches.Configuration and maintenance. Evolution of information systems.

LEARNING OUTCOMES:To develop students’ attitude that the maintaining the production of software requires an engineering approach. It is done by introducing phases of the software lifecycle and presenting techniques for these phases.

ASSESSMENT CRITERIA:Lecture – one written test of 1.5 hours (75%) and coursework (25%) involving projects.Project – a completed project involving analysis, design and development of an information system

RECOMMENDED READING:1. Sommerville I.: Software Engineering Addison-Wesley, 1992.2. Pressman R.: Software Engineering, A practitioner’s approach, McGraw-Hill, 19923. Ford N.J., Woodroffe M.: Introducing software engineering, Prentice-Hall, 1994.4. Jones G.W.: Software Engineering, Wiley, 1990

OPTIONAL READING:-

REMARKS:


D AT AB AS E S D AT AB AS E S

Course code: 11.3-WE-I-BD-PK28_S1S


Entry requirements: Principles of programming


Director of studies: Dr. Agnieszka Węgrzyn

Name of lecturer: Dr. Agnieszka Węgrzyn


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



7

Lecture 30 2 Exam

Class


Seminar

Project

COURSE CONTENTS:Introduction to databases: relational model, hierarchical model, network model, XML model, object-oriented databasesThe relational model: Relational data objects and SQL; Relational operators and SQL; Relational data integrity, Entity-Relationship Diagram – ERD, normalize relations into normal formsIntroduction to SQL: create tables, insert, delete, update data, select statements, subquery, relational operators and constraint, create sequences, create view, create and manage indexes, built-in SQL functions, transactionsIntroduction to PL/SQL: PL/SQL types and operators, SQL in PL/SQL, cursors, exceptions, procedures, functions, packages, triggers, built-in packages

LEARNING OUTCOMES:Using of selected relational database management systems (RDBMS); design and implementation of relational database structures / models, SQL language; design of database applications; conceptual, logical, and physical database design


http://en.wikipedia.org/wiki/Object_database

http://en.wikipedia.org/wiki/Object_database

ASSESSMENT CRITERIA:Lecture - pass exam.Laboratory - positive marks for all exercises.


1. Bowman, J.S., Emerson, S.L., Darnovsky, M.: The Practical SQL Handbook - Using Structured Query Language, Addison-Wesley, 1996.2. Date, C.J.: An introduction to database systems, 7th edition, Addison-Wesley, 2000.3. Date, C.J. and H. Darwen: A Guide to the SQL Standard, Third Edition, Addison-Wesley, 1994.4. Garcia-Molina, H. & Ullman, J. D. & Widom, J.: Database systems: The Complete Book, (International Edition), Prentice Hall, 2003.5. Ullman J. D., and Widom J.: A First Course in Database Systems, Third Edition, Prentice-Hall, 2008.

OPTIONAL READING:-

REMARKS:


E L E M E N T S O F AR T I F I C I AL I N T E L L I G E N C EE L E M E N T S O F AR T I F I C I AL I N T E L L I G E N C E

Course code: 11.4-WE-I-ESI-PK29_S1S


Entry requirements: Programming fundamentals


Director of studies: Dr. Marek Kowal

Name of lecturer: Dr. Marek Kowal


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



7

Lecture 30 2

IV

Exam

Class


Seminar

Project

COURSE CONTENTS:Solving problems by searching. Theory of graphs. Uninformed search strategies. Informed search strategies. Heuristic functions. Local search methods. Constraint satisfaction problems. Search algorithms in computer games.Adversarial search. Optimal strategies. The minimax algorithm. Alpha-beta pruning algorithm. Evaluation functions. Problems that include element of chance. First-order logic. Syntax and Semantics of first-order logic. Inference in first order logic. Atomic and complex sentences.Planning and scheduling. Planning with state-space search. Forward state-space search. Backward state-space search. Heuristics for state-space search. Planning GraphsProbabilistic reasoning. Axioms of probability. Bayes' rule, Semantics of Bayesian networks. Inference in Bayesian networks. Learning Bayes net structures. Bayesian parameter learning. Markov chains.Approximate reasoning. Rule-based methods for approximate reasoning. Representing ignorance - Dempster-Shafer theory. Representing vagueness - Fuzzy sets and fuzzy logic.Learning methods. Inductive learning. Learning decision trees. Reinforcement learning. Maximum-likelihood parameter learning. Neural networks.Visual perception. Image formation. Edge detection. Image segmentation. Object recognition.

LEARNING OUTCOMES:


Skills and competences in: solving problems using searching algorithms, developing heuristic functions, solving problems using local search algorithms, solving adversarial problems using minimax algorithms, using and understanding first-order logic, solving problems of planning and scheduling by search algorithms, applying probabilistic and uncertain reasoning to solve problems, applying learning algorithms to acquire knowledge from observation, applying segmentation and edge detection algorithms to object recognition problems.

ASSESSMENT CRITERIA:Lectures – Successful completion of the course requires passing the final examination.Laboratory – Successful completion of the laboratory requires completion of all laboratory activities.

RECOMMENDED READING:1. Russell S., Norvig P.: Artificial Intelligence: A Modern Approach (3rd Edition), Prentice Hall, 2009.2. Bishop C.: Pattern Recognition And Machine Learning, Springer Verlag, 2006.

OPTIONAL READING:-

REMARKS:


E X P E R I M E N T AL T E C H N I Q U E S IE X P E R I M E N T AL T E C H N I Q U E S I

Course code: 11.9-WE-I-TE1-PD34_S1S


Entry requirements: none


Director of studies: Professor Ryszard Rybski

Name of lecturer: Professor Ryszard Rybski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



2

Lecture 15 1

I

Grade

Class


Seminar

Project

COURSE CONTENTS:Information: acquisition and processing. Information as a basic factor for civilisation development of a contemporary society, information society. Experiment as a basic manner of collection information about an object, phenomenon or process. Basic concepts of the information theory.

Elements of the experiment theory. Designing experiments. General rules and procedures for carry out experiments. The significance of mathematical modelling in the experiment methodology. Measurement as a basic element of the experiment methodology.

General characteristics and basic elements of measurement information acquisition systems. The relations of information acquisition systems with data telecommunication systems of information processing and computer control systems. Analysis and working out of experiment results. Measurement errors and uncertainties. Error sources. Measurement error classification. The calculation of systematic errors in direct and indirect measurements. Mathematical model and random error calculation. The elimination of redundancy errors. Analysing measurement result uncertainties. Shaping measurement results. Connecting measurement results. Documenting experiment results.

LEARNING OUTCOMES:


Skills and competences in: basics in designing and conducting experiments; analysing, developing and documenting experiment results.

ASSESSMENT CRITERIA:Lecture – the credit is given for obtaining positive grades in written tests carried out at least once a semesterLaboratory – the credit is given for obtaining positive grades in all laboratory exercises to be carried out according to the laboratory syllabus.

RECOMMENDED READING:1. Tumanski S.: Principles of electrical measurement. Taylor & Francis, 2006. 2. Bhargawa S.C: Electrical measuring instruments and measurements. CRC Press, 2012.3. Taylor J.R.: An introduction to error analysis. University Science Books, 1997.4. Lira I.: Evaluating the measurement uncertainty. Taylor & Francis, 2006.

OPTIONAL READING:-

REMARKS:


C O M P U T E R N E T W O R K S I IC O M P U T E R N E T W O R K S I I

Course code: 11.3-WE-I-SK2-PD36_S1S


Entry requirements: Computer networks I


Director of studies: Dr. Marcin Mrugalski

Name of lecturer: Dr. Marcin Mrugalski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 30 2

III

Exam

Class


Seminar

Project

COURSE CONTENTS:IP address management: Sub-netting with the application of VLSM. IP addresses aggregation. Private addressing with NAT and PAT implementation. Routers: Architecture, application and advanced configuration. Static and dynamic routing. Default routing. Full-class and classless routing. Link state and distance vector routing protocols: RIPv1, RIPv2, IGRP, OSPF, EIGRP. Interior and exterior gateway routing protocols. Network convergence: split horizon, count to infinity, hold-down timers and route poisoning methods. Load balancing in computer networks.Network security: Standard and extended access control list configuration. Dynamic access control list. Reflexive access control list. Context-base access control list. Firewalls, IPS, IDS and DMZ.Ethernet switches: architecture, futures and configuration of the switches in the hierarchical computer networks. VLANs and their configuration. STP, RSTP and Rapid PVST+ algorithms. VLANs internetworks routing.WAN technologies: ISDN, xDSL, ATM, FrameRelay, SONET, UMTS.

LEARNING OUTCOMES:Student is able: to configure switches and routers, to describe distance vector and link state routing protocols, to choose appropriate interior and exterior gateway routing protocols, to manage IP addresses and apply NAT and PAT mechanisms.


Student has knowledge about sources of hazards in security of computer networks and he is able to prevent them with the application of the ALC, Firewalls, IPS, IDS and DMZ. Student is able to describe, choose and apply different WAN technologies.

ASSESSMENT CRITERIA:Lecture – in order to get a credit it is necessary to pass all tests (oral or written) carried on at last once per semester.Laboratory – in order to get a credit it is necessary to get positive grades for all laboratory works defined by the tutor.


1. Graziani R., Johnson A.: CCNA2 Routing Protocols and Concepts: CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.2. Lewis W.: LAN Switching and Wireless: CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.3. Vachon B., Graziani R.: Accessing the WAN: CCNA Exploration Companion Guide CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.

OPTIONAL READING:-

REMARKS:


J AV A AN D W E B T E C H N O L O G I E SJ AV A AN D W E B T E C H N O L O G I E S

Course code: 11.3-WE-I-SK2-PD37_S1S


Entry requirements: Object-oriented programming.


Director of studies: Dr. Andrzej Marciniak

Name of lecturer: Dr. Andrzej Marciniak


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 30 2

III

Exam

Class


Seminar

Project

COURSE CONTENTS:Java fundamentals. Data-types, operators, instructions, objects and classes, packages, interfaces and inner classes, exceptions, inheritance, strings, utilities, streams, serialization.Java advanced features. Multi-threading, collections, database connections, distributed objects, Java Beans, security, localisation, reflections. Media and graphics in Java. Graphical user-interface, image processing, MIME formats, AWT and SWING.Networking. Socket programming, client-server architecture, implementing servers, resource locators and identifiers, harvesting information from the Web.HTML and WWW fundamentals. Publishing in Web, presentation formats, HTML document structure. Designing Web pages in HTML, XML and XHTML. Web Accessibility Initiative (WAI). Cascade style-sheets.Creating internet applications. HTTP 1.1 methods, script languages, server-side and client-side scripts – common features and differences. Fundamentals of JavaScript and AJAX technology. Programming applets, applet lifecycle, security management. Embedding applets in HTML pages.


LEARNING OUTCOMES:Complete knowledge of the syntax and structure of the Java programming language and how to create Java applications that run on server and desktop systems. An ability to design within Java environment a system, component or process to meet the desired needs. Use of modern engineering tools such as Eclipse and NetBeans for the development and implementation of programs. Being familiar with Java enterprise design patterns and anti-patterns. An ability to design interactive Web applications.

ASSESSMENT CRITERIA:Lecture – written final and oral (optional) examination.Laboratory - assessment is continuous during the semester, and consists of individual and group assignments, class participation, short-tests, laboratory reports.


1. Alur D. Crupi J. Malks D.: Core J2EE Patterns: Best Practices and Design Strategies, Prentice Hall Ptr, 2003. 2. Cooper J. W.: Java Design Patterns, Addison-Wesley, 2000.3. Eckel B.: Thinking in Java, 4th Edition, Prentice Hall, 2006.4. Horstmann C. S., Cornell G.: Core Java 2, Volume I – Fundamentals, 7th Edition, Prentice Hall, 2007.5. Horstmann C. S., Cornell G.: Core Java 2, Volume II – Advanced Features, 7th Edition, Prentice Hall, 2007.

OPTIONAL READING:-

REMARKS:


C O N C U R R E N T AN D D I S T R I B U T E D P R O G R AM M I N GC O N C U R R E N T AN D D I S T R I B U T E D P R O G R AM M I N G

Course code: 11.3-WE-I-PWR-PD38_S1S


Entry requirements: Principles of programming, object oriented programming, computer architecture


Director of studies: Dr Tomasz Gratkowski

Name of lecturer: Dr Tomasz Gratkowski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 15 1

IV

Exam

Class


Seminar

Project

COURSE CONTENTS:Concurrent programming – basic concept: process, shared resources, critical section, mutual exclusion, synchronization, deadlock, starvation.Aims of concurrent programming. Advantages and disadvantages of concurrent programming.Semaphores: general semaphore, binary semaphore, synchronization of processes with usage of semaphores.Concurrent programming in Java. Monitors. Additional methods of threads synchronization: blocking queued, barriers, countdown of latch and exchanger.Classical problems of concurrent programming: dining philosophers problem, producer-consumer problem, readers-writers problems.Characterization of Distributed Systems. Inter-process communication. Guidelines for design of inter-process communication.Remote procedure call (RPC). Remote method invocation (RMI). How to build of distributed applications in Java RMI. Integration different distributed environments.


Time and coordination in distributed systems. Logical clock. Election algorithm. Transactions and concurrency control in distributed systems. Algorithms for deadlock detection in distributed systems.

LEARNING OUTCOMES:Abilities and competence in design and implementation software consist of many processes and in distributed environment.

ASSESSMENT CRITERIA:Lecture – in order to get a credit it is necessary to pass all tests (oral or written) carried on at last once per semester. Laboratory – in order to get a credit it is necessary to earn positive grades for all laboratory works defined by tutor.


1. Ben-Ari M.: Principles of Concurrent and Distributed Programming, Addison-Wesley, 2006.2. Foster I.: Designing and Building Parallel Programs, http://www.mcs.anl.gov/~itf/dbpp/3 .Coulouris G. et al.: Distributed Systems. Concepts and Design (4th ed.), Addison Wesley, 2005.4. Tanenbaum S.: Distributed Systems. Principles and Paradigms (2nd ed.), Prentice Hall, 2002.5. Garg V. K.: Concurrent and Distributed Computing in Java. Wiley-IEEE Press, 2004.6. Horstmann C. S., Cornell G.: Core Java™ 2: Volume II–Advanced Features, Prentice Hall, 2008.7. Goetz B., Peierls T., Bloch J., Bowbeer j., Holmes D., Lea D.: Java Concurrency in Practice, Addison-Wesley Professional, 2006.

OPTIONAL READING:-

REMARKS:


O P E R AT I N G S Y S T E M S I IO P E R AT I N G S Y S T E M S I I

Course code: 11.3-WE-I-SO2-PD39_S1S

Type of course: compulsory/optional

Entry requirements: Operating systems I, principles of programming.


Director of studies: Dr Wojciech Zając

Name of lecturer: Dr Wojciech Zając


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 15 1

IV

Exam

Class


Seminar

Project

COURSE CONTENTS:Operating system: construction, features, selection for a given purpose.Remote system operation, users, configuration files. File system. Filename, Meta-characters. Files-related commands. Typical filesystem tree. Displaying the text files. Access rights. FTP. VI editor.Find command.Shell programs. Configuration files, variables. Streams and pipelines. Redirecting data. Filters. Regular expressions.Shell programming. Tests. Conditions. Loops. Functions.Advanced processing of test files. sed editor. awk filter. Element of system administration.


LEARNING OUTCOMES:Abilities and competence in using and administrating UNIX/Linux systems

ASSESSMENT CRITERIA:Lecture – written test. Laboratory - written test.

RECOMMENDED READING:1. S. Pratta, D. Martin: UNIX V System Bible. Commands and utilities. Prentice Hall Computer Publishing 1986.2. S. Strobel, Thomas Uhl. Linux unleashing the workstation in your PC, Springer-Verlag 1996.

OPTIONAL READING:-

REMARKS:


P R O J E C T M AN AG E M E N TP R O J E C T M AN AG E M E N T

Course code: 11.9-WE-I-ZPG-PD32_S1S



Director of studies: Dr Anna Pławiak-Mowna

Name of lecturer: Dr Anna Pławiak-Mowna


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



3

Lecture 15 1

VI

Grade

Class


Seminar

Project

COURSE CONTENTS:Introduction to IT Project Management. Project Conception. The Successful Project Management.The Phases of the IT Project Life Cycle. Design Management. Project Documentation.Project Planning. Project selection and scope definition. Planning procedures. Resource analysis, allocation and management. Project Scheduling.Human Resource Management.Project Team Building. Project Manager. Team roles. The interplay between actor roles in projects. Project team communications skills. Team motivation. Conflict Management Engineering.Project Management. Risk Management. Project Change Management. Project Time and Cost Management.Phases of the Project Life Cycle. Activities, tasks and results. Project Initiation.Project Planning. Project Execution. Project Closure. The Concept Phase. The Analysis Phase. The Design Phase. The Implementation Phase. The Testing Phase. The Delivery Phase.


Project Planning and Management Control. Risk assessment. Project Progress and Quality Control. Project Documentation. Project charter. Project phase plans. Schedule. Project Budget. Project Report.Project Delivery and Maintenance. Project Closure. Project delivery process. Training for users andtechnical staff. Project Closure Report. Post Implementation Review.Project planning and management software.Apply of Project Management Tools.

LEARNING OUTCOMES:The aim of this course is to equip the student with the skills and knowledge of a conceptual framework for the discipline of IT project management, engineering project planning, project management, phases of the project life cycle, human resource management, project planning and management control.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.


1. Kerznel H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling, Wiley, 2009, ISBN-10: 0470278706.2. Verzuh E.: The Fast Forward MBA in Project Management (Portable Mba Series), Wiley, 2008, ISBN: 0470247894.3. Holliday M.: Coaching, Mentoring and Managing: A Coach Guide Book, Career Press, Incorporated, 2001, ISBN: 9781564145840.4. Yourdon E.: Death March, Prentice Hall, 2003, ISBN: 978-0131436350. 5. Katzenbach JR., Smith DK.: The Wisdom of Teams: Creating the High-Performance Organization, HarperBusiness, 2003: ISBN: 978-0060522001.

OPTIONAL READING:

1. Jaszkiewicz A.: Inżynieria oprogramowania, Helion, Gliwice, 1997.2. Górski J.: Inżynieria oprogramowania w projekcie informatycznym, Mikom, Warszawa, 2000.3. Szyjewski Z.: Metodyki zarządzania projektami informatycznymi, Mikom, Warszawa, 2004.4. Wróblewski P.: Zarządzanie projektami informatycznymi dla parktyków, HELION, Gliwice, 2005.5. Berkun S.: Sztuka zarządzania projektami, Helion, Gliwice, 2006.6. Mingus N.: Zarządzanie projektami, Helion, Gliwice, 2002.7. Spałek S.: Sztuka wojny w zarządzaniu projektami, Helion, Gliwice 2005.

REMARKS:


M AN AG E M E N T O F S M AL L AN D M E D I U M E N T E R P R I S E SM AN AG E M E N T O F S M AL L AN D M E D I U M E N T E R P R I S E S

Course code: 04.9-WE-I-ZMSP-POW_A_7_S1S




Director of studiesJanusz Szajna, Ph.D., D.Sc. dr Anna Pławiak-Mowna

Name of lecturer:Janusz Szajna, Ph.D., D.Sc.dr Anna Pławiak-Mowna


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



1

Lecture 30 2

II

Grade

Class

Laboratory

Seminar

Project

COURSE CONTENTS:

Basic concepts and normative categories. Concepts of : entrepreneur, company, business. Licensing and permitting authorities. Entrepreneur mark. National Judicial Register. Dictionary of normative and economic-market categories.Development of decision on starting a company. The idea of starting a private company. General concept of creating a company. Significance of following factors: location, area of operation, supply and demand, competition, risk. Sources of financing the company start-up. Estimation of: economic profitability, threats and barriers, opportunities and development chances. Decision on starting a company.


Choice of a business subject. A single entrepreneur and co-partner. A private company run by a natural person. Freelance company. Private family company. Companies: a civil partnership, a general partnership, a partnership, a registered company, a limited liability company, a limited joint-stock company. Legal personality of companies.Procedure of starting the company (action plan). Administrative, formal and legal procedure. Plan of actions connected with a company start-up, starting a private company by a natural person; starting a freelance company; starting a family business; starting a civil company, a general partnership, a partnership, a registered company, a limited liability company, a limited joint-stock company; obtaining licences or permissions. Procedure of starting the company(registration, notification). Company registration in National Judicial Register. Obtaining a statistical REGON number. Obtaining NIP number in tax office. Registration of VAT taxpayer. Opening a bank account. Notification to the Social Security and Health Insurance institutions. Personal and property insurance. Notification to other authorities or public institutions. Business plan. Methodological basis of a business plan. Preparatory base for business plan elaboration. Elaboration of a business plan. Plans: organizational, investment, production, marketing, sales, financial. Means and methods of realization, control. Beginning of a company activity. Establishing proper registers and necessary records. Setting organizational structure and workflow. Creating work positions and employing new workers. Assuring proper work conditions as well as material and equipment. Promotion, advertising, marketing, methods of sales and company management.

LEARNING OUTCOMES:Skills and competences in: starting a company, choosing a business entity, elaboration of a business plan and company management.

ASSESSMENT CRITERIA:Lecture: to obtain a credit a student has to get positive grades in all written or oral tests carried out at least once a semester.

RECOMMENDED READING:1. Skowroński S.: Mały Biznes, czyli przedsiębiorczość na własną rękę, INROR, Warszawa, 1998.

2. Strużycki M.: Zarządzanie małym i średnim przedsiębiorstwem. Uwarunkowania Europejskie, Difin,

Warszawa, 2002.

3. Zarządzanie marketingowe małymi i średnimi przedsiębiorstwami, Pr. Zbiorowa, Difin, Warszawa, 1998.

4. Fink M., Kraus S.: The Management of Small and Medium Enterprises, Taylor & Francis, 2009, ISBN:

9780203871751.

5. Marquardt MJ.: The Manager As Mentor, Greenwood Publishing Group, 2006, ISBN: 9780275985899.

OPTIONAL READING:

-

REMARKS:



I T S Y S T E M D E S I G NI T S Y S T E M D E S I G N

Course code: 11.3-WE-I-PSI-PS40_ISM_S1S Type of course: optional

Entry requirements: Databases, principles of programming, computer architecture.


Director of studies: Dr. Agnieszka Węgrzyn

Name of lecturer: Dr. Agnieszka Węgrzyn


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 30

V

Exam

Class

Laboratory 30 Grade

Seminar

Project

COURSE CONTENTS:Basic functionalities of IT systems. IT system design methodology (system life cycle phases: requirements analysis, design, implementation, testing, installation, maintenance). IT systems design methodologies classification. Life cycle models for IT system. Types of system documentation (General - at the stage of analysis, Technical - at the stage of design and implementation, System manuals). Modeling in UML. CASE tools.

LEARNING OUTCOMES:Skills and competence in: analysis and design of IT systems.

ASSESSMENT CRITERIA:Lecture - pass exam.Laboratory - positive marks for all exercises.



1. Bereza-Jarociński B., Szomański B.: Inżynieria oprogramowania. Jak zapewnić jakość tworzonym aplikacjom, Wydawnictwo, Helion, 2009 (in Polish).2. Daoust N.: UML Requirements Modeling For Business Analysts, Technics Publications, 2012.3. Graessle P., Baumann H. and Baumann P.: UML 2.0 in Action: A project-based tutorial, Packt Pub, 2005.4. Podeswa H.: UML For The IT Business Analyst, Course Technology Ptr, 2005.

OPTIONAL READING:-

REMARKS:


M O D E L I N G AN D S I M U L AT I O N O F D I G I T AL S Y S T E M SM O D E L I N G AN D S I M U L AT I O N O F D I G I T AL S Y S T E M S

Course code: 06.0-WE-I-JMSC-PS42_ISM_S1SType of course: optional

Entry requirements: Digital system design, principles of programming, computer architecture.


Director of studies: Dr. Marek Węgrzyn

Name of lecturer: Dr. Marek Węgrzyn


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 30 2

V

Grade

Class


Seminar

Project

COURSE CONTENTS:Introduction to modeling of Digital Systems in Hardware Description Languages (HDLs). VHDL. Structure of models: entity, architectures, configuration. Levels of models. Concurrent statements (signal assignments, blocks, concurrent calls of procedures and functions). Processes, sensitive lists. Processes’ synchronization. Behavioral and structure architectures. Configurations. Constants, signals and variables. Procedures and functions. Delays. Attributes. Packages. Libraries. Records, arrays, files. Text in VHDL. Testbenches.Verilog. Modules. Concurrent statements, continuous assignments. always and initial statements. Procedural assignments. Procedural statements. Behavioral and structure models. Constants, wires and variables. Delays modeling. Multi-value logic. CMOS transistors modeling. Gates and buffers. UDP. Tasks and functions. Text objects in Verilog.Synthesis of digital systems. Modeling of automata. Delays (SDF files). Timing simulation. Back-annotation. Introduction to SystemVerilog. Hardware/Software co-simulation.

LEARNING OUTCOMES:Skills and competence in: modeling, simulation and synthesis of digital systems using Hardware Description Languages (HDLs).

ASSESSMENT CRITERIA:Lecture - pass test.


Laboratory - positive marks for all exercises.


1. Bergeron J.: Writing Testbenches using SystemVerilog, Springer, New York, 2006.2. Cohen B.: VHDL Coding Styles and Methodologies, Kluwer Academic Publishers, Second Printing, 1996.3. IEEE Std 1364-2001: IEEE Standard Verilog Hardware Description Language, IEEE, Inc., New York, USA.4. Palnitkar S.: Verilog HDL: A Guide to Digital Design and Synthesis, Prentice Hall, 1996.5. Skahill K.: VHDL for Programmable Logic, Addison-Wesley Publishing, 1996.

6. Zwoliński M.: Digital System Design with VHDL, 2nd ed., Pearson Education, London, 2004.

OPTIONAL READING:-

REMARKS:


http://www.pearsoneduc.com/book.asp?prodID=100000000003289&d=CM

D AT A S AF E T Y AN D C R Y P T O G R AP H YD AT A S AF E T Y AN D C R Y P T O G R AP H Y

Course code: 11.3-WE-I-BDIEK-PS43_ISM_S1S Type of course: optional

Entry requirements: Basics of programming (Pascal or C/C++), digital circuits (but not obligatory)


Director of studies: Dr. Remigiusz Wiśniewski

Name of lecturer: Dr. Remigiusz Wiśniewski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



4

Lecture 15 1

V

Grade

Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:Introduction: Fundamentals of cryptography and data safety, cryptosystems, basics of encryption and decryption, classic cryptography (transposition ciphers and substitution ciphers; Caesar cipher, Vigenère cipher, XOR, etc.). Implementation of the basic algorithms in programming languages.Symmetric-key algorithms: Key management, block ciphers (DES, AES, Blowfish) and stream ciphers (RC4). Implementation in programming languages (C, C++, Java, Assembler, Pascal). Hardware implementation (with programmable devices - FPGAs).Asymmetric-key algorithms: Public and private keys, hash functions. Main protocols and cryptosystems (Diffie-Hellman, RSA, SHA, MD5, etc.). Implementation in programming languages (C, C++, Assembler, Pascal). Hardware implementation (with programmable devices - FPGAs).Digital signature: Fundamentals of digital signature, safety and authentication, smartcards.Cryptanalysis: Main goals of cryptanalysis. Weakness of particular cryptosystems. Data safety. Debugging of computer applications and programs.Data security and protection of applications: Fundametals of data protection of programs and applications (based on MS Windows operation system). Processes management and debugging. Software debuggers and kernel mode debuggers.


LEARNING OUTCOMES:Basic knowledge and competence in data safety (data protection, digital signature and smartcards security), basic knowledge of cryptosystems and cryptology (cryptography and cryptanalysis), as well as practical implementation of cryptographic algorithms: software (Pascal, C/C++, Java, etc.) and hardware (FPGAs) .

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.Project – the main condition to get a pass are sufficient marks for all projects conducted during the semester.


1. Stinson D.R., Cryptography: Theory and Practice, WNT, Warsaw, 2005.2. Schneier B., Applied cryptography. WNT, Warsaw, 2002.3. Karbowski M., Basics of cryptography, Helion, Warsaw, 2005 (in Polish)4. Aho A. V., Hopcroft J. E., Ullman J. D., Design & Analysis of Computer Algorithms. HelionWarsawa,2003.5. Maxfield C.: The Design Warrior’s Guide to FPGAs. Devices, Tools and Flows. Elsevier, Amsterdam, 2004.

OPTIONAL READING:-

REMARKS:


C O M P U T E R S C I E N C E G R O U P P R O J E C TC O M P U T E R S C I E N C E G R O U P P R O J E C T

Course code: 11.3-WE-I-GPI-PS44_ISM_S1S Type of course: obligatory



Director of studies: dr inż. Anna Pławiak-Mowna

Name of lecturer: dr inż. Anna Pławiak-Mowna


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture

VI

Class

Laboratory

Seminar

Project 60 4 Grade

COURSE CONTENTS:Topics of projects are agreed with entrepreneurs from the regional IT sector. As part of the project, students will learn theoretical and practical aspects of the following issues:- The roles of project participants- The implementation stages of the project- Scheduling and job accounting- Solving problems and conflicts- Review and verify the progress of the task- The implementation of an IT project- Verification of the results, analysis of mistakes, discussion methods of remedial.

LEARNING OUTCOMES:Skills and competences in: creating student's own work schedule and the team work schedule; evaluating and reviewing the progress of the tasks, analyzing mistakes and corrective methods; applying techniques and tools of project management. Student is aware of the aspect of taking up roles in the project .

ASSESSMENT CRITERIA:Project – the main condition to get a pass are sufficient marks for all exercises conducted during the semester.



1. Kerznel H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling, Wiley, ISBN-10: 0470278706, 2009.2. Verzuh E.: The Fast Forward MBA in Project Management (Portable Mba Series), Wiley, ISBN-10: 0470247894, 2008.3. Cohn M.: Agile Estimating and Planning, ISBN-10: 0131479415, Prentice Hall, 2005.

4. Górski J.: Inżynieria oprogramowania w projekcie informatycznym, Mikom, Warszawa, 2000

5. Szyjewski Z.: Metodyki zarządzania projektami informatycznymi, Mikom, Warszawa,2004

6. Wróblewski P.: Zarządzanie projektami informatycznymi dla praktyków, HELION, Gliwice, 2005

OPTIONAL READING:-

REMARKS:


D I G I T AL P R O C E S S I N G O F V I S U AL D AT AD I G I T AL P R O C E S S I N G O F V I S U AL D AT A

Course code: 11.3-WE-I-CPIKP_PSW_B41_ISM_S1S Type of course: optional



Director of studies: Wojciech Zając PhD

Name of lecturer: Wojciech Zając PhD


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 15 1

V

Class

Laboratory 30 2

Seminar

Project 15 1

COURSE CONTENTS:Sampling, digital-analogue conversion. Basic types of digital signals. Ambiguity of digital signal. Filtering. Time-domain analysisDiscrete convolution. Fourier series. Fourier transform. Frequency-domain analysis. DCT and DWT transformsDigital representation of an image. Collecting the image data. Visual data detectors.MatLab environment. Features, extension packsImage processing modelling in Matlab. Simple transformations. Filtering, convolution. Image processing: filtering, transformations.Modelling of the image processing system. Decorelation, quantisation. Discrete Cosine Transform.Discrete Wavelet Transform.

LEARNING OUTCOMES:Competence and understanding of principles of digital processing of visual data.

ASSESSMENT CRITERIA:Lecture and laboratory – written test.Project - report on a project.



1. R.G. Lyons, Understanding Digital Signal Processings. Prentice Hall, 2004.2. S. W. Smith., The Scientist and Engineer's and Guide to Digital Signal Processing, California Technical Publishing, 1997.3. M. Weeks, Digital Signal Processing Using Matlab and Wavelets, Infinity Science Press, 2006.

OPTIONAL READING:-

REMARKS:


P R O G R AM M I N G O F B U S I N E S S AP P L I C AT I O N SP R O G R AM M I N G O F B U S I N E S S AP P L I C AT I O N S

Course code: 11.3-WE-I-PAB-PSW_B41_ISM_S1S Type of course: optional

Entry requirements: Basics of computer programming


Director of studies: Dr Jacek Bieganowski

Name of lecturer: Dr Jacek Bieganowski


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



6

Lecture 15 1

1

Grade

Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:Business application – features, classification, modeling. Development of business applications and processes. Tools for development of business applications. Usage of languages and environments: PHP, XML, XSLT, DTD, JS, CSS, AJAX, .NET, JAVA, UML and Eclipse in modeling and development of business applications. Accessing relational databases.

DISCRETE WAVELET TRANSFORMLEARNING OUTCOMES:Basic knowledge and competence in design of business applications. Application of proper design method, programming environment and language to specific problem. Ability to access data from relational databases.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.Project – the main condition to get a pass are sufficient marks for all projects conducted during the semester.



1. Beynon-Davies P.: Information Systems Development: An Introduction to Information Systems Engineering, Palgrave Macmillan, 1998.

2. Bobzin H, McCammo K.,Tyagi S., Core Java Data Objects, Prentice Hall, 2003.3. Graham I., O'Callaghan A., Wills A.: Object-oriented methods: principles & practice, Addison-

Wesley, 2000.4. Cockburn A.: Writing Effective Use Cases, Addison-Wesley Professional, 2000.

OPTIONAL READING:-

REMARKS:


C O M P U T E R S Y S T E M S AD M I N I S T R AT I O NC O M P U T E R S Y S T E M S AD M I N I S T R AT I O N

Course code: 11.3-WE-I-ASI-PSW_C45_ISM_S1S Type of course: optional

Entry requirements: Databases, Database Management Systems


Director of studies: Dr. Artur Gramacki

Name of lecturer: Dr. Artur Gramacki


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



5

Lecture 15 1

VI

Grade

Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:

Preliminary information. Database management systems (DBMS) as the complex computer /information systems. Hardware and software considerations, versions, patches, technical support, documentation. Four different administration specializations: network administrator, systems administrator, database administrator, application administrator and their coexistence.Pre installation tasks. Setting up the environment. Overview of the installation process. Installation methods (manual or using response files), software editions and product options. Installing and checking the operating system requirements. Checking the secure network setup. Creating required operating systems groups, users, file systems. Installation. Accessing the installation software. Extracting the installation files. Mounting appropriate storage systems. Choosing the required options, setting up startup initial parameters, physical data structures, final installation process. Post installation tasks. Downloading and installing patches. Creating first backups. Configuring network services. New database considerations, designing and creating the target database. Choosing the backup strategies. Securing and inspecting the new installation.Main administration tasks. Patching and backing up the system. Establishing recovery policies. Controlling the physical and logical database structures. Monitoring users and system activities, auditing. Managing user accounts, user privileges, user and system roles. SQL tuning. RDBMS tuning.


LEARNING OUTCOMES:Engineering skills in administering of a selected computer database system

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises. Project – the main condition to get a pass is scoring sufficient mark for an individual project given (design, implementation, testing).


1. Oracle Linux Guides.2. Oracle Documentation: Security Guide 3. Oracle Documentation: DBA4. Oracle Documentation: Performance Tuning Guide5. Oracle Documentation: Administrator's Guide(current versions available at http://www.oracle.com/technetwork/indexes/documentation/index.html)

OPTIONAL READING:-

REMARKS:


http://www.oracle.com/technetwork/indexes/documentation/index.html

D AT A W AR E H O U S E AN D D AT A M I N I N GD AT A W AR E H O U S E AN D D AT A M I N I N G

Course code: 11.3-WE-I-WHDIBW-PSW_C45_ISM_S1S Type of course: optional

Entry requirements: Databases, Database Management Systems


Director of studies: Dr. Artur Gramacki

Name of lecturer: Dr. Artur Gramacki


Number of

teach ing

hours per

semester

Number o f

teach ing

hours per

w eek

Semester


for a course

Number of ECTS



5

Lecture 15 1

VI

Grade

Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:Data warehouse. Main concepts and architectures. Business Intelligence. Analytical reports. Information Cockpits. ROLAP (Relational Online Analytical Processing) and MOLAP (Multidimensional Online Analytical Processing) modeling. HOLAP (Hybrid Online Analytical Processing) ETL processes (extraction, transformation, loading). Data cleaning. Data integration. Data transformation. Data reduction. OLAP cubes. Facts and dimensions tables. Star and snowflake models. Hierarchies. Refreshing the data warehouse. SQL extensions for data warehouses, analytical functions. Indexing, partitioning and query optimization. Materialized views.Data mining. Main concepts, tasks and algorithms. Associate rule mining and basic algorithms (A-Priori, FP-Growth). Sequence mining and basic algorithms (GSP, PrefixSpan). Classification problem and basic algorithms (ID3, C4.5, C5.0, CART, Naive Bayes classifier, neural networks). Clustering problem and basic algorithms (K-means, C-means, K-medoids, PAM, CLARA, CLARANS). Text mining (preprocessing, stop list, stemming, term-document matrix TDM, TF-IDF structures - Term Frequency Inverse Document Frequency, Latent Semantic Indexing - LSI, Singular Value Decomposition - SVD). Web mining (Page Rang, Hubs & authorities).

LEARNING OUTCOMES:Engineering skills in design and implementation of data warehouses and data mining structures and algorithms.


ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises. Project – the main condition to get a pass is scoring sufficient mark for an individual project given (design, implementation, testing).


1. Hand D. J., Mannila H., Smyth P.: Principles of Data Mining, MIT Press, 2000. 2. Larose D.: Data Mining Methods and Models, John Wiley & Sons, 2006.3. Larose D.: Discovering Knowledge in Data: An Introduction to Data Mining, John Wiley & Sons, 2005.4. Jarke M., Lenzerini M., Vassiliou Y., Vassiliadis P.: Fundamentals of Data Warehouses, Springer-Verlag, 2000.

OPTIONAL READING:-

REMARKS:


DIGITAL SYSTEMS TESTING

Course code: 06.0-WE-I-DSC-PSW_D46_ISM_S1S

Type of course: optional

Entry requirements: Digital circuits, digital systems modeling language

Language of instruction: Polish

Director of studies: Dr Michał Doligalski

Name of lecturer: Dr Michał Doligalski

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester



ECTS credits allocated

Full-time studies

5

Lecture 15 1

VI

Class

Laboratory 30 2

Seminar

Project 15 1

COURSE CONTENTS:Construction and operation of diagnostic tools: survey of the construction, operating principles and measurements performing by means of digital diagnostics apparatus like: Digital oscilloscopes, logical analyzers, arbitrary generators. Use an oscilloscope and arbitrary generator to generate analogue and digital waveforms on the basis of waveforms recorded using an oscilloscope. Interfaces of the measuring apparatus (RS-232, RS-485, GPIB, USB). Examination of selected parameters of digital circuits: Using a digital oscilloscope to measure time parameters of digital circuits (TTL, CMOS, FPGA) include: propagation time, rise time, fall time, setup time. Electrical parameters including current, voltage. Margin of disruptions and faults tolerant. Boundary conditions of digital circuits work. Diagnosis of software - hardware digital systems: verification of digital systems output signals by means of digital oscilloscope. Logic analyzer for the analysis of digital systems. Trigger algorithms based on changes or values of signals. The use of simulation results to verify on the prototype stage. Diagnostic software: Use specialized software in the diagnosis process of digital systems (FPGAView, ChipScope Pro). JTAG interface for the analysis of digital systems. FPGAView software and use an digital oscilloscope and / or logic analyzer. Embedding of test cores inside the embedded systems (ChipScope Pro). Diagnosis of DSP systems: Arbitrary signal generator and digital mixed signal oscilloscope for DSP systems testing.


LEARNING OUTCOMES:Skills and competences in diagnostic techniques of the microinformatics systems embedded in FPGA devices. Knowledge of operation and ability to use of digital diagnostic equipment (digital oscilloscope, logic analyzer). Knowledge of the principles for estimating and eliminating measuring error and the ability to choose a diagnostictool for testing the microinformatic system. Ability to increase the reliability of microinformatics systems in stage of testing. Knowledge of protocols and the ability to serial buses debug (I2C, SPI, RS-232, CAN).

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient mark for test at the end of the semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.Project – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.


1 M. Abramovici, M. A. Breuer, and A. D. Friedman, Digital System Testing and Testable Design, IEEE Press, New York, 1990

2 N. K. Jha, S. Gupta, Testing of Digital Systems, Cambridge University Press, 2003

3 J. Pieńkos, J. Turczyński: TTL ICs in digital systems. WKiŁ, Warszawa, 1986. (in Polish)

4 T. Łuba, Programmable signal and information processing systems. WKiŁ 2008. (in Polish)

5 A. Kamieniecki A modern oscilloscope design and measurements. BTC, Legionowo, 2009. (in Polish)

6 S. Tumański, Test & Measurement, WNT, 2007. (in Polish)

M. Zwoliński: Design of digital circuits using VHDL, 2 ed., WKŁ, Warszawa, 2007. (in Polish)

OPTIONAL READING:-

REMARKS:


INFORMATION SYSTEMS TESTING

Course code: 06.0-WE-I-TSI-PSW_D46_ISM_S1S


Entry requirements: Digital circuits, digital systems modeling language


Director of studies: Michał Doligalski, Ph.D.

Name of lecturer: Michał Doligalski, Ph.D.

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

5

Lecture 15 1

VI

Grade

Class

GradeLaboratory 30 2

Seminar

GradeProject 15 1

COURSE CONTENTS:The basic principles of software testing, test place in the computer engineering and software engineering. Inspection of the source code and the development of test cases. Testing of individual modules, integration testing. Functional, system, acceptance and installation test. Extreme testing. Web applications test. Construction and operation of diagnostic tools: survey of the construction, operating principles and measurements performing by means of digital diagnostics. Use an oscilloscope and arbitrary generator to generate analogue and digital waveforms on the basis of waveforms recorded using an oscilloscope. Interfaces of the measuring apparatus (RS-232, RS-485, GPIB, USB). Theoretical basis for compliance testing (compliance), tests automation. Examination of selected parameters of digital circuits: Using a digital oscilloscope to measure time parameters of digital circuits (TTL, CMOS, FPGA) including time and frequency parameters. Boundary conditions of digital circuits work. Diagnosis of software - hardware microinformatics systems: Logic analyzer for the analysis of digital systems. Trigger algorithms based on changes or values of signals. The use of simulation results to verify on the prototype stage. Extension of the digital microsystems of the block generator for testing. Serial bus debugging (I2C, SPI, RS-232, CAN). Analysis of transmission in computer networks. Diagnostic software: the use of specialized software in the diagnosis process of software and hardware systems (FPGAView, ChipScope Pro, JUnit). JTAG interface


for the analysis of digital systems. Embedding of test cores inside the embedded systems (ChipScope Pro).

LEARNING OUTCOMES:Skills and competences in diagnostic techniques of the software and embedded systems. Knowledge of operation and ability to use of digital diagnostic equipment. Knowledge of the principles for estimating and eliminating measuring error and the ability to choose a diagnostic tool for testing the microinformatic system. Ability to increase the reliability of microinformatics systems in stage of testing. Knowledge of preparing, performing and monitoring of test.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient mark for test at the end of the semester.

Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.

Project – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.


1. C. Kaner , J. Bach , B. Pettichord, Lessons Learned in Software Testing, John Wiley & Sons, New York, 2002.2. E. Dustin , T. Garrett , B. Gauf, Implementing Automated Software Testing: How to Save Time and Lower Costs While Raising Quality, Pearson Education, 2009.3. Wiszniewski B., Bereza-Jarociński B.: Theory and practice of software testing. Wydawnictwo PWN, 2006.4. M. Abramovici, M. A. Breuer, and A. D. Friedman, Digital System Testing and Testable Design, IEEE Press, New York, 1990.5. N. K. Jha, S. Gupta, Testing of Digital Systems, Cambridge University Press, 2003.6. A. Kamieniecki, A modern oscilloscope design and measurements. BTC, Legionowo, 2009. (in Polish).7. S. Tumański, Test & Measurement, WNT, 2007. (in Polish) .

OPTIONAL READING:-

REMARKS:


OPERATIONAL SYSTEM LEVEL PROGRAMMING

Course code: 11.3-WE-I-PPSO-PSW_E47_ISM_S1S


Entry requirements: Fundamentals of programming, programming in C/C++ languge


Director of studies: Dr Grzegorz Łabiak

Name of lecturer: Dr Grzegorz Łabiak

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 15 1

VI

ExamClass

Laboratory 15 1Grade

Seminar

Project 15 1 Grade

COURSE CONTENTS:Windows operational system architecture.Application Programming Interface – API functions.Program environment under operational system conditions: application, event, message queue.Program scheme under operational system conditions: window function, message, message loop.WM_PAINT message handling, client area, graphic device context.Graphic device context objects: pen, brush, bitmap, font.Resources. Creation and using resources: menu, dialog box, writing text strings.Menu dynamic creation and its handling.Creation and programming own dialog boxes.Static libraries (*.lib) and dynamic libraries (*.dll).OpenGL library.DirectX technology.


LEARNING OUTCOMES:After completion of this course students will posses skills in implementing of low-level programming using Windows API functions.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.Project – the main condition to get a pass is to carry out a program assignment of moderate complexity


1. Charles Petzold, Programming Windows, 5th edition, Microsoft Press, 1998.2. Roland Wacławek, Windows od kuchnik, Help, 1993.3. Wiktor Zychla, Programowanie pod Windows, wersja 0.99, Instytut Informatyki Uniwersytetu Wrocławskiego, Wrocław 2003.4. Wiktor Zychla, Programowanie pod Windows. Zbiór zadań, wersja 0.3, Instytut Informatyki Uniwersytetu Wrocławskiego, Wrocław 2006.5. Dave Shreiner, OpenGL(R) Programming Guide: The Official Guide to Learning OpenGL(R), Version 3.0 and 3.1 (7th edition), Addison-Wesley, lipiec 2009.6. Robert Krupiński, Aplikacje Direct3D, Helion 2002.7. Jeffrey Richter, Advanced Windows, Microsoft Press, 1997

OPTIONAL READING:

-

REMARKS:


DESIGN OF MULTITIER WEB SYSTEMS

Course code: 11.3-WE-I-PWSI-PSW_E47_ISM_S1S




Director of studies: Dr Tomasz Gratkowski

Name of lecturer: Dr Tomasz Gratkowski

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 15 1

VI

ExamClass

Laboratory 30 1

GradeSeminar

Project 15 1Grade

COURSE CONTENTS:Presentation tier: Getting Started with Web Applications. Technologies for creating dynamic Web sites and rich internet applications (RIA).Web Services: Introduction to Web Services. Building Web Services and Web Services clients. Using of Simple Object Access Protocol (SOAP).A Component Tier: A Component container. What Is a Session Bean. What Is a Message-Driven Bean. Building, Packaging, Deploying, and Running the component’s application.Data Tier: Object/relational data mapping. Data model on all tiers in multi-tier system.Additional services: Introduction to Security in the Multitier Systems. Design patterns for multi-tier systems.

LEARNING OUTCOMES:Design and programming skills in multi-tier systems.Integration of heterogeneous systems.

Foundational knowledge and skills required to build business application.


ASSESSMENT CRITERIA:Lecture – in order to get a credit it is necessary to pass all tests (oral or written) carried on at last once per semester Laboratory – in order to get a credit it is necessary to earn positive grades for all laboratory works defined by tutor

PROJECT – POSITIVE MARK OF THE PROJECTRECOMMENDED READING:

1. Eric Jendrock, Jennifer Ball, Debbie Carson, Ian Evans, Scott Fordin, Kim Haase: The Java EE 5 Tutorial For Sun Java System Application Server 9.1; October 2008.

2. Deepak Alur, John Crupi, Dan Malks: Core J2EE Patterns: Best Practices and Design Strategies (2nd Edition); Prentice Hall, 2003.

3. Sameer Tyagi, Keiron McCammon, Michael Vorburger, Heiko Bobzin: Core JAVA Data Objects; Prentice Hall, 2003.

4. Bryan Basham, Kathy Sierra, Bert Bates: Head First Servlets and JSP: Passing the Sun Certified Web Component Developer Exam; O'Reilly Media; 2008.

5. William Crawford, Jonathan Kaplan: J2EE Design Patterns; O'Reilly Media; 2003.

6. Joel Scamray, Mike Shema: Hacking Exposed Web Applications, 3nd Ed.; McGraw-Hill Osborne Media; 2010.

7. S.Graham, S.Simeonov, T. Boubez, D. Davis, G. Daniels: Building Web Services with Java: Making Sense of XML, SOAP, WSDL and UDDI; Pearson Education; 2001.

8. Alan Monnox: Rapid J2EE Development: An Adaptive Foundation for Enterprise Applications; Prentice Hall; 2005.

9. Matthew MacDonald: Beginning ASP.NET 4.5 in C#; Apress; 2012.

10. The C# Station ADO.NET Tutorial: http://www.csharp-station.com/Tutorials/AdoDotNet/

11. Moroney L.: Microsoft® Silverlight® 4 Step by Step; Microsoft Press; 2010.

12. Beres J., Evjen B., Rader D.: Professional Silverlight 4; Wrox Press; 2010.

13. 101 LINQ Samples: http://msdn.microsoft.com/en-us/vcsharp/aa336746

OPTIONAL READING:-

REMARKS:


http://msdn.microsoft.com/en-us/vcsharp/aa336746

http://www.csharp-station.com/Tutorials/AdoDotNet/

MOBILE TECHNOLOGIES AND APPLICATIONS

Course code: 11.3-WE-I-TAM-PSW_E47_ISM_S1S




Director of studies: Dr Jacek Tkacz

Name of lecturer: Dr Jacek Tkacz

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 15 1

VI

ExamClass 15 1

Laboratory Grade

Seminar

Project 15 1 Grade

COURSE CONTENTS:Introduction into designing mobile application Preparation and setup developer environment. Emulation of mobile systems. Developing and debugging mobile applications using the emulators and physical devices. User interfaces. The design and the implementation of GUI of mobile applications. Rich Internet Applications (RIA) technology for design of mobile user interfaces. Access to data. Databases dedicated for mobile technology. Access and synchronization with external data sources. Object/relational data mapping.Exchange information between mobile application and external environment. Communications by using wireless technology: Wireless network (WiFi), BLUETOOTH. XML language as universal format of data exchange.. Web services (SOAP) technology for universal data exchange. Data serialization using JSon technology.Localization. Global Positioning System. Serial communication with internal and external GPS modules. GPS communication protocol NMEA-0183. Positioning by using WiFi and GSM information.

LEARNING OUTCOMES:Basic knowledge about available mobile technologies and competence in practical mobile application development.


ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written exam.Laboratory – the main condition to get a pass are sufficient marks for all laboratory exercises and tests conducted during the semester.Project – the main condition to get a pass are sufficient marks for individual task conducted during the semester. There is also possible, that larger tasks can be carried out in groups, but each student will be assessed individually.

RECOMMENDED READING:1. Imieliński T. Mobile Computing. KLUWER, 1996.2. Clark M. Wireless Access Networks. Wiley, 2002.3. Kumar V. “Mobile Database Systems”, John Wiley & Sons, 2006.4. Burnette E. “Hello, Android: Introducing Google's Mobile Development Platform”, 2010.5. Baddeley G. „NMEA sentence information” http://home.mira.net/~gnb/gps/nmea.html6. Nakamura K. „The Global Positioning System FAQ” http://www.gpsy.com/gpsinfo/gps-faq.txt.7. MICROSOFT MSDN http://msdn.microsoft.com/pl-pl/default.aspx8. BLUETOOTH http://www.blutooth.com9. CODEGURU http://www.codeguru.com/

OPTIONAL READING:-

REMARKS:


http://www.blutooth.com/

http://msdn.microsoft.com/pl-pl/default.aspx

http://www.gpsy.com/gpsinfo/gps-faq.txt

http://home.mira.net/~gnb/gps/nmea.html

MICROPROCESSOR CIRCUITS AND SYSTEMS

Course code: 06.5-WE-I-USM-PS40_PSI_S1S


Entry requirements: Computer architecture, principles of programming, digital system design


Director of studies: Dr. Mirosław Kozioł

Name of lecturer: Dr. Mirosław Kozioł

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

7

Lecture 30 2

V

GradeClass


Seminar

Project 15 1 Grade

COURSE CONTENTS:Microprocessor systems. Basic components of microprocessor system. Central processor unit. System buses. The role of the tri-state buffers in accessing the data bus of the system bus. Program memory. Data memory. Input-output devices. Peripherals. Microprocessor and microcontroller.Instructions. Instruction and machine cycle. Basic addressing modes. Basic groups of instructions in microcontrollers.Memories in microprocessor systems. Basic memory types. Basic memory parameters. Sample timing charts during read and write operations. Examples of memory chips used in microprocessor systems based on microcontrollers.Interfacing peripherals to the system bus. Isolated and memory mapped input-output devices. Address decoder design on the basis of middle scale digital circuits and SPLDs with examples.Handling of peripherals. Polling. Interrupt system. Direct memory access.Local serial interfaces. I2C. SPI.Information transmission between microprocessor systems. Transmission of information with and without acknowledgement. Synchronous and asynchronous transmission. Parallel and serial transmission. Their advantages and disadvantages. Serial interfaces (RS-232C, RS-485).


MCS-51 family of microcontrollers as an example of single-chip microcomputer. The most significant features of their architecture. Functional blocks. Interfacing of external program and data memory. Embedded peripheral systems i.e. timer-counters and serial interface. Interrupts. Parallel ports. Power-saving modes of operation. Programming examples of embedded peripherals in assembler and C.Basic user interface in microprocessor system. Keyboard. LED and LCD displays. Service of user interface by software.Tools aided programming and commissioning of microprocessor systems. Monitors. Hardware emulators. Simulators. In-system programming. In-application programming. Commercial and free of charge programming tools.

LEARNING OUTCOMES:Skills and competences: design and programming of microprocessor systems, their peripheral systems, user interfaces and local serial interfaces.

ASSESSMENT CRITERIA:Lecture – to receive a final passing grade student has to receive positive grade from examination.Laboratory – to receive a final passing grade student has to receive positive grades in all laboratory exercises provided for in the laboratory syllabus.Project – to receive a final passing grade student has to receive positive grades in all projects in semester.

RECOMMENDED READING:0. Godse A.P., Godse D.A.: Microprocessor, Microcontroler & Applications, Technical Publications

Pune, 2008.1. Deshmukh A.V.: Microcontrollers. Theory and Applications. Tata McGraw-Hill, 2007.

2. Huang H-W.: Embedded System Design with the C8051, Cengage Learning, 2009.

3. James M.: Microcontroller Cookbook. PIC & 8051, Newnes, 2001.

OPTIONAL READING:-

REMARKS:


MANAGEMENT INFORMATION SYSTEMS

Course code: 11.9-WE-I-SIZP-PS41_PSI_S1S


Entry requirements: Databases, software engineering, object-oriented programming


Director of studies: Professor Wiesław Miczulski, Dr Marek Florczyk

Name of lecturer: Professor Wiesław Miczulski, Dr Marek Florczyk

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

5

Lecture 30

V

Exam

Class

Laboratory 30 Grade

Seminar

Project

COURSE CONTENTS:Introduction: The scope of Management Information Systems. Classification of Management Information Systems. Transactional and analytical information systems. Analysis and design of information flows. The lifecycle of Management Information Systems. The evolution of a Management Information Systems in Poland and worldwide. Structure of Management Information Systems –case study.Manufacturing Management Systems: Material flow in firm. Warehouse management. MRP, MRP II – methods and implementation. MRP and MRP II - software architectures and technologies. Data transmission from SCADA to Management Information Systems. Examples of MRP II systems - comparison and analysis of functions. Information Systems In Logistic: Kanban. JIT - method and implementation. SCM - Supply chain management. Architecture of Logistic Information Systems (LIS). Examples of LIS - comparison and analysis of functions.


Financial Management Information Systems: Definition – Credit side, Debit side, capital assets, statement of financial position. The flow of financial information in firm. Structure of book of account – example of implementation.Customer Relationship Management (CRM): CRM in firm, connections to other systems. CRM structure. CRM implementation.E-Business and E-Commerce, basis: B2B, B2C, C2C. Digital marketplace. History of E-Business. Statistical Data - Internet in Poland, E-Commerce in Poland. Internet Sales in Poland and worldwide.E-Business Models. E-Business Architecture (levels). The basic categories of business models: Brokerage, Advertising, Infomediary, Merchant, Manufacturer (Direct), Affiliate, Community, Subscription, Utility. E-business models by degree of functional integration and innovation. E-business models by degree of the power relationship (on the buyer or the seller side). Business and Information Architecture.The Electronic Shops: Advantages and disadvantages. Traditional and Electronic process of selling. Statistical data – clients of electronic shop. M-Business. M-Business, structure of application, Phases of E-Business systems implementation: How to choose right solution. Techniques of implementation. Planning and monitoring of implementation processes. Outsourcing of software and hardware.Internet payment methods: Macro, Mini and Micro payments. Credit card payments. E-Cash Smart Card and others. Classification of payments method for mobile systems. M-Payments. Security of payments over Internet. Internet Marketing. Customer Relationship Management and Internet. How Internet Search Engines Work. SEO (Search engine optimization). Internet and advertising – techniques, choosing, measurement of efficiency. Web Stats. Social networking services. Tools for measuring the effectiveness of marketing campaigns.

LEARNING OUTCOMES:Design and implementation of Management Information Systems and CRM Systems for small business;

ASSESSMENT CRITERIA:Lectures - Student performance may be assessed by examination.Laboratory - Student performance may be assessed by quizzes, case studies, oral reports, group discussion, written reports or presentations. The instructor reserves the option to employ one or more of these assessment methods during the course.

RECOMMENDED READING:1. Laudon K.C., Laudon J., Essentials of Management Information Systems (10th Edition), Prentice-Hall, Inc., 2012.

2. Laudon K.C., Laudon J.P.: Management Information Systems: Managing the Digital Firm, Prentice-Hall, Inc., 2007.

3. Dyché J.,: The CRM Handbook: A Business Guide to Customer Relationship Management, Addison-Wesley, 2002.

4. Kotler P.: Marketing Management, Prentice Hall; 2006.

5. Sheikh K.: Manufacturing Resource Planning (MRP II) with Introduction to ERP, SCM, and CRM, McGraw-Hill Professional, 2002

OPTIONAL READING:-

REMARKS:


COMPUTER-AIDED DESIGN

Course code: 11.9-WE-I-KWP-PS42_PSI_S1S


Entry requirements:Principles of programming, algorithms and data structures, computer architecture, experiment methodology I and II


Director of studies: Dr. Janusz Kaczmarek

Name of lecturer: Dr. Janusz Kaczmarek

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

4

Lecture 15 1

V

Class

Laboratory 30 2

Seminar

Project

COURSE CONTENTS:Basic knowledge of the virtual instruments. Basic definitions. Characteristic of integrated software environments to designing the software for virtual instruments and measurement systems.Introduction to programming in LabWindows. LabWindows overview. Basics of creating the Graphical User Interface. Generating the source code. Methods of designing programs: callback functions and event loops. Properties and programming control of GUI objects. Characteristic of library functions for analysis and processing of measurement signals. Debugging techniques. Creating and distributing executable program. Advanced programming techniques in LabWindows. Multithreading programming techniques. Using ActiveX automation: server and controller applications. Using internet programming technology. Creating measurement instrument drivers. Methods of creating reports from measurements.

Introduction to programming in LabVIEW. Concept of the graphical programming language G. Building a front panel and block diagram. Basic and composite data types. Controlling program execution with loops and structures: for, while, shift-register mechanism, case, sequence, formula node. Operations on arrays and strings. Hierarchical programming. Global and local variables. Polling and event-driven


programming models. Characteristic of library functions for analysis and processing of measurement signals. Express technology.

LEARNING OUTCOMES:Know-how and competences in the field of designing and creating the software for measurement systems with the use of specialized integrated software environments – LabVIEW and LabWindows.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises.

RECOMMENDED READING:1. Khalid S.F.: LabWindows/CVI Programming for Beginners. Prentice Hall PTR, 2000.

2. Khalid S.F.: Advanced Topics in Labwindows CVI. Prentice Hall PTR, 2001.

3. Essick J.: Hands-On Introduction to LabVIEW for Scientists and Engineers, Oxford University Press, 2012.

4. Świsulski D.: Computer measurement technique. LabVIEW programming of virtual instruments, Agenda Wydawnicza PAK, Warszawa, 2005 (in Polish).

5. Winiecki W.: Organization of computer measurement systems, Oficyna Wydawnicza Politechniki Warszawskiej, Warszawa, 1997 (in Polish)

OPTIONAL READING:-

REMARKS:


INTERNET APPLICATIONS

Course code: 1.3-WE-I-AI-PS43_PSI_S1S


Entry requirements:Principles of programming, algorithms and data structures, computer networks, databases


Director of studies: Dr. Robert Szulim

Name of lecturer: Dr. Robert Szulim

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

4

Lecture 30 2

V

GradeClass

Laboratory 30 2

GradeSeminar

Project

COURSE CONTENTS:Primary protocols and services of Internet. Description of work of protocols: TCPIP, HTTP and FTP.WWW and FTP servers. Description of work of servers, configuration and management.Client – Server Databases. Description of work, advanced server objects and designing of structures of databases. WWW Technologies. Static and dynamic technologies of designing WWW pages - review. Microsoft .NET technology. Description of basics of work of the technology. WWW forms. Description of work of mechanisms of sending data through WWW pages. Databases and WWW. Study of possibilities of building WWW pages with the access to databases. Security mechanisms. Description of problem of security of work in WWW network.


LEARNING OUTCOMES:Skills and competences in: designing of structures of databases, launching and configuring of WWW and FTP Servers, designing WWW portals with the access to databases.

ASSESSMENT CRITERIA:Lecture – the condition of passing is obtaining positive grades from oral or written tests at least once a term.Laboratory – the condition of passing is obtaining positive grades from all laboratory subjects according to the program of the laboratory.

RECOMMENDED READING:1. Ullman Jeffrey D., Widom Jennifer , A First Course in Database Systems, Pearson Prentice Hall, 2008.2. Stephens R., Start Here! Fundamentals of Microsoft® .NET Programming, Microsoft, 2011.

3. Lei L., Matthews C., Parziale L., Rosselot N., Davis C., Forrester J., Britt D., TCP/IP Tutorial and Technical Overview, An IBM Redbooks publication, 2006.

4. Hart C., Kaufmann J., Sussman D., Ulmann C., Beginning ASP.NET 2.0, Wiley Publishing, 2006

OPTIONAL READING:-

REMARKS:


INDUSTRIAL COMPUTER NETWORK

Course code: 11.9-WE-I-KSP-PS44_PSI_S1S


Entry requirements: -


Director of studies: Dr Adam Markowski

Name of lecturer: Dr Adam Markowski

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 30 2

VI

GradeClass


Seminar

Project 15 1 Grade

COURSE CONTENTS:The evolution of measuring – controlling systems. The architecture of computer industrial networks. Topology of industrial networks. Transmission media.Access methods to a medium in industrial networks: Master-Slave, Token-Passing, CSMA and TDMA. Standard communication protocols. Characteristics of standard communication protocols: PROFIBUS, MODBUS, CAN, LonWorks, INTERBUS-S, ASI and HART.Industrial Ethernet. Characteristics of selected solutions: PROFINET, EtherCAT and Powerlink. Internet technologies in computer industrial networks. Dedicated WWW servers. Analysis of communication efficiency and time parameters of selected protocols. Time determination in industrial networks. Industrial network components. Converters, amplifiers, concentrators, nodes, routers, bridges and gates. Integration of industrial networks with local computer networks.


Utility programs for creating intelligent devices operating in industrial network nodes. Software of serial digital interfaces for data exchange with industrial automation devices. Integration and management of industrial networks. Methods of industrial network integration.Industrial network analysers and testers. Properties of industrial networks analysers and testers.

Standards engineering of industrial network environments. Specifics of application areas for particular standards. Elements of industrial network designing.

LEARNING OUTCOMES:Skills and competences in: creating simple applications for cooperation with measuring converter and executive systems equipped with serial communication interfaces, carrying out an analysis of a given project of a measuring – controlling system with industrial network segments related to the determination of communication properties of such a system, selection of industrial network components for a given industrial facility, the determination of communication properties of a proposed solution.

ASSESSMENT CRITERIA:Lecture – the credit is given for obtaining a positive grade in written or oral tests carried out at least once in the semester.Laboratory – the credit is given for positive grades in all laboratory exercises to be carried out according to the laboratory syllabus.Project – the credit is given for positive grades in project exercises to be carried out according to the syllabus.

RECOMMENDED READING:[1] Mielczarek Wojciech: Serial digital interfaces, Helion, Gliwice, 1999 (in Polish)[2] Nawrocki W.: Computer measuring systems. WKŁ, Warszawa 2002 (in Polish)[3] Sacha K.: Local Profibus networks. MIKOM, Warszawa 1998 (in Polish)[4] Winiecki W.: The organisation of computer measuring systems. Oficyna Wydawnicza Politechniki Warszawskiej WPW, Warszawa 1997 (in Polish)[5] Lesiak P., Świsulski D.: Examples of computer measuring methods, Agenda Wydawnicza PAK, Warszawa, 2002 (in Polish)[6] Nawrocki W.: Distributed measuring systems, WKŁ, Warszawa 2006 (in Polish)[7] Kwiecień R.: Computer systems for industrial automation, Helion, Gliwice 2012 (in Polish)[8] Mackay S., Wright E., Reynders D., Park J.: Practical Industrial Data Networks: Design, Installation and Troubleshooting, Newnes, 2004[9] Reynders D., Mackay S., Wright E.: Practical Industrial Data Communications: Best Practice Techniques, Butterworth-Heinemann, 2004

OPTIONAL READING:-

REMARKS:


SIGNAL PROCESSING TECHNIQUES

Course code: 06.0-WE-I-TPS-PS45_PSI_S1S


Entry requirements: Experiment methodology I and II, microprocessor systems


Director of studies: Dr Leszek Furmankiewicz

Name of lecturer: Dr Leszek Furmankiewicz

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 30 2

VI

ExamClass


Seminar

Project

COURSE CONTENTS:Signals, signals processing, signal converters-transducers, circuit of signal conversion. Basic definitions. Signals classifications. Structures of signal converters. Signal description in the time and in the frequency domain. Basic parameters of deterministic signals. Description of stochastic signals. Fourier series development of periodical signals. Spectrum of periodic and aperiodic signals.Static and dynamic properties of measuring transducers. Static parameters. The methods of description the transducer static and dynamic parameters: transmittance, time characteristics and frequency characteristics. Dynamic properties of ideal and real transducers. Initial signals conversion Amplifing and filtering. Operational amplifiers in initial signals conversion circuit. Analog filters. Mathematical models of passive and active analog filters. Characteristic of analog-to-digital conversion process. Sampling. Sampling frequency selection. Quantization. Coding.


Analog- to-digital and digital-to-analog conversion. Properties of basic types of analog-to-digital and digital-to-analog converters. Parameters of analog-to-digital and digital-to-analog converters. Chosen examples of analog-to-digital and digital-to-analog applications. Basic operation of digital signal processing. Linearization and correction of transducer static characteristics. Discrete Fourier Transformation and its basic properties. Application of Discrete Fourier Transformation to spectral analyses of signals. Digital filtering. Finite impulse response filters (FIR). Infinite impulse response filters (IIR).Chosen problems of signal conversion circuit designing. Disturbances and noises in a signal conversion circuits. Sources and kinds of disturbances. Basic methods of disturbance reducing. Sources and kinds of noises. Signal to noise ratio. Methods of improvement signal to noise ratio.

LEARNING OUTCOMES:Student can characterize and describe the signals and measuring transducers in the time domain and in the frequency domain. Is able to characterize the properties of a typical blocks of signal processing circuit. Student knows the principle of work of analog to digital converters and digital to analog converters. Student can measure the basic parameters of signals and of components present in analog and digital signal conversion circuit. Is able to do cooperative measuring experiments.

ASSESSMENT CRITERIA:Lecture - scoring sufficient marks for written examination Laboratory - scoring sufficient marks for all laboratory exercises

RECOMMENDED READING:1. Kulka Z. i inni: Analog to Digital and Digital to Analog Converters, WNT, Warsaw, 1987 (in Polish).2. Lyons R. G.: Introduction to Digital Signal Processing, WKŁ, Warsaw, 1999 (in Polish).3. Szabatin J.: Basic Signal Theory, WKŁ, Warsaw, 2003 (In Polish).4. Tietze U., Schenk Ch.: Semiconductors Circuits , WNT, Warsaw, 2001(in Polish).5. Tumański S.: Measuring Technique, WNT, Warsaw, 2007 (in Polish).6. Horowitz P., Hill W.: The Art of Electronics, Cambridge University Press, New York, 1989.7. Plassche, R.J. van de,: Integrated Analog-to-digital and Digital- to-Analog Converters, Kluwer Academic Publishers, Boston/ Dordrecht/ London, 1994.8. Sydenham P. H. (Ed.): Handbook of Measurement Science – Vol - 1: Theoretical Fundamentals, John Wiley & Sons, Chichester,1991.

OPTIONAL READING:-

REMARKS:


W I R E L E S S N E T W O R K SW I R E L E S S N E T W O R K S

Course code: 06.0-WE-I-SB-PS46_PSI_S1S


Entry requirements: Computer networks I and II.-


Director of studies: dr inż. Emil Michta

Name of lecturer: dr inż. Emil Michta


Nu

mb

er o

f te

ach

ing

ho

urs

p

er s

emes

ter

Nu

mb

er o

f te

ach

ing

ho

urs

p

er w

eek

Sem

este

r


for a course

Number of ECTS



6Lecture 30 2VI

Grade

Project 15 1 Grade

COURSE CONTENTS:Introduction to wireless networks: Wireless transmission media. Wireless networks classification. Systems of digital wireless transmission. Setting of radio communication systems parameters. Wireless networks WLAN: WLAN networks topology. WLAN networks IEEE 802.11a/b/g/n. Media access control in WLAN networks. WLAN physical layer: Structure and parameters of physical layer. Physical layer technologies. MAC layer: Frame format. MAC layer functions. Connections of wireless stations. Active and passive scanning. Authorization. Association. Hidden nodes problem – RTS/CTS. Access Points: Types of access points. Functioning modes of access points. Access point configuration. Wireless networks WPAN: Bluetooth, ZigBee and UWB networks. Functioning and application areas. Internet access wireless networks: WiMax networks. Security in wireless network: Protection of wireless stations. Access point security. SSID. Filtering. WEP protocol and authorization. Authorization schema - IEEE 802.1x. AES coding. Wireless VPN networks. Mobility in wireless networks: Characteristic of roaming. Roaming on layer 2. Roaming on layer 3 – mobile IP. Wireless network design: Basic rules of WLAN networks design. Design of capacity and distant networks. WLAN networks analysis. Upgrading of WLAN networks performance. Intelligent wireless networks.

LEARNING OUTCOMES:Abilities and competence: configuration of the access points and wireless client stations, design WLAN and WPAN wireless networks, hot-spots design, implementation of security methods in WLAN.

ASSESSMENT CRITERIA:Lecture – in order to get a credit it is necessary to pass all tests (oral or written) carried on at least once per semester.


Project - in order to get a credit it is necessary to earn positive grades for all project tasks defined by tutor


1. Poter B., Fleck B.: 802.11 Security. Helion. Gliwice, 2004.2. Roshan P., Leary J.: LAN wireless networks. Mikom, Warszawa, 2004.3. Raghavendra C.S., Sivalingam K.M., Znati T.: Wireless Sensor Networks, Kluwer Academic Publisher, 2005.4. Zhao F., Gibas L.: Wireless Sensor Networks. An Information Processing Approach, Elsevier, 2004.

OPTIONAL READING:

1. Miller A.B., Bisdikian Ch.: Bluetooth, Helion. Gliwice, 2004.2. Alliance. ZigBee Specification v.1.1 2007.

REMARKS:


SOFTWARE FOR MEASUREMENT AND CONTROL EQUIPMENT

Course code: 11.9-WE-I-OSPS-PS47_PSI_S1S


Entry requirements:Principles of programming, experiment methodology, computer network, internet applications


Director of studies: Dr. Leszek Furmankiewicz

Name of lecturer: Dr. Leszek Furmankiewicz

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

4

Lecture 15

VI

Grade

Class

Laboratory 30Grade

Seminar

Project

COURSE CONTENTS:Measurement and control systems - introduction. Classification of measuring systems. Structure and organization of measuring and control systems. Algorithm of measuring system. Selection of programming language and computer aided design tools. Data transmission standards in measuring systems. Definition and classification of the interface. Interfaces used in measuring systems. Serial interfaces: RS - 232, RS - 422, RS - 485, Serial interface programming. Parallel interface IEEE 488: principal tags of IEEE 488 standard, bus of the interface, state of work reporting. IEEE 488.2 standard. IEEE 488.2 controller programming and IEEE 488.2 driver functions.Data acquisition cards. Classification and basic functional blocks of the data acquisition cards. Data acquisition cards programming, description of the software functions. SCPI standard. SCPI device model, structure of commands, trigger system, status system. Profile of commands for example devices. Software development environments for measuring and control systems programming. Software development environments: LabWindows, LabView, Agilent Vee. VISA I/O library. Software drivers VXIplug&play. IVI drivers.


Virtual measurement instruments. The definition, structure and basic tags of virtual instruments. Virtual instruments programming. Examples of virtual instruments.Programmable Automation Controllers (PAC). PAC in measuring and control systems as an example of B&R systems. Hardware and software architecture of PAC. Automation Studio - integrated software development environment. Process visualization in PAC.Internet technologies in measurement and control systems. Embedded WWW servers. Hardware and software profiles of chosen embedded WWW servers.

LEARNING OUTCOMES:Skills and competences in the range of the: understanding of functioning of the measurement and the control systems, creating software for measuring systems, creating software drivers for measuring instruments, using internet technology in measuring and control systems.

ASSESSMENT CRITERIA:Lecture - scoring sufficient marks for written testLaboratory - scoring sufficient marks for all laboratory exercises

RECOMMENDED READING:1. Winiecki W.: The Organization of Computer Measuring Systems. Warsaw University of Technology Press, Warsaw, 1997 (in Polish).2. Mielczarek W.: Measuring Instruments and Systems with SCPI Compatibility, Helion, Gliwice 1999 (in Polish).3. Lesiak P., Świsulski D.: Computer Measuring Technique in Examples, PAK, Warsaw, 2002 (in Polish). 4. Nawrocki W.: Computer Measuring Systems, WKiŁ, Warsaw, 2002 (in Polish).5. Rak R., J.: Virtual Measuring Instrument - Real Tool of Present Metrology, Warsaw University of Technology Press, Warsaw, 2003 (in Polish).6. Nawrocki W.: Distributed Measuring Systems, WKŁ, Warsaw 2006 (in Polish).7. Bentley J. P.: Principles of Measurement Systems, Pearson Education Limited, Harlow, England, 2005. 8. Caristi A., J.: IEEE-488 General Purpose Instrumentation Bus Manual, Academic Press, INC., San Diego, California, 1992.9. Johnson G.W., Jennings R.: LabView Graphical Programming, MacGraw-Hill, New York, 2006

OPTIONAL READING:-

REMARKS:


FOUNDATIONS OF SOFTWARE MODELLING

Course code: 11.9-WE-I-PMP-PS40_SSI_S1S


Entry requirements: Object-oriented programming, software engineering.


Director of studies: Dr Łukasz Hładowski

Name of lecturer: Dr Łukasz Hładowski

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 30 2

V

ExamClass


Seminar

Project 15 1 Grade

COURSE CONTENTS:Introductory issues. Background and history of modern modelling techniques. Unified process of application life cycle. System analysis and design. Object paradigm. Object modelling and its role in design of information systems. Software production processes. Introduction to Unified Modelling Language (UML) notation and diagrams. Genesis and purpose of UML. Structural modelling. Basic notions and elements of object architecture: classes, objects, abstractions, encapsulation, inheritance, polimorphism, communication, relations and associations between objects. Static structural diagrams: class and object diagrams. Association modelling: aggregation, composition, generalization, specialization, dependencies and realization. Packages and subsystems. Types, interfaces and implementation classes. Implementation diagrams: component and deployment diagrams. Requirements and their specification. Use case diagrams. Use case analysis: inclusion, extension, grouping and generalization.Behavioral modelling. Sequence and collaboration diagrams. Roles, messages and stimuli. Interactions and collaborations. Analysis of system states. State and activity diagrams. Flow transfer. Decisions. Concurrency. Signals and communication Design patterns. Formulation of programming problems. Overview of most popular construction, structural and behavioral design patterns. Creational and testing patterns. Practical issues. Domain analysis. Work with use cases. General overview on design, deployment and testing. Presentation of dedicated UML-based design tools. Modelling of embedded systems.


LEARNING OUTCOMES:Skills and competences in: applying object paradigm and related programming environments for solving design, implementation, testing and deployment problems in simple information systems; using UML language for formulation, description and solution of programming problems; using design patterns; design software according to OOP methodology; inspection of software project; proper choose of CASE tools; specification of requirements for software.

ASSESSMENT CRITERIA:Lecture – the passing condition is to obtain positive mark from the exam;Laboratory – the passing condition is to obtain positive marks from all laboratory exercises to be planned within the laboratory schedule;Project – the passing condition is to obtain positive marks from all individual assignments provided within the project schedule.

RECOMMENDED READING:1. Booch G., Rumbaugh J., Jacobson I.:Unified Modeling Language User Guide, Addison-Wesley

Professional, 2005.

2. Miles R.: Learning UML, O’Reilly Media, 2006.

3. Graessle P., Baumann H., Baumann P.: UML 2.0 in Action: A project-based tutorial, Packt Publishing, 2005.

4. Pilone D., Pittman N.: UML 2.0 in a Nutshell, O’Reilly Media, 2005.

5. Warmer J., Kleppe A.: Object Constraint Language, The: Precise Modeling with UML, Addison-Wesley Professional, 1998.

6. Gamma E., Helm R., Johnson R., Vlissides J.: Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley Professional, 1994.

OPTIONAL READING:-

REMARKS:


ADVANCED WEB TECHNOLOGIES

Course code: 11.3-WE-I-ZTUS-PS42_SSI_S1S


Entry requirements:Object-oriented programming, Java and Web technologies, computer networks I and II, concurrent and distributed programming

Language of instruction: English

Director of studies: Dr Andrzej Marciniak

Name of lecturer: Dr Andrzej Marciniak

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

5

Lecture 2Grade

Class

Laboratory 2 Grade

Seminar

Project

COURSE CONTENTS:Java 2 Enterprise Edition Fundamentals. Distributed programming in Java. Evolution of enterprise application frameworks. J2EE API. Message-based communication on Java platform - Java Messaging Services.Multi-tier architecture. Integration of remote elements in J2EE applications. Specification of tiers: Web, business logic based on Java Beans, middle-tier, abstraction and persistance layer, integration and presentation layer. Fundamental J2EE design patterns: MVC, front controller, interceptor, context object, facade, transfer object, data access object. J2EE refactoring. Web application frameworks basics: Struts, Spring MVC, Java Server Faces. Application servers and deployment process. J2EE application development lifecycle. J2EE deployment roles: component provider, application assembler, deployer, platform provider, tools provider, system administrator. Connection and session pool management. Deployment descriptor. Archive resources of Web and enterprise application (WAR and EAR). Servlet container and application server implementations: Apache Tomcat, JBoss, Web Sphere Application Server. Security of application servers.Web services. Information services and Service Oriented Architectures. Binding, marshalling and unmarshalling. Web Services Description Language, protocols: SOAP and JAX-RPC. DTD document validation. Optimisation of web services: proactive, definitive and reactive


approach. UDDI registry. Security in web services: Java XML digital signature API, XML security stack, key management. Podobnie postępuj w przypadku kolejnych treści merytorycznych!

LEARNING OUTCOMES:Upon completion of this course, students will be able to do the following: demonstrate good understanding of J2EE architecture including J2EE design patterns and anti-patterns, demonstrate good understanding of Java server-side technologies, design and and implement multitiered enterprise Web applications. Students will have ability to work with Web services including: design and launch, use of services published by others, perform matchmaking, conceptually model services and construct multiagent-based services.

ASSESSMENT CRITERIA:Lecture – written final and oral (optional) examination.Laboratory - assessment is continuous during the semester, and consists of individual and group assignments, class participation, short-tests, laboratory reports.

RECOMMENDED READING:1. Alur D. Crupi J. Malks D.: Core J2EE Patterns: Best Practices and Design Strategies, Prentice Hall Ptr, 2003. 2. Chappel D. A., Jewel T.: Java Web Services: Using Java in Service-Oriented Architectures, O'Reilly, 2002.3. Cooper J. W.: Java Design Patterns, Addison-Wesley, 2000.4. Horstmann C. S., Cornell G.: Core Java 2, Volume II – Advanced Features, 7th Edition, Prentice Hall, 2007.5. McGovern M.: Java Web Services Architecture, Morgan-Kaufman, 2003.6. Short S.: Building XML Web Services for the Microsoft .NET Platform, Microsoft Press, 2002.

REMARKS:


S Y S T E M S AN D C O M P U T E R N E T W O R K S S E C U R I T Y

Course code: 11.3-WE-I-BSSK-PS43_SSI_S1S


Entry requirements: Computer networks


Director of studies: Dr Bartłomiej Sulikowski

Name of lecturer: Dr Bartłomiej Sulikowski


Number o f

teach ing

hours per

semester

Number of

teach ing

hours per

week

Semester


for a course

Number of ECTS



4

Lecture 30 2

V

GradeClass


Seminar

Project

COURSE CONTENTS:Threats in IT networks. Criteria for evaluation of safety data communications network. Types of attacks on each layer of the OSI model. Security hardware and software. Firewalls. The role of services in the risks.VPN.DoS,AND,DDoS,attacks.

Software. Threats: Viruses, worms, Trojans, Spyware and others. System defence: System updates, Anti-virus software and anti spyware. Application Layer Protocols: SSH and SSL/TLS.Law Regulations. The Law on Protection of Classified Information (at field appropriate due the computer network protection.)

Certification of devices and systems.

Cryptography. Symmetric and asymmetric algorithms. Standards DES, AES. Public key cryptography. RSA algorithm. One-way hash functions. Electronic signature. PKI servers. Cryptographic protocols.

Access to the system. Controlling user access to the system. Managing user access. Responsibilities of users. AAA systems.

Security of wireless networks. Transmission encryption. User and hardware authentication and authorization. RADIUS servers.


LEARNING OUTCOMES:Skills and competencies in the following areas: protection of computer networks and their individual components before the hazards, identifying threats and attacks, overseeing the design and operation of secure systems.

ASSESSMENT CRITERIA:Lecture –sufficient marks in written or oral tests conducted at least once per semester.Laboratory – passing all exercises.

RECOMMENDED READING:[1] Stuart McClure, Joel Scambray, George Kurtz, Hacking Exposed 7: Network Security Secrets & Solutions, McGraw Hill Professional, 2012[2] J. Erikson, Hacking: The Art of Exploitation, No Starch Press, 2003[3] Gary A. Donahue, Network Warrior, O'Reilly Media Inc., 2007, Sebastopol[4] Christof Paar et al., Understanding Cryptography: A Textbook for Students and Practitioners, Springer, 2009, London[5] Andy Oram, Beautiful Security, O'Reilly Media Inc., 2007, Sebastopol[6] Evi Nemeth et al., Unix and Linux System Administration Handbook, Prentice Hall, 2011, New York[7] Darril Gibson, CompTIA Security+: Get Certified Get Ahead: SY0-201 Study Guide, Library of congress press, 2006, Washington

OPTIONAL READING:-

REMARKS:


GAME PROGRAMMING

Course code: 11.3-WE-I-PG3D-PSW_B44_SSI_S1S


Entry requirements: Principles of programming, software tools




Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 30 2

VI

Grade Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:Human factors. Human factors in perception of virtual environments. Developer and client of the three dimensional interactive graphics, models of interaction, ‘presence’ in virtual environments.

An introduction to 3D game and VR technologies. Virtual Environments paradigm. Requirements. Classification of game genres. Application areas and examples.

I/O devices. Hardware and software for 3D gaming and VR. Visual, aural, multimodal and haptic interfaces. Sensors and BCI (Brain-Computer Interfaces).

Interactive 3D graphics. Geometric modeling and transforming objects in 3D space. Navigating 3D spaces. Virtual Reality as a typical interactive 3D space. Representing 3D space in information systems. “Level Design”- construction and population of 3D worlds. Representation of the scene assets: meshes, shading, lighting and texture mapping. Environmental mapping.

Animations and interactions. Key framed and articulated animations, motion capture and physics-based simulation. Position, scale and orientation manipulation. Texture morphing. Collision detection. Interaction with user.

Networked games and VR. Development of synthetic shared 3D environments. Creating convincing ‘worlds’ , ‘actors’ and ‘events’. Narrative environments. Economy of games.


3D sound.

CAD tools for game development. Efficiency of the game and the game production process. Scripting games. Game design environments: XNA, Blender, Unreal Development Kit.

LEARNING OUTCOMES:Skills and competences in programming and design for 3D game programming and interactive computer graphics. Awareness of the nature of the interface between application software and game engine packages. Modeling two- and three-dimensional assets.

ASSESSMENT CRITERIA:Lecture – one written test of 1.5 hours (70%) and coursework (30%) involving laboratory projects.Laboratory – coursework involving design and development of an application that requires real-time graphical input, manipulation and output.Project- design and development of a game prototype application

RECOMMENDED READING:1. Vince J.: Virtual Reality Systems, Addison Wesley, Cambridge, 1995.

2. Fox B.: Game Interface Design, Thomson, 2005.

3. Lamothe A.: Tricks of Windows game programming, Sams, 1999.

4. Various web-based sources

OPTIONAL READING:-

REMARKS:


DIGITAL VIDEO

Course code: 11.3-WE-I-FC-PSW_B44_SSI_S1S


Entry requirements: Principles of programming, software tools




Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 30 2

VI

Grade Class


Seminar

Project 15 1 Grade

COURSE CONTENTS:Introduction. Digital media, perceiving motion picture and sound and time-based media. An introduction to multimedia systems and digital cinematography. Installation and configuration of multimedia tools. Multimedia devices. Capturing streams. I/O devices for multimedia. Proper choosing and configuration according to the media standards (DVI, HDMI, FireWire, etc…)Digital video. Formats of digital video. Methods for analysis, synthesis and non-linear editing of digital video. Video as a streaming medium.Digital sound. Formats of digital sound. Methods for analysis, synthesis and non-linear editing of digital sound. Sound as a streaming medium.Streaming media. Formats of streamed media. Protocols for distribution of streamed media. Applications of video servers. Pod-casting. Animations and interactions. Key framed and articulated animations, motion capture and physics-based simulation. Position, scale and orientation manipulation. Texture morphing. Collision detection. Interaction with user.Digital video production process. Production of digital films. Preparation. Creating convincing ‘stories’, ‘actors’ and ‘events’. Digital narration. Linear and non-linear editing. Post-production. Distributing digital video.

Digital sound.


LEARNING OUTCOMES:Skills and competences in programming and production for digital video and time-based computer graphics. Awareness of the nature of the digital media, digital film production, post-production, editing and distribution.

ASSESSMENT CRITERIA:Lecture – one written test of 1.5 hours (70%) and coursework (30%) involving laboratory projects.Laboratory – coursework involving design and development of an application that requires graphical input and manipulation of digital video.Project- design and development of a digital video

RECOMMENDED READING:1. Ablan D.: Digital cinematography, New Riders Press, 20022. Paul J..: 100 tricks for digital video, O’Reilly, 20073. Katz. S. Film directing shot by shot, Michel Wiese Productions, 1991 4. Various web-based sources.

OPTIONAL READING:-

REMARKS:


AD V AN C E D P R O G R AM D E V E L O P M E N T E N V I R O N M E N T SAD V AN C E D P R O G R AM D E V E L O P M E N T E N V I R O N M E N T S

Course code: 11.3-WE-I-ZSP-PSW_C45_SSI_S1S


Entry requirements: Principles of programming, object-oriented programming


Director of studies: Professor Marcin Witczak

Name of lecturer: Dr Marek Sawerwain


Nu

mb

er o

f te

ach

ing

ho

urs

p

er s

emes

ter

Nu

mb

er o

f te

ach

ing

ho

urs

p

er w

eek

Sem

este

r


for a course

Number of ECTS



4

Lecture 30 2

VI

Exam

Class


Seminar

Project

COURSE CONTENTS:Programming MS Windows Applications. History of RAD systems – Delphi, C++ Builder, Kylix and their compatibility. Object Pascal vs C++. Introduction to Delphi. Projects, units and forms. Exploiting debugger. Handling exceptions. Event-based programming. DLL libraries. Handling Windows messages. Multi-thread applications.Database programming. Introduction to BDE. Elementary database programming components. Handling data sets (navigation, filters, searching, etc.) SQL – component TQuery. dbExpress technology. dbGo for ADO. Reports. Introduction to InterBase. Component development. VCL, CLX and Fire Monkey architectures. Developing VCL components. Shell applications for Windows. COM technology. COM technology vs Delphi.Internet Applications. Internet applications vs Delphi. Introduction to WebSnap. XML vs Delphi. MIDAS – multilayer applications. ASP and ASO. Introduction to CORBA. IDL language. Exemplary applications.

LEARNING OUTCOMES:Skills and competences: programming for Windows with RAD tools, programming database applications – desktop, client-server, multilayer, programming Internet applications

ASSESSMENT CRITERIA:Lecture – assessment condition: positive test marks


Laboratory – realisation of the projects related with the subject


1. Cantu M.: Mastering Delphi 7, Sybex, 2003.2. Cantu M.: Delphi XE Handbook: A Guide to New Features in Delphi XE, CreateSpace Independent

Publishing Platform, 2011.3. Cary J.: Delphi in Depth: ClientDataSets, CreateSpace Independent Publishing Platform, 2011.4. Rolliston C.: Delphi XE2 Foundations, CreateSpace Independent Publishing Platform, 2012.5. Stephens R.: Ready-to-Run Delphi(r) 3.0 Algorithms, John Wiley & Sons, 1998.6. Teixeira S., Pacheco X.: Delphi 6 Developer's Guide, Sams, 2001.

OPTIONAL READING:-

REMARKS:


.NET PLATFORM

Course code: 11.3-WE-I-PDN-PSW_C45_SSI_S1S


Entry requirements:Programming fundamentals, Object oriented programming, Algorithms and Data Structures, Databases


Director of studies: Dr Marek Sawerwain

Name of lecturer: Dr Marek Sawerwain

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

4

Lecture 30

VI

Exam

Class

Laboratory 30 Grade

Seminar

Project

COURSE CONTENTS:Introduction to .NET platform. Structure of the .NET platform. .NET distributions. Outline of .NET Framework environment. Review of programming languages supported by .NET platform.Microsoft Visual Studio- environment characteristic. Presentation of programming environment. Tool for form editing. Running application. Creating sample application.Common Language Runtime. Elementary functions and services of CLR. Memory and other resources management. Thread management. Structure and configuration of metadata. Integration with Win32 DLL libraries. Methods of interaction between applications. Comparison between CLR and JVM.Fundamentals of C# programming. Language syntax: instructions, variables, operators and data types. Design principles of classes, methods, constructors and objects. Arrays usage guidelines. Software Development Kit – review of main programming tools.Advanced C# programming. Preprocessor directives. Event handling. Handling errors using exceptions. Common string operations. Regular expressions reference. Remote object invocation. File access operations. Thread synchronization. Base Class Library – review. User interface components.Introduction to functional programming in F#: Introduction to F#. Review of functional programming style. Operators and data structures.


Creating components in .NET. Principles of designing, implementing and testing components. COM and COM+ technology overview.XML in .NET. Methods of information transfer using XML documents. Review of classes for XML documents manipulation and transformation.Access data using ADO.NET. Review of ADO.NET objects. Database access methods. Language Integrated Query – LINQ. Architecture of LINQ technology. LINQ queries to objects, databases, SQL databases and XML data. Parallel and serial LINQ queries.ASP.NET technology. Base classes and main objects of ASP.NET. Using XML in ASP.NET. Designing web pages using ASP components. Creating web services. SOAP and UDDI protocols. Security features of ASP.NET applications: access control, authentication and data encoding and cryptography.

LEARNING OUTCOMES:Skills and competences: basic knowledge about the .NET platform structure, practical use of the programming tools from .NET platform, designing and building applications using Microsoft Visual Studio, writing advanced computer programs in C# language, reading and writing programs in F#, creating new components for .NET, usage of XML language in .NET environment, creating applications with the access to databases using ADO.NET, creating queries in LINQ technology, creating Internet services using ASP.NET.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass is obtaining a positive grade in written or oral exam.Laboratory – the main condition to get a pass are sufficient marks for all laboratory exercises and tests conducted during the semester.

RECOMMENDED READING:[1] Chappell D., Understanding .NET (2nd Edition), Addison-Wesley Professional, 2nd edition, 2006[2] Novák. I, Velvárt A., Granicz A., Balássy G., Hajdrik A., Sellers M., Hillar G.C., Molnár A., Kanjilal J.:

Visual Studio 2010 and .NET 4 Six-in-One, Wiley Publishing, Inc., 2010[3] Nash T.: Accelerated C# 2010, A-Press, 2010[4] Solis D.M.: Illustrated C# 2010, A-Press, 2010[5] Troelsen A.: Pro C# 2010 and the .NET 4 Platform, 5th Ed., A-Press, 2010[6] Freeman A. and Rattz J.C. Jr.: Pro LINQ: Language Integrated Query in C#, A-Press, 2010[7] Richter J., CLR via C#, 3rd edition, Microsoft Press, 2010.

OPTIONAL READING:-

REMARKS:


CONVERGENT NETWORKS

Course code: 11.3-WE-I-SK-PSW_E47_SSI_S1S


Entry requirements: Computer networks


Director of studies: Dr Bartłomiej Sulikowski

Name of lecturer: Dr Bartłomiej Sulikowski

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 2

VI

Grade

Class

Laboratory

Seminar

Project 1 Grade

COURSE CONTENTS:Convergent networks. Idea. Evolution. Development Strategy. Scalability.

Services in converged networks. The data transmission. VoIP and video streams. Telephone and fax. VPN. Integration of circuit switched networks and packet-switched networks. Controlling convergent networks with SIP.

QoS and security for convergent networks.

Protocols and technologies. IP, IPv6. ATM. TDM. Frame Relay.

Management of converged networks. Configuration of network devices and client devices. Monitoring the network performance.

LEARNING OUTCOMES:Operation of convergent networks and services integrated.


ASSESSMENT CRITERIA:Lecture – sufficient marks in written or oral tests conducted at least once per semester.Project – implementing the integrated services with security in network (group task).

RECOMMENDED READING:[1] Mueller S.: APIs and Protocols For Convergent Network Services, McGraw-Hill, 2002[2] Wallingford T.: VoIP. VoIP Hacks Tips & Tools for Internet Telephony, O'Reilly Media Inc.,

2008,[3] Wallance H.: Authorized Self-Study Guide Cisco Voice Over IP (CVoice), 2006, Cisco Press[4] Ellis J. et al., Voice, Video, and Data Network Convergence: Architecture and Design, From

VoIP to Wireless, Academic Press, 2003

OPTIONAL READING:-

REMARKS:


D E S I G N I N G C O M U T E R N E T W O R K SD E S I G N I N G C O M U T E R N E T W O R K S

Course code: 06.0-WE-I-PSK-PSW_E47_SSI_S1S

Type of course: Optional

Entry requirements: Computer networks I, Computer networks II


Director of studies: Dr Mrugalski Marcin

Name of lecturer: Dr Mrugalski Marcin

Form of instruction

Number of

teaching hours

per semeste

r

Number of

teaching hours

per week

Semester




Full-time studies

6

Lecture 2

VI

Grade

Class

Laboratory

Seminar

Project 1 Grade

COURSE CONTENTS:Introducing networking design concepts. The benefits of a hierarchical network design. Network design methodology. Functions of the core, distribution and access layers. Investigating servers farms and security of the computer networks. Investigating wireless network. Supporting WANs and remote workers.Gathering networks requirements. Introducing a lifecycle of computer networks. Explaining the computer network sales process. Preparing for the design process. Identifying technical requirements and constraints. Identifying manageability design considerations. Characterizing the existing network. Documenting the existing network. Updating the existing internetworking operation system software. Upgrading the existing computer devices. Performing a wireless site survey. Documenting network design requirements.Identifying application impacts on network design. Characterizing network applications. Explaining common network applications. Introducing quality of service (QoS). Examining voice and video options. Documenting application and traffic flows.Creating the network design. Analyzing the requirements. Selecting the appropriate LAN topology. Designing the WAN and remote worker support. Designing wireless networks. Incorporating security. IP addressing in the network design. Creating an appropriate IP addressing design. Creating the IP addresses and naming scheme. Plan for summarization and route distribution. Describing IPv4 and IPv6. Migration from IPv4 to IPv6.


Prototyping the campus network. Building a prototype to validate a design. Creating a test plan. Prototyping the LAN. Validating LAN technologies and devices. Testing the redundancy and resiliency of the network. Identifying risks or weaknesses in the design. Prototyping the server farm.Prototyping the WAN. Prototyping remote connectivity. Simulating WAN connectivity in the simulation software and the laboratory environment. Validating the choice of devices and topologies. Prototyping remote worker support. Prototyping the VPN.Preparing the proposal. Assembling the existing proposal information. Developing the plan of the implementation of the computer network. Estimating timelines and resources. Creating and presenting the proposal.

LEARNING OUTCOMES:Developing the skills necessary to design small enterprise LANs and WANs; Introducing customer requirements, translating those requirements into equipment and protocol needs, and creating a network topology which addresses the needs of the customer; Familiarization how to create and implement a design proposal for a customer.

ASSESSMENT CRITERIA:Lecture – positive mark from written tests or oral exams during semester.Project – positive mark from a prepared project.

RECOMMENDED READING:1. McCabe J.D.: Network Analysis, Architecture and Design, 3rd ed. San Francisco. California: Morgan Kaufmann Publishers, Inc., 2007.2. Oppenheimer P.: Top-Down Network Design, 3rd ed. Indianapolis, Indiana: Cisco Press, 2010.3. Wilkins S.: CCDA Self-Study: Designing for Cisco Internetwork Solutions (DESGN), 2nd ed. 640-861, Indianapolis, Indiana: Cisco Press, 2007.

OPTIONAL READING:

-

REMARKS:


S E R V I C E S I N M O B I L E N E T W O R K SS E R V I C E S I N M O B I L E N E T W O R K S

Course code: 11.9-WE-I-USM-PS41_SSI_S1S


Entry requirements: Computer networks, Operating systems


Director of studies: Dr Przemysław Jacewicz

Name of lecturer: Dr Przemysław Jacewicz


Nu

mb

er o

f te

ach

ing

ho

urs

p

er s

emes

ter

Nu

mb

er o

f te

ach

ing

ho

urs

p

er w

eek

Sem

este

rForm of receiving a credit

for a course

Number of ECTS



4

Lecture 30 2 Exam

Class


Seminar

Project

COURSE CONTENTS:The principles of operation and construction of the GPS network. Construction of backbone network. Voice calls, Short Message Service (SMS), Enhanced Messaging Service (EMS) and Multimedia Messaging Service (MMS).The principles of operation and construction of the UMTS network. Construction of backbone network. Providing mobility. Power control.Services in UMTS network. Voice calls, Short Message Service (SMS) and Multimedia Messaging Service (MMS). Connection to internet. Video calls. Access to TV, radio, music and video. Possibility of creating a new service.

LEARNING OUTCOMES:Basic knowledge and competence in the principles of operation and construction of the GPS network, and UMTS.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Laboratory – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.



1. J. Kołakowski, J. Cichocki: UMTS System telefonii komórkowej trzeciej generacji, Wydawnictwa Komunikacji i Łączności WKŁ, 2007 (in polish).2. Aleksander Simon, Marcin Walczyk: Sieci komórkowe GSM/GPRS. Usługi i bezpieczeństwo, XYLAB, 2004 (in polish).3. Kabaciński Wojciech: Sieci telekomunikacyjne, Wydawnictwa Komunikacji i Łączności WKŁ, 2008. (in polish).

OPTIONAL READING:

-

REMARKS:


AD M I N I S T R AT I O N O F M O B I L E N E T W O R K SAD M I N I S T R AT I O N O F M O B I L E N E T W O R K S

Course code: 11.3-WE-I-ASM-PSW_D46_SSI_S1S


Entry requirements: Services in mobile networks





Nu

mb

er o

f te

ach

ing

ho

urs

p

er s

emes

ter

Nu

mb

er o

f te

ach

ing

ho

urs

p

er w

eek

Sem

este


for a course

Number of ECTS



4

Lecture 30 2 Exam

Class


Seminar

Project

COURSE CONTENTS:

The SIM card. Writing and reading data stored on the SIM card. Create a new operator card.Management of network elements. Control: a base station, wireless controller and gateway services.Services in the terminal and on the operator side. Managing access of pre-paid and subscription clients. Sending SMS and MMS. Charging of services and utilization reporting.

LEARNING OUTCOMES:Basic knowledge and competence in administration of the basic services of the GSM/UMTS network.

ASSESSMENT CRITERIA:Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Practice – the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester.



1. J. Kołakowski, J. Cichocki: UMTS System telefonii komórkowej trzeciej generacji, Wydawnictwa Komunikacji i Łączności WKŁ, 2007 (in polish).2. Aleksander Simon, Marcin Walczyk: Sieci komórkowe GSM/GPRS. Usługi i bezpieczeństwo, XYLAB, 2004 (in polish).3. Kabaciński Wojciech: Sieci telekomunikacyjne, Wydawnictwa Komunikacji i Łączności WKŁ, 2008. (in polish).

OPTIONAL READING:

-

REMARKS:


P R O G R AM M I N G M O B I L E D E V I C E SP R O G R AM M I N G M O B I L E D E V I C E S

Course code: 11.3-WE-I-PUM-PSW_D46_SSI_S1S


Entry requirements: Java and Web services





Nu

mb

er o

f te

ach

ing

ho

urs

p

er s

emes

ter

Nu

mb

er o

f te

ach

ing

ho

urs

p

er w

eek

Sem

este


for a course

Number of ECTS



6

Lecture 30 2 Exam

Class

Laboratory

Seminar

Project 15 1 Grade

COURSE CONTENTS:

Virtual machines. The types of virtual machines and their limitations. Configurations and profiles.Create midlets. Programming using Sun Wireless Toolkit and NetBeans IDE. Programming user interfaces, support for the display, keyboard, 3D graphics, communication via the Internet, send and receive SMS messages.Starting midlets for mobile phones. J2ME application types and methods of their preparation for selected mobile phones.

LEARNING OUTCOMES:Basic knowledge and competence in programming mobile devices in Java 2 Micro Edition platform.

ASSESSMENT CRITERIA:

Lecture – the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester.Project – the main condition to get a pass is acquiring sufficient marks for all project tasks as scheduled.



1. Kim Topley: J2ME. Almanach, Helion, 2003 (in polish).2. Janusz Grzyb: J2ME. Tworzenie gier, Helion, 2007 (in polish). 3. Krzysztof Rychlicki-Kicior: J2ME. Praktyczne projekty, Helion, 2006 (in polish).4. Krzysztof Rychlicki-Kicior: J2ME. Java dla urządzeń mobilnych. Ćwiczenia, Helion 2003. (in polish)

OPTIONAL READING:

-

REMARKS:


[ KLIKNIJ I WPISZ NAZWĘ PRZEDMIOTU ]...rules, the pigeonhole rule, the Dirichlet rule, permutations, variations , combinations, generating algorithms, combinatorial algorithms and

Documents