Coding Corner

C Program to check whether an year is a Leap Year or not.

noreply@blogger.com (Avinash) — Mon, 12 Jun 2017 19:58:00 +0000

This is a C program which checks the input year for Leap year.

A year is said to be a leap year, if it exactly divisible by 4 but not for century years(years ending with 00) and also an year is called Leap Year when it is exactly divisible by 400.

PROGRAM :

#include <stdio.h>
#include <stdlib.h>

void checkLeapYear(int);
int main()
{
    int input_year;
    printf("\n Enter any year : ");
    scanf("%d",&input_year);
    checkLeapYear(input_year);
    getch();
    return 0;
}

void checkLeapYear(int year)
{
    int r1,r2;
    r1 = year%4 ;
    r2 = year%100;
    if((r1 == 0) && (r2!=0) || year%400 == 0)
    {
        printf("\n The given year %d is a LEAP Year",year);
    }
    else
    {
        printf("\n The given year %d is NOT a Leap Year",year);
    }
}

Output:

C Program to check whether an year is a Leap Year or not

Python program to reverse a string using reversed() function

noreply@blogger.com (Avinash) — Tue, 30 Aug 2016 05:32:00 +0000

A simple python program to reverse a given string. Here we are goin to use reversed() function. We can't directly print reversed as it is not a string but it returns type 'reversed'. So we will join it to a empty string.

Syntax : ''.join(reversed(str))

Refer below for screenshot and program,

PROGRAM :

input_string = str(input('Enter any string : '))
print("Reversed String is :" + ''.join(reversed(input_string)))

OUTPUT :

Python - Reverse a string using reversed() function

Python program to reverse a string using slice operation

noreply@blogger.com (Avinash) — Tue, 30 Aug 2016 05:01:00 +0000

A simple python program to reverse a string. Here we use slice operation to reverse a string.

Syntax : str[begin:end:step]. So by leaving begin and end, and giving a step of -1, it reverses a string.

Refer below for screenshot and program,

PROGRAM :

input_string = str(input('Enter any string : '))
print("Reversed String is : " + input_string[::-1])

OUTPUT :

Python - String reverse using slice operation

Python program to reverse a string without using slice and reversed functions

noreply@blogger.com (Avinash) — Mon, 29 Aug 2016 12:10:00 +0000

A simple python program to reverse a given string. Here we are not going to use slice operation or reversed function, which easily can reverse a string without lot of code. we are going to discuss about them in here : using slice and using reversed function.

The logic here is we read a string, read every character from the end and add it to new string.

Refer below for screenshot and program,

PROGRAM :

input_string = str(input('Enter any string : '))


def reverse(string):
    i = len(string)
    rev = ""
    while i != 0:
        rev = rev + string[i - 1]
        i -= 1
    return rev


print("Reversed String is :" + reverse(input_string))

OUTPUT :

Python - String reverse

C Program on string copy without using strcpy()

noreply@blogger.com (Avinash) — Fri, 26 Aug 2016 12:23:00 +0000

A simple C program on string copy without using library function strcpy(). Here we read each character in the first string until the end and copy it to the second string.

Refer below for screenshot and program,

Download code

PROGRAM :

#include<stdio.h>

int main()
{
    char str1[100],str2[100];
    int i=0;

    printf("Enter a string: ");
    gets(str1);

    while(str1[i]!='\0')
    {
        str2[i] = str1[i];
        i++;
    }
    str2[i]='\0';

    printf("\nCopied String: %s\n",str2);
    return 0;
}

Download code

OUTPUT :

C Program on string copy without strcpy()

Download code

C Program to concat two strings using strcat()

noreply@blogger.com (Avinash) — Thu, 25 Aug 2016 10:25:00 +0000

A simple C program which concats two strings. the second string appends to first string and forms a concatenated string.

Here string concatination is done using strcat() function.

Look below for program and the screenshot,

Download code

PROGRAM :

#include<stdio.h>
#include<string.h>

int main()
{
    char string1[50], string2[50];
    printf("\nEnter First string :");
    gets(string1);
    printf("\nEnter Second string :");
    gets(string2);
    strcat(string1,string2);
    printf("\nConcatenated string is :%s\n", string1);
    return (0);
}

Download code

OUTPUT :

C Program - String concatenation using strcat()

Download code

C Program to concat two strings without using strcat()

noreply@blogger.com (Avinash) — Thu, 25 Aug 2016 07:21:00 +0000

A simple C program which concats two strings. the second string appends to first string and forms a concatenated string.

Here string concatination is done without using strcat() function.

Look below for program and the screenshot,

Download code

PROGRAM :

#include<stdio.h>
#include<string.h>

int main()
{
    char string1[50], string2[50];
    int i, j;
    printf("\nEnter First string :");
    gets(string1);
    printf("\nEnter Second string :");
    gets(string2);
    i = strlen(string1);
    for (j = 0; string2[j] != '\0'; i++, j++)
    {
        string1[i] = string2[j];
    }
    string1[i] = '\0';
    printf("\nConcatinated string is :%s\n", string1);
    return (0);
}

Download code

OUTPUT :

C Program - String concatenation without strcat

Download code

C Program to reverse a string without using strrev()

noreply@blogger.com (Avinash) — Thu, 25 Aug 2016 05:57:00 +0000

This is a simple C program where a string is reversed by replacing its last character with first one until all the characters are replaced.

Look below for program and screenshot.

Download code

PROGRAM :

#include <stdio.h>
#include <string.h>

void reverse_string(char *str)
{
    if (str == 0 || (*str == 0) )
    {
        return;
    }
    char *start = str;
    char *end = start + strlen(str) - 1;
    char temp;
    while (end > start)
    {
        temp = *start;
        *start = *end;
        *end = temp;
        ++start;
        --end;
    }
}

int main(void)
{
    char input[50];
    printf("\nEnter the string :");
    gets(input);
    reverse_string(input);
    printf("%s\n", input);
    return 0;
}

Download code

OUTPUT :

C Program - Reverse a string

Download code

Data Structures - Infix to Postfix Conversion - Cpp

noreply@blogger.com (Avinash) — Mon, 29 Feb 2016 10:13:00 +0000

In this post we convert an infix expression to postfix expression using stack data structure .

Generally an infix expression is a normal expression where operators are present in between the operands ex : A + B * C and its postfix notation is represented as ABC*+

An infix expression is converted into its postfix notation as follows :

Create an empty Stack for pushing and poping operators and a string for storing result
First scan the infix exppression from left to right if there is no exponential operator , if there is an exponential operator scan the infix expression from right to left.
If an operand is encountered add it to the result string
If a left parenthesis is encountered push it to the stack
If a right parenthesis is encountered pop the stack until its corresponding left parenthesis is removed and append each operator to the result string
If an operator is encountered push it to the stack if the encountered operator is of lower precedence that the stack top element and pop all elements with higher or equal precedence and add to result string.
Check if there are any elements in the stack and pop them out and add to the result string.

Download code

