Category Archives: C#

C#.StackOnOneLinkedList

Posted on 22.09.2017 by Stanislav_Panteleev

Git

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace StackOnOneLinkedList
{
    class Program
    {
        static void Main(string[] args)
        {
            // fill stack with Count elements
            int Count = 10;
            CustomStackLinkedList<string> stack = new CustomStackLinkedList<string>();
            //FixedGenericsStack<string> stack = new FixedGenericsStack<string>(Count);
            Random r = new Random();
            Console.WriteLine("lets fill stack with Count elements");
            for (int i = 0; i < Count; i++)
            {
                int someRandomNumber = r.Next(100);
                stack.push(someRandomNumber.ToString());
            }

            // iterator
            foreach (var s in stack) { Console.WriteLine(s.ToString()); }

            Console.WriteLine("What size of stack now?");
            Console.WriteLine(stack.size());

            Console.WriteLine("lets take last 5 elements from stack");
            for (int i = 0; i < 5; i++)
            {
                Console.WriteLine(stack.pop());
            }
            Console.WriteLine("What size of stack now?");
            Console.WriteLine(stack.size());
            Console.WriteLine("If stack isEmpty?");
            if (stack.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

            Console.ReadLine();


        }
    }

    class CustomStackLinkedList<T> : IEnumerable<T>
    {
        Node<T> first;
        private int N;
        class Node<T>
        {
            public T item;
            public Node<T> next;
        }

        public bool isEmpty() { return (first == null) || (N == 0); }
        public int size() { return N; }
        public void push(T item)
        {
            // adding to the begining
            Node<T> oldfirst = first;
            first = new Node<T>();
            first.item = item;
            first.next = oldfirst;
            N++;
        }

        public T pop()
        {
            T item = first.item;
            first = first.next;
            N--;
            return item;
        }


        /*
        IEnumerator IEnumerable.GetEnumerator()
        {
            //throw new NotImplementedException();
        }
    */

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.item;
                node = node.next;
            }
        }

    }

}

100

101

102

103

using System;

using System.Collections;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace StackOnOneLinkedList

