# COMPUTER SCIENCE AND ECONOMETRICS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 COMPUTER SCIENCE AND ECONOMETRICS STUDIES OF FIRST DEGREE COURSE DIRECTORY Since 2013/2014 Algorithms and data structures... 2 Computer programming Computer programming Computer science in economics... 9 Databases Databases 1 project Databases Databases 2 project Descriptive and economic statistics Discrete mathematics Econometrics English English English English Financial and actuarial mathematics Informatics systems design Information technology Introduction to numerical methods Linear algebra Linear algebra Mathematica analysis Mathematica analysis mathematical statistics Mathematical statistics - laboratory Operations research Practical methods of statistics Probability theory Security of IT systems

2 A L G O R I T H M S A N D D A T A S T R U C T U R E S Course code: 11.3-WK-IiE-SP-ASD Type of course: optional Language of instruction: English/Polish Director of studies: dr Florian Fabiś Name of lecturer: dr Florian Fabiś, mgr Katarzyna Jesse-Józefczyk Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Lecture 30 2 Exam V Laboratory 30 2 Grade 5 COURSE AIM: The knowledge and skills in basics of analysis of algorithms. The knowledge of and ability to implement sorting and selection algorithms, searching algorithms and elementary graph algorithms. The knowledge of NP-completeness problem and its practical aspects. ENTRY REQUIREMENTS: Gaining of basic competences in analysis and linear algebra. Advanced computer operating skills. Skills in computer structured programming. COURSE CONTENTS: Lecture 1. Algorithms. Computational complexity of algorithms. Correctness of algorithms. Asymptotics. (4 h) 2. Techniques of constructing effective algorithms: divide and conquer, greedy methods, dynamic programming. (2 h) 3. Algorithms of sorting and searching. (4 h) 4. Data structures for dictionaries: characteristic vector, binary search trees, hashing. External searching - B-trees. The union problem for disjoint sets and its applications. (6 h) 5. Graph algorithms: computer representations of graphs, graph searching, minimum spanning trees, shortest paths in graphs, flows in networks. (4 h) 6. Text algorithms: pattern matching, suffix trees. (4 h) 7. Computational geometry: point localization, convex hull, sweeping. (4 h) 8. NP-completeness: the classes P, NP and NP-complete. 2

3 Laboratory 1. Determination of the computational complexity of algorithms. (4 h) 2. Testing of the correctness of algorithms. (4 h) 3. Algorithms of sorting and searching. (4 h) 4. Data structures for dictionaries. (6 h) 5. Graph algorithms. (6 h) 6. Text and computational geometry algorithms. (6 h) TEACHING METHODS: Lecture: problem lecture. Laboratory: laboratory exercises in computer lab implementation and testing of selected algorithms. Each student is supposed to realize four projects during the semester. Each project will consist in implementation of the selected algorithm to solve a concrete practical task, writing a program for it, testing it and presenting a documentation in accordance with the assigned specification. On two out of the four projects the students will work in 2-3 person groups. Furthermore the students will write on classes programs implementing other algorithms. LEARNING OUTCOMES: Student knows and understands basic concepts and mathematical description used in the analysis of algorithms. [K_W08+++] Student is able to design and analyze algorithm according to specification assigned [K_U26++]. Student knows the basic data structures for dictionaries and can implement them in programs. [K_W08++] Student knows the basic sorting, searching, graph, text and computational geometry algorithms and can implement them in programs. [K_U26++, K_W08++] Student recognizes the problems that can be solved algorithmically and can make a problem specification. [K_U25++]. Student is able to work in project team. [K_K03++] LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture. Written examination verifying the education outcome in area of knowledge and skills. Laboratory. Final grade is granted based on number of points received during studies. Points are received for written tests, active participation in classes and completed project. Final course grade consists of laboratory classes grade (50%) and examination grade (50%). Positive grade from laboratory classes is the necessary condition for participation in examination. The positive grade from examination is the necessary condition for course completion. STUDENT WORKLOAD: Contact hours - Participation in lectures: 15*2 h = 30 h - Participation in laboratory studies : 15*2 h = 30 h - Consultations: = 8 h - Participation in the exam:1*2 h = 2 h Total: 70 h (3 ECTS) Independent work - Preparation for laboratory exercises: 15*1 h = 15 h - Finishing in house exercise laboratory: 15*1 h = 15 h - Exam preparation: 20 h Total: 50 h ( 2 ECTS) Total for the course: 120 h (5 ECTS) 3

4 RECOMMENDED READING: 1. Aho A., Hopcroft J.E., Ullman J.D., : Projektowanie i analiza algorytmów komputerowych, PWN, Warszawa Banachowski L., Diks K., Rytter W., Algorytmy i struktury danych, WNT, W-wa Cormen T.H., Leiserson C.E., Rivest R.L., Wprowadzenie do algorytmów, WNT, Warszawa OPTIONAL READING: 1. Aho A., Hopcroft J.E., Ullman J.D., : The Design and Analysis of Computer Algorithms. 2. Aho A., Hopcroft J.E., Ullman J.D., : Data structures and algorithms 3. T.H. Cormen, Ch.E. Leiserson, R.L. Rivest: Introduction to Algorithms, 2001, MIT Press. 4. Knuth D. E.. : The Art of Computer Programming. 5. N. Wirth: Algorithms and Data Structured, Błażewicz J. : Złożoność obliczeniowa problemów kombinatorycznych, WNT, Warszawa P. Wróblewski: Algorytmy, struktury danych i techniki programowania, wyd. II popr., Helion,