PROGRAM :

    #include<iostream>
    #include<stack>
    #include<string>

    using namespace std;
    string InfixToPostfix(string expression);
    int HasHigherPrecedence(char operator1, char operator2);
    bool IsOperator(char C);
    bool IsOperand(char C);

    int main()
    {
        string expression;
        cout<<"Enter Infix Expression: \t";
        getline(cin,expression);
        string postfix = InfixToPostfix(expression);
        cout<<"Postfix expression = \t"<<postfix<<"\n";
        return 0;
    }
    string InfixToPostfix(string expression)
    {

        stack<char> S;
        string postfix = "";
        for(int i = 0; i< expression.length(); i++)
        {
        if(expression[i] == ' ' || expression[i] == ',')
            continue;
        else if(IsOperator(expression[i]))
        {
            while(!S.empty() && S.top() != '(' && HasHigherPrecedence(S.top(),expression[i]))
            {
                postfix+= S.top();
                S.pop();
            }
            S.push(expression[i]);
        }
        else if(IsOperand(expression[i]))
        {
            postfix +=expression[i];
        }

        else if (expression[i] == '(')
        {
            S.push(expression[i]);
        }

        else if(expression[i] == ')')
        {
            while(!S.empty() && S.top() !=  '(')
            {
                postfix += S.top();
                S.pop();
            }
            S.pop();
        }
        }

        while(!S.empty())
        {
        postfix += S.top();
        S.pop();
        }

        return postfix;
    }
    bool IsOperand(char C)
    {
        if(C >= '0' && C <= '9') return true;
        if(C >= 'a' && C <= 'z') return true;
        if(C >= 'A' && C <= 'Z') return true;
        return false;
    }
    bool IsOperator(char C)
    {
        if(C == '+' || C == '-' || C == '*' || C == '/' || C== '^')
        return true;
        return false;
    }
    int IsRightAssociative(char op)
    {
        if(op == '^')
        return true;
        return false;
    }
    bool IsLeftParenthesis(char ch)
    {
        if (ch == '(')
        return true;
        return false;
    }
    bool IsRightParenthesis(char ch)
    {
        if (ch == ')')
        return true;
        return false;
    }
    int GetOperatorWeight(char op)
    {
        int weight = -1;
        switch(op)
        {
        case '+':
        case '-':
        weight = 1;
        break;
        case '*':
        case '/':
        weight = 2;
        break;
        case '^':
        weight = 3;
        break;
        }
        return weight;
    }
    int HasHigherPrecedence(char op1, char op2)
    {
        int op1Weight = GetOperatorWeight(op1);
        int op2Weight = GetOperatorWeight(op2);
        if(op1Weight == op2Weight)
        {
        if(IsRightAssociative(op1))
            return false;
        else
            return true;
        }
        return op1Weight > op2Weight ?  true: false;
    }

Download code

OUTPUT :

Cpp - Data Structures - Infix to Postfix

Data Structures - Java Program to implement Linked List Operations - Insert , Delete , Update , Display

noreply@blogger.com (Avinash) — Thu, 25 Feb 2016 17:36:00 +0000

Linked List is another data structure consisting of group of nodes which together represent a sequence. Each node has two parts one for the value and other for link to the next node.
Linked lists allows dynamic memory allocation.

A singly linked list whose nodes contain two fields: an integer value and a link to the next node

Some of the operations in a linked list are :

Insertion into the list
Deletion from the list
Updation of the value
Display the list

Download code

PROGRAM :

package mycodingcorner;

    import java.util.Scanner;

    class Node {
     protected int data;
     protected Node link;

     public Node() {
      link = null;
      data = 0;
     }

     public Node(int d, Node n) {
      data = d;
      link = n;
     }

     public void setLink(Node n) {
      link = n;
     }

     public void setData(int d) {
      data = d;
     }

     public Node getLink() {
      return link;
     }

     public int getData() {
      return data;
     }
    }

    class LL {
     protected Node start;
     protected Node end;
     public int size;

     public LL() {
      start = null;
      end = null;
      size = 0;
     }

     public void insertAtStart(int val) {
      Node nptr = new Node(val, null);
      size++;
      if (start == null) {
       start = nptr;
       end = start;
      } else {
       nptr.setLink(start);
       start = nptr;
      }
     }

     public void insertAtEnd(int val) {
      Node nptr = new Node(val, null);
      size++;
      if (start == null) {
       start = nptr;
       end = start;
      } else {
       end.setLink(nptr);
       end = nptr;
      }
     }

     public void insertAtPos(int val, int pos) {
      Node nptr = new Node(val, null);
      Node ptr = start;
      pos = pos - 1;
      for (int i = 1; i < size; i++) {
       if (i == pos) {
        Node tmp = ptr.getLink();
        ptr.setLink(nptr);
        nptr.setLink(tmp);
        break;
       }
       ptr = ptr.getLink();
      }
      size++;
     }

     public void deleteAtPos(int pos) {
      if (pos == 1) {
       start = start.getLink();
       size--;
       return;
      }
      if (pos == size) {
       Node s = start;
       Node t = start;
       while (s != end) {
        t = s;
        s = s.getLink();
       }
       end = t;
       end.setLink(null);
       size--;
       return;
      }
      Node ptr = start;
      pos = pos - 1;
      for (int i = 1; i < size - 1; i++) {
       if (i == pos) {
        Node tmp = ptr.getLink();
        tmp = tmp.getLink();
        ptr.setLink(tmp);
        break;
       }
       ptr = ptr.getLink();
      }
      size--;
     }

     public void display() {
      System.out.print("Elements in the list : ");
      if (size == 0) {
       System.out.print("empty\n");
       return;
      }
      if (start.getLink() == null) {
       System.out.println(start.getData());
       return;
      }
      Node ptr = start;
      System.out.print(start.getData() + "\t");
      ptr = start.getLink();
      while (ptr.getLink() != null) {
       System.out.print(ptr.getData() + "\t");
       ptr = ptr.getLink();
      }
      System.out.print(ptr.getData() + "\n");
     }
    }

    public class LinkedList {
     public static void main(String[] args) {
      Scanner scan = new Scanner(System.in);
      int ch;
      char ans = 'Y';
      LL ll = new LL();
      while (ans == 'Y' || ans == 'y') {
       System.out.println("\n1.Insert node at first");
       System.out.println("2.Insert node at last");
       System.out.println("3.Insert node at position");
       System.out.println("4.Delete Node from any Position");
       System.out.println("5.Display");
       System.out.println("6.Exit\n");
       System.out.print("Enter your choice: \t");
       ch = scan.nextInt();
       switch (ch) {
       case 1:
        System.out.print("Enter value for the node : \t");
        ll.insertAtStart(scan.nextInt());
        break;
       case 2:
        System.out.print("Enter value for the node : \t");
        ll.insertAtEnd(scan.nextInt());
        break;
       case 3:
        System.out.print("Enter value for the node : \t");
        int num = scan.nextInt();
        System.out.print("Enter position : \t");
        int pos = scan.nextInt();
        if (pos <= 1 || pos > ll.size)
         System.out.println("Invalid position\n");
        else
         ll.insertAtPos(num, pos);
        break;
       case 4:
        System.out.print("Enter position: \t");
        int dpos = scan.nextInt();
        if (dpos < 1 || dpos > ll.size)
         System.out.println("Invalid position\n");
        else
         ll.deleteAtPos(dpos);
        break;
       case 5:
        ll.display();
        break;
       case 6:
        return;
       default:
        System.out.println("\nInvalid Choice\n");
        break;
       }
       System.out.print("Do you want to continue ? (Y/N) \t");
       ans = scan.next().charAt(0);
      }
      scan.close();
     }
    }

Download code

OUTPUT :

Java - Linked List Operations - Insertion at front

Java - Linked List Operations - Insertion at last

Java - Linked List Operations - Insertion at position

Java - Linked List Operations - Deletion

Download code

Data Structures - Cpp Program to implement Linked List Operations - Insert , Delete , Update , Display

noreply@blogger.com (Avinash) — Tue, 23 Feb 2016 09:59:00 +0000

A singly linked list whose nodes contain two fields: an integer value and a link to the next node

Some of the operations in a linked list are :

Insertion into the list
Deletion from the list
Updation of the value
Display the list

Download code

