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

Size: px
Start display at page:

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

Transcription

1 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

2 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

3 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

4 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

5 SPECIALIST SUBJECTS

6 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

7 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

8 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

9 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, [2] Mike Banahan, Declan Brady and Mark Doran, The C Book, Addison Wesley, 1991, available free online: [3] K. N. King, C Programming: A Modern Approach, 2008 OPTIONAL READING: [1] 7

10 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

11 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, Eckel B.: Thinking in C++, Hellion, Warszawa, Stroustrup B.: Programming in C++, WNT, Warszawa, Alan Shalloway, James R. Trott.: Projektowanie zorientowane obiektowo. Wzorce obiektowe II, Helion, Warszawa, OPTIONAL READING: [1] 9

12 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

13 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, [3] Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, 1983 OPTIONAL READING: [1] 11

14 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

15 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

16 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

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

18 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

19 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, Knuth D.E..: The Art of Computing. Sorting and Seraching, Vol. 3, Addison-Wesley, Reading, Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms, Addison-Wesley, Reading, Ben Ari M.: Mathematical Logic for Computer Science, Springer-Verlag, Berlin Hiedelberg, Cormen T.H, Leiserson C.E., Rivest R.L.: Introduction to algorithms, MIT Press, Graham R.L., Knuth D.E., Patashnik O.: Concrete Mathematics, Addison-Wesley, Readings, OPTIONAL READING: [1] 17

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

21 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, [2] Tanenbaum A.: Modern Operating Systems, Prentice Hall, [3] Stallings W.: Operating Systems: Internals And Design Principles, Fourth Edition, Prentice Hall, 2000 OPTIONAL READING: [1] 19

22 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

23 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, Xiang Z., Plastock R.: Shaum s outline of computer graphics, McGraw-Hill, Preparata P., Shamos N.: Computational geometry. Introduction, Springer, Sun Microsystems: From pixels to pictures, Addison Wesley, Various conference proceedings OPTIONAL READING: [1] 21

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

25 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, Pressman R.: Software Engineering, A practitioner s approach, McGraw-Hill, Ford N.J., Woodroffe M.: Introducing software engineering, Prentice-Hall, Jones G.W.: Software Engineering, Wiley, 1990 OPTIONAL READING: [1] 23

26 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

Division of Mathematical Sciences

Division of Mathematical Sciences Division of Mathematical Sciences Chair: Mohammad Ladan, Ph.D. The Division of Mathematical Sciences at Haigazian University includes Computer Science and Mathematics. The Bachelor of Science (B.S.) degree

More information

CISC 310 ONLINE Spring 2016. Review for Final Exam

CISC 310 ONLINE Spring 2016. Review for Final Exam CISC 310 ONLINE Spring 2016 Review for Final Exam The following is a study guide to help you prepare for the exam. The exam will include but not be limited to the information on this review sheet. The

More information

Course Outcomes. 2. Able to write, compile and debug programs in

Course Outcomes. 2. Able to write, compile and debug programs in Course Outcomes Course Code Course Name Course Outcomes CS-201/101 CS-191/291 CS-301 Computer System Programming Computer Programming Lab Data Structures & Algorithms 1. Able to have fundamental knowledge

More information

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent

More information

Computer Science. Master of Science

Computer Science. Master of Science Computer Science Master of Science The Master of Science in Computer Science program at UALR reflects current trends in the computer science discipline and provides students with a solid theoretical and

More information

Progress Record. Course 21 (V) Associate of Applied Science in Computer Information Technology and Systems Management

Progress Record. Course 21 (V) Associate of Applied Science in Computer Information Technology and Systems Management Progress Record Study your lessons in the order listed below. As graded examinations are returned to you, enter your grade in the space below. Set a schedule for yourself then watch your progress. Course

More information

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge of Computer Science

More information

INFORMATION TECHNOLOGY PROGRAM

INFORMATION TECHNOLOGY PROGRAM INFORMATION TECHNOLOGY PROGRAM The School of Information Technology offers a two-year bachelor degree program in Information Technology for students having acquired an advanced vocational certificate.