5 C O M P U T E R P R O G R A M M I N G 11 Course code: 11.3-WK-IiE-SP-PK1 Type of course: compulsory Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: dr Florian Fabiś, dr inż. Mariusz Hałuszczak mgr Katarzyna Jesse-Józefczyk Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Lecture 60 2 Exam I Laboratory 60 2 Grade 6 COURSE AIM: This course aims to teach how to write simple computer programs, using basic commands and data structures, in accordance with the principles of structured programming. One of the important objectives is to introduce students to simple sorting algorithms. ENTRY REQUIREMENTS: COURSE CONTENTS: Lecture: 1. Structured programming paradigm and a structure of the program. 2. Idea of subprograms and modules. 3. Rules of creating identifiers. 4. Primitive types: integer, real, logical, character, and string. 5. Declaration of variables. Assignment statements. Input-output instructions. 6. Defining new data types: enumerations, subranges, and structured data types. 7. Procedures and functions: definitions, local and global variables, parameterpassing mechanisms. 8. Loops and conditional statements. Static and dynamic arrays. 9. Sorting and selection algorithms. Strings processing. 10. Text files and binary files. 11. Properties of algorithms. Computational complexity of algorithms. Laboratory: 1. Acquainting students with the development environment. Writing and running: simple programs with: assignment and input-output instructions, conditional statements, and loops. 2. Using functions and procedures. Processing of one-dimensional and twodimensional arrays (static and dynamic). Writing programs using records and arrays of records. 5

6 3. Writing programs with algorithms for sorting and selection. Operations on strings. 4. Debugging: tracking step by step instructions of the program and viewing the value of variables. TEACHING METHODS: Lecture: Seminar lecture. Laboratory: Computer laboratory exercises - writing and running programs, independently written by the student, and their analysis. LEARNING OUTCOMES: K_W05 K_W05 K_W05 K_U20 K_U25 K_U25 K_U26 K_U20 K_U01 Students understand the basic concepts related to procedural programming. Students know how to define and use simple data types. Students know the basic structures of the selected programming language. Students know the elements of the block-diagram description of the algorithm. Students know how to write a program containing basic language structures, compile and run it. Students can independently write a program containing basic programming language constructs, compile and run it. Students can apply basic programming language constructs selected for the solutions of typical tasks. Students are able to determine the complexity of simple algorithms. Students are able to interpret and analyze a sample program source codes. LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture: The exam consists of two parts: written and oral. 50% of points of the written part guarantees passing the exam. Students who obtain less than 50% but at least 30% of the points of the written part, must pass the oral part of the exam. Laboratory: To pass students must obtain at least 50% of points from four tests written during the semester or 50% of points from one test covering the whole material. Course degree is an arithmetic average of the exam degree and lab degree. However, a necessary condition for a positive final evaluation is to obtain a positive evaluation of the exam and the laboratory. STUDENT WORKLOAD: Contact Hours: 80 hours. - Participation in lectures: 15 * 2 hours = 30 hours. - Participation in laboratory classes: 15 * 2 hours = 30 hours. - Participation in consultations: 8 hours to lecture + 8 hours the lab = 16 hours. - Participation in the exam: 1 * 4hours = 4 hours. Working alone: 80 hours. - Preparation for laboratory classes: 15 * 3 hours = 45 hours. - Systematic repetition of the material: 5 * 3 hours = 15 hours. - Preparation for the exam: 20 hours. Total: 160 hours. (6 ECTS) RECOMMENDED READING: 1. L. Banachowski, K. Diks, W. Rytter : Algorytmy i struktury danych, WNT, W-wa K. Koleśnik: Wstęp do programowania z przykładami w Turbo Pascalu, Helion, W. Kwasowiec: Wprowadzenie do Object Pascal i Delphi, MIKOM, Sielicki (pod red.): Laboratorium programowania w języku Pascal, Pol. Wr., Wrocław N. Wirth, Algorithms and Data Structures, OPTIONAL READING: 1. T.H. Cormen, Ch.E. Leiserson, R.L. Rivest: Wprowadzenie do algorytmów, WNT, M. Szmit: Delphi, Helion, P. Wróblewski: Algorytmy, struktury danych i techniki programowania, wyd. II popr., Helion,

7 C O M P U T E R P R O G R A M M I N G 22 Course code: 11.3-WK-IiE-SP-PK2 Type of course: compulsory Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: dr Florian Fabiś, dr inż. Mariusz Hałuszczak mgr Katarzyna Jesse-Józefczyk Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Lecture 60 2 Exam II Laboratory 60 2 Grade 6 COURSE AIM: This course aims to teach how to write programs with complex data structures. This includes implementing programs that use sorting and selection algorithms. The course also aims to acknowledge students with the basic concepts of object-oriented programming and the problem of NP-completeness (classes P, NP, NP-complete). ENTRY REQUIREMENTS: Computer programming 1. COURSE CONTENTS: Lecture: 1. Dynamic variables: definitions, procedures for creating and deleting dynamic variables. 2. Operations defined on the type of indicator elements, lists, stacks, queues, trees and graphs. 3. Computational complexity classes of decision problems: P, NP, NP-complete. 4. The basic idea of object-oriented programming (object, method, inheritance, encapsulation, polymorphism). Laboratory: 1. Writing a program that uses files. 2. Writing and running programs with sorting and selection algorithms. 3. The analysis of computational and memory complexity of algorithms. 4. Using simple dynamic and complex dynamic data structures representing: stacks, queues, lists. 5. Creating simple classes and writing simple programs that use them. 7

