CompScience undregraduate ECTS Inf Ist · model to statistical inference K1I_W01 Is aware of the...

Faculty of Computer, Electrical and Control Engineering

Subject area of studies: Computer Science

Undergraduate programme

FACULTY OF COMPUTER, ELECTRICAL AND CONTROL ENGINEERING

UNIVERSITY OF ZIELONA GÓRA

COMPUTER SCIENCE




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

Type of course: compulsory

Language of ins truc t ion: Polish

Direc tor of studies: Prof. Dariusz Uciński, Ph.D., D.Sc.

Name of lec turer : Prof. Dariusz Uciński, Ph.D., D.Sc.

Form of instruct ion

Number of

teachin

g

hours

per

semeste

r

Number of

teachin

g

hours

per

week

Semeste

r Form of rece iving a credit

for a course

Number of ECTS credi ts

a l loca ted

Ful l - t ime studies

5

Lecture 30 2 II

Grade

Class 30 2 Grade

Part - t ime studies

Lecture 18 2 II

Grade

Class 18 2 Grade

COURSE OBJECTIVE: To provide basic knowledge of qualitative and quantitative data analysis

To form a critical view on the credibility of statistical analysis in engineering

To give basic skills of uncertainty estimation in practical experimental studies in engineering

ENTRY REQUIREMENTS: Mathematical analysis, Linear algebra with analytic geometry

COURSE CONTENTS: Measurement uncertainty. Propagation of uncertainty. Random and systematic errors. Statistical sampling study. Frequency distribution. Histogram. Summary statistical measures of location, variability, asymmetry and concentration. Rejection of outliers. Probability. Sample space. Basic definitions of probability: classical, frequency and modern. Fundamental properties of probability. Conditional probability. Independence. Total probability theorem. Bayes’ Theorem. Discrete and continuous random variables. Discrete random variables. Distributions: binomial, Bernoulli, Poisson and geometric. Functions of random variables. Expected value and variance. Joint probabilisty distributions of many random variables. Independence of random variables. Continuous random variables. Uniform distribution. Exponential distribution. Cumulative distribution function of a random variable. Normal distribution.




Fundamentals of statistical inference. Types of random samples. Simple random sample. Distributions: chi-square, t-Student and Fisher-Snedecor. Point and interval estimation. Unbiasedness, consistency, efficiency and sufficiency. Parameter and non-parameter estimation. Confidence intervals for the mean. Limit theorems. Interval estimates of the proportion, variance, standard deviation, differences between proprtions and means. Determining the required sample size. Hypothesis testing. One- and two-sided tests of the mean. Testing the proportion. Testing the variance. Selecting the test procedure.

TEACHING METHODS: Lecture, exercise classes.

LEARNING OUTCOMES:

Code Effects of the course K1I_U05 Can critically evaluate the reliability of statistical analyses K1I_W01 Knows and understands assumptions of statistical tests K1I_W01, K1I_U05 Can calculate confidence intervals and interpret them K1I_W01, K1I_U05 Can use theoretical distributions (Binomial, Poisson, Normal,

Student's DF, Chi-square) K1I_U05

Can choose and calculate appropriate measures of central tendency and dispersion

K1I_U05 Can make a preliminary analysis of data and pass from a probabilistic model to statistical inference

K1I_W01 Is aware of the importance of data analysis in engineering practice

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA:

Lecture – the passing condition is to obtain positive marks from written or oral tests conducted at least once per semester.

Practice – the passing condition is to obtain positive marks from all exercises and tests conducted during the semester.

Calculation of the final grade: lecture 50% + laboratory 50%

STUDENT WORKLOAD:

Full-time studies No. of hours Type of workload ECTS

60 Class participation 2,0

18 Reading of supplementary texts 0,6

18 Preparation for classes 0,6

18 Preparation of reports 0,6

18 Assignment completion 0,6

18 Personal and on-line consultations 0,6

150 Total 5

Part-time studies No. of hours Type of workload ECTS







150 Total 5




RECOMMENDED READING:

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

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

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

4. Montgomery D.C., Runger G.C.: Applied statistics and probability for engineers, 3rd Ed., Wiley, 2003

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Ryszard Rysbki, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Ryszard Rybski, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 II

Grade

Laboratory 30 2 Grade


Lecture 9 1 II

Grade


COURSE OBJECTIVE:

To familiarize with the basic methods and measuring instruments.

To familiarize with the basic operations of the analog, analog - digital and digital-to-analog on measuring signals.

To familiarize with the basic types of sensors and measuring systems functional blocks.

To shape skills to perform simple measurement tasks.

ENTRY REQUIREMENTS: Experimental techniques I

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

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

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




Measurements of selected electric and non-electric quantities. General characteristics of sensors. Principle of operation and properties of selected sensors. Smart sensors.

General characteristics of measurement systems. Types and configurations of measurement systems. Basic functional blocks of measurement systems. Converters and system instruments, sub-systems for measuring Signac acquisition, fieldbus, interface, system controller.

TEACHING METHODS: Lecture, laboratory exercises.

LEARNING OUTCOMES:

Code Effects of the course K1I_U07, T1A_U08, T1A_U15

Can use measurement devices and realize uncomplicated measurement tasks

K1I_W03, T1A_W02, T1A_U15

Enumerates and describes sensor types and types and configurations of measurement systems

K1I_W03, T1A_W02, T1A_W07

Names and recognizes basic measurement devices as measurement realization means a basic experimentation technique element

K1I_W03, T1A_W02, T1A_W07

Names and characterizes basic analog , analog-digital and digital –analog operations for signal processing


Lecture – the credit is given for obtaining positive grades in written tests carried out at least once a semester.

Laboratory – to receive a final passing grade student has to receive positive grades in all laboratory exercises provided for in the laboratory syllabus.


STUDENT WORKLOAD:







15 Preparation to tests 0,5

120 Total 4








120 Total 4





1. Tumanski S.: Principles of electrical measurement. Taylor & Francis, 2006

2. Bhargawa S.C: Electrical measuring instruments and measurements. CRC Press, 2012

3. Horowitz P., Hill W.: The art electronics. Cambridge University Press, 1999

4. Dunn P.F.: Fundamentals of sensors for engineering and science. CRC Press, 2011

5. Miłek M.: Electrical metrology of nonelectrical quantities. Oficyna Wydawnicza Uniwersytetu Zielonogórskiego, Zielona Góra, 2006 (in Polish)

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Andrzej Pieczyński, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Andrzej Pieczyński, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r

Form of rece iving a credit

for a course


a l loca ted


2

Lecture 15 1 III

Grade



Lecture 9 1 III

Grade


COURSE OBJECTIVE: To provide basic knowledge about fundamentals of computer hardware structure and principles of operation.

To provide basic knowledge about conditions of data transfer, storage and processing.

To give basic skills about rules of computer operation and working in parallel architecture of computers.

ENTRY REQUIREMENTS: -

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 prognoses and implementation. Information processing models.

RISC architectures and characteristics. Parallel programs and machines. Acceleration mechanisms. Pipelining. Branch prognoses. 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 synchronization techniques. Decomposition of problem for parallel computing. Distributed systems


LEARNING OUTCOMES:

Code Effects of the course K1I_K05, K1I_K06, K1I_k09, K1I_K10

Is open to using new solutions in hardware.

K1I_W07 Has knowledge on the operation of a multiprocessor computer based on a parallel architecture

K1I_W07 Has knowledge on the tasks of digital elements included in hardware K1I_W07 Has knowledge on the functions of basic computer components. K1I_U11 Can assemble a computer set from available components K1I_U12 Can handle BIOS start systems K1I_U11 Can prepare the configuration of a computer system K1I_U11 Can use various computer configurations


Lecture – the passing condition is to obtain a positive mark from the final test.

Laboratory – the passing condition is to obtain positive marks from all laboratory exercises to be planned during the semester.


STUDENT WORKLOAD:

Full-time studies

No. of hours Type of workload ECTS 30 Class participation 0,8






75 Total 2











75 Total 2


1. Chevance R.J.: Server Architectures: Multiprocessors, Clusters, Parallel Systems, Web Servers, and Storage Solutions, Elsevier Digital Press, 2004

2. Hyde R.: Write Great Code: Volume I: Understanding the Machine, No Starch Press, 2004

3. Metzger P.: PC Anatomy, wydanie VI, Helion, 2003 (in polish)

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

5. Nisan N.: The Elements of Computing Systems: Building a Modern Computer from First Principles, MIT Press (MA), 2005

6. Tanenbaum A.: Structured Computer Organization, Prentice Hall, 1998

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Paweł Majdzik, Ph.D.

Name of lec turer : Ass. Prof. Paweł Majdzik, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


7

Lecture 30 2 II

Exam



Lecture 18 2 II

Exam


COURSE OBJECTIVE: To provide basic knowledge about object programming paradigms.

To provide basic knowledge about abstract data typing definition with member functions (encapsulation),

To provide basic knowledge about inheritance, polymorphism and virtual functions, templates of classes and functions.

To give basic skills in designing programs and utilizing tools (e.g. tools from Standard Template Library).

ENTRY REQUIREMENTS: Principles of programming, Algorithms and data structures

COURSE CONTENTS: Introduction to object programming. Concept of abstract data typing. Class definition. Encapsulation – declaration and definition of class member methods. Passing parameters to member functions: via value and via reference. Private and public class members.

Constructors and destructors. Default and copy constructors. Constructor initialization list. Synthesized constructors. Destructors. Operator overloading. User defined conversions: converting function, converting constructor.




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

Inheritance rules.

Inheritance and the composition of objects. Protected members. Multiple and multi-base inheritance. Problem of variable names in multi-base inheritance.

Polymorphism. Polymorphism. Virtual functions. Pure virtual functions. Early and late binding. Time and memory costs connected with application of polymorphism. Abstract classes - defining and examples of abstract classes application in object-oriented programs.

Standard Template Library. Function templates. Specialized functions. Phases of function adjustment. Class templates. Definition of class templates. Class templates versus micro- definitions. Containers and algorithms, iterators, associative containers, function objects. Designing of object-oriented programming.

Design pattern . Adapter pattern, facade pattern, bridge pattern etc..


LEARNING OUTCOMES:

Code Effects of the course K1I_W09 Knows basic design templates and understands their meanings in flexible

software design. K1I_U15 Student is able to design and implement simple object programs K1I_U15 Can define and implement basic integral class elements: constructors,

operator functions, destructors K1I_W09 Understands basic concepts related to object programming:

encapsulation, homogeneity K1I_W09 Can define and implement basic integral class elements: constructors,

operator functions, destructors

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the passing condition is to obtain a positive mark from the examination.



STUDENT WORKLOAD:







210 Total 7







210 Total 7




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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Marcin Mrugalski, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Marcin Mrugalski, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


2

Lecture 30 2 II

Grade


Lecture 18 2 II

Grade

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

ENTRY REQUIREMENTS: Computer architectures

COURSE CONTENTS: Introduction to computer networks: Classification of computer networks. Reference models: ISO/OSI and TCP/IP.

Physical layer: Types of physical media: copper wire, optical fiber and wireless. Physical topology. Collision domains. Network devices of physical layer: hub and repeater. Data link layer: Concepts and technologies. Logical topologies. LAN networks segmentation. Network devices of data link layer: NIC, bridge and switch. Fundamentals of switch configuration. LAN networks standards: Fast Ethernet, Gigabit Ethernet and 10 Gigabit Ethernet.

Network layer: Routing and addressing. Routing protocols and routed protocols. Network layer device: router. IPv4 address management.

Transport layer: Functions and TCP and UDP transports protocols.




Session, presentation and application layers: Functions and protocols. Internet technology components. Introduction to routers: Router components and operation. User interface and configuration principle. Troubleshooting.

TEACHING METHODS: Lecture.

LEARNING OUTCOMES:

Code Effects of the course

K1I_U13 Is able to operate the tools for creating and testing network cabling in Ethernet technology.

K1I_W08, K1I_U13, K1I_U14

Can diagnose the infrastructure of hardware and software of LAN, MAN and WAN.

K1I_W08, K1I_U13, K1I_U14

Can choose, configure and operate network devices, in particular switches and routers.

K1I_U13, K1I_K09, K1I_K10 Can creatively develop the division of IP address space into subnets.

K1I_W08, K1I_U13 Can present currently available LAN and WAN technologies on the market.

K1I_U13, K1I_K09 Can run basic configuration of static and dynamic routing. K1I_W08, K1I_U13 Can characterize ISO/OSI and TCP/IP models.



Calculation of the final grade: lecture 100%

STUDENT WORKLOAD:


30 Class participation 1 30 Reading of supplementary texts 1 60 Total 2


18 Class participation 0,6 42 Reading of supplementary texts 1,4 60 Total 2


1. Dye M., McDonald R., Rufi A.: CCNA 1 Exploration Network Fundamentals. Cisco Networking Academy, Indianapolis, Indiana, 2012.

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Krzysztof Patan, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Krzysztof Patan, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 III

Grade



Lecture 18 2 III

Grade


COURSE OBJECTIVE: To provide basic knowledge about fundamentals of computer system structure and principles of operation.

To provide basic knowledge about operating system design, operating systems tasks and operating systems types.

To give basic skills in operating system configuration and management.

ENTRY REQUIREMENTS: Principles of programming, Computer architectures I and II, Algorithms and data structures

COURSE CONTENTS: Computer system structure: Operating memory, CPU, I/O devices, idea of the interrupt, dual model of system operation. Operating systems types: Batch systems, multiprogramming systems, time-sharing (multi-tasking) systems, parallel systems, distributed systems, networked systems, real-time operating systems.

Operating systems design. Basic components of operating systems. Operating systems services. Kernel based systems, virtual machines. System calls.




CPU scheduling. Scheduling criteria, scheduling algorithms. Evaluation of scheduling algorithms. Round robin, priority scheduling, preemptive scheduling. Memory management. Logical and physical addresses space. Contiguous allocation. Fragmentation: external and internal. Packing. Paging. Segmentation. Virtual memory. Demand paging. Page replacement. Performance of demand paging. Algorithms of page replacement. Allocation of frames. Demand segmentation.

File system. File concept. Directory structure. File system structure. Allocation methods. Free-space management. File system structure.

Windows Vista/7/8, Windows Server 2008. System configuration, administration tasks, administration tools. Managing files and directories. User accounts, group accounts. Rights to files, directories and system components. Audit of system components. Monitoring operating system. Analysis of system components.


LEARNING OUTCOMES:

Code Effects of the course K1I_K01 Is aware of the dynamic development of the discipline. K1I_W10 Is open to new technologies and is ready to implement them

K1I_U23 Can carry out computer hardware and software configuration process and

analyze and verify current OS configuration

K1I_U23 Can apply and analyze processor timing queuing algorithms, operational memory allocation and explain file system operation rules

K1I_W10 Student can name computer system sub-components and define operating systems tasks





STUDENT WORKLOAD:








150 Total 4











150 Total 4


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

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

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Krzysztof Patan Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Radosław Patan, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 IV

Grade



Lecture 9 1 IV

Grade


COURSE OBJECTIVE: To provide basic knowledge about operating systems classification and features.

To provide knowledge about UNIX operating system construction and operation.

To give skills in operating the UNIX mechanisms, tools and scripting.

To provide basic knowledge about UNIX administration.

ENTRY REQUIREMENTS: Operating systems I

COURSE CONTENTS: Operating system: construction, features, selection for a given purpose.

Remote system operation, users, configuration files. File system. Filename, Meta-characters. Filles-related commands. Typical filesystem tree.

Displaying the text files. Access rights. FTP. Vi editor.

Find command.

Shell programs. Configuration files, variables.

Streams and pipelines. Redirecting data. Filters. Regular expressions.

Shell programming. Tests. Conditions. Loops. Functions.

Advanced processing of test files. sed editor. awk filter.




Element of system administration.


LEARNING OUTCOMES:

Code Effects of the course K1I_W10 Knows basic principles and of tools of UNIX system administration K1I_W10, K1I_U23 Can develop programs in UNIX shell K1I_W10, K1I_U23 Understands specifics and differences in application of diverse operating

systems K1I_W10 Knows UNIX system commands and tools K1I_U23 Can apply UNIX system commands and tools

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the passing condition is to obtain a positive mark from the final test.



STUDENT WORKLOAD:








12 Preparation to exam 0,4

120 Total 4









150 Total 4

RECOMMENDED READING: 1. Pratta S., Martin D.: Biblia systemu UNIX V, LT&P, Warszawa 1994.

2. Marczyński J.: Unix: użytkowanie i administracja, Helion, 2000.

3. Armstrong J., Taylor D.: UNIX dla każdego, Helion, 2000

OPTIONAL READING: 1. Lal K., Rak T.: Linux. Komendy i polecenia. Praktyczne przykłady, Helion, Gliwice, 2005.

REMARKS: -




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



Direc tor of studies: Ass. Prof. Andrzej Czajkowski, Ph.D.

Name of lec turer : Ass. Prof. Andrzej Czajkowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 30 2 III

Grade



Lecture 18 2

Grade


COURSE OBJECTIVE:

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

ENTRY REQUIREMENTS: Principles of computer science

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.


LEARNING OUTCOMES:

Code Effects of the course K1I_K01 Is aware of the dynamic development of the discipline. K1I_W10 Is open to new technologies and is ready to implement them

K1I_U23 Can carry out computer hardware and software configuration process and

analyze and verify current application configuration

T1A_W03 Can apply and analyze digital media, and explain technical requirements

K1I_W10 Student can name computer graphics system sub-components





STUDENT WORKLOAD:


60 Class participation 2






150 Total 5


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

Various web-based sources.

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Andrzej Marciniak, Ph.D.

Name of lec turer : Ass. Prof. Andrzej Marciniak, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 30 2 IV

Grade

Project 15 1 Grade


Lecture 18 2 IV

Grade

Project 9 1 Grade

COURSE OBJECTIVE: 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.

To provide basic knowledge about fundamentals of software development process.

To give basic skills in use, configuration and management of CASE tools.

ENTRY REQUIREMENTS: Principles of programming, high level programming

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 Computer Aided Software Engineering tools. Upper and Lower CASE, CASE workbenches.




TEACHING METHODS: Lecture, project.

LEARNING OUTCOMES:

Code Effects of the course K1I_W09, K1I_U16, K1I_U18, K1I_K04, K1I_K06

Can develop a project plan, documentation of requirements, requirement specification as well as functional and program specification, can also evaluate the quality of a project using appropriate tools

K1I_W09, K1I_U17, K1I_K04, K1I_K06

Can define and characterize basic software production cycles

K1I_W09, K1I_K04 Understands software distribution and maintenance problems, can work and communicate in a programming team

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – one written test of 1.5 hours (75%) and coursework (25%) involving projects.

Project – a completed project involving analysis, design and development of an information system.

Calculation of the final grade: lecture 50% + project 50%

STUDENT WORKLOAD:







180 Total 5







180 Total 5

RECOMMENDED READING: 1. Sommerville I.: Software Engineering Addison-Wesley, 9th edition, 2013.

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

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Wojciech Zając, Ph.D.

Name of lec turer : Ass. Prof. Wojciech Zając, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 I

Grade



Lecture 18 2 I

Grade


COURSE OBJECTIVE: To provide basic knowledge about computer system architecture and programming.

To provide basic knowledge about C program structure and design.

To give basic skills in using C commands and functions to solve programming problems.


COURSE CONTENTS: Computer system structure: Operating memory, CPU, I/O devices, idea of the interrupt, dual model Computer system architecture and resources. Operating system. Program design. Programming languages. The data and its representation. Algorithm visualisation. Algorithmic languages. Program performance analysis.

C programming. Program structure, commands syntax. Constants, variables, data types. Operators, expressions and basic instructions of C.

Basic operations on variables. Arithmetical operators, hierarchy. Data input and output. Printout formatting with printf function. Flag, field width, precision, formatting character. Character conversion. ASCII table.

Complex instructions, expressional instruction, empty instruction, grouping instruction. Control instructions: if-else, switch. Loops: do, while, for.

Expressions and operators. Functions: structure, arguments, result, prototype, declaration, calling out. Communication with other elements. Use of functions. Recurrence functions.




Pointers: rules of operation, declaration, using the address and the pointed value. Use of pointers to communicate with other elements.

Tables: declaration, usage, examples. String as a table of characters. Name of a table as a pointer. Tables of tables: declaration, usage, examples.

Data structures. Features, operation. Tables of structures. Fields. Unions.

Disk file. Definition, structure, buffering. Directory, path. File operations: creating a stream, file opening, reading/writing, closing.


LEARNING OUTCOMES:

Code Effects of the course K1I_W09, K1I_U15 Can realize a programming project individually, if necessary with

additional self-studying. K1I_W09, K1I_U15, K1I_K06

Knows and can solve examples of software tasks working individually or in a team

K1I_W09, K1I_U15 Knows and can practically apply principles of C language software design and analyze an example program





STUDENT WORKLOAD:








120 Total 4








120 Total 4





1. Brad Jones. Teach Yourself C in 21 Days, Macmillan Computer Publishing, http://lib.daemon.am/Books/C/

2. Mike Banahan, Declan Brady and Mark Doran, The C Book, Addison Wesley, 1991, available free on-line: http://publications.gbdirect.co.uk/c_book/

3. K. N. King, C Programming: A Modern Approach, 2008


OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Jacek Tkacz, Ph.D.

Name of lec turer : Ass. Prof. Jacek Tkacz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


7

Lecture 30 2 IV

Grade



Lecture 18 2 IV

Grade


COURSE OBJECTIVE:

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

ENTRY REQUIREMENTS: Principles of programming.

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:

Code Effects of the course K1I_U25 Can program more complex algorithms to access data using PL / SQL. K1I_U24 Can properly use transactions and indexing K1I_W12, K1I_U24 Can choose the proper model of data bases depending on the designed

system. K1I_W12 Correctly model the particular relational data model K1I_U25 Applies SQL language in accessing data in various types of data base

systems K1I_U24 Can present modeled SQL databases examples

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture - pass exam.

Laboratory - positive marks for all exercises.


STUDENT WORKLOAD:








25 Preparation for exam 0.83

210 Total 7








27 Preparation for exam 0.9

210 Total 7

RECOMMENDED READING: 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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Prof. Józef Korbicz, Ph.D., D.Sc.

Name of lec turer : Prof. Józef Korbicz, Ph.D., D.Sc.

Ass. Prof. Marek Kowal, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


7

Lecture 30 2 IV

Exam



Lecture 18 2 IV

Exam


COURSE OBJECTIVE: To familiarize students with different graph search strategies.

To familiarize students with methods of searching with constraints.

To familiarize students with artificial neural networks and their learning algorithms.

To give skills in solving practical engineering problems using artificial intelligence methods.

ENTRY REQUIREMENTS: Principles of programming

COURSE CONTENTS: Solving problems by searching: Theory of graphs. The breadth first search algorithm. The depth first search algorithm. The A* search algorithm. Heuristic functions. Memory and time complexity of graph search strategies.

Adversarial search: Optimal strategies. The minimax algorithm. The alpha-beta pruning algorithm. Evaluation functions. Problems that include element of chance.

Constraint satisfaction problems: Types of constraints. Backtracking search strategy. Heuristics: most constrained variable, minimum remaining values, forward checking and arc consistency. Artificial neural networks: Structure of biological neuron. Mathematical model of a neuron. Simple perceptron. Perceptron learning rule. Perceptron limitations. Models of neurons and their properties. Multi-




layer neural networks. Learning single-layer neural network. Learning multi-layer neural network. Error back propagation algorithm. Sample applications of artificial neural networks.


LEARNING OUTCOMES:

Code Effects of the course K1I_U27 Can creatively use learned methods of AI in order to solve new problems. K1I_W13 Is aware of the computational complexity of learned AI methods. K1I_W13 Can name and characterize graphs searching algorithms. K1I_U27 Creates breadth first, depth first and A* searching programs. K1I_U27 Select a heuristic function for a given problem. K1I_W13 Can implement and apply mini-max and alfa-beta algorithms. K1I_W13 Can explain the operating principle of search algorithms with constraints. K1I_W13 Can name artificial neurons types and characterize their properties.




STUDENT WORKLOAD:




30 Preparation for classes 1



15 Preparation for exam 0,5

210 Total 7








210 Total 7

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

2002.

OPTIONAL READING: 1. Bishop C.: Pattern Recognition And Machine Learning, Springer Verlag, 2006.

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

3. Mitchell T.M.: Machine Learning, McGrawHill, 1997

REMARKS: -




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



Direc tor of studies: Ass. Prof. Michał Doligalski, Ph.D.

Name of lec turer : Ass. Prof. Michał Doligalski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 II

Grade



Lecture 18 2 II

Grade


COURSE OBJECTIVE: To provide basic knowledge about principles of fundamental Boolean and their application to digital design.

To provide basic knowledge about combinational and sequential digital/logic circuits, and modular design techniques.

To provide basic knowledge about datapath and control unit design, and memory.

To give basic skills in analysis and synthesis of logic circuits.

ENTRY REQUIREMENTS: Mathematical foundations of engineering, Logic for computer science, Experiment methodology I, Computer architecture I

COURSE CONTENTS: Digital Computers and Information. Binary signals. Number systems, operations and conversions: decimal, binary, octal, hex. Codes: BCD, parity, Gray.

Combinational Logic. Logic gates. Logic functions. Standard forms: minterms/maxterms, SoP, PoS. Karnaugh maps. Two-level/Multilevel circuit optimization and implementations.

Combinational Functions and Circuits. Decoders/Encoders. Multiplexers, implementation. Iterative Circuits. Binary Adder/Subtractors.




Sequential Circuits. Latches. Flip-flops. Finite State Machines. Mealy vs. Moore machines. Sequential Circuit Design: state assignment, designing with D and JK flip-flops.

Registers. Registers with Load Enable and with Parallel Load. Register Transfers. Shift Registers, Shift Registers with Parallel Load, Bidirectional/Universal Shift Registers.

Counters. Ripple Counters. Synchronous Binary Counters: design with D and JK flip-flops. Binary Up-Down Counter. Binary Counter with Parallel Load. BCD and Arbitrary Sequence Counters. Modulo N counters.

Introduction to VHDL Language.


LEARNING OUTCOMES:

Code Effects of the course K1I_K01 Is aware of the dynamic development of the discipline K1I _U19 Can design simple combinational and sequential circuits K1I _U19 Can run the synthesis of combinational circuits using digital functional

blocks K1I _W04 Knows basic design methods for simple digital systems (specification,

analysis and synthesis)





STUDENT WORKLOAD:








150 Total 4








150 Total 4




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

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

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

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

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Assoc. Prof. Ryszard Rybski, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Ryszard Rybski, Ph.D., D.Sc.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


2

Lecture 15 1 I

Grade



Lecture 9 1 I

Grade


COURSE OBJECTIVE: To familiarize with the stages of planning and conducting experiments.

To shape ability in conducting experiments and developing and documenting the results of experiments.

To make aware of the place and role of the experiment in the development of science and technology.


COURSE CONTENTS:

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

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

General characteristics and basic elements of measurement information acquisition systems. The relations of information acquisition systems with data telecommunication systems of information processing and computer control systems.

Analysis and working out of experiment results. Measurement errors and uncertainties. Error sources. Measurement error classification. The calculation of systematic errors in direct and indirect measurements. Mathematical model and random error calculation. The elimination of redundancy errors. Analysing




measurement result uncertainties. Shaping measurement results. Connecting measurement results. Documenting experiment results.


LEARNING OUTCOMES:

Code Effects of the course K1I_W03, T1A_W02, T1A_W07

Explains basic kinds of experiment plans

K1I_U07, T1A_U08, T1A_U15

Develops and documents the results of experiments

K1I_K02, T1_A_K02 Is aware of importance and role of experimentation in knowledge and technology development

K1I_W03, T1A_W02, T1A_W07

Can say and characterize particular stages for planning processes and performing experiments

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the credit is given for obtaining positive grades in written tests carried out at least once a semester.



STUDENT WORKLOAD:








60 Total 2








60 Total 2


1. Tumanski S.: Principles of electrical measurement. Taylor & Francis, 2006

2. Bhargawa S.C: Electrical measuring instruments and measurements. CRC Press, 2012

3. Taylor J.R.: An introduction to error analysis. University Science Books, 1997

4. Lira I.: Evaluating the measurement uncertainty. Taylor & Francis, 2006

OPTIONAL READING: -

REMARKS: -




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

Type of course: Compulsory





Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6 Lecture 30 2 3

Exam



6 Lecture 18 2 3

Exam


COURSE OBJECTIVE: Student is able: configurate switches and routers, describe distance vector and link state routing protocols, chose appropriate interior and exterior gateway routing protocols, manage IP addresses and apply NAT and PAT mechanisms. Student has knowledge about sources of hazards in security of computer networks and is able to prevent them with the application of the ALC, Firewalls, IPS, IDS and DMZ. Student is able to describe, chose and apply different WAN technologies.

ENTRY REQUIREMENTS: Computer networks I

COURSE CONTENTS:

IP address management: Sub-netting with the application of VLSM. IP addresses aggregation. Private addressing with NAT and PAT implementation. Routers: Architecture, application and advanced configuration. Static and dynamic routing. Default routing. Full-class and classless routing. Link state and distance vector routing protocols: RIPv1, RIPv2, IGRP, OSPF, EIGRP. Interior and exterior gateway routing protocols. Network convergence: split horizon, count to infinity, hold-down timers and route poisoning methods. Load balancing in computer networks. Network security: Standard and extended access control list configuration. Dynamic access control list. Reflexive access control list. Context-base access control list. Firewalls, IPS, IDS and DMZ.




Ethernet switches: architecture, futures and configuration of the switches in the hierarchical computer networks. VLANs and their configuration. STP, RSTP and Rapid PVST+ algorithms. VLANs internetworks routing. WAN technologies: ISDN, xDSL, ATM, FrameRelay, SONET, UMTS. Introduction to routers: Router components and operation. User interface and configuration principle. Troubleshooting.


LEARNING OUTCOMES:


K1I_W08, K1I_U13 Can choose the proper routing protocol necessary for the optimal functioning of the routing inside and between autonomous systems.

K1I_U13 Can creatively develop the division of IP address space into subnets using VLSM technique.

K1I_W08, K1I_U13 Can characterize and point out the differences between static and dynamic routing.

K1I_W08 Can characterize routing protocols operating according to a distance vector and link state.

K1I_U13, K1I_U14 Can use NAT and PAT translation techniques. Can implementclass and classless routing in computer networks.

K1I_W08, K1I_U14 Is aware of potential risk affecting computer network safety and is able to prevent them by application of various safety techniques e.g., ACL.

K1I_W08, K1I_U13, K1I_U14

Knows the structure and can carry out an advanced configuration process of routers and switches.





STUDENT WORKLOAD:


60 Class participation 2 40 Reading of supplementary texts 1,33 40 Preparation for classes 1,33 40 Assignment completion 1,34 180 Total 6


36 Class participation 1,2 48 Reading of supplementary texts 1,6 48 Preparation for classes 1,6 48 Assignment completion 1,6 180 Total 6





1. Graziani R., Johnson A.: CCNA2 Routing Protocols and Concepts: CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.

2. Lewis W.: LAN Switching and Wireless: CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.

3. Vachon B., Graziani R.: Accessing the WAN: CCNA Exploration Companion Guide CCNA Exploration Companion Guide, Cisco Networking Academy, Indianapolis, Indiana, 2012.

OPTIONAL READING: -

REMARKS: -




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

Type of course: Compulsory





Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 30 2 III

Grade



Lecture 18 2 III

Grade


COURSE OBJECTIVE: To provide 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.

To provide basic knowledge about modern IDE tools such as Eclipse and NetBeans.

To give basic skills to design within Java environment a system.

ENTRY REQUIREMENTS: Object-oriented programming

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, localization, reflections. Media and graphics in Java. Graphical user-interface, image processing, MIME formats, AWT and SWING. Networking. Socket programming, client-server architecture, implementing servers, resource locators and identifiers, harvesting information from the Web. Programming applets. Applet lifecycle, security management. Embedding applets in HTML pages.





LEARNING OUTCOMES:

Code Effects of the course K1I_U18 Can analyze the existing API documentation. K1I_U15 Can design and program in Java language: stand-alone applications,

applets launched from web browsers and network programs based on client-server architecture

K1I_U18 Can produce API documentation for compiled application K1I_W09 Knows the syntax and principles of Java language applications design

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the passing condition is to obtain a positive mark from the written exam.



STUDENT WORKLOAD:








20 Exam preparation 0,5

180 Total 6









180 Total 6

RECOMMENDED READING: 1. Eckel B.: Thinking in Java, 4th Edition, Prentice Hall, 2006.

2. Horstmann C. S., Cornell G.: Core Java 2, Volume I – Fundamentals, 7th Edition, Prentice Hall, 2007.

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

OPTIONAL READING: 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.

REMARKS: -




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



Direc tor of studies: Ass. Prof. Tomasz Gratkowski, Ph.D.

Name of lec turer :

Ass. Prof. Tomasz Gratkowski, Ph.D.

Ass. Prof. Michał Doligalski Ph.D.

WIEA IMEI Employers

,


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 IV

Exam



Lecture 9 1 IV

Exam


COURSE OBJECTIVE: Abilities and competence in design and implementation software consist of many processes and in distributed environment.

ENTRY REQUIREMENTS: Principles of programming, Java programming, Computer architectures I and II.

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

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

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

Concurrent programming in Java. Monitors. Additional methods of threads synchronization: blocking queued, barriers, countdown of latch and exchanger.

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




Characterization of Distributed Systems. Inter-process communication. Guidelines for design of inter-process communication.

Remote procedure call (RPC). Remote method invocation (RMI). How to build of distributed applications in Java RMI. Integration different distributed environments.

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


LEARNING OUTCOMES:


K1I_W09, K1I_U15 Can design and create object-oriented software employing concurrent and fuzzy programming mechanisms

K1I_W09 Can explain the mechanisms of coordination of activities in distributed systems

K1I_W09 Can explain the need for application of concurrent programming K1I_K04 Is aware of the need to use distributed systems and programs

K1I_W09, K1I_U15 Can distinguish basic architectural models used for the design of distributed systems

K1I_W09 Can describe the mechanism of communication layer design and the issues connected with data exchange in distributed systems




STUDENT WORKLOAD:


45 Class participation 1.20

18 Reading of supplementary texts 0.48

18 Preparation for classes 0.48

18 Preparation of reports 0.48

17 Tasks execution 0.45

17 Remote communication 0.45

17 Assignment completion 0.45

150 Total 4


27 Class participation 0.72

21 Reading of supplementary texts 0.56



20 Tasks execution 0.53

20 Remote communication 0.53

20 Assignment completion 0.53

150 Total 4




RECOMMENDED READING: 1. Ben-Ari M.: Principles of Concurrent and Distributed Programming, Addison-Wesley, 2006.

2. Foster I.: Designing and Building Parallel Programs, http://www.mcs.anl.gov/~itf/dbpp/

3. Coulouris G. et al.: Distributed Systems. Concepts and Design (4th ed.), Addison Wesley, 2005.

4. Tanenbaum S.: Distributed Systems. Principles and Paradigms (2nd ed.), Prentice Hall, 2002.

5. Garg V. K.: Concurrent and Distributed Computing in Java. Wiley-IEEE Press, 2004.

6. Horstmann C. S., Cornell G.: Core Java™ 2: Volume II–Advanced Features, Prentice Hall, 2008.

7. Goetz B., Peierls T., Bloch J., Bowbeer j., Holmes D., Lea D.: Java Concurrency in Practice, Addison-Wesley Professional, 2006.

REMARKS: processes, semaphores, deadlock, concurrent programming, parallel programming, inter-process communication, remote procedure call, remote method invocation, logical time, election algorithm, distributed transaction, deadlock detection




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



Direc tor of studies: Ass. Prof. Małgorzata Kołopieńczyk, Ph.D.

Name of lec turer : Ass. Prof. Małgorzata Kołopieńczyk, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 VI

Grade



Lecture 9 1 VI

Grade


COURSE OBJECTIVE: To provide basic knowledge about conceptual framework for IT project management, phases of the project life cycle, human resource management and management control.

To give basic skills in project planning, project management, human resource management and management control.

ENTRY REQUIREMENTS: Principles of programming, Object-oriented programming

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 progress and Quality Control.

Project: initiation, planning. execution. closure. The Concept Phase. The Analysis Phase. The Design Phase. The Implementation Phase. The Testing Phase. The Delivery Phase.

Project documentation: project charter, project phase plans, schedule. project report.




TEACHING METHODS: Problem based lecture, brainstorming methods, consultation, teamwork, case method, project.

LEARNING OUTCOMES:


K1I_K03 Is aware of the need to monitor and supervise the implementation of a project.

K1I_U28, K1I_K06, K1I_K07 Organizes work in a project team. K1I_U28 Presents work results.

K1I_W15 Names and explains concepts related to IT projects management.

K1I_W15 Know principles of planning and organizing project work.




STUDENT WORKLOAD:







30 Personal and on-line consultations 1

120 Total 4








120 Total 4

RECOMMENDED READING: 1. Kerznel H.: Project Management: A Systems Approach to Planning, Scheduling, and

Controlling, Wiley, 2009, ISBN-10: 0470278706.

2. Verzuh E.: The Fast Forward MBA in Project Management (Portable Mba Series), Wiley, 2008, ISBN: 0470247894.

3. Holliday M.: Coaching, Mentoring and Managing: A Coach Guide Book, Career Press, Incorporated, 2001, ISBN: 9781564145840.

4. Yourdon E.: Death March, Prentice Hall, 2003, ISBN: 978-0131436350.

5. Katzenbach JR., Smith DK.: The Wisdom of Teams: Creating the High-Performance Organization, HarperBusiness, 2003: ISBN: 978-0060522001.

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Mirosław Kozioł, Ph.D.

Name of lec turer : Ass. Prof. Mirosław Kozioł, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


7

Lecture 30 2E

V

Exam


Project 15 1 Grade


Lecture 18 2E

V

Exam


Project 9 1 Grade

CURSE OBJECTIVE: To provide knowledge about basic elements of microprocessor system and their mutual cooperation.

To provide knowledge about the various methods of microprocessor system development with additional peripherals and methods of their handling by the central processor unit.

To provide knowledge about the architecture of an exemplary microcontroller.

To develop and shape the skills in the software design for microprocessor systems.

To develop the skills in microprocessor system design.

ENTRY REQUIREMENTS: Computer architecture, Principles of programming, Digital system design

COURSE CONTENTS: Microprocessor systems. Basic components of microprocessor system. Central processor unit. System buses. The role of the tri-state buffers in accessing the data bus of the system bus. Program memory. Data memory. Input-output devices. Peripherals. Microprocessor and microcontroller.




Instructions. Instruction set. Instruction and machine cycle. Basic addressing modes. Basic groups of instructions in microcontrollers.

Memories in microprocessor systems. Basic memory types. Basic memory parameters. Exemplary timing charts during read and write operations. Examples of memory chips used in microprocessor systems based on microcontrollers.

Interfacing peripherals to the system bus. Isolated and memory mapped input-output devices. Address decoder design on the basis of middle scale digital logic circuits and SPLDs with examples.

Handling of peripherals. Polling. Interrupt system. Direct memory access.

Local serial interfaces. I2C. SPI.

Information transmission between microprocessor systems. Transmission of information with and without acknowledgement. Synchronous and asynchronous transmission. Parallel and serial transmission. Their advantages and disadvantages. Serial interfaces (RS-232C, RS-485).

MCS-51 family of microcontrollers as an example of single-chip microcomputer. The most significant features of their architecture. Functional blocks. Interfacing of external program and data memory. Embedded peripheral systems i.e. timer-counters and serial interface. Interrupts. Parallel ports. Power-saving modes of operation. Programming examples of embedded peripherals in assembler and C.

Basic user interface in microprocessor system. Keyboard. LED and LCD displays.

Tools aided programming and commissioning of microprocessor systems. Monitors. Hardware emulators. Simulators. In-system programming. In-application programming. Commercial and free of charge programming tools.

TEACHING METHODS: Lecture, laboratory exercises, projects.

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can design a microprocessor system based on a microcontroller K1I_U29 Can write a program for a dedicated microprocessor system based on a

microcontroller K1I_W20 Knows the exemplary microcontroller architecture K1I_W20 Can name and explain methods for servicing of peripherals in

microprocessor system K1I_W20 Can name and explain various methods for extending of microprocessor

systems by additional peripherals K1I_W20 Can name basic sub-components of microprocessor system, describe

their functional purpose and co-operation

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – to receive a final passing grade student has to receive positive grade from examination.


Project – to receive a final passing grade student has to receive positive grades in all projects in semester.

Calculation of the final grade: lecture 40% + laboratory 30% + project 30%

STUDENT WORKLOAD:










210 Total 7







210 Total 7

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

Publications Pune, 2008.

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

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

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

OPTIONAL READING: -

REMARKS: -




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

Type of course: optional


Direc tor of studies: Assoc. Prof. Wiesław Miczulski, Ph.D., D.Sc.

Name of lec turer : Assoc. Prof. Wiesław Miczulski, Ph.D., D.Sc.,

Ass. Prof. Łukasz Sobolewski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r

Form of rece iving a credit for a course


a l loca ted


5

Lecture 30 2 V

Exam



Lecture 18 2 V

Exam


COURSE OBJECTIVE: acquaint students with the scope of using information systems in business management,

acquaint students with the basic concepts of management information systems,

acquaint students with the scope of using E-Business and E-Commerce systems in the enterprise,

shaping basic skills in the practical construction of systems supporting customer relationship management in the enterprise.

ENTRY REQUIREMENTS:

Databases, Software engineering, Object-oriented programming.

COURSE CONTENTS: Introduction: The scope of Management Information Systems. Classification of Management Information Systems. Transactional and analytical information systems. Analysis and design of information flows. The lifecycle of Management Information Systems. The evolution of a Management Information Systems in Poland and worldwide. Structure of Management Information Systems –case study.




Manufacturing Management Systems: Material flow in firm. Warehouse management. MRP, MRP II – methods and implementation. MRP and MRP II - software architectures and technologies. Data transmission from SCADA to Management Information Systems. Examples of MRP II systems - comparison and analysis of functions.

Information Systems In Logistic: Kanban. JIT - method and implementation. SCM - Supply chain management. Architecture of Logistic Information Systems (LIS). Examples of LIS - comparison and analysis of functions.

Financial Management Information Systems: Definition – Credit side, Debit side, capital assets, statement of financial position. The flow of financial information in firm. Structure of book of account – example of implementation.

Customer Relationship Management (CRM): CRM in firm, connections to other systems. CRM structure. CRM implementation.

E-Business and E-Commerce, basis: B2B, B2C, C2C. Digital marketplace. History of E-Business. Statistical Data - Internet in Poland, E-Commerce in Poland. Internet Sales in Poland and worldwide.

E-Business Models. E-Business Architecture (levels). The basic categories of business models: Brokerage, Advertising, Infomediary, Merchant, Manufacturer (Direct), Affiliate, Community, Subscription, Utility. E-business models by degree of functional integration and innovation. E-business models by degree of the power relationship (on the buyer or the seller side). Business and Information Architecture.

The Electronic Shops: Advantages and disadvantages. Traditional and Electronic process of selling. Statistical data – clients of electronic shop.

M-Business. M-Business, structure of application,

Phases of E-Business systems implementation: How to choose right solution. Techniques of implementation. Planning and monitoring of implementation processes. Outsourcing of software and hardware.

Internet payment methods: Macro, Mini and Micro payments. Credit card payments. E-Cash Smart Card and others. Classification of payments method for mobile systems. M-Payments. Security of payments over Internet.

Internet Marketing. Customer Relationship Management and Internet. How Internet Search Engines Work. SEO (Search engine optimization). Internet and advertising – techniques, choosing, measurement of efficiency. Web Stats.

Social networking services. Tools for measuring the effectiveness of marketing campaigns.


LEARNING OUTCOMES:

Code Effects of the course K1I_K06 Can work and communicate in a team

K1I_W20 Can explain the differences between indicated electronic business models

K1I_W20 Can characterize in a general way particular groups of business management IT systems

K1I_U29 Is able to design and build a simple CRM system used to support contacts between the company and business partners

K1I_U29 Can prepare a selection and implementation plan management information system in an enterprise

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – obtaining a positive grade from exam.






STUDENT WORKLOAD:








150 Total 5








150 Total 5

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

Prentice-Hall, Inc., 2012

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

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

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

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Janusz Kaczmarek, Ph.D.

Name of lec turer : Ass. Prof. Janusz Kaczmarek,Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 V

Grade



Lecture 9 1 V

Grade


COURSE OBJECTIVE: 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.

ENTRY REQUIREMENTS: Principles of programming, algorithms and data structures, computer architecture, experiment methodology I and II

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 used 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. Advanced programming techniques used in LabVIEW. 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:


K1I_U29 Can program in LabWindows/CVI and LabVIEW environments

K1I_U29 Can design virtual measuring instruments and knows the practical advantages of the devices of this type.

K1I_K06 Can implement programming tasks in teamwork

K1I_W20 Knows basic design and creation techniques of computerized measurement systems software with the application of graph specialized programming environments




STUDENT WORKLOAD:








120 Total 4



15 Reading of supplementary texts 0,5 34 Preparation for classes 1,13 20 Preparation of reports 0,67 12 Assignment completion 0,4 12 Personal and on-line consultations 0,4 120 Total 4




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

2000.

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

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

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

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

OPTIONAL READING: -

REMARKS: -




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

Type of course: Optional


Direc tor of studies: Ass. Prof. Robert Szulim, Ph.D.

Name of lec turer : Ass. Prof. Robert Szulim, Ph.D.

WIEA IMEI Staff


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 V

Grade



Lecture 18 2 V

Grade


COURSE OBJECTIVE: To familiarize with the basic information technologies used to build web applications.

To form basic skills in the construction and launch of web applications in the form of web portals.

ENTRY REQUIREMENTS: Principles of programming, algorithms and data structures, computer networks, databases

COURSE CONTENTS: Primary protocols and services of Internet. Description of work of protocols: TCPIP, HTTP and FTP.

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

Client – Server Databases. Description of work, advanced server objects and designing of structures of databases.

WWW Technologies. Static and dynamic technologies of designing WWW pages - review.

Microsoft .NET technology. Description of basics of work of the technology.

WWW forms. Description of work of mechanisms of sending data through WWW pages.




Databases and WWW. Study of possibilities of building WWW pages with the access to databases.

Security mechanisms. Description of problem of security of work in WWW network.

TEACHING METHODS: Lecture, laboratory exercises, team work.

LEARNING OUTCOMES:

Code Effects of the course K1I_W20 Is aware of the importance of IT technologies in modern IT systems K1I_U29 Can build and launch a WWW portal referring to a database K1I_U29 Can administer WWW and FTP servers K1I_W20 Has a basic knowledge on the use of databases in Web applications K1I_W20 Has a basic knowledge on selected IT technologies used to build web

applications

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the condition of passing is obtaining positive grades from oral or written tests at least once a term.

Laboratory – the condition of passing is obtaining positive grades from all laboratory subjects according to the program of the laboratory.


STUDENT WORKLOAD:








120 Total 4








120 Total 4

RECOMMENDED READING: 1. Ullman Jeffrey D., Widom Jennifer , A First Course in Database Systems, Pearson Prentice

Hall, 2008

2. Stephens R., Start Here! Fundamentals of Microsoft® .NET Programming, Microsoft, 2011

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

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




OPTIONAL READING: -

REMARKS: -

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



Direc tor of studies: Ass. Prof. Leszek Furmankiewicz, Ph.D.

Name of lec turer : Ass. Prof. Leszek Furmankiewicz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r

Form of rece iving a credit for a course


a l loca ted


6

Lecture 30 2 VI

Exam



Lecture 18 2 VI

Exam


COURSE OBJECTIVE: To introduce students to the methods of analog signal processing.

Forming of understanding the operation principles of systems used for signal processing.

Forming of skills to perform simple measurement experiments on the signals and functional blocks of signal processing circuit.

ENTRY REQUIREMENTS: Experiment methodology I and II, microprocessor systems

COURSE CONTENTS:

Signals, signals processing, signal converters-transducers, circuit of signal conversion. Basic definitions. Signals classifications. Structures of signal converters. Signal description in the time and in the frequency domain. Basic parameters of deterministic signals. Description of stochastic signals. Fourier series development of periodical signals. Spectrum of periodic and aperiodic signals.




Static and dynamic properties of measuring transducers. Static parameters. The methods of description the transducer static and dynamic parameters: transmittance, time characteristics and frequency characteristics. Dynamic properties of ideal and real transducers.

Initial signals conversion Amplifing and filtering. Operational amplifiers in initial signals conversion circuit. Analog filters. Mathematical models of passive and active analog filters.

Characteristic of analog-to-digital conversion process. Sampling. Sampling frequency selection. Quantization. Coding.

Analog- to-digital and digital-to-analog conversion. Properties of basic types of analog-to-digital and digital-to-analog converters. Parameters of analog-to-digital and digital-to-analog converters. Chosen examples of analog-to-digital and digital-to-analog applications.

Basic operation of digital signal processing. Linearization and correction of transducer static characteristics. Discrete Fourier Transformation and its basic properties. Application of Discrete Fourier Transformation to spectral analyses of signals. Digital filtering. Finite impulse response filters (FIR). Infinite impulse response filters (IIR).

Chosen problems of signal conversion circuit designing. Disturbances and noises in a signal conversion circuits. Sources and kinds of disturbances. Basic methods of disturbance reducing. Sources and kinds of noises. Signal to noise ratio. Methods of improvement signal to noise ratio.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 T1A_U14 Can measure basic signals parameters and analogue signal processing

path elements K1I_W20 T1A_W04 Can characterize the properties of functional blocks of a typical signal

processing path K1I_W20 T1A_W04 Can characterize and describe signals and measurement converters in

time and frequency domains


Lecture – scoring sufficient marks for written examination.



STUDENT WORKLOAD:










180 Total 6








180 Total 6


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

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

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

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

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

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

7. Plassche, R.J. van de,: Integrated Analog-to-digital and Digital- to-Analog Converters, Kluwer Academic Publishers, Boston/ Dordrecht/ London, 1994

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

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Leszek Furmankiewicz, Ph.D.

Name of lec turer : Ass. Prof. Leszek Furmankiewicz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 15 1 VI

Grade



Lecture 9 1 VI

Grade


COURSE OBJECTIVE: To provide knowledge about organization of measurement systems and measurement and control systems.

To provide knowledge about structures, principles of work and properties of measurement system elements.

Forming the design skills of communication and visualization software for measurement systems and measurement and control systems

ENTRY REQUIREMENTS: Principles of programming, experiment methodology, computer network, internet applications

COURSE CONTENTS:

Measurement and control systems - introduction. Classification of measuring systems. Structure and organization of measuring and control systems. Algorithm of measuring system. Selection of programming language and computer aided design tools.

Data transmission standards in measuring systems. Definition and classification of the interface. Interfaces used in measuring systems. Serial interfaces: RS - 232, RS - 422, RS -




485, Serial interface programming. Parallel interface IEEE 488: principal tags of IEEE 488 standard, bus of the interface, state of work reporting. IEEE 488.2 standard. IEEE 488.2 controller programming and IEEE 488.2 driver functions.

Data acquisition cards. Classification and basic functional blocks of the data acquisition cards. Data acquisition cards programming, description of the software functions.

SCPI standard. SCPI device model, structure of commands, trigger system, status system. Profile of commands for example devices.

Software development environments for measuring and control systems programming. Software development environments: LabWindows, LabView, Agilent Vee. VISA I/O library. Software drivers VXIplug&play. IVI drivers.

Virtual measurement instruments. The definition, structure and basic tags of virtual instruments. Virtual instruments programming. Examples of virtual instruments.

Programmable Automation Controllers (PAC). PAC in measuring and control systems as an example of B&R systems. Hardware and software architecture of PAC. Automation Studio - integrated software development environment. Process visualization in PAC.

Internet technologies in measurement and control systems. Embedded WWW servers. Hardware and software profiles of chosen embedded WWW servers.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 T1A_U14 Can design visualization software for measurement systems with the

application of dedicated programming environments K1I_U29 T1A_U14 Can design communication software for measurement systems based on

fundamental communication interfaces K1I_W20 T1A_W04 Understands organization principles of measurement systems and

operation principles of measurement systems elements K1I_U29 T1A_U14 Can select measurement systems programming tools




STUDENT WORKLOAD:







120 Total 4










120 Total 4


1. Winiecki W.: The Organization of Computer Measuring Systems. Warsaw University of Technology Press, Warsaw, 1997 (in Polish)

2. Mielczarek W.: Measuring Instruments and Systems with SCPI Compatibility, Helion, Gliwice 1999 (in Polish)

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

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

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

6. Nawrocki W.: Distributed Measuring Systems, WKŁ, Warsaw 2006 (in Polish) 7. Bentley J. P.: Principles of Measurement Systems, Pearson Education Limited,

Harlow, England, 2005

8. Caristi A., J.: IEEE-488 General Purpose Instrumentation Bus Manual, Academic Press, INC., San Diego, California, 1992

9. Johnson G.W., Jennings R.: LabView Graphical Programming, MacGraw-Hill, New York, 2006

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Adam Markowski, Ph.D.

Name of lec turer : Ass. Prof. Adam Markowski, Ph.D.

WIEA IMEI Staff


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6 Lecture 30 2

6

Grade


Project 15 1 Grade


6 Lecture 18 2

6

Grade


Project 9 1 Grade

COURSE OBJECTIVE: To familiarize students with the basic solutions used in the field of industrial computer networks.

To shape basic skills in programming using digital serial interfaces used in industrial automation.

To shape basic skills in the design and characterization of communication properties of distributed systems – control.

ENTRY REQUIREMENTS: Experiment methodology I and II, Principles of programming, Object-oriented programming, Microprocessor systems, Computer networks I and II

COURSE CONTENTS:

The evolution of measuring – controlling systems. The architecture of computer industrial networks. Topology of industrial networks. Transmission media.




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

Standard communication protocols. Characteristics of standard communication protocols: PROFIBUS, MODBUS, CAN, LonWorks, INTERBUS-S, ASI and HART.

Industrial Ethernet. Characteristics of selected solutions: PROFINET, EtherCAT and Powerlink. Internet technologies in computer industrial networks. Dedicated WWW servers.

Analysis of communication efficiency and time parameters of selected protocols. Time determination in industrial networks. Industrial network components. Converters, amplifiers, concentrators, nodes, routers, bridges and gates. Integration of industrial networks with local computer networks.

Utility programs for creating intelligent devices operating in industrial network nodes. Software of serial digital interfaces for data exchange with industrial automation devices.

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

Industrial network analysers and testers. Properties of industrial networks analysers and testers. Standards engineering of industrial network environments. Specifics of application areas for particular standards. Elements of industrial network designing.

TEACHING METHODS: Lecture, laboratory exercises, project.

LEARNING OUTCOMES:

Code Effects of the course K1I_U29

Can choose the devices to create a distributed measurement and control system for the given simple object

K1I_U29 Can run the analysis of communication properties of the presented measuring and control system

K1I_U29 Can configure and use basic serial digital interfaces for programming data exchange with automation devices

K1I_W20 Can characterize basic computer solutions in the area of industrial networks

K1I_W20 Understands aim of application of computer industrial networks


Lecture – the credit is given for obtaining a positive grade in written or oral tests carried out at least once in the semester.

Laboratory – the credit is given for positive grades in all laboratory exercises to be carried out according to the laboratory syllabus. Project – the credit is given for positive grades in project exercises to be carried out according to the syllabus.


STUDENT WORKLOAD:



21 Reading of supplementary Texas 0,7








180 Total 6



29 Reading of supplementary Texas 0,96





180 Total 6


1. Mielczarek Wojciech: Serial digital interfaces, Helion, Gliwice, 1999 (in Polish)

2. Nawrocki W.: Computer measuring systems. WKŁ, Warszawa 2002 (in Polish)

3. Sacha K.: Local Profibus networks. MIKOM, Warszawa 1998 (in Polish)

4. Winiecki W.: The organisation of computer measuring systems. Oficyna Wydawnicza Politechniki Warszawskiej WPW, Warszawa 1997 (in Polish)

5. Lesiak P., Świsulski D.: Examples of computer measuring methods, Agenda Wydawnicza PAK, Warszawa, 2002 (in Polish)

6. Nawrocki W.: Distributed measuring systems, WKŁ, Warszawa 2006 (in Polish)

7. Kwiecień R.: Computer systems for industrial automation, Helion, Gliwice 2012 (in Polish)

8. Mackay S., Wright E., Reynders D., Park J.: Practical Industrial Data Networks: Design, Installation and Troubleshooting, Newnes, 2004

9. Reynders D., Mackay S., Wright E.: Practical Industrial Data Communications: Best Practice Techniques, Butterworth-Heinemann, 2004

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Lect. Emil Michta, Ph.D.

Name of lec turer : Ass. Lect. Emil Michta, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


6

Lecture 30 2 VI

Exam

Project 15 1 Grade


Lecture 18 2 VI

Exam

Project 9 1 Grade

COURSE OBJECTIVE: To provide abilities and competence in configuration of the access points and wireless client stations, design WLAN and WPAN wireless networks, hot-spots design, implementation of security methods in WLAN.

ENTRY REQUIREMENTS: Programming basis. Computer networks I and II.

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




TEACHING METHODS: Lecture: conventional lecture, discussion, consultation, case method.

Project: design method, discussion, consultation, group work.

LEARNING OUTCOMES:

Code Effects of the course K1I_W20 Is aware of the benefits resulting from the use of wireless solutions and

their influence on the environment

K1I_U29 Can design and configure a simple wireless network

K1I_W20 Has the basic knowledge in the area of the construction, operation and configuration of wireless networks,

K1I_W20 Knows and understands the basics of wireless network design methodology


Project – the passing condition is to obtain positive marks from all design tasks to be planned during the semester.


STUDENT WORKLOAD:






45 Execution of tasks assigned by teacher 1,50


180 Total 6






25 Execution of tasks assigned by teacher 0,83



180 Total 6

RECOMMENDED READING: 1. Gast S.M.: 802.11 Sieci bezprzewodowe. Helion. Gliwice, 2003. 2. Lewis W.: Przełączanie sieci LAN i sieci bezprzewodowe. Helion, Gliwice 2008. 3. Poter B., Fleck B.: 802.11 Bezpieczeństwo. Helion. Gliwice, 2004. 4. Roshan P., Leary J.: Bezprzewodowe sieci LAN. Mikom, Warszawa, 2004

OPTIONAL READING: 1. Engst A, Fleishman G.: Sieci bezprzewodowe. Praktyczny przewodnik. Helion,

Gliwice 2005

REMARKS: -




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


Entry requirements : Object-oriented programming, software engineering.


Direc tor of studies: Ass. Prof. Łukasz Hładowski, Ph.D.

Name of lec turer : Ass. Prof. Łukasz Hładowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


6

Lecture 30 2

V

Exam


Project 15 1 Grade


Lecture 18 2

V

Exam


Project 9 1 Grade

COURSE OBJECTIVE: To provide basic knowledge about software modelling

To give basic knowledge and skills in practical applications of software modelling for simple problems

To give basic knowledge and skills in practical implementation for a solution of a simple problem using basic programming patterns

ENTRY REQUIREMENTS: Object-oriented programming, Software engineering

COURSE CONTENTS: Introductory issues. Background and history of modern modelling techniques. Unified process of application life cycle. System analysis and design. Object paradigm. Object modelling and its




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


LEARNING OUTCOMES:

Code Effects of the course K1I_U29, T1A_U14 Understands the need for unit testing and can implement them for simple

cases and can apply basic software tools for such tests K1I_U29, T1A_U14 Can select tools aiding software engineering K1I_U29, T1A_U14 Uses UML language to describe and formulate programming problems K1I_U29, T1A_U14 Can implement simple design patterns in a selected programming

language, knows application advantages and disadvantages for a given pattern and can suggest alternative solutions

K1I_U29, T1A_U14 Can implement a simple system segment in a selected programming language with the application of design patterns and adequate object-oriented programming techniques

K1I_U29, T1A_U14 Can recognize and discuss the advantages and disadvantages of the proposed programming solution at the stage of modeling in UML

K1I_U29, T1A_U14 Can recognize and discuss the advantages and disadvantages of the proposed programming solution through the source code analysis. Can make the refactoring of a simple code

K1I_W20, T1A_W04 Knows, understands and applies basic programming principles of software engineering

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

Project – the passing condition is to obtain positive marks from all individual assignments provided within the project schedule.


STUDENT WORKLOAD:












150 Total 6









150 Total 6


1. Martin R.C.:Clean code. A Handbook of Agile Software Craftsmanship, Prentice Hall, 2008

2. Larman C.: Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development, 2004

3. Freeman E., Robson E., Bates B., Sierra K.: Head First Design Patterns, 2004

4. Booch G., Rumbaugh J., Jacobson I.:Unified Modeling Language User Guide, Addison-Wesley Professional, 2005.

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

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

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

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

OPTIONAL READING: -

REMARKS: -




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


Entry requirements : Computer networks, Operating systems


Direc tor of studies: Ass. Prof. Przemysław Jacewicz, Ph.D.

Name of lec turer : Ass. Prof. Przemysław Jacewicz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


4

Lecture 30 2 V

Grade



Lecture 18 2 V

Grade


COURSE OBJECTIVE: To provide basic knowledge about the principles of operation and construction of the GPS network, and UMTS.

ENTRY REQUIREMENTS: Services in mobile networks

COURSE CONTENTS:

Construction and operating principle of a GSM network. Construction of the backbone network. Voice calls, SMS, EMS and MMS.

Principles of operations of the UMTS network. Construction of the backbone. Ensuring mobility. Power control.

UMTS network services. Voice calls, SMS and MMS. Access to the Internet. Video calls. Access to television, radio, music and video. The ability to add new services.




LEARNING OUTCOMES:

Code Effects of the course K_W19 T1A_W04 Can write an application sending text messages via a modem K_W19 T1A_W04 Can ensure application access to a mobile network modem K_W19 T1A_W04 Knows mobile networks structure, can name their components and

explain their functions K_W19 T1A_W04 Knows differences between GSM, UMTS and 3G networks

TEACHING METHODS: Lecture, laboratory exercises and project exercises.

ASSESSMENT CRITERIA:




STUDENT WORKLOAD:







10 Personal and on-line consultations

0,33

10 Preparation to final test 0,33

120 Total 4








0,5

120 Total 4


1. J. Kołakowski, J. Cichocki: UMTS System telefonii komórkowej trzeciej generacji, Wydawnictwa Komunikacji i Łączności WKŁ, 2007.

2. Aleksander Simon, Marcin Walczyk: Sieci komórkowe GSM/GPRS. Usługi i bezpieczeństwo, XYLAB, 2004.

OPTIONAL READING: 1. Kabaciński Wojciech: Sieci telekomunikacyjne, Wydawnictwa Komunikacji i

Łączności WKŁ, 2008.




REMARKS: -

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


Entry requirements : Services in mobile networks


Direc tor of studies: Ass. Prof. Przemysław Jacewicz, Ph.D.

Name of lec turer : Ass. Prof. Przemysław Jacewicz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 VI

Grade



Lecture 18 2 VI

Grade


COURSE OBJECTIVE: To provide basic knowledge about administration of the GSM / UMTS network.

To give basic skills in administration of the GSM / UMTS network.

ENTRY REQUIREMENTS: Services in mobile networks

COURSE CONTENTS:

SIM card. Reading and writing data stored on the SIM card. Creating a new operator card.

Management of network elements. Control: a base station, wireless controller and gateway services.

Services in the terminal and on the operator side. Manage client access pre-paid and subscription-based. Charging of services and reporting use.

LEARNING OUTCOMES:

Code Effects of the course K_W19 T1A_W04 Can read and interpret the data from SIM card K_W19 T1A_W04 Can describe the ways of managing mobile services and specify

the elements of the network responsible for these services K_W19 T1A_W04 Can create an application ensuring SMS messages servicing and

processing




K_W19 T1A_W04 Understands importance of SIM card, knows its construction and importance of its contents

TEACHING METHODS: Lecture, laboratory exercises and project exercises.

ASSESSMENT CRITERIA:



Project – the passing condition is to obtain positive marks for all project tasks as scheduled.


STUDENT WORKLOAD:








0,73


180 Total 6








0,8


180 Total 6

RECOMMENDED READING: 1. Martin Sauter: Communication Systems for the Mobile Information Society, John

Wiley, 2006, ISBN 0-470-02676-6.

2. J. Kołakowski, J. Cichocki: UMTS System telefonii komórkowej trzeciej generacji, Wydawnictwa Komunikacji i Łączności WKŁ, 2007.

3. Aleksander Simon, Marcin Walczyk: Sieci komórkowe GSM/GPRS. Usługi i bezpieczeństwo, XYLAB, 2004.

OPTIONAL READING: 1. Kabaciński Wojciech: Sieci telekomunikacyjne, Wydawnictwa Komunikacji i Łączności

WKŁ, 2008.

REMARKS: -




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






Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


6

Lecture 30 2 V

Grade

Project 15 2 Grade


Lecture 18 2 V

Grade

Project 9 2 Grade

COURSE OBJECTIVE: To provide advanced knowledge and understanding of JEE architecture including JEE design patterns and anti-patterns, Java server-side technologies, design and and implement multi-tiered enterprise Web applications.

To give skills in working with Web services including: design and launch, use of services published by others, perform matchmaking, conceptually model services and construct multiagent-based services.

ENTRY REQUIREMENTS: Object-oriented programming, Java and Web technologies.

COURSE CONTENTS: Java Enterprise Edition Fundamentals. Distributed programming in Java. Evolution of enterprise application frameworks. JEE API. Message-based communication on Java platform - Java Messaging Services.

Multi-tier architecture. Integration of remote elements in JEE applications. Specification of tiers: Web, business logic based on Java Beans, middle-tier, abstraction and persistance layer, integration and presentation layer. Fundamental JEE design patterns: MVC, front controller, interceptor, context object, facade, transfer object, data access object. JEE refactoring. Web application frameworks basics: Struts, Spring MVC, Java Server Faces.

Application servers and deployment process. JEE application development lifecycle. JEE deployment roles: component provider, application assembler, deployer, platform provider, tools provider, system administrator. Connection and session pool




management. Deployment descriptor. Archive resources of Web and enterprise application (WAR and EAR). Servlet container and application server implementations: Apache Tomcat, JBoss, Web Sphere Application Server. Security of application servers.

Web services. Information services and Service Oriented Architectures. Binding, marshalling and unmarshalling. Web Services Description Language, protocols: SOAP and JAX-RPC. DTD document validation. Optimisation of web services: proactive, definitive and reactive approach. UDDI registry. Security in web services: Java XML digital signature API, XML security stack, key management.

TEACHING METHODS: Lecture, Project.

LEARNING OUTCOMES:

Code Effects of the course K1I_U29, T1A_U14 Can apply IDE tools in complex application design effectively K1I_U29, T1A_U14 Knows and can implement solutions ensuring Internet applications

security K1I_W20, T1A_W04 Knows structure of scalable Internet applications based on multilayer

architecture K1I_W20, T1A_W04 Can characterize technologies applied in production of enterprise

application individual layers K1I_U29, T1A_W14 Can use Java EE design patterns in multilayered applications and web

services design K1I_U29, T1A_W14 Can carry out Internet application based on multilayer structure

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – one written test of 1.5 hours (75%) and coursework (25%) involving projects.

Project – a completed project involving analysis, design and development of an web application.


STUDENT WORKLOAD:







180 Total 6







180 Total 6

RECOMMENDED READING: 1. Alur D. Crupi J. Malks D.: Core JEE Patterns: Best Practices and Design Strategies, Prentice

Hall Ptr, 2003. 2. Chappel D. A., Jewel T.: Java Web Services: Using Java in Service-Oriented Architectures,

O'Reilly, 2002.




3. Cooper J. W.: Java Design Patterns, Addison-Wesley, 2000. 4. Horstmann C. S., Cornell G.: Core Java 2, Volume II – Advanced Features,

7th Edition, Prentice Hall, 2007.

OPTIONAL READING: 1. McGovern M.: Java Web Services Architecture, Morgan-Kaufman, 2003 2. Short S.: Building XML Web Services for the Microsoft .NET Platform, Microsoft Press, 2002

REMARKS: -




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



Direc tor of studies: Ass. Prof. Bartłomiej Sulikowski, Ph.D.

Name of lec turer : Ass. Prof. Bartłomiej Sulikowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 V

Grade



Lecture 18 2 V

Grade


COURSE OBJECTIVE: To provide skills and competencies in the following areas: protection of computer networks and their individual components before the hazards.

To give basic skills of design and operation of secure systems.

ENTRY REQUIREMENTS: Computer networks

COURSE CONTENTS: Threats in IT networks. Criteria for evaluation of safety data communications network. Types of attacks on each layer of the OSI model. Security hardware and software. Firewalls. The role of services in the risks. VPN. DoS AND DDoS attacks. Software. Threats: Viruses, worms, Trojans, Spyware and others. System defence: System updates, Anti-virus software and anti spyware. Application Layer Protocols: SSH and SSL/TLS. Law Regulations. The Law on Protection of Classified Information (at field appropriate due the computer network protection.) Certification of devices and systems. Cryptography. Symmetric and asymmetric algorithms. Standards DES, AES. Public key cryptography. RSA algorithm. One-way hash functions. Electronic signature. PKI servers. Cryptographic protocols.




Access to the system. Controlling user access to the system. Managing user access. Responsibilities of users. AAA systems. Security of wireless networks. Transmission encryption. User and hardware authentication and authorization. RADIUS servers.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 can run the process of removing threats in computer systems and

networks K1I_W20 can characterize risks occurring in information systems and the protection

methods K1I_U29 can configure secure data transmission in wireless networks based on the

IEEE 802.11 standard K1I_U29 can suggest and implement security solutions in computer networks K1I_U29 can diagnose the most common computer networks attacks K1I_W20 understands the necessity for team work in launching and monitoring

protections in extended computer networks K1I_W20 understands the need for application of protections for computer systems

and networks K1I_W20 can define basic security policy for a single computer and small computer

network




STUDENT WORKLOAD:







120 Total 4



30 Reading of supplementary texts 1




120 Total 4

RECOMMENDED READING: 1. Stuart McClure, Joel Scambray, George Kurtz, Hacking Exposed 7: Network Security Secrets

& Solutions, McGraw Hill Professional, 2012 2. J. Erikson, Hacking: The Art of Exploitation, No Starch Press, 2003




3. Gary A. Donahue, Network Warrior, O'Reilly Media Inc., 2007, Sebastopol 4. Christof Paar et al., Understanding Cryptography: A Textbook for Students and Practitioners,

Springer, 2009, London 5. Andy Oram, Beautiful Security, O'Reilly Media Inc., 2007, Sebastopol 6. Evi Nemeth et al., Unix and Linux System Administration Handbook, Prentice Hall, 2011, New

York

7. Darril Gibson, CompTIA Security+: Get Certified Get Ahead: SY0-201 Study Guide, Library of congress press, 2006, Washington

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Marek Sawerwain, Ph.D.

Name of lec turer : Ass. Prof. Marek Sawerwain, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 VI

Exam



Lecture 18 2 VI

Exam


COURSE OBJECTIVE: To provide basic information about RAD (Rapid Application Development) environments. Show advantages of RAD environments with Delhi and C++ Builders packages.

To give basic skills for creation of desktop and database application with a SQL language, give basic information about VCL (Visual Component Library) components and DLL, COM technology.

To give basic skills for creation of Internet application based with WebSnap approach, and skills for creation of multi-tier applications, description of ASP and ASO technology (Active Server Pages, Active Server Objects), presentation of CORBA technology in Delphi environment and C++ Builder package.

ENTRY REQUIREMENTS: Principles of programming, object-oriented programming

COURSE CONTENTS: Programming MS Windows Applications. History of RAD systems – Delphi, C++ Builder, Kylix and their compatibility. Object Pascal vs C++. Introduction to Delphi. Projects, units and forms. Exploiting debugger. Handling exceptions. Event-based programming. DLL libraries. Handling Windows messages. Multi-thread applications.




Database programming. Introduction to BDE. Elementary database programming components. Handling data sets (navigation, filters, searching, etc.) SQL – component TQuery. dbExpress technology. dbGo for ADO. Reports. Introduction to InterBase.

Component development. VCL, CLX and Fire Monkey architectures. Developing VCL components. Shell applications for Windows. COM technology. COM technology vs Delphi.

Internet Applications. Internet applications vs Delphi. Introduction to WebSnap. XML vs Delphi. MIDAS – multilayer applications. ASP and ASO. Introduction to CORBA. IDL language. Exemplary applications.


LEARNING OUTCOMES:

Code Effects of the course K1I_K06 Can work individually and in a team. K1I_U29 Can the constructions of basic multilayer applications and CORBA based

applications. K1I_W20 Knows RAD tools development history, and current RAD solutions with

their advantages and disadvantages. K1I_U29 Can develop a user interface using RAD tools. K1I_W20 Knows fundamentals of DLL and COM libraries servicing and

construction. K1I_U29 Can handle Windows messages. K1I_U29 Can develop and implement a desktop or client-server database. K1I_U29 Has basic skills in constructing their own visual and non-visual

components.

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the main condition to get a pass is obtaining a positive grade in written exam.

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


STUDENT WORKLOAD:








120 Total 4











120 Total 4


1. Cantu M.: Mastering Delphi 7, Sybex, 2003

2. Cantu M.: Delphi XE Handbook: A Guide to New Features in Delphi XE, CreateSpace Independent Publishing Platform, 2011

3. Cary J.: Delphi in Depth: ClientDataSets, CreateSpace Independent Publishing Platform, 2011

4. Rolliston C.: Delphi XE2 Foundations, CreateSpace Independent Publishing Platform, 2012

5. Stephens R.: Ready-to-Run Delphi(r) 3.0 Algorithms, John Wiley & Sons, 1998

6. Teixeira S., Pacheco X.: Delphi 6 Developer's Guide, Sams, 2001

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Marek Sawerwain, Ph.D.

Name of lec turer : Ass. Prof. Marek Sawerwain, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 VI

Exam



Lecture 18 2 VI

Grade


COURSE OBJECTIVE: To shape understanding and awareness of role of an information processing platform in programmer's daily practice.

To provide basic knowledge about .NET platform as environment for creation of applications in traditional user environments (desktop applications) and for Internet network (ASP.NET).

To give basic skills in creation of application in C# language programming, the use of database systems, description data with XML language, making of Web pages with ASP.NET technology.

To shape basic skills in creation of web services, to give knowledge about security application issues created with .NET platform and basic knowledge about other programming languages available at .NET platform.

ENTRY REQUIREMENTS: Programming fundamentals, Object oriented programming, Algorithms and Data Structures, Databases

COURSE CONTENTS: Introduction to .NET platform. Structure of the .NET platform. .NET distributions. Outline of .NET Framework environment. Review of programming languages supported by .NET platform.




Microsoft Visual Studio- environment characteristic. Presentation of programming environment. Tool for form editing. Running application. Creating sample application.

Common Language Runtime. Elementary functions and services of CLR. Memory and other resources management. Thread management. Structure and configuration of metadata. Integration with Win32 DLL libraries. Methods of interaction between applications. Comparison between CLR and JVM.

Fundamentals of C# programming. Language syntax: instructions, variables, operators and data types. Design principles of classes, methods, constructors and objects. Arrays usage guidelines. Software Development Kit – review of main programming tools.

Advanced C# programming. Preprocessor directives. Event handling. Handling errors using exceptions. Common string operations. Regular expressions reference. Remote object invocation. File access operations. Thread synchronization. Base Class Library – review. User interface components.

Introduction to functional programming in F#: Introduction to F#. Review of functional programming style. Operators and data structures.

Creating components in .NET. Principles of designing, implementing and testing components. COM and COM+ technology overview.

XML in .NET. Methods of information transfer using XML documents. Review of classes for XML documents manipulation and transformation.

Access data using ADO.NET. Review of ADO.NET objects. Database access methods.

Language Integrated Query – LINQ. Architecture of LINQ technology. LINQ queries to objects, databases, SQL databases and XML data. Parallel and serial LINQ queries.

ASP.NET technology. Base classes and main objects of ASP.NET. Using XML in ASP.NET. Designing web pages using ASP components.

Creating web services. SOAP and UDDI protocols. Security features of ASP.NET applications: access control, authentication and data encoding and cryptography.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can independently work on the computer system, is familiar with the tools

to work in a team available within platform .NET. K1I_W20 Knows also code of conduct according to ethics and licensing problems

for employing suites/components/libraries of other producers in own .NET projects

K1I_U29 Can run the analysis and interpretation of the existing problems, and then indicate methods and techniques to solve these problems using platform .NET.

K1I_W20 Is familiar with the possibilities of .NET platform in the area of application security and the protection of information created by the system or .NET application users.

K1I_U29 Can, on a basic level, create new components (and develop the existing ones) to solve IT problems. They are familiar with the structure of .NET. components.

K1I_U29 Can create application operating in the .NET environment and taking advantage of its properties

K1I_W20 Knows basic platform components and can characterize disadvantages and advantages of .NET platform. Is aware of .NET platform dynamic development.

K1I_U29 Can make documentation for newly created projects and describing existing programs/libraries/packages .NET.

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture – the main condition to get a pass is obtaining a positive grade in written exam.






STUDENT WORKLOAD:








120 Total 4








120 Total 4

RECOMMENDED READING: 1. Chappell D., Understanding .NET (2nd Edition), Addison-Wesley Professional, 2nd edition,

2006 2. Novák. I, Velvárt A., Granicz A., Balássy G., Hajdrik A., Sellers M., Hillar G.C., Molnár A.,

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

7. Richter J., CLR via C#, 3rd edition, Microsoft Press, 2010.

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Bartłomiej Sulikowski, Ph.D.

Name of lec turer : Ass. Prof. Bartłomiej Sulikowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 30 2 VI

Grade

Project 15 1 Grade


Lecture 30 2 VI

Grade

Project 15 1 Grade

COURSE OBJECTIVE: To familiarize students with the idea of converged networks

To provide basic knowledge about protocols and standards used in converged networks

To familiarize students with the problems associated with the integration of digital and analogue services

To give basic skills allowing integrating networks with new network services (digital and analog)

To familiarize students with the methods of quality assurance (QoS) in computer networks

ENTRY REQUIREMENTS: Computer networks

COURSE CONTENTS: Convergent networks. Idea. Evolution. Development Strategy. Scalability. Services in converged networks. The data transmission. VoIP and video streams. Telephone and fax. VPN. Integration of circuit switched networks and packet-switched networks. Controlling convergent networks with SIP. QoS and security for convergent networks. Protocols and technologies. IP, IPv6. ATM. TDM. Frame Relay.




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


LEARNING OUTCOMES:

Code Effects of the course K1I_W20 can describe the mechanisms of ensuring the desired quality of network

services (QoS) K1I_W20 can describe technologies and protocols used in networks K1I_W20 can characterize the idea of converged networks K1I_U29 can start and monitor the operation of network services with different

characteristics and requirements in computer networks K1I_W20 Knows basic services available in convergence networks


Lecture –sufficient marks in written or oral tests conducted at least once per semester.

Project – implementing the integrated services with security in network (group task).


STUDENT WORKLOAD:







180 Total 6







30 Preparation for final test 0,67

180 Total 6

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

2008, 3. Wallance H.: Authorized Self-Study Guide Cisco Voice Over IP (CVoice), 2006, Cisco

Press 4. Ellis J. et al., Voice, Video, and Data Network Convergence: Architecture and Design,

From VoIP to Wireless, Academic Press, 2003

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Łukasz Hładowski, Ph.D.

Name of lec turer : Ass. Prof. Łukasz Hladowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 30 2

VI

Grade


Pro ject 15 1 Grade


Lecture 18 2

VI

Grade


Pro ject 9 1 Grade

COURSE OBJECTIVE:

To teach skills and competences in programming and editing for cinematography, digital video synthesis and processing. Create awareness of the nature of the state of the art in electronic media and entertainment industries. Learning basic skills in media engineering.

ENTRY REQUIREMENTS: Principles of computer science, computer graphics

COURSE CONTENTS: Introduction to digital media – The basics of (digital) video and cinematography. Human perception of time based media. Installation and configuration of video processing tools. Color coding and correction. Multimedia devices. Capturing and processing video streams. Input/Output. Video SW/HW configuration according to standards and protocols (DVI, HDMI, ....). Digital video – Video formats, image coding and decoding (codecs). Linear and non-linear video editing. Digital audio - Audio formats, sound and music coding and decoding (codecs). Linear and non-linear audio editing. Streamed Media – Streamed media formats, distribution channels for video and audio streams, podcasting and hypervideo. Architecture - Standards MPEG4, MPEG7, MPEG21.




Video and cinematography production – Film and digital media. Elements of video production process: Story, actors and acting, set, lighting and recording, camera. Digital storytelling. Post-production and distribution of digital media.

TEACHING METHODS: Lecture, laboratory exercises, projects.

LEARNING OUTCOMES:

Code Effects of the course K1I_K01 Is aware of the dynamic development of the discipline.

K1I_W10 Is open to new technologies and is ready to implement them

K1I_U23 Can carry out computer hardware and software configuration process and analyze and verify current application configuration

T1A_W03 Can apply and analyze digital video systems, and explain technical requirements

K1I_W10 Student can name digital video editing principles and environments.



Project – design and implementation of either digital video processing application, video player or preparation and processing of short form of digital movie.


STUDENT WORKLOAD:





30 Preparation of reports 1

60 Assignment completion 2


180 Total 6








180 Total 6

RECOMMENDED READING: 1. Ablan D.: Digital cinematography, New Riders Press, 2002

2. Paul J..: 100 tricks for digital video, O’Reilly, 2007

OPTIONAL READING:

1. Katz. S. Film directing shot by shot, Michel Wiese Productions, 1991

REMARKS: -




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



Direc tor of studies: Ass. Prof. Mariusz Jacyno, Ph.D.

Name of lec turer : Ass. Prof. Mariusz Jacyno, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 30 2 VI

Grade



Lecture 30 2 VI

Grade


COURSE OBJECTIVE: To introduce students to modern information systems and underpinning them technologies such as: Web 2.0, social media, machine learning, intelligent personal agents, semantic web and web services. To outline big data technologies used to process and analyse data generated by modern information systems. To study machine learning techniques that can be used to automate such tasks as product recommendations, personalised e-marketing, sentiment analysis, social media analysis.

ENTRY REQUIREMENTS: Java programming, XML, databases, distributed computing, AI

COURSE CONTENTS: Characteristics and features of modern information systems. Role of social networking, Semantic Web, Big Data analytics and machine learning techniques in building intelligent, information filtering Internet information systems.

Architecture of networked information systems. Architectural breakdown of information systems into technologies and solutions that consitute such systems. Explanation of the role of Semantic Web, ontologies (OWL), Hadoop, Mahout, machine learning and social networks play in providing information systems.

Engineering intelligent information systems. Application of existing tools for constructing ontologies and performing Big Data analytics for the purpose of intelligent information filtering and its personalized provisioning.





LEARNING OUTCOMES:

Code Effects of the course K1I_K01 Can design agents to search and analyse the information described

semnatically

K1I_U23 Can work individually and in a team.

K1I_K01 Is aware of the main building blocks of modern information systems K1I_W10 Is capable to implement a simple machine learning algorithms for

processing large subsets of data.

K1I_U23 Can outline the distinguishing properties of social media and social networks in particular.

K1I_U23 Can outline main technologies used during big data analytics and can assess their applicability based on the discussed context.


Lecture – the passing condition is to obtain positive mark from the exam. Project – the passing condition is to obtain positive mark from the project.

STUDENT WORKLOAD:






180 Total 6


1. Wooldridge M.: Multi-agent systems (second edition), MIT Press, 2013

2. Watts J. D.: Six degress: the science of a connected age, W.W. Norton & Company, 2003

3. White T.: Hadoop: The Definite Guide (third edition), O'Reilly Media, 2012 4. Owen S., Anil R., Dunning T., Fridman E.: Mahout in action, Manning Publications,

2011

OPTIONAL READING: -

REMARKS: -




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






Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


6

Lecture 30 2 VI

Grade

Project 15 1 Grade


Lecture 18 2 VI

Grade

Project 9 1 Grade

COURSE OBJECTIVE: Developing the skills necessary to design small enterprise LANs and WANs; Introducing customer requirements, translating those requirements into equipment and protocol needs, and creating a network topology which addresses the needs of the customer; Familiarization how to create and implement a design proposal for a customer.To provide basic knowledge about fundamentals of computer system structure and principles of operation.

ENTRY REQUIREMENTS: Computer architectures I and II

COURSE CONTENTS: Introducing networking design concepts. The benefits of a hierarchical network design. Network design methodology. Functions of the core, distribution and access layers. Investigating servers farms and security of the computer networks. Investigating wireless network. Supporting WANs and remote workers. Gathering networks requirements. Introducing a lifecycle of computer networks. Explaining the computer network sales process. Preparing for the design process. Identifying technical requirements and constraints. Identifying manageability design considerations.




Characterizing the existing network. Documenting the existing network. Updating the existing internetworking operation system software. Upgrading the existing computer devices. Performing a wireless site survey. Documenting network design requirements.

Identifying application impacts on network design. Characterizing network applications. Explaining common network applications. Introducing quality of service (QoS). Examining voice and video options. Documenting application and traffic flows.

Creating the network design. Analyzing the requirements. Selecting the appropriate LAN topology. Designing the WAN and remote worker support. Designing wireless networks. Incorporating security.

IP addressing in the network design. Creating an appropriate IP addressing design. Creating the IP addresses and naming scheme. Plan for summarization and route distribution. Describing IPv4 and IPv6. Migration from IPv4 to IPv6.

Prototyping the campus network. Building a prototype to validate a design. Creating a test plan. Prototyping the LAN. Validating LAN technologies and devices. Testing the redundancy and resiliency of the network. Identifying risks or weaknesses in the design. Prototyping the server farm.

Prototyping the WAN. Prototyping remote connectivity. Simulating WAN connectivity in the simulation software and the laboratory environment. Validating the choice of devices and topologies. Prototyping remote worker support. Prototyping the VPN.

Preparing the proposal. Assembling the existing proposal information. Developing the plan of the implementation of the computer network. Estimating timelines and resources. Creating and presenting the proposal.


LEARNING OUTCOMES:


K1I_U29, T1A_U14 is able to collect client requirements related to the properties of the designed computer network.

K1I_U29, T1A_U14 Can analyze and interpret technical requirements of the designed computer network and identify potential threats hindering the construction of the computer

K1I_U29, T1A_U14 Can describe the role of core, distribution and access layers in the functioning of computer network.

K1I_U29, T1A_U14 Can develop a construction and implementation schedule of a designed computer network.

K1I_U29, T1A_U14 Can estimate the time and resources necessary to implement the network.

K1I_U29, T1A_U14 Can design convergence computer network according to client expectations

K1I_U21, T1A_U07 Is able to present a design offer

K1I_W20, T1A_W04 Can characterize hierarchical design model for local (LAN) and wide (WAN) computer networks



Project – the passing condition is to obtain positive marks from a prepared project.


STUDENT WORKLOAD:










180 Total 6








180 Total 6


1. McCabe J.D.: Network Analysis, Architecture and Design, 3rd ed. San Francisco. California: Morgan Kaufmann Publishers, Inc., 2007.

2. Oppenheimer P.: Top-Down Network Design, 3rd ed. Indianapolis, Indiana: Cisco Press, 2010.

3. Wilkins S.: CCDA Self-Study: Designing for Cisco Internetwork Solutions (DESGN), 2nd ed. 640-861, Indianapolis, Indiana: Cisco Press, 2007.

OPTIONAL READING: -

REMARKS: -




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




Name of lec turer : Ass. Prof. Tomasz Gratkowski Ph.D.

Ass. Prof. Michał Doligalski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 30 2 V

Grade



Lecture 18 1 V

Grade


COURSE OBJECTIVE:

• Familiarize students with the techniques of information systems modeling

• acquaint the student with the methods of systems documentation

• developed skills in gathering requirements and creating functional specification of information systems

ENTRY REQUIREMENTS: Databases

COURSE CONTENTS: The basic functions of the computer system. Methodologies of computer systems design (the system life cycle phases: requirements analysis, design, implementation, testing, installation, operation, withdrawal); classification of the systems design methodologies. Life cycle models system. Types of system documentation (General - at the stage of analysis, technical - at the stage of design and implementation, user - system manual). Modeling in UML Automated methods of software development based on UML.

TEACHING METHODS: Lecture: Lecture problem, conventional




laborator: brainstorming, consultations, group work, practical work, project method, laboratory exercises

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can adjust the project management methodology to the project of a given IT

system.

K1I_U29 Can develop client requirements concerning the information system.

K1I_U29 Can prepare project documentation: functional specification and a technical project

K1I_U29 Can create a chosen informatics model with the application of UML language

LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture - provided credit is to obtain a positive evaluation of the examination carried out in the form proposed by the teacher.

Laboratory - provided credit is to get a positive assessment of the implementation of all exercises.

Methods of verification - Lecture: written examination

laboratory: test


STUDENT WORKLOAD:








180 Total 6








180 Total 6


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

REMARKS: -




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






Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4

Lecture 30 2 V

Grade



Lecture 18 2 V

Grade


COURSE OBJECTIVE: To provide basic knowledge about modeling of digital systems using Hardware Description Languages (HDLs).

To give basic skills and competence in: modeling, simulation and synthesis of digital systems using HDLs.

ENTRY REQUIREMENTS: Digital system design, Principles of programming, Computer architectures I and II

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




Synthesis of digital systems. Modeling of automata. Delays (SDF files). Timing simulation. Back-annotation. Introduction to SystemVerilog. Hardware/Software co-simulation.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can run the analysis of a digital system at various stages of design,

including time parameters K1I_U29 Can create a simple digital system model employing a selected device

describing language, including application of standard libraries and IP-Core modules

K1I_U29 Can apply device description languages in the design process of digital systems

K1I_W20 Understands the need for carrying out computer verification (simulation) of designed digital systems





STUDENT WORKLOAD:








150 Total 4








150 Total 4





1. Palnitkar S.: Verilog HDL: A Guide to Digital Design and Synthesis, Prentice Hall, 1996

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

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

OPTIONAL READING:

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

REMARKS: -




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



Direc tor of studies: Ass. Prof. Remigiusz Wiśniewski, Ph.D.

Name of lec turer : Ass. Prof. Remigiusz Wiśniewski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


4 Lecture 15 1

5

Grade


Project 15 1 Grade


4 Lecture 9 1

5

Grade


Project 9 1 Grade

COURSE OBJECTIVE: To provide basic knowledge about fundamentals of cryptography and data safety.

To provide basic knowledge about most popular Web applications attacks (e.g. XSS, SQL-Injection) and methods of security.

To provide basic knowledge about data security and protection of applications (Windows).

ENTRY REQUIREMENTS: Principles of programming (but not obligatory).

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




Optional: implementation in programming languages (C, C++, Java, Assembler, Pascal), hardware implementation (with programmable devices like FPGAs).

Asymmetric-key algorithms: Public and private keys, hash functions. Main protocols and cryptosystems (Diffie-Hellman, RSA, SHA, MD5, etc.). Optional: Implementation in programming languages (C, C++, Assembler, Pascal). Hardware implementation (with programmable devices - FPGAs).

Digital signature: Fundamentals of digital signature, safety and authentication, smartcards.

Cryptanalysis: Main goals of cryptanalysis. Weakness of particular cryptosystems. Data safety. Debugging of computer applications and programs.

Data security and protection of applications: Fundamentals of data protection of programs and applications (based on MS Windows operation system). Processes management and debugging. Software debuggers and kernel mode debuggers.

Security in Web applications: Most popular attacks and protection methods (e.g. Cross-site scripting XSS, SQL-Injection).


LEARNING OUTCOMES:

Code Effects of the course K1I_W20 T1A_W04 Has a basic knowledge on legal aspects of data protection (computer

applications, digital systems, electronic cards, digital signature) K1I_W20 T1A_W04 Has a detailed knowledge on data protection and security in computer

applications (computer programs) and digital systems( FPGA systems) K1I_U29 T1A_U14 Can recognize and minimize the threats related to data security in

computer applications and digital systems K1I_U29 T1A_U14 Can apply existing cryptographic algorithms in securing computer

software and digital systems K1I_U29 T1A_U14 Can protect transmitted data, both, on the level of computer software and

digital systems K1I_W20 T1A_W04 Understands the need to protect information systems, is aware of the

necessity to apply IT protections in daily life (access to electronic/computer data, application of electronic cards and digital signature)



Project – the passing condition is to obtain a positive mark from all projects conducted during the semester.


STUDENT WORKLOAD:











150 Total 4








150 Total 4


1. Stinson D.R., Cryptography: Theory and Practice (3rd edition), CRC Press, Boca Raton, 2005.

2. Schneier B., Applied cryptography, John Wiley & Sons, New York, 1994.

OPTIONAL READING:

1. Karbowski M., Basics of cryptography, Helion, Warsaw, 2005 (in Polish).

2. Aho A. V., Hopcroft J. E., Ullman J. D., The Design and Analysis of Computer Algorithms, : Addison-Wesley, Reading, Massachusetts, 1974.

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

REMARKS: -




Course code: 11.3-WE-I-GPI-PS44_ISM_S1S



Direc tor of studies: Ass. Prof. Anna Pławiak-Mowna, Ph.D.

Name of lec turer : Ass. Prof. Anna Pławiak-Mowna, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6 Project 60 4 VI grade


Project 27 3 VI grade

COURSE OBJECTIVE: To present problems of paying roles in a group, practical usage of IT technology and group tasks solving.

ENTRY REQUIREMENTS:-

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

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

TEACHING METHODS: Project.




LEARNING OUTCOMES:

Code Effects of the course K1I_W20 is aware of the aspect of taking and performing roles in a project K1I_U29 Applies basic techniques and tools for project management and team task

realization

K1I_U29 Evaluates and verifies the progress of a task, analyses the mistakes and determines corrective action

K1I_U29 Can create own and team work schedule


Project - the passing condition is to obtain a positive mark from the final report

STUDENT WORKLOAD:








180 Total 6








180 Total 6

RECOMMENDED READING: 1. Kerznel H.: Project Management: A Systems Approach to Planning, Scheduling, and Controlling,

Wiley, ISBN-10: 0470278706, 2009.

2. Verzuh E.: The Fast Forward MBA in Project Management (Portable Mba Series), Wiley, ISBN-

10: 0470247894, 2008.

3. Cohn M.: Agile Estimating and Planning, ISBN-10: 0131479415, Prentice Hall, 2005.

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

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

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

OPTIONAL READING: -

REMARKS: -




Course code: 11.3-WE-I-CPIKP_PSW_B41_ISM_S1S



Direc tor of studies: Ass. Prof. Wojciech Zając, Ph.D.

Name of lec turer : Ass. Prof. Wojciech Zając, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 15 1

V

Exam


Project 15 1 Grade


Lecture 9 1

V

Exam


Project 9 1 Grade

COURSE OBJECTIVE: To provide basic knowledge about data digitization.

To provide understanding of the role of digital data processing techniques in technique and society development.

To provide basic skills in modeling of systems for digital data processing, filtering and compression.


COURSE CONTENTS:

Sampling, digital-analogue conversion. Basic types of digital signals. Digital signal ambiguity. Filters. Time-domain analysis Digital data acquisition and representation. Visual data converters. Digital data processing system modeling. Decorrelation, quantization.




Discrete convolution. Fourier series. Fourier transform. Frequency-domain analysis. Discrete Cosine transform, Discrete Wavelet Transform. MatLab environment. Features, extension packs Image processing modelling in Matlab. Simple transformations. Filtering, convolution. Image processing: filtering, transformations. Data compression: conception, methods, examples.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can develop independently or in a group the programs for simulating the

processes of digital processing , filtration and data compression K1I_W20 Can characterize lossy and lossless compression techniques K1I_W20 Understands fundamental problems of data digitalization K1I_W20 Can describe the structure of a digital system of data processing and

transmission K1I_U29 Can use the software tools for modelling the processes of digital data

processing and implementation of digital filetrs




Project - the passing condition is to obtain a positive mark from the final report


STUDENT WORKLOAD:









180 Total 6









180 Total 6





1. R.G. Lyons, Understanding Digital Signal Processings. Prentice Hall, 2004

2. S. W. Smith., The Scientist and Engineer's and Guide to Digital Signal Processing, California Technical Publishing, 1997

3. M. Weeks, Digital Signal Processing Using Matlab and Wavelets, Infinity Science Press 2006

OPTIONAL READING: -

REMARKS: -




Course code: 11.3-WE-I-PAB-PSW_B41_ISM_S1S



Direc tor of studies: Ass. Prof. Jacek Bieganowski, Ph.D.

Name of lec turer : Ass. Prof. Jacek Bieganowski, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 15 1

V

Grade


Project 15 1 Grade


Lecture 9 1

V

Grade


Project 9 1 Grade

COURSE OBJECTIVE: To provide basic knowledge about process modelling and business applications.

To introduce understanding of proper usage of process modelling techniques.

To provide basic skills on process modelling.

To provide skills on usage of process modelling environments and languages.

ENTRY REQUIREMENTS: Principles pf computer programming

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

TEACHING METHODS:




Lecture, laboratory exercises, project.

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can realize an example of a business application, working individually or in a team

K1I_U29 Can name and describe business application design process elements

K1I_W20 Can plan business application creation process

K1I_W20 Understands the need for appropriate modeling of business processes and applications

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

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

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


STUDENT WORKLOAD:









180 Total 6









180 Total 6

RECOMMENDED READING: 1. Beynon-Davies P.: Information Systems Development: An Introduction to Information Systems

Engineering, Palgrave Macmillan, 1998.

2. Bobzin H, McCammo K.,Tyagi S., Core Java Data Objects, Prentice Hall, 2003.

3. Graham I., O'Callaghan A., Wills A.: Object-oriented methods: principles & practice, Addison-Wesley, 2000.

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

OPTIONAL READING:-

REMARKS:-




Course code: 11.3-WE-I-ASI-PSW_C45_ISM_S1S



Direc tor of studies: Ass. Prof. Artur Gramacki, Ph.D.

Name of lec turer : Ass. Prof. Artur Gramacki, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 15 1

VI

Grade


Project 15 1 Grade


Lecture 9 1

VI

Grade


Project 9 1 Grade

COURSE OBJECTIVE: Engineering skills in administering of a selected computer database system


COURSE CONTENTS: Preliminary information. Database management systems (DBMS) as the complex computer /information systems. Hardware and software considerations, versions, patches, technical support, documentation. Four different administration specializations: network administrator, systems administrator, database administrator, application administrator and their coexistence.

Pre installation tasks. Setting up the environment. Overview of the installation process. Installation methods (manual or using response files), software editions and product options. Installing and checking the operating system requirements. Checking the secure network setup. Creating required operating systems groups, users, file systems.




Installation. Accessing the installation software. Extracting the installation files. Mounting appropriate storage systems. Choosing the required options, setting up startup initial parameters, physical data structures, final installation process.

Post installation tasks. Downloading and installing patches. Creating first backups. Configuring network services. New database considerations, designing and creating the target database. Choosing the backup strategies. Securing and inspecting the new installation.

Main administration tasks. Patching and backing up the system. Establishing recovery policies. Controlling the physical and logical database structures. Monitoring users and system activities, auditing. Managing user accounts, user privileges, user and system roles. SQL tuning. RDBMS tuning.

TEACHING METHODS: Lecture, laboratory exercises, individual projects

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can independently install and configure a selected DBMS system K1I_W20 Knows basic system structures and can configure them K1I_W20 Knows basic administrator tasks for a DBMS class system K1I_W20 Knows security principles for a DBMS system K1I_W20 Knows computer programs and systems for supporting a DBMS system

administration and monitoring


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

Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises.

Project – the main condition to get a pass is scoring sufficient mark for an individual project given (design, implementation, testing).


STUDENT WORKLOAD:








150 Total 5








150 Total 5





1. Selected books from Oracle documentation repository (http://www.oracle.com/technetwork/indexes/documentation/index.html)

2. Selected books from mysql documentation repository (http://dev.mysql.com/doc/)

3. Selected books from Microsoft MSDN library (http://msdn.microsoft.com/en-us/library/bb545450.aspx)

OPTIONAL READING: -

REMARKS: -




Course code: 11.3-WE-I-WHDIBW-PSW_C45_ISM_S1S



Direc tor of studies: Ass. Prof. Artur Gramacki, Ph.D.

Name of lec turer : Ass. Prof. Artur Gramacki, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 15 1

VI

Grade


Project 15 1 Grade


Lecture 9 1

VI

Grade


Project 9 1 Grade

COURSE OBJECTIVE: Engineering skills in design and implementation of data warehouses and data mining structures and algorithms.


COURSE CONTENTS: Data warehouse. Main concepts and architectures. Business Intelligence. Analytical reports. Information Cockpits. ROLAP (Relational Online Analytical Processing) and MOLAP (Multidimensional Online Analytical Processing) modeling. HOLAP (Hybrid Online Analytical Processing) ETL processes (extraction, transformation, loading). Data cleaning. Data integration. Data transformation. Data reduction. OLAP cubes. Facts and dimensions tables. Star and snowflake models. Hierarchies. Refreshing the data warehouse. SQL extensions for data warehouses, analytical functions. Indexing, partitioning and query optimization. Materialized views.




Data mining. Main concepts, tasks and algorithms. Associate rule mining and basic algorithms (A-Priori, FP-Growth). Sequence mining and basic algorithms (GSP, PrefixSpan). Classification problem and basic algorithms (ID3, C4.5, C5.0, CART, Naive Bayes classifier, neural networks). Clustering problem and basic algorithms (K-means, C-means, K-medoids, PAM, CLARA, CLARANS). Text mining (preprocessing, stop list, stemming, term-document matrix TDM, TF-IDF structures - Term Frequency Inverse Document Frequency, Latent Semantic Indexing - LSI, Singular Value Decomposition - SVD). Web mining (Page Rang, Hubs & authorities).

TEACHING METHODS: Lecture, laboratory exercises, individual projects

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 explores text data and the Web. K1I_U29 indexes and optimizes query analysis. K1I_W20 Can download (or update) data to data warehouse systems and data

mining systems from various external sources. K1I_U29 Can define and carry out typical data exploration tasks K1I_U29 Applies SQL language extensions for analytical functions realization K1I_U29 Names and explains basic concepts related to data warehouses and data

exploration


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

Laboratory – the main condition to get a pass is scoring sufficient marks for all laboratory exercises.

Project – the main condition to get a pass is scoring sufficient mark for an individual project given (design, implementation, testing).


STUDENT WORKLOAD:








150 Total 5








150 Total 5





1. Hand D. J., Mannila H., Smyth P.: Principles of Data Mining, MIT Press, 2000

2. Larose D.: Data Mining Methods and Models, John Wiley & Sons, 2006 (or Polish translation: Odkrywanie wiedzy z danych, Wydawnictwo Naukowe PWN, Warszawa, 2006)

3. Larose D.: Discovering Knowledge in Data: An Introduction to Data Mining, John Wiley & Sons, 2005

4. Jarke M., Lenzerini M., Vassiliou Y., Vassiliadis P.: Fundamentals of Data Warehouses, Springer-Verlag, 2000

OPTIONAL READING: -

REMARKS: -




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

Type of course: compulsory/optional





Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 15 1

VI

Grade


Project 15 1 Grade


Lecture 9 1

VI

Grade


Project 9 1 Grade

COURSE OBJECTIVE: - Familiarize students with the tools and techniques to verify the operation of digital systems

- Shaping the understanding of the need to ensure the highest quality of digital systems

- Shaping skills to design and verification of digital systems, in particular the use and measurement tools for the in-circiut verification stage

ENTRY REQUIREMENTS: Digital circuits, digital systems modeling language

COURSE CONTENTS: Construction and operation of diagnostic tools: Introduction to the construction, principles of operation and measurement digital diagnostic apparatus including digital oscilloscopes, logic analyzers, arbitrary generators. The use of an oscilloscope and arbitrary waveform generator for generating digital waveforms and analog waveforms recorded on the basis of using an oscilloscope. Interfaces measuring apparatus (RS -232, RS -485, GPIB, USB). The




study of selected parameters of digital circuits: Using the digital oscilloscope to measure the time parameters of digital circuits (TTL, CMOS, FPGA) including: propagation delay, rise time, fall time, hold time. Electrical parameters including current, voltage. Margin and immunity to interference. The boundary conditions of work of digital circuits. Diagnosis of hardware - software digital systems: Verification of signals at the outputs of digital circuits using a digital oscilloscope. Logic analyzer in the analysis of digital systems. Algorithms based on a trigger or changes in the signal values . Use of simulation results verify the prototype stage. Diagnostic software: Use specialized software in the process of diagnosis of digital systems ( FPGAView, Chipscope Pro). JTAG interface in the analysis of digital systems. Use FPGAView software and digital oscilloscope and/or logic analyzer. Embedding test modules inside embedded systems ( Chipscope Pro). Diagnosis of DSP systems: Use the signal generator and oscilloscope in the study of digital systems implementing DSP algorithms.

TEACHING METHODS: Lecture: Lecture problem, lecture conventional

laboratory: group work, laboratory exercises

project: teamwork, project method

LEARNING OUTCOMES:

Code Effects of the course K1I_W20 Is aware of impact of particular stages of design process on error occurrence in an

IT project and their elimination cost

K1I_U29 Is able to creatively plan a measurement experiment and interpret its results. In the light of the results identify the malfunction area and suggest a method for its elimination

K1I_U29 Can name and explain measurement errors, estimate their impact on experiment outcome, apply measurement error compensation techniques in digital micro information systems

K1I_U29 Can use digital diagnostic equipment (digital oscilloscope, logical states analyzer) and embedded logical analyzers and appropriately select tools for carrying out tests

K1I_U29 Can characterize and select verification techniques for FPGA embedded micro informatics systems functioning. Can recognize serial Bus protocols and point at typical applications for them

K1I_W20 Understands the need and aim of informatics systems testing and verification




Project - - project, report, oral presentation the passing condition is to obtain positive marks


STUDENT WORKLOAD:







Personal and on-line consultations 0

150 Total 5











150 Total 5


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. 3. Wiszniewski B., Bereza-Jarociński B.: Teoria i praktyka testowania programów.

Wydawnictwo PWN, 2006.

REMARKS: -




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






Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


5

Lecture 15 1

VI

Grade


Project 15 1 Grade


Lecture 9 1

VI

Grade


Project 9 1 Grade

COURSE OBJECTIVE: - Familiarize students with the life cycle of a computer system with particular emphasis on the tools and techniques of verification

- shaping the understanding of the need to ensure the highest quality and reliability of information systems

- shaping skills to design and verification of computer systems, and in particular the use of automate test tools to and verification of hardware part of systems

ENTRY REQUIREMENTS: digital Circuits

COURSE CONTENTS: Basic principles of testing programs, testing place in the computer engineering and software engineering. Inspection of the source code and test cases development. Testing individual application modules, integration testing. Functional testing, system, acceptance and installation. Extreme testing. Web applications testing. Construction and operation of diagnostic tools:




Introduction to the construction, principles of operation and measurement digital diagnostic apparatus. The use of an oscilloscope and arbitrary waveform generator for generating digital waveforms and analog waveforms recorded on the basis of using an oscilloscope. Interfaces measuring apparatus (RS -232, RS-485, GPIB, USB). The theoretical basis for conformance testing (compliance) test automation. The study of selected parameters of digital circuits: Using the digital oscilloscope to measure the time parameters of digital circuits (TTL, CMOS, FPGA) including the time and frequency parameters. Electrical parameters including current, voltage. The boundary conditions of work of digital circuits. Diagnosis of hardware - software systems micro-informatics : Logic analyzer in the analysis of digital systems. Developing algorithms trigger based on changes or signal values . Use of simulation results verify the prototype stage. Extending digital microsystems of the block generator for testing. Debugging serial buses (I2C, SPI, RS -232, CAN) using an oscilloscope. Analysis of transmission in computer networks. Diagnostic software: The Use of specialized software in the process of diagnosis of digital systems (FPGAView, Chipscope Pro). JTAG interface in the analysis of digital systems. Use FPGAView software and digital oscilloscope and / or logic analyzer. Embedding test modules inside embedded systems (Chipscope Pro).

TEACHING METHODS: Lecture: Lecture problem, lecture conventional

laboratory: group work, laboratory exercises

project: teamwork, project method

LEARNING OUTCOMES:

Code Effects of the course K1I_W20 Is aware of impact of particular stages of design process on error occurrence in an

IT project and their elimination cost

K1I_U29 Is able to creatively plan tests and interpret its results. In the light of the results identify the malfunction area (both, in hardware and software) and suggest a method for its elimination

K1I_W20 Has basic knowledge on informatics systems life cycles, and on methods and tools for informatics systems verification and testing

K1I_U29 Can name and explain measurement errors, estimate their impact on experiment outcome, apply measurement error compensation techniques in digital micro information systems

K1I_U29 Can use digital diagnostic equipment and dedicated software and appropriately select tools for carrying out tests

K1I_U29 Can characterize select verification techniques for hardware-software informatics systems

K1I_U29 Knows and can apply tools supporting processes of software testing and tests automation




Project - - project, report, oral presentation the passing condition is to obtain positive marks


STUDENT WORKLOAD:











150 Total 5








150 Total 5


1. Wiszniewski B., Bereza-Jarociński B.: Teoria i praktyka testowania programów. Wydawnictwo PWN, 2006.

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

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

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

5. Myers G. J., Sandler C., Badgett T., Thomas T. M: Sztuka testowania oprogramowania, Helion, 2005

OPTIONAL READING:

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

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

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

REMARKS: -




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



Direc tor of studies: Ass. Prof. Grzegorz Łabiak, Ph.D.

Name of lec turer : Ass. Prof. Grzegorz Łabiak, Ph.D


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 15 1

VI

Grade


Project 15 1 Grade


Lecture 9 1

VI

Grade


Project 9 1 Grade

COURSE OBJECTIVE: To provide practical skills at low level operational system programming with the use of Windows Application Programming Interface.

To provide basic knowledge about static (lib) and dynamic (dll) libraries, OpenGL, DirectX.

ENTRY REQUIREMENTS: Principles of programming, Computer architectures I and II

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.

TEACHING METHODS: Lecture, project, laboratory exercises.

LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Learns about the role and principles of creating and acquires the skill to

create and use static (*.lib) and dynamic (*.dll) libraries. K1I_U29 Can make simple applications built of the API functions in C / C + + on the

principles of construction of the system software (for the operating system).

K1I_W20 Is also acquaintanced with such low level technologies as OpenGL and DirectX in the extent which enables further self-education

K1I_W20 Understands OS role for a programmer, in particular Windows system, and the role of AP




Project – the passing condition is to obtain positive mark from the own program.


STUDENT WORKLOAD:









180 Total 6









180 Total 6






2. Charles Petzold, Programowanie Windows, Microsoft Press, 1999

3. Roland Wacławek, Windows od kuchnik, Help, 1993

4. Wiktor Zychla, Programowanie pod Windows, wersja 0.99, Instytut Informatyki Uniwersytetu Wrocławskiego, Wrocław 2003

5. Wiktor Zychla, Programowanie pod Windows. Zbiór zadań, wersja 0.3, Instytut Informatyki Uniwersytetu Wrocławskiego, Wrocław 2006

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

7. Robert Krupiński, Aplikacje Direct3D, Helion 2002

8. Jeffrey Richter, Advanced Windows, Microsoft Press, 1997

OPTIONAL READING: -

REMARKS: -




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



Direc tor of studies: Ass. Prof. Tomasz Gratkowski, Ph.D.

Name of lec turer :

Ass. Prof. Tomasz Gratkowski, Ph.D.

Ass. Prof. Jacek Tkacz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste


for a course


a l loca ted


6

Lecture 15 1

VI

Exam


Project 15 1 Grade


Lecture 9 1

VI

Exam


Project 9 1 Grade

COURSE OBJECTIVE: - To introduce students with the basics method of building multitier internet system in Java 2 Enterprise Edition technology.

- To familiarize students with the principles of design multitier internet system in Java 2 Enterprise Edition technology.

ENTRY REQUIREMENTS: Principles of programming,

COURSE CONTENTS: Presentation tier: Getting Started with Web Applications. Technologies for creating dynamic Web sites and rich internet applications (RIA).

Web Services: Introduction to Web Services. Building Web Services and Web Services clients. Using of Simple Object Access Protocol (SOAP).

A Component Tier: A Component container. What Is a Session Bean. What Is a Message-Driven Bean. Building, Packaging, Deploying, and Running the component’s application.




Data Tier: Object/relational data mapping. Data model on all tiers in multi-tier system.

Additional services: Introduction to Security in the Multitier Systems. Design patterns for multi-tier systems.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can use the latest tools and technologies supporting the creation of

online multilayer systems. K1I_U29 Can design and create a modern multilayer Internet system. K1I_W20 Can explain the idea behind the application of component technology. K1I_W20 Can describe a way of building systems based on a service model. K1I_W20 Is aware of the need to use multilayer models when constructing complex

applications.


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

Laboratory – in order to get a credit it is necessary to earn positive grades for all laboratory works defined by tutor

Project – positive mark of the project


STUDENT WORKLOAD:









180 Total 6









180 Total 6




RECOMMENDED READING: 1. Eric Jendrock, Jennifer Ball, Debbie Carson, Ian Evans, Scott Fordin, Kim Haase: The Java

EE 5 Tutorial For Sun Java System Application Server 9.1; October 2008;

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

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

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

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

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

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

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

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

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

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

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

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

OPTIONAL READING:-

REMARKS: -




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



Direc tor of studies: Ass. Prof. Jacek Tkacz, Ph.D.

Name of lec turer : Ass. Prof. Jacek Tkacz, Ph.D.


Number of

teachin

g h

ours

per semeste

r

Number of

teachin

g h

ours

per week

Semeste

r


for a course


a l loca ted


6

Lecture 15 1

VI

Exam


Project 15 1 Grade


Lecture 9 1

VI

Exam


Project 9 1 Grade

COURSE OBJECTIVE: Basic knowledge about available mobile technologies and competence in practical mobile application development.


COURSE CONTENTS: Introduction into designing mobile application Preparation and setup developer environment. Emulation of mobile systems. Developing and debugging mobile applications using the emulators and physical devices.

User interfaces. The design and the implementation of GUI of mobile applications. Rich Internet Applications (RIA) technology for design of mobile user interfaces.

Access to data. Databases dedicated for mobile technology. Access and synchronization with external data sources. Object/relational data mapping.

Exchange information between mobile application and external environment. Communications by using wireless technology: Wireless network (WiFi), BLUETOOTH. XML language as universal




format of data exchange. Web services (SOAP) technology for universal data exchange. Data serialization using JSon technology.

Localization. Global Positioning System. Serial communication with internal and external GPS modules. GPS communication protocol NMEA-0183. Positioning by using WiFi and GSM information.


LEARNING OUTCOMES:

Code Effects of the course K1I_U29 Can analyze a given problem in order to solve it. K1I_U29 Can independently realize a small IT project in mobile technologies. K1I_W20 Has knowledge on the current state of the market related to mobile

technologies. K1I_W20 Has knowledge on emulation, creating code in a limited mobile

environment. K1I_W20 Knows differences and limitations of technologies put forward by various

producers K1I_W20 Has knowledge on communication standards and technologies used

during communication. K1I_U29 Can prepare and configure a programming environment intended for the

production of mobile applications. K1I_U29 Can analyze an application code, both in an emulated environment and

actual device. K1I_U29 Can obtain the access to individual components of a mobile device to

program them. K1I_U29 Can communicate a mobile device with other devices, including the

devices designed to geographical location (GPS). K1I_U29 Can design and implement a mobile database functioning in a very limited

mobile environment. K1I_U29 Can create mobile user interfaces with simultaneous separation of the

presentation layer from the application logic layer.


Lecture – the main condition to get a pass are sufficient marks in written exam.


Project – the main condition to get a pass are sufficient marks for individual task conducted during the semester. There is also possible, that larger tasks can be carried out in groups, but each student will be assessed individually.


STUDENT WORKLOAD:









180 Total 6












180 Total 6

RECOMMENDED READING: 1. Imieliński T. Mobile Computing. KLUWER, 1996.

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

3. Kumar V. “Mobile Database Systems”, John Wiley & Sons, 2006

4. Burnette E. “Hello, Android: Introducing Google's Mobile Development Platform”, 2010

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

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

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

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

9. CODEGURU http://www.codeguru.com/

OPTIONAL READING: -

REMARKS: -

CompScience undregraduate ECTS Inf Ist · model to statistical inference K1I_W01 Is aware of the...

Documents

Transcript of CompScience undregraduate ECTS Inf Ist · model to statistical inference K1I_W01 Is aware of the...