IU - User contributions [en]

BSc: Distributed And Network Programming

2023-03-22T15:27:31Z

S.seytnazarov: /* Distributed and Network Programming */

= Distributed and Network Programming =
* '''Course name''': Distributed and Network Programming
* '''Code discipline''': XYZ
* '''Subject area''': xxx

== Short Description ==
This course covers the following concepts: Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers; Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance..

== Prerequisites ==

=== Prerequisite subjects ===
* '''Networks''': 1) Understanding Application, Transport, and Network layers, 2) Basic socket programming experience
* '''Operating systems'''

=== Prerequisite topics ===

== Course Topics ==
{| class="wikitable"
|+ Course Sections and Topics
|-
! Section !! Topics within the section
|-
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming ||
# General introduction to the course
# Computer networks basic
# Socket programming
# UDP socket programming
# TCP socket programming
|-
| Multithreaded socket programming, RPCs, and distributed system architecture ||
# Multithreading and multithreaded socket programming
# Remote procedure calls (RPCs)
# Distributed system architectures
|-
| Coordination, consistency, and replication in distributed systems ||
# Clock synchronization algorithms (NTP, Berkeley)
# Logical clock (Lamport clocks)
# Mutual exclusion algorithms: permission-based, token-based
# Election algorithms: Bully, Ring
# Consistency models
# Replica management
# Consistency protocols
|-
| Fault tolerance and security in distributed systems ||
# Intro to fault tolerance: Failure models, Failure masking by redundancy
# Process resilience: process groups, process replication, consensus in faulty systems, failure detection
# Reliable group communication: atomic multicast,
# Distributed commit
# Recovery: checkpointing
# Intro to security: threats, design issues, cryptography
# Secure channels: authentication, message integrity and confidentiality, secure group communication
# Access control: general issues, firewalls, secure mobile code, denial of service
# Secure naming
# Security management: Key management, secure group management, authorization management
|}
== Intended Learning Outcomes (ILOs) ==

=== What is the main purpose of this course? ===
Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== ILOs defined at three levels ===

==== Level 1: What concepts should a student know/remember/explain? ====
By the end of the course, the students should be able to ...
* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== Level 2: What basic practical skills should a student be able to perform? ====
By the end of the course, the students should be able to ...
* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios? ====
By the end of the course, the students should be able to ...
* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election
== Grading ==

=== Course grading range ===
{| class="wikitable"
|+
|-
! Grade !! Range !! Description of performance
|-
| A. Excellent || 90-100 || -
|-
| B. Good || 75-89 || -
|-
| C. Satisfactory || 60-74 || -
|-
| D. Poor || 0-59 || -
|}

=== Course activities and grading breakdown ===
{| class="wikitable"
|+
|-
! Activity Type !! Percentage of the overall course grade
|-
| Laboratory assignments || 55%
|-
| Final exam || 35%
|-
| Attendance || 10%
|}

=== Recommendations for students on how to succeed in the course ===

== Resources, literature and reference materials ==

=== Open access resources ===
* Textbook: Maarten Van Steen, and Andrew S. Tanenbaum. Distributed systems (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* Reference: George F. Coulouris, Jean Dollimore, and Tim Kindberg. Distributed systems: concepts and design (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* Reference: Sukumar Ghosh. Distributed systems: an algorithmic approach (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

=== Closed access resources ===

=== Software and tools used within the course ===

= Teaching Methodology: Methods, techniques, & activities =

== Activities and Teaching Methods ==
{| class="wikitable"
|+ Activities within each section
|-
! Learning Activities !! Section 1 !! Section 2 !! Section 3 !! Section 4
|-
| Development of individual parts of software product code || 1 || 1 || 1 || 1
|-
| Homework and group projects || 1 || 1 || 1 || 1
|-
| Testing (written or computer based) || 1 || 1 || 1 || 1
|-
| Oral polls || 1 || 1 || 1 || 1
|-
| Discussions || 1 || 1 || 1 || 1
|}
== Formative Assessment and Course Activities ==

=== Ongoing performance assessment ===

==== Section 1 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || What are the distributed systems? || 1
|-
| Question || Give an example of distributed systems. || 1
|-
| Question || What are the advantages of layered architecture? || 1
|-
| Question || What are the roles of transport protocols? || 1
|-
| Question || How the TCP and UDP differ from each other? When one is preferred over the other? || 1
|-
| Question || What is socket programming? || 1
|-
| Question || How socket programming is different for UDP and TCP? || 1
|-
| Question || Write a simple UDP/TCP client-server echo program || 0
|-
| Question || Write a simple chatting program using UDP/TCP sockets || 0
|-
| Question || Given the simple echo server program, apply socket timeouts and catch timeout exceptions || 0
|-
| Question || Write a UDP-based reliable file transfer protocol || 0
|-
| Question || Write a program that parallelly executes the CPU-bound tasks using multiple processes || 0
|}
==== Section 2 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || How the threads differ from processes? || 1
|-
| Question || What are the I/O and CPU-bound tasks? || 1
|-
| Question || For what kind of tasks, using threads is preferred than using processes? || 1
|-
| Question || What is a remote procedure call? || 1
|-
| Question || What are some well-known distributed system architectures? || 1
|-
| Question || Discuss the structured and unstructured decentralized architectures. || 1
|-
| Question || You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. || 0
|-
| Question || You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter) || 0
|-
| Question || Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class || 0
|-
| Question || Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC. || 0
|}
==== Section 3 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || How NTP protocol works? || 1
|-
| Question || How Berkeley protocol works? || 1
|-
| Question || Discuss the mutual exclusion algorithms. || 1
|-
| Question || Discuss the permanent and server-initiated replicas and their difference || 1
|-
| Question || Explain the Primary-backup protocol. || 1
|-
| Question || Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm. || 0
|-
| Question || Explain how Bully algorithm for election works || 0
|-
| Question || Explain how Ring algorithm for election works || 0
|-
| Question || Explain the centralized (permission-based) method of mutual exclusion || 0
|}
==== Section 4 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || Discuss the failure models || 1
|-
| Question || Discuss different failure masking techniques by redundancy || 1
|-
| Question || What is k-fault tolerant group? || 1
|-
| Question || What is general model of failure detection? || 1
|-
| Question || Explain basic reliable multicasting || 1
|-
| Question || Explain what is authentication || 1
|-
| Question || Explain what are message confidentiality and integrity || 1
|-
| Question || Same as above || 0
|}
=== Final assessment ===
'''Section 1'''
# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?
'''Section 2'''
# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.
'''Section 3'''
# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.
'''Section 4'''
# Same as above

=== The retake exam ===
'''Section 1'''

'''Section 2'''

'''Section 3'''

'''Section 4'''

BSc: Fundamentals of Computer Security

2023-01-23T09:48:07Z

S.seytnazarov:

= Fundamentals of Information Security =
* '''Course name''': Fundamentals of Information Security
* '''Code discipline''': XYZ
* '''Subject area''': xxx

== Short Description ==
This course covers the following concepts: User authentication and authorization; Database and data center security; Reverse engineering and malicious software; Buffer overflow and software security; OS security; Symmetric encryption; Public-key cryptography.

== Prerequisites ==

=== Prerequisite subjects ===

=== Prerequisite topics ===

== Course Topics ==
{| class="wikitable"
|+ Course Sections and Topics
|-
! Section !! Topics within the section
|-
| Computer security technology and principles ||
# Introduction to computer security
# User authentication and authorization
# Database and data center security
# Network security of data center
# Reverse engineering and malicious software
|-
| Software and system security ||
# Buffer overflow and software security
# OS security
# Guest lecture from industry
|-
| Cryptographic algorithms ||
# Symmetric encryption and message confidentiality
# Public key cryptography and message authentication
|-
| Additional ||
# Compliances and documentation in computer security
# New technologies and research areas in cyber security
# Cybercrime and forensics, incident response
|}
== Intended Learning Outcomes (ILOs) ==

=== What is the main purpose of this course? ===
The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== ILOs defined at three levels ===

==== Level 1: What concepts should a student know/remember/explain? ====
By the end of the course, the students should be able to ...
* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== Level 2: What basic practical skills should a student be able to perform? ====
By the end of the course, the students should be able to ...
* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios? ====
By the end of the course, the students should be able to ...
* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls
== Grading ==

=== Course grading range ===
{| class="wikitable"
|+
|-
! Grade !! Range !! Description of performance
|-
| A. Excellent || 90-100 || -
|-
| B. Good || 75-89 || -
|-
| C. Satisfactory || 60-74 || -
|-
| D. Poor || 0-59 || -
|}

=== Course activities and grading breakdown ===
{| class="wikitable"
|+
|-
! Activity Type !! Percentage of the overall course grade
|-
| Laboratory assignments || 50%
|-
| Weekly quizzes || 14%
|-
| Attendance || 6%
|-
| Final exam || 30%
|}

=== Recommendations for students on how to succeed in the course ===

== Resources, literature and reference materials ==

=== Open access resources ===
* Required textbook: William Stallings and Lawrie Brown, "Computer Security: Principles and Practice,“ 4th edition, Pearson, 2017.
* Additional textbook: William Stallings, "Cryptography and Network Security: Principles and Practice," 7th Edition, Pearson, 2017.

=== Closed access resources ===

=== Software and tools used within the course ===

= Teaching Methodology: Methods, techniques, & activities =

== Activities and Teaching Methods ==
{| class="wikitable"
|+ Activities within each section
|-
! Learning Activities !! Section 1 !! Section 2 !! Section 3 !! Section 4
|-
| Development of individual parts of software product code || 1 || 1 || 1 || 1
|-
| Homework and group projects || 1 || 1 || 1 || 1
|-
| Testing (written or computer based) || 1 || 1 || 1 || 1
|-
| Oral polls || 1 || 1 || 1 || 1
|-
| Discussions || 1 || 1 || 1 || 1
|}
== Formative Assessment and Course Activities ==

=== Ongoing performance assessment ===

==== Section 1 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || What is meant by the CIA triad? || 1
|-
| Question || What is the difference between data integrity and system integrity? || 1
|-
| Question || How is cryptanalysis different from brute-force attack? || 1
|-
| Question || List and briefly explain the different approaches to attacking a symmetric encryption scheme. || 1
|-
| Question || In general terms, what are four means of authenticating a user’s identity? || 1
|-
| Question || What is a Trojan horse attack? || 1
|-
| Question || What is the difference between authentication and authorization? || 1
|-
| Question || How does RBAC relate to DAC and MAC? || 1
|-
| Question || Define the terms database, database management system, and query language. || 1
|-
| Question || What is a relational database and what are its principal ingredients? || 1
|-
| Question || What is an SQL injection attack? What are the implications of an SQL injection attack? || 1
|-
| Question || List the categories for grouping different types of SQLi attacks. || 1
|-
| Question || Why is RBAC considered fit for database access control? || 1
|-
| Question || What are three broad mechanisms that malware can use to propagate? || 1
|-
| Question || What is a blended attack? || 1
|-
| Question || Define a denial-of-service (DoS) attack || 1
|-
| Question || State the difference between a SYN flooding attack and a SYN spoofing attack. || 1
|-
| Question || What is the goal of an HTTP flood attack? || 1
|-
| Question || What is a poison packet attack? Give two examples of such an attack. || 1
|-
| Question || How are intruders classified according to skill level? || 1
|-
| Question || List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed. || 1
|-
| Question || Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw || 0
|-
| Question || Develop an attack tree for gaining access to the contents of a physical safe || 0
|-
| Question || Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption || 0
|-
| Question || Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation. || 0
|-
| Question || Explain the suitability or unsuitability of the given passwords || 0
|-
| Question || Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.<br>Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?<br>Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN? || 0
|-
| Question || Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:<br>If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.<br>If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided. || 0
|-
| Question || Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added? || 0
|-
| Question || Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information || 0
|-
| Question || Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker. || 0
|-
| Question || Consider the given fragment of code. What type of malware is this? || 0
|-
| Question || Consider the given fragment embedded in a webpage. What type of malicious software is this? || 0
|-
| Question || In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes? || 0
|-
| Question || It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why? || 0
|-
| Question || Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands? || 0
|-
| Question || As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed. || 0
|-
| Question || Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule. || 0
|}
==== Section 2 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || Define buffer overflow. || 1
|-
| Question || Define an off-by-one attack. || 1
|-
| Question || Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found? || 1
|-
| Question || State the similarities and differences between command injection and SQL injection attacks || 1
|-
| Question || What are the basic steps needed in the process of securing a system? || 1
|-
| Question || State different types of full virtualization with their security requirements. || 1
|-
| Question || List five essential characteristics of cloud computing. || 1
|-
| Question || List and briefly define three cloud service models. || 1
|-
| Question || Briefly explain the most prominent deployment models for cloud computing. || 1
|-
| Question || Describe some of the main cloud-specific security threats. || 1
|-
| Question || Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use. || 0
|-
| Question || Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library. || 0
|-
| Question || Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem. || 0
|-
| Question || Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented? || 0
|-
| Question || How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded? || 0
|-
| Question || Why is it important to secure the boot process? Is it required to limit which media the system must boot from? || 0
|}
==== Section 3 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || What are different types of cryptanalysis attacks? || 1
|-
| Question || Why do some block cipher modes of operation only use encryption while others use both encryption and decryption? || 1
|-
| Question || In the context of a hash function, what is a compression function? || 1
|-
| Question || Briefly explain Diffie-Hellman key exchange. || 1
|-
| Question || Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why? || 0
|-
| Question || Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption? || 0
|-
| Question || Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”<br>Will this checksum detect all errors caused by an odd number of error bits? Explain.<br>Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.<br>Comment on the effectiveness of this function for use as a hash function for authentication || 0
|-
| Question || It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible? || 0
|}
==== Section 4 ====
{| class="wikitable"
|+
|-
! Activity Type !! Content !! Is Graded?
|-
| Question || What are different types of cryptanalysis attacks? || 1
|-
| Question || Why do some block cipher modes of operation only use encryption while others use both encryption and decryption? || 1
|-
| Question || In the context of a hash function, what is a compression function? || 1
|-
| Question || Briefly explain Diffie-Hellman key exchange. || 1
|-
| Question || Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why? || 0
|-
| Question || Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption? || 0
|-
| Question || Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”<br>Will this checksum detect all errors caused by an odd number of error bits? Explain.<br>Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.<br>Comment on the effectiveness of this function for use as a hash function for authentication || 0
|-
| Question || It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible? || 0
|}
=== Final assessment ===
'''Section 1'''
# Questions from previous two subsections can be used.
'''Section 2'''
# Questions from previous two subsections can be used.
'''Section 3'''
# Questions from previous two subsections can be used.
'''Section 4'''
# Questions from previous two subsections can be used.