8 TEACHING METHODS: Lecture: Seminar lecture. Laboratory: Computer laboratory exercises - writing and running independently written programs and the analysis of these programs. LEARNING OUTCOMES: K_W10 K_W10 K_W05 K_U20 K_W10 K_U20 K_U25 Students know how to define and use complex data structures. Students know how to solve a task using complex structures of the selected programming language. Students know the basic sorting algorithms and can specify their complexity. Students can perform basic operations on dynamic structures. Students know the basic concepts associated with the object-oriented programming. Students can present algorithms via diagrams Students can create the class diagram K_U28 Students are able to model a fragment of reality by defining and using complex data structures. K_U25 Students are able to use complex constructs of programming language to solve problems. K_U28 Students can define and use a simple class. LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture: The exam consists of two parts: written and oral. 50% of points of the written part guarantees passing the exam. Students who obtain less than 50% but at least 30% of the points of the written part, must pass the oral part of the exam. Laboratory: To pass students must obtain at least 50% of points from four tests written during the semester or 50% of points from one test covering the whole material. Course degree is an arithmetic average of the exam degree and lab degree. However, a necessary condition for a positive final evaluation is to obtain a positive evaluation of the exam and the laboratory. STUDENT WORKLOAD: Contact Hours: 75 hours. - Participation in lectures: 15 * 2 hours = 30 hours. - Participation in laboratory classes: 15 * 2 hours = 30 hours. - Participation in consultations: 5 hours to lecture + 6 hours the lab = 11 hours. - Participation in the exam: 1 * 4hours = 4 hours. Working alone: 65 hours. - Preparation for laboratory classes: 15 * 2 hours = 30 hours. - Systematic repetition of material: 5 * 3 hours = 15 hours. - Preparation for the exam: 20 hours. Total for course: 140 hours. (6 ECTS) RECOMMENDED READING: 1. L. Banachowski, K. Diks, W. Rytter: Algorytmy i struktury danych, WNT, N. Wirth, Algorithms and Data Structures, W. Kwasowiec: Wprowadzenie do Object Pascal i Delhi, Mikom, Sielicki (pod red.) : Laboratorium programowania w języku Pascal, Wrocław P. Coad, E. Yourdon: Analiza obiektowa, ReadMe, Warszawa OPTIONAL READING: 1. T.H. Cormen, Ch.E. Leiserson, R.L. Rivest: Wprowadzenie do algorytmów, WNT, M. Szmit: Delhi, Helion, P. Wróblewski: Algorytmy, struktury danych i techniki programowania, Helion, G. Booch, J. Rumbaugh, I. Jacobson, UML: przewodnik użytkownika, WNT,

9 C O M P U T E R S C I E N C E I N E C O N O M I C S Course code: 11.9-WK-IiE-SP-IE Type of course: compulsory Language of instruction: English/Polish Director of studies: dr hab. inż. Silva Robak, prof. UZ Name of lecturer: dr hab. inż. Silva Robak, prof. UZ Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Lecture 30 2 VI Full-tim e studies Grade 2 COURSE AIM: Introduction to the information systems basics their classification, technological infrastructure, life cycle and also support of the strategic aims of the organization, especially in the competitive environment of e-economy. ENTRY REQUIREMENTS: Basic knowledge of the information technology and software systems development. COURSE CONTENTS: 1. Information systems in the enterprise scope, functions, and classifications: technical and business view. Main business functions: sales and marketing, manufacturing, finances and accounting, and human resources. 2. Information systems as a tool supporting the organization; digital firm; business processes. 3. Technological infrastructure of information systems. Components and IT structure levels; trends and technologies driving the IT infrastructure evolution. 4. Computer networks; Internet. Web 2.0; contemporary platforms. 5. The digital firm electronic business and electronic commerce. New business models and value propositions. 6. Managing data resources. Organizing data - traditional file environment, the database approach to data management; database trends: multidimensional data analysis, data warehouses and data mining. 7. Managing knowledge in the digital firm. Knowledge work systems. 8. Decision making in the digital firm. Decision-making and decision-support systems; types of decision-support systems. Intelligent technologies. 9. Redesigning the information systems and the organization. Business process reengineering and improvement. Business process integration; CRM and SCM systems. Application software packages. 10. Information systems for the cooperating enterprises; value chains. 11. Information systems security and control. System vulnerability and abuse. Establishing a framework for security and control for information systems. Technologies and tools for security and control. 9

10 12. Building information systems. Establishing the organizational information requirements, system development, design and implementation. Alternative system building approaches. 13. Business value of information systems. TEACHING METHODS: Traditional lecture. LEARNING OUTCOMES: The student: 1. Knows and understands the classification principles and types of information systems, their main functions (K_W09); uses the notion of the business process (K_U24). 2. Knows and understands the information systems technological infrastructure (K_W05, K_W12, K_K01) 3. Knows and understands the principles of managing data resources, data security and control issues, and also knowledge management in the organisation (K_W02). 4. Knows and understands the role of information systems in the competitive business environment of e-economy (K_W01). 5. Knows and understands the basic principles of development, implementation and reengineering of information systems (K_W09, K_W10, K_U20) and the associated organizational change (K_W07, K_U22). 6. Knows how to define the information systems needs for systems supporting the strategic aims of the organization, how to choose software for the needs of the organization (K_U21, K_K01, K_K07). LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Final review quiz (graded with points), with comprehension questions at the end of the term - the scoring allows estimating if the student has reached the outlined aims. STUDENT WORKLOAD: Contact hours: Lecture 30h. Consultations -1h. Own work: Preparing for the lecture 2h. Preparing for the test 17h. Together for the whole item: 50h. (2 ECTS) RECOMMENDED READING: 1. A. Januszewski, Funkcjonalność systemów informacyjnych zarządzania, Tom I i II. PWN, Warszawa, W. Flakiewicz, Systemy informacyjne w zarządzaniu. Uwarunkowania, technologie, rodzaje, C.H. Beck, Warszawa, P. Adamczewski, Zintegrowane systemy informatyczne w praktyce, Wyd. II. Mikom, Warszawa, OPTIONAL READING: 1. K.C. Laudon, J P. Laudon, Management Information Systems. Managing the Digital Firm. Pearson Prentice Hall, New Jersey, ninth edition, A. Michalski (red.), Zarządzanie informacjami w przedsiębiorstwie. Systemy informatyczne a reinżynieria organizacji, Politechnika Śląska, Gliwice, A. Nowicki, J. Unold (red.), Organizacyjne aspekty doskonalenia systemów informacyjno decyzyjnych zarządzania, AE, Wrocław, A. Rokicka-Broniatowska (red.), Wstęp do informatyki gospodarczej, SGH, Warszawa, S. Wrycza, B. Marcinkowski, K. Wyrzykowski, Analiza i projektowanie systemów informatycznych zarządzania. Metodyki, techniki, narzędzia, PWN, Warszawa,