PROGRAM :

        #include<iostream>
 #include<cstdio>
 #include<cstdlib>

 using namespace std;


 struct node
 {
     int value;
     struct node *next;
 }*start;

 typedef struct node snode;
 snode *newnode, *ptr, *prev, *temp;
 snode *first = NULL, *last = NULL;

 class LinkedList
 {
 public:
     node* create_node(int);
     void insertNodeFirst();
     void insertNodeLast();
     void insertNodePosition();
     void deleteNode();
     void updateNode();
     void displayList();
     LinkedList()
     {
  start = NULL;
     }
 };

 int main()
 {
     int ch;
     char ans = 'Y';
     LinkedList ll;
     while (ans == 'Y'||ans == 'y')
     {
  cout << "\n1.Insert node at first";
  cout << "\n2.Insert node at last";
  cout << "\n3.Insert node at position";
  cout << "\n4.Delete Node from any Position";
  cout << "\n5.Update Node Value";
  cout << "\n6.Display List";
  cout << "\n7.Exit\n";
  cout << "\nEnter your choice: \t";
  cin >> ch;

  switch (ch)
  {
  case 1:
      ll.insertNodeFirst();
      break;
  case 2:
      ll.insertNodeLast();
      break;
  case 3:
      ll.insertNodePosition();
      break;
  case 4:
      ll.deleteNode();
      break;
  case 5:
      ll.updateNode();
      break;
  case 6:
      ll.displayList();
      break;
  case 7:
      return 0;
      break;
  default:
      cout << "\nInvalid Choice\n";
      break;
  }
  cout << "\nDo you want to continue ? (Y/N) \t";
  cin >> ans;
     }
     return 0;
 }
 snode* createNode(int val)
 {
     newnode = (snode *)malloc(sizeof(snode));
     if (newnode == NULL)
     {
  cout << "\nMemory was not allocated";
  return 0;
     }
     else
     {
  newnode->value = val;
  newnode->next = NULL;
  return newnode;
     }
 }
 void LinkedList::insertNodeFirst()
 {
     int val;
     cout << "\nEnter the value for the node: \t";
     cin >> val;
     newnode = createNode(val);
     if (first == last && first == NULL)
     {
  first = last = newnode;
  first->next = NULL;
  last->next = NULL;
     }
     else
     {
  temp = first;
  first = newnode;
  first->next = temp;
     }
     cout << "\nInserted Successfully";
 }
 void LinkedList::insertNodeLast()
 {
     int val;

     cout << "\nEnter the value for the Node: \t";
     cin >> val;
     newnode = createNode(val);
     if (first == last && last == NULL)
     {
  first = last = newnode;
  first->next = NULL;
  last->next = NULL;
     }
     else
     {
  last->next = newnode;
  last = newnode;
  last->next = NULL;
     }
     cout << "\nInserted Successfully";
 }
 void LinkedList::insertNodePosition()
 {
     int pos, val, count = 0, i;
     cout << "\nEnter the value for the Node: \t";
     cin >> val;
     newnode = createNode(val);
     cout << "\nEnter the position: \t";
     cin >> pos;
     ptr = first;
     while (ptr != NULL)
     {
  ptr = ptr->next;
  count++;
     }
     if (pos == 1)
     {
  if (first == last && first == NULL)
  {
      first = last = newnode;
      first->next = NULL;
      last->next = NULL;
  }
  else
  {
      temp = first;
      first = newnode;
      first->next = temp;
  }
  cout << "\nInserted Successfully";
     }
     else if (pos>1 && pos<=count)
     {
  ptr = first;
  for (i = 1; i < pos; i++)
  {
      prev = ptr;
      ptr = ptr->next;
  }
  prev->next = newnode;
  newnode->next = ptr;
  cout << "\nInserted Successfully";
     }
     else
     {
  cout << "Position is out of range";
     }
 }
 void LinkedList::deleteNode()
 {
     int pos, count = 0, i;

     if (first == NULL)
     {
  cout << "No nodes in the list to delete\n";
     }
     else
     {
  cout << "\nEnter the position of value to be deleted: \t";
  cin >> pos;
  ptr = first;
  if (pos == 1)
  {
      first = ptr->next;
      cout << "\nElement deleted successfully";
  }
  else
  {
      while (ptr != NULL)
      {
          ptr = ptr->next;
          count = count + 1;
      }
      if (pos > 0 && pos <= count)
      {
          ptr = first;
          for (i = 1; i < pos; i++)
          {
              prev = ptr;
              ptr = ptr->next;
          }
          prev->next = ptr->next;
      }
      else
      {
          cout << "Position is out of range";
      }
      free(ptr);
      cout << "\nElement deleted successfully";
  }
     }
 }
 void LinkedList::updateNode()
 {
     int oldval, newval, flag = 0;

     if (first == NULL)
     {
  cout << "No nodes in the list to update\n";
     }
     else
     {
  cout << "\nEnter the value to be updated: \t";
  cin >> oldval;
  cout << "\nEnter the new value: \t";
  cin >> newval;
  for (ptr = first; ptr != NULL; ptr = ptr->next)
  {
      if (ptr->value == oldval)
      {
          ptr->value = newval;
          flag = 1;
          break;
      }
  }
  if (flag == 1)
  {
      cout << "\nUpdated Successfully";
  }
  else
  {
      cout << "\nValue not found in List";
  }
     }
 }
 void LinkedList::displayList()
 {
     if (first == NULL)
     {
  cout << "No nodes in the list to display\n";
     }
     else
     {
  for (ptr = first; ptr != NULL; ptr = ptr->next)
  {
      cout <<  ptr->value << "\t";
  }
     }
 }

Download code

OUTPUT :

Cpp - Linked List Operations - Insertion at front

Cpp - Linked List Operations - Insertion at last and any position

Cpp - Linked List Operations - Deletion of node

Cpp - Linked List Operations - Updation of value

Cpp - Linked List Operations - Display List

Download code

Data Structures - C Program to implement Linked List Operations - Insert , Delete , Update , Display

noreply@blogger.com (Avinash) — Tue, 23 Feb 2016 07:09:00 +0000

A singly linked list whose nodes contain two fields: an integer value and a link to the next node

Some of the operations in a linked list are :

Insertion into the list
Deletion from the list
Updation of the value
Display the list

Download code

PROGRAM :