=== The retake exam ===
'''Section 1'''

'''Section 2'''

'''Section 3'''

'''Section 4'''

MSc: Inter Networking and Routing

2022-07-14T11:39:14Z

S.seytnazarov: /* Prerequisites */

= Inter-Networking and Routing =

* <span>'''Course name:'''</span> Inter-Networking and Routing
* <span>'''Course number:'''</span>

== Course characteristics ==

=== Key concepts of the class ===

* Inter-networking and routing
* BGP, OSPF, and AODV
* NAT, QoS, VLAN
* Monitoring network traffic, traffic mirroring, and packet crafting as well as proxying

=== What is the purpose of this course? ===

Inter-Networking and Routing is the course for SNE program that provides the students with fundamental knowledge about inter-networking and routing. The course starts with some introductory material about routing, such as the definition of path cost and the classification of routing algorithms. A networking infrastructure deploys various algorithms for routing packets, classified as those using optimal routes and those using non-optimal routes. This course includes hands-on exercise, and the students will practice their skills on the actual hardware and software. This course includes various interesting topics in the networking domain, which are also related to real-world applications. This course will particularly focus on addressing in detail routing, detailed BGP, OSPF, and AODV. Furthermore, this course also covers Network Address Translation (NAT), Quality of Service (QoS) fundamentals, as well as Virtual LAN (VLAN). It additionally discusses the network traffic, it is monitoring, proxying, and packet crafting in detail. Students will have the opportunity to apply the knowledge learned in class to actual hardware. Furthermore, this course also includes invited talks by experts from industry which will help students to have knowledge of the current state of the art.

== Prerequisites ==
Prior courses:
* Classical Internet applications
* Computer systems and networks

The course will benefit if students already know some of the following topics:
* Basics of TCP/IP networks: TCP/IP stack, transport protocols, application layer protocols, IP addressing, OSI -7 layer model
* Linux OS: networking and administration

Recommendations for students on how to succeed in the course
References:
* [https://www.linuxtopia.org/online_books/linux_for_beginners_index.html Linux for Beginners]
* [https://www.linuxtopia.org/online_books/linux_network_administrators_guide/index.html Linux Administration and Networking]
* [https://cds.cern.ch/record/676686/files/0130384887_TOC.pdf Computer Networks]

== Course Objectives Based on Bloom’s Taxonomy ==

=== What should a student remember at the end of the course? ===

By the end of the course, the students should be able to recognize and define

* IP version 6 and Layer 2 Basics
* Spanning Tree and Routing Basics
* Link-state routing protocol (OSPF)
* Path vector routing protocol (BGP)
* Ad hoc On-Demand Distance Vector Routing (AODV)
* NAT, QoS, and VLAN
* Network traffic monitoring, proxying, and packet crafting

=== What should a student be able to understand at the end of the course? ===

By the end of the course, the students should be able to describe and explain (with examples)

* Routing Basics
* BGP
* OSPF
* AODV
* NAT
* QoS
* VLAN
* Proxying, packet crafting

=== What should a student be able to apply at the end of the course? ===

By the end of the course, the students should be able to apply

* Install, Configure, update, and manage services over a network
* Configure, maintain, and update the routing tables
* Assign network address and maintain forwarding tables
* Operate applications using BGP routing
* Operate applications using AODV routing
* Represent performance analysis of AODV, OSPF, and BGP
* Configure VLAN, NAT, and craft network packets using different tools
* Conduct quality of service experiments in the network (from routing perspective)
* Install and configure proxies in the network

=== Course evaluation ===

{|
|+ Course grade breakdown
!
!
!align="center"| '''Proposed points'''
|-
| Labs/seminar classes
| 20
|align="center"| 50
|-
| Interim performance assessment
| 30
|align="center"| 0
|-
| Exams
| 50
|align="center"| 50
|}

If necessary, please indicate freely your course’s features in terms of students’ performance assessment: None

=== Grades range ===

{|
|+ Course grading range
!
!
!align="center"| '''Proposed range'''
|-
| A. Excellent
| 90-100
|align="center"|
|-
| B. Good
| 75-89
|align="center"|
|-
| C. Satisfactory
| 60-74
|align="center"|
|-
| D. Poor
| 0-59
|align="center"|
|}

If necessary, please indicate freely your course’s grading features: The semester starts with the default range as proposed in the Table [[#tab:MLCourseGradingRange|[tab:MLCourseGradingRange]]], but it may change slightly (usually reduced) depending on how the semester progresses.

=== Resources and reference material ===

* Radia Perlman, ''<span>Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, 2nd Edition, Sun Microsystems, Inc.</span>''

== Course Sections ==

The main sections of the course and approximate hour distribution between them is as follows:

{|
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Networking overview
|align="center"| 12
|-
|align="center"| 2
| IP version 6 and Layer 2 Basics
|align="center"| 12
|-
|align="center"| 3
| Spanning Tree and Routing Basics
|align="center"| 12
|-
|align="center"| 4
| Link-state routing protocol (OSPF)
|align="center"| 12
|-
|align="center"| 5
| Path vector routing protocol (BGP)
|align="center"| 12
|}

=== Section 1 ===

=== Section title: ===

Networking overview

=== Topics covered in this section: ===

* Present an overview of the main concepts of networking
* Routing Algorithms
* Shortest Path
* Real-Time Network Routing

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# Explain an overview of the main concepts of networking
# What is the difference between a packet switching and circuit switching?
# List and briefly define types of routing.
# Briefly define the RTNR.
# What is the internetworking?

=== Typical questions for seminar classes (labs) within this section ===

# How can a network can be simulated in a virtual environment?
# How to create a simple switched network? What is a subnet?
# How to connect a subnet to the Internet using single IP address with basic routing and NAT?

=== Test questions for final assessment in this section ===

# What is the difference between static and dynamic routing?
# What is tunneling?
# How to connect a subnet to the Internet using single IP address with basic routing and NAT?

=== Section 2 ===

=== Section title: ===

IP version 6 and Layer 2 Basics

=== Topics covered in this section: ===

* Data link layer - introduction
* Present an overview of the IPv6
* Present the difference between the IPv4 and IPv6
* Error Control Mechanisms
* Reed-Solomon (RS) Codes
* Flow control

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# What is the difference between the IPv4 and IPv6?
# Types of ARQ Protocols?
# Briefly describe Selective Repeat.
# What is Stop and Wait algorithm?

=== Typical questions for seminar classes (labs) within this section ===

# What are the TCP and UDP protocols? How can you discover a remote machine and detect its running services?
# How can you capture and analize a network traffic?
# How can you set-up basic IPv6 network?
# How to separate a network using VLAN technology.
# How can multiple switches be used together to provide fault tolerance.
# How to set-up a link aggregation (bond interface) to provide connection with load balancing and fault tolerance.

=== Test questions for final assessment in this section ===

# How can you set-up basic IPv6 network?
# What is the Sliding Window algorithm?
# How are networks connected?
# How can multiple switches be used together to provide fault tolerance?

=== Section 3 ===

=== Section title: ===

Spanning Tree and Routing Basics

=== Topics covered in this section: ===

* An overview of the spanning tree.
* An overview of the routing algorithm.

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# What is spanning tree protocol?
# Explain how spanning tree protocol works?
# Hot to configure STP?

=== Typical questions for seminar classes (labs) within this section ===

# How to set-up a link aggregation (bond interface) to provide connection with load balancing and fault tolerance.
# How can you capture and analyze a network traffic?

=== Test questions for final assessment in this section ===

# How to elect one root bridge?
# Define designated port!
# How to configure loopguard?

=== Section 4 ===

=== Section title: ===

Link state routing protocol (OSPF)

=== Topics covered in this section: ===

* Shortest path first (SPF) forwarding
* Dijkstra’s algorithm
* Low Bandwidth Requirements
* Broadcast Networks

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# How to reduce convergence delay?
# Dijkstra’s LSR algorithm explain on example!
# Give an example of topology change
# Explain Broadcast Networks

=== Typical questions for seminar classes (labs) within this section ===

# Which interface you will select as the OSPF router ID and why?
# What is the difference between advertising all the networks VS manual advertising (per interface or per subnet)?
# Who can you check if you have a full adjacency with your router neighbor?

=== Test questions for final assessment in this section ===

# Explain Dijkstra algorithm.
# Which interface you will select as the OSPF router ID and why?
# Why every area has to be connected to area 0?

=== Section 5 ===

=== Section title: ===

Path vector routing protocol(BGP)

=== Topics covered in this section: ===

* BGP4: Inter-Domain Routing in the Internet
* BGP Messages, Attributes and Features
* Inter-domain vs Intra-domain routing
* Autonomous Systems and Gateways

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# How to reduce assign IP address and AS numbers?
# I-BGP and E-BGP explain!
# Intra-domain vs Inter-domain
# Explain RIP, OSPF?

=== Typical questions for seminar classes (labs) within this section ===

# Can your BGP peers reach your internal subnets? And can you reach their internal subnets?
# How can the OSPF Internal router know about your peer’s OSPF Internal router?
# Is it a good idea to redistribute BGP routes into the OSPF routing table?

=== Test questions for final assessment in this section ===

# Path-vector protocol, explain!
# Multi-Exit Discriminator, explain.
# Is it a good idea to redistribute BGP routes into the OSPF routing table?

=== Section 6 ===

=== Section title: ===

NAT, Proxying, traffic monitoring, and packet crafting

=== Topics covered in this section: ===

* Network address translation in the network
* Network traffic monitoring and proxying
* Packet crafting and tools

=== What forms of evaluation were used to test students’ performance in this section? ===

<div class="tabular">

<span>|a|c|</span> & '''Yes/No'''<br />
Development of individual parts of software product code & 1<br />
Homework and group projects & 1<br />
Midterm evaluation & 1<br />
Testing (written or computer based) & 1<br />
Reports & 0<br />
Essays & 0<br />
Oral polls & 0<br />
Discussions & 1<br />

</div>
=== Typical questions for ongoing performance evaluation within this section ===

# How to configure NAT rules?
# How to monitor network traffic and at which level?
# How is proxy installed and configured?
# What are the tools used for packet crafting and how do they work?

=== Typical questions for seminar classes (labs) within this section ===

# Configure NAT and analyze the traffic in the network?
# Monitor the network traffic and look for behaviors as well as pre-defined features?
# Pass the network traffic through a proxy by defining rules in the proxy
# craft network packets and automate

=== Test questions for final assessment in this section ===

# What are the pros and cons of different packet crafting tools?
# How to configure NAT with different rules?
# How to automate the packet crafting in network using different tools?
# How proxying affect the network performance?

BSc: Fundamentals of Computer Security

2022-02-01T18:38:48Z

S.seytnazarov:

= Fundamentals of Information Security =

* <span>'''Course name:'''</span> Fundamentals of Information Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 40%
|-
| Homework
|align="right"| 4%
|-
| Weekly quizzes
|align="right"| 16%
|-
| Attendance
|align="right"| 10%
|-
| Final exam
|align="right"| 30%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89.9
|-
| C. Satisfactory
|align="right"| 60-74.9
|-
| D. Poor
|align="right"| 0-59.9
|}

=== Resources and reference material ===

* '''Required textbook:''' William Stallings and Lawrie Brown, "Computer Security: Principles and Practice,“ 4th edition, Pearson, 2017.
* '''Additional textbook:''' William Stallings, "Cryptography and Network Security: Principles and Practice," 7th Edition, Pearson, 2017.

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 23
|-
|align="center"| 2
| Software and system security
|align="center"| 18
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 9
|-
|align="center"| 4
| Additional
|align="center"| 14

|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 4: Additional ===

==== Topics covered in this section ====

* Compliances and documentation in computer security
* New technologies and research areas in cyber security
* Cybercrime and forensics, incident response

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2022-01-18T10:46:47Z

S.seytnazarov: /* Resources and reference material */

= Fundamentals of Information Security =

* <span>'''Course name:'''</span> Fundamentals of Information Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Required textbook:''' William Stallings and Lawrie Brown, "Computer Security: Principles and Practice,“ 4th edition, Pearson, 2017.
* '''Additional textbook:''' William Stallings, "Cryptography and Network Security: Principles and Practice," 7th Edition, Pearson, 2017.

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 23
|-
|align="center"| 2
| Software and system security
|align="center"| 18
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 9
|-
|align="center"| 4
| Additional
|align="center"| 14

|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 4: Additional ===

==== Topics covered in this section ====

* Compliances and documentation in computer security
* New technologies and research areas in cyber security
* Cybercrime and forensics, incident response

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2022-01-18T10:46:26Z

S.seytnazarov: /* Resources and reference material */

= Fundamentals of Information Security =

* <span>'''Course name:'''</span> Fundamentals of Information Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Required textbook:''' William Stallings and Lawrie Brown, "Computer Security: Principles and Practice,“ 4th edition, Pearson, 2017.
* '''Required textbook:''' William Stallings, "Cryptography and Network Security: Principles and Practice," 7th Edition, Pearson, 2017.

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 23
|-
|align="center"| 2
| Software and system security
|align="center"| 18
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 9
|-
|align="center"| 4
| Additional
|align="center"| 14

|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 4: Additional ===

==== Topics covered in this section ====

* Compliances and documentation in computer security
* New technologies and research areas in cyber security
* Cybercrime and forensics, incident response

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2022-01-18T10:44:32Z

S.seytnazarov:

= Fundamentals of Information Security =

* <span>'''Course name:'''</span> Fundamentals of Information Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Stallings, William, and Lawrie Brown. "Computer Security: Principles and Practice, Global Edition." (2017).

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 23
|-
|align="center"| 2
| Software and system security
|align="center"| 18
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 9
|-
|align="center"| 4
| Additional
|align="center"| 14

|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 4: Additional ===

==== Topics covered in this section ====

* Compliances and documentation in computer security
* New technologies and research areas in cyber security
* Cybercrime and forensics, incident response

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc:Syllabi Table

2022-01-18T10:43:41Z

S.seytnazarov:

= Overview of the BS Program =

[https://eduwiki.innopolis.university/index.php/BSc:Syllabi_Index The detailed description of the program can be found here.]

{| class="wikitable"
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI Introduction To Programming I] [https://moodle.innopolis.university/course/view.php?id=800 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ComputerArchitecture Computer Architecture] [https://moodle.innopolis.university/course/view.php?id=786 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AlexanderTormasov Alexander Tormasov]
| 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI Mathematical Analysis I] [https://moodle.innopolis.university/course/view.php?id=801 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraI_new Analytic Geometry And Linear Algebra I] [https://moodle.innopolis.university/course/view.php?id=787 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]<br />[https://eduwiki.innopolis.university/index.php/MohammedrezaBahrami Mohammedreza Bahrami]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyI_Fall_2020 Philosophy I]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AndreyFrolov Andrey Frolov]<br />[https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesI English For Academic Purposes I] [https://moodle.innopolis.university/course/view.php?id=866 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/GeorgyGelvanovsky Georgy Gelvanovsky] <br /> [https://eduwiki.innopolis.university/index.php/RuslanSaduov Ruslan Saduov ] <br /> [https://eduwiki.innopolis.university/index.php/RababMarouf Rabab Marouf] <br /> [https://eduwiki.innopolis.university/index.php/GuzelFazlyeva Guzel Fazlyeva] <br /> [https://eduwiki.innopolis.university/index.php/EvgeniyaKruglova Evgeniya Kruglova]
| 08.12.2021
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software System Analysis and Design] [https://moodle.innopolis.university/course/view.php?id=664 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DataStructuresAlgorithmsI Data Structures Algorithms I] [https://moodle.innopolis.university/course/view.php?id=671 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisII Mathematical Analysis II] [https://moodle.innopolis.university/course/view.php?id=666 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraII Analytic Geometry And Linear Algebra II] [https://moodle.innopolis.university/course/view.php?id=668 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/YaroslavKholodov Yaroslav Kholodov]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalComputerScience Theoretical Computer Science] [https://moodle.innopolis.university/course/view.php?id=670 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ManuelMazzara Manuel Mazzara]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesII English For Academic Purposes II] [https://moodle.innopolis.university/course/view.php?id=710 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" style="text-align:left;" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ProbabilityAndStatistics Probability And Statistics] [https://moodle.innopolis.university/course/view.php?id=789 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 14.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsI Physics I] [https://moodle.innopolis.university/course/view.php?id=790 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:OperatingSystems Operating Systems] [https://moodle.innopolis.university/course/view.php?id=791 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]
| 08.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DifferentialEquations_new Differential Equations] [https://moodle.innopolis.university/course/view.php?id=792 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 22.12.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsII Physics II] [https://moodle.innopolis.university/course/view.php?id=672 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:Networks Networks] [https://moodle.innopolis.university/course/view.php?id=673 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/RasheedHussain Rasheed Hussain]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ControlTheory Control Theory] [https://moodle.innopolis.university/course/view.php?id=674 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeySavin Sergei Savin], [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToArtificialIntelligence Introduction To Artificial Intelligence] [https://moodle.innopolis.university/course/view.php?id=675 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedDatabases Advanced Databases] [https://moodle.innopolis.university/course/view.php?id=676 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design] [https://moodle.innopolis.university/course/view.php?id=802 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 11.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToMachineLearning Introduction To Machine Learning] [https://moodle.innopolis.university/course/view.php?id=803 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
| 26.11.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyII_Fall_2020 Philosophy II] [https://moodle.innopolis.university/course/view.php?id=795 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 07.12.2021 <br /> 08.12.2021 <br /> 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:Mechatronics Mechatronics] [https://moodle.innopolis.university/course/view.php?id=809 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=810 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToBigData Introduction To Big Data] [https://moodle.innopolis.university/course/view.php?id=807 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToRobotics Introduction To Robotics] [https://moodle.innopolis.university/course/view.php?id=808 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexanderKlimchik Alexander Klimchik]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SystemAndNetworkAdministration System And Network Administration] [https://moodle.innopolis.university/course/view.php?id=806 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AhsanKazmi Ahsan Kazmi]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalMechanics Theoretical Mechanics] [https://moodle.innopolis.university/course/view.php?id=805 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov] <br /> [https://eduwiki.innopolis.university/index.php/OlegBulichev Oleg Bulichev]
| 08.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DistributedAndNetworkProgramming Distributed And Network Programming] [https://moodle.innopolis.university/course/view.php?id=804 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ShinnazarSeytnazarov Shinnazar Seytnazarov]
| 12.10.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SignalsAndSystems Signals and Systems]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:CompilersConstruction Compilers Construction] [https://moodle.innopolis.university/course/view.php?id=515 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:FundamentalsofComputerSecurity Fundamentals of Information Security]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/ShinnazarSeytnazarov Shinnazar Seytnazarov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:GameTheory Game Theory] [https://moodle.innopolis.university/course/view.php?id=677 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:RoboticSystems Robotic Systems] [https://moodle.innopolis.university/course/view.php?id=714 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedCompilerConstructionAndProgramAnalysis Advanced Compiler Construction And Program Analysis]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:InformationRetrieval Information Retrieval] [https://moodle.innopolis.university/course/view.php?id=683 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/StanislavProtasov Stanislav Protasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:MechanicsAndMachines Mechanics And Machines] [https://moodle.innopolis.university/course/view.php?id=680 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DataMining Data Mining] [https://moodle.innopolis.university/course/view.php?id=678 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:LeanSoftwareDevelopment Lean Software Development] [https://moodle.innopolis.university/course/view.php?id=681 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NaturalLanguageProcessing Natural Language Processing]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NetworkAndCyberSecurity Network And Cyber Security] [https://moodle.innopolis.university/course/view.php?id=679 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillSaltanov Kirill Saltanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SensorsAndSensing Sensors And Sensing] [https://moodle.innopolis.university/course/view.php?id=684 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillPoletkin Kirill Poletkin]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchandWritingCulture Academic Research and Writing Culture 1] [https://moodle.innopolis.university/course/view.php?id=867 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/GeorgyGelvanovsky Georgy Gelvanovsky] <br /> [https://eduwiki.innopolis.university/index.php/RuslanSaduov Ruslan Saduov ] <br /> [https://eduwiki.innopolis.university/index.php/RababMarouf Rabab Marouf] <br /> [https://eduwiki.innopolis.university/index.php/GuzelFazlyeva Guzel Fazlyeva] <br /> [https://eduwiki.innopolis.university/index.php/OksanaZhirosh Oksana Zhirosh]
| 08.12.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToComputerVision Introduction To Computer Vision] [https://moodle.innopolis.university/course/view.php?id=812 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ImadBekkouch Imad Bekkouch]
| 09.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DevOpsEngineering DevOps Engineering] [https://moodle.innopolis.university/course/view.php?id=813 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/PaoloCiancarini Paolo Ciancarini]
| 07.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticalMachineLearningDeepLearning Practical Machine Learning And Deep Learning] [https://moodle.innopolis.university/course/view.php?id=811 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
| 16.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SecureSystemDevelopment Secure System Development]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=814 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
|
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 4]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanAIInteractionDesign Human-AI Interaction Design]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:StatisticalTechniquesForDataScience Statistical Techniques For Data Science] [https://moodle.innopolis.university/course/view.php?id=692 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareQualityandReliability Software Quality And Reliability] [https://moodle.innopolis.university/course/view.php?id=688 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AndreySadovykh Andrey Sadovykh]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchAndWritingCulture Academic Research and Writing Culture 2] [https://moodle.innopolis.university/course/view.php?id=712 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Thesis - Final
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanitiesElectives Humanities Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|}

BSc: Fundamentals of Computer Security

2022-01-12T20:38:14Z

S.seytnazarov:

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Stallings, William, and Lawrie Brown. "Computer Security: Principles and Practice, Global Edition." (2017).

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 23
|-
|align="center"| 2
| Software and system security
|align="center"| 18
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 9
|-
|align="center"| 4
| Additional
|align="center"| 14

|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 4: Additional ===

==== Topics covered in this section ====

* Compliances and documentation in computer security
* New technologies and research areas in cyber security
* Cybercrime and forensics, incident response

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2022-01-12T20:12:12Z

S.seytnazarov: /* Course Sections */

BSc: Fundamentals of Computer Security

2022-01-12T19:54:42Z

S.seytnazarov:

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* User authentication and authorization
* Database and data center security
* Reverse engineering and malicious software
* Buffer overflow and software security
* OS security
* Symmetric encryption
* Public-key cryptography

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Stallings, William, and Lawrie Brown. "Computer Security: Principles and Practice, Global Edition." (2017).

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 36
|-
|align="center"| 2
| Software and system security
|align="center"| 16
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 12
|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Introduction to computer security
* User authentication and authorization
* Database and data center security
* Network security of data center
* Reverse engineering and malicious software

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and briefly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow and software security
* OS security
* Guest lecture from industry

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2021-12-04T14:41:57Z

S.seytnazarov:

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Stallings, William, and Lawrie Brown. "Computer Security: Principles and Practice, Global Edition." (2017).

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 36
|-
|align="center"| 2
| Software and system security
|align="center"| 16
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 12
|}

