katalog przedmiotow ects - i s i s eng v01

Faculty of Electrical Engineering, Computer

Science and Telecommunications

University of Zielona Góra

INFORMATION BOOKLET

Subject Area: COMPUTER SCIENCE (INFORMATICS)

First-cycle Level Studies

(Full-time, Part-time)

Academic Year 2010/2011

European Credit Transfer System ECTS

Part II.B

ECTS COURSE CA TALOG UE

COMPUTER SCIENCE (INFORMATICS)

FIRST-CYCLE LEVEL STUDY (B.Sc.Degree)

S P E C I A L I S T S U B J E C T

i

TABLE OF COTETS

Computer architecture I 4

Principles of programming 6

Object-oriented programming 8

Algortihms and data structures 10

Digital system design 12

Computers network I 14

Theoretical foundations of computer science 16

Operating systems I 18

Computer graphics 20

Software engineering 22

Databases 24

Elements of artificial intelligence 26

Embedded systems 28

Social and professional problems of computer science 30

Project maganement 32

Mathematical foundations of engineering 34

Experiment methodology I 36

Computer Networks II 38

Java and Web technologies 40

Concurrent and distributed programming 42

Operating Systems II 44

Table of contents

ii

Development of information systems 46

Hardware Description Languages 48

Data safety and cryptography 50

Informatics systems testing 52

Fault diagnosis of digital systems 54

Designe of Multitier web systems 56

Mobile technologies and applications 58

OperaTional system level programming 60

Microprocessors systems 62

Information Systems In Management 64

Computer-aided design 66

Internet application 68

Industrial computer network 70

signal processing techniques 72

Wireless network 74

Software for measurement and control equipment 76

SPECIALIST SUBJECTS

Specialist subjects

4

CCC OOO MMM PPP UUU TTT EEE RRR AAA RRR CCC HHH III TTT EEE CCC TTT UUU RRR EEE III

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

Type of course: Compulsory

Entry requirements: -

Language of instruct ion: Polish

Director of s tudies: Dr hab. inż. Andrzej Pieczyński, prof. UZ

Name of lecturer : Dr hab. inż. Andrzej Pieczyński, prof. UZ

Form of instruct ion

Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r

Form of receiving a credit

for a course

Number o f ECTS cred i ts

a l located

Ful l - t ime studies

Lecture 15 1 I Grade

Part - t ime studies

Lecture 15 1 I Grade

1

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 prognose. 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.

ECTS Course Catalogue Computer Science – first-cycle level

5

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] Chalk B.S.: Computer arrangement and architecture, WNT, Warszawa, 1998 (in polish)

[2] Metzger P.: PC Anatomy, wydanie VI, Helion, 2003 (in polish)

[3] Metzger P.: Diagnostics and optimization of PC, Helion, 2001 (in polish)

[4] Mueller S.: PC upgrade and service, Helion, 2001 (in polish)

[5] Mueller S., Soper M. E.: PC upgrade and service. Vademecum, Helion, 2001

OPTIONAL READING: [1] –

Specialist subjects

6

PPP RRR III NNN CCC III PPP LLL EEE SSS OOO FFF PPP RRR OOO GGG RRR AAA MMM MMM III NNN GGG

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




Director of s tudies: Dr inż. Wojciech Zając

Name of lecturer : Dr inż. Wojciech Zając


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

I

Grade


Lecture 30 2 Grade

Laboratory 30 2 Grade

Project 15 1

I

Grade

4

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.


7

LEARNING OUTCOMES:

Abilities and competence in computer system operation understanding and programming in C.



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] 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


Specialist subjects

8

OOO BBB JJJ EEE CCC TTT --- OOO RRR III EEE NNN TTT EEE DDD PPP RRR OOO GGG RRR AAA MMM MMM III NNN GGG

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




Director of s tudies: Dr inż. Paweł Majdzik

Name of lecturer : Dr inż. Paweł Majdzik


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

II

Grade


Lecture 18 2 Grade

Laboratory 18 2

III

Grade

7

COURSE CONTENTS:

1.Introduction to object progarmming. Abstract data typing definition with member functions (encapsulation), private and public functions.

2. Constructors and destructors. The initialization of the objects by the conctructors (default and copy constructors), the constructor initializer list.

3. Functions overloading: friend functions and inline functions, constructor and operator conversion.

4. Inheritance and the composition of objects. Polymorphism, virtual functions, virtual destructors, late binding.

5. Standard Template Library. Templates of classes and functions. Containers and algorithms, iterators, associative containers, function objects.

6. Designing of object-oriented programming.

7. 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.


9


Lecture – obtaining a positive grade in written or oral exam.



1. Lippman S. B.: Model obiektu w C++, WNT, Warszawa, 1996

2. Eckel B.: Thinking in C++, Hellion, Warszawa, 2002

3. Stroustrup B.: Programming in C++, WNT, Warszawa, 2002

4. Alan Shalloway, James R. Trott.: Projektowanie zorientowane obiektowo. Wzorce obiektowe II, Helion, Warszawa, 2005.


Specialist subjects

10

AAA LLL GGG OOO RRR III TTT HHH MMM SSS AAA NNN DDD DDD AAA TTT AAA SSS TTT RRR UUU CCC TTT UUU RRR EEE SSS

Course code: 11.3-WE-I-ASD-PK_S1S




Director of s tudies: Dr hab inż. Andrzej Obuchowicz, prof UZ

Name of lecturer : Dr hab inż. Andrzej Obuchowicz, prof UZ


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 15 1

I

Grade


Lecture 18 2 Exam

Laboratory 18 2

II

Grade

4

COURSE CONTENTS:

An algorithm and its basic properties. Concepts of an algorithmic problem and algorithm, properties of algorithms, steering structures and block schemes.

Programming techniques. Recursion and derecursion, “divide and conquer” strategy, greedy algorithms, dynamic programming .

Data structures. Concepts of a data structure, dynamic sets, linear-ordered sets, dictionary structure, stuck (LIFO) and queue (FIFO). Linked lists: singly-linked, doubly-linked and circularly-linked lists. Binary trees, priority queues.

Dictionaries. Binary-search tree (BST), AVL tree, Red-Black tree. Hush tables. B-tree.

Sets and Graphs. Sets, graphs, graph representations, depth-first and breadth-first searching, graph-theory algorithms.

Analysis of the selected algorithmic problems. Linear and bipartition searching, table and file sorting, string searching algorithms, geometrical algorithms, paging problem, arithmetic systems, basic coding and compression methods.


11

LEARNING OUTCOMES:

Basic knowledge and engineering skills in designing algorithms using basic algorithmic techniques.





[1] Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994

[2] Knuth D.E..: The Art of Computing. Sorting and Seraching, Vol. 3, Addison-Wesley, Reading, 1973.

[3] Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, 1983


Specialist subjects

12

DDD III GGG III TTT AAA LLL SSS YYY SSS TTT EEE MMM DDD EEE SSS III GGG NNN

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




Director of s tudies: Dr inż. Zbigniew Skowroński

Name of lecturer : Dr inż. Zbigniew Skowroński


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

II

Grade


Lecture 18 2 Grade

Laboratory 18 2

IV

Grade

4

COURSE CONTENTS:

Digital Computers and Information. Binary signals, information representation, generic computer architecture. Number systems, operations and conversions: decimal, binary, octal, hex. Codes: BCD, parity, Gray, ASCII, Unicode.

Combinational Logic. Binary logic/gates. Boolean Algebra, functions, properties and theorems. Standard forms: minterms/maxterms, SoP, PoS. Karnaugh maps: 2, 3, 4, 5 and 6 variables maps. Quine-McCluskey Boolean function minimization. Two-level/Multilevel circuit optimization.