More information

Information and Communications Technology Courses at a Glance

Information and Communications Technology Courses at a Glance Information and Communications Technology Courses at a Glance Level 1 Courses ICT121 Introduction to Computer Systems Architecture This is an introductory course on the architecture of modern computer

More information

MEng, BSc Applied Computer Science

MEng, BSc Applied Computer Science School of Computing FACULTY OF ENGINEERING MEng, BSc Applied Computer Science Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give a machine instructions

More information

Advisor Counsel. Computer basics and Programming. Introduction to Engineering Design. C Programming Project. Digital Engineering

Advisor Counsel. Computer basics and Programming. Introduction to Engineering Design. C Programming Project. Digital Engineering Course Description ( 전체개설교과목개요 ) Advisor Counsel Yr. : Sem. : Course Code: CD0001 Advisor in the department which programs engineering education guides certificate program educational objectives, learning

More information

MEng, BSc Computer Science with Artificial Intelligence

MEng, BSc Computer Science with Artificial Intelligence School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give

More information

Department of Computer Science

Department of Computer Science Department of Computer Science Ali Sekmen, PhD 2, Chair 005, McCord Hall 615-963-5712 Faculty: K. Al Nasr, W. Chen, E. Erdemir, M. Hayes, H. Miao, T. Rogers, G. Shao, F. Yao General Statement: The Department

More information

Department of Electrical and Computer Engineering Faculty of Engineering and Architecture American University of Beirut Course Information

Department of Electrical and Computer Engineering Faculty of Engineering and Architecture American University of Beirut Course Information Department of Electrical and Computer Engineering Faculty of Engineering and Architecture American University of Beirut Course Information Course title: Computer Organization Course number: EECE 321 Catalog

More information

OKLAHOMA SUBJECT AREA TESTS (OSAT )

OKLAHOMA SUBJECT AREA TESTS (OSAT ) CERTIFICATION EXAMINATIONS FOR OKLAHOMA EDUCATORS (CEOE ) OKLAHOMA SUBJECT AREA TESTS (OSAT ) FIELD 081: COMPUTER SCIENCE September 2008 Subarea Range of Competencies I. Computer Use in Educational Environments

More information

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries First Semester Development 1A On completion of this subject students will be able to apply basic programming and problem solving skills in a 3 rd generation object-oriented programming language (such as

More information

COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)

COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.) VCU 1 COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.) The Bachelor of Science in Computer Science is built on a rigorous, highly concentrated, accredited curriculum of computer science courses. The program

More information

B.Sc. (Computer Science) First Year

B.Sc. (Computer Science) First Year B.Sc. (Computer Science) First Year Paper No. Title of Paper External Internal Assessment Maximum Pass Exam Durations Semester I I Computer Fundamentals & Programming 40 5 45 16 3hrs in C II Logical Organization

More information

IT4405 Computer Networks (Compulsory)

IT4405 Computer Networks (Compulsory) IT4405 Computer Networks (Compulsory) INTRODUCTION This course provides a comprehensive insight into the fundamental concepts in data communications, computer network systems and protocols both fixed and

More information

FACULTY OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY AUTUMN 2016 BACHELOR COURSES

FACULTY OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY AUTUMN 2016 BACHELOR COURSES FACULTY OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Please note! This is a preliminary list of courses for the study year 2016/2017. Changes may occur! AUTUMN 2016 BACHELOR COURSES DIP217 Applied Software