11 D A T A B A S E S 11 Course code: 11.3-WK-IiE-SP-BD1 Type of course: compulsory Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: prof. dr hab. Mieczysław Borowiecki, dr Anna Fiedorowicz, dr inż. Mariusz Hałuszczak Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Lecture 30 2 Exam III Laboratory 20 2 Grade 4 COURSE AIM: The course introduces basic notions, definitions and problems related to the relational models of databases. At the end of the course each student should be able to design and create both database and database application. ENTRY REQUIREMENTS: Fundamentals of logic. Programming skills. COURSE CONTENTS: Lecture: 1. The basic notions and definitions related to the relational databases. 2. Operations on relation (union, difference, intersection, complement, projection, selection, join, division). 3. The functional dependencies and Armstrong s axioms. 4. Relational schemes. 5. Decompositions. 6. Normalization through decomposition (1NF, 2NF, 3NF,B-CNF, 4NF). 7. Multivalued dependencies. 8. Inference axiom for multivalued dependencies. 9. Structured Query Language. a. Data Manipulation Language, b. Data Definition Language, c. Data Control Language. 11

12 10. Creating the project of a database. d. Data-Flow Diagram, e. Entity-Relationship Diagrams, f. Creating Database Scheme. Laboratory: 1. The use of SQL. 2. Data types, expressions and operators, conditions, functions, procedures. 3. SELECT statement: a. inner join, b. outer join, c. simple subqueries, d. correlated subqueries, e. grouping and aggregate functions. 4. Defining the database structure: a. domain, b. tables, c. views, d. indexes, e. sequences/generators, f. triggers, g. referential integrity constraints. 5. Database user management and control of transactions. TEACHING METHODS: Lecture: Seminar lecture. Laboratory: Computer laboratory exercises LEARNING OUTCOMES: K_W08 K_W05 K_W08 K_U29 K_U26 K_U23, K_U30 K_U35 Students understand the basic concepts and knows the theoretical basis of relational databases. Students know the basic syntax of SQL commands. Students know the method of normalization of a scheme up to 2NF, 3NF and BCNF. Students are able normalize a scheme up to 2NF, 3NF and BCNF. Students are able to extract the information stored in the database using SQL commands, using joins, subqueries and grouping. Students are able to design a simple database schema and generate it using computer tools like CASE. Students are able to present the basic concepts and theorems related to the relational data model. LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture: The exam consists of two parts, written and oral, access to the oral part is getting 30% of the points of the written part, 50% of the points from the written part guarantees a positive evaluation. Laboratory: condition pass is 50% of the points of the four planned tests or final test covering all the material processed. Final evaluation of the course is the arithmetic mean of the lecture and laboratory. However, a prerequisite for a positive final assessment is to obtain positive evaluations of the lecture and laboratory. 12

13 STUDENT WORKLOAD: Contact time with the teacher: Participation in lectures - 30 hours. Participation in the lab - 30 hours. Participation in consultations - 8 hours. Examination - 4 hours. total: 72 hours. Standalone student work: Preparation for the lecture - 9 hours. Preparation for the lab - 21 hours. Preparation for the exam - 20 hours. total: 50 hours. Total for the course: 122 hours. (4 ECTS) RECOMMENDED READING: 1. T. Pankowski, Podstawy baz danych, Wydawnictwo Naukowe PWN, W-wa, D. Maier, The theory of relational databases, Computer Science Press, M. Gruber, SQL, Helion, M. Wybrańczyk, Delphi 7 i bazy danych, Helion, G.Reese, Java. Aplikacje bazodanowe. Najlepsze rozwiązania, Helion, OPTIONAL READING: 1. W. Kim, Wprowadzenie do obiektowych baz danych, WNT, Warszawa, J.D. Ullman, Podstawowy wykład z systemów baz danych, WNT, Warszawa, P. Neil Gawroński, InterBase dla,,delfinów'', Helion, Jakubowski: SQL w InterBase dla Windows i Linuksa, Helion, Gliwice R. Barker, CASE* Method. Modelowanie związków encji, WNT, Warszawa M. Marzec, JBuilder i bazy danych, Helion, Mościcki, I. Kruk, Oracle 10g i Delphi. Programowanie baz danych, Helion,

14 D A T A B A S E S 11 P R O JJ E C T Course code: 11.3-WK-IiE-SP-BDP1 Type of course: compulsory Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: dr Anna Fiedorowicz, dr inż. Mariusz Hałuszczak Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Project 15 1 IV Grade 3 COURSE AIM: Students design a relational database modelling and create applications for its use. ENTRY REQUIREMENTS: Database 1. Programming skills. COURSE CONTENTS: Students create a system on a selected topic. Students implement and document the process of creating an information system. The final effect will be a working system, working in a client-server architecture, and documentation. During the course, students shall analyse the present area, do conceptual data model, SQL script, creating database structure, if it is necessary then create a description of the system using the selected UML diagrams (class, use case, state, activity, implementation), create an application to operate on this database. Projects are done individually or in groups. TEACHING METHODS: Practical LEARNING OUTCOMES: K_W03 K_W05, K_W10 K_U23, K_U30 Students have the theoretical knowledge to design average complex database. Students know how to create an application that supports the database. According to a given specification, students are able to analyze, design and implement a simple database system using properly selected methods, techniques and tools. K_U26 K_U30 K_K05 K_K08 Students can create an application that supports the database. Students can create technical documentation of the project. Students understands necessity of systematic work on the project. Students are able to expand their knowledge, which is necessary to realize the project 14

15 LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Total score: 40% for the project database, 40% of the created program, 20% of the documentation. STUDENT WORKLOAD: Contact time with the teacher: Participation in consultations - 15 hours. Participation in project lessons - 15 hours. Total: 30 hours. Standalone student work: 60 hours. Total for all items: 90 hours. (3 ECTS) RECOMMENDED READING: 1. M. Wybrańczyk, Delphi 7 i bazy danych, Helion, M. Marzec, JBuilder i bazy danych, Helion, G.Reese, Java. Aplikacje bazodanowe. Najlepsze rozwiązania, Helion, Mościcki, I. Kruk, Oracle 10g i Delphi. Programowanie baz danych, Helion, M. Cantù, Mastering Delphi 6, Sybex Inc.,2001 OPTIONAL READING: 1. P. Neil Gawroński, InterBase dla,,delfinów'', Helion, Jakubowski: SQL w InterBase dla Windows i Linuksa, Helion, Gliwice R. Barker, CASE Method - Entity Relationships Modelling, Oracle Corporation UK Limited, Addison-Wesley Publishing Company,

