RCS file: 1,v Working file: 1 head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: understand the need of C language. —————————- revision 1.1 locked by: root; date: … Continue reading →

RCS file: 1.c,v Working file: 1.c head: 1.2 branch: locks: strict root: 1.2 access list: symbolic names: keyword substitution: kv total revisions: 2; selected revisions: 2 description: print hello world / —————————- revision 1.2 locked by: root; date: 2014/10/22 15:57:31; … Continue reading →

RCS file: 1.c,v Working file: 1.c head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: use of printf to print data on screen —————————- revision 1.1 locked by: … Continue reading →

Program that create a file with 4k bytes free space. RCS file: file_size.c,v Working file: file_size.c head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1;    selected revisions: 1 description: Implemented to create … Continue reading →

setjmp.h is a header defined in the C standard library to provide “non-local jumps”: control flow that deviates from the usual subroutine call and return sequence. The complementary functions setjmp and longjmp provide this functionality. SYNOPSIS #include <setjmp.h> int setjmp(jmp_buf … Continue reading →

Binary search technique works for the sorted list. It is one of the most efficient techniques of searching. It is a technique of searching in ordered list where we first find middle value. Based on the comparison between the middle … Continue reading →

RCS file: ll.c,v Working file: ll.c head: 1.3 branch: locks: strict root: 1.3 access list: symbolic names: keyword substitution: kv total revisions: 3; selected revisions: 3 description: link list program —————————- revision 1.3 locked by: root; date: 2014/09/26 05:52:07; author: … Continue reading →

Programs written in the procedural style (as opposed to object-oriented style) are organized as a logical hierarchy of subroutine calls. In general, each subroutine call involves passing arguments from the caller to the callee. In addition, the callee may declare … Continue reading →

RCS file: ./stack.c,v Working file: ./stack.c head: 1.19 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 19; selected revisions: 19 description: implemented basic program for stack. gave defination for get_choice(). —————————- revision 1.19 date: 2014/07/27 15:43:57; … Continue reading →

#include #include struct queue { int data; struct queue *next; }*start=NULL,*new_node,*current; void qinsert(); void display(); void qdelete(); int front=0,rear=0; int main() { int choice; do { printf(“\n=========Main Menu========\n”); printf(“0.Exit\n”); printf(“1.Insert\n”); printf(“2.Delete\n”); printf(“3.Display\n”); printf(“\nEnter you choice:”); scanf(“%d”,&choice); switch(choice) { case 0: … Continue reading →

RCS file: main.c,v Working file: main.c head: branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 0 description: define function like: insert queue delete display ============================================================================= RCS file: header.h,v Working file: header.h head: branch: locks: strict access … Continue reading →