More information

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks UNIVERSITY OF KERALA First Degree Programme in Computer Applications Model Question Paper Semester I Course Code- CP 1121 Introduction to Computer Science TIME : 3 hrs Maximum Mark: 80 SECTION A [Very

More information

DIABLO VALLEY COLLEGE CATALOG 2014-2015

DIABLO VALLEY COLLEGE CATALOG 2014-2015 COMPUTER SCIENCE COMSC The computer science department offers courses in three general areas, each targeted to serve students with specific needs: 1. General education students seeking a computer literacy

More information

28. Minimize the following using Tabular method. f(a, b, c, d, e)= m(0,1,9,15,24,29,30) + d(8,11,31) 29. Minimize the following using K-map method.

28. Minimize the following using Tabular method. f(a, b, c, d, e)= m(0,1,9,15,24,29,30) + d(8,11,31) 29. Minimize the following using K-map method. Unit-1 1. Show Karnaugh map for equation Y = F(A,B,C) = S m(1, 2, 3, 6, 7) 2. Show Karnaugh map for equation Y = F(A,B,C,D) = S m(1, 2, 3, 6, 8, 9, 10, 12, 13, 14) 3. Give SOP form of Y = F(A,B,C,D) =

More information

Information Technology Career Field Pathways and Course Structure

Information Technology Career Field Pathways and Course Structure Information Technology Career Field Pathways and Course Structure Courses in Information Support and Services (N0) Computer Hardware 2 145025 Computer Software 145030 Networking 2 145035 Network Operating

More information

IT4504 - Data Communication and Networks (Optional)

IT4504 - Data Communication and Networks (Optional) - Data Communication and Networks (Optional) INTRODUCTION This is one of the optional courses designed for Semester 4 of the Bachelor of Information Technology Degree program. This course on Data Communication

More information

DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING

DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING Fall 2000 The instructions contained in this packet are to be used as a guide in preparing the Departmental Computer Science Degree Plan Form for the Bachelor's

More information

M.S. Computer Science Program

M.S. Computer Science Program M.S. Computer Science Program Pre-requisite Courses The following courses may be challenged by sitting for the placement examination. CSC 500: Discrete Structures (3 credits) Mathematics needed for Computer

More information

THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals

THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals Full Marks 100 (Theory 75, Practical 25) Introduction to Computers :- What is Computer?

More information

Master of Science in Computer Science

Master of Science in Computer Science Master of Science in Computer Science Background/Rationale The MSCS program aims to provide both breadth and depth of knowledge in the concepts and techniques related to the theory, design, implementation,

More information

COMPUTER SCIENCE. FACULTY: Jennifer Bowen, Chair Denise Byrnes, Associate Chair Sofia Visa

COMPUTER SCIENCE. FACULTY: Jennifer Bowen, Chair Denise Byrnes, Associate Chair Sofia Visa FACULTY: Jennifer Bowen, Chair Denise Byrnes, Associate Chair Sofia Visa COMPUTER SCIENCE Computer Science is the study of computer programs, abstract models of computers, and applications of computing.

More information

COURSE TITLE COURSE DESCRIPTION

COURSE TITLE COURSE DESCRIPTION COURSE TITLE COURSE DESCRIPTION CS-00X COMPUTING EXIT INTERVIEW All graduating students are required to meet with their department chairperson/program director to finalize requirements for degree completion.

More information

ENG DIGITAL CIRCUITS AND MICROPROCESSORS (3 lecture hours, 1 design hour) Fall 2015: Tuesday/Thursday 7:00 PM 8:20 PM/8:30 PM 8:55 PM/AR128

ENG DIGITAL CIRCUITS AND MICROPROCESSORS (3 lecture hours, 1 design hour) Fall 2015: Tuesday/Thursday 7:00 PM 8:20 PM/8:30 PM 8:55 PM/AR128 ENG 312-02 DIGITAL CIRCUITS AND MICROPROCESSORS (3 lecture hours, 1 design hour) Course Information Professor: Francis Delahanty Fall 2015: Tuesday/Thursday 7:00 PM 8:20 PM/8:30 PM 8:55 PM/AR128 Course

More information

ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science

ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science Program Schedule CTech Computer Science Credits CS101 Computer Science I 3 MATH100 Foundations of Mathematics and

More information

PRACTICE BOOK COMPUTER SCIENCE TEST. Graduate Record Examinations. This practice book contains. Become familiar with. Visit GRE Online at www.gre.

PRACTICE BOOK COMPUTER SCIENCE TEST. Graduate Record Examinations. This practice book contains. Become familiar with. Visit GRE Online at www.gre. This book is provided FREE with test registration by the Graduate Record Examinations Board. Graduate Record Examinations This practice book contains one actual full-length GRE Computer Science Test test-taking

More information

KMU International School

KMU International School KMU International School General Education 1. Writing & Critical Reasoning As a modern global intellectual, the student fosters his or her writing ability and capability of expression so that he or she

More information

KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

KITES TECHNOLOGY COURSE MODULE (C, C++, DS) KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL

More information

James B. Fenwick, Jr., Program Director and Associate Professor Ph.D., The University of Delaware FenwickJB@appstate.edu

James B. Fenwick, Jr., Program Director and Associate Professor Ph.D., The University of Delaware FenwickJB@appstate.edu 118 Master of Science in Computer Science Department of Computer Science College of Arts and Sciences James T. Wilkes, Chair and Professor Ph.D., Duke University WilkesJT@appstate.edu http://www.cs.appstate.edu/

More information

MSc Information Technology - E521

MSc Information Technology - E521 MSc Information Technology - E521 1. Aims and Objectives This conversion programme targets non-engineering graduates with a view of preparing them for the employment market where up-to-date IT skills represent

More information

UTTARAKHAND OPEN UNIVERSITY

UTTARAKHAND OPEN UNIVERSITY MCA Second Semester MCA-05 Computer Organization and Architecture MCA-06 Data Structure through C Language MCA-07 Fundamentals of Database Management System MCA-08 Project I MCA-P2 Practical MCA-05 Computer

More information

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme) Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme) COURSE LECTURE DURATION(LD) /paper SEMESTER-I 1. Course Code:CAN101