</div>
=== Section 1: Computer security technology and principles ===

==== Topics covered in this section ====

* Overview
* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and breifly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow
* Software security
* Operating system security
* Cloud and IoT security

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2021-10-19T23:01:11Z

S.seytnazarov: /* Course characteristics */

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

=== What is the purpose of this course? ===

The purpose of this course is to teach the students the important aspects of cryptography, authentication, access control, DoS attacks, intrusion detection, etc. The students will learn major types of attacks and methods of protection from them.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Message and user authentication
* Encryption algorithms
* Authorization and access control mechanisms
* Different types of attacks
* Firewalls and intrusion detection methods

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* The importance of authentication and authentication protocols
* Encryption algorithms used for authentication and message integrity
* The importance of authorization and access control, different protocols
* Major types of attacks and methods of protection from them
* Importance of intrusion detection and firewalls

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Authentication protocols
* Encryption techniques and algorithms
* Well-known access control techniques
* Mitigate the DoS attacks
* Intrusion detection algorithms
* Using firewalls

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Stallings, William, and Lawrie Brown. "Computer Security: Principles and Practice, Global Edition." (2017).

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 36
|-
|align="center"| 2
| Software and system security
|align="center"| 16
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 12
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ===

==== Topics covered in this section ====

* Overview
* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and breifly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow
* Software security
* Operating system security
* Cloud and IoT security

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2021-10-19T22:36:48Z

S.seytnazarov: /* Key concepts of the class */

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

=== What is the purpose of this course? ===

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

*

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

*

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

*

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:'''

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 36
|-
|align="center"| 2
| Software and system security
|align="center"| 16
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 12
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ===

==== Topics covered in this section ====

* Overview
* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and breifly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow
* Software security
* Operating system security
* Cloud and IoT security

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2021-10-19T22:31:20Z

S.seytnazarov:

= Fundamentals of Computer Security =

* <span>'''Course name:'''</span> Fundamentals of Computer Security
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

*

=== What is the purpose of this course? ===

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

*

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

*

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

*

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:'''

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Computer security technology and principles
|align="center"| 36
|-
|align="center"| 2
| Software and system security
|align="center"| 16
|-
|align="center"| 3
| Cryptographic algorithms
|align="center"| 12
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ===

==== Topics covered in this section ====

* Overview
* Cryptographic tools
* User authentication
* Access control
* Database and data center security
* Malicious software
* Denial-of-service attacks
* Intrusion detection
* Firewalls and intrusion prevention systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is meant by the CIA triad?
# What is the difference between data integrity and system integrity?
# How is cryptanalysis different from brute-force attack?
# List and briefly explain the different approaches to attacking a symmetric encryption scheme.
# In general terms, what are four means of authenticating a user’s identity?
# What is a Trojan horse attack?
# What is the difference between authentication and authorization?
# How does RBAC relate to DAC and MAC?
# Define the terms database, database management system, and query language.
# What is a relational database and what are its principal ingredients?
# What is an SQL injection attack? What are the implications of an SQL injection attack?
# List the categories for grouping different types of SQLi attacks.
# Why is RBAC considered fit for database access control?
# What are three broad mechanisms that malware can use to propagate?
# What is a blended attack?
# Define a denial-of-service (DoS) attack
# State the difference between a SYN flooding attack and a SYN spoofing attack.
# What is the goal of an HTTP flood attack?
# What is a poison packet attack? Give two examples of such an attack.
# How are intruders classified according to skill level?
# List and breifly describe the classifications of intrusion detection systems based on the source and the type of data analyzed.

==== Typical questions for seminar classes (labs) within this section ====

