Home » Archive

Data Structures »

[24 Oct 2009 | No Comment | ]

Stack is an ordered list in which all insertions & deletions are made at only one end, called Top. It operates in principle of last-in-first-out (LIFO) which means the items inserted at last is removed first. For example, if the elements A,B,C and D are inserted in to the stack in the same order then the removal of all elements will be in the reverse order (D,C,B and A).

Algorithms, C, Classical Languages & Tools, Programming »

[24 Oct 2009 | No Comment | ]

Introduction
Though all of the programming languages enhanced to provide basic date, time and calendar calculations, writing hard logic for a simple requirements such as calander improves our programming skill. Let us consider about calculating day of a week for a given date and calender for a given month in C language. This is for helping learners of C language.

Featured, Internet »

[24 Oct 2009 | No Comment | ]
StumbleUpon! Your surfing friend!

How do you feel if one of your knowledgable friend is sitting near you whenever you like to surf on the web and helping you by pointing-out some good, informative websites of your interest?
A social book marking site StumbleUpon helps you to discover new websites of your own interest. Also you can mark a website that you know or currently browsing and share with your friends. The site supports rating of websites that you are viewing.

Algorithms, Java, Programming »

[24 Oct 2009 | No Comment | ]

The Producer-Consumer problem is the traditional one to explain the concept of multitasking with shared memory access in operating systems. This program demonstrates how a shared memory is being accessed by two different threads which run concurrently through an Applet. The producer thread continuously produces an item (here it generates a random number) and inserts into the stockpile (here it is an array limited in size), until space exists. The other thread named consumer, consumes an item (here it simply removes the item from the array). If there is no …

Data Structures, Linked List, Programming »

[23 Oct 2009 | No Comment | ]

In an array, elements are physically stored in consecutive places. Since we know element number x will be available in the place A+X-1, where A is the starting location of the array, accessing elements is very faster one-by-one or randomly. But, think about rearranging these numbers. In order to place an element between two other numbers, we have to make a place empty between them. It is very tedious to move the entire elements to subsequent places to make a room for the new number. Deletion is also the same …

Get Adobe Flash playerPlugin by wpburn.com wordpress themes