#include <stdio.h>
 #include <stdlib.h>
 #include <malloc.h>

 struct node
 {
     int value;
     struct node *next;
 };
 typedef struct node snode;
 snode *newnode, *ptr, *prev, *temp;
 snode *first = NULL, *last = NULL;

 int main()
 {
     int ch;
     char ans = 'Y';
     while (ans == 'Y'||ans == 'y')
     {
  printf("\n1.Insert node at first");
  printf("\n2.Insert node at last");
  printf("\n3.Insert node at position");
  printf("\n4.Delete Node from any Position");
  printf("\n5.Update Node Value");
  printf("\n6.Display List");
  printf("\n7.Exit\n");
  printf("\nEnter your choice: \t");
  scanf("%d", &ch);

  switch (ch)
  {
  case 1:
      insertNodeFirst();
      break;
  case 2:
      insertNodeLast();
      break;
  case 3:
      insertNodePosition();
      break;
  case 4:
      deleteNode();
      break;
  case 5:
      updateNode();
      break;
  case 6:
      displayList();
      break;
  case 7:
      return 0;
      break;
  default:
      printf("\n...Invalid Choice...\n");
      break;
  }
  printf("\nDo you want to continue ? (Y/N) \t");
  scanf(" %c", &ans);
     }
     return 0;
 }
 snode* createNode(int val)
 {
     newnode = (snode *)malloc(sizeof(snode));
     if (newnode == NULL)
     {
  printf("\nMemory was not allocated");
  return 0;
     }
     else
     {
  newnode->value = val;
  newnode->next = NULL;
  return newnode;
     }
 }
 void insertNodeFirst()
 {
     int val;
     printf("\nEnter the value for the node: \t");
     scanf("%d", &val);
     newnode = createNode(val);
     if (first == last && first == NULL)
     {
  first = last = newnode;
  first->next = NULL;
  last->next = NULL;
     }
     else
     {
  temp = first;
  first = newnode;
  first->next = temp;
     }
     printf("\nInserted Successfully");
 }
 void insertNodeLast()
 {
     int val;

     printf("\nEnter the value for the Node: \t");
     scanf("%d", &val);
     newnode = createNode(val);
     if (first == last && last == NULL)
     {
  first = last = newnode;
  first->next = NULL;
  last->next = NULL;
     }
     else
     {
  last->next = newnode;
  last = newnode;
  last->next = NULL;
     }
     printf("\nInserted Successfully");
 }
 void insertNodePosition()
 {
     int pos, val, count = 0, i;
     printf("\nEnter the value for the Node: \t");
     scanf("%d", &val);
     newnode = createNode(val);
     printf("\nEnter the position: \t");
     scanf("%d", &pos);
     ptr = first;
     while (ptr != NULL)
     {
  ptr = ptr->next;
  count++;
     }
     if (pos == 1)
     {
  if (first == last && first == NULL)
  {
      first = last = newnode;
      first->next = NULL;
      last->next = NULL;
  }
  else
  {
      temp = first;
      first = newnode;
      first->next = temp;
  }
  printf("\nInserted Successfully");
     }
     else if (pos>1 && pos<=count)
     {
  ptr = first;
  for (i = 1; i < pos; i++)
  {
      prev = ptr;
      ptr = ptr->next;
  }
  prev->next = newnode;
  newnode->next = ptr;
  printf("\nInserted Successfully");
     }
     else
     {
  printf("Position is out of range");
     }
 }
 void deleteNode()
 {
     int pos, count = 0, i;

     if (first == NULL)
     {
  printf("No nodes in the list to delete\n");
     }
     else
     {
  printf("\nEnter the position of value to be deleted: \t");
  scanf(" %d", &pos);
  ptr = first;
  if (pos == 1)
  {
      first = ptr->next;
      printf("\nElement deleted successfully");
  }
  else
  {
      while (ptr != NULL)
      {
          ptr = ptr->next;
          count = count + 1;
      }
      if (pos > 0 && pos <= count)
      {
          ptr = first;
          for (i = 1; i < pos; i++)
          {
              prev = ptr;
              ptr = ptr->next;
          }
          prev->next = ptr->next;
      }
      else
      {
          printf("Position is out of range");
      }
      free(ptr);
      printf("\nElement deleted successfully");
  }
     }
 }
 void updateNode()
 {
     int oldval, newval, flag = 0;

     if (first == NULL)
     {
  printf("No nodes in the list to update\n");
     }
     else
     {
  printf("\nEnter the value to be updated: \t");
  scanf("%d", &oldval);
  printf("\nEnter the new value: \t");
  scanf("%d", &newval);
  for (ptr = first; ptr != NULL; ptr = ptr->next)
  {
      if (ptr->value == oldval)
      {
          ptr->value = newval;
          flag = 1;
          break;
      }
  }
  if (flag == 1)
  {
      printf("\nUpdated Successfully");
  }
  else
  {
      printf("\nValue not found in List");
  }
     }
 }
 void displayList()
 {
     if (first == NULL)
     {
  printf("No nodes in the list to display\n");
     }
     else
     {
  for (ptr = first; ptr != NULL; ptr = ptr->next)
  {
      printf("%d\t", ptr->value);
  }
     }
 }

Download code

OUTPUT :

C - Linked List Operations - Insertion at front

C - Linked List Operations - Insertion at last and any position

C - Linked List Operations - Deletion of node

C - Linked List Operations - Updation of value

C - Linked List Operations - Display List

Download code

Data Structures - Cpp Program to implement queue operations using an array

noreply@blogger.com (Avinash) — Tue, 16 Feb 2016 11:46:00 +0000

Queue is a data structure , similar to Stack , but here in queue we have openings at both the ends , one for insertion and other for deletion.

Some of the common operations of queue are :

Adding an item to queue(enqueue)
Removing an item from a queue(dequeue)
Overflow Condition(Queue full)
Underflow Condition(Queue empty)
Getting the front element(peek)

Overflow situation occur when the queue is full and then we are trying to insert/add another item to the queue .

Underflow situation occur when the queue is empty and the we are trying to remove/delete an item from the queue.

The principle of queue is First In First Out (FIFO).

Download code

PROGRAM :

#include <iostream>

using namespace std;

int main()
{
    int rear = -1,front = -1,item,MAX ,choice ,i;
    cout << "Enter Size of Queue : \t ";
    cin >> MAX;
    int QueueArray[MAX];
    while (1)
    {
        cout << "\nQueue Operations  :";
        cout << "\n1. Insert/Add";
        cout << "\n2. Remove/Delete";
        cout << "\n3. Peek/Front item";
        cout << "\n4. Display Queue";
        cout << "\n5. Exit";
        cout << "\nEnter your choice :\t";
        cin >> choice;
        switch (choice)
        {
        case 1:
            if (rear == MAX - 1)
            {
                cout << "Queue Overflow \n";
            }
            else
            {
                if (front == -1)
                {
                    front = 0;
                }
                cout << "Inset the element in queue : \t";
                cin >> item;
                rear = rear + 1;
                QueueArray[rear] = item;
            }

            break;
        case 2:

            if (front == -1 || front > rear)
            {
                cout << "Queue Underflow \n";
                break;
            }
            else
            {
                cout << "Element deleted from queue is " <<  QueueArray[front] << "\n" ;
                front = front + 1;
            }
            break;
        case 3:
            if (front == -1 || front > rear)
            {
                cout << "Queue Underflow \n";
                break;
            }
            else
            {
                cout << "The front element is :" << QueueArray[front] << "\t" ;
            }
            break;
        case 4:
            if (front == -1 || front > rear)
            {
                cout << "Queue Underflow \n";
                break;
            }
            else
            {
                cout << "The current elements in queue are :";
                for (i = front; i <= rear; i++)
                {
                    cout << QueueArray[i];
                }
            }
            break;
        case 5:
            return 0;
            break;
        default:
            cout << "Wrong Entry \n ";
            break;
        }

    }
    return 0;
}

Download code

OUTPUT :

Cpp - Queue Operations

Cpp- Queue Overflow

Cpp - Queue Underflow

Download code

Data Structures - C Program to implement queue operations using an array

noreply@blogger.com (Avinash) — Tue, 16 Feb 2016 10:04:00 +0000

Queue is a data structure , similar to Stack , but here in queue we have openings at both the ends , one for insertion and other for deletion.

Some of the common operations of queue are :

Adding an item to queue(enqueue)
Removing an item from a queue(dequeue)
Overflow Condition(Queue full)
Underflow Condition(Queue empty)
Getting the front element(peek)

Overflow situation occur when the queue is full and then we are trying to insert/add another item to the queue .

Underflow situation occur when the queue is empty and the we are trying to remove/delete an item from the queue.

The principle of queue is First In First Out (FIFO).

Download code

PROGRAM :

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int rear = -1,front = -1,item,MAX ,choice ,i;
    printf("Enter Size of Queue : \t ");
    scanf("%d" , &MAX);
    int QueueArray[MAX];
    while (1)
    {
        printf("\nQueue Operations  :");
        printf("\n1. Insert/Add");
        printf("\n2. Remove/Delete");
        printf("\n3. Peek/Front item");
        printf("\n4. Display Queue");
        printf("\n5. Exit");
        printf("\nEnter your choice :\t");
        scanf("%d" , &choice);
        switch (choice)
        {
        case 1:
            if (rear == MAX - 1)
            {
                printf("Queue Overflow \n");
            }
            else
            {
                if (front == -1)
                {
                    front = 0;
                }
                printf("Inset the element in queue : \t");
                scanf("%d" , &item);
                rear = rear + 1;
                QueueArray[rear] = item;
            }

            break;
        case 2:

            if (front == -1 || front > rear)
            {
                printf("Queue Underflow \n");
                break;
            }
            else
            {
                printf("Element deleted from queue is %d \n" , QueueArray[front] );
                front = front + 1;
            }
            break;
        case 3:
            if (front == -1 || front > rear)
            {
                printf("Queue Underflow \n");
                break;
            }
            else
            {
                printf("The front element is : %d \t" , QueueArray[front]);
            }
            break;
        case 4:
            if (front == -1 || front > rear)
            {
                printf("Queue Underflow \n");
                break;
            }
            else
            {
                printf("The current elements in queuue are :");
                for (i = front; i <= rear; i++)
                {
                    printf("%d " ,QueueArray[i]);
                }
            }
            break;
        case 5:
            return 0;
            break;
        default:
            printf("Wrong Entry \n ");
            break;
        }

    }
    return 0;
}