# Consider the given general code for allowing access to a resource: a) Explain the security flaw in this program, b) Rewrite the code to avoid the flaw
# Develop an attack tree for gaining access to the contents of a physical safe
# Typically, in practice, the length of the message is greater than the block size of the encryption algorithm. The simplest approach to handle such encryption is known as electronic codebook (ECB) mode. Explain this mode. Mention a scenario where it cannot be applied. Explain briefly why it is not a secure mode of encryption
# Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Show the decryption equation.
# Explain the suitability or unsuitability of the given passwords
# Assume that Personal Identification Numbers (PINs) are formed by nine-digit combinations of numbers 0 to 9. Assume that an adversary is able to attempt three PINs per second.
## Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct PIN?
## Assuming feedback to the adversary flagging an error as each incorrect digit is entered, what is the expected time to discover the correct PIN?
# Assume an application requires access control policies based on the applicant’s age and the type of funding to be provided. Using an ABAC approach, write policy rules for each of the following scenarios:
## If the applicant’s age is more than 35, only “Research Grants (RG)” can be provided.
## If the applicant’s age is less than or equal to 35, both “RG and Travel Grants (TG)” can be provided.
# Assume a system with K subject attributes, M object attributes and Range () denotes the range of possible values that each attribute can take. What are the number of roles and permissions required for an RBAC model? What is the problem with this approach if additional attributes are added?
# Consider a simplified database for an organization that includes information of several departments (identity, name, manager, number of employees) and of managers and employees of the respective departments. Suggest a relational database for efficiently managing this information
# Users hulkhogan and undertaker do not have the SELECT access right to the Inventory table and the Item table. These tables were created by and are owned by user bruno-s. Write the SQL commands that would enable bruno-s to grant SELECT access to these tables to hulkhogan and undertaker.
# Consider the given fragment of code. What type of malware is this?
# Consider the given fragment embedded in a webpage. What type of malicious software is this?
# In order to implement a classic DoS flood attack, the attacker must generate a sufficiently large volume of packets to exceed the capacity of the link to the target organization. Consider an attack using ICMP echo request (ping) packets that are 100 bytes in size (ignoring framing overhead). How many of these packets per second must the attacker send to flood a target organization using a 8-Mbps link? How many per second if the packets are 1000 bytes in size? Or 1460 bytes?
# It is discussed that an amplification attack, which is a variant of reflection attack, can be launched by using any type of a suitable UDP service, such as the echo service. However, TCP services cannot be used in this attack. Why?
# Consider the first step of the common attack methodology we describe, which is to gather publicly available information on possible targets. What types of information could be used? What does this use suggest to you about the content and detail of such information? How does this correlate with the organization’s business and legal requirements? How do you reconcile these conflicting demands?
# As was mentioned in this chapter, the application gateway does not permit an end-toend TCP connection; rather, it sets up two TCP connections, one between itself and a TCP user on an inner host and one between itself and a TCP user on an outside host. The disadvantage of this approach is the additional processing overhead on each connection since the gateway must examine and forward all traffic in both directions. Describe at least one more limitation of this approach which is not discussed.
# Given table shows a sample of a packet filter firewall ruleset for an imaginary network of IP address that range from 192.168.1.0 to 192.168.1.254. Describe the effect of each rule.

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 2: Software and system security ===

==== Topics covered in this section ====

* Buffer overflow
* Software security
* Operating system security
* Cloud and IoT security

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Define buffer overflow.
# Define an off-by-one attack.
# Define an injection attack. List some examples of injection attacks. What are the general circumstances in which injection attacks are found?
# State the similarities and differences between command injection and SQL injection attacks
# What are the basic steps needed in the process of securing a system?
# State different types of full virtualization with their security requirements.
# List five essential characteristics of cloud computing.
# List and briefly define three cloud service models.
# Briefly explain the most prominent deployment models for cloud computing.
# Describe some of the main cloud-specific security threats.

==== Typical questions for seminar classes (labs) within this section ====

# Investigate each of the unsafe standard C library functions shown in the figure using the UNIX man pages or any C programming text, and determine a safer alternative to use.
# Investigate the use of a replacement standard C string library, such as Libsafe, bstring, vstr, or other. Determine how significant the required code changes are, if any, to use the chosen library.
# Investigate the issues that arise while using sequence number as both identifier and authenticator of packets. Identify the root cause of the problem.
# Investigate the various types of cross-site scripting (XSS) attacks. How can such attacks be prevented?
# How can we use the TCP Wrappers and tcpd daemon to achieve secure remote control access? What if the network servers are heavily loaded?
# Why is it important to secure the boot process? Is it required to limit which media the system must boot from?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

=== Section 3: Cryptographic algorithms ===

==== Topics covered in this section ====

* Symmetric encryption and message confidentiality
* Public key cryptography and message authentication

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are different types of cryptanalysis attacks?
# Why do some block cipher modes of operation only use encryption while others use both encryption and decryption?
# In the context of a hash function, what is a compression function?
# Briefly explain Diffie-Hellman key exchange.

==== Typical questions for seminar classes (labs) within this section ====

# Suppose that your organization wants you to ensure the security of its data while the data is in transit. Which one out of stream cipher and block cipher would you select and why?
# Can we perform encryption operations in parallel on multiple blocks of plaintext in any of the five modes? How about decryption?
# Consider a 32-bit hash function defined as the concatenation of two 16-bit functions: XOR and RXOR, defined as “two simple hash functions.”
## Will this checksum detect all errors caused by an odd number of error bits? Explain.
## Will this checksum detect all errors caused by an even number of error bits? If not, characterize the error patterns that will cause the checksum to fail.
## Comment on the effectiveness of this function for use as a hash function for authentication
# It is possible to use a hash function to construct a block cipher with a structure similar to DES. Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it possible?

==== Test questions for final assessment in this section ====

Questions from previous two subsections can be used.

BSc: Fundamentals of Computer Security

2021-10-19T20:48:09Z

S.seytnazarov: Created page with "= Fundamentals of Computer Security = * <span>'''Course name:'''</span> Fundamentals of Computer Security * <span>'''Course number:'''</span> XYZ * <span>'''Knowledge area:''..."

BSc:Syllabi Table

2021-10-19T20:21:22Z

S.seytnazarov:

= Overview of the BS Program =

[https://eduwiki.innopolis.university/index.php/BSc:Syllabi_Index The detailed description of the program can be found here.]

{| class="wikitable"
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI Introduction To Programming I] [https://moodle.innopolis.university/course/view.php?id=800 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ComputerArchitecture Computer Architecture] [https://moodle.innopolis.university/course/view.php?id=786 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AlexanderTormasov Alexander Tormasov]
| 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI Mathematical Analysis I] [https://moodle.innopolis.university/course/view.php?id=801 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraI_new Analytic Geometry And Linear Algebra I] [https://moodle.innopolis.university/course/view.php?id=787 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/MohammedrezaBahrami Mohammedreza Bahrami]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyI_Fall_2020 Philosophy I]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AndreyFrolov Andrey Frolov]<br />[https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesI English For Academic Purposes I] [https://moodle.innopolis.university/course/view.php?id=866 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 08.12.2021
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingII Introduction To Programming II] [https://moodle.innopolis.university/course/view.php?id=664 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DataStructuresAlgorithmsI Data Structures Algorithms I] [https://moodle.innopolis.university/course/view.php?id=671 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisII Mathematical Analysis II] [https://moodle.innopolis.university/course/view.php?id=666 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraII Analytic Geometry And Linear Algebra II] [https://moodle.innopolis.university/course/view.php?id=668 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/YaroslavKholodov Yaroslav Kholodov]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalComputerScience Theoretical Computer Science] [https://moodle.innopolis.university/course/view.php?id=670 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ManuelMazzara Manuel Mazzara]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesII English For Academic Purposes II] [https://moodle.innopolis.university/course/view.php?id=710 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" style="text-align:left;" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ProbabilityAndStatistics Probability And Statistics] [https://moodle.innopolis.university/course/view.php?id=789 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 14.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsI Physics I] [https://moodle.innopolis.university/course/view.php?id=790 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:OperatingSystems Operating Systems] [https://moodle.innopolis.university/course/view.php?id=791 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]
| 08.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DifferentialEquations_new Differential Equations] [https://moodle.innopolis.university/course/view.php?id=792 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 22.12.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsII Physics II] [https://moodle.innopolis.university/course/view.php?id=672 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:Networks Networks] [https://moodle.innopolis.university/course/view.php?id=673 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/RasheedHussain Rasheed Hussain]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ControlTheory Control Theory] [https://moodle.innopolis.university/course/view.php?id=674 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToArtificialIntelligence Introduction To Artificial Intelligence] [https://moodle.innopolis.university/course/view.php?id=675 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedDatabases Advanced Databases] [https://moodle.innopolis.university/course/view.php?id=676 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design] [https://moodle.innopolis.university/course/view.php?id=802 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 11.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToMachineLearning Introduction To Machine Learning] [https://moodle.innopolis.university/course/view.php?id=803 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
| 26.11.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyII_Fall_2020 Philosophy II] [https://moodle.innopolis.university/course/view.php?id=795 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 07.12.2021 <br /> 08.12.2021 <br /> 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:Mechatronics Mechatronics] [https://moodle.innopolis.university/course/view.php?id=809 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=810 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToBigData Introduction To Big Data] [https://moodle.innopolis.university/course/view.php?id=807 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToRobotics Introduction To Robotics] [https://moodle.innopolis.university/course/view.php?id=808 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexanderKlimchik Alexander Klimchik]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SystemAndNetworkAdministration System And Network Administration] [https://moodle.innopolis.university/course/view.php?id=806 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AhsanKazmi Ahsan Kazmi]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalMechanics Theoretical Mechanics] [https://moodle.innopolis.university/course/view.php?id=805 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov] <br /> [https://eduwiki.innopolis.university/index.php/OlegBulichev Oleg Bulichev]
| 08.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DistributedAndNetworkProgramming Distributed And Network Programming] [https://moodle.innopolis.university/course/view.php?id=804 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ShinnazarSeytnazarov Shinnazar Seytnazarov]
| 12.10.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SignalsAndSystems Signals and Systems]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:CompilersConstruction Compilers Construction] [https://moodle.innopolis.university/course/view.php?id=515 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:FundamentalsofComputerSecurity Fundamentals of Computer Security]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/ShinnazarSeytnazarov Shinnazar Seytnazarov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:GameTheory Game Theory] [https://moodle.innopolis.university/course/view.php?id=677 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:RoboticSystems Robotic Systems] [https://moodle.innopolis.university/course/view.php?id=714 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedCompilerConstructionAndProgramAnalysis Advanced Compiler Construction And Program Analysis]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:InformationRetrieval Information Retrieval] [https://moodle.innopolis.university/course/view.php?id=683 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/StanislavProtasov Stanislav Protasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:MechanicsAndMachines Mechanics And Machines] [https://moodle.innopolis.university/course/view.php?id=680 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DataMining Data Mining] [https://moodle.innopolis.university/course/view.php?id=678 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:LeanSoftwareDevelopment Lean Software Development] [https://moodle.innopolis.university/course/view.php?id=681 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NaturalLanguageProcessing Natural Language Processing]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NetworkAndCyberSecurity Network And Cyber Security] [https://moodle.innopolis.university/course/view.php?id=679 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillSaltanov Kirill Saltanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SensorsAndSensing Sensors And Sensing] [https://moodle.innopolis.university/course/view.php?id=684 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillPoletkin Kirill Poletkin]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchandWritingCulture Academic Research and Writing Culture 1] [https://moodle.innopolis.university/course/view.php?id=867 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 08.12.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToComputerVision Introduction To Computer Vision] [https://moodle.innopolis.university/course/view.php?id=812 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ImadBekkouch Imad Bekkouch]
| 09.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DevOpsEngineering DevOps Engineering] [https://moodle.innopolis.university/course/view.php?id=813 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/PaoloCiancarini Paolo Ciancarini]
| 07.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticalMachineLearningDeepLearning Practical Machine Learning And Deep Learning] [https://moodle.innopolis.university/course/view.php?id=811 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
| 16.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SecureSystemDevelopment Secure System Development]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=814 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
|
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 4]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanAIInteractionDesign Human-AI Interaction Design]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:StatisticalTechniquesForDataScience Statistical Techniques For Data Science] [https://moodle.innopolis.university/course/view.php?id=692 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareQualityandReliability Software Quality And Reliability] [https://moodle.innopolis.university/course/view.php?id=688 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AndreySadovykh Andrey Sadovykh]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchAndWritingCulture Academic Research and Writing Culture 2] [https://moodle.innopolis.university/course/view.php?id=712 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Thesis - Final
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanitiesElectives Humanities Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|}

BSc: Distributed And Network Programming

2021-10-19T20:11:15Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ===

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ===

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ===

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.

=== Section 4: Fault tolerance and security in distributed systems ===

==== Topics covered in this section ====

* Intro to fault tolerance: Failure models, Failure masking by redundancy
* Process resilience: process groups, process replication, consensus in faulty systems, failure detection
* Reliable group communication: atomic multicast,
* Distributed commit
* Recovery: checkpointing
* Intro to security: threats, design issues, cryptography
* Secure channels: authentication, message integrity and confidentiality, secure group communication
* Access control: general issues, firewalls, secure mobile code, denial of service
* Secure naming
* Security management: Key management, secure group management, authorization management

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Discuss the failure models
# Discuss different failure masking techniques by redundancy
# What is k-fault tolerant group?
# What is general model of failure detection?
# Explain basic reliable multicasting
# Explain what is authentication
# Explain what are message confidentiality and integrity

==== Typical questions for seminar classes (labs) within this section ====

# Same as above

==== Test questions for final assessment in this section ====

# Same as above

BSc: Distributed And Network Programming

2021-10-19T20:01:15Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.

=== Section 4: Fault tolerance and security in distributed systems ===

==== Topics covered in this section ====

* Intro to fault tolerance: Failure models, Failure masking by redundancy
* Process resilience: process groups, process replication, consensus in faulty systems, failure detection
* Reliable group communication: atomic multicast,
* Distributed commit
* Recovery: checkpointing
* Intro to security: threats, design issues, cryptography
* Secure channels: authentication, message integrity and confidentiality, secure group communication
* Access control: general issues, firewalls, secure mobile code, denial of service
* Secure naming
* Security management: Key management, secure group management, authorization management

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Discuss the failure models
# Discuss different failure masking techniques by redundancy
# What is k-fault tolerant group?
# What is general model of failure detection?
# Explain basic reliable multicasting
# Explain what is authentication
# Explain what are message confidentiality and integrity

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.

BSc:Syllabi Table

2021-10-19T19:54:29Z

S.seytnazarov:

= Overview of the BS Program =