More information

Computer Science (COMP)

Computer Science (COMP) Prairie View A & M University 1 Computer Science (COMP) Courses COMP 1003 Digital Communication: 3 semester hours. Efficient communication in the digital world, including multi-media editing, web page/site

More information

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science I. Basic Course Information RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 105 Foundations of Computer Science A. Course Number and Title: CISY-105, Foundations of Computer Science B. New

More information

Computer Science MS Course Descriptions

Computer Science MS Course Descriptions Computer Science MS Course Descriptions CSc I0400: Operating Systems Underlying theoretical structure of operating systems; input-output and storage systems, data management and processing; assembly and

More information

Java (12 Weeks) Introduction to Java Programming Language

Java (12 Weeks) Introduction to Java Programming Language Java (12 Weeks) Topic Lecture No. Introduction to Java Programming Language 1 An Introduction to Java o Java as a Programming Platform, The Java "White Paper" Buzzwords, Java and the Internet, A Short

More information

M.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Final Year) Computer Science. Paper - I : ADVANCED DATABASE MANAGEMENT SYSTEMS

M.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Final Year) Computer Science. Paper - I : ADVANCED DATABASE MANAGEMENT SYSTEMS (DMTCS 21) M.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Final Year) Computer Science Paper - I : ADVANCED DATABASE MANAGEMENT SYSTEMS Time : 03 Hours Maximum Marks : 75 Answer question

More information

FLORIDA STATE COLLEGE AT JACKSONVILLE COLLEGE CREDIT COURSE OUTLINE

FLORIDA STATE COLLEGE AT JACKSONVILLE COLLEGE CREDIT COURSE OUTLINE Form 2A, Page 1 FLORIDA STATE COLLEGE AT JACKSONVILLE COLLEGE CREDIT COURSE OUTLINE COURSE NUMBER: CET 2600 COURSE TITLE: Network Fundamentals PREREQUISITE(S): CTS 1131 and CTS 1133 COREQUISITE(S): STUDENT

More information

2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce

2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce 2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge

More information

CSET 4750 Computer Networks and Data Communications (4 semester credit hours) CSET Required IT Required

