};

struct Scullqset
{
void **data;
struct Scullqset *next;
};
====================================================================================================
RCS file: ./scull.c,v
Working file: ./scull.c
head: 1.3
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 3; selected revisions: 3
description:
Started the scullset and scullqset for drivers.
—————————-
revision 1.3
date: 2014/07/20 11:16:22; author: utkarsh; state: Exp; lines: +11 -3
With an option of writing in the file, and read hundred characters from the pre-created file.
Stored the characters into the structures scullqset.
—————————-
revision 1.2
date: 2014/07/18 19:52:25; author: utkarsh; state: Exp; lines: +100 -8
Implemented the required structure. And used the void **data.
—————————-
revision 1.1
date: 2014/07/18 09:33:35; author: utkarsh; state: Exp;
Initial revision
=============================================================================

==========================================
MAIN MENU
==========================================
1. Create link list
2. Insert elements.
3. Update an element.
4. View the linklist.
5. Delete an element.
6. Find an element.
7. Exit.
8. Detect a loop
Enter your choice:

===========================================
INSERT_MENU
==========================================
1. Insert at the end.
2. Insert at the top.
3. Insert after nth element.
4. Insert after key element.
5. Return to main menu.
6. Exit.
Enter your choice:

====================================================================================================
RCS file: ./linklist.c,v
Working file: ./linklist.c
head: 1.9
branch:
locks: strict
utkarsh: 1.9
access list:
symbolic names:
keyword substitution: kv
total revisions: 9; selected revisions: 9
description:
Completed upto view and insert.
Debugging messages are present in the code.
—————————-
revision 1.9 locked by: utkarsh;
date: 2014/07/20 10:40:07; author: utkarsh; state: Exp; lines: +17 -2
Added an option for restricted view, depends on user to see the number
of elements to be displayed. Reliable in a linklist with a loop within itself.
—————————-
revision 1.8
date: 2014/07/20 10:30:34; author: utkarsh; state: Exp; lines: +113 -78
Added an option of detecting a loop.
Restricted view to 15 elements only.
—————————-
revision 1.7
date: 2014/07/20 06:01:24; author: utkarsh; state: Exp; lines: +92 -13
Some extra bugs removed, which were returning Segmentation Fault on some occassions.
—————————-
revision 1.6
date: 2014/07/19 20:24:54; author: utkarsh; state: Exp; lines: +40 -1
Created the next function, Insertatn().
—————————-
revision 1.5
date: 2014/07/19 19:58:36; author: utkarsh; state: Exp; lines: +84 -18
Made an insert menu. With insert at top, insert at end implemented.
—————————-
revision 1.4
date: 2014/07/19 15:55:46; author: utkarsh; state: Exp; lines: +45 -20
Completed the whole linklist. Garbage code included.
—————————-
revision 1.3
date: 2014/07/19 08:15:25; author: utkarsh; state: Exp; lines: +20 -8
C
Created the function Delete().
—————————-
revision 1.2
date: 2014/07/19 07:20:06; author: utkarsh; state: Exp; lines: +17 -1
Created the update function.
—————————-
revision 1.1
date: 2014/07/19 06:49:54; author: utkarsh; state: Exp;
Initial revision
=============================================================================

====================================================================================================

RCS file: 4.c,v
Working file: 4.c
head: 1.10
branch:
locks: strict
utkarsh: 1.10
access list:
symbolic names:
keyword substitution: kv
total revisions: 10; selected revisions: 10
description:
Assignment question 4.
—————————-
revision 1.10 locked by: utkarsh;
date: 2014/07/17 09:25:20; author: utkarsh; state: Exp; lines: +114 -110
Removed the bug, passed the address of struct pointer. So that after reallocation, there is no logical errors.
—————————-
revision 1.9
date: 2014/07/17 08:26:30; author: utkarsh; state: Exp; lines: +132 -90
Sort function is stating some problem, doing some manipulations to sort it out
—————————-
revision 1.8
date: 2014/07/16 23:01:08; author: utkarsh; state: Exp; lines: +28 -21
Completed upto 8 functions with new prototype of scan(int).
—————————-
revision 1.7
date: 2014/07/16 22:09:26; author: utkarsh; state: Exp; lines: +32 -22
Made a new function scan to flush
stdin.
But it is not working that much fine.
—————————-
revision 1.6
date: 2014/07/16 21:18:12; author: utkarsh; state: Exp; lines: +66 -3
Adding some revisions
—————————-
revision 1.5
date: 2014/07/16 20:02:23; author: utkarsh; state: Exp; lines: +73 -6
Completed upto 5 option.
—————————-
revision 1.4
date: 2014/07/16 10:23:38; author: utkarsh; state: Exp; lines: +15 -35
Modified further more. Improved the format.
—————————-
revision 1.3
date: 2014/07/16 10:11:02; author: utkarsh; state: Exp; lines: +1 -1
There was a mistake, that in realloc function, I entered size of new, which was
wrong.
—————————-
revision 1.2
date: 2014/07/16 10:07:20; author: utkarsh; state: Exp; lines: +15 -1
Some revisions
—————————-
revision 1.1
date: 2014/07/16 09:57:31; author: utkarsh; state: Exp;
Initial revision
=============================================================================================

If anybody have solutions, I would be thankful.

I have created a global function for compression, which is capable of doing the compression and encryption from 1 to 7. It can also encrypt the 8 bit data files.
I have implemented a new filter technique for decompressing, which is quite reliable, and is usable for any bit decompression.

I tried to reduce the code as much as I could, till now. The code-length of compression function is now 22 lines., and that of decompression is 29 lines.

I am not posting the code here, but if anyone wants it for study or modification. He/she may contact me on my email id.

utkarshdwivedi3394@gmail.com

#include<stdio.h>
int main()
{
int i=-1,j=0,c = 0,n;
printf(“Enter the no.: “);
scanf(“%d”,&n);
while((j<=2*n+1)&&printf(“%d, “, c==0 ? ( i==n ? printf(“\n”), c=i–: ++i) : i– , j++));
return 0;
}