This document summarizes Jacob Okoniewski's academic record, including the courses taken each semester during his studies at a university from Fall 2002 to Spring 2005. He earned a Bachelor of Arts degree in Computer Information Systems in December 2005. His coursework covered topics such as discrete mathematics, microeconomics, computer applications, algorithms, data structures, operating systems, statistics, calculus, psychology, computer networks, database applications, and business ethics.

1. Jacob Okoniewski
Degree Awarded: Bachelor of Arts, 31 December 2005
Major: Computer Information Systems
Fall 2002
LAM 320, Discrete Mathematics
LAS 250, Microeconomics
MGT 150.3, Introduction to Computer Applications
MGT 495.1, Special Topic: Algorithms and Programs
Spring 2003
LAM 410, Linear Algebra
LAS 255, Macroeconomics
MGT 495.2, Special Topic: Algorithms and Data Structures
MGT 495.3, Special Topic: Operating Systems
Fall 2003
LAE 101, Fundamentals of Composition
LAM 216, Statistical Methods
LAM 311, Calculus
LAP 100, General Psychology
MGT 140.2, Introduction to Computing
MGT 347, Computer Networks and Intranets
MGT 495.72, Special Topic: Computer Simulation in Business
Spring 2004
LAN 300.1, Ecology and Conservation
MGT 215.2, Business Applications of Spreadsheets
MGT 239, Database Applications
MGT 305.1, Operations Management
MGT 314, Java Programming
MGT 495.4, Special Topic: Internet Programming
MGT 495.5, Special Topic: Computer Graphics
MGT 495.6, Special Topic: Computer Systems Security
MGT 495.77, Special Topic: Computer Organization and Architecture

2. Fall 2004
LAA 110, Introduction to Art
LAA 495, Art Special Topic: Art Studio
LAE 102, Composition and Literature
LAH 110.1, Introduction to Philosophy
MGT 348, C++ Programming
MGT 495.70, Special Topic: Programming Methods
Spring 2005
LAP 495, Special Topic in Psychology: Human-Computer Interaction
LAS 118, Introduction to Politics
LAS 355, Applied Econometrics
LAT 210, Effective Speaking
MGT 106, Applications of Business Writing
MGT 304, Business Ethics
MGT 340, System Analysis and Design
MGT 445, Applied Software Development Project
MGT 495.10, Special Topic: Conducting Business Meetings
MGT 495.11, Special Topic: Writing Business Plans
MGT 495.71, Special Topic: Decision Support Systems
Description of the courses:
Fall 2002
LAM 320, Discrete Mathematics
LAS 250, Microeconomics
Economics as a science. The rationality of economic activity. Good and needs. Scarcity and choice in the
economy. Market mechanism, the advantages and limitations. Elasticity of demand and supply. The theory of
consumer choice. Usability. The theory of production. Productivity of the total, average and marginal. Isoquant.
The theory of choice in the enterprise: cost and utargi. The balance of businesses in different market structures.
Analysis of factors of production. Pension, interest and economic gain. Money market economy. Capital market.
Stock Exchange.
MGT 150.3, Introduction to Computer Applications
Turbo Pascal
1. Introduction: The subject of computer science, algorithms, history of development. The algorithm and its

3. record: the concept of algorithm and the language of his writing, programming languages, examples of simple
algorithms. Basic concepts in programming: fixed, variable declaration, assignment statement, conditional
statements.
2. Basic concepts in programming: unrestricted and restricted iteration.
3. Basic concepts in programming: iteration and array variables.
4. Basic concepts in programming: examples of algorithms on arrays.
5. The notion of computational complexity of the algorithm. O. The concept of decidability notation.
Class of complexity.
6. Construction of computer logic and principle of its activities: binary and hexadecimal system, fractions,
floating point representation.
7. Construction of computer logic and principle of its operation: machine von Neumann instruction cycle,
assembly language, an example of the digital machine.
8. Computer equipment and software (hardware, software).
9. The program design: specification, formal model, further clarifications.
Data structures: graphs.
10. Data structures: stack, queue, circular queue, set, dictionary.
11. Data structures: indicators list.
12. Data structures: operations on lists.
13. Data structures: trees, tree expressions, binary trees, screening, tree search
14. Advanced algorithmic techniques: recursion, the technique of recurrence
(backtracking), greedy technique.
15. Parallel and concurrent algorithms.
MGT 495.1, Special Topic: Algorithms and Programs
C++, Course
Spring 2003
LAM 410, Linear Algebra
LAS 255, Macroeconomics
MGT 495.2, Special Topic: Algorithms and Data Structures
The course syllabus:
- Computational complexity of algorithms - definition, notation, examples.
- Techniques for construction of efficient algorithms: greedy method, dynamic programming, recursion, divide
and conquer method, technique of turns.
- Methods for sorting: a repetition of simple algorithms (bubble, insertion, selection) by combining sorting,
quick sorting (quicksort) method of the mound (heapsort); mound as a priority queue, sorting by counting,
sorting, bucket, sorting files.
- Search in an ordered array (half-interpolation).
- Binary search trees, balanced trees.
- Mixing Technology (hashing).
- Searching in external memory.
- Revision graph algorithms (in depth, breadth), finding components, test acykliczności, topological sorting.
- Finding the shortest paths and minimum spanning tree.
- Some algorithmic problems of geometry or word processing
- Computationally difficult problems and overcome them.

