Faculty of Electrical Engineering, Computer Science and Telecommunications. University of Zielona Góra INFORMATION BOOKLET

Faculty of Electrical Engineering, Computer Science and Telecommunications University of Zielona Góra INFORMATION BOOKLET Subject Area: COMPUTER SCIENCE (INFORMATICS) First-cycle Level Studies (Full-time, Part-time) Academic Year 2010/2011 European Credit Transfer System ECTS

Part II.B ECTS COURSE CATALOGUE COMPUTER SCIENCE (INFORMATICS) FIRST-CYCLE LEVEL STUDY (B.Sc.Degree) S P E C I A L I S T S U B J E C T

TABLE OF CO TE TS Computer architecture I 4 Principles of programming 6 Object-oriented programming 8 Algortihms and data structures 10 Digital system design 12 Computers network I 14 Theoretical foundations of computer science 16 Operating systems I 18 Computer graphics 20 Software engineering 22 Databases 24 Elements of artificial intelligence 26 Embedded systems 28 Social and professional problems of computer science 30 Project maganement 32 Mathematical foundations of engineering 34 Experiment methodology I 36 Computer Networks II 38 Java and Web technologies 40 Concurrent and distributed programming 42 Operating Systems II 44 i

Table of contents Development of information systems 46 Hardware Description Languages 48 Data safety and cryptography 50 Informatics systems testing 52 Fault diagnosis of digital systems 54 Designe of Multitier web systems 56 Mobile technologies and applications 58 OperaTional system level programming 60 Microprocessors systems 62 Information Systems In Management 64 Computer-aided design 66 Internet application 68 Industrial computer network 70 signal processing techniques 72 Wireless network 74 Software for measurement and control equipment 76 ii

SPECIALIST SUBJECTS

Specialist subjects C O M P U TT E R A R C H I TT E C TT U R E I Course code: 06.0-WE-I-AK1-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab. inż. Andrzej Pieczyński, prof. UZ Name of lecturer: Dr hab. inż. Andrzej Pieczyński, prof. UZ Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 15 1 I 1 Part-time studies Lecture 15 1 I COURSE CONTENTS: Point of work of computer system: von Neumann and Harvard models. Rules of cooperation between CPU and memory in data processing. Input output operations. Memory hierarchy, address structure. Multi-processor systems. Flynn classification, SIMD, MISD, MIMD machines. Programmatic model of CPU. Machine levels and machine languages, instructions list architecture. Data representation and types. Integer number coding. Floating point representation of numbers. IEEE 754 standard. Data processing. Add, substract, multiply and divide algorithms. Arithmetic operations rate. Addressing modes. Program controlling. Conditions and branches. Connection with environment. Buses (ISA, EISA, LB, PCI, AGP). Peripherals monitor, keyboard, mouse. Principles of operation and terms of use. Multimedia environment. Memory arrangement and hierarchy. Cache memory control and handling. Cache integrity problem. MESI model. Mass storage. Methods of data writing on magnetic and optical carrier. Disk controllers. Instructions pipelining. Cooperation of many executive units. Branch prognose and implementation. Information processing models. RISC architectures and characteristics. Parallel programs and machines. Acceleration mechanisms. Pipelining. Branch prognose. Branch acceleration implementation. Separate and multilevel cache memory. Memory system arrangement. Review of modern RISC architectures. CISC class processors architecture. Architectures classification. Parallel executing of programs in multiprocessor systems. Parallel machines classification. Methods of parallel systems programming. Communication and synchronisation techniques. Decomposition of problem for parallel computing. Distributed systems. 4

LEARNING OUTCOMES: ECTS Course Catalogue Computer Science first-cycle level Knowledge of computer structure, conditions of data transfer, storage and processing, basic rules of computer operation. Parallel architectures of computers. ASSESSMENT CRITERIA: Lecture the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester. RECOMMENDED READING: [1] Chalk B.S.: Computer arrangement and architecture, WNT, Warszawa, 1998 (in polish) [2] Metzger P.: PC Anatomy, wydanie VI, Helion, 2003 (in polish) [3] Metzger P.: Diagnostics and optimization of PC, Helion, 2001 (in polish) [4] Mueller S.: PC upgrade and service, Helion, 2001 (in polish) [5] Mueller S., Soper M. E.: PC upgrade and service. Vademecum, Helion, 2001 OPTIONAL READING: [1] 5