Basic Logic Gates, popular technologies. NAND/NOR gates and circuits: two-level and multi-level implementations. Exclusive-OR gates: odd function, parity function. High impedance outputs: tri-state buffers and transmission gates. Integrated circuits: levels of integration, digital logic families, negative/positive logic. CMOS circuits: switch models, nets of switches, fully complementary CMOS, basic gates, complex gates, transmission gate.

Combinational Logic Design. Design principles (hierarchy, top-down design, CAD, HDLs, logic synthesis). Combinational circuit analysis and timing. Design procedure (examples). Technology mapping.

Combinational Functions and Circuits. Decoders, expansion, circuit implementation using decoders. Encoders, expansion, priority encoders. Multiplexers, implementation, Quad-MUX, MUX as universal gate. Circuit implementation using MUXes. Iterative Combinational Circuits. Binary Adders (HA, FA, ripple-carry, carry-lookahead). Binary Subtraction (unsigned, 1's and 2's complements). Binary Adder/Subtractors. Binary Adder/Subtractors (signed numbers). Binary Multiplication. Other Arithmetic functions. Circuit implementation using PLDs (ROM, PLA, PAL).

Sequential Circuits. Latches (SR, S'R', D). Flip-flops (Master-Slave, Edge-triggering). Characteristic Tables/Equations. Asynchronous Set/Reset. Sequential Circuit Analysis: Input Equations, State Tables, State Diagrams. Mealy vs. Moore machines. Timing (FF and Circuit). Sequential Circuit Design: Design


13

procedure, finding state diagrams/tables, examples. Sequential Circuit Design: state assignment, designing with D and JK flip-flops, designing with unused states, other design examples.

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. Serial and Parallel gating. Binary Up-Down Counter. Binary Counter with Parallel Load. BCD and Arbitrary Sequence Counters. Modulo N counters.

Memory Basics. SRAM. DRAM. Basic memory system design.

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.





A. B. Marcovitz: Introduction to Logic Design, McGraw-Hill, 2002

C. H. Roth, Jr.: Fundamentals of Logic Design, 5th Edition, Thomson Brooks/Cole, 2004

F. A. Scarpino: VHDL and AHDL Digital System Implementation, Prentice-Hall, 1998

J. F. Wakerly: Digital Design, Principles and Practices, 4th Edition, Prentice-Hall, 2005

K. Skahill: VHDL for Programmable Logic, Addison-Wesley Publishing, 1996

M. Zwolinski: Digital System Design with VHDL, 2nd Edition, Prentice-Hall, 2003

R. H. Katz, G. Borriello: Contemporary Logic Design, 2nd Edition, Pearson Education, 2005

S. Brown and Z. Vranesic: Fundamentals of Digital Logic with VHDL Design, McGraw-Hill, 2000

Μ. Μ. Mano and C. R. Kime: Logic and Computer Design Fundamentals, 4th Edition, Prentice-Hall, 2007

Μ. Μ. Mano, M. D. Ciletti: Digital Design, 4th Edition, Prentice-Hall, 2007


Specialist subjects

14

CCC OOO MMM PPP UUU TTT EEE RRR SSS NNN EEE TTT WWWOOO RRR KKK III

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




Director of s tudies: Dr inż. Emil Michta

Name of lecturer : Dr inż. Marcin Mrugalski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 II Grade


Lecture 18 2 II Grade

2

COURSE CONTENTS:

Introduction to computer networks: Classification of computer networks. Hardware and software components of network hosts. OSI communication model. TCP/IP reference model. Physical layer: Electronics and signals. Media, connections and collisions. Physical topology. Network devices of physical layer. Data link layer: Concepts and technologies. Logical topologies. LAN networks segmentation. Network devices of data link layer. 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 devices. IP address management. Transport layer: Functions and TCP and UDP transports protocols. Session, presentation and application layers: Functions and protocols. Internet technology components. Fundamentals of WAN networks: Standards and topologies. Circuits, packet and cells switching. Introduction to routers: Router components and operation. User interface and configuration principle. Security basis: Firewalls: generations, structures and configurations. LAN network design: Rules of LAN networks design and documentation. Structural cabling.

LEARNING OUTCOMES:

Abilities and competence: design, installation and configuration of simple local area network connected to Internet, IP address management, switch and router configuration, firewall configuration.




15


1. Breyer R., Riley S.: Switched, Fast and Gigabit Ethernet. Helion, Gliwice, 2003. (in Polish)

2. Jakubowska A. and others: Cisco networking academy. Semester 1-4, Mikom, Warszawa, 2006. (in Polish)

3. Mueller S., Ogletree T.: Upgrading and repairing networks. Helion, Gliwice, 2004. (in Polish)

4. Rosehan P., Leary J.: 802.11 Wireless networks. Mikom, Warszawa, 2004. (in Polish)

5. Sportack M.: Computer networks. Expert book. Helion, Gliwice. (in Polish))


Specialist subjects

16

TTT HHH EEE OOO RRR EEE TTT III CCC AAA LLL FFF OOO UUU NNN DDD AAA TTT III OOO NNN SSS OOO FFF CCC OOO MMM PPP UUU TTT EEE RRR SSS CCC III EEE NNN CCC EEE

Course code: 11.3-WE-I-TPI-PK_S1S




Director of s tudies: Dr hab. inż. Andrzej Obuchowicz, prof UZ.

Name of lecturer : Dr hab. inż. Andrzej Obuchowicz, prof UZ.


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Class 30 2

III

Grade


Lecture 18 2 Exam

Class 18 2

IV

Grade

7

COURSE CONTENTS:

Introduction. Concepts of an algorithmic problem and algorithm, properties of algorithms, asymptotic notation.

Algorithmic correctness. Correctness of algorithms, partial correctness of algorithms, termination, proving of algorithm correctness, loop invariants method.

Foundations of automation and languages theory. Finite automata and regular expressions, context-free grammars, pushdown automata and context-free languages.

Abstract machines. Church-Turing thesis, Turing machine and its variants, RAM machine, counter machine.

Algorithm complexity. Measures of algorithms’ effectiveness, space and time complexity, pessimistic and average complexity, top and down limits of complexity, natural complexity of problems, algorithmically open and close problems, algorithmic gap. Classification of algorithmic problems: P class, Exponential class, NP and NP-complete class. Reduction. Decidable and undecidable problems

Concurrent and probabilistic algorithms. Static and expanded concurrency. Product complexity. Nets. Thesis about the concurrent computation. Nick class. RNC algorithms. Probabilistic classes of complexity.

LEARNING OUTCOMES:

Basic knowledge and engineering skills in analysis of correctness and complexity of sequential, parallel and probabilistic algorithms.


17





1. Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994.

2. Knuth D.E..: The Art of Computing. Sorting and Seraching, Vol. 3, Addison-Wesley, Reading, 1973.

3. Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, 1983.

4. Ben Ari M.: Mathematical Logic for Computer Science, Springer-Verlag, Berlin Hiedelberg, 2001.

5. Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994.

6. Graham R.L., Knuth D.E., Patashnik O.: Concrete Mathematics, Addison-Wesley, Readings, 1994.


Specialist subjects

18

OOO PPP EEE RRR AAA TTT III NNN GGG SSS YYY SSS TTT EEE MMM SSS III

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




Director of s tudies: Dr hab. inż. Krzysztof Patan

Name of lecturer : Dr hab. inż. Krzysztof Patan


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

III

Grade


Lecture 18 2 Grade

Laboratory 18 2

III

Grade

5

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 XP/Vista, Windows Server 2003. 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 and Windows Server 2008.


