PROJECT-01(Multiple Data Compression)

As per the project started from basics of ‘c’, i.e introduction of c ,syntax and semantics control structures -conditionals ,loops,arrays,strings,project management tools,file io,functions,structures,queus stacks ,searching and sorting.

My part of work and work status is – I had tried to clear the basic concept of c they are -:

->declaring variables

->c pre-processors

->prepossessing statements

->operators in c

->data types->primary data type-> int

char

float

double.

Upto the part above the the topics related are clearly covered and implemented ,and the functions like printf,,scanf,size of a data type were worked and successfully evaluated with control structures and conditionals .the assignments provided by emblogic pvt ltd were very helpful to make the concepts strong and the are also evaluated.

->secondary data type->Arrays

pointers

structures

unions

in the above the topics related and the concept of the above were likely to be cleared, but the

assignments provided by emblogic India pvt ltd were a bit hard and it took time for me to implement.

The above topics on implementation status -arrays are successfully implemented and the others

are partially implemented.

->functions

in the functions of c, the process of creating a function is ->function declaration

->function call

->function definition

the above concepts are covered and i had worked with some examples , but the assignments provided are more conceptual and the required logic for the assignment questions are a bit hard as i felt,and i am working to make the concepts well and to solve the assignment as quick as possible.

->project management tools

->queues

->searching and sorting

searching and sorting techniques could be define as the way to search an element in an array

by different methods like:

searching –->

->linear searching

The above technique is used to find or search an element in a give set of elements or by using linked list.

The technique linear searching was implemented by taking an array i.e a set elements of same data type arranged and stored in a continuous memory location. A particular element had to be given as a input to the existed set of elements and the work to be done is to search the particular element in the given set of elements. The code for the above technique was successfully written and evaluated.

->binary searching

the technique binary searching is a searching technique used to search a element in a given set of elements .this searching technique has the same function as linear searching but the method of searching the element is better and it make min complexes. In this the given set of elements are to be arranged i ascending Oder using the sorting technique .the searching techniques are implemented and successfully evaluated.