Specialist subjects P R I N C I P LL E S O FF P R O G R A M M I N G Course code: 11.3-WE-I-PP-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr inż. Wojciech Zając Name of lecturer: Dr inż. Wojciech Zając Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 I Part-time studies 4 Lecture 30 2 Laboratory 30 2 I Project 15 1 COURSE CONTENTS: Computer system architecture and resources. Operating system. Program design. Programming languages. The data and its representation. Algorithm visualisation. Algorithmic languages. Program performance analysis. C programming. Program structure, commands syntax. Constants, variables, data types. Operators, expressions and basic instructions of C. Basic operations on variables. Arithmetical operators, hierarchy. Data input and output. Printout formatting with printf function. Flag, field width, precision, formatting character. Character conversion. ASCII table. Complex instructions, expressional instruction, empty instruction, grouping instruction. Control instructions: if-else, switch. Loops: do, while, for. Expressions and operators. Functions: structure, arguments, result, prototype, declaration, calling out. Communication with other elements. Use of functions. Recurrence functions. Pointers: rules of operation, declaration, using the address and the pointed value. Use of pointers to communicate with other elements. Tables: declaration, usage, examples. String as a table of characters. Name of a table as a pointer. Tables of tables: declaration, usage, examples. Data structures. Features, operation. Tables of structures. Fields. Unions. Disk file. Definition, structure, buffering. Directory, path. File operations: creating a stream, file opening, reading/writing, closing. 6

ECTS Course Catalogue Computer Science first-cycle level LEARNING OUTCOMES: Abilities and competence in computer system operation understanding and programming in C. 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 exercises and tests conducted during the semester. RECOMMENDED READING: [1] Brad Jones. Teach Yourself C in 21 Days, Macmillan Computer Publishing, http://lib.daemon.am/books/c/ [2] Mike Banahan, Declan Brady and Mark Doran, The C Book, Addison Wesley, 1991, available free online: http://publications.gbdirect.co.uk/c_book/ [3] K. N. King, C Programming: A Modern Approach, 2008 OPTIONAL READING: [1] 7

Specialist subjects O B JJ E C TT - O R I E N TT E D P R O G R A M M I N G Course code: 11.3-WE-I-PO-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr inż. Paweł Majdzik Name of lecturer: Dr inż. Paweł Majdzik Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 II Part-time studies 7 Lecture 18 2 Laboratory 18 2 III COURSE CONTENTS: 1.Introduction to object progarmming. Abstract data typing definition with member functions (encapsulation), private and public functions. 2. Constructors and destructors. The initialization of the objects by the conctructors (default and copy constructors), the constructor initializer list. 3. Functions overloading: friend functions and inline functions, constructor and operator conversion. 4. Inheritance and the composition of objects. Polymorphism, virtual functions, virtual destructors, late binding. 5. Standard Template Library. Templates of classes and functions. Containers and algorithms, iterators, associative containers, function objects. 6. Designing of object-oriented programming. 7. Design pattern. Adapter pattern, facade pattern, bridge pattern etc.. LEARNING OUTCOMES: The aim of the subject is to acquaintance students with the object programming paradigm. In particular the lectures include: abstract data typing definition with member functions (encapsulation), inheritance, polymorphism and virtual functions, templates of classes and functions. The aim of the laboratory is to teach how to design programs and utilize tools (e.g. tools from Standard Template Library) created to support a programmer's work. 8

ASSESSMENT CRITERIA: Lecture obtaining a positive grade in written or oral exam. ECTS Course Catalogue Computer Science first-cycle level Laboratory the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester. RECOMMENDED READING: 1. Lippman S. B.: Model obiektu w C++, WNT, Warszawa, 1996 2. Eckel B.: Thinking in C++, Hellion, Warszawa, 2002 3. Stroustrup B.: Programming in C++, WNT, Warszawa, 2002 4. Alan Shalloway, James R. Trott.: Projektowanie zorientowane obiektowo. Wzorce obiektowe II, Helion, Warszawa, 2005. OPTIONAL READING: [1] 9