Download code

OUTPUT :

C - Queue Operations

C- Queue Overflow

C - Queue Underflow

Download code

Data Structures - Java Program to implement queue operations using an array

noreply@blogger.com (Avinash) — Tue, 16 Feb 2016 05:00:00 +0000

Queue is a data structure , similar to Stack , but here in queue we have openings at both the ends , one for insertion and other for deletion.

Some of the common operations of queue are :

Adding an item to queue(enqueue)
Removing an item from a queue(dequeue)
Overflow Condition(Queue full)
Underflow Condition(Queue empty)
Getting the front element(peek)

Overflow situation occur when the queue is full and then we are trying to insert/add another item to the queue .

Underflow situation occur when the queue is empty and the we are trying to remove/delete an item from the queue.

The principle of queue is First In First Out (FIFO).

Download code

PROGRAM :

package mycodingcorner;

import java.util.Scanner;

public class Queue_Array {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int rear = -1;
        int front = -1;
        int item;
        System.out.print("Enter Size of Queue : \t ");
        int MAX = scan.nextInt();
        int QueueArray[] = new int[MAX];
        while (true) {
            System.out.println("\nQueue Operations  :");
            System.out.println("1.Insert/Add");
            System.out.println("2. Remove/Delete");
            System.out.println("3. Peek/Front item");
            System.out.println("4. Display Queue");
            System.out.println("5. Exit");
            System.out.print("Enter your choice :\t");
            int choice = scan.nextInt();
            switch (choice) {
                case 1:
                    if (rear == MAX - 1) {
                        System.out.println("Queue Overflow \n");
                    } else {
                        if (front == -1) {
                            front = 0;
                        }
                        System.out.print("Inset the element in queue : \t");
                        item = scan.nextInt();
                        rear = rear + 1;
                        QueueArray[rear] = item;
                    }

                    break;
                case 2:

                    if (front == -1 || front > rear) {
                        System.out.println("Queue Underflow \n");
                        return;
                    } else {
                        System.out.println("Element deleted from queue is " + QueueArray[front] + "\n");
                        front = front + 1;
                    }
                    break;
                case 3:
                    if (front == -1 || front > rear) {
                        System.out.println("Queue Underflow \n");
                        return;
                    } else {
                        System.out.println("The front element is : \t" + QueueArray[front]);
                    }
                    break;
                case 4:
                    if (front == -1 || front > rear) {
                        System.out.println("Queue Underflow \n");
                        return;
                    } else {
                        System.out.print("The current elements in queuue are :");
                        for (int i = front; i <= rear; i++) {
                            System.out.print(QueueArray[i] + " ");
                        }
                    }
                    break;
                case 5:
                    System.exit(0);
                    break;
                default:
                    System.out.println("Wrong Entry \n ");
                    break;
            }

        }
    }
}

Download code

OUTPUT :

Java - Queue Operations

Java - Queue Underflow

Java - Queue Overflow

Love Calculator - Android App

noreply@blogger.com (Avinash) — Fri, 12 Feb 2016 13:40:00 +0000

This is an android application which calculates the love percentage between two people.

The logic is it converts the letters in the name to its ASCII equivalent and then sums up all the letters and perform a modulus operation with 100 to get the result.

Example : If 2 names are Kete and Rade
ASCII value of K = 75
  ASCII value of E = 69
  ASCII value of T = 84
ASCII value of E = 69
  ASCII value of R = 72
  ASCII value of A = 65
  ASCII value of D = 68
  ASCII value of E = 69

Sum of ASCII values of K+E+T+E + R + A + D + E = 581
now 581 % 100 = 81

So, the love % between Kete and Rade= 81%

Here we use two edit texts for entering name and crush name , one button for calculating , and one textview for showing result.

In this app we use material design , as material design is not compatable with pre lolipop devices , we use a design support library

add these two lines in build.gradle file :

dependencies {
   ....
compile 'com.android.support:appcompat-v7:23.0.1'compile 'com.android.support:design:23.0.1'}

Get the .apk file Application on Github
For the edit text labels we use , floating labels which is from the material design , so in your layout xml file , place this code ,

<android.support.design.widget.TextInputLayout
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:textColor="#FFF"
android:textColorHint="@android:color/white">

<EditText
android:id="@+id/nameField"
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:background="@android:color/transparent"
android:ems="10"
android:gravity="center"
android:hint="Enter your name"
android:inputType="textPersonName"
android:textColor="#FFF"
android:textColorHint="@android:color/white"
android:textSize="25sp"
/>
</android.support.design.widget.TextInputLayout>

similarly for the second edit text by just changing the label name to "Enter your crush name"

For button and textview , place this code ,

<Button
android:id="@+id/resbtn"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="center"
android:background="@android:color/transparent"
android:text="Calculate"
android:textColor="@android:color/white"
android:textSize="20sp" />

<TextView
android:id="@+id/resview"
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:gravity="center"
android:textColor="#FFF"
android:textSize="20sp" />

Get the .apk file Application on Github Now , in the main activity , initialize these two edit texts , button for calculating, and textview for showing result,

Button cal = (Button) findViewById(R.id.resbtn);
final TextView res = (TextView) findViewById(R.id.resview);
final EditText name = (EditText) findViewById(R.id.nameField);
final EditText cname = (EditText) findViewById(R.id.crushnameField);

Now when the calculate button is clicked ,
first, we get the text from them
next , convert them to strings and concat them ,
next , convert the letters to ASCII and the sum all the letters
next , perform modulus operation with 100 on that sum and show the result.

cal.setOnClickListener(new View.OnClickListener() {
            @Override
            public void onClick(View view) {
                res.setText("");
                Editable n = name.getText();
                Editable cn = cname.getText();
                String concat = String.valueOf(n).concat(String.valueOf(cn)).toUpperCase();
                if ((n.toString().trim().length() == 0) || (cn.toString().trim().length() == 0)) {
                    Toast.makeText(MainActivity.this, "Please fill both the fields ", Toast.LENGTH_LONG).show();
                } else {
                    int sum = 0;
                    for (int i = 0; i < concat.length(); i++) {
                        char character = concat.charAt(i);
                        int ascii = (int) character;
                        sum += ascii;
                    }
                    res.setText("The love between " + n + " and " + cn + " is " + sum % 100 + "%");
                }
            }
        });

Get the .apk file Application on Github

OUTPUT :

Android - Love Calculator

Java GUI - Love Calculator Application

noreply@blogger.com (Avinash) — Wed, 10 Feb 2016 11:37:00 +0000

This is a java GUI program which calculates the love percentage between two people.Here , we used java SWING to implement this desktop application .
The logic is it converts the letters in the name to its ASCII equivalent and then sums up all the letters and perform a modulus operation with 100 to get the result.

Java GUI - Love Calculator

Initially in we use 2 lables for name and crushname and two testfields for entering names , a button for calculating and a label to display result.
We design the layout using drag and drop java swing palette.

When we click on calculate after entering names , first we check whether only alphabets are entered

String n = nameField.getText().toUpperCase();
        String cn = crushnameField.getText().toUpperCase();
        if (!(Pattern.matches("^[a-zA-Z]+$", n)) || !(Pattern.matches("^[a-zA-Z]+$", cn))) {
            JOptionPane.showMessageDialog(null, "Please enter alphabets", "Error", JOptionPane.ERROR_MESSAGE);
            nameField.setText("");
            crushnameField.setText("");
            resLabel.setText("");
        }