19





[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


Specialist subjects

20

CCC OOO MMM PPP UUU TTT EEE RRR GGG RRR AAA PPP HHH III CCC SSS

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




Director of s tudies: Dr hab. inż. Sławomir Nikiel

Name of lecturer : Dr hab. inż. Sławomir Nikiel


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

III

Grade


Lecture 18 2 Grade

Laboratory 18 2

III

Grade

5

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.


21

LEARNING OUTCOMES:

Skills and competences in programming and design for computer graphics, digital image synthesis and image processing. Modeling two- and three-dimensional geometry and object representation.





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 conference proceedings


Specialist subjects

22

SSS OOO FFF TTT WWW AAA RRR EEE EEE NNN GGG III NNN EEE EEE RRR III NNN GGG

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




Director of s tudies: Dr hab. inż. Sławomir Nikiel

Name of lecturer : Dr hab. inż. Sławomir Nikiel


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Project 15 1

IV

Grade


Lecture 30 2 Grade

Project 15 1

V

Grade

6

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.


23





1. Sommerville I.: Software Engineering Addison-Wesley, 1992

2. Pressman R.: Software Engineering, A practitioner’s approach, McGraw-Hill, 1992

3. Ford N.J., Woodroffe M.: Introducing software engineering, Prentice-Hall, 1994.

4. Jones G.W.: Software Engineering, Wiley, 1990


Specialist subjects

24

DDD AAA TTT AAA BBB AAA SSS EEE SSS

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




Director of s tudies: Dr inż. Agnieszka Węgrzyn

Name of lecturer : Dr inż. Agnieszka Węgrzyn, dr inż. Jarosław Gramacki


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

IV

Grade


Lecture 18 2 Exam


Project 9 1

IV

Grade

7

COURSE CONTENTS:

Introduction to databases: relational model, hierarchical model, network model, XML model, object-oriented databases The relational model: Relational data objects and SQL; Relational operators and SQL; Relational data integrity, Entity-Relationship Diagram – ERD, normalize relations into normal forms Introduction 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, transactions Introduction 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.


25






1. Bowman, JS, Emerson, SL, Darnovsky, M, 1996, The Practical SQL Handbook - Using Structured Query Language, Addison-Wesley

2. Date, CJ, 2000, An introduction to database systems, 7th edition, Addison-Wesley

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, (Interantional Edition), Prentice Hall 2003

5. Ullman J. D., and Widom J., A First Course in Database Systems, Third Edition, Prentice-Hall, 2008


Specialist subjects

26

EEE LLL EEE MMM EEE NNN TTT SSS OOO FFF AAA RRR TTT III FFF III CCC III AAA LLL III NNN TTT EEE LLL LLL III GGG EEE NNN CCC EEE

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




Director of s tudies: Prof. dr hab. inż. Józef Korbicz

Name of lecturer : Prof. dr hab. inż. Józef Korbicz , Dr inż. Marek Kowal


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

IV

Grade


Lecture 18 2 Exam


Project 9 1

V

Grade

7

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 Graphs

Probabilistic 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.


27

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.






1. Russell S., Norvig P.: Artificial Intelligence: A Modern Approach (2nd Edition), Prentice Hall, 2002

2. Bishop C.: Pattern Recognition And Machine Learning, Springer Verlag, 2006

3. Pearl J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, 1997

4. Mitchell T.M.: Machine Learning, McGraw-Hill, 1997


Specialist subjects

28

EEE MMM BBB EEE DDD DDD EEE DDD SSS YYY SSS TTT EEE MMM SSS

Course code: 11.9-WE-I-SW-PK_S1S


Entry requirements: Logic circuits, Fundamentals of programming


Director of s tudies: prof. dr hab. inż. Alexander Barkalov

Name of lecturer : prof. dr hab. inż. Alexander Barkalov


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Exam


Project 15 1

Grade


Lecture 18 2 Exam


Project 9 1

Grade

7

COURSE CONTENTS:

Introduction to the embedded systems. Main elements of the embedded system. Hardware and software part of the embedded system. System-on-a-chip (SoC) and System-on-a-programmable chip (SoPC). Prototyping flow of the embedded system. IP-Cores in design process of embedded systems. Softcore and hardcore processors. Realisation and implementation of embedded systems.

LEARNING OUTCOMES:

Skills and competence in: prototyping and designing of embedded systems.






29


[1] De Micheli G.: Synteza i optymalizacja układów cyfrowych, WNT, Warszawa, 1998

[2] Pasierbiński J., Zbysiński P.: Układy programowalne w praktyce, WKŁ, Warszawa, 2001

[3] Maxfield C.: The Design Warrior’s Guide to FPGAs. Devices, Tools and Flows. Elsevier, Amsterdam, 2004.

OPTIONAL READING:

1. Kalisz J. (Ed.): Język VHDL w praktyce, WKŁ, Warszawa, 2002

2. Łuba T.: Synteza układów logicznych, Oficyna Wydawnicza Politechniki Warszawskiej, Warszawa, 2005.

Specialist subjects

30

SSSOOOCCC III AAA LLL AAANNNDDD PPP RRROOO FFF EEE SSS SSS III OOONNNAAA LLL PPP RRROOOBBB LLL EEEMMMSSS OOO FFF CCCOOOMMMPPPUUU TTT EEE RRR

SSS CCC III EEE NNNCCC EEE

Course code: 11.9-WE-I-SZPI-PK_S1S




Director of s tudies: Dr inż. Włodzimierz Kujanek

Name of lecturer : Dr inż. Włodzimierz Kujanek


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 VII Grade


Lecture 9 2 VIII Grade

2

COURSE CONTENTS:

Ethical and professional responsibility. Law of work in range of computer science. Internet and personal value of man. Freedom and dependences in process of communication in Internet. Contracting} of agreement in Internet. Duties of administrators.

Ethical codes and codes of procedure. Code of Internet – Net. Forms of publicity in Internet. Internet in marketing and to management. Use electronic posts in commercial targets. Other dishonest behaviour in nets.

Risk and responsibility connected with systems of computer science. Responsibility computer scientist in light of code civilian and of penal code. Problems of computer delinquency. Convention about cyberdelinquency.

Problems and problems legal relating intellectual properties. Copyright and rights related. International regulations relating of copyright. Permissible use of compositions. Protection of computer programmes. Disturbings of marks differentiating in Internet. Problems legal relating protections {guard} of databases. Signature electronic and his legal results. Legal problems connected with testifying of services on electronic way. Software open source in light law.

Patent system. Law of industrial property. Invention, utility model, industrial designe, trade and service marks. Topography of integrated circuits. Patent. Right of protection. Right of the registration. Procedure of conduct before Polish Patent Office. Obtaining of protection in foreign lands. Profiting from patent data bases accessible free through Internet. Licences. Reaching of rights of intellectual property.

Unfair competition. Acts of unfair competition. Protection of competition and consumers.

Legal bases of protection of privacy. Protection of personal goods on the ground of civilian code. Right to privacies and total computer science structure.


31

Protection of computer programmes. Object protections. Subject of copyright to computer programme. Increasing manifold of programme. Exhaustion rights to computer programme. Limitations of property copyrights to computer programme. Access to idea and of rules expressed in computer programme. Penal sanctions for disturbings of copyrights.

Bases of profiting from Internet. Disturbings of marks differentiating in Internet. Other dishonest maintenances in cyber space..

LEARNING OUTCOMES:

Perception and valuing of social context of computer science and connected from her risks and estimations of situation appearing in life computer science, both in respect of legal as and ethical.




