INNOCeNt boYs F09: Islamic University

Showing posts with label Islamic University. Show all posts

Tuesday, September 22, 2015

Display Analog Clock of System Time in Assembly Language Sir Asim Munir

Please find source code on below url:
Download the source: asm-clock-source-code.asm

Sunday, June 15, 2014

Log4net Implementation in CRM 2011, log4net in CRM Plugins, WebServices and Custom aspx Pages.

This post is about log4net logger implementation in CRM 2011. I will provide details about log4net in CRM Plugins. It is as the same with Web-services and Custom aspx Pages.

1. First we will have a Config file for log4net so that, its configuration/settings can be read and applied to logger.

<?xml version="1.0" encoding="utf-8" ?>
<configuration>
  <configSections>
    <section name="log4net" type="log4net.Config.Log4NetConfigurationSectionHandler, log4net" />
  </configSections>
  <log4net>
    <appender name="RollingLogFileAppender" type="log4net.Appender.RollingFileAppender">
      <file value="D:\Logger\Log4net\logs\log.txt" />
      <appendToFile value="false" />
      <rollingStyle value="Size" />
      <maxSizeRollBackups value="5" />
      <maximumFileSize value="1GB" />
      <layout type="log4net.Layout.PatternLayout">
        <conversionPattern value="%date [%thread] %-5level %logger - %message%newline" />
      </layout>
    </appender>
    <appender name="MemoryAppender" type="log4net.Appender.MemoryAppender">
    </appender>
    <root>
      <level value="Info" />
      <appender-ref ref="RollingLogFileAppender" />
      <appender-ref ref="MemoryAppender" />
    </root>
  </log4net>
</configuration

Copy all this into a file named "log4net.config" and place it in D:\Logger\Log4net\Config\

2. Add log4net.dll to your Plugin.

3.