16 D A T A B A S E S 22 Course code: 11.3-WK-IiE-SP-BD2 Type of course: optional Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: dr inż. Mariusz Hałuszczak Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Lecture 30 2 Exam IV, VI Laboratory 30 2 Grade 5 COURSE AIM: Familiarize students with the ORACLE database and PL/SQL. At the end of the course students should be able to independently design and develop dynamic website using database. ENTRY REQUIREMENTS: Programming skills. Basic knowledge of relational databases and SQL, and HTML. COURSE CONTENTS: Lecture: 1. PL/SQL 2. PHP Structure of programme, variables, data types, expressions, comparisons and control structures. Using collections and records. Performing SQL operations from PL/SQL. Procedures, functions, packages in PL/SQL. Handling PL/SQL errors. Dynamic PL/SQL. Operations on text and numbers. Creating interactive forms. Communication with databases. Sessions and cookies. File operations. 3. Object-oriented databases and XML i. Structure of the XML document. ii. DTD and XML-Schema. iii. XSLT. 16

17 4. JavaScript Syntax, Classes, objects, JSON format, AJAX and XML support, Examples of frameworks. Laboratory: 1. SQL in Oracle. 2. Tree structures in Oracle databases. 3. PL/SQL, create stored procedures, functions, triggers, and packages. 4. Views describes schema objects in the database. 5. Transforming XML data with XSLT and JavaScript. TEACHING METHODS: Lecture: Seminar lecture. Laboratory: Computer laboratory exercises. LEARNING OUTCOMES: K_W05 K_U26 K_U26 K_K008 Students know the syntax of SQL commands and PL/SQL. Students are able to extract and present data that are stored in XML format. Students can collect and extract the information stored in databases with web applications. Students can search for relevant information. LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Lecture: The exam consists of two parts, written and oral, access to the oral part is getting 30% of the points of the written part, 50% of the points from the written part guarantees a positive evaluation. Laboratory: condition pass is 50% of the points of the four planned tests or final test covering all the material processed, for the preparation of the talk, you can get up to an additional 20%.. Final evaluation of the course is the arithmetic mean of the lecture and laboratory. However, a prerequisite for a positive final assessment is to obtain positive evaluations of the lecture and laboratory. STUDENT WORKLOAD: Contact time with the teacher: Participation in lectures - 30 hours. Participation in the lab - 30 hours. Participation in consultations - 18 hours. Examination - 4 hours. Total: 82 hours. Standalone student work: The systematic repetition of material - 18 hours. Preparation for the lab - 30 hours. Preparation for the Exam - 20 hours. Total: 68 hours. Total for the course: 150 hours. (5 ECTS) RECOMMENDED READING: 1. D. Maier, The theory of relational databases, Computer Science Press, E. Balanescu, M. Bucica, Cristian Darie, PHP 5 i MySQL. Zastosowania e-commerce, Helion, J. Clark, XSL Transformations (XSLT), 17

18 4. L. Quin, Extensible Markup Language (XML), 5. T. Converse, J. Park, C. Morgan, PHP5 i MySQL. Biblia, Helion, S. Urman, R. Hardman, M. McLaughlin, Oracle Database 10g. Programowanie w języku PL/SQL, Helion, OPTIONAL READING: 1. E. Naramore, J. Gerner, Y. Le Scouarnec, J. Stolz, M.K. Glass, PHP5, Apache i MySQL. Od podstaw, Helion, B. Basham, K. Sierra, B. Bates, Head First Servlets & JSP, Helion, W. Kim, Wprowadzenie do obiektowych baz danych, WNT, Warszawa,

19 D A T A B A S E S 22 P R O JJ E C T Course code: 11.3-WK-IiE-SP-BDP2 Type of course: optional Language of instruction: English/Polish Director of studies: dr inż. Mariusz Hałuszczak Name of lecturer: dr inż. Mariusz Hałuszczak Form of instruction per s e m es ter per w ee k Se m es ter Form of receiving a credit for a course ECT S cr edi ts al lo ca te d Full-tim e studies Project 30 2 V Grade 4 COURSE AIM: Students design a relational database model and create WEB applications for its use. ENTRY REQUIREMENTS: Databases 2. Programming skills. COURSE CONTENTS: Students create a system on a selected topic. Students implement and document the process of creating an information system. The final effect will be a working WEB application, working in a client-server architecture, and documentation. During the course, students shall analyze the present area, do conceptual data model, SQL script, creating database structure, if it is necessary then create a description of the system using the selected UML diagrams (class, use case, state, activity, implementation), create an application to operate on this database. Projects are done individually or in groups. TEACHING METHODS: Practical LEARNING OUTCOMES: K_W03 K_W05 K_U23 K_K03 Students have the theoretical knowledge to design average-complex database. Students know how to create a WEB application that supports the database. Students can, in accordance with specifications, analyze, design and implement a simple database system using properly selected methods, techniques and tools. Students can create technical documentation of the project. Students understand the need for systematic work on the project. 19

20 LEARNING OUTCOMES VERIFICATION AND ASSESSMENT CRITERIA: Total score: 40% for the project database, 40% of the created program, 20% of the documentation. STUDENT WORKLOAD: Contact time with the teacher: Participation in project lessons - 30 hours. Participation in consultations - 15 hours. Total: 45 hours. Standalone student work: 60 hours. Total for all items: 105 hours. (4 ECTS) RECOMMENDED READING: 1. E. Balanescu, M. Bucica, Cristian Darie, PHP 5 i MySQL. Zastosowania e-commerce, Helion, J. Clark, XSL Transformations (XSLT), 3. L. Quin, Extensible Markup Language (XML), 4. T. Converse, J. Park, C. Morgan, PHP5 i MySQL. Biblia, Helion, S. Urman, R. Hardman, M. McLaughlin, Oracle Database 10g. Programowanie w języku PL/SQL, Helion, E. Naramore, J. Gerner, Y. Le Scouarnec, J. Stolz, M.K. Glass, PHP5, Apache i MySQL. Od podstaw, Helion, OPTIONAL READING: 1. Bryan Basham, Kathy Sierra, Bert Bates, Head First Servlets & JSP. Helion, Wojciech Romowicz, Java Server Pages oraz inne komponenty JavaPlatform, Helion,

