Apps Media

Someone asked me for a list of must have office tools . . . so if you care: Google for Applications Microsoft Office (yes, true, absolutely necessary despite how good Google Apps are) Skype Quickbooks Mozy.com for off-site backup Lightweight laptop (MacBook Air, Lenovo X61, Lenovo X300 or comparable) Big monitor at home with external keyboard and wireless mouse Good office chair Verizon wireless cellular modem for laptop (pricey but necessary if you rely on web applications) Blackberry (need real keyboard, not iPhone) Moleskine graphpaper notebook Nice briefcase from SFBags iPod Noise canceling headphones JawBone bluetooth earpiece (incomparable) A headset for Skype, perhaps Blackberry charger that with the right connecting cables will charge phone, bluetooth earpiece and iPod A thumbdrive A tiny flashlight Slip on shoes for travel through airports Non-metallic belt download file now

Stack implementation through Linked list in C We can avoid the size limitation of a stack implemented with an array, with the help of a linked list to hold the stack elements. As needed in case of array, we have to decide where to insert elements in the list and where to delete them so that push and pop will run at the fastest. Primarily, there are two operations of a stack; push() and pop() . A stack carries lifo behavior i.e. last in, first out. You know that while implementing stack with an array and to achieve lifo behavior, we used push and pop elements at the end of the array. Instead of pushing and popping elements at the beginning of the array that contains overhead of shifting elements towards right to push an element at the start and shifting elements towards left to pop an element from the start. To avoid this overhead of shifting left and right, we decided to push and pop elements at the end of the array. Now, if we use linked list to implement the stack, where wi...

Sorted Linked List implementation in C include "stdio.h" include "stdlib.h" include "conio.h" void del(int data); void insert(int value); void display(); struct node {     int data;     struct node *link; }; struct node *top=NULL,*temp, *temp1, *temp2, *temp3; int main() {     int choice,data;       while(1) //infinite loop is used to insert/delete infinite number of elements in linked list     {               printf(" 1.Insert 2.Delete 3.Display 4.Exit ");         printf(" Enter ur choice:");         scanf("%d",&choice);         switch(choice)         {         case 1:                                 printf("Enter a new element :");             scanf("%d",&data);      ...

Stop Windows Storing Recent Opened File List In Vista People some times complain why does window show the recent opened file list in windows, as for many people it really affects their privacy when others come to know which files they have opened. In Vista you can set the windows not to store the list of recently opened file list so no one will know what files you opened recently. In order to set the privacy settings in windows not to store the names of recently opened file list follow the procedure below 1. Right click on the Start button and select Properties 2. Under Start Menu , Make sure that under Privacy both of these check box are unchecked, if they are not uncheck these checkboxes which says Store and display a list of recently opened files Store and display a list of recently opened programs 3. Click OK, That�s it Done! Windows will not store any program or file opened after you set these privacy settings. Subscribe to TechnoPhillia!! by Email download  file ...

Solution Updating Global Address List Forced on MS Exchange 2008 Logon to MS Exchange Management Console. Fire following commands one by one Get-GlobalAddressList | Update-GlobalAddressList Get-AddressList | Update-AddressList download file now