After that we will concact two names and convert the letters to their corresponding ASCII values , sum those values and perform a modulus operation with 100 to get the result.

String concat = n.concat(cn);
            int sum = 0;
            for (int i = 0; i < concat.length(); i++) {
                char character = concat.charAt(i);
                int ascii = (int) character;
                sum += ascii;
            }
            String result = "The love between " + n + " and " + cn + " is " + sum % 100 + " % ";
            String html1 = "<html><body style='width: ";
            String html2 = "px'>";
            resLabel.setText(html1 + "400" + html2 + result);

Download Application

COMPLETE PROGRAM :

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package lovecalculatorgui;

import java.util.regex.Pattern;
import javax.swing.JOptionPane;

/**
 *
 * @author innovate
 */
public class LoveCalculator extends javax.swing.JFrame {

    /**
     * Creates new form LoveCalculator
     */
    public LoveCalculator() {

        initComponents();
    }

    /**
     * This method is called from within the constructor to initialize the form.
     * WARNING: Do NOT modify this code. The content of this method is always
     * regenerated by the Form Editor.
     */
    @SuppressWarnings("unchecked")
    // <editor-fold defaultstate="collapsed" desc="Generated Code">                          
    private void initComponents() {

        nameLabel = new javax.swing.JLabel();
        nameField = new javax.swing.JTextField();
        crushnameLabel = new javax.swing.JLabel();
        crushnameField = new javax.swing.JTextField();
        resButton = new javax.swing.JButton();
        resLabel = new javax.swing.JLabel();
        bckLabel = new javax.swing.JLabel();

        setDefaultCloseOperation(javax.swing.WindowConstants.EXIT_ON_CLOSE);
        setTitle("Love Calculator");
        setResizable(false);
        getContentPane().setLayout(new org.netbeans.lib.awtextra.AbsoluteLayout());

        nameLabel.setFont(new java.awt.Font("Buxton Sketch", 1, 18)); // NOI18N
        nameLabel.setForeground(new java.awt.Color(255, 255, 255));
        nameLabel.setText("Enter your name");
        getContentPane().add(nameLabel, new org.netbeans.lib.awtextra.AbsoluteConstraints(40, 120, -1, -1));

        nameField.setFont(new java.awt.Font("Buxton Sketch", 1, 16)); // NOI18N
        nameField.setForeground(new java.awt.Color(204, 0, 51));
        getContentPane().add(nameField, new org.netbeans.lib.awtextra.AbsoluteConstraints(260, 120, 140, -1));

        crushnameLabel.setFont(new java.awt.Font("Buxton Sketch", 1, 18)); // NOI18N
        crushnameLabel.setForeground(new java.awt.Color(255, 255, 255));
        crushnameLabel.setText("Enter your crush name");
        getContentPane().add(crushnameLabel, new org.netbeans.lib.awtextra.AbsoluteConstraints(40, 180, -1, -1));

        crushnameField.setFont(new java.awt.Font("Buxton Sketch", 1, 14)); // NOI18N
        crushnameField.setForeground(new java.awt.Color(204, 0, 51));
        getContentPane().add(crushnameField, new org.netbeans.lib.awtextra.AbsoluteConstraints(260, 180, 140, -1));

        resButton.setBackground(new java.awt.Color(255, 255, 255));
        resButton.setFont(new java.awt.Font("Buxton Sketch", 1, 24)); // NOI18N
        resButton.setForeground(new java.awt.Color(204, 0, 51));
        resButton.setText("Check");
        resButton.addActionListener(new java.awt.event.ActionListener() {
            public void actionPerformed(java.awt.event.ActionEvent evt) {
                resButtonActionPerformed(evt);
            }
        });
        getContentPane().add(resButton, new org.netbeans.lib.awtextra.AbsoluteConstraints(160, 240, 130, -1));

        resLabel.setFont(new java.awt.Font("Buxton Sketch", 1, 24)); // NOI18N
        resLabel.setForeground(new java.awt.Color(255, 255, 255));
        resLabel.setAutoscrolls(true);
        resLabel.setHorizontalTextPosition(javax.swing.SwingConstants.CENTER);
        getContentPane().add(resLabel, new org.netbeans.lib.awtextra.AbsoluteConstraints(20, 300, 570, 100));

        bckLabel.setIcon(new javax.swing.ImageIcon(getClass().getResource("/lovecalculatorgui/bk.jpg"))); // NOI18N
        getContentPane().add(bckLabel, new org.netbeans.lib.awtextra.AbsoluteConstraints(0, 0, 600, 410));

        pack();
        setLocationRelativeTo(null);
    }// </editor-fold>                        


    private void resButtonActionPerformed(java.awt.event.ActionEvent evt) {                                          
        // TODO add your handling code here:
        String n = nameField.getText().toUpperCase();
        String cn = crushnameField.getText().toUpperCase();
        if (!(Pattern.matches("^[a-zA-Z]+$", n)) || !(Pattern.matches("^[a-zA-Z]+$", cn))) {
            JOptionPane.showMessageDialog(null, "Please enter alphabets", "Error", JOptionPane.ERROR_MESSAGE);
            nameField.setText("");
            crushnameField.setText("");
            resLabel.setText("");
        } else {
            String concat = n.concat(cn);
            int sum = 0;
            for (int i = 0; i < concat.length(); i++) {
                char character = concat.charAt(i);
                int ascii = (int) character;
                sum += ascii;
            }
            String result = "The love between " + n + " and " + cn + " is " + sum % 100 + " % ";
            String html1 = "<html><body style='width: ";
            String html2 = "px'>";
            resLabel.setText(html1 + "400" + html2 + result);
        }
    }                                         
    /**
     * @param args the command line arguments
     */
    public static void main(String args[]) {
        /* Set the Nimbus look and feel */
        //<editor-fold defaultstate="collapsed" desc=" Look and feel setting code (optional) ">
        /* If Nimbus (introduced in Java SE 6) is not available, stay with the default look and feel.
         * For details see http://download.oracle.com/javase/tutorial/uiswing/lookandfeel/plaf.html 
         */
        try {
            for (javax.swing.UIManager.LookAndFeelInfo info : javax.swing.UIManager.getInstalledLookAndFeels()) {
                if ("Nimbus".equals(info.getName())) {
                    javax.swing.UIManager.setLookAndFeel(info.getClassName());
                    break;
                }
            }
        } catch (ClassNotFoundException ex) {
            java.util.logging.Logger.getLogger(LoveCalculator.class.getName())
.log(java.util.logging.Level.SEVERE, null, ex);
        } catch (InstantiationException ex) {
            java.util.logging.Logger.getLogger(LoveCalculator.class.getName())
.log(java.util.logging.Level.SEVERE, null, ex);
        } catch (IllegalAccessException ex) {
            java.util.logging.Logger.getLogger(LoveCalculator.class.getName())
.log(java.util.logging.Level.SEVERE, null, ex);
        } catch (javax.swing.UnsupportedLookAndFeelException ex) {
            java.util.logging.Logger.getLogger(LoveCalculator.class.getName())
.log(java.util.logging.Level.SEVERE, null, ex);
        }
        //</editor-fold>

        /* Create and display the form */
        java.awt.EventQueue.invokeLater(new Runnable() {
            public void run() {

                new LoveCalculator().setVisible(true);

            }
        });
    }
    // Variables declaration - do not modify                     
    private javax.swing.JLabel bckLabel;
    private javax.swing.JTextField crushnameField;
    private javax.swing.JLabel crushnameLabel;
    private javax.swing.JTextField nameField;
    private javax.swing.JLabel nameLabel;
    private javax.swing.JButton resButton;
    private javax.swing.JLabel resLabel;
    // End of variables declaration                   
}

Download Application

OUTPUT :

Java GUI - Love Calculator

Love Calculator logic implementation in java

noreply@blogger.com (Avinash) — Tue, 09 Feb 2016 19:10:00 +0000