using log4net;
using log4net.Config;
public class MyPlugin: IPlugin
    {
    protected static readonly ILog Logger = LogManager.GetLogger(typeof(PublishToGRID));
    static MyPlugin()
    {
      XmlConfigurator.Configure(new System.IO.FileInfo(@"D:\Logger\Log4net\Config\log4net.config"));
    }
try
{
if (context.InputParameters.Contains("Target") && context.InputParameters["Target"] is Entity)
{
  Logger.Info("Plugin Executed");
}
}
catch (Exception ex)
{
  string ErrorMessage = "Exception Occured in CRM";
  Logger.Error(ErrorMessage,ex);              
}

After your plugin executed: you will se the log file generated in D drive.
containing the following text:

Logger.info: 6/15/2014  7:11 p.m
Plugin Excuted

Wednesday, May 28, 2014

Bridge Inspection and Management system in Asp Dot Net (.NET C#) with Source Code and Database in MS Sql Server 2008

I have developed Bridge Inspection System using Visual Studio Web-Site Project in Asp.net with C#, using my own CSS styling.
Database: in Microsoft SQL server 2008 R2.
Above is the Main Screen, Default Page.
Following are features in this Bridge Inspection System:

Admin who can add more admins,Collectors,Inspectors and Bridges to be inspected in System
Delete Collectors, Inspectors and Bridges from the System.
Bridge Inspector who can Inspect the Bridges that are currently added and make a report
Bridge Collector who can View the final Reports added by BI.
Reports Generation from Inspected Bridge Data and Export Reports in PDF format to be ready for download and printing.
Profile Management.
and more ..........................
Sql Server 2008 Database, Normalized and Complete Relationships.

Following are some screen-shots of the system.

Admin Login:

Admin Page:

Add Bridge Profile:

Profile Managment:

Bridge Profile View:

If anyone need Source Code along with the Database file, please ask in Comments I will provide links:
Thanks,
Saqib Khan. (Dynamics CRM developer).

Tuesday, December 31, 2013

Doubly LinkList in C++, Object Oriented Programming, Data Structure in C++ Addition, Deletion, Search

#include<iostream>
using namespace std;
struct node
{

 node *next;
    int data ;
    node * prev;
 node () {  data=0; next=prev=NULL; } 
} ;
//////////////////////////////////////////////
class Dlinklist
{  
node *head ,*tail ;

public:

Dlinklist() { head = tail =NULL; }

void add_to_tail ();
void add_to_head();
void del_from_tail();
void del_from_head();
void show_from_head();
void show_from_tail();  
 };
/////////////////////////////////////////
void Dlinklist::add_to_head()
{
 
 node* temp = new node ();
cout<<"Enter the value"<<endl;
cin>>temp->data; 
 if(head==0)
{ head=tail=temp; }

else { 
 temp->next =head;
 head->prev=temp;
 head=temp; }
}
/////////////////////////////////////////////////////
void Dlinklist::add_to_tail()
{ 
 node* temp =new node();
cout<<"Enter the value"<<endl;
cin>>temp->data; 


if( tail==0)
{ head=tail=temp; }
else {

 tail->next=temp;
 temp->prev = tail;
 tail =temp ;
  } 
}
////////////////////////////////////////////////////
void Dlinklist::del_from_head()
{ if (head==0)
cout<<"Empty list"<<endl;
else 
{ node* temp =head;
head=head->next; head->prev=0; delete temp; }
}
//////////////////////////////////////////////////
void Dlinklist::del_from_tail()
{ if(tail==0)
{  cout<<"Empty List"<<endl; }

else {  node* temp=tail;  tail= tail->prev;  tail->next = 0; delete temp; } }
////////////////////////////////////////////////////
void Dlinklist::show_from_head()
{
 node* temp = head;
 while(temp!=0)
 {   cout<<endl<<temp->data;
 temp=temp->next;  } }
//////////////////////////////
void Dlinklist::show_from_tail()
 {   node* temp = tail;

while(temp!=0)
{ cout<<endl<<temp->data;
temp=temp->prev; } }
//////////////////////////

void main()
{ Dlinklist d1;
 int c;


 cout<<endl<<"---------MENU---------"<<endl;
do{ cout<<"1. Add value to head"<<endl;
  cout<<"2. Add value to tail"<<endl;
   cout<<"3. Show values from head"<<endl;
   cout<<"4. Show values from tail"<<endl;
   cout<<"5. Delete values from head"<<endl; 
   cout<<"6. Delete values from tail"<<endl;
   cout<<"Enter Your Choice"<<endl;
    
 
cin>>c;
switch(c)
 {
 case 1:d1.add_to_head();break;
 case 2:d1.add_to_tail();break;
 case 3:d1.show_from_head();break;
 case 4:d1.show_from_tail();break;
 case 5:d1.del_from_head();break;
 case 6: d1.del_from_tail(); break;
 default:cout<<"Invalid"<<endl;break;
}
 } while(1);
}

Easiest Implementation of AVL Tree in C++ Insertion, Deletion and Balancing AVL_Tree

/* Write a C++ program to perform the following operations on AVL-trees:
a) Insertion.
b) Deletion. */

#include<iostream>
#include<stdlib.h>
using namespace std;
#define TRUE 1
#define FALSE 0
#define NULL 0
class AVL;
class AVLNODE
{
 friend class AVL;
 private:
  int data;
  AVLNODE *left,*right;
  int bf;
};
class AVL
{
 private:
  AVLNODE *root;
 public:
  AVLNODE *loc,*par;
  AVL()
  {
   root=NULL;
  }
  int insert(int);
  void displayitem();
  void display(AVLNODE *);
  void removeitem(int);
  void remove1(AVLNODE *,AVLNODE *,int);
  void remove2(AVLNODE *,AVLNODE *,int);
  void search(int x);
  void search1(AVLNODE *,int);
};
int AVL::insert(int x)
{
 AVLNODE *a,*b,*c,*f,*p,*q,*y;
 int found,unbalanced;
 int d;
 if(root==0)   //special case empty tree
 {          y=new AVLNODE;
  y->data=x;
  root=y;
  root->bf=0;
  root->left=root->right=NULL;
  return TRUE; }
 //phase 1:locate insertion point for x.a keeps track of the most
 // recent node with balance factor +/-1,and f is the parent of a
 // q follows p through the tree.
 f=NULL;
 a=p=root;
 q=NULL;
 found=FALSE;
 while(p&&!found)
 {                 //search for insertion point for x
  if(p->bf)
  {
   a=p;
   f=q;
  }
  if(x<p->data)    //take left branch
  {
   q=p;
   p=p->left;
  }
  else if(x>p->data)
  {
   q=p;
   p=p->right;
  }
  else
  {
   y=p;
   found=TRUE;
  }
 }               //end while
 //phase 2:insert and rebalance.x is not in the tree and
 // may be inserted as the appropriate child of q.
 if(!found)
 {
  y = new AVLNODE;
  y->data=x;
  y->left=y->right=NULL;
  y->bf=0;
  if(x<q->data)    //insert as left child
  q->left=y;
  else
  q->right=y;    //insert as right child
  //adjust balance factors of nodes on path from a to q
  //note that by the definition of a,all nodes on this
  //path must have balance factors of 0 and so will change
  //to +/- d=+1 implies that x is inserted in the left
  // subtree of a d=-1 implies
  //to that x inserted in the right subtree of a.
 
 
if(x>a->data)
  {
   p=a->right;
   b=p;
   d=-1;
  }
  else
  {
   p=a->left;
   b=p;
   d=1;
  }
  while(p!=y)
  if(x>p->data)          //height of  right increases by 1
  {
   p->bf=-1;
   p=p->right;
  }
  else                 //height of left increases by 1
  {
   p->bf=1;
   p=p->left;
  }
  //is tree unbalanced
  unbalanced=TRUE;
  if(!(a->bf)||!(a->bf+d))
  {                   //tree still balanced
   a->bf+=d;
   unbalanced=FALSE;
  }
  if(unbalanced)   //tree unbalanced,determine rotation type
  {
   if(d==1)
   {         //left imbalance
    if(b->bf==1)      //rotation type LL
    {
     a->left=b->right;
     b->right=a;
     a->bf=0;
     b->bf=0;
    }
    else    //rotation type LR
    {
     c=b->right;
     b->right=c->left;
     a->left=c->right;
     c->left=b;
     c->right=a;
 
 
switch(c->bf)
     {
      case 1: a->bf=-1;  //LR(b)
       b->bf=0;
       break;
      case -1:b->bf=1;  //LR(c)
       a->bf=0;
       break;
      case 0: b->bf=0;  //LR(a)
       a->bf=0;
       break;
     }
     c->bf=0;
     b=c; //b is the new root
    } //end of LR
   }         //end of left imbalance
        else    //right imbalance
        {
    if(b->bf==-1)      //rotation type RR
    {
     a->right=b->left;
     b->left=a;
     a->bf=0;
     b->bf=0;
    }
    else    //rotation type LR
    {
     c=b->right;
     b->right=c->left;
     a->right=c->left;
     c->right=b;
     c->left=a;
     switch(c->bf)
     {
      case 1: a->bf=-1;  //LR(b)
       b->bf=0;
       break;
      case -1:b->bf=1;  //LR(c)
       a->bf=0;
       break;
      case 0: b->bf=0;  //LR(a)
       a->bf=0;
       break;
     }
     c->bf=0;
     b=c; //b is the new root
    } //end of LR
      }
//subtree with root b has been rebalanced and is the new subtree
 
if(!f)
   root=b;
   else if(a==f->left)
   f->left=b;
   else if(a==f->right)
   f->right=b;
  }   //end of if unbalanced
  return TRUE;
 }         //end of if(!found)
 return FALSE;
}     //end of AVL INSERTION
 
void AVL::displayitem()
{
 display(root);
}
void AVL::display(AVLNODE *temp)
{
 if(temp==NULL)
 return;
 cout<<temp->data<<" ";
 display(temp->left);
 display(temp->right);
}
void AVL::removeitem(int x)
{
 search(x);
 if(loc==NULL)
 {
  cout<<"\nitem is not in tree";
  return;
 }
 if(loc->right!=NULL&&loc->left!=NULL)
 remove1(loc,par,x);
 else
 remove2(loc,par,x);
}
void AVL::remove1(AVLNODE *l,AVLNODE *p,int x)
{
 AVLNODE *ptr,*save,*suc,*psuc;
 ptr=l->right;
 save=l;
 while(ptr->left!=NULL)
 {
  save=ptr;
  ptr=ptr->left;
 }
 suc=ptr;
 psuc=save;
 remove2(suc,psuc,x);
 if(p!=NULL)
  if(l==p->left)
   p->left=suc;
  else
   p->right=suc;
 else
  root=l;
  suc->left=l->left;
  suc->right=l->right;
   return;
}
void AVL::remove2(AVLNODE *s,AVLNODE *p,int x)
{
 AVLNODE *child;
 if(s->left==NULL && s->right==NULL)
  child=NULL;
 else if(s->left!=NULL)
  child=s->left;
 else
  child=s->right;
 if(p!=NULL)
  if(s==p->left)
   p->left=child;
  else
   p->right=child;
 else
  root=child;
 
}
void AVL::search(int x)
{
 search1(root,x);
}
void AVL::search1(AVLNODE *temp,int x)
{
       AVLNODE *ptr,*save;
       int flag;
       if(temp==NULL)
       {
  cout<<"\nthe tree is empty";
  return;
       }
       if(temp->data==x)
       {
  cout<<"\nthe item is root and is found";
  par=NULL;
  loc=temp;
  par->left=NULL;
  par->right=NULL;
  return;       }
       if( x < temp->data)
       {
  ptr=temp->left;
  save=temp;
       }
       else
       {
  ptr=temp->right;
  save=temp;
       }
       while(ptr!=NULL)
       {
  if(x==ptr->data)
  {       flag=1;
   cout<<"\nitemfound";
   loc=ptr;
   par=save;
 
  }
  if(x<ptr->data)
  ptr=ptr->left;
  else
  ptr=ptr->right;
       }
       if(flag!=1)
       {
  cout<<"\nitem is not there in tree";
  loc=NULL;
  par=NULL;
  cout<<loc;
  cout<<par;
     
}
}
 
void main()
{
 AVL a;
 int x,y,c;
        char ch; 
 do
 {
  cout<<"\n1.insert";
  cout<<"\n2.display";
  cout<<"\n3.delete";
  cout<<"\n4.search";
  cout<<"\n5.exit";
  cout<<"\nEnter u r choice to perform on AVL tree";
  cin>>c;
 
 
switch(c)
  {
   case 1:cout<<"\nEnter an element to insert into tree";
    cin>>x;
    a.insert(x);
    break;
   case 2:a.displayitem(); break;
   case 3:cout<<"\nEnter an item to deletion";
          cin>>y;
          a.removeitem(y);
          break;
   case 4:cout<<"\nEnter an element to search";
    cin>>c;
    a.search(c);
    break;
   case 5:exit(0); break;
        default :cout<<"\nInvalid option try again";
  }
  cout<<"\ndo u want to continue";
  cin>>ch;
 }
 while(ch=='y'||ch=='Y');
}

INNOCeNt boYs F09

Feedjit

Articles for you