4. MGT 495.3, Special Topic: Operating Systems
Lecture’s
• Basic concepts: operating system, virtual machine, work on-line, batch and real-time multiple access,
multiprogramming, virtual memory, system resources, processes. The history of development of operating
systems. Examples of systems and their characteristics.
• The functions of the operating system. Managing different types of resources (processors, memory, input-
output program resources).
• The concept of the process. Concurrent and parallel processes.
• The structure of the operating system: hardware, kernel, shell - "user level".
• Shell-user interface and operating system functions as seen from the user's windowing system.
• Overview of the Unix system: structure, file system (permissions, assembly, links, meta-characters),
redirection, pipes, construction in the background.
• Unix: aliases, history.
• Unix: Batch processing - variables, parameters, conditional and iterative structures.
• Unix: System programming - O operations.
• Unix: System programming - process management, redirection.
• Management of processors: virtual processors, switching processor scheduling algorithms processes.
• Memory Management: paging, virtual memory, algorithms exchange, memory allocation algorithms, merge.
• Management of input-output devices: types O devices, the order O operations, ways of cooperation with the
devices, buffering.
• file system: structure, access protection, methods of implementation.
• Problems of co-operation processes: conditional errors in time, mutual exclusion, deadlock (deadlock),
starvation.
• synchronization and communication mechanisms: semaphores, critical regions, monitors, meetings,
communications, remote procedure call.
• Classic Problems of Synchronization: buffer limited, readers and writers, five philosophers.
• Operating systems for parallel machines: parallel architectures (mesh, HyperCube), parallel algorithms,
languages.
• Operating systems in a networked environment: the model layer, Internet (TCP / IP network services).
• Overview of Windows: installation, configuration, users, domains, Internet-related functions (DHCP, router,
security), security policy.
Fall 2003
LAE 101, Fundamentals of Composition
English Path
LAM 216, Statistical Methods
LAM 311, Calculus
LAP 100, General Psychology
MGT 140.2, Introduction to Computing
1. The history of programming languages
2. The elements of programming in assembly

5. 3. C + +: Variable
4. C + +: Features
5. C + +: Pointers and references
6. C + +: Classes and Objects I
7. C + +: Classes and Objects II
8. C + +: inheritance and
C + +: Inheritance II
9. Midterm exam in C + +
10. C + +: O Operations
11. Structured programming: PERL
PERL: The Basics
PERL: operators
PERL: syntax
12. PERL: subroutines
PERL: system functions
PERL: system variables
PERL regular expressions
13. Java Basics
Java: packages
14. Java: Classes and Objects
Java: inheritance
15. Structured programming in a browser environment: JavaScript
MGT 347, Computer Networks and Intranets
1. ABC network, IP addressing (short message repetition of the exercises). Ethernet frames, the MAC address,
ARP, such as communication (transmission frame) within a single network.
2. Model OSI, IPv4, terminology. Header analysis, the importance of fields, fragmentation, MTU. Routing
Basics.
3. The hardware components of the network. Network topologies.
4. Transport Layer: TCP and UDP.
5. The application layer. HTTP, SMTP, POP3, IMAP.
6. Routing, Part 1 Static routing. As packet passes through routers. The default route. The content of routing
table.
7. Routing, Part 2 Dynamic routing. RIP, RIP2, OSPF, IGRP, BGP.
8. DNS.
9. Security on the network. Sources of threats, attacks and exemplary methods of preventing attacks. The
principle of operation of the firewall.
10. SSL, TLS, IPSec. WAN technologies. PPP, basic information about ISDN.
11. ATM.
12. LAN, FDDI, Token Ring.
13. VPN. The physical layer, coding methods.
14. Fundamentals of interface slots.

