EmbLogic's Blog

C assignment no. 7

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:
understand array concept by getting input in array and displaying on terminal
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 18:38:40; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 2.c,v
Working file: 2.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
add two array and store the result in third array and display the result
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 18:42:47; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 3.c,v
Working file: 3.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
get the average of n numbers using array
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 18:45:36; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 4.c,v
Working file: 4.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to find the largest number in an array
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 18:52:36; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 5.c,v
Working file: 5.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the concept to find out the smallest number in a array
/
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 19:11:00; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 6.c,v
Working file: 6.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to find a key value inside an array(linear search/sequential serach)
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 19:19:59; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 7.c,v
Working file: 7.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to reverse the order of array elements
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 19:26:09; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 8.c,v
Working file: 8.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to merge two array in third array
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 19:29:21; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 9.c,v
Working file: 9.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement binary search algorithm to search a key element
fast process with a limitation that all elements should be sorted
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 19:53:42; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 10.c,v
Working file: 10.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to insert a element inside an array
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 20:14:24; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 11.c,v
Working file: 11.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to delete an element from the array
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 20:16:43; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 12.c,v
Working file: 12.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to sort an array using bubble sort
—————————-
revision 1.1 locked by: root;
date: 2014/10/29 21:24:31; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 13.c,v
Working file: 13.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to sort an array using insertion technique
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 00:27:54; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 14.c,v
Working file: 14.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to sort an array using selection sort method
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 02:16:30; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 15.c,v
Working file: 15.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to add the two matrix
print them on terminal in a standard matrix form
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 02:28:06; author: root; state: Exp;
Initial revision
=============================================================================
rlog: RCS/16.c,v: No such file or directory

RCS file: 17.c,v
Working file: 17.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to get transpose of a matrix
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 02:33:24; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 18.c,v
Working file: 18.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to multiply two matrix
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 02:45:22; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 19.c,v
Working file: 19.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to sort a order 6 matrix.
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 03:19:28; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: 20.c,v
Working file: 20.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
implement the logic to find a 3*3 matrix into 4*4 matrix
..
—————————-
revision 1.1 locked by: root;
date: 2014/10/30 16:22:15; author: root; state: Exp;
Initial revision
=============================================================================
[root@VIPIN c_assignment7]#

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>