This is a java program which calculates the love percentage between two people.
The logic is it converts the letters in the name to its ASCII equivalent and then sums up all the letters and perform a modulus operation with 100 to get the result.

PROGRAM :

        package mycodingcorner;

 import java.util.Scanner;

 public class LoveCalculator {

  public static void main(String[] args) {

   String name1, name2, concat;
   Scanner scan = new Scanner(System.in);

   System.out.print("\nEnter your name :\t");
   while (!scan.hasNext("[A-Za-z]+")) {
    System.out.println("Enter alphabets only");
    scan.next();
   }
   name1 = scan.next().toUpperCase();
   System.out.print("\nEnter your crush name :\t");
   while (!scan.hasNext("[A-Za-z]+")) {
    System.out.println("Enter alphabets only");
    scan.next();
   }
   name2 = scan.next().toUpperCase();
   concat = name1.concat(name2);
   int sum = 0;
   for (int i = 0; i < concat.length(); i++) {
    char character = concat.charAt(i);
    int ascii = (int) character;
    sum += ascii;
   }
   System.out.println("The love between " + name1 + " and " + name2 + " is " + sum % 100 + "%");
   scan.close();

  }
 }

Download code

OUTPUT :

Java Program - Love Calculator

CPU Scheduling Algorithm - Round Robin(Java)

noreply@blogger.com (Avinash) — Sat, 06 Feb 2016 17:15:00 +0000

This is a Java program which implements one of the CPU Scheduling algorithm called Round Robin(RR).

Round robin algorithm is mainly used in time sharing systems , it is also similar to First Come First Served(FCFS) algorithm but FCFS does not have that time slicing switch.

All the jobs gets executed in this scheduling algorithm , so the advantage here is , its Starvation free.

Download Code

PROGRAM :

package mycodingcorner;

import java.util.Scanner;

public class RoundRobin {
 public static void main(String[] args) {
  int i, j, n, r, q, e = 0;
  int bt_c[] = new int[10];
  int bt[] = new int[10];
  int m[] = new int[50];
  float f, avg = 0;
  Scanner scan = new Scanner(System.in);
  System.out.print("\nEnter how many jobs ?\t");
  n = scan.nextInt();
  for (i = 1; i <= n; i++) {
   System.out.print("Enter burst time for job " + i + " :\t");
   bt[i] = scan.nextInt();
   bt_c[i] = bt[i]; // stores job has how much burst time in array i
  }
  System.out.print("\nEnter Quantum (time slice value) :\t");
  q = scan.nextInt();
  int max = 0;
  max = bt[1];
  for (j = 1; j <= n; j++)
   if (max <= bt[j])
    max = bt[j];

  if ((max % q) == 0)
   r = (max / q);
  else
   r = (max / q) + 1;
  for (i = 1; i <= r; i++) {
   System.out.print("\n\nRound" + i);
   for (j = 1; j <= n; j++) {
    if (bt[j] > 0) {
     bt[j] = bt[j] - q;

     if (bt[j] <= 0) {
      bt[j] = 0;
      System.out.print("\njob " + j + " is completed");
     } else
      System.out.print("\njob" + j + " remaining time is " + bt[j]);
    }
   }

  }
  for (i = 1; i <= n; i++) {
   e = 0;
   for (j = 1; j <= r; j++) {
    if (bt_c[i] != 0) {
     if (bt_c[i] >= q) {
      m[i + e] = q;
      bt_c[i] -= q;
     } else {
      m[i + e] = bt_c[i];
      bt_c[i] = 0;
     }
    } else
     m[i + e] = 0;
    e = e + n;
   }
  }
  for (i = 2; i <= n; i++)
   for (j = 1; j <= i - 1; j++)
    avg = avg + m[j];
  for (i = n + 1; i <= r * n; i++) {
   if (m[i] != 0) {
    for (j = i - (n - 1); j <= i - 1; j++)
     avg = m[j] + avg;
   }
  }
  f = avg / n;
  System.out.print("\n\n\nTOTAL WATING TIME: \t" + avg);
  System.out.print("\n\nAVERAGE WAITING TIME: \t\n" + f);
  scan.close();
 }
}

Download Code

OUTPUT :

Java - Cpu Scheduling Algorithm - Round Robin(RR)

CPU Scheduling Algorithm - Round Robin(Cpp)

noreply@blogger.com (Avinash) — Fri, 05 Feb 2016 20:03:00 +0000

This is a Cpp program which implements one of the CPU Scheduling algorithm called Round Robin(RR).

Round robin algorithm is mainly used in time sharing systems , it is also similar to First Come First Served(FCFS) algorithm but FCFS does not have that time slicing switch.

All the jobs gets executed in this scheduling algorithm , so the advantage here is , its Starvation free.

Download Code

PROGRAM :

#include <iostream>

using namespace std;

int main()
{
    int bt_c[10],bt[10],i,j,n,m[50],r,q,e=0;
    float f,avg=0;
    cout << "\nEnter how many jobs ?\t";
    cin >> n;
    for(i=1; i<=n; i++)
    {
        cout << "Enter burst time for job %d :\t" << i;
        cin >> bt[i]);
        bt_c[i]=bt[i]; //stores job has how much burst  time in array  i
    }
    cout << "\nEnter Quantum (time slice value) :\t";
    cin >> q;
    int max=0;
    max=bt[1];
    for(j=1; j<=n; j++)
        if(max<=bt[j])
            max=bt[j];

    if((max%q)==0)
        r=(max/q);
    else
        r=(max/q)+1;
    for(i=1; i<=r; i++)
    {
        cout << "\n\nRound" << i;
        for(j=1; j<=n; j++)
        {
            if(bt[j]>0)
            {
                bt[j]=bt[j]-q;

                if(bt[j]<=0)
                {
                    bt[j]=0;
                    cout << "\njob %d is completed" << j;
                }
                else
                    cout << "\njob" <<  j << " remaining time is " << bt[j];
            }
        }

    }
    for(i=1; i<=n; i++)
    {
        e=0;
        for(j=1; j<=r; j++)
        {
            if(bt_c[i]!=0)
            {
                if(bt_c[i]>=q)
                {
                    m[i+e]=q;
                    bt_c[i]-=q;
                }
                else
                {
                    m[i+e]=bt_c[i];
                    bt_c[i]=0;
                }
            }
            else
                m[i+e]=0;
            e=e+n;
        }
    }
    for(i=2; i<=n; i++)
        for(j=1; j<=i-1; j++)
            avg=avg+m[j];
    for(i=n+1; i<=r*n; i++)
    {
        if(m[i]!=0)
        {
            for(j=i-(n-1); j<=i-1; j++)
                avg=m[j]+avg;
        }
    }
    f=avg/n;
    cout << "\n\n\nTOTAL WATING TIME:" << avg << "\t";
    cout << "\n\nAVERAGE WAITING TIME:" << f << "\t\n";
    return 0;
}

Download Code

OUTPUT :

Cpp Programming - CPU Scheduling Algorithm - Round Robin

CPU Scheduling Algorithm - Round Robin(C)

noreply@blogger.com (Avinash) — Fri, 05 Feb 2016 19:14:00 +0000

This is a C program which implements one of the CPU Scheduling algorithm called Round Robin(RR).

Round robin algorithm is mainly used in time sharing systems , it is also similar to First Come First Served(FCFS) algorithm but FCFS does not have that time slicing switch.

All the jobs gets executed in this scheduling algorithm , so the advantage here is , its Starvation free.

Download Code