[https://eduwiki.innopolis.university/index.php/BSc:Syllabi_Index The detailed description of the program can be found here.]

{| class="wikitable"
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI Introduction To Programming I] [https://moodle.innopolis.university/course/view.php?id=800 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ComputerArchitecture Computer Architecture] [https://moodle.innopolis.university/course/view.php?id=786 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AlexanderTormasov Alexander Tormasov]
| 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI Mathematical Analysis I] [https://moodle.innopolis.university/course/view.php?id=801 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraI_new Analytic Geometry And Linear Algebra I] [https://moodle.innopolis.university/course/view.php?id=787 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/MohammedrezaBahrami Mohammedreza Bahrami]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyI_Fall_2020 Philosophy I]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AndreyFrolov Andrey Frolov]<br />[https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesI English For Academic Purposes I] [https://moodle.innopolis.university/course/view.php?id=866 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 08.12.2021
|- style="font-weight:bold; text-align:center;"
! colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 1, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingII Introduction To Programming II] [https://moodle.innopolis.university/course/view.php?id=664 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DataStructuresAlgorithmsI Data Structures Algorithms I] [https://moodle.innopolis.university/course/view.php?id=671 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisII Mathematical Analysis II] [https://moodle.innopolis.university/course/view.php?id=666 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AnalyticGeometryAndLinearAlgebraII Analytic Geometry And Linear Algebra II] [https://moodle.innopolis.university/course/view.php?id=668 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/YaroslavKholodov Yaroslav Kholodov]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalComputerScience Theoretical Computer Science] [https://moodle.innopolis.university/course/view.php?id=670 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ManuelMazzara Manuel Mazzara]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:EnglishForAcademicPurposesII English For Academic Purposes II] [https://moodle.innopolis.university/course/view.php?id=710 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" style="text-align:left;" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ProbabilityAndStatistics Probability And Statistics] [https://moodle.innopolis.university/course/view.php?id=789 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/SergeyGorodetsky Sergey Gorodetsky]
| 14.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsI Physics I] [https://moodle.innopolis.university/course/view.php?id=790 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:OperatingSystems Operating Systems] [https://moodle.innopolis.university/course/view.php?id=791 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]
| 08.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:DifferentialEquations_new Differential Equations] [https://moodle.innopolis.university/course/view.php?id=792 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
| 07.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 22.12.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 2, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:PhysicsII Physics II] [https://moodle.innopolis.university/course/view.php?id=672 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:Networks Networks] [https://moodle.innopolis.university/course/view.php?id=673 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/RasheedHussain Rasheed Hussain]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:ControlTheory Control Theory] [https://moodle.innopolis.university/course/view.php?id=674 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToArtificialIntelligence Introduction To Artificial Intelligence] [https://moodle.innopolis.university/course/view.php?id=675 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B; text-align:left;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedDatabases Advanced Databases] [https://moodle.innopolis.university/course/view.php?id=676 (Moodle)]
| colspan="5" style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareSystemsDesign Software Systems Design] [https://moodle.innopolis.university/course/view.php?id=802 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
| 11.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToMachineLearning Introduction To Machine Learning] [https://moodle.innopolis.university/course/view.php?id=803 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/AdilKhan Adil Khan]
| 26.11.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PhilosophyII_Fall_2020 Philosophy II] [https://moodle.innopolis.university/course/view.php?id=795 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/MirkoFarina Mirko Farina]
| 07.12.2021 <br /> 08.12.2021 <br /> 09.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:Mechatronics Mechatronics] [https://moodle.innopolis.university/course/view.php?id=809 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=810 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToBigData Introduction To Big Data] [https://moodle.innopolis.university/course/view.php?id=807 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
| 13.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToRobotics Introduction To Robotics] [https://moodle.innopolis.university/course/view.php?id=808 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexanderKlimchik Alexander Klimchik]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SystemAndNetworkAdministration System And Network Administration] [https://moodle.innopolis.university/course/view.php?id=806 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AhsanKazmi Ahsan Kazmi]
| 15.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TheoreticalMechanics Theoretical Mechanics] [https://moodle.innopolis.university/course/view.php?id=805 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov] <br /> [https://eduwiki.innopolis.university/index.php/OlegBulichev Oleg Bulichev]
| 08.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DistributedAndNetworkProgramming Distributed And Network Programming] [https://moodle.innopolis.university/course/view.php?id=804 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ShinnazarSeytnazarov Shinnazar Seytnazarov]
| 12.10.2021
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 3, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SignalsAndSystems Signals and Systems]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/NikolayShilov Nikolay Shilov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:CompilersConstruction Compilers Construction] [https://moodle.innopolis.university/course/view.php?id=515 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/EvgeniiZouev Evgenii Zouev]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:FundamentalofInformationSecurity Fundamental of Information Security]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlmaOracevic Alma Oracevic]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:GameTheory Game Theory] [https://moodle.innopolis.university/course/view.php?id=677 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/JosephBrown Joseph Brown]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:RoboticSystems Robotic Systems] [https://moodle.innopolis.university/course/view.php?id=714 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/IgorGaponov Igor Gaponov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AdvancedCompilerConstructionAndProgramAnalysis Advanced Compiler Construction And Program Analysis]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/NikolayKudasov Nikolay Kudasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:InformationRetrieval Information Retrieval] [https://moodle.innopolis.university/course/view.php?id=683 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/StanislavProtasov Stanislav Protasov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:MechanicsAndMachines Mechanics And Machines] [https://moodle.innopolis.university/course/view.php?id=680 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AlexandrMaloletov Alexandr Maloletov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DataMining Data Mining] [https://moodle.innopolis.university/course/view.php?id=678 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/LuizAraujo Luiz Araujo]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:LeanSoftwareDevelopment Lean Software Development] [https://moodle.innopolis.university/course/view.php?id=681 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/GiancarloSucci Giancarlo Succi]<br />
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NaturalLanguageProcessing Natural Language Processing]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:NetworkAndCyberSecurity Network And Cyber Security] [https://moodle.innopolis.university/course/view.php?id=679 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillSaltanov Kirill Saltanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SensorsAndSensing Sensors And Sensing] [https://moodle.innopolis.university/course/view.php?id=684 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/KirillPoletkin Kirill Poletkin]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Fall Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Date of the Exam
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchandWritingCulture Academic Research and Writing Culture 1] [https://moodle.innopolis.university/course/view.php?id=867 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
| 08.12.2021 <br /> - deadline for submission
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToComputerVision Introduction To Computer Vision] [https://moodle.innopolis.university/course/view.php?id=812 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/ImadBekkouch Imad Bekkouch]
| 09.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:DevOpsEngineering DevOps Engineering] [https://moodle.innopolis.university/course/view.php?id=813 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/PaoloCiancarini Paolo Ciancarini]
| 07.10.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 1]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticalMachineLearningDeepLearning Practical Machine Learning And Deep Learning] [https://moodle.innopolis.university/course/view.php?id=811 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
| 16.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SecureSystemDevelopment Secure System Development]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:ProgrammingParadigms Programming Paradigms] [https://moodle.innopolis.university/course/view.php?id=814 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
|
| 10.12.2021
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:TechnicalElective Technical Elective 4]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="font-weight:bold; text-align:center;"
| colspan="7" style="vertical-align:middle; background-color:#EAECF0; color:#202122;" | Year 4, Spring Semester
|-
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Subject
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | DS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | CS
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | R
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | SD
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | AAI
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122; text-align:center;" | Instructor(s)
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanAIInteractionDesign Human-AI Interaction Design]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:StatisticalTechniquesForDataScience Statistical Techniques For Data Science] [https://moodle.innopolis.university/course/view.php?id=692 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/VladimirIvanov Vladimir Ivanov]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:SoftwareQualityandReliability Software Quality And Reliability] [https://moodle.innopolis.university/course/view.php?id=688 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | No
| [https://eduwiki.innopolis.university/index.php/AndreySadovykh Andrey Sadovykh]
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:AcademicResearchAndWritingCulture Academic Research and Writing Culture 2] [https://moodle.innopolis.university/course/view.php?id=712 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:PracticumProjects Practicum Project 3]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Thesis - Final
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:History History] [https://moodle.innopolis.university/course/view.php?id=869 (Moodle)]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
|
|- style="text-align:center;"
| style="background-color:#F8F9FA; color:#36B;" | [https://eduwiki.innopolis.university/index.php/BSc:HumanitiesElectives Humanities Elective 2]
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| style="vertical-align:middle; background-color:#F8F9FA; color:#202122;" | Yes
| colspan="2" |
|}

BSc: Distributed And Network Programming

2021-10-01T14:06:41Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.

=== Section 4: Fault tolerance and security in distributed systems ===

==== Topics covered in this section ====

* Intro to fault tolerance: Failure models, Failure masking by redundancy
* Process resilience: process groups, process replication, consensus in faulty systems, failure detection
* Reliable group communication: atomic multicast,
* Distributed commit
* Recovery: checkpointing
* Intro to security: threats, design issues, cryptography
* Secure channels: authentication, message integrity and confidentiality, secure group communication
* Access control: general issues, firewalls, secure mobile code, denial of service
* Secure naming
* Security management: Key management, secure group management, authorization management

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Discuss the failure models
# Discuss different failure masking techniques by redundancy
# What is k-fault tolerant group?
# What is general model of failure detection?
# Explain basic reliable multicasting
# Explain what is authentication
# Explain what are message confidentiality and integrity

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.
== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-24T19:29:47Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.

=== Section 4: Fault tolerance and security in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

# Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
# Explain how Bully algorithm for election works
# Explain how Ring algorithm for election works
# Explain the centralized (permission-based) method of mutual exclusion

==== Test questions for final assessment in this section ====

# Discuss NTP and Berkeley protocols for synchronization and explain their key difference
# Discuss permission-based and token-based solution for mutual exclusion.
# Discuss content replication: permanent, server-initiated, and client-initiated replicas.
# Explain the Primary-backup protocol, its advantages and disadvantages.
== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-24T18:28:45Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Consistency models
* Replica management
* Consistency protocols

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How NTP protocol works?
# How Berkeley protocol works?
# Discuss the mutual exclusion algorithms.
# Discuss the permanent and server-initiated replicas and their difference
# Explain the Primary-backup protocol.

==== Typical questions for seminar classes (labs) within this section ====

#

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-22T12:33:29Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2: Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3: Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Data consistency models

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured decentralized architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# What are the advantages of using RPC over using the low-level socket programming?
# Discuss the p2p architectures, how structured ones differ from unstructured ones?

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-22T11:16:35Z

S.seytnazarov:

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1 ===

==== Section title: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2 ===

==== Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# What are the advantages of using RPC over using the low-level socket programming?
# Discuss the p2p system

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

=== Section 3 ===

==== Coordination, consistency, and replication in distributed systems ====

==== Topics covered in this section ====

* Clock synchronization algorithms (NTP, Berkeley)
* Logical clock (Lamport clocks)
* Mutual exclusion algorithms: permission-based, token-based
* Election algorithms: Bully, Ring
* Data consistency models

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# What are the advantages of using RPC over using the low-level socket programming?
# Discuss the p2p system

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?
# Discuss the decentralized architecture: structured and unstructured p2p systems.

== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-22T09:15:49Z

S.seytnazarov: /* Course Sections */

= Distributed and Network Programming =

* <span>'''Course name:'''</span> Distributed and Network Programming
* <span>'''Course number:'''</span> XYZ
* <span>'''Knowledge area:'''</span> xxx

== Course characteristics ==

=== Key concepts of the class ===

* Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
* Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.

=== What is the purpose of this course? ===

Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define

* Concepts of network programming
* Different distributed system architectures
* Various synchronization and coordination techniques
* Different consistency models and replication methods
* Approaches to achieve fault tolerance and security in distributed systems

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples)

* Difference between different transport protocols, when and why one is preferred over another
* Difference between different distributed system architectures (centralized, decentralized, and hybrid)
* How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
* How a new leader is elected in peer-to-peer systems (bully, ring)
* How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
* Some methods to achieve the fault tolerance in distributed systems

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply

* Building a custom application protocols on top of the existing transport protocols
* Writing multithreaded server and client apps with sockets
* Using RPC for inter-process communication: command execution, file transfer
* Building peer-to-peer systems with distributed protocol such as Chord
* Building fault-tolerant systems with failure detection and leader election

=== Course evaluation ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grade breakdown
!align="center"| '''Component'''
! '''Points'''
|-
| Laboratory assignments
|align="right"| 55%
|-
| Final exam
|align="right"| 35%
|-
| Attendance
|align="right"| 10%
|}
'''Important:''' In order to successfully finish the course, the student is required to score at least 50% in final exam.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="right"| 90-100
|-
| B. Good
|align="right"| 75-89
|-
| C. Satisfactory
|align="right"| 60-74
|-
| D. Poor
|align="right"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Maarten Van Steen, and Andrew S. Tanenbaum. ''Distributed systems'' (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
* '''Reference:''' George F. Coulouris, Jean Dollimore, and Tim Kindberg. ''Distributed systems: concepts and design'' (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
* '''Reference:''' Sukumar Ghosh. ''Distributed systems: an algorithmic approach'' (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html

== Course Sections ==

The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Introduction to subject, computer networks basics, transport layer protocols, and socket programming
|align="center"| 12
|-
|align="center"| 2
| Multithreaded socket programming, remote procedure calls, and distributed system architecture
|align="center"| 24
|-
|align="center"| 3
| Coordination, consistency, and replication in distributed systems
|align="center"| 24
|-
|align="center"| 4
| Fault tolerance and security in distributed systems
|align="center"| 30
|}

</div>
=== Section 1 ===

==== Section title: Introduction to subject, computer networks basics, transport layer protocols, and socket programming ====

==== Topics covered in this section ====

* General introduction to the course
* Computer networks basic
* Socket programming
* UDP socket programming
* TCP socket programming

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the distributed systems?
# Give an example of distributed systems.
# What are the advantages of layered architecture?
# What are the roles of transport protocols?
# How the TCP and UDP differ from each other? When one is preferred over the other?
# What is socket programming?
# How socket programming is different for UDP and TCP?

==== Typical questions for seminar classes (labs) within this section ====

# Write a simple UDP/TCP client-server echo program
# Write a simple chatting program using UDP/TCP sockets
# Given the simple echo server program, apply socket timeouts and catch timeout exceptions
# Write a UDP-based reliable file transfer protocol
# Write a program that parallelly executes the CPU-bound tasks using multiple processes

==== Test questions for final assessment in this section ====

# Describe an advantage of layered architecture?
# Describe the differences between TCP and UDP protocols?
# Provide examples when using UDP can be more reasonable than TCP?
# Describe how UDP and TCP socket programming differ from each other?

=== Section 2 ===

==== Multithreaded socket programming, RPCs, and distributed system architecture ====

==== Topics covered in this section ====

* Multithreading and multithreaded socket programming
* Remote procedure calls (RPCs)
* Distributed system architectures

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# How the threads differ from processes?
# What are the I/O and CPU-bound tasks?
# For what kind of tasks, using threads is preferred than using processes?
# What is a remote procedure call?
# What are some well-known distributed system architectures?
# Discuss the structured and unstructured architectures.

==== Typical questions for seminar classes (labs) within this section ====

# You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
# You need to send multiple requests to a server and receive responses. Assume there is some delay for packets to travel between your computer and the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
#
# Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
# What are the advantages of using RPC over using the low-level socket programming?

==== Test questions for final assessment in this section ====

# Discuss the differences between the threads and processes.
# What is the Race condition?
# Discuss the ways to protect the shared data from the race condition
# You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
# Discuss the RPC and its advantages over using the low-level socket programming?

== Administrative details ==

* <span>'''Faculty:'''</span> Computer Science and Engineering
* <span>'''Year of instruction:'''</span> 4th year of BS
* <span>'''Semester of instruction:'''</span> 2nd semester
* <span>'''No. of Credits:'''</span> 4 ECTS
* <span>'''Total workload on average:'''</span> 144 hours overall
* <span>'''Frontal lecture hours:'''</span> 2 per week
* <span>'''Frontal tutorial hours:'''</span> 2 per week
* <span>'''Lab hours:'''</span> 2 per week
* <span>'''Individual lab hours:'''</span> 0
* <span>'''Frequency:'''</span> weekly throughout the semester
* <span>'''Grading mode:'''</span> letters: A, B, C, D

== Prerequisites ==

* Introduction to Programming I
* Introduction to Programming II
* Operating Systems
* Networks

== Course outline ==

This course focuses on the programming aspects of computer networks. Students will understand the current trends in communication protocols, socket programming and interprocess communication. Network programming will be covered for what concerns both wired networks and wireless networks.

== Expected learning outcomes ==

* Understanding issues in concurrent network applications
* Understand issues in implementing client/server systems using distributed programming techniques
* Implementing multithreaded client/server applications

== Expected acquired core competences ==

* Network programming
* Socket programming
* Client/Server applications
* Peer to peer network programming

== Textbook ==

*
*

== Reference material ==

* Lecturing and lab slides and material will be provided
* Several resources are available online and will be pointed during the course

== Required computer resources ==

Students should have laptops.

BSc: Distributed And Network Programming

2021-09-21T15:25:02Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-21T15:03:04Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-21T14:55:52Z

S.seytnazarov: /* Course Sections */

BSc: Distributed And Network Programming

2021-09-21T14:06:45Z

S.seytnazarov: /* Typical questions for ongoing performance evaluation within this section */

BSc: Distributed And Network Programming

2021-09-21T07:27:09Z

S.seytnazarov: /* Topics covered in this section */

BSc: Distributed And Network Programming

2021-09-20T20:50:06Z

S.seytnazarov: /* Section title: Revision of programming fundamentals for OS */

BSc: Distributed And Network Programming

2021-09-20T20:49:31Z

S.seytnazarov: /* Course Sections */

BSc: Distributed And Network Programming

2021-09-20T17:10:16Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-20T16:16:12Z

S.seytnazarov: /* Resources and reference material */

BSc: Distributed And Network Programming

2021-09-20T16:15:50Z

S.seytnazarov: /* Resources and reference material */

BSc: Distributed And Network Programming

2021-09-20T16:15:35Z

S.seytnazarov: /* Resources and reference material */

BSc: Distributed And Network Programming

2021-09-20T16:09:04Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-20T15:50:13Z

S.seytnazarov: /* Course evaluation */

BSc: Distributed And Network Programming

2021-09-20T15:48:16Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-20T15:28:06Z

S.seytnazarov:

BSc: Operating Systems

2021-09-20T15:25:28Z

S.seytnazarov: Undo revision 704 by S.seytnazarov (talk)

= Operating Systems =

Course name: Operating Systems<br />
Course number: R-01

== Course characteristics ==

=== Key concepts of the class ===

* Structure of an operating system
* Specific mechanisms, policies, and algorithms used to implement the different parts of an operating system

=== What is the purpose of this course? ===

Operating systems are the core part of a computing device and computing devices are an integral part of our life, not only as programmers, but also just as human being – it is enough to think at smart homes infrastructures, now available at accessible prices to everyone, at car devices, like smart navigator and cruise control systems, at other infrastructures. Therefore, a fundamental understanding of the structure of an operating systems has a paramount role in the curriculum of a student in computer science and engineering. The purpose of this course is to provide such understanding. This is a core course, so it is not among its goals to explore the details of the various proposal for operating systems that are now emerging: this is the subject of more advanced endeavours.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define:

* fundamental components of an Operating Systems,
* organization of primary memory and the associated concept of virtual memory, with techniques based on paging and segmenting,
* structure of secondary memory (file systems),
* management of the processor(s) and of the connected scheduling algorithms,
* allocation of resources and the associated problems (deadlocks),
* approaches to handle I/O.

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples):

* strategies and algorithms for allocating processor(s) time to processes,
* strategies and algorithms for allocating primary memory to processes,
* the fundamental states of a process and how they are reached,
* concept and implementation of the address space of a process, both in the single threaded and in the multi threaded cases.
* techniques to organize files and directories in secondary memory,
* algorithms for a safe concurrent access to resources, preventing or avoiding deadlocks,
* methods for attaching different kind of devices to a computer, also considering different kind of buses.

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply:

* strategies for programming at the Operating System level,
* fundamental system calls for process creation, termination,
* fundamental system calls to allocate, change, and deallocate primary memory to processes,
* libraries to handle buffered and unbuffered interconnections with the computer, including files and I/O devices,
* the identification of the most suitable algorithms for process, memory, and I/O management depending on the context in which their target operating system is working.

=== Course evaluation ===

The course has two major forms of evaluations:

* a standard evaluation,
* for very motivated students, an alternative form of evaluation.

The '''standard evaluation''' follows.

<div id="tab:OSCourseGrading">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ '''Course grade breakdown'''
!align="center"| '''Component'''
! '''Points'''
|-
| Labs/seminar classes (weekly evaluations)
|align="center"| 30 <sup>1</sup>
|-
| Interim performance assessment (class participation)
|align="center"| 5
|-
| Exams
|align="center"| 65 <sup>2</sup>
|}

