Skip to main content

Posts

Comparison over Intel Core 2 duo & Intel Core i3 Processor

A comparison between processors was simple some years ago with a single core processor. All you had to look at was the clocking frequency and the cache size. The entry of multiple core chips changed it all and life became complicated. With dual, quad and even six core processors hitting the market, there are many more factors to be considered, than before. Intel's dual core and core 2 duo processors were the first ones to introduce multi-core processor based computing. The quad core processors created later have given rise to the quad core vs dual core debate, as well as the core i5 vs core i7 comparison which is something that high-end computing market consumers should think about. Prior to that, we only had the 32 bit vs 64 bit processors comparison to worry about. Today, Intel has gone through a lot of designing and planning, to introduce core i3 processors that are an improvement over the core 2 duo line. The following Intel core i3 vs core 2 duo processor comparison wil...

Sample: Calculation Factorial by Recursive Method

#include<stdio.h> int fact(int s) {     int x,y;     if(s==0)     {         return(1);     }else         {             x=s-1;             y=fact(x);             return(s*y);         }     } int main() {     int i;     printf("\nEnter No");     scanf("%d",&i);     printf("\nResult:: %d",fact(i)); }

Binary Search Operation With the use of Recursive Function

#include<stdio.h> #define MAX 5 int a[MAX]; insert() {     int i;     for(i=0;i<=MAX;i++)     {         printf("\nEnter No :: ");         scanf("%d",&a[i]);     } } sort() {     int i,j,temp;     for(i=0;i<=MAX;i++)     {         for(j=i;j<=MAX;j++)         {             if(a[i]>a[j])             {                 temp=a[j];                 a[j]=a[i];                 a[i]=temp;             }         } ...

Sample: A Java Applet Program to Calculate Summation of two numbers

import java.awt.*; import java.applet.*; public class user extends Applet {     TextField t1,t2; // Declaring Object variables     public void init() // Initializing Objects     {         t1=new TextField(10);         t2=new TextField(10);         add(t1);         add(t2);         t1.setText("0.00");         t2.setText("0.00");     }     public void paint(Graphics g) // Drawing Objects On The Java Form     {         int x=0,y=0,z=0;         String s1,s2,s;         g.drawString("Input A number in Each Box",10,50);         try         {         ...

Example of Reversed Link List Operation in C

#include<stdio.h> #include<malloc.h> typedef struct list { int data; struct list *next; }node; node *START=NULL; insert() { int i;     node *tmp,*q;     tmp=(node*)malloc(sizeof(node)); printf("\nEnter Element :: "); scanf("%d",&i);     tmp->next=NULL;     tmp->data=i;     if(START==NULL)     {         START=tmp;     }else         {             q=START;             while(q->next!=NULL)             {                 q=q->next;             }             q->next=tmp;         } } display() { node *q; if(START==NULL) { printf("\nList Is Empty"); }else{ q=START; while(q!=NULL) { print...

Sample : String Reverse In Java

import java.io.*; class test {     public static void main(String args[])     {         DataInputStream in=new DataInputStream(System.in);         try         {             String text;             System.out.println("\nEnter The Text");             text=in.readLine();             System.out.println("\nIn Reverse Order::\n");             for(int i=text.length()-1;i>=0;i--)             {                 System.out.print(text.charAt(i));             }          ...

Sample: Dual Directional Linked List

#include<stdio.h> #include<malloc.h> typedef struct list {     int data;     struct list *lnext;     struct list *rnext; }node; node *START=NULL; insert() {     int i,f;     node *tmp,*q;     tmp=(node*)malloc(sizeof(node));     printf("Enter a value");     scanf("%d",&i);     tmp->data=i;     if(START==NULL)     {         START=tmp;     }else     {         printf("Enter SIDE 1. Right 2. Left");         scanf("%d",&f);         if(f==1)         {             q=START;             while(q->rnext!=NULL)       ...