CSET 4750 Computer Networks and Data Communications (4 semester credit hours) CSET Required IT Required CSET 4750 Computer Networks and Data Communications (4 semester credit hours) CSET Required IT Required Current Catalog Description: Computer network architectures and their application to industry needs.

More information

AQA GCSE in Computer Science Computer Science Microsoft IT Academy Mapping

AQA GCSE in Computer Science Computer Science Microsoft IT Academy Mapping AQA GCSE in Computer Science Computer Science Microsoft IT Academy Mapping 3.1.1 Constants, variables and data types Understand what is mean by terms data and information Be able to describe the difference

More information

01219211 Software Development Training Camp 1 (0-3) Prerequisite : 01204214 Program development skill enhancement camp, at least 48 person-hours.

01219211 Software Development Training Camp 1 (0-3) Prerequisite : 01204214 Program development skill enhancement camp, at least 48 person-hours. (International Program) 01219141 Object-Oriented Modeling and Programming 3 (3-0) Object concepts, object-oriented design and analysis, object-oriented analysis relating to developing conceptual models

More information

Please consult the Department of Engineering about the Computer Engineering Emphasis.

Please consult the Department of Engineering about the Computer Engineering Emphasis. COMPUTER SCIENCE Computer science is a dynamically growing discipline. ABOUT THE PROGRAM The Department of Computer Science is committed to providing students with a program that includes the basic fundamentals

More information

4.1 CD 301 - BSc (Hons) Information Technology (Diploma to Degree Upgrade 1.5 Years Part Time)

4.1 CD 301 - BSc (Hons) Information Technology (Diploma to Degree Upgrade 1.5 Years Part Time) 4.1 CD 301 - BSc (Hons) Information Technology (Diploma to Degree Upgrade 1.5 Years Part Time) 1. OBJECTIVES This Programme is geared towards producing computer professionals, with a thorough understanding

More information

Curriculum for the Bachelor Degree in Computer Science (CS)

Curriculum for the Bachelor Degree in Computer Science (CS) The curriculum for the B.Sc. degree in consists of (2) credit hours distributed as follows:- Course 2 4 Requirements University Requirements Compulsory Elective Faculty Requirements Specialization Requirements

More information

Computer Science. Computer Science 207. Degrees and Certificates Awarded. A.S. Computer Science Degree Requirements. Program Student Outcomes

Computer Science. Computer Science 207. Degrees and Certificates Awarded. A.S. Computer Science Degree Requirements. Program Student Outcomes Computer Science 207 Computer Science (See Computer Information Systems section for additional computer courses.) We are in the Computer Age. Virtually every occupation in the world today has an interface

More information

COURSE CATALOGUE 2013-2014

COURSE CATALOGUE 2013-2014 COURSE CATALOGUE 201-201 Field: COMPUTER SCIENCE Programme: Bachelor s Degree Programme in Computer Science (Informatics) Length of studies: years (6 semesters) Number of ECTS Credits: 180 +0 for the B.Sc.

More information

Program Introduction Course Curriculum Individual Course Descriptions Core Courses... 7

Program Introduction Course Curriculum Individual Course Descriptions Core Courses... 7 Contents Program Introduction... 3 Course Curriculum... 4 Individual Course s... 7 Core Courses... 7 BCS Specialization Courses Database Development... 14 BCS Specialization Courses Software Engineering...

More information

Masters in Human Computer Interaction

Masters in Human Computer Interaction Masters in Human Computer Interaction Programme Requirements Taught Element, and PG Diploma in Human Computer Interaction: 120 credits: IS5101 CS5001 CS5040 CS5041 CS5042 or CS5044 up to 30 credits from

More information

Course Outline. Kasun@sjp.ac.lk Faculty of Applied Sciences University of Sri Jayewardanepura. Information Technology

Course Outline. Kasun@sjp.ac.lk Faculty of Applied Sciences University of Sri Jayewardanepura. Information Technology Course Outline Kasun@sjp.ac.lk Faculty of Applied Sciences University of Sri Jayewardanepura Information Technology Objectives Outcomes Course outline Examination & Certificate Overview of a Computer System