<sup>1</sup> Of which 15 for online test done during the tutorial, 15 for homeworks related to labs.

<sup>2</sup> Of which 35% for the written and 30% for the oral.

Note: A student who has earned 70% of the grade before the oral exam (meaning 49% of the total grade), can apply for exemption to such oral exam, unless explicitly required by the instructor to take it, at full discretion of the instructor. In such case the grade final grade is computed as follows: all the grades below a total of 55% will award a C and all the one from 55% onward (up to 70%) will award a B. A student aiming at an A in the course has to do the oral exam.

</div>
The '''alternative evaluation''' follows.

The alternative form of evaluation assumes attendance to all lecture and always a grade above 9/10 or equivalent. Students interested to opt for this approach need to inform Xavier Vasquez about their choice no later than during the third Tutorial (1st September). If during the semester a student fails to satisfy the criteria for taking the alternative form of evaluation, s/he is automatically reverted to the standard evaluation.

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ '''Course grade breakdown'''
!align="center"| '''Component'''
! '''Points'''
|-
| Labs/seminar classes (weekly evaluations)
|align="center"| 20 <sup>1</sup>
|-
| Interim performance assessment (class participation)
|align="center"| 5
|-
| Solutions to questions of Bach directly in the text
|align="center"| 50
|-
| Exams
|align="center"| 25 <sup>2</sup>
|}

<sup>1</sup> Of which 10 for online test done during the tutorial and 10 for homeworks related to labs.

<sup>2</sup> Special cumulative oral.

'''In both case''' each component apart from homeworks will be assessed on a scale 0-10, where 6 is the minimum passing grade. In case of exceptional work a 10 cum laude will be assigned, with a numeric value from 11 to 13 at discretion of the instructor. The homeworks will be initially graded on a scale 0-2 weekly and then the overall grade will be assembled on a scale 0-10.<br />
The grading, though, is not a simple linear combination of the components above. In particular:

* failing any part of the evaluation will trigger a failure in the entire course,
* the online test done during the tutorial, and the homeworks related to labs will be both averaged on the (n-4) best performances, where the 4 will be used to consider any kind of absence of the student, without requiring any additional documentation; if the student has legitimate reasons to be absent more than 4 times, then supporting document should be provided for all her/his absences,
* if there are not failing components, the final grade will be computed as a weighted average of the components above approximated at the highest second digit and then rounded to the closest integer.

Note that the questions for the exam are taken from the textbooks with possible modifications of some parts of them.

=== Retakes ===

Retakes will be run as comprehensive oral exam, where the student will be assessed the acquired knowledge coming from the textbooks, the lectures, the tutorials, the labs, and the additional required reading material, as supplied by the instructor. During such comprehensive oral the student could be asked to solve exercises and to explain theoretical and practical aspects of the course.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="center"| 96-100
|-
| B. Good
|align="center"| 66-95
|-
| C. Satisfactory
|align="center"| 56-65
|-
| D. Poor
|align="center"| 0-55
|}

=== Resources and reference material ===

* '''Textbook:''' Andrew S. Tanenbaum and Herbert Bos. ''Modern Operating Systems'' (5th Edition), Pearson
* '''Reference:''' Andrew S. Tanenbaum and David J. Wetherall. Computer Networks (5th Edition), Pearson
* '''Reference:''' Brian W. Kernighan, Dennis M. Ritchie. The C Programming Language - 2nd Edition, Prentice Hall
* '''Reference:''' Maurice J.Bach. The design of the Unix Operating System, PRENTICE-HALL, INC., Englewood Cliffs, New Jersey 07632

== Course Sections ==

The course is organized in 15 weeks with every weeks 2 academics hours of lectures, 2 academic hours of labs, and 2 academic hours of tutorials. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Revision of programming fundamentals for OS
|align="center"| 12
|-
|align="center"| 2
| Processes and threads
|align="center"| 24
|-
|align="center"| 3
| Memory management
|align="center"| 24
|-
|align="center"| 4
| File system, I/O, and management of resources
|align="center"| 30
|}

</div>
=== Section 1 ===

==== Section title: Revision of programming fundamentals for OS ====

==== Topics covered in this section ====

* Revision of the structure of a C program
* Overall organization of the computation in C
* Preprocessing
* Simulating function calls in preprocessing
* Analogies between macros and call by name
* Meaning of a variable in C
* Scope and extent of a variable
* Managing data structures with variable length
* Allocation and deallocation of memory
* Pointers and pointer arithmentics
* Pointers to functions
* Usage of pointers to function to simulate virtual functions
* Examples of usage of pointers to function in real life scenarios
* Pointers to functions to perform map and reduce

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Explain the difference between an include file and a library.
# Is a parameter of a macro a “real” parameter?
# Discuss the importance of the conditional compilation.
# What happens when a function returning a pointer returns the address of a local variable?
# Detail the meaning of the keyword static and external for supporting information hiding.
# Describe how the use of virtual functions can make the code more flexible.

==== Typical questions for seminar classes (labs) within this section ====

# Given a source .c file including a .h header file, show the results of preprossing in terms of the generated c file.
# Write a macro and a function in C for the same purpose and discuss pros and cons of both approaches.
# Show how you can write a generic swap function as a macro.
# Write the code allocating dynamic memory for a 2 dimensional array and initializing it.
# Provide an example of how with pointers it is possible in the called function to alter values of variable located in the calling function.
# Using function pointers, write a sorting function having the sorting rule as a parameter of such function.

==== Test questions for final assessment in this section ====

# Discuss the difference in the compiled code when using function and when using macros instead.
# Provide examples of functions that cannot be transformed into macros, also discussing the motivation for such impossibility.
# Describe the rules for scope and extent for local variables, static variables (in all cases), and pointers, supplying also code examples of them.
# Detail the structure of the address space of a process when using a three dimensional array allocated as a local variable of a function and when such array is allocated dynamically, also describe the types of the variables in use and how the compiler checks them.
# Outline the assembly code for a function calling another function passed as a parameter of it.

=== Section 2 ===

==== Section title: Processes and Threads ====

==== Topics covered in this section ====

* Process models
* Process creation and termination
* Process hierarchies
* Process states
* Implementation of processes
* Threads
* Interprocess communication
* Races
* Critical regions, busy waiting, sleep and wakeup
* Semaphores
* Monitors
* Principles of scheduling
* Categories of scheduling algorithms
* Most common approaches for scheduling in interactive systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval2">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Outline the typical life of a process from creation to termination
# Present the different possible models of waiting
# Define the concept of a semaphore and how it can be implemented
# Explain the concept of a monitor from a programming standpoint and how it relates to modern programming paradigms.
# Discuss advantages and disadvantages of the different scheduling algorithms

==== Typical questions for seminar classes (labs) within this section ====

# Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding 1 to it, and then appending it to the file. Run one instance of the script in the background and one in the foreground, each accessing the same file. Answer the following questions: (a) How long does it take before a race condition manifests itself? (b) What is the critical region? (c) How you can modify the script to prevent the race
# Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when it wants to. Use sleep and wakeup to handle the full and empty conditions. See how long it takes for a fatal race condition to occur. For example, you might have the producer print a number once in a while. Do not print more than one number every minute because the I/O could affect the race conditions.
# Write a program that creates a pipe. Have two strings – one should contain some text, the other one should be empty. Transfer a text from the first string to another one using the pipe you created. Show the result.
# Write a C program that forks a child process, waits for 10 seconds and then sends a SIGTERM signal to the child. The child process should run an infinite loop and print “I’m alive” every second
# Write the solution for the produced-consumer problem using monitors.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' Multiple jobs can run in parallel and finish faster than if they had run sequentially. Suppose that two jobs, each needing 20 minutes of CPU time, start simultaneously. How long will the last one take to complete if they run sequentially? How long if they run in parallel? Assume 50% I/O wait.
# ''From the textbook:'' The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different variations of the problem, each one favoring (or not favoring) some category of processes. For each variation, specify what happens when a reader or a writer becomes ready to access the database, and what happens when a process is finished?
# ''From the textbook:'' Consider a system in which threads are implemented entirely in user space, with the run-time system getting a clock interrupt once a second. Suppose that a clock interrupt occurs while some thread is executing in the run-time system. What problem might occur? Can you suggest a way to solve it?
# ''From the textbook:'' In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 12 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in the block cache. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?
# ''From the textbook:'' There are five batch jobs: A through E, they arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. Consider the following scheduling algorithms: '''(a)''' Round robin, '''(b)''' Priority scheduling, '''(c)''' First-come, first-served (run in order 10, 6, 2, 4, 8), '''(d)''' Shortest job first. For each mentioned scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead. For (a), assume that the system is multi-programmed, and that each job gets its fair share of the CPU. For (b) through (d), assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.