Specialist subjects A LL G O R I TT H M S A N D D A TT A S TT R U C TT U R E S Course code: 11.3-WE-I-ASD-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab inż. Andrzej Obuchowicz, prof UZ Name of lecturer: Dr hab inż. Andrzej Obuchowicz, prof UZ Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 15 1 I Exam Part-time studies 4 Lecture 18 2 Laboratory 18 2 II Exam COURSE CONTENTS: An algorithm and its basic properties. Concepts of an algorithmic problem and algorithm, properties of algorithms, steering structures and block schemes. Programming techniques. Recursion and derecursion, divide and conquer strategy, greedy algorithms, dynamic programming. Data structures. Concepts of a data structure, dynamic sets, linear-ordered sets, dictionary structure, stuck (LIFO) and queue (FIFO). Linked lists: singly-linked, doubly-linked and circularly-linked lists. Binary trees, priority queues. Dictionaries. Binary-search tree (BST), AVL tree, Red-Black tree. Hush tables. B-tree. Sets and Graphs. Sets, graphs, graph representations, depth-first and breadth-first searching, graphtheory algorithms. Analysis of the selected algorithmic problems. Linear and bipartition searching, table and file sorting, string searching algorithms, geometrical algorithms, paging problem, arithmetic systems, basic coding and compression methods. 10

LEARNING OUTCOMES: ECTS Course Catalogue Computer Science first-cycle level Basic knowledge and engineering skills in designing algorithms using basic algorithmic techniques. ASSESSMENT CRITERIA: Lecture obtaining a positive grade in written or oral exam. Laboratory the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester. RECOMMENDED READING: [1] Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994 [2] Knuth D.E..: The Art of Computing. Sorting and Seraching, Vol. 3, Addison-Wesley, Reading, 1973. [3] Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, 1983 OPTIONAL READING: [1] 11

Specialist subjects D I G I TT A LL S Y S TT E M D E S I G N Course code: 06.0-WE-I-UC-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr inż. Zbigniew Skowroński Name of lecturer: Dr inż. Zbigniew Skowroński Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 II Part-time studies 4 Lecture 18 2 Laboratory 18 2 IV COURSE CONTENTS: Digital Computers and Information. Binary signals, information representation, generic computer architecture. Number systems, operations and conversions: decimal, binary, octal, hex. Codes: BCD, parity, Gray, ASCII, Unicode. Combinational Logic. Binary logic/gates. Boolean Algebra, functions, properties and theorems. Standard forms: minterms/maxterms, SoP, PoS. Karnaugh maps: 2, 3, 4, 5 and 6 variables maps. Quine- McCluskey Boolean function minimization. Two-level/Multilevel circuit optimization. Basic Logic Gates, popular technologies. NAND/NOR gates and circuits: two-level and multi-level implementations. Exclusive-OR gates: odd function, parity function. High impedance outputs: tri-state buffers and transmission gates. Integrated circuits: levels of integration, digital logic families, negative/positive logic. CMOS circuits: switch models, nets of switches, fully complementary CMOS, basic gates, complex gates, transmission gate. Combinational Logic Design. Design principles (hierarchy, top-down design, CAD, HDLs, logic synthesis). Combinational circuit analysis and timing. Design procedure (examples). Technology mapping. Combinational Functions and Circuits. Decoders, expansion, circuit implementation using decoders. Encoders, expansion, priority encoders. Multiplexers, implementation, Quad-MUX, MUX as universal gate. Circuit implementation using MUXes. Iterative Combinational Circuits. Binary Adders (HA, FA, ripple-carry, carry-lookahead). Binary Subtraction (unsigned, 1's and 2's complements). Binary Adder/Subtractors. Binary Adder/Subtractors (signed numbers). Binary Multiplication. Other Arithmetic functions. Circuit implementation using PLDs (ROM, PLA, PAL). Sequential Circuits. Latches (SR, S'R', D). Flip-flops (Master-Slave, Edge-triggering). Characteristic Tables/Equations. Asynchronous Set/Reset. Sequential Circuit Analysis: Input Equations, State Tables, State Diagrams. Mealy vs. Moore machines. Timing (FF and Circuit). Sequential Circuit Design: Design 12