More information

Master Degree in Computer Science and Networking

Master Degree in Computer Science and Networking Master Degree in Computer Science and Networking The two-year Master Degree (Laurea Magistrale) in Computer Science and Networking is a jointly Program offered by the University of Pisa Deparment of Computer

More information

School of Computer Science

School of Computer Science School of Computer Science Computer Science - Honours Level - 2014/15 October 2014 General degree students wishing to enter 3000- level modules and non- graduating students wishing to enter 3000- level

More information

Computer Science Course Descriptions Page 1

Computer Science Course Descriptions Page 1 CS 101 Intro to Computer Science An introduction to computer science concepts and the role of computers in society. Topics include the history of computing, computer hardware, operating systems, the Internet,

More information

Computer Science 1010 Introduction to Computers and the Internet (3) 1015 Web Structures I (1) 1016 Web Structures II (1)

Computer Science 1010 Introduction to Computers and the Internet (3) 1015 Web Structures I (1) 1016 Web Structures II (1) Computer Science 1010 Introduction to Computers and the Internet (3) Prerequisites: Same as for Math 1020 and Math 1030. Covers basic concepts and components of a PC, including microprocessor, disk, display,

More information

Progress Record. Seq. Lesson # Lesson Title Date Grade. Introduction to Computers (CORE COURSE) 1

Progress Record. Seq. Lesson # Lesson Title Date Grade. Introduction to Computers (CORE COURSE) 1 F-710 M-230 M-110 Progress Record Study your lessons in the order listed below. As graded examinations are returned to you, enter your grade in the space below. Set a schedule for yourself then watch your

More information

COMPUTER SCIENCE/ COMPUTER NETWORKING AND TECHNOLOGIES (COSC)

COMPUTER SCIENCE/ COMPUTER NETWORKING AND TECHNOLOGIES (COSC) COMPUTER SCIENCE/ COMPUTER NETWORKING AND TECHNOLOGIES (COSC) Computer Science (COSC) courses are offered by the School of Information Arts and Technologies within the Yale Gordon College of Liberal Arts.

More information

Masters in Information Technology

Masters in Information Technology Computer - Information Technology MSc & MPhil - 2015/6 - July 2015 Masters in Information Technology Programme Requirements Taught Element, and PG Diploma in Information Technology: 120 credits: IS5101

More information

Department of Computer Science

Department of Computer Science 113 Department of Computer Science Chairperson: Nasri, Ahmad H. Professor: Nasri, Ahmad H. Associate Professors: Attie, Paul C.; Karam, Marcel R.; Turkiyyah, George M. Assistant Professors: Abu Salem,

More information

Bachelor of Science in Information Technology. Course Descriptions

Bachelor of Science in Information Technology. Course Descriptions Bachelor of Science in Information Technology Course Descriptions Year 1 Course Title: Calculus I Course Code: MATH 101 Pre- Requisite(s): This course introduces higher mathematics by examining the fundamental

More information

Stage III courses COMPSCI 314

Stage III courses COMPSCI 314 Stage III courses To major in Computer Science, you have to take four Stage III COMPSCI courses, plus one other Stage III course chosen from the BSc Schedule. This may be another Stage III COMPSCI course.

More information

Computer and Information Sciences

Computer and Information Sciences Computer and Information Sciences Dr. John S. Eickmeyer, Chairperson Computers are no longer huge machines hidden away in protected rooms and accessible to only a few highly-trained individuals. Instead,

More information

COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM

COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM Course Code 2505100 Computing Fundamentals Pass/ Fail Prerequisite None This course includes an introduction to the use of the computer

More information

Department of Computer Science

Department of Computer Science The University of Texas at San Antonio 1 Department of Computer Science The Department of Computer Science offers a Bachelor of Science degree in Computer Science and a Minor in Computer Science. Admission

More information

Page 1 of 5. (Modules, Subjects) SENG DSYS PSYS KMS ADB INS IAT