=== Section 3 ===

==== Section title: Memory management ====

==== Topics covered in this section ====

* Address space
* Memory abstraction
* Based and limit registers
* Swapping
* Virtual memory
* Paging
* Implementation of paging
* Page replacement algorithms
* Page faults
* Segmentation
* Segmentation with paging

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval3">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the base and limit registers and what are the problems related to their usage?
# Can you have swapping in absence of paging? And paging in absence of swapping?
# What mechanisms and algorithms are available to handle effectively paging?
# Details advantages and disadvantages of the different page replacement algorithms.
# Describe the difference between paging and segmenting.
# Is it possible to combine segmenting and paging? If so, how?

==== Typical questions for seminar classes (labs) within this section ====

# Run ‘free -t -h‘ in a Linux shell or ‘vmstat‘ in a macOS one. Discuss the output.
# Write a C program that runs for 10 seconds. Every second it should: (a) allocate 10 MB of memory – fill it with zeros, (b) sleep for 1 second. Then, compile and run the program in the background (./ex2 &) and run ‘vmstat 1’ at the same time. Observe what happens to the memory. Pay attention to si and so fields. ''Hint:'' use memset(ptr, value, size) to fill the allocated memory.
# Write a program that simulates a paging system using the ageing algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, your program should print Hit/Miss ratio.
# Try to construct a sequence of references that will result in increased or decreased Hit/Miss ratio.
# ''From the textbook:'' A machine has 16-bit virtual addresses. Pages are 8 KB. How many entries are needed for a single-level linear page table? Explain your computations.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' A computer provides each process with 65,536 bytes of address space divided into pages of 4096 bytes each. A particular program has a text size of 32,768 bytes, a data size of 16,386 bytes, and a stack size of 15,870 bytes. Will this program fit in the machine’s address space? Suppose that instead of 4096 bytes, the page size were 512 bytes, would it then fit? Each page must contain either text, data, or stack, not a mixture of two or three of them.
# ''From the textbook:'' You are given the following data about a virtual memory system: '''1.''' The TLB can hold 1024 entries and can be accessed in 1 clock cycle (1 nsec). '''2.''' A page table entry can be found in 100 clock cycles or 100 nsec. '''3.'''The average page replacement time is 6 msec. If page references are handled by the TLB 99% of the time, and only 0.01% lead to a page fault, what is the effective address-translation time?
# ''From the textbook:'' A small computer on a smart card has four page frames. At the first clock tick, the R bits are 0111 (page 0 is 0, the rest are 1). At subsequent clock ticks, the values are 1011, 1010, 1101, 0010, 1010, 1100, and 0001. If the aging algorithm is used with an 8-bit counter, give the values of the four counters after the last tick.
# ''From the textbook:'' A computer with a 32-bit address uses a two-level page table. Virtual addresses are split into a 9-bit top-level page table field, an 11-bit second-level page table field, and an offset. How large are the pages and how many are there in the address space?
# ''From the textbook:'' A computer has 32-bit virtual addresses and 4-KB pages. The program and data together fit in the lowest page (0–4095) The stack fits in the highest page. How many entries are needed in the page table if traditional (one-level) paging is used? How many page table entries are needed for two-level paging, with 10 bits in each part?

=== Section 4 ===

==== Section title: File system, I/O, and management of resources ====

==== Topics covered in this section ====

* File system
* Files and files types, attributes, and operations
* Paths
* File system layout
* Shared files
* File system backups
* FIle system performances
* General structure of I/O
* Block devices and character devices
* Device drivers
* Memory mapped I/O and Direct Memory Access
* Interrupts
* Programmed I/O
* Deadlocks
* Conditions for deadlocks
* Strategies to deal with dealocks

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval4">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is the overall structure of a file system
# How are files and directories organized on a disk and what are the roles of i-nodes, when they are used
# What are the key differences between block and character devices.
# How does DMA speeds up the computations?
# List the major classes of strategies to handle deadlock.

==== Typical questions for seminar classes (labs) within this section ====

# Create tmp directory with two empty files (file1, file2). Then, create one hard link named link1 to file1. Write a program that scans tmp directory, locates all i-nodes with a hard link count of two or more and for each such file it should display together all file names that point to the file.
# Implement a simulated file system that will be fully contained in a single regular file stored on the disk. This disk file will contain directories, i-nodes, free- block information, file data blocks, etc. Choose appropriate algorithms for maintaining free-block information and for allocating data blocks (contiguous, indexed, linked). Your program will accept system commands from the user to create/delete directories, create/delete/open files, read/write from/to a selected file, and to list directory contents.
# Create a file ex1.txt with a random string in it. Write a C program (ex1.c) that changes the string in ex1.txt to “This is a nice day” by using mmap(). Hints: '''(a)''' open the file in O_RDWR mode, '''(b)''' use stat() or fstat() to get the size of the file.
# Write a C program (ex2.c) using line buffer. Write your code according to the instructions: '''(a)''' each of the 5 characters of “Hello” string should be put in separate printf(), '''(b)''' add a 1 sec sleep after every printf(). The output should be a 5 sec wait and then “Hello” printed instantaneously.
# The tee command reads its standard input until end-of- file, writing a copy of the input to standard output and to the files named in its command-line arguments. Implement tee using I/O system calls. By default, tee overwrites any existing file with the given name. Implement the -a command-line option (tee -a file), which causes tee to append text to the end of a file if it already exists.
# Write a C program for deadlock detection algorithm reading the resources available form a file (input.txt). For testing purposes consider 5 processes and 3 type of resources. However, your program must be able to process as many processes and resource types, as needed (check next slide for input file structure description). The output of your program should either say that no deadlock is detected or print out the numbers of processes that are deadlocked.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' Two computer science students, Carolyn and Elinor, are having a discussion about i-nodes. Carolyn maintains that memories have gotten so large and so cheap that when a file is opened, it is simpler and faster just to fetch a new copy of the i-node into the i-node table, rather than search the entire table to see if it is already there. Elinor disagrees. Who is right? Why?
# ''From the textbook:'' A typical printed page of text contains 50 lines of 80 characters each. Imagine that a certain printer can print 6 pages per minute and that the time to write a character to the printer’s output register is so short it can be ignored. Does it make sense to run this printer using interrupt-driven I/O if each character printed requires an interrupt that takes 50 <math display="inline">\mu</math>sec all-in to service?
# ''From the textbook:'' Consider a disk that has 10 data blocks starting from block 14 through 23. Let there be 2 files on the disk: f1 and f2. The directory structure lists that the first data blocks of f1 and f2 are respectively 22 and 16. The FAT table is as follows: (14,18), (15,17), (16,23), (17,21), (18,20), (19,15), (20,-1), (21,-1), (22,19), (23,14), where (x,y) indicates that the value stored in table entry x points to data block y. What are the data blocks allotted to f1 and f2?
# ''From the textbook:'' Explain how hard links and soft links differ with respective to i-node allocations.
# ''From the textbook:'' When a user program makes a system call to read or write a disk file, it provides an indication of which file it wants, a pointer to the data buffer, and the count. Control is then transferred to the operating system, which calls the appropriate driver. Suppose that the driver starts the disk and terminates until an interrupt occurs. In the case of reading from the disk, obviously the caller will have to be blocked (because there are no data for it). What about the case of writing to the disk? Need the caller be blocked awaiting completion of the disk transfer?
# ''From the textbook:'' The banker’s algorithm is being run in a system with m resource classes and n processes. In the limit of large m and n, the number of operations that must be performed to check a state for safety is proportional to m<math display="inline">^a</math>n<math display="inline">^b</math> . What are the values of a and b ?

BSc: Operating Systems

2021-09-20T15:23:49Z

S.seytnazarov: /* Grades range */

= Operating Systems =

Course name: Operating Systems<br />
Course number: R-01

== Course characteristics ==

=== Key concepts of the class ===

* Structure of an operating system
* Specific mechanisms, policies, and algorithms used to implement the different parts of an operating system

=== What is the purpose of this course? ===

Operating systems are the core part of a computing device and computing devices are an integral part of our life, not only as programmers, but also just as human being – it is enough to think at smart homes infrastructures, now available at accessible prices to everyone, at car devices, like smart navigator and cruise control systems, at other infrastructures. Therefore, a fundamental understanding of the structure of an operating systems has a paramount role in the curriculum of a student in computer science and engineering. The purpose of this course is to provide such understanding. This is a core course, so it is not among its goals to explore the details of the various proposal for operating systems that are now emerging: this is the subject of more advanced endeavours.

=== Course Objectives Based on Bloom’s Taxonomy ===

==== What should a student remember at the end of the course? ====

By the end of the course, the students should be able to recognize and define:

* fundamental components of an Operating Systems,
* organization of primary memory and the associated concept of virtual memory, with techniques based on paging and segmenting,
* structure of secondary memory (file systems),
* management of the processor(s) and of the connected scheduling algorithms,
* allocation of resources and the associated problems (deadlocks),
* approaches to handle I/O.

==== What should a student be able to understand at the end of the course? ====

By the end of the course, the students should be able to describe and explain (with examples):

* strategies and algorithms for allocating processor(s) time to processes,
* strategies and algorithms for allocating primary memory to processes,
* the fundamental states of a process and how they are reached,
* concept and implementation of the address space of a process, both in the single threaded and in the multi threaded cases.
* techniques to organize files and directories in secondary memory,
* algorithms for a safe concurrent access to resources, preventing or avoiding deadlocks,
* methods for attaching different kind of devices to a computer, also considering different kind of buses.

==== What should a student be able to apply at the end of the course? ====

By the end of the course, the students should be able to apply:

* strategies for programming at the Operating System level,
* fundamental system calls for process creation, termination,
* fundamental system calls to allocate, change, and deallocate primary memory to processes,
* libraries to handle buffered and unbuffered interconnections with the computer, including files and I/O devices,
* the identification of the most suitable algorithms for process, memory, and I/O management depending on the context in which their target operating system is working.

=== Course evaluation ===

The course has two major forms of evaluations:

* a standard evaluation,
* for very motivated students, an alternative form of evaluation.

The '''standard evaluation''' follows.

<div id="tab:OSCourseGrading">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ '''Course grade breakdown'''
!align="center"| '''Component'''
! '''Points'''
|-
| Labs/seminar classes (weekly evaluations)
|align="center"| 30 <sup>1</sup>
|-
| Interim performance assessment (class participation)
|align="center"| 5
|-
| Exams
|align="center"| 65 <sup>2</sup>
|}

<sup>1</sup> Of which 15 for online test done during the tutorial, 15 for homeworks related to labs.

<sup>2</sup> Of which 35% for the written and 30% for the oral.

Note: A student who has earned 70% of the grade before the oral exam (meaning 49% of the total grade), can apply for exemption to such oral exam, unless explicitly required by the instructor to take it, at full discretion of the instructor. In such case the grade final grade is computed as follows: all the grades below a total of 55% will award a C and all the one from 55% onward (up to 70%) will award a B. A student aiming at an A in the course has to do the oral exam.

</div>
The '''alternative evaluation''' follows.

The alternative form of evaluation assumes attendance to all lecture and always a grade above 9/10 or equivalent. Students interested to opt for this approach need to inform Xavier Vasquez about their choice no later than during the third Tutorial (1st September). If during the semester a student fails to satisfy the criteria for taking the alternative form of evaluation, s/he is automatically reverted to the standard evaluation.

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ '''Course grade breakdown'''
!align="center"| '''Component'''
! '''Points'''
|-
| Labs/seminar classes (weekly evaluations)
|align="center"| 20 <sup>1</sup>
|-
| Interim performance assessment (class participation)
|align="center"| 5
|-
| Solutions to questions of Bach directly in the text
|align="center"| 50
|-
| Exams
|align="center"| 25 <sup>2</sup>
|}

<sup>1</sup> Of which 10 for online test done during the tutorial and 10 for homeworks related to labs.

<sup>2</sup> Special cumulative oral.

'''In both case''' each component apart from homeworks will be assessed on a scale 0-10, where 6 is the minimum passing grade. In case of exceptional work a 10 cum laude will be assigned, with a numeric value from 11 to 13 at discretion of the instructor. The homeworks will be initially graded on a scale 0-2 weekly and then the overall grade will be assembled on a scale 0-10.<br />
The grading, though, is not a simple linear combination of the components above. In particular:

* failing any part of the evaluation will trigger a failure in the entire course,
* the online test done during the tutorial, and the homeworks related to labs will be both averaged on the (n-4) best performances, where the 4 will be used to consider any kind of absence of the student, without requiring any additional documentation; if the student has legitimate reasons to be absent more than 4 times, then supporting document should be provided for all her/his absences,
* if there are not failing components, the final grade will be computed as a weighted average of the components above approximated at the highest second digit and then rounded to the closest integer.

Note that the questions for the exam are taken from the textbooks with possible modifications of some parts of them.

=== Retakes ===

Retakes will be run as comprehensive oral exam, where the student will be assessed the acquired knowledge coming from the textbooks, the lectures, the tutorials, the labs, and the additional required reading material, as supplied by the instructor. During such comprehensive oral the student could be asked to solve exercises and to explain theoretical and practical aspects of the course.

=== Grades range ===

<div id="tab:OSCourseGradingRange">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course grading range
|-
| A. Excellent
|align="center"| 90-100
|-
| B. Good
|align="center"| 75-89
|-
| C. Satisfactory
|align="center"| 60-74
|-
| D. Poor
|align="center"| 0-59
|}

=== Resources and reference material ===