### DATA ENGINEERING STUDIES OF FIRST DEGREE COURSE DIRECTORY. Since 2013/2014

DATA ENGINEERING STUDIES OF FIRST DEGREE COURSE DIRECTORY Since 2013/2014 Algorithms and data structures 1... 2 Algorithms and data structures 2... 4 Combinatorial foundations of computer science... 6

### Z-ZIP2-0543. Ekonometria i prognozowanie. Econometrics and Forecasting

MODULE DESCRIPTION Module code Z-ZIP2-0543 Module name Ekonometria i prognozowanie Module name in English Econometrics and Forecasting Valid from academic year 2016/2017 A. MODULE PLACEMENT IN THE SYLLABUS

### COMPUTER SCIENCE AND ECONOMETRICS

COMPUTER SCIENCE AND ECONOMETRICS STUDIES OF SECOND DEGREE COURSE DIRECTORY Since 2013/2014 Actuarial methods... 2 Algorithmic methods... 4 Computer networks... 6 Data warehouse... 8 Decision analysia

### Business Statistics. Successful completion of Introductory and/or Intermediate Algebra courses is recommended before taking Business Statistics.

Business Course Text Bowerman, Bruce L., Richard T. O'Connell, J. B. Orris, and Dawn C. Porter. Essentials of Business, 2nd edition, McGraw-Hill/Irwin, 2008, ISBN: 978-0-07-331988-9. Required Computing

### Course Text. Required Computing Software. Course Description. Course Objectives. StraighterLine. Business Statistics

