New update

JS/ChessBoard.js

@@ -0,0 +1,13 @@
+alert('Write dimension of board K x N =','');
+var k = prompt('Write dimension K =','');
+var n =	prompt('Write dimension N =','');
+var Arr =[];
+
+for (var j=1;(j<=n);j++){
+Arr+="#"+" ";
+}
+
+for (var i=1;(i<=k);i++){
+var even = i%2;
+(even==0)?console.log(" "+Arr):console.log(Arr);
+}

JS/Comparison.js

@@ -0,0 +1,18 @@
+var obj={here:{is:"an"},object:2};
+var deepEqual=(a,b)=>{
+if((a&&b)!=null){
+	if (((typeof a)&&(typeof b))=="object") {
+		for (var part in a) {
+		if (b.hasOwnProperty(part))
+        return deepEqual(a[part], b[part]);
+		}
+	}
+	else{
+	if(a===b) {return true;}
+	else {return false;}
+}
+}else {return true;}
+}
+console.log(deepEqual(obj,obj));
+console.log(deepEqual(obj,{here:1,object:2}));
+console.log(deepEqual(obj,{here:{is:"an"},object:2})); 

JS/FizzBuzz.js

@@ -0,0 +1,5 @@
+for (var i=1;i<100;i++){
+var remainder3 = i%3;
+var remainder5 = i%5;
+var result = (remainder5 != 0)?(remainder3 != 0)?console.log(i):console.log("Fizz"):(remainder3 != 0)?console.log("Buzz"):console.log("FizzBuzz");
+}

JS/List.js

@@ -0,0 +1,43 @@
+var arrayToList=(arr)=>{
+var list = {value: arr[0] };
+var list2 = list;
+for(var i=1;i<arr.length;i++){
+list2.next = {value: arr[i] }; 
+list2 = list2.next;
+}
+return list;
+}
+console.log(arrayToList([10,20]));
+
+var ListToarray=(list)=>{
+var arr=[];
+var i=0;
+while(list!=null){
+arr[i]=list.value;
+i++;
+list = list.next;
+}
+return arr;
+}
+console.log(ListToarray(arrayToList([10,20,30])));
+
+var prepend=(a,list)=>{
+var list1;
+list1={value:a};
+list1.next = list;
+return list1;
+}
+console.log(prepend(20,null));
+console.log(prepend(10,prepend(20,null)));
+
+var number;
+var nth=(list,b)=>{
+var count=0;
+number=list.value;
+if (count!=b){
+	list1=list.next;
+	nth(list1,(b-1));
+	}
+return number;
+}
+console.log(nth(arrayToList([10,20,30]),1));

JS/Recursion.html

@@ -0,0 +1,13 @@
+<script>
+var N = prompt("Write N = ",'');
+var k = Math.abs(N);
+function Recursia(k)
+{
+	if(k == 0) 
+	return 0;
+	if(k == 1)
+	return 1;
+	if((k!=0)&&(k!=1)) return Recursia(k-2);
+}
+document.write(Recursia(k));
+</script>

JS/Recursion.js

@@ -0,0 +1,8 @@
+var N = prompt("Write N = ",'');
+var k = Math.abs(N);
+function Recursia(k)
+{
+	return(k == 0)?0:1;
+	if((k!=0)&&(k!=1)) return Recursia(k-2);
+}
+console.log(Recursia(k));

JS/Reverse.js

@@ -0,0 +1,27 @@
+function reverseArray(mass){
+var mass1 = [];
+for(var i=mass.length-1;i>=0;i--){
+mass1[mass.length-i-1]=mass[i];}
+return mass1;
+}
+console.log(reverseArray(["A","B","C"]));
+
+var arr=[1,2,3,4,5]
+function reverseArrayInPlace(arr){
+var mass2 = [];
+for(var i=arr.length-1;i>=0;i--){
+mass2[arr.length-i-1]=arr[i];}
+return mass2;
+}
+console.log(reverseArrayInPlace(arr));
+
+/*более эффективный
+var arr=[1,2,3,4,5]
+arr.reverseArrayInPlace=function(){
+var mass2 = [];
+for(var i=this.length-1;i>=0;i--){
+mass2[this.length-i-1]=this[i];}
+return mass2;
+}
+console.log(arr.reverseArrayInPlace());
+*/

JS/countBeans.html

