Operations on an Array in C


In Computer Programming,an Array,also known as a Vector or List,is one of the simplest data structure.Array holds equally sized data elements, generally of the same data type.In this individual elements are accessed by index(for ex arry[0],arry[2] here 0 and 2 are the index).

Difference between Singly Linked Circular List and Doubly Linked Circular List



1)The structure of a node of singly linked  circular list is as follows:-

      Struct list_type


           Int data;

         Struct list_type *next;



Linked Lists in C



      1  LINK OR POINTER: A pointer also called a link or a reference, is defined to be a variable that give the location of some other variable(point to the next consecutive node), typically of a structure containing data.


Creation,Insertion ,Deletion algorithms of a Linked List


Algorithm  of creation of a Linked List

CREATE---In this algorithm a Linked List of nodes is created. The list is pointed by pointer first, the last node of the list points to NULL., indicating the end of the list.

User Interface input Data Validation in Swing


The Simple Validation is used  for quickly adding validation code to Swing user-interface.The User Interface needs to make sure that what the user typed is legal, if it is not then  the user should be shown the error or problem.

Fibonacci Series Program and Algorithm in C


Fibonacci series is a series of nos.(0,1,1,2,3,5,8………so on) in which a new number is found by adding(+) up to 2 nos. before it for example 0+1=1,   1+1=2,   2+1=3,  3+2=5, 5+3=8…….)

Print a List of Files in a Folder



If u want to read all the files in a folder .With this code(program)u can list all the files in a given((specific) for example e:\rekha) directory.

Inter-Thread communication in Java

There are three ways for the Threads to communicate with each other.

Convert Decimal to Binary

Decimal number contains 10 digits(0-9) but Binary number contains two digits(0,1).

Doubly Linked List

In Doubly linked list, we can store in each node not only the address of next node but also the address of the previous node in the linked list.

Page 2 of 30