Page 1 of 5. (Modules, Subjects) SENG DSYS PSYS KMS ADB INS IAT Page 1 of 5 A. Advanced Mathematics for CS A1. Line and surface integrals 2 2 A2. Scalar and vector potentials 2 2 A3. Orthogonal curvilinear coordinates 2 2 A4. Partial differential equations 2 2 4 A5.

More information

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical

More information

TEACHING AND EXAMINATION SCHEME FOR

TEACHING AND EXAMINATION SCHEME FOR TEACHING AND EXAMINATION SCHEME FOR BACHELOR IN COMPUTER APPLICATIONS III YEAR (2011) Paper Name (Theory) Lec Exam Hours Min Marks Max Marks BCA 19 E-Commerce 3 3 18 50 BCA 20 Computer Networks & Mobile

More information

Course Descriptions. preparation.

Course Descriptions. preparation. Course Descriptions CS 101 Intro to Computer Science An introduction to computer science concepts and the role of computers in society. Topics include the history of computing, computer hardware, operating

More information

Degrees Major in Computer Science Minor in Computer Science Major in Software Engineering

Degrees Major in Computer Science Minor in Computer Science Major in Software Engineering LT400, Independent Study: Directed reading registering. (U)(1). LT401, Independent Study: Directed reading registering. (U)(2). LT402, Independent Study: Directed reading registering. (U)(3). LT499, Honors

More information

Masters in Artificial Intelligence

Masters in Artificial Intelligence Masters in Artificial Intelligence Programme Requirements Taught Element, and PG Diploma in Artificial Intelligence: 120 credits: IS5101 CS5001 CS5010 CS5011 CS4402 or CS5012 in total, up to 30 credits

More information

Masters in Networks and Distributed Systems

Masters in Networks and Distributed Systems Masters in Networks and Distributed Systems Programme Requirements Taught Element, and PG Diploma in Networks and Distributed Systems: 120 credits: IS5101 CS5001 CS5021 CS4103 or CS5023 in total, up to

More information

An Overview of a Compiler

An Overview of a Compiler An Overview of a Compiler Department of Computer Science and Automation Indian Institute of Science Bangalore 560 012 NPTEL Course on Principles of Compiler Design Outline of the Lecture About the course

More information

STUDY PROGRAM: INFORMATION TECHNOLOGY

STUDY PROGRAM: INFORMATION TECHNOLOGY FACULTY OF COMPUTING STUDY PROGRAM: INFORMATION TECHNOLOGY CURRICULUM Introduction As an academic discipline, Information Technology focuses on preparing graduates who are concerned with issues related

More information

Masters in Computing and Information Technology

Masters in Computing and Information Technology Masters in Computing and Information Technology Programme Requirements Taught Element, and PG Diploma in Computing and Information Technology: 120 credits: IS5101 CS5001 or CS5002 CS5003 up to 30 credits

More information

ABET General Outcomes. Student Learning Outcomes for BS in Computing

ABET General Outcomes. Student Learning Outcomes for BS in Computing ABET General a. An ability to apply knowledge of computing and mathematics appropriate to the program s student outcomes and to the discipline b. An ability to analyze a problem, and identify and define

More information

Masters in Advanced Computer Science

Masters in Advanced Computer Science Masters in Advanced Computer Science Programme Requirements Taught Element, and PG Diploma in Advanced Computer Science: 120 credits: IS5101 CS5001 up to 30 credits from CS4100 - CS4450, subject to appropriate

More information

MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE

MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES Subarea Educational Computing and Technology Literacy Computer Systems, Data, and Algorithms Program Design and Verification Programming Language

More information

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) 305 REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) (See also General Regulations) Any publication based on work approved for a higher degree should contain a reference

More information

Table 1: Stage 1, Semester 1

Table 1: Stage 1, Semester 1 Module List Tables 1 to 4 list the modules of the programme Table 1: Stage 1, Semester 1 ELEK1101 Physical Computing 1 COMP1201 COMP1101 PC Hardware & Security 11 DTEC1101 Digital Age Technology 1 PROJ1101