@@ -0,0 +1,31 @@
+<script>
+/*Первая часть задания*/
+var str = prompt("Write some word =",'');
+var i;
+var l=str.length;
+function countsBs(str)
+{
+	for(i=0;i<l;i++)
+	{
+	str.charAt(i);
+	}
+return i;
+}
+document.write(countsBs(str));
+/*Вторая часть задания*/
+var B = prompt("Write element for reserch = ",'');
+var k=0;
+var elem;
+function countChar(str,B)
+{
+	for(i=0;i<l;i++)
+	{	
+		if(elem == B) return B;
+		else
+		{
+		elem=str.charAt(i);
+		}k++;
+	}
+}
+document.write("<p>"+countChar(str,B)+" in "+k+" place </p>");
+</script>

JS/countBeans.js

@@ -0,0 +1,22 @@
+/*Первая часть задания*/
+var str = prompt("Write some word =",'');
+var l=str.length;
+var countsBs=(str)=>{
+	for(var i=0;i<l;i++){
+	str.charAt(i);
+	}
+return i;
+}
+console.log(countsBs(str));
+/*Вторая часть задания*/
+var B = prompt("Write element for reserch = ",'');
+var k=0;
+var elem;
+var countChar=(str,B)=>{
+	for(i=0;i<l;i++){	
+		if(elem == B) return B;
+		else{elem=str.charAt(i);}
+		k++;
+	}
+}
+console.log(countChar(str,B)+" in "+k+" place");

JS/menu.html

@@ -0,0 +1,19 @@
+<html>
+<!--Глава: Структура программ-->
+
+<script src="tringleinaloap.js"></script>
+<script src="FizzBuzz.js"></script>
+<script src="ChessBoard.js"></script>
+
+<!--Глава: Функции-->
+<script src="min.js"></script>
+<script src="Recursion.js"></script>
+<script src="countBeans.js"></script>
+
+<!--Глава: Структуры данных. Объекты и массивы-->
+<script src="sumRange.js"></script>
+<script src="Reverse.js"></script>
+<script src="List.js"></script>
+<script src="Comparison.js"></script>
+
+</html>

JS/min.js

@@ -0,0 +1,6 @@
+console.log("Глава: Функции");
+alert("Write two numbers a and b for comparison");
+var a = prompt("Write a = ",'');
+var b = prompt("Write b = ",'');
+var min=(a,b)=>{ return (a>b)? b:a;}
+console.log(min(a,b));

JS/sumRange.html

@@ -0,0 +1,38 @@
+<script>
+var start = prompt("Start with =",'');
+var finish = prompt("Finish on =",'');
+var mass=[];
+function range(b,e)
+{
+	for(var i=1;i<=e;i++)
+	{
+	mass.push(i);
+	}
+return mass;
+}
+document.write(range(start,finish));
+//Дополненная range из третьей части задания
+/*var l=prompt("Write step = ",'');
+var step = Math.abs(l);
+function range(b,e,s)
+{
+	for(var i=1;i<=e;i++)
+	{
+	mass.push(i);
+	i+=(s-1);
+	}
+return mass;
+}
+document.write(range(start,finish,step));
+*/
+var elem=0;
+function sum(mass)
+{
+	for(var i=0;i<finish;i++)
+	{
+	elem+=mass[i];
+	}
+return elem;
+}
+document.write("<p>"+sum(mass)+"</p>");
+</script>

JS/sumRange.js

@@ -0,0 +1,31 @@
+console.log("Глава: Структуры данных. Объекты и массивы");
+var start = prompt("Start with =",'');
+var finish = prompt("Finish on =",'');
+var mass=[];
+function range(b,e){
+	for(var i=1;i<=e;i++){
+	mass.push(i);
+	}
+return mass;
+}
+console.log(range(start,finish));
+//Дополненная range из третьей части задания
+/*var l=prompt("Write step = ",'');
+var step = Math.abs(l);
+function range(b,e,s){
+	for(var i=1;i<=e;i++){
+	mass.push(i);
+	i+=(s-1);
+	}
+return mass;
+}
+console.log(range(start,finish,step));
+*/
+var elem=0;
+function sum(mass){
+	for(var i=0;i<finish;i++){
+	elem+=mass[i];
+	}
+return elem;
+}
+console.log(sum(mass));

JS/tringleinaloap.js

@@ -0,0 +1,7 @@
+console.log("Глава: Структура программ");
+var a="#";
+for(var i=0;i<=6;i++){
+console.log(a);
+a+="#";
+}
+