6. 15. SNMP. Summary, supplements, discuss the exam.
MGT 495.72, Special Topic: Computer Simulation in Business
Lectures + Practice (Business Leader Online Project, Sales Project – highest score at the University)
Spring 2004
LAN 300.1, Ecology and Conservation
MGT 215.2, Business Applications of Spreadsheets
MGT 239, Database Applications
1. (20-02-2004) Introduction, basic concepts, examples of database architecture, database systems. SQL Part 1
2. (27-02-2004) SQL Part 2
3. (05-03-2004) SQL Part 3 Fundamentals of Relational Database Design, Part 1
4. (12-03-2004) Fundamentals of Relational Database Design, Part 2
5. (19-03-2004) Transact SQL. Stored procedures. Triggers.
6. (26-03-2004) The physical structure of the database, indexes, security system (for example, MS SQL Server
2000).
7. (02-04-2004) Strategies for making backup copies. Transaction logs.
8. (16-04-2004) ADO, client applications to server systems. Pediments MS Access to MS SQL Server (ADP
project), PHP, ASP.NET.
9. (23-04-2004) Distributed Databases. Replication.
10. (30-04-2004) Automation of administrative tasks.
11. (07-05-2004) Basics of Oracle.
12. (14-05-2004) relational database objects and objects.
13. (21-05-2004) Data Warehousing, OLAP, exploration of the data (data mining).
14. (28-05-2004) pediments in different languages.
15. (04-06-2004) Summary, supplements, discuss the exam.
MGT 305.1, Operations Management
Linear Programming (Linear Optimization)
MGT 314, Java Programming
JAVA, JAVA Script, PHP
MGT 495.4, Special Topic: Internet Programming
MGT 495.5, Special Topic: Computer Graphics
MGT 495.6, Special Topic: Computer Systems Security
1. Threats to network security and basic services.
2. Classical encryption techniques.

7. 3. Steganography.
4. Substitution technique.
5. Rotary machines.
6. Transposition techniques.
7. DES - Data Encryption Standard.
8. Applications of DESA and other symmetric algorithms.
9. Confidentiality with conventional encryption.
10. Explicit key cryptology - algorithms and protocols.
11. Elements of number theory and RSA algorithm.
12. One-way functions and digital signatures.
13. Pseudo-random sequences and their generation.
14. Compression and data conversion.
15. Protect your workstation.
16. Email security.
17. TCP / IP and security.
18. SSH and KERBEROS system.
19. Web protection - SSL and SHTTP.
20. Firewall.
21. Security in network management.
22. Cryptographic protocols.
MGT 495.77, Special Topic: Computer Organization and Architecture
Fall 2004
LAA 110, Introduction to Art
LAA 495, Art Special Topic: Art Studio
LAE 102, Composition and Literature
Business English Path
LAH 110.1, Introduction to Philosophy
MGT 348, C++ Programming
MGT 495.70, Special Topic: Programming Methods
• Compilers and interpreters. Do you know a foreign language is enough to be a good translator?
• Combinatorics. How to combine on a large scale?
• Computational complexity. How bad are the algorithms? Predictability and unpredictability.
• Random Numbers - Generation, Testing. Are random numbers are random? What is the Universe?
• Arithmetic - floating-point arithmetic constraints, rational numbers, the distribution of prime factors.
• Codes of fixed and variable length. What are the common codes of flowers? Why in the mobile (stationary) is
not required Enter key? How dangerous are the noise?

8. Spring 2005
LAP 495, Special Topic in Psychology: Human-Computer Interaction
LAS 118, Introduction to Politics
LAS 355, Applied Econometrics
LAT 210, Effective Speaking
Business English Path
MGT 106, Applications of Business Writing
Business English Path
MGT 304, Business Ethics
MGT 340, System Analysis and Design
MGT 445, Applied Software Development Project
MGT 495.10, Special Topic: Conducting Business Meetings
Business English Path
MGT 495.11, Special Topic: Writing Business Plans
Business English Path
MGT 495.71, Special Topic: Decision Support Systems