From 4a001767b85ff4bd5b1b4475f2a2285707193070 Mon Sep 17 00:00:00 2001 From: JeoJake Date: Fri, 29 Oct 2021 13:06:35 +0300 Subject: [PATCH] init --- index.html | 78 +++++++++++++ js/index.js | 15 +++ js/lab-1.js | 299 +++++++++++++++++++++++++++++++++++++++++++++++ js/lab-3.js | 95 +++++++++++++++ pages/lab-1.html | 133 +++++++++++++++++++++ pages/lab-2.html | 14 +++ pages/lab-3.html | 148 +++++++++++++++++++++++ 7 files changed, 782 insertions(+) create mode 100644 index.html create mode 100644 js/index.js create mode 100644 js/lab-1.js create mode 100644 js/lab-3.js create mode 100644 pages/lab-1.html create mode 100644 pages/lab-2.html create mode 100644 pages/lab-3.html diff --git a/index.html b/index.html new file mode 100644 index 0000000..355268f --- /dev/null +++ b/index.html @@ -0,0 +1,78 @@ + + + + + + + + CDM Utils + + + + + + + + +
+
+
+
+
+

+ + Hello there + + + + +

+

The web-site is created for people who want to learn
more about Computer Discrete Mathematics

+
+
+
+
+
+ + + + + + + \ No newline at end of file diff --git a/js/index.js b/js/index.js new file mode 100644 index 0000000..d14659f --- /dev/null +++ b/js/index.js @@ -0,0 +1,15 @@ +const burgerIcon = document.querySelector('#burger'); +const navbarMenu = document.querySelector('#nav-links'); + +burgerIcon.addEventListener('click', () => { + burgerIcon.classList.toggle('is-active'); + navbarMenu.classList.toggle('is-active'); +}); + +const dropDowns = document.querySelectorAll('#dropdown'); + +dropDowns.forEach(element => { + element.addEventListener('click', () => { + element.classList.toggle('is-active'); + }) +}); \ No newline at end of file diff --git a/js/lab-1.js b/js/lab-1.js new file mode 100644 index 0000000..607d170 --- /dev/null +++ b/js/lab-1.js @@ -0,0 +1,299 @@ +let maxNum = 26; +let currNum = 2; + +function AddSet() { + + if (currNum < 26) { + + let charNum = 65 + currNum; + currNum++; + + let delBtn = document.querySelectorAll('#delBtn'); + if (delBtn[delBtn.length - 1]) { + delBtn[delBtn.length - 1].style="display: none;"; + } + + node = document.getElementById('sets'); + node.insertAdjacentHTML('beforeend', `
+
+ + +
+
+ +
+
`); + } else { + console.log('You have reached a limint of available sets'); + } +} + +function DeleteSet(setNum) { + + let setField = document.querySelector(`#setfield${setNum}`); + setField.remove(); + currNum--; + + let delBtn = document.querySelectorAll('#delBtn'); + if (delBtn[delBtn.length - 1]) { + delBtn[delBtn.length - 1].style="display: inline-block;"; + } +} + + +let universalSet = new Set(); + +function Complement (set) { + + let _complement = new Set(); + + _complement = Difference(universalSet, set); + + return _complement; +} + +function Intersection (set1, set2) { + + let _intersection = new Set(); + + set1.forEach(element => { + if (set2.has(element)) { + _intersection.add(element); + } + }); + + return _intersection; +} + +function Union (set1, set2) { + + let _union = new Set(set1); + + set2.forEach(element => { + _union.add(element); + }); + + return _union; +} + +function Difference (set1, set2) { + + let _difference = new Set(set1); + + set2.forEach(element => { + + if (_difference.has(element)) { + _difference.delete(element); + } + }); + + return _difference; +} + + +const OPERATORS = new Set(['~', '!', '∩', '/', '∪', '+', '-']); +const BRACKETS = new Set(['(', ')']); + +let SETSNAMES = new Set(); +let SETS = new Array(); + +function Evaluate() { + + FetchSets(); + + let formulaString = document.getElementById('formula').value; + + let charArray = formulaString.split(''); + let RPN_Array = ConvertFormulaCharArrayToRPN(charArray); + + let result = SolveRPNFormula(RPN_Array); + + let readableResult = ConvertToReadableResult(result); + + + let resultField = document.getElementById('result'); + resultField.value = readableResult; + + + SETSNAMES.clear(); + SETS = new Array(); + universalSet = new Set(); +} + +function ConvertFormulaCharArrayToRPN(chars) { + + let setsStack = new Array(); + let actionsStack = new Array(); + + chars.forEach(element => { + + if (SETSNAMES.has(element)) { + + setsStack.push(GetSetFromIndex(element)); + } + + if (OPERATORS.has(element)) { + + while (GetActionPriority(actionsStack[actionsStack.length - 1]) >= GetActionPriority(element)) { + + let last = actionsStack.pop(); + + if (last != '(') { + setsStack.push(last); + } else { + break; + } + } + + if (actionsStack[0] == undefined || GetActionPriority(actionsStack[actionsStack.length - 1]) < GetActionPriority(element)) { + + actionsStack.push(element); + } + } + + if (BRACKETS.has(element)) { + + if (element == '(') { + + actionsStack.push(element); + } + + if (element == ')') { + + let last = actionsStack.pop(); + + while (last != '(') { + + setsStack.push(last); + last = actionsStack.pop(); + } + } + } + }); + + while (actionsStack[0] != undefined) { + + setsStack.push(actionsStack.pop()); + } + + return setsStack; +} + +function SolveRPNFormula(RPN_Array) { + + let stack = new Array(); + + for (let i = 0; i < RPN_Array.length; i++) { + const element = RPN_Array[i]; + + if (OPERATORS.has(element)) { + + if (element == '~' || element == '!') { + + let currSet = stack.pop(); + + let result = Complement(currSet); + + stack.push(result); + } else if (element == '∩' || element == '/') { + + let secondSet = stack.pop(); + let firstSet = stack.pop(); + + let result = Intersection(firstSet, secondSet); + + stack.push(result); + } else if (element == '∪' || element == '+') { + + let secondSet = stack.pop(); + let firstSet = stack.pop(); + + let result = Union(firstSet, secondSet); + + stack.push(result); + } else if (element == '-') { + + let secondSet = stack.pop(); + let firstSet = stack.pop(); + + let result = Difference(firstSet, secondSet); + + stack.push(result); + } + } else { + + stack.push(element); + } + } + + return stack[0]; +} + + + +function FetchSets() { + + let universalArray = new Array(); + + for (let i = 0; i < currNum; i++) { + + let inputField = document.getElementById(`set${i}`); + + let numArray; + if (inputField != undefined && inputField.value.length != 0) { + numArray = inputField.value.split(','); + + numArray.sort(); + + let newSet = new Set(); + + numArray.forEach(element => { + + newSet.add(+element); + universalArray.push(+element); + }); + + SETSNAMES.add(String.fromCharCode(65 + i)); + SETS.push(newSet); + } else { + console.log('[WARNING] Some of the sets are not defined'); + } + } + + universalSet = new Set(universalArray); +} + + + + +function GetSetFromIndex(index) { + + let unicode = index.charCodeAt(0); + + let num = unicode - 65; + + return SETS[num]; +} + +function GetActionPriority(action) { + + if (action == '~' || action == '!') { + return 5; + } else if (action == '∩' || action == '/') { + return 4; + } else if (action == '∪' || action == '+') { + return 3; + } else if (action == '-') { + return 2; + } else if (action == '(') { + return 1; + } else { + return 0; + } +} + +function ConvertToReadableResult(unconverted) { + + let converted = Array.from(unconverted).sort().join(', '); + return converted; +} \ No newline at end of file diff --git a/js/lab-3.js b/js/lab-3.js new file mode 100644 index 0000000..b413fb9 --- /dev/null +++ b/js/lab-3.js @@ -0,0 +1,95 @@ +function GeneratePermutations() { + + let permCount = document.querySelector('#permCount'); + + let permBtn = document.querySelector('#permBtn'); + let permProgress = document.querySelector('#permProgress'); + + let permGenTime = document.querySelector('#permGenTime'); + let permGenTimeHolder = document.querySelector('#permGenTimeHolder'); + + + console.clear(); + + let cycle = 1; + + + let _elCount = permCount.value; + + let a = new Array(); + + for (let i = 1; i <= _elCount; i++) { + a.push(i); + } + + + permBtn.style = "display: none;"; + permProgress.style = "display: flex;"; + permGenTimeHolder.style = "display: none"; + + date = new Date(); + let _startTime = date.getTime(); + + heapPermutation(a, a.length, a.length); + + date = new Date(); + let _endTime = date.getTime(); + + permBtn.style = "display: inline-flex;"; + permProgress.style = "display: none;"; + permGenTimeHolder.style = "display: flex"; + + + let _timeElapsed = _endTime - _startTime; + + permGenTime.innerHTML = `${_timeElapsed} milliseconds elapsed`; + + + // JavaScript program to print all permutations using + // Heap's algorithm + + // Prints the array + function printArr(a, c) { + console.log(a, c); + } + + // Generating permutation using Heap Algorithm + function heapPermutation(a,size,n) { + // if size becomes 1 then prints the obtained + // permutation + if (size == 1) { + printArr(a, cycle); + cycle++; + } + + for (let i = 0; i < size; i++) { + heapPermutation(a, size - 1, n); + + // if size is odd, swap 0th i.e (first) and + // (size-1)th i.e (last) element + if (size % 2 == 1) { + let temp = a[0]; + a[0] = a[size - 1]; + a[size - 1] = temp; + } + + // If size is even, swap ith + // and (size-1)th i.e last element + else { + let temp = a[i]; + a[i] = a[size - 1]; + a[size - 1] = temp; + } + } + } +} + +function factorial(n) { + let fact = 1; + + for (let i = 1; i <= n; i++) { + fact *= i; + } + + return fact; +} \ No newline at end of file diff --git a/pages/lab-1.html b/pages/lab-1.html new file mode 100644 index 0000000..8e8010d --- /dev/null +++ b/pages/lab-1.html @@ -0,0 +1,133 @@ + + + + + + + + + Lab-1 + + + + + + + + + + + + + +
+
+
+
+
+

Set Operations

+

Simple implementation of different set operations, such as: Complement, Union, Intersection and Difference

+
+
+
+
+ +
+
+
+
+
+
+
+ +
+ +
+
+ +
+ +
+
+ +
+ +
+ +
+
+
+ +
+ +
+ +
+
+ +
+ +
+ +
+ +
+ +
+
+
+
+
+
+
+
+
+ + + + + \ No newline at end of file diff --git a/pages/lab-2.html b/pages/lab-2.html new file mode 100644 index 0000000..bbaeab6 --- /dev/null +++ b/pages/lab-2.html @@ -0,0 +1,14 @@ + + + + + + + Document + + + + + + + \ No newline at end of file diff --git a/pages/lab-3.html b/pages/lab-3.html new file mode 100644 index 0000000..28b6bd0 --- /dev/null +++ b/pages/lab-3.html @@ -0,0 +1,148 @@ + + + + + + + + + Lab-1 + + + + + + + + + + + + + +
+
+
+
+
+

Lab 3 - Generating permutations and combinations

+

Simple implementation of algorithms for generating permutations and combinations of some set. A built in timer included in order to make your research much more pleasent and faster

+
+
+
+
+
+ +
+ +
+ +
+
+
+
+ +
+ +
+
+ +
+ +
+
+
+ +
+ + +
+ + +
+
+
+ +
+
+ +
+
+
+
+ +
+ +
+
+ +
+ +
+
+
+ +
+ + +
+ + +
+
+
+ +
+ +
+ + + \ No newline at end of file