Course Text Business Statistics Lind, Douglas A., Marchal, William A. and Samuel A. Wathen. Basic Statistics for Business and Economics, 7th edition, McGraw-Hill/Irwin, 2010, ISBN: 9780077384470 [This

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

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

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

### Teaching model: C1 a. General background: 50% b. Theory-into-practice/developmental 50% knowledge-building: c. Guided academic activities:

1. COURSE DESCRIPTION Degree: Double Degree: Derecho y Finanzas y Contabilidad (English teaching) Course: STATISTICAL AND ECONOMETRIC METHODS FOR FINANCE (Métodos Estadísticos y Econométricos en Finanzas

### 4. Factor polynomials over complex numbers, describe geometrically, and apply to real-world situations. 5. Determine and apply relationships among syn

I The Real and Complex Number Systems 1. Identify subsets of complex numbers, and compare their structural characteristics. 2. Compare and contrast the properties of real numbers with the properties of

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

### Curriculum Map Statistics and Probability Honors (348) Saugus High School Saugus Public Schools 2009-2010

Curriculum Map Statistics and Probability Honors (348) Saugus High School Saugus Public Schools 2009-2010 Week 1 Week 2 14.0 Students organize and describe distributions of data by using a number of different

### International College of Economics and Finance Syllabus Probability Theory and Introductory Statistics

International College of Economics and Finance Syllabus Probability Theory and Introductory Statistics Lecturer: Mikhail Zhitlukhin. 1. Course description Probability Theory and Introductory Statistics

### Diablo Valley College Catalog 2014-2015

Mathematics MATH Michael Norris, Interim Dean Math and Computer Science Division Math Building, Room 267 Possible career opportunities Mathematicians work in a variety of fields, among them statistics,

### Distance Learning and Examining Systems

Lodz University of Technology Distance Learning and Examining Systems - Theory and Applications edited by Sławomir Wiak Konrad Szumigaj HUMAN CAPITAL - THE BEST INVESTMENT The project is part-financed

### The Big 50 Revision Guidelines for S1

The Big 50 Revision Guidelines for S1 If you can understand all of these you ll do very well 1. Know what is meant by a statistical model and the Modelling cycle of continuous refinement 2. Understand

### Description of the program

Study program Faculty Cycle Business Informatics Contemporary Sciences and Technologies Undergraduate ECTS 180 Offered in Tetovo and Skopje Description of the program The three-year curricula (Bachelor

### Official SAS Curriculum Courses

Certificate course in Predictive Business Analytics Official SAS Curriculum Courses SAS Programming Base SAS An overview of SAS foundation Working with SAS program syntax Examining SAS data sets Accessing

### Q4. What are data model? Explain the different data model with examples. Q8. Differentiate physical and logical data independence data models.

FAQs Introduction to Database Systems and Design Module 1: Introduction Data, Database, DBMS, DBA Q2. What is a catalogue? Explain the use of it in DBMS. Q3. Differentiate File System approach and Database

### IT2305 Database Systems I (Compulsory)

Database Systems I (Compulsory) INTRODUCTION This is one of the 4 modules designed for Semester 2 of Bachelor of Information Technology Degree program. CREDITS: 04 LEARNING OUTCOMES On completion of this

### Course Syllabus For Operations Management. Management Information Systems

For Operations Management and Management Information Systems Department School Year First Year First Year First Year Second year Second year Second year Third year Third year Third year Third year Third

### 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/

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

### COURSE GUIDE. Management. Piotr Tomski, Ph.D. General academic. Elementary LACTURE CLASSES LABORATORY PROJECT SEMINAR

COURSE GUIDE Course unit tilte Field of study Form of study Level of study Year Semester Responsible unit Responsible person Profile Type of course MACROECONOMICS Management Full-time nd I I Department

### Universitatea de Medicină şi Farmacie Grigore T. Popa Iaşi Comisia pentru asigurarea calităţii DISCIPLINE RECORD/ COURSE / SEMINAR DESCRIPTION

Universitatea de Medicină şi Farmacie Grigore T. Popa Iaşi Comisia pentru asigurarea calităţii DISCIPLINE RECORD/ COURSE / SEMINAR DESCRIPTION 1. Information about the program 1.1. UNIVERSITY: GRIGORE

### business statistics using Excel OXFORD UNIVERSITY PRESS Glyn Davis & Branko Pecar

business statistics using Excel Glyn Davis & Branko Pecar OXFORD UNIVERSITY PRESS Detailed contents Introduction to Microsoft Excel 2003 Overview Learning Objectives 1.1 Introduction to Microsoft Excel

### STAT 360 Probability and Statistics. Fall 2012

STAT 360 Probability and Statistics Fall 2012 1) General information: Crosslisted course offered as STAT 360, MATH 360 Semester: Fall 2012, Aug 20--Dec 07 Course name: Probability and Statistics Number

### Learning outcomes. Knowledge and understanding. Competence and skills

Syllabus Master s Programme in Statistics and Data Mining 120 ECTS Credits Aim The rapid growth of databases provides scientists and business people with vast new resources. This programme meets the challenges

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

EC151.02 Statistics for Business and Economics (MWF 8:00-8:50) Instructor: Chiu Yu Ko Office: 462D, 21 Campenalla Way Phone: 2-6093 Email: kocb@bc.edu Office Hours: by appointment Description This course

### Java the UML Way: Integrating Object-Oriented Design and Programming

Java the UML Way: Integrating Object-Oriented Design and Programming by Else Lervik and Vegard B. Havdal ISBN 0-470-84386-1 John Wiley & Sons, Ltd. Table of Contents Preface xi 1 Introduction 1 1.1 Preliminaries

### Computer/Information Science Course Descriptions

Computer/Information Science Course Descriptions COMS 1003: Introduction to Computer Based Systems Provides students with both computer concepts and hands-on applications. Although little or no prior computer

### MANAGEMENT INFORMATION SYSTEMS

MANAGEMENT INFORMATION SYSTEMS 2013/2014 academic year Timetables can be accessed at http://timetable.ucc.ie/1314/department.asp Click on Click on Business Information Systems For information on building

### LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS, ENGINEERING, AND COMPUTER SCIENCE

LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS, ENGINEERING, AND COMPUTER SCIENCE MAT 119 STATISTICS AND ELEMENTARY ALGEBRA 5 Lecture Hours, 2 Lab Hours, 3 Credits Pre-

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

### Learning outcomes. Knowledge and understanding. Ability and Competences. Evaluation capability and scientific approach

Syllabus Master s Programme in Statistics and Data Mining 120 ECTS Credits Aim The rapid growth of databases provides scientists and business people with vast new resources. This programme meets the challenges

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

### MAT 12O ELEMENTARY STATISTICS I

LAGUARDIA COMMUNITY COLLEGE CITY UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS, ENGINEERING, AND COMPUTER SCIENCE MAT 12O ELEMENTARY STATISTICS I 3 Lecture Hours, 1 Lab Hour, 3 Credits Pre-Requisite:

### Java EE Web Development Course Program

Java EE Web Development Course Program Part I Introduction to Programming 1. Introduction to programming. Compilers, interpreters, virtual machines. Primitive types, variables, basic operators, expressions,

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

### 2 nd Semester M. Sc. (IT)/MCA Syllabus

2 nd Semester M. Sc. (IT)/MCA Syllabus =============================================== T201 Data Structure Using C++ T202 Database Management System T203 Theory of Probability T204 Software Engineering

### TRAINING PROGRAM INFORMATICS

MEDICAL UNIVERSITY SOFIA MEDICAL FACULTY DEPARTMENT SOCIAL MEDICINE AND HEALTH MANAGEMENT SECTION BIOSTATISTICS AND MEDICAL INFORMATICS TRAINING PROGRAM INFORMATICS FOR DENTIST STUDENTS - I st COURSE,

### Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics

Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics For 2015 Examinations Aim The aim of the Probability and Mathematical Statistics subject is to provide a grounding in

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

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

### Diploma of Website Development

Diploma of Website Development Program Description The BHCK Diploma of Website Development provides the skills and knowledge for a graduate to design, build and manage websites as an independent web developer

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

### IT2304: Database Systems 1 (DBS 1)

: Database Systems 1 (DBS 1) (Compulsory) 1. OUTLINE OF SYLLABUS Topic Minimum number of hours Introduction to DBMS 07 Relational Data Model 03 Data manipulation using Relational Algebra 06 Data manipulation

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

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

### MATH BOOK OF PROBLEMS SERIES. New from Pearson Custom Publishing!

MATH BOOK OF PROBLEMS SERIES New from Pearson Custom Publishing! The Math Book of Problems Series is a database of math problems for the following courses: Pre-algebra Algebra Pre-calculus Calculus Statistics

### REGULATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN BIOINFORMATICS (BSc[BioInf])

820 REGULATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN BIOINFORMATICS (BSc[BioInf]) (See also General Regulations) BMS1 Admission to the Degree To be eligible for admission to the degree of Bachelor

### Service courses for graduate students in degree programs other than the MS or PhD programs in Biostatistics.

Course Catalog In order to be assured that all prerequisites are met, students must acquire a permission number from the education coordinator prior to enrolling in any Biostatistics course. Courses are

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

### Course: Math 7. engage in problem solving, communicating, reasoning, connecting, and representing

Course: Math 7 Decimals and Integers 1-1 Estimation Strategies. Estimate by rounding, front-end estimation, and compatible numbers. Prentice Hall Textbook - Course 2 7.M.0 ~ Measurement Strand ~ Students

### Common Core State Standards. Standards for Mathematical Practices Progression through Grade Levels

Standard for Mathematical Practice 1: Make sense of problems and persevere in solving them. Mathematically proficient students start by explaining to themselves the meaning of a problem and looking for

Bachelor's Degree in Business Administration and Master's Degree course description Bachelor's Degree in Business Administration Department s Compulsory Requirements Course Description (402102) Principles

### Course Number: IAC-SOFT-WDAD Web Design and Application Development

Course Number: IAC-SOFT-WDAD Web Design and Application Development Session 1 (10 Hours) Client Side Scripting Session 2 (10 Hours) Server Side Scripting - I Session 3 (10 hours) Database Session 4 (10

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

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

### RUTHERFORD HIGH SCHOOL Rutherford, New Jersey COURSE OUTLINE STATISTICS AND PROBABILITY

RUTHERFORD HIGH SCHOOL Rutherford, New Jersey COURSE OUTLINE STATISTICS AND PROBABILITY I. INTRODUCTION According to the Common Core Standards (2010), Decisions or predictions are often based on data numbers

### NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document

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

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

### MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

### Current Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary

Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:

### ML for the Working Programmer

ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming

### PA Common Core Standards Standards for Mathematical Practice Grade Level Emphasis*

Habits of Mind of a Productive Thinker Make sense of problems and persevere in solving them. Attend to precision. PA Common Core Standards The Pennsylvania Common Core Standards cannot be viewed and addressed

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

### Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

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

### Chapter 2: Systems of Linear Equations and Matrices:

At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,

### The Method of Least Squares

Hervé Abdi 1 1 Introduction The least square methods (LSM) is probably the most popular technique in statistics. This is due to several factors. First, most common estimators can be casted within this

### Databases. DSIC. Academic Year 2010-2011

Databases DSIC. Academic Year 2010-2011 1 Lecturer José Hernández-Orallo Office 236, 2nd floor DSIC. Email: jorallo@dsic.upv.es http://www.dsic.upv.es/~jorallo/docent/bda/bdaeng.html Attention hours On

### STA-201-TE. 5. Measures of relationship: correlation (5%) Correlation coefficient; Pearson r; correlation and causation; proportion of common variance

Principles of Statistics STA-201-TE This TECEP is an introduction to descriptive and inferential statistics. Topics include: measures of central tendency, variability, correlation, regression, hypothesis

### Overview... 2. Accounting for Business (MCD1010)... 3. Introductory Mathematics for Business (MCD1550)... 4. Introductory Economics (MCD1690)...

Unit Guide Diploma of Business Contents Overview... 2 Accounting for Business (MCD1010)... 3 Introductory Mathematics for Business (MCD1550)... 4 Introductory Economics (MCD1690)... 5 Introduction to Management

### Fairfield Public Schools

Mathematics Fairfield Public Schools AP Statistics AP Statistics BOE Approved 04/08/2014 1 AP STATISTICS Critical Areas of Focus AP Statistics is a rigorous course that offers advanced students an opportunity

### Students who successfully complete the Health Science Informatics major will be able to:

Health Science Informatics Program Requirements Hours: 72 hours Informatics Core Requirements - 31 hours INF 101 Seminar Introductory Informatics (1) INF 110 Foundations in Technology (3) INF 120 Principles

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

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

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

### UNIT 1: COLLECTING DATA

Core Probability and Statistics Probability and Statistics provides a curriculum focused on understanding key data analysis and probabilistic concepts, calculations, and relevance to real-world applications.

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

### PELLISSIPPI STATE COMMUNITY COLLEGE MASTER SYLLABUS INTRODUCTION TO STATISTICS MATH 2050

PELLISSIPPI STATE COMMUNITY COLLEGE MASTER SYLLABUS INTRODUCTION TO STATISTICS MATH 2050 Class Hours: 2.0 Credit Hours: 3.0 Laboratory Hours: 2.0 Date Revised: Fall 2013 Catalog Course Description: Descriptive

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

### Computer Science. Computer Science 213. Faculty and Offices. Degrees and Certificates Awarded. AS Computer Science Degree Requirements

Computer Science 213 Computer Science (See Computer Information Systems section for additional computer courses.) Degrees and Certificates Awarded Associate in Science Degree, Computer Science Certificate

PR- ASSIGNMNT 3000500 Quantitative mpirical Research The objective of the pre- assignment is to review the course prerequisites and get familiar with SPSS software. The assignment consists of three parts:

### Department of Industrial Engineering

Department of Industrial Engineering Master of Engineering Program in Industrial Engineering (International Program) M.Eng. (Industrial Engineering) Plan A Option 2: Total credits required: minimum 39

### 430 Statistics and Financial Mathematics for Business

Prescription: 430 Statistics and Financial Mathematics for Business Elective prescription Level 4 Credit 20 Version 2 Aim Students will be able to summarise, analyse, interpret and present data, make predictions

### Computer Science/Software Engineering

292 School of Science and Engineering Computer Science/Software Engineering Everald E. Mills, PhD, Chair Objectives The computer science program seeks to prepare students for careers that require sophisticated

### Master of Arts in Mathematics

Master of Arts in Mathematics Administrative Unit The program is administered by the Office of Graduate Studies and Research through the Faculty of Mathematics and Mathematics Education, Department of

### Mathematics (MAT) Faculty Mary Hayward, Chair Charles B. Carey Garnet Hauger, Affiliate Tim Wegner

Mathematics (MAT) Faculty Mary Hayward, Chair Charles B. Carey Garnet Hauger, Affiliate Tim Wegner About the discipline The number of applications of mathematics has grown enormously in the natural, physical

### MySQL for Beginners Ed 3

Oracle University Contact Us: 1.800.529.0165 MySQL for Beginners Ed 3 Duration: 4 Days What you will learn The MySQL for Beginners course helps you learn about the world's most popular open source database.

### LONDON SCHOOL OF COMMERCE. Programme Specification for the. Cardiff Metropolitan University. BSc (Hons) in Computing

LONDON SCHOOL OF COMMERCE Programme Specification for the Cardiff Metropolitan University BSc (Hons) in Computing Contents Programme Aims and Objectives Programme Structure Programme Outcomes Mapping of

### Probability and Statistics Vocabulary List (Definitions for Middle School Teachers)

Probability and Statistics Vocabulary List (Definitions for Middle School Teachers) B Bar graph a diagram representing the frequency distribution for nominal or discrete data. It consists of a sequence

### PCHS ALGEBRA PLACEMENT TEST

MATHEMATICS Students must pass all math courses with a C or better to advance to the next math level. Only classes passed with a C or better will count towards meeting college entrance requirements. If

### SYLLABUS COURSE OBJECTIVES

SYLLABUS COURSE TITLE Elements of European Cultural History DEPARTMENT Faculty of Physical Education COURSE CODE DEGREE PROGRAMME FACULTY QUALIFICATION LEVEL STUDY MODE Physical Education 1st level Full-time

### Mathematics. Probability and Statistics Curriculum Guide. Revised 2010

Mathematics Probability and Statistics Curriculum Guide Revised 2010 This page is intentionally left blank. Introduction The Mathematics Curriculum Guide serves as a guide for teachers when planning instruction