More information

Doctor of Philosophy in Computer Science

Doctor of Philosophy in Computer Science Doctor of Philosophy in Computer Science Background/Rationale The program aims to develop computer scientists who are armed with methods, tools and techniques from both theoretical and systems aspects

More information

CTI Higher Certificate in Information Systems (Engineering)

CTI Higher Certificate in Information Systems (Engineering) CTI Higher Certificate in Information Systems (Engineering) Module Descriptions 2015 CTI is part of Pearson, the world s leading learning company. Pearson is the corporate owner, not a registered provider

More information

Summary. Pre requisition. Content Details: 1. Basics in C++

Summary. Pre requisition. Content Details: 1. Basics in C++ Summary C++ Language is one of the approaches to provide object-oriented functionality with C like syntax. C++ adds greater typing strength, scoping and other tools useful in object-oriented programming

More information

Computer Architecture Syllabus of Qualifying Examination

Computer Architecture Syllabus of Qualifying Examination Computer Architecture Syllabus of Qualifying Examination PhD in Engineering with a focus in Computer Science Reference course: CS 5200 Computer Architecture, College of EAS, UCCS Created by Prof. Xiaobo

More information

COMPUTER SCIENCE BIOLOGY. Lower Division

COMPUTER SCIENCE BIOLOGY. Lower Division Lower Division The Department of Computer and Electrical Engineering and Computer Science offers courses on topics of current interest to the community from time to time. Call the department office, (661)

More information

50 Computer Science MI-SG-FLD050-02

50 Computer Science MI-SG-FLD050-02 50 Computer Science MI-SG-FLD050-02 TABLE OF CONTENTS PART 1: General Information About the MTTC Program and Test Preparation OVERVIEW OF THE TESTING PROGRAM... 1-1 Contact Information Test Development

More information

Computer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices

Computer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices 232 Computer Science Computer Science (See Computer Information Systems section for additional computer courses.) We are in the Computer Age. Virtually every occupation in the world today has an interface

More information

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate

More information

Fundamental Computer Science Concepts Sequence TCSU CSCI SEQ A

Fundamental Computer Science Concepts Sequence TCSU CSCI SEQ A Fundamental Computer Science Concepts Sequence TCSU CSCI SEQ A A. Description Introduction to the discipline of computer science; covers the material traditionally found in courses that introduce problem

More information

RAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition

RAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition RAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition A Tutorial Approach James O. Hamblen Georgia Institute of Technology Michael D. Furman Georgia Institute of Technology KLUWER ACADEMIC PUBLISHERS Boston

More information

One LAR Course Credits: 3. Page 4

One LAR Course Credits: 3. Page 4 Course Descriptions Year 1 30 credits Course Title: Calculus I Course Code: COS 101 This course introduces higher mathematics by examining the fundamental principles of calculus-- functions, graphs, limits,

More information

138 To satisfy a prerequisite, the student must have earned a letter grade of A, B, C or CR in the prerequisite course, unless otherwise stated.

138 To satisfy a prerequisite, the student must have earned a letter grade of A, B, C or CR in the prerequisite course, unless otherwise stated. Computer Science and Information Systems: Information Technology - Networking CSIT 131 Word (1) (Formerly CSIS 127) Word word processing software. Prepares individuals who are seeking to become a Microsoft

More information

Core Syllabus. Version 2.6 C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS. June 2006

Core Syllabus. Version 2.6 C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS. June 2006 Core Syllabus C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS Version 2.6 June 2006 EUCIP CORE Version 2.6 Syllabus. The following is the Syllabus for EUCIP CORE Version 2.6, which

More information

B.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011

B.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011 NEW Detailed Syllabus of B.Sc.(Computer Science) and B.Sc.(IT) Effective From July 2011 SEMESTER SYSTEM Scheme & Syllabus for B.Sc. (CS) Pass and Hons. Course Effective from July 2011 and onwards CLASS

More information