ECTS Course Catalogue Computer Science first-cycle level procedure, finding state diagrams/tables, examples. Sequential Circuit Design: state assignment, designing with D and JK flip-flops, designing with unused states, other design examples. Registers. Registers with Load Enable and with Parallel Load. Register Transfers. Shift Registers, Shift Registers with Parallel Load, Bidirectional/Universal Shift Registers. Counters. Ripple Counters. Synchronous Binary Counters: design with D and JK flip-flops. Serial and Parallel gating. Binary Up-Down Counter. Binary Counter with Parallel Load. BCD and Arbitrary Sequence Counters. Modulo N counters. Memory Basics. SRAM. DRAM. Basic memory system design. LEARNING OUTCOMES: Demonstrate knowledge of fundamental Boolean principles and manipulation and their application to digital design. In-depth understanding of combinational and sequential digital/logic circuits, and modular design techniques. Ability to analyze and synthesize logic circuits. Basic understanding of datapath and control unit design and memory basics. 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. RECOMMENDED READING: A. B. Marcovitz: Introduction to Logic Design, McGraw-Hill, 2002 C. H. Roth, Jr.: Fundamentals of Logic Design, 5 th Edition, Thomson Brooks/Cole, 2004 F. A. Scarpino: VHDL and AHDL Digital System Implementation, Prentice-Hall, 1998 J. F. Wakerly: Digital Design, Principles and Practices, 4 th Edition, Prentice-Hall, 2005 K. Skahill: VHDL for Programmable Logic, Addison-Wesley Publishing, 1996 M. Zwolinski: Digital System Design with VHDL, 2 nd Edition, Prentice-Hall, 2003 R. H. Katz, G. Borriello: Contemporary Logic Design, 2 nd Edition, Pearson Education, 2005 S. Brown and Z. Vranesic: Fundamentals of Digital Logic with VHDL Design, McGraw-Hill, 2000 Μ. Μ. Mano and C. R. Kime: Logic and Computer Design Fundamentals, 4 th Edition, Prentice-Hall, 2007 Μ. Μ. Mano, M. D. Ciletti: Digital Design, 4 th Edition, Prentice-Hall, 2007 OPTIONAL READING: [1] 13

Specialist subjects C O M P U TT E R S N E TT W O R K I Course code: 11.3-WE-I-SK1-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr inż. Emil Michta Name of lecturer: Dr inż. Marcin Mrugalski Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 II Part-time studies 2 Lecture 18 2 II COURSE CONTENTS: Introduction to computer networks: Classification of computer networks. Hardware and software components of network hosts. OSI communication model. TCP/IP reference model. Physical layer: Electronics and signals. Media, connections and collisions. Physical topology. Network devices of physical layer. Data link layer: Concepts and technologies. Logical topologies. LAN networks segmentation. Network devices of data link layer. Fundamentals of switch configuration. LAN networks standards: Fast Ethernet, Gigabit Ethernet and 10 Gigabit Ethernet. Network layer: Routing and addressing. Routing protocols and routed protocols. Network layer devices. IP address management. Transport layer: Functions and TCP and UDP transports protocols. Session, presentation and application layers: Functions and protocols. Internet technology components. Fundamentals of WAN networks: Standards and topologies. Circuits, packet and cells switching. Introduction to routers: Router components and operation. User interface and configuration principle. Security basis: Firewalls: generations, structures and configurations. LAN network design: Rules of LAN networks design and documentation. Structural cabling. LEARNING OUTCOMES: Abilities and competence: design, installation and configuration of simple local area network connected to Internet, IP address management, switch and router configuration, firewall configuration. ASSESSMENT CRITERIA: Lecture the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester. 14

ECTS Course Catalogue Computer Science first-cycle level RECOMMENDED READING: 1. Breyer R., Riley S.: Switched, Fast and Gigabit Ethernet. Helion, Gliwice, 2003. (in Polish) 2. Jakubowska A. and others: Cisco networking academy. Semester 1-4, Mikom, Warszawa, 2006. (in Polish) 3. Mueller S., Ogletree T.: Upgrading and repairing networks. Helion, Gliwice, 2004. (in Polish) 4. Rosehan P., Leary J.: 802.11 Wireless networks. Mikom, Warszawa, 2004. (in Polish) 5. Sportack M.: Computer networks. Expert book. Helion, Gliwice. (in Polish)) OPTIONAL READING: [1] 15