PROGRAM :

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int bt_c[10],bt[10],i,j,n,m[50],r,q,e=0;
    float f,avg=0;
    printf("\nEnter how many jobs ?\t");
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        printf("Enter burst time for job %d :\t",i);
        scanf("%d",&bt[i]);
        bt_c[i]=bt[i]; //stores job has how much burst  time in array  i
    }
    printf("\nEnter Quantum (time slice value) :\t");
    scanf("%d",&q);
    int max=0;
    max=bt[1];
    for(j=1; j<=n; j++)
        if(max<=bt[j])
            max=bt[j];

    if((max%q)==0)
        r=(max/q);
    else
        r=(max/q)+1;
    for(i=1; i<=r; i++)
    {
        printf("\n\nRound %d",i);
        for(j=1; j<=n; j++)
        {
            if(bt[j]>0)
            {
                bt[j]=bt[j]-q;

                if(bt[j]<=0)
                {
                    bt[j]=0;
                    printf("\njob %d is completed",j);
                }
                else
                    printf("\njob %d remaining time is %d",j,bt[j]);
            }
        }

    }
    for(i=1; i<=n; i++)
    {
        e=0;
        for(j=1; j<=r; j++)
        {
            if(bt_c[i]!=0)
            {
                if(bt_c[i]>=q)
                {
                    m[i+e]=q;
                    bt_c[i]-=q;
                }
                else
                {
                    m[i+e]=bt_c[i];
                    bt_c[i]=0;
                }
            }
            else
                m[i+e]=0;
            e=e+n;
        }
    }
    for(i=2; i<=n; i++)
        for(j=1; j<=i-1; j++)
            avg=avg+m[j];
    for(i=n+1; i<=r*n; i++)
    {
        if(m[i]!=0)
        {
            for(j=i-(n-1); j<=i-1; j++)
                avg=m[j]+avg;
        }
    }
    f=avg/n;
    printf("\n\n\nTOTAL WATING TIME:%f\t",avg);
    printf("\n\nAVERAGE WAITING TIME:%f\t\n",f);
    return 0;
}

Download Code

OUTPUT :

C Program - CPU Scheduling Algorithm : Round Robin

Android - Web View Example

noreply@blogger.com (Avinash) — Mon, 01 Feb 2016 18:29:00 +0000

In this post we will learn how to use Web View in android . Basically a webview in android means simply loading a webpage through our android app , however it uses the default browser to load the url we requested.

If we use only web view , the url we requested will load directly from the default web browser i.e web browser opens up and loads the page , this is the same as opening our browser and browsing.

If we use Web Client , the url we requested will load in the app itself , unlike the earlier case it does not open the browser externally as a separate app instead the browser loads the url in app itself.

The layout consists of one button and webview , so when the button is clicked the url is loaded in the webview.

Layout file code is shown below ,

Get the .apk file Application on Github

Layout ( activity_main.xml) :

<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
    xmlns:tools="http://schemas.android.com/tools"
    android:layout_width="match_parent"
    android:layout_height="match_parent"
    android:orientation="vertical"
    tools:context=".MainActivity">

    <Button android:id="@+id/loadUrl"
    android:layout_width="fill_parent"
    android:layout_height="20pt"
    android:text="Load Url" />


    <WebView android:id="@+id/webview"
    android:layout_width="fill_parent"
    android:layout_height="fill_parent"></WebView>

</LinearLayout>

Here is the java part , we initialized the button and the webview in onCreate() method , and when the button is clicked we set the WebVewClient , so the requested url is loaded in the app itself rather than opening it separately in a browser.

wv.setWebViewClient(new myWebViewClient());

The MainActivity file code is shown below ,

Java Code (Main Activity.java) :

package mycodingcorner.webviewexample;

import android.app.Activity;
import android.graphics.Bitmap;
import android.os.Bundle;
import android.view.View;
import android.webkit.WebView;
import android.webkit.WebViewClient;
import android.widget.Button;

import static android.view.View.OnClickListener;


public class MainActivity extends Activity {
    public WebView wv;
    public String url;

    @Override protected void onCreate(Bundle savedInstanceState) {
        super.onCreate(savedInstanceState);
        setContentView(R.layout.activity_main);
        wv = (WebView) findViewById(R.id.webview);
        url = "http://www.mycodingcorner.tk/2016/02/android-web-view-example.html";
        Button load_url = (Button) findViewById(R.id.loadUrl);
        load_url.setOnClickListener(new OnClickListener() {
            @Override public void onClick(View view) {
                wv.setWebViewClient(new myWebViewClient());
                wv.getSettings().setJavaScriptEnabled(true);
                wv.getSettings().setLoadsImagesAutomatically(true);
                wv.getSettings().setJavaScriptEnabled(true);
                wv.setScrollBarStyle(View.SCROLLBARS_INSIDE_OVERLAY);
                wv.loadUrl(url);
            }
        });


    }

    public class myWebViewClient extends WebViewClient {
        @Override public void onPageStarted(WebView view, String url, Bitmap favicon) {
            // TODO Auto-generated method stubsuper.onPageStarted(view, url, favicon);
        }

        @Override public boolean shouldOverrideUrlLoading(WebView view, String url) {
            // TODO Auto-generated method stub
view.loadUrl(url);
            return true;

        }
    }


}

Get the .apk file Application on Github
Here in manifest file ,we have to INTERNET permission as the app loads the contents of the url from the internet.

<uses-permission android:name="android.permission.INTERNET"></uses-permission>

Manifest file (AndroidManifest.xml):

<?xml version="1.0" encoding="utf-8"?><manifest 
xmlns:android="http://schemas.android.com/apk/res/android"package="mycodingcorner.webviewexample">

    <uses-permission android:name="android.permission.INTERNET"></uses-permission>
    <application android:allowBackup="true"android:icon="@mipmap/ic_launcher"
android:label="@string/app_name"android:theme="@style/AppTheme">
        <activity android:name=".MainActivity"android:label="@string/app_name">
            <intent-filter>
                <action android:name="android.intent.action.MAIN" />

                <category android:name="android.intent.category.LAUNCHER" />
            </intent-filter>
        </activity>
    </application>

</manifest>

Get the .apk file Complete Project on Github

OUTPUT :

Android - WebView Example

Cpp Program to find length of a string using strlen function

noreply@blogger.com (Avinash) — Mon, 01 Feb 2016 05:36:00 +0000

This is a Cpp Program to find the length of a String.
Here we use string function strlen() to find the length of a string.
All the string functions are present in the header string.h

Download Code

PROGRAM :

#include <iostream>
#include <string.h>

using namespace std;

int main()
{
    char name[40];
    cout << "Enter any name(String) : \t";
    cin.get(name , 40);
    cout << "\nThe length of the string you entered is : \t" << strlen(name) << endl;
    return 0;
}

OUTPUT :

Cpp Program - Length of a string

Download Code

Getting Started with Strings in Cpp - Reading a string and displaying it

noreply@blogger.com (Avinash) — Sun, 31 Jan 2016 17:42:00 +0000

This is a simple Cpp Program to read and display the content of the string.

Download Code

PROGRAM :

#include <iostream>
#include <string.h>

using namespace std;

int main()
{
    char name[40];
    cout << "Enter any name(String) : \t";
    cin.get(name , 40);
    cout << "\nThe length of the string you entered is : \t" << strlen(name) << endl;
    return 0;
}

OUTPUT :

Cpp Program - Reading and displaying a string

Download Code

Related Programs :

Getting Started with strings - Using gets() and puts() in C
Length of a string using strlen() in C
Length Of a String without using string function strlen() in C

Cpp Program to print triangle with numbers

noreply@blogger.com (Avinash) — Sun, 31 Jan 2016 09:38:00 +0000

This is a simple Cpp Program which prints out a triangle with respect to the input given , here the obtained triangle is filled with numbers.

Triangle pattern with numbers

Download Code

PROGRAM :

#include <iostream>

using namespace std;

int main()
{
    int i, j, n,k;
    cout << "Enter number of lines[height of triangle] : \t";
    cin >> n;
    for(i=1; i<=n; i++)
    {
        for(j=i; j<n; j++)
        {
            cout << " ";
        }
        for(k=1; k<(i*2); k++)
        {
            cout << k;
        }
        cout << "\n";
    }
    return 0;
}

OUTPUT :

Cpp Program - Triangle with numbers

Download Code