* '''Textbook:''' Andrew S. Tanenbaum and Herbert Bos. ''Modern Operating Systems'' (5th Edition), Pearson
* '''Reference:''' Andrew S. Tanenbaum and David J. Wetherall. Computer Networks (5th Edition), Pearson
* '''Reference:''' Brian W. Kernighan, Dennis M. Ritchie. The C Programming Language - 2nd Edition, Prentice Hall
* '''Reference:''' Maurice J.Bach. The design of the Unix Operating System, PRENTICE-HALL, INC., Englewood Cliffs, New Jersey 07632

== Course Sections ==

The course is organized in 15 weeks with every weeks 2 academics hours of lectures, 2 academic hours of labs, and 2 academic hours of tutorials. The main sections of the course and approximate hour distribution between them is as follows:

<div id="tab:OSCourseSections">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|+ Course Sections
!align="center"| '''Section'''
! '''Section Title'''
!align="center"| '''Teaching Hours'''
|-
|align="center"| 1
| Revision of programming fundamentals for OS
|align="center"| 12
|-
|align="center"| 2
| Processes and threads
|align="center"| 24
|-
|align="center"| 3
| Memory management
|align="center"| 24
|-
|align="center"| 4
| File system, I/O, and management of resources
|align="center"| 30
|}

</div>
=== Section 1 ===

==== Section title: Revision of programming fundamentals for OS ====

==== Topics covered in this section ====

* Revision of the structure of a C program
* Overall organization of the computation in C
* Preprocessing
* Simulating function calls in preprocessing
* Analogies between macros and call by name
* Meaning of a variable in C
* Scope and extent of a variable
* Managing data structures with variable length
* Allocation and deallocation of memory
* Pointers and pointer arithmentics
* Pointers to functions
* Usage of pointers to function to simulate virtual functions
* Examples of usage of pointers to function in real life scenarios
* Pointers to functions to perform map and reduce

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval1">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Explain the difference between an include file and a library.
# Is a parameter of a macro a “real” parameter?
# Discuss the importance of the conditional compilation.
# What happens when a function returning a pointer returns the address of a local variable?
# Detail the meaning of the keyword static and external for supporting information hiding.
# Describe how the use of virtual functions can make the code more flexible.

==== Typical questions for seminar classes (labs) within this section ====

# Given a source .c file including a .h header file, show the results of preprossing in terms of the generated c file.
# Write a macro and a function in C for the same purpose and discuss pros and cons of both approaches.
# Show how you can write a generic swap function as a macro.
# Write the code allocating dynamic memory for a 2 dimensional array and initializing it.
# Provide an example of how with pointers it is possible in the called function to alter values of variable located in the calling function.
# Using function pointers, write a sorting function having the sorting rule as a parameter of such function.

==== Test questions for final assessment in this section ====

# Discuss the difference in the compiled code when using function and when using macros instead.
# Provide examples of functions that cannot be transformed into macros, also discussing the motivation for such impossibility.
# Describe the rules for scope and extent for local variables, static variables (in all cases), and pointers, supplying also code examples of them.
# Detail the structure of the address space of a process when using a three dimensional array allocated as a local variable of a function and when such array is allocated dynamically, also describe the types of the variables in use and how the compiler checks them.
# Outline the assembly code for a function calling another function passed as a parameter of it.

=== Section 2 ===

==== Section title: Processes and Threads ====

==== Topics covered in this section ====

* Process models
* Process creation and termination
* Process hierarchies
* Process states
* Implementation of processes
* Threads
* Interprocess communication
* Races
* Critical regions, busy waiting, sleep and wakeup
* Semaphores
* Monitors
* Principles of scheduling
* Categories of scheduling algorithms
* Most common approaches for scheduling in interactive systems

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval2">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# Outline the typical life of a process from creation to termination
# Present the different possible models of waiting
# Define the concept of a semaphore and how it can be implemented
# Explain the concept of a monitor from a programming standpoint and how it relates to modern programming paradigms.
# Discuss advantages and disadvantages of the different scheduling algorithms

==== Typical questions for seminar classes (labs) within this section ====

# Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding 1 to it, and then appending it to the file. Run one instance of the script in the background and one in the foreground, each accessing the same file. Answer the following questions: (a) How long does it take before a race condition manifests itself? (b) What is the critical region? (c) How you can modify the script to prevent the race
# Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when it wants to. Use sleep and wakeup to handle the full and empty conditions. See how long it takes for a fatal race condition to occur. For example, you might have the producer print a number once in a while. Do not print more than one number every minute because the I/O could affect the race conditions.
# Write a program that creates a pipe. Have two strings – one should contain some text, the other one should be empty. Transfer a text from the first string to another one using the pipe you created. Show the result.
# Write a C program that forks a child process, waits for 10 seconds and then sends a SIGTERM signal to the child. The child process should run an infinite loop and print “I’m alive” every second
# Write the solution for the produced-consumer problem using monitors.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' Multiple jobs can run in parallel and finish faster than if they had run sequentially. Suppose that two jobs, each needing 20 minutes of CPU time, start simultaneously. How long will the last one take to complete if they run sequentially? How long if they run in parallel? Assume 50% I/O wait.
# ''From the textbook:'' The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different variations of the problem, each one favoring (or not favoring) some category of processes. For each variation, specify what happens when a reader or a writer becomes ready to access the database, and what happens when a process is finished?
# ''From the textbook:'' Consider a system in which threads are implemented entirely in user space, with the run-time system getting a clock interrupt once a second. Suppose that a clock interrupt occurs while some thread is executing in the run-time system. What problem might occur? Can you suggest a way to solve it?
# ''From the textbook:'' In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 12 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in the block cache. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?
# ''From the textbook:'' There are five batch jobs: A through E, they arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. Consider the following scheduling algorithms: '''(a)''' Round robin, '''(b)''' Priority scheduling, '''(c)''' First-come, first-served (run in order 10, 6, 2, 4, 8), '''(d)''' Shortest job first. For each mentioned scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead. For (a), assume that the system is multi-programmed, and that each job gets its fair share of the CPU. For (b) through (d), assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.

=== Section 3 ===

==== Section title: Memory management ====

==== Topics covered in this section ====

* Address space
* Memory abstraction
* Based and limit registers
* Swapping
* Virtual memory
* Paging
* Implementation of paging
* Page replacement algorithms
* Page faults
* Segmentation
* Segmentation with paging

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval3">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What are the base and limit registers and what are the problems related to their usage?
# Can you have swapping in absence of paging? And paging in absence of swapping?
# What mechanisms and algorithms are available to handle effectively paging?
# Details advantages and disadvantages of the different page replacement algorithms.
# Describe the difference between paging and segmenting.
# Is it possible to combine segmenting and paging? If so, how?

==== Typical questions for seminar classes (labs) within this section ====

# Run ‘free -t -h‘ in a Linux shell or ‘vmstat‘ in a macOS one. Discuss the output.
# Write a C program that runs for 10 seconds. Every second it should: (a) allocate 10 MB of memory – fill it with zeros, (b) sleep for 1 second. Then, compile and run the program in the background (./ex2 &) and run ‘vmstat 1’ at the same time. Observe what happens to the memory. Pay attention to si and so fields. ''Hint:'' use memset(ptr, value, size) to fill the allocated memory.
# Write a program that simulates a paging system using the ageing algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, your program should print Hit/Miss ratio.
# Try to construct a sequence of references that will result in increased or decreased Hit/Miss ratio.
# ''From the textbook:'' A machine has 16-bit virtual addresses. Pages are 8 KB. How many entries are needed for a single-level linear page table? Explain your computations.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' A computer provides each process with 65,536 bytes of address space divided into pages of 4096 bytes each. A particular program has a text size of 32,768 bytes, a data size of 16,386 bytes, and a stack size of 15,870 bytes. Will this program fit in the machine’s address space? Suppose that instead of 4096 bytes, the page size were 512 bytes, would it then fit? Each page must contain either text, data, or stack, not a mixture of two or three of them.
# ''From the textbook:'' You are given the following data about a virtual memory system: '''1.''' The TLB can hold 1024 entries and can be accessed in 1 clock cycle (1 nsec). '''2.''' A page table entry can be found in 100 clock cycles or 100 nsec. '''3.'''The average page replacement time is 6 msec. If page references are handled by the TLB 99% of the time, and only 0.01% lead to a page fault, what is the effective address-translation time?
# ''From the textbook:'' A small computer on a smart card has four page frames. At the first clock tick, the R bits are 0111 (page 0 is 0, the rest are 1). At subsequent clock ticks, the values are 1011, 1010, 1101, 0010, 1010, 1100, and 0001. If the aging algorithm is used with an 8-bit counter, give the values of the four counters after the last tick.
# ''From the textbook:'' A computer with a 32-bit address uses a two-level page table. Virtual addresses are split into a 9-bit top-level page table field, an 11-bit second-level page table field, and an offset. How large are the pages and how many are there in the address space?
# ''From the textbook:'' A computer has 32-bit virtual addresses and 4-KB pages. The program and data together fit in the lowest page (0–4095) The stack fits in the highest page. How many entries are needed in the page table if traditional (one-level) paging is used? How many page table entries are needed for two-level paging, with 10 bits in each part?

=== Section 4 ===

==== Section title: File system, I/O, and management of resources ====

==== Topics covered in this section ====

* File system
* Files and files types, attributes, and operations
* Paths
* File system layout
* Shared files
* File system backups
* FIle system performances
* General structure of I/O
* Block devices and character devices
* Device drivers
* Memory mapped I/O and Direct Memory Access
* Interrupts
* Programmed I/O
* Deadlocks
* Conditions for deadlocks
* Strategies to deal with dealocks

==== What forms of evaluation were used to test students’ performance in this section? ====

<div id="tab:OSSectionEval4">

{| style="border-spacing: 2px; border: 1px solid darkgray;"
|''' '''
! '''Yes/No'''
|-
| Development of individual parts of software product code
|align="center"| 1
|-
| Homework and group projects
|align="center"| 1
|-
| Midterm evaluation
|align="center"| 0
|-
| Testing (written or computer based)
|align="center"| 1
|-
| Reports
|align="center"| 0
|-
| Essays
|align="center"| 0
|-
| Oral polls
|align="center"| 1
|-
| Discussions
|align="center"| 1
|}

</div>
==== Typical questions for ongoing performance evaluation within this section ====

# What is the overall structure of a file system
# How are files and directories organized on a disk and what are the roles of i-nodes, when they are used
# What are the key differences between block and character devices.
# How does DMA speeds up the computations?
# List the major classes of strategies to handle deadlock.

==== Typical questions for seminar classes (labs) within this section ====

# Create tmp directory with two empty files (file1, file2). Then, create one hard link named link1 to file1. Write a program that scans tmp directory, locates all i-nodes with a hard link count of two or more and for each such file it should display together all file names that point to the file.
# Implement a simulated file system that will be fully contained in a single regular file stored on the disk. This disk file will contain directories, i-nodes, free- block information, file data blocks, etc. Choose appropriate algorithms for maintaining free-block information and for allocating data blocks (contiguous, indexed, linked). Your program will accept system commands from the user to create/delete directories, create/delete/open files, read/write from/to a selected file, and to list directory contents.
# Create a file ex1.txt with a random string in it. Write a C program (ex1.c) that changes the string in ex1.txt to “This is a nice day” by using mmap(). Hints: '''(a)''' open the file in O_RDWR mode, '''(b)''' use stat() or fstat() to get the size of the file.
# Write a C program (ex2.c) using line buffer. Write your code according to the instructions: '''(a)''' each of the 5 characters of “Hello” string should be put in separate printf(), '''(b)''' add a 1 sec sleep after every printf(). The output should be a 5 sec wait and then “Hello” printed instantaneously.
# The tee command reads its standard input until end-of- file, writing a copy of the input to standard output and to the files named in its command-line arguments. Implement tee using I/O system calls. By default, tee overwrites any existing file with the given name. Implement the -a command-line option (tee -a file), which causes tee to append text to the end of a file if it already exists.
# Write a C program for deadlock detection algorithm reading the resources available form a file (input.txt). For testing purposes consider 5 processes and 3 type of resources. However, your program must be able to process as many processes and resource types, as needed (check next slide for input file structure description). The output of your program should either say that no deadlock is detected or print out the numbers of processes that are deadlocked.

==== Test questions for final assessment in this section ====

# ''From the textbook:'' Two computer science students, Carolyn and Elinor, are having a discussion about i-nodes. Carolyn maintains that memories have gotten so large and so cheap that when a file is opened, it is simpler and faster just to fetch a new copy of the i-node into the i-node table, rather than search the entire table to see if it is already there. Elinor disagrees. Who is right? Why?
# ''From the textbook:'' A typical printed page of text contains 50 lines of 80 characters each. Imagine that a certain printer can print 6 pages per minute and that the time to write a character to the printer’s output register is so short it can be ignored. Does it make sense to run this printer using interrupt-driven I/O if each character printed requires an interrupt that takes 50 <math display="inline">\mu</math>sec all-in to service?
# ''From the textbook:'' Consider a disk that has 10 data blocks starting from block 14 through 23. Let there be 2 files on the disk: f1 and f2. The directory structure lists that the first data blocks of f1 and f2 are respectively 22 and 16. The FAT table is as follows: (14,18), (15,17), (16,23), (17,21), (18,20), (19,15), (20,-1), (21,-1), (22,19), (23,14), where (x,y) indicates that the value stored in table entry x points to data block y. What are the data blocks allotted to f1 and f2?
# ''From the textbook:'' Explain how hard links and soft links differ with respective to i-node allocations.
# ''From the textbook:'' When a user program makes a system call to read or write a disk file, it provides an indication of which file it wants, a pointer to the data buffer, and the count. Control is then transferred to the operating system, which calls the appropriate driver. Suppose that the driver starts the disk and terminates until an interrupt occurs. In the case of reading from the disk, obviously the caller will have to be blocked (because there are no data for it). What about the case of writing to the disk? Need the caller be blocked awaiting completion of the disk transfer?
# ''From the textbook:'' The banker’s algorithm is being run in a system with m resource classes and n processes. In the limit of large m and n, the number of operations that must be performed to check a state for safety is proportional to m<math display="inline">^a</math>n<math display="inline">^b</math> . What are the values of a and b ?

BSc: Distributed And Network Programming

2021-09-20T12:29:40Z

S.seytnazarov:

BSc: Distributed And Network Programming

2021-09-20T11:19:21Z

S.seytnazarov: