EmbLogic » Nitesh Arora https://www.emblogic.com/blog Embedded System and ARM Training Tue, 03 Mar 2020 13:00:06 +0000 en-US hourly 1 http://wordpress.org/?v=3.9.1 IPC using PIPES — logfile https://www.emblogic.com/blog/08/ipc-using-pipes-logfile/ https://www.emblogic.com/blog/08/ipc-using-pipes-logfile/#comments Mon, 11 Aug 2014 07:08:50 +0000 http://www.emblogic.com/blog/?p=11375 Continue reading →]]> RCS file: ./server1.c,v
Working file: ./server1.c
head: 1.4
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 4;    selected revisions: 4
description:
Server for server-client application.
—————————-
revision 1.4
date: 2014/08/11 06:59:46;  author: root;  state: Exp;  lines: +92 -107
Replaced sleep statements with waitpid.
—————————-
revision 1.3
date: 2014/08/10 12:23:10;  author: root;  state: Exp;  lines: +98 -10
Server for 3 different clients with dedicated pipes completed.
—————————-
revision 1.2
date: 2014/08/10 08:55:31;  author: root;  state: Exp;  lines: +20 -4
received data from 3 clients.
—————————-
revision 1.1
date: 2014/08/10 08:39:26;  author: root;  state: Exp;
Initial revision
=============================================================================

]]> https://www.emblogic.com/blog/08/ipc-using-pipes-logfile/feed/ 0 MDC completed upto 4 bit Compression and Decompression https://www.emblogic.com/blog/07/mdc-completed-upto-4-bit-compression-and-decompression/ https://www.emblogic.com/blog/07/mdc-completed-upto-4-bit-compression-and-decompression/#comments Tue, 08 Jul 2014 05:50:47 +0000 http://www.emblogic.com/blog/?p=10871 Continue reading →]]> 
RCS file: mdc.c,v
Working file: mdc.c
head: 1.11
branch:
locks: strict
	root: 1.11
access list:
symbolic names:
keyword substitution: kv
total revisions: 11;	selected revisions: 11
description:
This is the program for compression of file.
----------------------------
revision 1.11	locked by: root;
date: 2014/07/03 17:16:22;  author: root; 
state: Exp;  lines: +15 -17
*** empty log message ***
----------------------------
revision 1.10
date: 2014/07/03 17:07:40;  author: root; 
state: Exp;  lines: +4 -11
Code optimisation and removal of debugging
statements.
Compression and Decompression are currently in
the same C program.
Writing decompression in diff c program next.
----------------------------
revision 1.9
date: 2014/07/03 16:54:57;  author: root; 
state: Exp;  lines: +79 -19
Compression and decompression for 4 bit
implemented.
----------------------------
revision 1.8
date: 2014/07/01 18:27:43;  author: root; 
state: Exp;  lines: +90 -37
implemented 4 bit data compression using
compression4().
the compressed data from file is being written
to comfile.txt 

zipwrite() name has been updated.
----------------------------
revision 1.7
date: 2014/06/30 15:23:32;  author: root; 
state: Exp;  lines: +52 -4
compression() added and related compression
functions for
testing.[compression2(),compression3(),......compression7()].Removed
all debugging statements.
----------------------------
revision 1.6
date: 2014/06/30 15:08:58;  author: root; 
state: Exp;  lines: +17 -16
made masterarray local to main().
----------------------------
revision 1.5
date: 2014/06/28 19:43:49;  author: root; 
state: Exp;  lines: +26 -4
finding codelength for the no of distinct
characters in file.
/
----------------------------
revision 1.4
date: 2014/06/28 19:23:09;  author: root; 
state: Exp;  lines: +6 -6
returned ndc from copy_masterarray function to
obtain no of distinct characters
----------------------------
revision 1.3
date: 2014/06/28 18:42:56;  author: nitesh; 
state: Exp;  lines: +2 -1
calculated ndc
----------------------------
revision 1.2
date: 2014/06/28 17:51:11;  author: nitesh; 
state: Exp;  lines: +54 -34
this program generates an array of distinct
characters of file.
----------------------------
revision 1.1
date: 2014/06/28 16:02:14;  author: nitesh; 
state: Exp;
Initial revision
=============================================================================
]]> https://www.emblogic.com/blog/07/mdc-completed-upto-4-bit-compression-and-decompression/feed/ 0 Log Circular Queue. https://www.emblogic.com/blog/07/log-circular-queue/ https://www.emblogic.com/blog/07/log-circular-queue/#comments Tue, 08 Jul 2014 05:47:30 +0000 http://www.emblogic.com/blog/?p=10869 Continue reading →]]> Circular Queue Implementation completed successfully.

 

RCS file: queue_cir.c,v
Working file: queue_cir.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 the circular queue using arrays.
Revision 1.1 Testing circular queue
—————————-
revision 1.1 locked by: root;
date: 2014/07/07 20:31:57; author: root; state: Exp;
Initial revision
=============================================================================

]]> https://www.emblogic.com/blog/07/log-circular-queue/feed/ 0 Link list logfile. Batch 06.01.14 https://www.emblogic.com/blog/07/10830/ https://www.emblogic.com/blog/07/10830/#comments Sun, 06 Jul 2014 14:41:09 +0000 http://www.emblogic.com/blog/?p=10830 Continue reading →]]> LINK LIST creation, traversal, insertion(all options) and deletion(all options) completed.
RCS file: ll.c,v
Working file: ll.c
head: 1.7
branch:
locks: strict
root: 1.7
access list:
symbolic names:
keyword substitution: kv
total revisions: 7;    selected revisions: 7
description:
SINGLY LINKED LIST
—————————-
revision 1.7    locked by: root;
date: 2014/07/06 14:31:05;  author: root;  state: Exp;  lines: +83 -16
delete_nth() and delete_key() functions implemented.
minor chnages in printf statements.
—————————-
revision 1.6
date: 2014/07/06 13:12:56;  author: root;  state: Exp;  lines: +44 -8
Implemented delete_end().
Added “deletion node possible” alert in delete_beg().
—————————-
revision 1.5
date: 2014/07/06 12:47:08;  author: root;  state: Exp;  lines: +52 -3
Implemented delete_beg().
—————————-
revision 1.4
date: 2014/07/04 18:26:28;  author: root;  state: Exp;  lines: +48 -10
Implemented insert_key(); i.e. a function to insert node after a key value location.
Also entered condition checking in insert_nth().
—————————-
revision 1.3
date: 2014/07/04 16:59:48;  author: root;  state: Exp;  lines: +84 -39
Implemented function to insert node at the beginning of link list and also a function to insert after nth node.
—————————-
revision 1.2
date: 2014/07/04 07:32:04;  author: root;  state: Exp;  lines: +1 -1
creation of link list, insertion at beginning and traversal have been implemented.
—————————-
revision 1.1
date: 2014/07/04 07:16:00;  author: root;  state: Exp;
Initial revision
=============================================================================

]]> https://www.emblogic.com/blog/07/10830/feed/ 0 Stack using array Logfile. https://www.emblogic.com/blog/07/10810/ https://www.emblogic.com/blog/07/10810/#comments Sat, 05 Jul 2014 19:04:47 +0000 http://www.emblogic.com/blog/?p=10810 Continue reading →]]> STACK implementation using array completed.

RCS file: stack.c,v
Working file: stack.c
head: 1.4
branch:
locks: strict
root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4;     selected revisions: 4
description:
STACK MAIN PROGRAM. In initial rev 1.1 – implemented getchoice(), operation(), and declared push(),pop(),display() for testing.
—————————-
revision 1.4    locked by: root;
date: 2014/07/05 18:40:43;  author: root;  state: Exp;  lines: +5 -3
Made changes to display() to have a better display pattern for stack.
—————————-
revision 1.3
date: 2014/07/05 18:25:20;  author: root;  state: Exp;  lines: +14 -3
Implemeted POP operation on stack.
—————————-
revision 1.2
date: 2014/07/05 18:14:14;  author: root;  state: Exp;  lines: +31 -4
Implemeted PUSH and DISPLAY functions on stack.
—————————-
revision 1.1
date: 2014/07/05 17:56:15;  author: root;  state: Exp;
Initial revision
=============================================================================

]]> https://www.emblogic.com/blog/07/10810/feed/ 0 Multiple Data Compression completed upto Code Length Calculation https://www.emblogic.com/blog/06/multiple-data-compression-completed-upto-code-length-calculation/ https://www.emblogic.com/blog/06/multiple-data-compression-completed-upto-code-length-calculation/#comments Mon, 30 Jun 2014 06:59:17 +0000 http://www.emblogic.com/blog/?p=10726 Continue reading →]]> RCS file: mdc.c,v
Working file: mdc.c
head: 1.5
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 5; selected revisions: 5
description:
This is the program with an array storing all the present characters in the file.
—————————-
revision 1.5
date: 2014/06/28 19:43:49; author: root; state: Exp; lines: +26 -4
finding codelength for the no of distinct characters in file.
/
—————————-
revision 1.4
date: 2014/06/28 19:23:09; author: root; state: Exp; lines: +6 -6
returned ndc from copy_masterarray function to obtain no of distinct characters
—————————-
revision 1.3
date: 2014/06/28 18:42:56; author: nitesh; state: Exp; lines: +2 -1
calculated ndc
—————————-
revision 1.2
date: 2014/06/28 17:51:11; author: nitesh; state: Exp; lines: +54 -34
this program generates an array of distinct characters of file.
—————————-
revision 1.1
date: 2014/06/28 16:02:14; author: nitesh; state: Exp;
Initial revision
=============================================================================
“log_mdcproram” 34L, 1130C 34,1 All

]]> https://www.emblogic.com/blog/06/multiple-data-compression-completed-upto-code-length-calculation/feed/ 0 Program to find the HCF and LCM of two numbers. https://www.emblogic.com/blog/06/program-to-find-the-hcf-and-lcm-of-two-numbers/ https://www.emblogic.com/blog/06/program-to-find-the-hcf-and-lcm-of-two-numbers/#comments Thu, 19 Jun 2014 16:48:41 +0000 http://www.emblogic.com/blog/?p=10560 Continue reading →]]> //HCF and LCM of two nos.

#include
int main()
{
int a,b,num1,num2,deno,nume,rem=1,lcm;

printf(“\nEnter two nos: “);
scanf(“%d %d”,&a,&b);

if(a>b)
{
num1=a;
num2=b;
}

else
{
num1=b;
num2=a;
}

nume=num1;
deno=num2;

while(rem!=0)
{
rem=nume%deno;
nume=deno;
deno=rem;
}

printf(“\nHCF: %d “,nume);
lcm=(num1*num2)/nume;
printf(“\nLCM: %d “,lcm);

return 0;

}

]]> https://www.emblogic.com/blog/06/program-to-find-the-hcf-and-lcm-of-two-numbers/feed/ 0