zaxoavoki

const match = `<insert GraphQL schema here>`.match(/(^[^\t].+\n|})|(\t.+)/gm);
let lines = [], tmp = [];

for (const mat of match) {
 if (mat.startsWith('\t')) {
  tmp.push(mat + '\n');
 } else {
  lines = [...lines, ...tmp.sort()];
  tmp = [];
  lines.push(mat);

zaxoavoki

Count your average courses mark

1. Open JSOS website and go to the "Indeks" page https://jsos.pwr.edu.pl/index.php/student/indeksOceny/oceny/1.
2. Click "Pobierz więcej..."
3. Open Developer Console and insert this script:

const [sumMark, ects] = [...document.getElementsByTagName('tr')]
  .filter(e => e.classList.contains('data'))
 .map(e => [parseInt(e.children[7].innerHTML), parseFloat(e.children[5].innerHTML) || 3])

zaxoavoki

Ticker - letter's appearing with delay

Promise-based implementation of ticker

zaxoavoki

Fill array in spiral pattern

zaxoavoki

<?xml version="1.0" encoding="UTF-8"?>
<form xmlns="http://www.intellij.com/uidesigner/form/" version="1" bind-to-class="GUI">
  <grid id="27dc6" binding="panel" layout-manager="GridLayoutManager" row-count="11" column-count="3" same-size-horizontally="false" same-size-vertically="false" hgap="-1" vgap="-1">
    <margin top="10" left="10" bottom="10" right="10"/>
    <constraints>
      <xy x="20" y="20" width="348" height="572"/>
    </constraints>
    <properties/>
    <border type="none" title=""/>
    <children>

zaxoavoki

from os import system 
from time import sleep

string = [
"| | | |  | _ |  |  _ | |  _ | | | | |   |  \\ | | | __ | \\  \\       / /    | | | | | __ |  | _ |  | __ |     ",
"| |_| | | |_| | |  __| |  __| \\  `  /   | |\\ | | | ___|  \\  \\  _  / /     \\  `  / | ___| | |_| | | ___/     ",
"|  _  | |  _  | | |    | |      | |     | | \\  | | |_     \\  \\/_\\/ /        | |   | |_   |  _  | | |\\ \\     ",
"|_| |_| |_| |_| |_|    |_|      |_|     |_|  \\ | |___|     \\_/  \\_/         |_|   |___|  |_| |_| |_| \\_\\    "]

zaxoavoki

Disk scheduling algorithms

FCFS

FCFS is the simplest of all the Disk Scheduling Algorithms. In FCFS, the requests are addressed in the order they arrive in the disk queue.

Advantages:

• Every request gets a fair chance

zaxoavoki

Page Replacement Algorithms

FIFO

First In First Out is the simplest page replacement algorithm. In this algorithm, the operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal.

OPT

In Optimal Page replacement algorithm pages are replaced which would not be used for the longest duration of time in the future.

zaxoavoki

Visualization of PI number.

Copy pi.txt file with first 4 billion numbers of PI from here. Change size of cell for different scale of window and run a program. Also you can change the HEX color for each number (0-9) to see different variants of visualization.

Example :)