{

class Program

{

static void Main(string[] args)

{

// fill stack with Count elements

int Count = 10;

CustomStackLinkedList<string> stack = new CustomStackLinkedList<string>();

//FixedGenericsStack<string> stack = new FixedGenericsStack<string>(Count);

Random r = new Random();

Console.WriteLine("lets fill stack with Count elements");

for (int i = 0; i < Count; i++)

{

int someRandomNumber = r.Next(100);

stack.push(someRandomNumber.ToString());

}

// iterator

foreach (var s in stack) { Console.WriteLine(s.ToString()); }

Console.WriteLine("What size of stack now?");

Console.WriteLine(stack.size());

Console.WriteLine("lets take last 5 elements from stack");

for (int i = 0; i < 5; i++)

{

Console.WriteLine(stack.pop());

}

Console.WriteLine("What size of stack now?");

Console.WriteLine(stack.size());

Console.WriteLine("If stack isEmpty?");

if (stack.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

Console.ReadLine();

}

class CustomStackLinkedList<T> : IEnumerable<T>

{

Node<T> first;

private int N;

class Node<T>

{

public T item;

public Node<T> next;

}

public bool isEmpty() { return (first == null) || (N == 0); }

public int size() { return N; }

public void push(T item)

{

// adding to the begining

Node<T> oldfirst = first;

first = new Node<T>();

first.item = item;

first.next = oldfirst;

N++;

}

public T pop()

{

T item = first.item;

first = first.next;

N--;

return item;

}

IEnumerator IEnumerable.GetEnumerator()

{

//throw new NotImplementedException();

}

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<T> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.item;

node = node.next;

}

Posted in C# | Comments Off

C#. OneLinkedList

Posted on 22.09.2017 by Stanislav_Panteleev

Example

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace SimpleAdjListExample
{
    class Program
    {
        static void Main(string[] args)
        {
            Node<string> first = new Node<string>();
            Node<string> second = new Node<string>();
            Node<string> third = new Node<string>();

            first.item = "to";
            second.item = "be";
            third.item = "or";

            first.next = second;
            second.next = third;

            // insert to begin of list
            Node<string> oldfirst = first;
            first = new Node<string>();
            first.item = "not";
            first.next = oldfirst;

            //delete from begin
            first = null;

            //insert to the end
            Node<string> oldlast = third;
            third = new Node<string>();
            third.item = "some item";

            // traverse
            for (Node<string> x = first; x != null; x = x.next)
            {
                x.item = "someValue";                
            }

        }
    }

    public class Node<T>
    {
        public T item;
        public Node<T> next;
        
    }


}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace SimpleAdjListExample

{

class Program

{

static void Main(string[] args)

{

Node<string> first = new Node<string>();

Node<string> second = new Node<string>();

Node<string> third = new Node<string>();

first.item = "to";

second.item = "be";

third.item = "or";

first.next = second;

second.next = third;

// insert to begin of list

Node<string> oldfirst = first;

first = new Node<string>();

first.item = "not";

first.next = oldfirst;

//delete from begin

first = null;

//insert to the end

Node<string> oldlast = third;

third = new Node<string>();

third.item = "some item";

// traverse

for (Node<string> x = first; x != null; x = x.next)

{

x.item = "someValue";

}

public class Node<T>

{

public T item;

public Node<T> next;

}

Posted in C# | Comments Off

C#.Algo.StackOnLinkedList

Posted on 21.09.2017 by Stanislav_Panteleev

Git

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace StackOnOneLinkedList
{
    class Program
    {
        static void Main(string[] args)
        {
            // fill stack with Count elements
            int Count = 10;
            CustomStackLinkedList<string> stack = new CustomStackLinkedList<string>();
            //FixedGenericsStack<string> stack = new FixedGenericsStack<string>(Count);
            Random r = new Random();
            Console.WriteLine("lets fill stack with Count elements");
            for (int i = 0; i < Count; i++)
            {
                int someRandomNumber = r.Next(100);
                stack.push(someRandomNumber.ToString());
            }

            // iterator
            foreach (var s in stack) { Console.WriteLine(s.ToString()); }

            Console.WriteLine("What size of stack now?");
            Console.WriteLine(stack.size());

            Console.WriteLine("lets take last 5 elements from stack");
            for (int i = 0; i < 5; i++)
            {
                Console.WriteLine(stack.pop());
            }
            Console.WriteLine("What size of stack now?");
            Console.WriteLine(stack.size());
            Console.WriteLine("If stack isEmpty?");
            if (stack.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

            Console.ReadLine();


        }
    }

    class CustomStackLinkedList<T> : IEnumerable<T>
    {
        Node<T> first;
        private int N;
        class Node<T>
        {
            public T item;
            public Node<T> next;
        }

        public bool isEmpty() { return (first == null) || (N == 0); }
        public int size() { return N; }
        public void push(T item)
        {
            // adding to the begining
            Node<T> oldfirst = first;
            first = new Node<T>();
            first.item = item;
            first.next = oldfirst;
            N++;
        }

        public T pop()
        {
            T item = first.item;
            first = first.next;
            N--;
            return item;
        }


        /*
        IEnumerator IEnumerable.GetEnumerator()
        {
            //throw new NotImplementedException();
        }
    */

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var node = first;
            while (node != null)
            {
                yield return node.item;
                node = node.next;
            }
        }

    }

}

100

101

102

103

using System;

using System.Collections;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace StackOnOneLinkedList

{

class Program

{

static void Main(string[] args)

{

// fill stack with Count elements

int Count = 10;

CustomStackLinkedList<string> stack = new CustomStackLinkedList<string>();

//FixedGenericsStack<string> stack = new FixedGenericsStack<string>(Count);

Random r = new Random();

Console.WriteLine("lets fill stack with Count elements");

for (int i = 0; i < Count; i++)

{

int someRandomNumber = r.Next(100);

stack.push(someRandomNumber.ToString());

}

// iterator

foreach (var s in stack) { Console.WriteLine(s.ToString()); }

Console.WriteLine("What size of stack now?");

Console.WriteLine(stack.size());

Console.WriteLine("lets take last 5 elements from stack");

for (int i = 0; i < 5; i++)

{

Console.WriteLine(stack.pop());

}

Console.WriteLine("What size of stack now?");

Console.WriteLine(stack.size());

Console.WriteLine("If stack isEmpty?");

if (stack.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

Console.ReadLine();

}

class CustomStackLinkedList<T> : IEnumerable<T>

{

Node<T> first;

private int N;

class Node<T>

{

public T item;

public Node<T> next;

}

public bool isEmpty() { return (first == null) || (N == 0); }

public int size() { return N; }

public void push(T item)

{

// adding to the begining

Node<T> oldfirst = first;

first = new Node<T>();

first.item = item;

first.next = oldfirst;

N++;

}

public T pop()

{

T item = first.item;

first = first.next;

N--;

return item;

}

IEnumerator IEnumerable.GetEnumerator()

{

//throw new NotImplementedException();

}

System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()

{

return GetEnumerator();

}

public IEnumerator<T> GetEnumerator()

{

var node = first;

while (node != null)

{

yield return node.item;

node = node.next;

}

Posted in C# | Comments Off

С#. Algo. FixedStack

Posted on 20.09.2017 by Stanislav_Panteleev

Git

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace FixedStack
{
    class Program
    {
        static void Main(string[] args)
        {                   
                // fill stack with Count elements
                int Count = 10;
            //FixedCapacityStackOfStrings s = new FixedCapacityStackOfStrings(Count);
            FixedGenericsStack<string> s = new FixedGenericsStack<string>(Count);
            Random r = new Random();
                Console.WriteLine("lets fill stack with Count elements");
                for (int i = 0; i < Count; i++)
                {
                    int someRandomNumber = r.Next(100);
                    s.push(someRandomNumber.ToString());
                    Console.WriteLine(someRandomNumber);
                }
            Console.WriteLine("What size of stack now?");
            Console.WriteLine(s.size());

            Console.WriteLine("lets take last 5 elements from stack");
                for (int i = 0; i < 5; i++)
                {
                    Console.WriteLine(s.pop());
                }
            Console.WriteLine("What size of stack now?");
            Console.WriteLine(s.size());
            Console.WriteLine("If stack isEmpty?");
            if (s.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

            Console.ReadLine();
            }        
    }

    class FixedCapacityStackOfStrings
    {
        private string[] a;
        public int N;
        public FixedCapacityStackOfStrings(int ACapacity)
        {
            a = new string[ACapacity];
        }
        public bool isEmpty() { return N == 0; }
        public int size() { return N; }
        public void push(string item)
        {
            a[N++] = item;
        }
        public string pop()
        {
            return a[--N];
        }
    }

    class FixedGenericsStack<T>
    {
        private T[] a;
        public int N;
        public FixedGenericsStack(int ACapacity)
        {
            a = new T[ACapacity];
        }
        public bool isEmpty() { return N == 0; }
        public int size() { return N; }
        public void push(T item)
        {
            a[N++] = item;
        }
        public T pop()
        {
            return a[--N];
        }
    }


}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace FixedStack

{

class Program

{

static void Main(string[] args)

{

// fill stack with Count elements

int Count = 10;

//FixedCapacityStackOfStrings s = new FixedCapacityStackOfStrings(Count);

FixedGenericsStack<string> s = new FixedGenericsStack<string>(Count);

Random r = new Random();

Console.WriteLine("lets fill stack with Count elements");

for (int i = 0; i < Count; i++)

{

int someRandomNumber = r.Next(100);

s.push(someRandomNumber.ToString());

Console.WriteLine(someRandomNumber);

}

Console.WriteLine("What size of stack now?");

Console.WriteLine(s.size());

Console.WriteLine("lets take last 5 elements from stack");

for (int i = 0; i < 5; i++)

{

Console.WriteLine(s.pop());

}

Console.WriteLine("What size of stack now?");

Console.WriteLine(s.size());

Console.WriteLine("If stack isEmpty?");

if (s.isEmpty()) Console.WriteLine("Yes"); else Console.WriteLine("No");

Console.ReadLine();

}

class FixedCapacityStackOfStrings

{

private string[] a;

public int N;

public FixedCapacityStackOfStrings(int ACapacity)

{

a = new string[ACapacity];

}

public bool isEmpty() { return N == 0; }

public int size() { return N; }

public void push(string item)

{

a[N++] = item;

}

public string pop()

{

return a[--N];

}

class FixedGenericsStack<T>

{

private T[] a;

public int N;

public FixedGenericsStack(int ACapacity)

{

a = new T[ACapacity];

}

public bool isEmpty() { return N == 0; }

public int size() { return N; }

public void push(T item)

{

a[N++] = item;

}

public T pop()

{

return a[--N];

}

Posted in C# | Comments Off

С#. Algo. BinarySearch

Posted on 20.09.2017 by Stanislav_Panteleev

Git Recusive, Non Recursive, Generic, Non Generic binary search

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BinarySearch
{
    class Program
    {
        static void Main(string[] args)
        {
            Random r = new Random();
            //int[] a = new int[100];
            //for (int i = 0; i < 100; i++) a[i] = r.Next(100);
            int[] a = { 1, 3, 5, 6, 12,30,40,55,16,18,20 };
            //int[] a = { 1, 5, 3 };
            Array.Sort(a);
            if (BinarySearch(5, a) != -1) Console.WriteLine("Non recursive BS: Element found");
            if (BinarySearchGeneric<int>(5, a) != -1) Console.WriteLine("Non recursive Generic BS: Element found");
            if (BinarySearchRecursive(5, a, 0, a.Length) != -1) Console.WriteLine("Recursive BS: Element found");
            if (BinarySearchRecursiveGeneric<int>(5, a, 0, a.Length) != -1) Console.WriteLine("Recursive Generic BS: Element found");

            Console.ReadLine();

        }

        static int BinarySearch(int key, int[] a)
        {
            int low = 0;
            int hi = a.Length - 1;
            while (low <= hi)
            {
                int mid = (low + hi) / 2;
                if (key < a[mid]) hi = mid - 1;
                else if (key > a[mid]) low = mid + 1;
                else return mid;
            }
            return -1;
        }

        public static int BinarySearchRecursive(int key, int[] a, int lo, int hi)
        {
            if (hi < lo) return lo;
            int mid = lo + (hi - lo) / 2;
            if (key < a[mid]) return BinarySearchRecursive(key, a, lo, mid - 1);            
            else if (key > a[mid]) return BinarySearchRecursive(key, a, mid + 1, hi);
            else return mid;
        }

        static int BinarySearchGeneric<T>(T key, int[] a) where T : IComparable
        {
            int low = 0;
            int hi = a.Length - 1;
            while (low <= hi)
            {
                int mid = (low + hi) / 2;
                int cmp = key.CompareTo(a[mid]);
                if (cmp < 0) { hi = mid - 1; }
                else if (cmp > 0) { low = mid + 1; }
                else return mid;
            }
            return -1;
        }

        public static int BinarySearchRecursiveGeneric<T>(T key, int[] a, int lo, int hi) where T : IComparable
        {
            //  if (hi < lo) return lo;
            int mid = lo + (hi - lo) / 2;
            int cmp = key.CompareTo(a[mid]);
            if (cmp < 0) { return BinarySearchRecursiveGeneric(key, a, lo, mid - 1); }
            else if (cmp > 0) { return BinarySearchRecursiveGeneric(key, a, mid + 1, hi); }
            else return mid;            
        }
    }
}

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BinarySearch

{

class Program

{

static void Main(string[] args)

{

Random r = new Random();

//int[] a = new int[100];

//for (int i = 0; i < 100; i++) a[i] = r.Next(100);

int[] a = { 1, 3, 5, 6, 12,30,40,55,16,18,20 };

//int[] a = { 1, 5, 3 };

Array.Sort(a);

if (BinarySearch(5, a) != -1) Console.WriteLine("Non recursive BS: Element found");

if (BinarySearchGeneric<int>(5, a) != -1) Console.WriteLine("Non recursive Generic BS: Element found");

if (BinarySearchRecursive(5, a, 0, a.Length) != -1) Console.WriteLine("Recursive BS: Element found");

if (BinarySearchRecursiveGeneric<int>(5, a, 0, a.Length) != -1) Console.WriteLine("Recursive Generic BS: Element found");

Console.ReadLine();

}

static int BinarySearch(int key, int[] a)

{

int low = 0;

int hi = a.Length - 1;

while (low <= hi)

{

int mid = (low + hi) / 2;

if (key < a[mid]) hi = mid - 1;

else if (key > a[mid]) low = mid + 1;

else return mid;

}

return -1;

}

public static int BinarySearchRecursive(int key, int[] a, int lo, int hi)

{

if (hi < lo) return lo;

int mid = lo + (hi - lo) / 2;

if (key < a[mid]) return BinarySearchRecursive(key, a, lo, mid - 1);

else if (key > a[mid]) return BinarySearchRecursive(key, a, mid + 1, hi);

else return mid;

}

static int BinarySearchGeneric<T>(T key, int[] a) where T : IComparable

{

int low = 0;

int hi = a.Length - 1;

while (low <= hi)

{

int mid = (low + hi) / 2;

int cmp = key.CompareTo(a[mid]);

if (cmp < 0) { hi = mid - 1; }

else if (cmp > 0) { low = mid + 1; }

else return mid;

}

return -1;

}

public static int BinarySearchRecursiveGeneric<T>(T key, int[] a, int lo, int hi) where T : IComparable

{

// if (hi < lo) return lo;

int mid = lo + (hi - lo) / 2;

int cmp = key.CompareTo(a[mid]);

if (cmp < 0) { return BinarySearchRecursiveGeneric(key, a, lo, mid - 1); }

else if (cmp > 0) { return BinarySearchRecursiveGeneric(key, a, mid + 1, hi); }

else return mid;

}

Posted in C# | Comments Off

C#. Algorithms. Greatest common divisor

Posted on 20.09.2017 by Stanislav_Panteleev

Git

    public static int gcd(int p, int q)
        {
            if (q == 0) return p;
            int r = p % q;
            return gcd(q, r);
        }

public static int gcd(int p, int q)

{

if (q == 0) return p;

int r = p % q;

return gcd(q, r);

}

Posted in C# | Comments Off

C#. Connection string examples

Posted on 09.09.2017 by Stanislav_Panteleev

localdb examples

  <connectionStrings>
    <add name ="DBConnection"
  connectionString="Data Source=(localdb)\MSSQLLocalDB;Initial Catalog=userstore.mdf;Integrated Security=True;Connect Timeout=15;Encrypt=False;TrustServerCertificate=True;ApplicationIntent=ReadWrite;MultiSubnetFailover=False; " providerName="System.Data.SqlClient"  />
  </connectionStrings>

<add name ="DBConnection"

connectionString="Data Source=(localdb)\MSSQLLocalDB;Initial Catalog=userstore.mdf;Integrated Security=True;Connect Timeout=15;Encrypt=False;TrustServerCertificate=True;ApplicationIntent=ReadWrite;MultiSubnetFailover=False; " providerName="System.Data.SqlClient" />

</connectionStrings>

With attachment, from ASP MVC, file will be saved in AppData dir

  <connectionStrings>
    <add name="BookContext" connectionString="Data Source=(localdb)\MSSQLLocalDB;AttachDbFilename='|DataDirectory|\Bookstore.mdf';Integrated Security=True"
 providerName="System.Data.SqlClient" />
  </connectionStrings>

<add name="BookContext" connectionString="Data Source=(localdb)\MSSQLLocalDB;AttachDbFilename='|DataDirectory|\Bookstore.mdf';Integrated Security=True"

providerName="System.Data.SqlClient" />

</connectionStrings>

ms sql server example #1

<connectionStrings>
    <add name="BookContext" connectionString="Data Source=.\SQLEXPRESS;Initial Catalog=Bookstore;Integrated Security=True"
 providerName="System.Data.SqlClient"/>
  </connectionStrings>

<add name="BookContext" connectionString="Data Source=.\SQLEXPRESS;Initial Catalog=Bookstore;Integrated Security=True"

providerName="System.Data.SqlClient"/>

</connectionStrings>

<connectionStrings>
    <add name ="DBConnection"
  connectionString="
    Data Source=DESKTOP-T9U6IEP\SQLEXPRESS;
    Initial Catalog=userstore.mdf;
    Integrated Security=True;
    Connect Timeout=15;
    Encrypt=False;
    TrustServerCertificate=True;
    ApplicationIntent=ReadWrite;
    MultiSubnetFailover=False;
    " providerName="System.Data.SqlClient"  />
  </connectionStrings>

<add name ="DBConnection"

connectionString="

Data Source=DESKTOP-T9U6IEP\SQLEXPRESS;

Initial Catalog=userstore.mdf;

Integrated Security=True;

Connect Timeout=15;

Encrypt=False;

TrustServerCertificate=True;

ApplicationIntent=ReadWrite;

MultiSubnetFailover=False;

" providerName="System.Data.SqlClient" />

</connectionStrings>

Posted in C# | Comments Off

C#. Entity. CodeSecondApproach

Posted on 08.09.2017 by Stanislav_Panteleev

If db already exists and filled with data we just can create Entities in code… For example lets create db manually… in localdb of SQL Server View->Server Explorer. Next in serverName type “(localdb)\MSSQLLocalDB” for vs 2015 and choose new datebase … Continue reading →

Posted in C# | Comments Off

С#. LocalDB adventure

Posted on 08.09.2017 by Stanislav_Panteleev

just open cmd and type SqlLocalDB.exe start MSSQLLocalDB What is localDB? ProblemAndDecision Decision In Visual Studio 2012 all I had to do was enter:

(localdb)\v11.0

1 2	(localdb)\v11.0

or Visual Studio 2015 changed to:

(localdb)\MSSQLLocalDB

1 2	(localdb)\MSSQLLocalDB

as the server name when adding a Microsoft SQL Server … Continue reading →

Posted in C# | Comments Off

C#. Entity. Инициализация базы данных

Posted on 08.09.2017 by Stanislav_Panteleev

Если нам необходимо, чтобы при первом обращении база данных уже была заполнена некоторыми начальными значениями, то мы можем произвести ее инициализацию. Инициализация происходит при первом обращении к контексту данных. Для инициализации мы можем использовать один из классов инициализаторов, которые имеются … Continue reading →

Posted in C# | Comments Off

Category Archives: C#

C#.StackOnOneLinkedList

C#. OneLinkedList

C#.Algo.StackOnLinkedList

С#. Algo. FixedStack

С#. Algo. BinarySearch

C#. Algorithms. Greatest common divisor

C#. Connection string examples

C#. Entity. CodeSecondApproach

С#. LocalDB adventure

C#. Entity. Инициализация базы данных

MY PROJECTS

Recent Posts

Categories