[1] Kotarba W.: Protection of industrial property in Polish economy in adaptation to requirements of European Union and of World Trade Organization. Publishers Institute of Organization and Managements in Industry „ORGMASZ”, Warsaw 2000 (in Polish)

[2] Sobczak J.: Law author's and laws related, Polish Publishers Legal, Warsaw - Poznan 2000 (in Polish)

[3] Golat K., Golat R.: Law computer, Publishers Legal Company with limited responsibility, Warsaw 1998 (in Polish)

[4] Podrecki P. i inni: Law of internet, Publishers Legal LexisNexis, Warsaw 2004 (in Polish) [5] Waglowski P.: Law in the Net. Outline of regulation of internet, Publishers HELION, Gliwice 2005 (in

Polish) [6] Barta J., Markiewicz R.: Software open source in light of law. Between property and freedom.

Publishers Zakamycze. Cracow 2005 (in Polish) [7] Collective Work under drafting Zasępa T.: Internet.. Phenomenon societies inquiry Publishers Saint

Paul, Czestochowa 2001 (in Polish) [8] Antoniuk J.: Protection of trademarks in internet, Publishers Legal LexisNexis, Warsaw 2006 (in

Polish) [9] Van der Leun G., Mandel T.: Rules of the Net,. Publishers, Warsaw 1998 (in Polish)

OPTIONAL READING:

[1] –

Specialist subjects

32

PPP RRR OOO JJJ EEE CCC TTT MMM AAA NNN AAA GGG EEE MMM EEE NNN TTT

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




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

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


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade

Laboratory 30 2

VI

Grade


Lecture 9 1 Grade


Project 9 1

VI

Grade

4

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 and technical staff. Project Closure Report. Post Implementation Review.

Project planning and management software. Apply of Project Management Tools.


33

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.






[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] Philips J.: Zarządzanie projektami IT, Helion, Gliwice, 2004

[5] Wróblewski P.: Zarządzanie projektami informatycznymi dla parktyków, HELION, Gliwice, 2005

[6] Berkun S.: Sztuka zarządzania projektami, Helion, Gliwice, 2006

[7] Mingus N.: Zarządzanie projektami, Helion, Gliwice, 2002

[8] Kerznel H.: Zarządzanie projektami. Studium przepadków, Helion, Gliwice, 2005

[9] Spałek S.: Sztuka wojny w zarządzaniu projektami, Helion, Gliwice 2005

[10] Holliday M.: Coaching, mentoring i zarządzanie. Jak rozwiązywać problemy i budować zespół, Helion, Gliwice, 2006

[11] Yourdon E.: Marsz ku klęsce. Poradnik dla projektanta systemów, WNT, Warszawa, 2000

[12] Katzenach J.R., Smith D.K.: Siła zespołów. Wpływ siły zespołowej na efektywność organizacji, Oficyna Ekonomiczna/Dom Wydawniczy ABC, Kraków, 2002

OPTIONAL READING:

[1] –

Specialist subjects

34

MMM AAA TTT HHH EEE MMM AAA TTT III CCC AAA LLL FFF OOO UUU NNN DDD AAA TTT III OOO NNN SSS OOO FFF EEE NNN GGG III NNN EEE EEE RRR III NNN GGG

Course code: 11.9/06.0-WE-I-MPT-PD_S1S




Director of s tudies: dr Dorota Krassowska

Name of lecturer : dr Dorota Krassowska


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 1 Grade

Class 30 1

I

Grade


Lecture 18 1 Grade

Class 18 1

I

Grade

2

COURSE CONTENTS:

Numbers and their properties.

Rational numbers, irrational numbers and theirs approximations by rationals, the minimum principle, mathematical induction method, equations and inequalities with absolute value function inside.

Polynomial and rational functions.

Polynomial equations and inequalities ,factorization method, Viete formulas, Cardan formulas , Ferrara formulas, quadratic equations and ineqralities with parameters, rational functions and decomposition into prime fractions.

Elementary functions and theirs properties.

Power with real exponents, exponential and logarithmic functions, simple exponential equations and inequalities ,logarithmic equations and inequalities, trigonometric functions ,reduction formulas ,trigonometric type equations and inequalities.

Numerical sequences .

Recurrently defined sequences, limit of numerical sequence and its determination,

Basic properties of limits, some remarkable limits ,geometric series and their summation.

Continuity and derivative of function.

The continuity of function concept and its consequences, limits of functions, some remarkable limits, function derivative and their geometrical and mechanical meanings, basic properties of derivatives ,derivatives of elementary functions ,applications of derivative in investigating behaviour of functions: critical points calculations, extreme (minimum, maximum),necessary and sufficient condition of extreme , monotonicity intervals, convexity and concavity ,inflexion point.

2D Geometry (plane geometry).


35

Sinus and cosinus theorems, geometrical transformations of plane: rotations, reflexions, symmetries, vetor algebra calculus ,straight lines ,second order curves and their analytical description: circles, ellipses ,paraboles, hyperboles, areas of plane figures.

3D Geometry (stereometry ).

Vector algebra: scalar and vector product and theirs applications ,straight lines and planes: description and elementary properties, second order surfaces: spheres, ellipsoids, hyperboloids. Polyhedrons and theirs elementary properties. Geometrical transformations and symmetries of bodies.

Elementary probability calculus.

Definition and basic properties of probability: elementary event, the space of events, probability measure, elements of combinatorics: combinations, permutations and variations, Bernoulli schemes and distribution, independence of events, conditional probability.

LEARNING OUTCOMES:

To standardize the preliminary high school mathematical background necessary to follow university level mathematical courses is the main aim of the present activity.

After this series of lectures and exercises the majority of students will reach the appropriate level of elementary mathematics knowledge , the level that will help them to understand foundations of higher mathematics methods and techniques.


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

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


[1] Textbooks on Mathematics from any mathematically oriented high schools

OPTIONAL READING:

[1] –

Specialist subjects

36

EEE XXX PPP EEE RRR III MMM EEE NNN TTT MMM EEE TTT HHH OOO DDD OOO LLL OOO GGG YYY III

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




Director of s tudies: dr hab inż. Ryszard Rybski

Name of lecturer : dr hab inż. Ryszard Rybski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade

Laboratory 15 1

I

Grade


Lecture 9 1 Grade

Laboratory 9 1

I

Grade

2

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.


37

LEARNING OUTCOMES:

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





[1] Chwaleba A, Poniński M., Siedlecki A.: Elctrical metrology, WNT, Warszawa, 1998 (in Polish)

[2] Jaworski J., Morawski R., Olędzki J.: Introduction to metrology and experiment engineering. WNT, Warszawa, 1992 (in Polish)

[3] Skubis T.: Fundamentals of measurement results metrological interpretation. Wydawnictwo Politechniki Śląskiej, Gliwice, 2004 (in Polish)

[4] Turzeniecka D.: Estimation of mesurement results uncertainty. Wydawnictwo Politechniki Poznańskiej, Poznań, 1997 (in Polish)

OPTIONAL READING:

[1] –

Specialist subjects

38

CCC OOO MMM PPP UUU TTT EEE RRR NNN EEE TTT WWWOOO RRR KKK SSS III III

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




Director of s tudies: Doc dr inż. Emil Michta

Name of lecturer : dr inż. Marcin Mrugalski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 15 1

III

Grade


Lecture 18 2 Exam

Laboratory 18 2

III

Grade

6

COURSE CONTENTS:

Introduction to Internet: Technical basis of Internet. Internet, Intranet and Extranet. Communication protocols of network and application layer. TCP/IP stack and ISO model. Wideband Internet access networks: xDSL. UMTS. WiMax. Last mile Ethernet. FTTO and FTTH access. WAN networks: WAN networks standards. WAN networks technologies. WAN networks devices. Basis of WAN networks design. Routers: Advanced configuration. Routing protocols. Intra-domain and inter-domain routing. Static and dynamic routing. Default routing. Link state and distance vector routing. Network conwegence: split horizon, count to infinity and hold-down timers methods. IP address management: Class-base routing. Classless routing. Sub-netting and super-netting. IP address aggregation. DHCP client and server configuration. Private addressing and NAT function configuration. Network security: Firewalls. Standard and extended access control list configuration. Dynamic access control list. Reflexive access control list. Context-base access control list. Fundamentals of WAN networks: Network integration. NGN network model. Services in NGN networks. Assessment of network communication parameters: Little rule. Mean values analysis. Markov models of a single stand. Markov models networks stands..

LEARNING OUTCOMES:

Abilities and competence: advanced IP address management, configuration of router DHCP, NAT and firewall functions, calculation of computer networks communication parameters.


39





1. Czachórski T.: Queues models in computer and networks systems assessment. Jacek Skalmierski Publishing House, Gliwice, 1999. (in Polish)

2. Jakubowska A. and others: Cisco networking academy. Semester 1-4, Mikom, Warszawa, 2006. (in Polish)

3. McGregor M. Cisco networking academy. Semester V. Mikom, Warszawa, 2002. (in Polish)

4. Mueller S., Ogletree T.: Upgrading and repairing networks. Helion, Gliwice, 2004. (in Polish)

5. Rosehan P., Leary J.: 802.11 Wireless networks. Mikom, Warszawa, 2004. (in Polish)

6. Sportack M.: Computer networks. Expert book. Helion, Gliwice, 2006. (in Polish)

OPTIONAL READING:

[1] –

Specialist subjects

40

JJJ AAA VVV AAA AAA NNN DDD WWW EEE BBB TTT EEE CCC HHH NNN OOO LLL OOO GGG III EEE SSS

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




Director of s tudies: dr inż. Andrzej Marciniak

Name of lecturer : dr inż. Andrzej Marciniak


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

III

Grade


Lecture 18 2 Exam

Laboratory 18 2

V

Grade

6

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. Multithreading, 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, clien-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. Designing of web applications in Java: servlets, Java Server Pages, tag libraries, Java Standard Template Library. 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 antipatterns. An ability to design interactive Web applications.


41





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, 7

th Edition, Prentice Hall, 2007.

5. Horstmann C. S., Cornell G.: Core Java 2, Volume II – Advanced Features, 7th Edition, Prentice Hall, 2007

OPTIONAL READING:

[1] –

Specialist subjects

42

CCC OOO NNN CCC UUU RRR RRR EEE NNN TTT AAA NNN DDD DDD III SSS TTT RRR III BBB UUU TTT EEE DDD PPP RRR OOO GGG RRR AAA MMM MMM III NNN GGG

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




Director of s tudies: dr inż. Tomasz Gratkowski

Name of lecturer : dr inż. Tomasz Gratkowski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Exam

Laboratory 30 2

IV

Grade


Lecture 9 1 Exam

Laboratory 18 2

VI

Grade

5

COURSE CONTENTS:

Concurrent programming – basic concept: process, shared resources, critical section, mutual exclusion, synchronization.

Aims of concurrent programming. Advantages and disadvantages of concurrent programming.

Channels. Allowable operations on channels. Communication and synchronization based on channels.

Semaphores: general semaphore, binary semaphore, synchronization of processes with usage of semaphores.

Classical problems of concurrent programming: dining philosophers problem, producer-consumer problem, readers-writers problems.

Basic concept of transputer platform. Mutual exclusion problem: Dekker algorithm, others algorithms.

Types of parallel architectures: SISD, SIMD, MISD, MIMD. Array computers.

Architecture of T805 and ST20 processor.

Vector computers, multiprocessor systems, supercomputers.

LEARNING OUTCOMES:

Abilities and competence in design and implementation software consist of many processes.





43


1. Weiss Z., Gruźlewski T., Concurrent and distributed programming, WNT Warszawa 1993 (in Polish)

2. Ben-Ari M., Basis of concurrent and distributed programming, WNT Warszawa 1996 (in Polish)

3. Czech Z., Distributed programming – selected problems, WPS Gliwice 1999 (in Polish)

4. Kozielski S., Szczerbiński Z., Parallel computers, WNT Warszawa 1993 (in Polish)

5. Iszkowski W., Maniecki M., Concurrent programming, WNT Warszawa 1982 (in Polish)

OPTIONAL READING:

[1] –

Specialist subjects

44

OOO PPP EEE RRR AAA TTT III NNN GGG SSS YYY SSS TTT EEE MMM SSS III III

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




Director of s tudies: dr inż. Wojciech Zając

Name of lecturer : dr inż. Wojciech Zając


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Exam

Laboratory 30 2

IV

Grade


Lecture 9 1 Exam

Laboratory 18 2

IV

Grade

4

COURSE CONTENTS:

Operating system. Comparison of popular systems. Construction of systems. Remote operation of multiple users. Elementary configuration files. Communication among users. Electronic mail. File system. Relative and absolute path. Filename. Mask. Meta-characters. Commands related to files. Links. Typical filesystem tree. Location of important system files. Work with files. Displaying the text files. Access rights. FTP File editor vi commands. Find command. Shell programs. User configuration files. Work with Variables. Streams and pipelines. Redirecting data. Filters. Regular expressions. Shell programming. Tests. Conditions. Loops. Functions. Advanced processing of test files. sed editor. awk filter. Multitasking. Processes. X Window. System administration.

LEARNING OUTCOMES:

Abilities and competence in using and administrating UNIX/Linux systems.





45


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:

[1] –

Specialist subjects

46

DDD EEE VVV EEE LLL OOO PPP MMM EEE NNN TTT OOO FFF III NNN FFF OOO RRR MMM AAA TTT III OOO NNN SSS YYY SSS TTT EEE MMM SSS

Course code: 11.3-WE-I-PSI-PS40_ISM_S1S




Director of s tudies: Dr inż. Agnieszka Węgrzyn

Name of lecturer : Dr inż. Agnieszka Węgrzyn, dr inż. Tomasz Gratkowski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

Grade


Lecture 18 2 Exam

Laboratory 18 2

Grade

6

COURSE CONTENTS:

Basic function of information system.

Methodology of information system development (phases of development life cycle: analysis and requirements specification, specific implementation environment, implementation, testing, installation). Classification of information system development methodology. Systems Development Life Cycle Models.

Documentation type of information system (business documentation, analytic documentation, technical documentation, user guides).

Modeling in UML diagrams.

Code generation using UML diagrams.

LEARNING OUTCOMES:

Analysis and development of information systems.





47


1. Śmiałek M.: Zrozumieć UML 2.0. Metody modelowania obiektowego, Wydawnictwo, Helion, 2005.

2. Bereza-Jarociński B., Szomański B.: Inżynieria oprogramowania. Jak zapewnić jakość tworzonym aplikacjom, Wydawnictwo, Helion, 2009.

3. Wrycza St.: Analiza i projektowanie systemów informatycznych zarządzania. Metodyki, techniki, narzędzia, PWN, Warszawa 1999.

4. Szejko ST.(red.): Metody wytwarzania oprogramowania, Wydawnictwo MIKOM, Warszawa 2002.

OPTIONAL READING: -

Specialist subjects

48

HHH AAA RRR DDDWWW AAA RRR EEE DDD EEE SSS CCC RRR III PPP TTT III OOO NNN LLL AAA NNN GGG UUU AAA GGG EEE SSS

Course code: 06.0-WE-I-JMSC-PS42_ISM_S1S




Director of s tudies: Dr inż. Marek Węgrzyn

Name of lecturer : Dr inż. Marek Węgrzyn


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

Grade


Lecture 18 2 Exam

Laboratory 18 2

Grade

4

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. Backannotation.

Introduction to SystemVerilog. Hardware/Software co-simulation.

LEARNING OUTCOMES:

Skills and competence in: modeling, simulation and synthesis of digital systems in Hardware

Description Languages (HDLs).





49


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

OPTIONAL READING:

-

Specialist subjects

50

DDD AAA TTT AAA SSS AAA FFF EEE TTT YYY AAA NNN DDD CCC RRR YYY PPP TTT OOO GGG RRR AAA PPP HHH YYY

Course code: 11.3-WE-I-BDiEK-PS43_ISM_S1S




Director of s tudies: Dr inż. Remigiusz Wiśniewski

Name of lecturer : Dr inż. Remigiusz Wiśniewski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

Grade


Lecture 9 1 Grade


Project 9 1

Grade

4

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++, 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.


51

LEARNING OUTCOMES:

Skills and competence in: data safety (data protection, digital signature and smartcards security), basic knowledge of cryptosystems and cryptology (either cryptography and cryptanalysis.






1. Stinson D.R., Cryptography: Theory and Practice, WNT, Warszawa, 2005.

2. Karbowski M., Podstawy Kryptografii, Helion, Warszawa, 2005.

3. Aho A. V., Hopcroft J. E., Ullman J. D., Design & Analysis of Computer Algorithms. Helion, Warszawa, 2003.

4. Maxfield C.: The Design Warrior’s Guide to FPGAs. Devices, Tools and Flows. Elsevier, Amsterdam, 2004.

OPTIONAL READING:

1. Schneier B., Applied cryptography. WNT, Wa-wa, 2002.

2. Łuba T.: Synthesis of logic devices, Oficyna Wydawnicza Politechniki Warszawskiej, Warszawa, 2005.

Specialist subjects

52

III NNN FFF OOO RRR MMM AAA TTT III CCC SSS SSS YYY SSS TTT EEE MMM SSS TTT EEE SSS TTT III NNN GGG

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

Type of course: Optional



Director of s tudies: prof. dr hab. inż. Janusz Biernat, mgr inż. Michał Doligalski

Name of lecturer : prof. dr hab. inż. Janusz Biernat, mgr inż. Michał Doligalski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

Grade


Lecture 9 1 Grade


Project 9 1

Grade

5

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). 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) include: propagation time, rise time, fall time, setup time. Electrical parameters including current, voltage. 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 microsystem of the block generator for testing. Serial bus debugging (I2C, SPI, RS-232, CAN) by means of oscilloscope. The use of specialized multimeters to analyze the Ethernet bus.

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).


53

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 diagnostic tool 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).






1. Pieńkos J., Turczyński J.: Układy scalone TTL w systemach cyfrowych. WKiŁ, Warszawa, 1986.

2. Łuba T., Programowalne układy przetwarzania sygnałów i informacji. WKiŁ 2008.

3. Kamieniecki A, Współczesny oscyloskop budowa i pomiary. BTC, Legionowo, 2009.

4. Tumański S., Technika pomiarowa, WNT, 2007.

5. Zwoliński M.: Projektowanie układów cyfrowych z wykorzystaniem języka VHDL, 2 ed., WKŁ, Warszawa, 2007

OPTIONAL READING:

[1] Rydzewski J., Pomiary oscyloskopowe. WNT, 2007.

Specialist subjects

54

FFF AAA UUU LLL TTT DDD III AAA GGG NNN OOO SSS III SSS OOO FFF DDD III GGG III TTT AAA LLL SSS YYY SSS TTT EEE MMM SSS

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

Type of course: Optional



Director of s tudies: prof. dr hab. inż. Janusz Biernat, mgr inż. Michał Doligalski

Name of lecturer : prof. dr hab. inż. Janusz Biernat, mgr inż. Michał Doligalski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

Grade


Lecture 9 1 Grade


Project 9 1

Grade

5

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).


55

Diagnosis of DSP systems: Arbitraty signal generator and digital mixed signal oscilloscope for DSP systems testing.

LEARNING OUTCOMES:

Skills and expertise in diagnostic techniques for hardware - software digital systems testing.

Knowledge of operation and ability to use digital diagnostic equipment (digital oscilloscope, logic analyzer).

Knowledge of the principles for estimating and eliminating errors of measurement and the ability to choose a diagnostic tool for digital system testing.

Ability to increase the reliability of digital systems at the stage of testing.






1. Pieńkos J., Turczyński J.: Układy scalone TTL w systemach cyfrowych. WKiŁ, Warszawa, 1986.

2. Łuba T., Programowalne układy przetwarzania sygnałów i informacji. WKiŁ 2008.

3. Kamieniecki A, Współczesny oscyloskop budowa i pomiary. BTC, Legionowo, 2009.

4. Tumański S., Technika pomiarowa, WNT, 2007.

OPTIONAL READING:

1. Rydzewski J., Pomiary oscyloskopowe. WNT, 2007.

2. Lyons R. G., Wprowadzenie do cyfrowego przetwarzania sygnałów, WKiŁ, Warszawa, 2006.

Specialist subjects

56

DDD EEE SSS III GGG NNN EEE OOO FFF MMM UUU LLL TTT III TTT III EEE RRR WWW EEE BBB SSS YYY SSS TTT EEE MMM SSS

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




Director of s tudies: Dr inż. Tomasz Gratkowski

Name of lecturer : Dr inż. Tomasz Gratkowski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

Grade


Lecture 9 1 Grade


Project 9 1

Grade

6

COURSE CONTENTS:

The Web Tier: Getting Started with Web Applications. Using of Java Servlet Technology, JavaServer Page Technology and JavaServer Faces Technology.

Web Services: Introduction to Web Services. Building Web Services with JAX-WS. 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.

Persistence Tier: Object/relational mapping facility in Java EE. Data model on all tiers in multi-tier system.

Additional services: Introduction to Security in the Java EE Platform. Design Patterns for JEE.

LEARNING OUTCOMES:

Design and programming skills in multi-tier systems in Java EE.

Integration of heterogeneous systems.

Foundational knowledge and skills required to build business application in Java EE.


57






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. Wzorce projektowe; Wydawnictwo Helion 2004;

3. Stephanie Bodoff, Eric Armstrong, Jennifer Ball, Debbie Bode Carson: J2EE. Vademecum profesjonalisty; Wydawnictwo Helion 2005;

4. Sameer Tyagi, Keiron McCammon, Michael Vorburger, Heiko Bobzin: Core JAVA Data Objects; Wydawnictwo Helion 2004;

5. Bryan Basham, Kathy Sierra, Bert Bates: Head First Servlets & JSP; Wydawnictwo Helion 2009;

6. William Crawford, Jonathan Kaplan: J2EE Stosowanie wzorców projektowych; Wydawnictwo Helion 2004;

OPTIONAL READING: 1. Joel Scamray, Mike Shema: Hakerzy aplikacje webowe. Sekrety zabezpieczeń aplikacji

webowych; Wydawnictwo Translator s.c. 2002;

2. S.Graham, S.Simeonov, T. Boubez, D. Davis, G. Daniels: Java. Usługi WWW. Vademecum profesjonalisty; Wydawnictwo Helion 2003;

3. Alan Monnox: J2EE. Podstawy programowania aplikacji korporacyjnych; Wydawnictwo Helion 2005;

Specialist subjects

58

MMM OOO BBB III LLL EEE TTT EEE CCC HHH NNN OOO LLL OOO GGG III EEE SSS AAA NNN DDD AAA PPP PPP LLL III CCC AAA TTT III OOO NNN SSS

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




Director of s tudies: dr inż. Jacek Tkacz

Name of lecturer : dr inż. Jacek Tkacz


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

Grade


Lecture 9 1 Grade


Project 9 1

Grade

6

COURSE CONTENTS:

Introduction into designing mobile application. Configuration of the programming environment (MS VISUAL STUDIO). Using emulators of mobile devices.

User interface. The design and the implementation of GUI of mobile applications my means of using MICROSOFT software products.

Access to data. Databases dedicated for mobile technology and devices. Access and synchronization with external data sources.

Exchange information between mobile application and external environment. Communications by using wireless technology: BLUETOOTH, IrDA. XML language as universal format of data exchange.

Wireless network. Communication by WLAN network (WiFi).

Systems of the satellite navigation. Serial communication with internal and external GPS modules. GPS communication protocol NMEA-0183.

LEARNING OUTCOMES:

Abilities of the design and the implementation of mobile applications by means of using .NET technology.


59






1. T. Imieliński. Mobile Computing. KLUWER, 1996.

2. J. Januszewski. System GPS i inne systemy satelitarne w nawigacji morskiej. WSM, 2004.

3. S. Shekhar, S. Chwala, Spatial database A TOUR. Prentice Hall, 1983.

4. M. Clark. Wireless Access Networks. Wiley, 2002.

5. W.Hołubowicz, P. Płóciennik. GSM cyfrowy system telefonii komórkowej. EFP, 1995.

6. W.Hołubowicz, P. Płóciennik. Systemy łączności bezprzewodowej. PDN, 1997.

7. M.Zawadzki. „Bluetooth kontra IrDA”, http://www.pckuritr.pl/archiwum/art0.asp?ID=206

8. E.Smitkowska , „IT w kieszeni – rynek urządzeń mobilnych”, Software Developer’s, 2005

9. G. Baddeley, „NMEA sentence information” http://home.mira.net/~gnb/gps/nmea.html

10. K. Nakamura, „The Global Positioning System FAQ” http://www.gpsy.com/gpsinfo/gps-faq.txt.

OPTIONAL READING:

1. MICROSOFT MSDN http://msdn.microsoft.com/pl-pl/default.aspx

2. BLUETOOTH http://www.blutooth.com

3. CODEGURU http://www.codeguru.pl/

Specialist subjects

60

OOO PPP EEE RRR AAA TTT III OOO NNN AAA LLL SSS YYY SSS TTT EEE MMM LLL EEE VVV EEE LLL PPP RRR OOO GGG RRR AAA MMM MMM III NNN GGG

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




Director of s tudies: dr inż. Grzegorz Łabiak

Name of lecturer : dr inż. Grzegorz Łabiak


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade


Project 15 1

VI

Grade


Lecture 9 1 Grade


Project 9 1

VII

Grade

6

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 API functions.


61






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:

-

Specialist subjects

62

MMM III CCC RRR OOO PPP RRR OOO CCC EEE SSS SSS OOO RRR SSS YYY SSS TTT EEE MMM SSS

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




Director of s tudies: dr inż. Mirosław Kozioł

Name of lecturer : dr inż. Mirosław Kozioł, dr inż. Janusz Kaczmarek


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam


Project 15 1

V

Grade


Lecture 18 2 Exam

Laboratory 18 2 VI

Grade

7

COURSE CONTENTS:

Introduction. Outline of the presented material. Literature for the course. Evolution of microprocessor engineering.

Microprocessor systems. Basic components of microprocessor system. System buses. Data and program memory. Input-output ports. Peripheral systems. Microprocessor and microcontroller. Basic registers. Flags in processor status word. Stack.

Instructions. Instruction. Program. Machine code. Mnemonic opcodes. Assembler. CISC and RISC microprocessors. Instruction execution. Instruction and machine cycle. Pipelining. Basic addressing modes. Basic groups of instructions.

Memories in microprocessor systems. Basic memory types. Write and read operations. Basic memory parameters.

Information in microprocessor system. Organization and synchronization of information transmission. Three-state buffers as a means of access to system buses. Von Neuman architecture. Harvard architecture, Modified Harvard architecture.

Interfacing of external peripheral systems. Address decoder design on the basis of middle scale of integration chips and PLD devices.

Handling of peripheral devices. Polling. Interrupt system. Direct memory access.

Local serial interfaces. I2C. SPI. 1-Wire.

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).


63

MCS-51 family microcontrollers. The most significant features of their architecture. Functional blocks. Interfacing of external program and data memory. Available addressing modes. Embedded peripheral systems i.e. timer-counters and serial interface. Multiprocessor communication. Interrupts. Interrupt handling conditions. Parallel ports. System reset. Register values after reset. Power-saving modes of operation. Instruction set. Assembler and C-language extensions for this microcontroller family. Programming examples in assembler and C.

The most encountered embedded peripheral systems. Analog comparators. Brown-out detector. Enhanced serial port. Pulse-width modulation. Watchdog. Hardware controllers of SPI and I2C interfaces. A/D and D/A converters. Handling of mentioned systems by software 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 starting 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.






[1] Bogusz J.: Lokalne interfejsy szeregowe, Wydawnictwo BTC, Warszawa, 2004

[2] Hadam P.: Projektowanie systemów mikroprocesorowych, Wydawnictwo BTC, Warszawa, 2004

[3] Kalisz J.: Podstawy elektroniki cyfrowej, WKŁ, Warszawa, 2002

[4] Krzyżanowski R.: Układy mikroprocesorowe, Mikom, Warszawa, 2004

[5] Mielczarek W.: Szeregowe interfejsy cyfrowe, Wydawnictwo Helion, Gliwice, 1993

[6] Pełka R.: Mikrokontrolery: architektura programowanie, zastosowania, WKŁ, Warszawa, 2000

[7] Sacha K., Rydzewski A.: Mikroprocesor w pytaniach i odpowiedziach, WNT, Warszawa, 1987

[8] Starecki T.: Mikrokontrolery 8051 w praktyce, Wydawnictwo BTC, Warszawa, 2002

[9] Zieliński B.: Układy mikroprocesorowe. Przykłady rozwiązań, Wydawnictwo Helion, Gliwice, 2002

OPTIONAL READING:

-

Specialist subjects

64

III NNN FFF OOO RRR MMM AAA TTT III OOO NNN SSS YYY SSS TTT EEE MMM SSS III NNN MMM AAA NNN AAA GGG EEE MMM EEE NNN TTT

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




Director of s tudies: Dr hab inż. Wiesław Miczulski, dr inż. Marek Florczyk

Name of lecturer : dr inż. Marek Florczyk


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

V

Grade


Lecture 18 2 Exam

Laboratory 18 2 VII

Grade

5

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. Cost of built and technology used to built e-shop.


65

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.

Electronic Banking: Home Banking and Internet Banking. Stages of implementation. Statistical data – Internet Banking in Poland. Security and Internet Banking. ELIXIR and SWIFT.

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.

LEARNING OUTCOMES:

Design and implementation of Management Information Systems and CRM Systems for small business.





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

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

[3] Kotler P.: Marketing Management, Prentice Hall; 2006

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

OPTIONAL READING:

-

Specialist subjects

66

CCC OOO MMM PPP UUU TTT EEE RRR --- AAA III DDD EEE DDD DDD EEE SSS III GGG NNN

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




Director of s tudies: Dr inż. Janusz Kaczmarek

Name of lecturer : Dr inż. Janusz Kaczmarek


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 15 1 Grade

Laboratory 30 2

V

Grade


Lecture 9 1 Grade


Project 9 1

V

Grade

4

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.


67






[1] Winiecki W., Nowak J., Stanik S.: Integrated graphical programming environments for designing and creating the computer measurement and control systems, MIKOM, Warszawa, 2001 (in Polish).

[2] Khalid S.F.: LabWindows/CVI Programming for Beginners. Prentice Hall PTR, 2000.

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

[4] Johnson G.W, Jennings R.: LabVIEW Graphical Programming. McGraw-Hill Professional, 2006.

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

OPTIONAL READING:

-

Specialist subjects

68

III NNN TTT EEE RRR NNN EEE TTT AAA PPP PPP LLL III CCC AAA TTT III OOO NNN

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




Director of s tudies: Dr inż. Robert Szulim

Name of lecturer : Dr inż. Robert Szulim


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Laboratory 30 2

V

Grade


Lecture 18 2 Grade


Project 9 1

VI

Grade

4

COURSE CONTENTS:

Primary protocols and services of Internet. Description of work of protocols: TcpIp, Http, Ftp.

WWW and FTP servers. Description of work of servers, configuration and management.

Client – Server Databases. Description of work, objects and projecting of structures of databases.

WWW Technologies. Static and dynamic technologies of creating WWW pages – review.

Microsoft .NET technology. Description of basics of work of 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 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, starting and configuring of WWW and FTP Server, projecting WWW pages with Access to databases.


69






[1] Ullman Jeffrey D., Widom Jennifer , Primary lecture of databases, Wydawnictwo Naukowo Techniczne, Warszawa 2001 (in Polish)

[2] Coburg R, SQL for everyone, Helion , 2001 (in Polish)

[3] Pinkoń K., ABC of the Internet, Helion, 1998 (in Polish)

[4] Liberty J, Hurwitz D, ASP.NET programming, Helion, 2007 (in Polish)

OPTIONAL READING:

-

Specialist subjects

70

III NNN DDD UUU SSS TTT RRR III AAA LLL CCC OOO MMM PPP UUU TTT EEE RRR NNN EEE TTT WWWOOO RRR KKK

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




Director of s tudies: Dr inż. Adam Markowski

Name of lecturer : Dr inż. Adam Markowski


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 18 2 Grade

Laboratory 18 2

VI

Grade


Lecture 30 2 Grade


Project 15 1

VII

Grade

6

COURSE CONTENTS:

The evolution of measuring – controlling systems. The architecture of computer industrial networks. Topology of industrial networks. Transmission media: twisted cable, optical waveguide, electric network, wireless solutions.

Access methods to a medium in industrial networks. Master - Slave, Token-Passing, Token-Ring and CSMA.

Standard communication protocols. Characteristics of standard communication protocols PROFIBUS, MODBUS, FIP, P-NET, CAN, LonWorks and INTERBUS-S.

Industrial Ethernet. Internet technologies in computer industrial networks. Dedicated WWW and FTP servers.

Analysis of communication efficiency and time parameters of selected protocols. Transparency, scalability, 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. Node self-configuration methods of an industrial network. Creation and configuration technology for industrial network segments. Communication software. Utility programs for creating information applications in industrial networks .

Integration and management of industrial networks. Methods of industrial network integration.

Industrial network analysers and testers. Properties of industrial networks analysers and testers.


71

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.






[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)

OPTIONAL READING:

-

Specialist subjects

72

SSS III GGG NNN AAA LLL PPP RRR OOO CCC EEE SSS SSS III NNN GGG TTT EEE CCC HHH NNN III QQQ UUU EEE SSS

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




Director of s tudies: Dr inż. Leszek Furmankiewicz

Name of lecturer : Dr inż. Leszek Furmankiewicz


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Laboratory 30 2

VI

Grade


Lecture 18 2 Exam

Laboratory 18 2 VII

Grade

6

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 necessitarian 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.


73

LEARNING OUTCOMES:

Skills and competences in the range of the: signals and measuring transducers description in the time domain and in the frequency domain; principle of work, characteristics and a basic design of signal conversion circuit with initial signal conversion, analog to digital conversion and digital to analog conversion.





[1] Horowitz P., Hill W.: The Art of Electronics, Cambridge University Press, New York, 1989

[2] Kulka Z. i inni: Analog to Digital and Digital to Analog Converters, WNT, Warsaw, 1987 (in Polish)

[3] Lyons R. G.: Introduction to Digital Signal Processing, WKŁ, Warsaw, 1999 (in Polish)

[4] Sydenham P. H. (Ed.): Handbook of Measurement Science – Vol - 1: Theoretical Fundamentals, John Wiley & Sons, Chichester,1991

[5] Szabatin J.: Basic Signal Theory, WKŁ, Warsaw, 2003 (In Polish)

[6] Tietze U., Schenk Ch.: Semiconductors Circuits , WNT, Warsaw, 2001(in Polish)

[7] Tumański S.: Measuring Technique, WNT, Warsaw, 2007 (in Polish)

OPTIONAL READING:

-

Specialist subjects

74

WWW III RRR EEE LLL EEE SSS SSS NNN EEE TTT WWWOOO RRR KKK

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




Director of s tudies: Doc dr inż. Emil Michta

Name of lecturer : Doc dr inż. Emil Michta


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Exam

Project 15 1

VI

Grade


Lecture 18 2 Exam

Project 9 1 VII

Grade

6

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. 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. Satellite networks. Terrestrial transmission: multipoint distribution systems MMDS and local distribution systems LMDS. 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. Hot – spots design. WLAN networks analysis. Upgrading of WLAN networks performance.

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.


75





[1] Gast S.M.: 802.11 Wireless networks. Helion. Gliwice, 2003.

[2] Poter B., Fleck B.: 802.11 Security. Helion. Gliwice, 2004.

[3] Roshan P., Leary J.: LAN wireless networks. Mikom, Warszawa, 2004.

OPTIONAL READING:

-

Specialist subjects

76

SSS OOO FFF TTT WWW AAA RRR EEE FFF OOO RRR MMM EEE AAA SSS UUU RRR EEE MMM EEE NNN TTT AAA NNN DDD CCC OOO NNN TTT RRR OOO LLL EEE QQQ UUU III PPP MMM EEE NNN TTT

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




Director of s tudies: Dr inż. Leszek Furmankiewicz

Name of lecturer : Dr inż. Leszek Furmankiewicz


Number o

f

teachin

g h

ours

per semeste

r

Number o

f

teachin

g h

ours

per w

eek

Semeste

r


for a course


a l located


Lecture 30 2 Grade

Project 15 1

VI

Grade


Lecture 18 2 Grade

Project 9 1 VII

Grade

4

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. VXI standard. General description of VXI standard.

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.

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.


77





[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] Caristi A., J.: IEEE-488 General Purpose Instrumentation Bus Manual, Academic Press, INC., San Diego, California, 1992

[4] Lesiak P., Świsulski D.: Computer Measuring Technique in Examples, PAK, Warsaw, 2002 (in Polish)

[5] Nawrocki W.: Computer Measuring Systems, WKiŁ, Warsaw, 2002 (in Polish)

[6] Rak R., J.: Virtual Measuring Instrument - Real Tool of Present Metrology, Warsaw University of Technology Press, Warsaw, 2003 (in Polish)

[7] Nawrocki W.: Distributed Measuring Systems, WKŁ, Warsaw 2006 (in Polish).

OPTIONAL READING:

-

katalog przedmiotow ects - i s i s eng v01

Documents