Specialist subjects TT H E O R E TT I C A LL FF O U N D A TT I O N S O FF C O M P U TT E R S C I E N C E Course code: 11.3-WE-I-TPI-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab. inż. Andrzej Obuchowicz, prof UZ. Name of lecturer: Dr hab. inż. Andrzej Obuchowicz, prof UZ. Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Class 30 2 III Exam Part-time studies 7 Lecture 18 2 Class 18 2 IV Exam COURSE CONTENTS: Introduction. Concepts of an algorithmic problem and algorithm, properties of algorithms, asymptotic notation. Algorithmic correctness. Correctness of algorithms, partial correctness of algorithms, termination, proving of algorithm correctness, loop invariants method. Foundations of automation and languages theory. Finite automata and regular expressions, context-free grammars, pushdown automata and context-free languages. Abstract machines. Church-Turing thesis, Turing machine and its variants, RAM machine, counter machine. Algorithm complexity. Measures of algorithms effectiveness, space and time complexity, pessimistic and average complexity, top and down limits of complexity, natural complexity of problems, algorithmically open and close problems, algorithmic gap. Classification of algorithmic problems: P class, Exponential class, NP and NP-complete class. Reduction. Decidable and undecidable problems Concurrent and probabilistic algorithms. Static and expanded concurrency. Product complexity. Nets. Thesis about the concurrent computation. Nick class. RNC algorithms. Probabilistic classes of complexity. LEARNING OUTCOMES: Basic knowledge and engineering skills in analysis of correctness and complexity of sequential, parallel and probabilistic algorithms. 16

ASSESSMENT CRITERIA: Lecture obtaining a positive grade in written or oral exam. ECTS Course Catalogue Computer Science first-cycle level Laboratory the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester. RECOMMENDED READING: 1. Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994. 2. Knuth D.E..: The Art of Computing. Sorting and Seraching, Vol. 3, Addison-Wesley, Reading, 1973. 3. Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, 1983. 4. Ben Ari M.: Mathematical Logic for Computer Science, Springer-Verlag, Berlin Hiedelberg, 2001. 5. Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, 1994. 6. Graham R.L., Knuth D.E., Patashnik O.: Concrete Mathematics, Addison-Wesley, Readings, 1994. OPTIONAL READING: [1] 17

Specialist subjects O P E R A TT I N G S Y S TT E M S I Course code: 11.3-WE-I-SO1-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab. inż. Krzysztof Patan Name of lecturer: Dr hab. inż. Krzysztof Patan Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 III Part-time studies 5 Lecture 18 2 Laboratory 18 2 III COURSE CONTENTS: Computer system structure: Operating memory, CPU, I/O devices, idea of the interupt, dual model of system operation. Operating systems types: Batch systems, multiprogramming systems, time-sharing (multi-tasking) systems, parallel systems, distributed systems, networked systems, real-time operating systems. Operating systems design. Basic components of operating systems. Operating systems services. Kernel based systems, virtual machines. System calls. CPU scheduling. Scheduling criteria, scheduling algorithms. Evaluation of scheduling algorithms. Round robin, priority scheduling, preemptive scheduling. Memory management. Logical and physical addresses space. Contiguous allocation. Fragmentation: external and internal. Packing. Paging. Segmentation. Virtual memory. Demand paging. Page replacement. Performance of demand paging. Algorithms of page replacement. Allocation of frames. Demand segmentation. File system. File concept. Directory structure. File system structure. Allocation methods. Free-space management. File system structure. Windows XP/Vista, Windows Server 2003. System configuration, administration tasks, administration tools. Managing files and directories. User accounts, group accounts. Rights to files, directories and system components. Audit of system components. Monitoring operating system. Analysis of system components. LEARNING OUTCOMES: Skills and competences in computer systems and operating systems design. To learn about process scheduling, memory management, file system design. Ability to administrate and configure the operating systems Windows XP/Vista and Windows Server 2008. 18

ECTS Course Catalogue Computer Science first-cycle level 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. RECOMMENDED READING: [1] Silberschatz A., Galvin P.B., Gagne G.: Operating System Concepts. Seventh Edition, Wiley, 2005. [2] Tanenbaum A.: Modern Operating Systems, Prentice Hall, 2001. [3] Stallings W.: Operating Systems: Internals And Design Principles, Fourth Edition, Prentice Hall, 2000 OPTIONAL READING: [1] 19

Specialist subjects C O M P U TT E R G R A P H I C S Course code: 11.3-WE-I-GK-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab. inż. Sławomir Nikiel Name of lecturer: Dr hab. inż. Sławomir Nikiel Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 III Part-time studies 5 Lecture 18 2 Laboratory 18 2 III COURSE CONTENTS: Human factors. Human perception of visual stimuli. Digital content creation process. Models for computer graphics. Introduction to computer graphics and digital imaging. Input/output devices, acquisition and display of digital images. Application cases in education, entertainment, architecture, industry and healthcare. Raster images. Color models, models of digital images. Desk-Top Publishing (DTP). Image processing, digital image analysis. Textures. Fractals in computer graphics. Vector models. Geometry models for graphical objects. Interpolators. Hierarchical structure of a graphical model. Definition of rendering pipeline. 3D scene construction. Computer Aided Design (CAD). Transformations and rendering of 3D geometry. Shading and shadows. Photo-realistic synthesis of images. Ray Tracing, Radiosity, Environmental Mapping and Image-based Rendering. Stereoscopy. Programming form computer graphics. OGL, DirectX, Cg, PYTHON. 20

LEARNING OUTCOMES: ECTS Course Catalogue Computer Science first-cycle level Skills and competences in programming and design for computer graphics, digital image synthesis and image processing. Modeling two- and three-dimensional geometry and object representation. 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. RECOMMENDED READING: 1. Hearn. D, Baker D.: Computer Graphics- C version, Prentice Hall, 1997 2. Xiang Z., Plastock R.: Shaum s outline of computer graphics, McGraw-Hill, 2000 3. Preparata P., Shamos N.: Computational geometry. Introduction, Springer, 1993 4. Sun Microsystems: From pixels to pictures, Addison Wesley, 1991 5. Various conference proceedings OPTIONAL READING: [1] 21

Specialist subjects S O FF TT W A R E E N G I N E E R I N G Course code: 11.9-WE-I-IO-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr hab. inż. Sławomir Nikiel Name of lecturer: Dr hab. inż. Sławomir Nikiel Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 IV Project 15 1 6 Part-time studies Lecture 30 2 Project 15 1 V COURSE CONTENTS: Introduction to software engineering. Why engineering software is different? Software lifespan and maintenance. Lifecycle models with specified project phases. Information systems. System and software design. Models for information systems. Software process. Requirements analysis and specification. Guidelines and forms for specification. Design. Purpose of design. Fundamental design concepts. Design strategies. Design quality metrics. Reliability and system security. Implementation. Review of structural programming. Error handling and defensive programming. Aids to maintainability. Coding for performance. Testing. Reasons for testing. Black box and structural testing. Testing strategies. Tools for testing CASE. Computer Aided Software Engineering. Upper and Lower CASE, CASE workbenches. Configuration and maintenance. Evolution of information systems. LEARNING OUTCOMES: To develop students attitude that the maintaining the production of software requires an engineering approach. It is done by introducing phases of the software lifecycle and presenting techniques for these phases. 22

ASSESSMENT CRITERIA: ECTS Course Catalogue Computer Science first-cycle level Lecture the main condition to get a pass are sufficient marks in written or oral tests conducted at least once per semester. Project the main condition to get a pass are sufficient marks for all exercises and tests conducted during the semester. RECOMMENDED READING: 1. Sommerville I.: Software Engineering Addison-Wesley, 1992 2. Pressman R.: Software Engineering, A practitioner s approach, McGraw-Hill, 1992 3. Ford N.J., Woodroffe M.: Introducing software engineering, Prentice-Hall, 1994. 4. Jones G.W.: Software Engineering, Wiley, 1990 OPTIONAL READING: [1] 23

Specialist subjects D A TT A B A S E S Course code: 11.3-WE-I-BD-PK_S1S Type of course: Compulsory Entry requirements: - Language of instruction: Polish Director of studies: Dr inż. Agnieszka Węgrzyn Name of lecturer: Dr inż. Agnieszka Węgrzyn, dr inż. Jarosław Gramacki Form of instruction per semester per week Semester Form of receiving a credit for a course ECTS credits allocated Full-time studies Lecture 30 2 Laboratory 30 2 IV Exam Part-time studies 7 Lecture 18 2 Laboratory 18 2 Project 9 1 IV Exam COURSE CONTENTS: Introduction to databases: relational model, hierarchical model, network model, XML model, objectoriented databases The relational model: Relational data objects and SQL; Relational operators and SQL; Relational data integrity, Entity-Relationship Diagram ERD, normalize relations into normal forms Introduction to SQL: create tables, insert, delete, update data, select statements, subquery, relational operators and constraint, create sequences, create view, create and manage indexes, built-in SQL functions, transactions Introduction to PL/SQL: PL/SQL types and operators, SQL in PL/SQL, cursors, exceptions, procedures, functions, packages, triggers, built-in packages. LEARNING OUTCOMES: Using of selected relational database management systems (RDBMS); design and implementation of relational database structures / models, SQL language; design of database applications; conceptual, logical, and physical database design. 24