EmbLogic's Blog

Trouble-free programs for phone tracking clarified reviewsphonetracking.com

Cell phone tracking

Application That Spy on Cell Is Currently A Single Click Apart

For business employers who like immediate tracking of employee’s perform functionality a computer software that monitor mobile is now single click away. If you have furnished company mobile phone devices to staff members for much better small business deals, you might have all the legal right to access portable items. In any other case, check with a guru concerning personal privacy laws and regulations just before use to stop upcoming complications.

The Options For Criteria In phone tracking

Go through, research, discover

Understand, in getting a spyware of preference, be sure to have undergone specific internet sites and compare functions before you start. Evaluations, articles spy on text messages or blog posts or websites expressed by users will greatly help out with your decision making. You will find spywares that monitor phone for iphone 4 with no offender bursting required including Highster Portable and Car Forwards Secret agent. However if you’re no avid Apple company person, numerous programs particularly SurePoint Criminal is usually a prospective selection. Be aware that choices differ often (paid out) month to month or every year. But the prices don’t go above $30 and Buck70 respectively.

Making use of spyware and adware at your workplace

As employers, be aware that the sole aim of employing spyware and adware at the office would be to keep an eye on employee’s activities from the work area. It is to determine regardless of whether an employee appropriately utilizes mobile phones for expert functions. Making use of any of the previously mentioned paid for spy apps, organisations can slightly entry pursuits done through portable without having the guardianship on the telephone. To put it simply, all gathered facts is seen true-quantity of the key pad on your laptop computer or cellular telephone (will depend on the place you install the spyware). Messages and call up firelogs,two of the most operated activities on cellular for perform might be reached incoming and outgoing with extensive details. From here, you may observe a member of staff properly works by using both for company’s achieve andnot for against the law purpose. If so comes about then information obtained could possibly be strong evidences. Although business employers traveler call firelogs, and also information (from text message, written text or cultural messengers), web browser heritage, posts on internet sites, Gps navigation place and in some cases go on a image of employee’s setting.

Spywares could help you save ample money, commitment on ensuring appropriate perform flow. It is possible to talk about who amid your individuals press logging into Myspace in the course of working hours. Who engages in terrible alternate of text messages (indeed, it occurs). Individuals specified stuff that if disregarded might be misused over time. You understand for certain how addicting these platforms in spite of what age.

Mobile phone course of action

You can find simple measures on installing a spy ware, it doesn’t matter what variety it’s. First , pick the software program of choice online and click on obtain. Subsequent would be to type in the certificate critical (double check because you key-in) and hold back until “download successful” prompts. Then you can definitely commence spying including the Pro’s or even a detective agency.

Posted in Uncategorized | Tagged | Leave a comment

A Background In No-Fuss Systems For spy software guide bestspysoftware.net

Get The Most Out Of Your Mobile Phone With These Some Tips

These days, the mobile phone is a very well-liked technological innovation item. Most people aren’t capable to do without 1, and a lot individuals very own a single. There are many points that they could do apart from producing cell phone calls. If you’re searching for recommendations on mobile phones, this is basically the article for you.

  • No-Hassle best spy software Programs – The Facts
  • A Spotlight On Essential Details Of best spy software
  • Trouble-Free best spy software Programs Simplified
  • Compared – Methods In best spy software
  • An Update On Effortless Programs Of best spy software
  • Clarifying Sensible Products In best spy software
  • Swift Products In best spy software – The Options

Explaining Straightforward best spy software Methods

Did you know that wherever you may well be, you can find assist through the use of your cell phone. You do not even have to maintain your phone’s insurance place to utilize this service. The worldwide cellular emergency amount is 112. In case there is a severe crisis, in the event you call 112 your mobile phone will search for any pre-existing portable network to build a crisis number for your provide place. Even when your keyboard is locked, it can be continue to easy to dial 112.

xnspy reviews

There exists a issue in the event the cell phone battery power is shedding energy quickly. You could have a poor signal. This could empty your battery power rapidly. Should you aren’t utilizing your mobile phone, don’t store it within a location in which the sign is weak.

Be sure to reboot your cell phone every second day. This is especially important when you have a smartphone. Just as a pc, mobile phones have to be restarted to solve glitches and purge storage. Should you forget to reactivate it on alternate days, you may begin to experience issues.

When selecting a pre-owned cellphone, be sure to know what you are about buying from. Take into account only purchasing from your respected business which will again your buy with some type of assure. This may shield you if the phone is defective. If you purchase from somebody, look at seeking the cell phone out well before handing over any cash.

If you are to acquire a smartphone, ensure that it is the thing you need. Cell phones price a lot of cash, and they also provide the best value when the characteristics are of help for you. To be honest that some people only need to have a mobile phone to make fundamental cell phone calls. If that http://bestspysoftware.net/guide-how-to-get-everything-needed-from-using-your-cell-phone-spy-app/ is that you, remember that touch screen phones might cost more initially and the monthly fees are increased. This is not a decision you might like to make.

Should you be looking for a new mobile phone and are unclear about which direction to consider, do a favour and get your friends and relatives associates for opinions. By looking for private strategies for each manufacturers and models, the method will probably be much simpler. Obtaining anything you already know folks like could be a terrific way to wind up content with your brand new phone.

Be careful about your battery power usage. Observing motion pictures and video tutorials empty your battery pack very quickly. So does hearing songs. If you would like do this stuff together with your cell phone, make sure you possess an limitless data program and constantly have a battery charger close by. This assists to actually usually do not shed assistance.

Do you know that it will save you funds on telephone calls to acquire details? While many cell phone companies fee around $1.75 for getting in touch with 411, you can get information you need by dialing (800)Free411. You will definately get exactly the same information without experiencing any other charges on your cellphone bill.

Keep the cell phone clear of h2o. It can be quite normal for cell phones to become dropped in and destroyed by normal water. To avert this, try out trying to keep the phone far from types of drinking water. Mishaps will eventually come about over time.

Hopefully this information has offered the suggestions you require about mobile phones. This small part of technological innovation can do a great deal that you ought to take full advantage of it. Take advantage of the details out of this article to make sure you understand how to use these functions.

Posted in Uncategorized | Tagged , | Leave a comment

Client Server comm. using threads & Sockects

Just like Pipes, Sockets are used for communication but within the processes of two different devices/computers. A socket is used for reading/writing operations at one end and has the network interface at other end. Below is the RCS logfile of the project.

To check the source code click the link given below.

click here…

Continue reading

Posted in Project 04: FTP based Client Server using Threads and Sockets | Tagged | Leave a comment

Shell Graphics (Dialog Box)

Screenshot from 2017-05-28 10:51:23 Continue reading

Posted in Shell Scripts | Tagged | Leave a comment

Hash Table RCS logfile

RCS file: deleted.c,v
Working file: deleted.c
head: 1.2
branch:
locks: strict
root: 1.2
access list:
symbolic names:
keyword substitution: kv
total revisions: 2;    selected revisions: 2
description:
this func deletes the data from the HASH TABLE
for a particular key entered
—————————-
revision 1.2    locked by: root;
date: 2017/04/23 05:33:54;  author: root;  state: Exp;  lines: +1 -1
replaces the new val of key after deletion fron $ to 0;
—————————-
revision 1.1
date: 2017/04/23 04:41:17;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: functionpointer.c,v
Working file: functionpointer.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func contains the definitions of the function pointers
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:42:42;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: insertd.c,v
Working file: insertd.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
thid func is used to insert a new data for a new key into tha HASH TABLE
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:44:12;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: main.c,v
Working file: main.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the main function in which we have created a Hash table of size entered by the user and
also we have called mainmenu() and the choice returned by the mainmenu() is then passed to the operations()
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:46:48;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: mainmenu.c,v
Working file: mainmenu.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this the main menu  function which displays the menu to the user to insert, delete or search the data for a particular key
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:48:36;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: operations.c,v
Working file: operations.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func calls the different functions to insert, delete or search data in the hash tabe
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:50:38;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: search.c,v
Working file: search.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func searches for the data for a particukar key in the hash table
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:51:41;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: header.h,v
Working file: header.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this file contains all the header files needed in the project
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:52:40;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: prototypes.h,v
Working file: prototypes.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func contains the declation of all the functions
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:55:10;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: struct.h,v
Working file: struct.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this file contains the structure  used
for storin data
—————————-
revision 1.1    locked by: root;
date: 2017/04/23 04:57:06;  author: root;  state: Exp;
Initial revision
=============================================================================

Posted in Data Structures with C | Tagged | Leave a comment

Semaphore command

Semaphore Calls and Datatypes
1 union semun
This is a union the semaphore library requires.it’s not specified in the sys/sem.h header file and we’re required to specify it ourselves. It’s needed by semctl()
union semun
{
int val; // value for SETVAL
struct semid_ds* buf; // buffer for IPC_STAT, IPC_SET
unsigned short* array; // array for GETALL, SETALL
struct seminfo* __buf; // buffer for IPC_INFO
};

2 struct sembuf
Defines an operation to be performed by the semop()call. The members you need to know about are:
Sem num is the index of the first semaphore to perform the operation on. Note that the index starts from zero.
Sem op is the operation to perform. Semop() covers this in greater detail.
Sem flg specifies how the operation is supposed to be treated when the process exits. Usually you’ll want this to bem SEM_UNDO so it will be undone when the process exits. Passing the flag IPC NOWAIT will make sure the call to semop() doesn’t block and instead fails if it would have blocked.

3 semget()
Gets a semaphore set. The value returned is its id, for use with other calls.
int semget(key_t key, int n, int flags);
key is the key associated with the semaphore set you want. n is the number of semaphores the set should contain. Flags specifies how how the set should be allocated.

4 semop()
Performs a semaphore operation (i.e. incrementing, decrementing, etc.) on the selected members of a semaphore set.
int semop (int id, struct sembuf* op, unsigned n);
id is the semaphore set’s id.
Op is the operation to perform.
N is the number of semaphores to affect. You’ll nearly always be passing in a value of 1 here.
struct sembuf ’s sem op field is important. It specifies what you want to do to the semaphore, be it incrementing, decrementing, or toasting over an open fire.
A non-zero value will be added to the semaphore’s value. Note that this means negative values indicate subtraction.
A value of zero will make the operation block until the semaphore value becomes zero.

5 semctl()
int semctl(int id, int iSem, int cmd, union semun arg);
id is the semaphore set id.
Isem is the semaphore you want to twiddle. Only valid with some of the commands.
Cmd is the command you want to perform.
Arg is used for fiddling with semaphore values. There are two values for
cmd worth looking at: SETVAL and IPC_RMID. For details on the others,
type
man semctl

5.1 IPC_RMID
Automatically removes the semaphore set and awakens any processes waiting for a semaphore in the set to unlock. This should be done by the last process using the semaphores. Semctl() will return -1 if something goes horribly wrong with this.
5.2 SETVAL
it is used to set the value of semaphore.

Posted in Uncategorized | Leave a comment

Inter-Process Communication

Processes communicate with each other and with the kernel to coordinate their activities. Linux supports a number of Inter-Process Communication (IPC) mechanisms. Signals and pipes are two of them but Linux also supports the System V IPC mechanisms named after the Unix release in which they first appeared.Different processes on the same machine/OS use Inter-process Communication (IPC) to communicate with each other. There are several IPC mechanisms, but almost all typically boil down to carefully controlled access to shared memory. The OS will allocate a block of memory specifically for this purpose.Interprocess communication (IPC) is a set of programming interfaces that allow a programmer to coordinate activities among different program processes that can run concurrently in an operating system. This allows a program to handle many user requests at the same time.

Posted in Uncategorized | Leave a comment

Semaphore in IPC

Semaphores are another IPC mechanism available when developing on UNIX. They allow different processes to synchronise their access to certain resources. In Computer Language, the most common and simplest kind of semaphore is called a binary semaphore because they have two states
locked or unlocked. These act much like traffic lights.
When a process wants exclusive access to a resource, shared memory being an example, they attempt to lock the semaphore associated with that resource. If the semaphore they are attempting to lock is already locked, the caller is suspended, otherwise they are granted to lock. When you’ve finished doing whatever you wanted to do, you unlock the resource and any processes that have attempted to lock that semaphore in the meantime are woken up again to attempt the lock again. This way only one process can have access to the resource at once.
In addition, semaphores can be used as a signalling mechanism. In the simple chat application. the instance of the application acting as the server locks a semaphore to suspend it until a client application unlocks the semaphore to signal that it’s connected to the server and mapped the
shared memory area onto its own address space

Posted in Uncategorized | Leave a comment

Insert ,delete at any location in Linklist

RCS file: create_node.c,v
Working file: create_node.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
creating node in the linklist
—————————-
revision 1.1 locked by: root;
date: 2017/04/02 05:11:24; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: delete_beg.c,v
Working file: delete_beg.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
in this function we are deleting node from begining of linklist
—————————-
revision 1.1 locked by: root;
date: 2017/04/07 04:32:28; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: delete_end.c,v
Working file: delete_end.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
in this deletion of node take place from end
—————————-
revision 1.1 locked by: root;
date: 2017/04/07 04:40:10; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: delete_key.c,v
Working file: delete_key.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
in this deletion o node take place where key value matches with entered value
—————————-
revision 1.1 locked by: root;
date: 2017/04/07 04:34:55; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: deletemenu.c,v
Working file: deletemenu.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
in this menu list is shown from where you want to delete node
—————————-
revision 1.1 locked by: root;
date: 2017/04/07 04:35:46; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: delete_nth.c,v
Working file: delete_nth.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
in this the node you want to delete is processing
—————————-
revision 1.1 locked by: root;
date: 2017/04/07 04:36:16; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: delete_oper.c,v
Working file: delete_oper.c
head: 1.2
branch:
locks: strict
root: 1.2
access list:
symbolic names:
keyword substitution: kv
total revisions: 2; selected revisions: 2
description:
all delete operations is in this function
—————————-
revision 1.2 locked by: root;
date: 2017/04/07 04:47:29; author: root; state: Exp; lines: +2 -2
*** empty log message ***
—————————-
revision 1.1
date: 2017/04/07 04:36:50; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insert_beg.c,v
Working file: insert_beg.c
head: 1.4
branch:
locks: strict
root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4; selected revisions: 4
description:
insert node in the begining off linklist
—————————-
revision 1.4 locked by: root;
date: 2017/04/03 04:39:10; author: root; state: Exp; lines: +2 -2
s.e
—————————-
revision 1.3
date: 2017/04/03 04:33:10; author: root; state: Exp; lines: +1 -1
se
—————————-
revision 1.2
date: 2017/04/03 04:23:46; author: root; state: Exp; lines: +4 -5
insert node in begining of the link list.
—————————-
revision 1.1
date: 2017/04/02 05:11:44; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insert_end.c,v
Working file: insert_end.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
insert node at the end of linklist
—————————-
revision 1.1 locked by: root;
date: 2017/04/02 05:12:06; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insert_key.c,v
Working file: insert_key.c
head: 1.4
branch:
locks: strict
root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4; selected revisions: 4
description:
insert node after the key value
—————————-
revision 1.4 locked by: root;
date: 2017/04/07 04:37:15; author: root; state: Exp; lines: +3 -0
s.e
—————————-
revision 1.3
date: 2017/04/03 06:46:15; author: root; state: Exp; lines: +2 -3
insert after the key value
—————————-
revision 1.2
date: 2017/04/03 06:09:09; author: root; state: Exp; lines: +17 -1
insert where key value is matched
—————————-
revision 1.1
date: 2017/04/02 05:12:27; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insertmenu.c,v
Working file: insertmenu.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
displays the inserting option.
in this menulist shown where to insert node
—————————-
revision 1.1 locked by: root;
date: 2017/04/02 05:13:10; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insert_nth.c,v
Working file: insert_nth.c
head: 1.3
branch:
locks: strict
root: 1.3
access list:
symbolic names:
keyword substitution: kv
total revisions: 3; selected revisions: 3
description:
insert node at desired or nth location
—————————-
revision 1.3 locked by: root;
date: 2017/04/07 04:37:30; author: root; state: Exp; lines: +30 -3
S.E
—————————-
revision 1.2
date: 2017/04/03 06:47:33; author: root; state: Exp; lines: +17 -1
insert node at the given or desired location in linklist
—————————-
revision 1.1
date: 2017/04/02 05:14:02; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: insert_oper.c,v
Working file: insert_oper.c
head: 1.6
branch:
locks: strict
root: 1.6
access list:
symbolic names:
keyword substitution: kv
total revisions: 6; selected revisions: 6
description:
all operation off insert are displaying here
—————————-
revision 1.6 locked by: root;
date: 2017/04/07 04:47:30; author: root; state: Exp; lines: +2 -2
*** empty log message ***
—————————-
revision 1.5
date: 2017/04/03 06:48:07; author: root; state: Exp; lines: +1 -1
insert nth location and insert at key value function calling
—————————-
revision 1.4
date: 2017/04/03 06:10:45; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.3
date: 2017/04/03 05:07:31; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.2
date: 2017/04/03 05:06:16; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.1
date: 2017/04/02 05:14:44; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: main.c,v
Working file: main.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
this is the main program file
which calls the function
—————————-
revision 1.1 locked by: root;
date: 2017/04/02 05:15:21; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: mainmenu.c,v
Working file: mainmenu.c
head: 1.2
branch:
locks: strict
root: 1.2
access list:
symbolic names:
keyword substitution: kv
total revisions: 2; selected revisions: 2
description:
a list of menu displays here
—————————-
revision 1.2 locked by: root;
date: 2017/04/02 05:20:42; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.1
date: 2017/04/02 05:16:13; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: operation.c,v
Working file: operation.c
head: 1.3
branch:
locks: strict
root: 1.3
access list:
symbolic names:
keyword substitution: kv
total revisions: 3; selected revisions: 3
description:
operation to be implemented are displaying here
—————————-
revision 1.3 locked by: root;
date: 2017/04/07 04:47:31; author: root; state: Exp; lines: +2 -2
*** empty log message ***
—————————-
revision 1.2
date: 2017/04/07 04:37:37; author: root; state: Exp; lines: +21 -5
deletion func() called
—————————-
revision 1.1
date: 2017/04/02 05:16:44; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: traverse.c,v
Working file: traverse.c
head: 1.5
branch:
locks: strict
root: 1.5
access list:
symbolic names:
keyword substitution: kv
total revisions: 5; selected revisions: 5
description:
it displays the all elements of linklist
—————————-
revision 1.5 locked by: root;
date: 2017/04/03 05:04:29; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.4
date: 2017/04/03 05:03:57; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.3
date: 2017/04/03 04:44:31; author: root; state: Exp; lines: +1 -1
S.E
—————————-
revision 1.2
date: 2017/04/03 04:39:14; author: root; state: Exp; lines: +3 -1
ssyntax error
—————————-
revision 1.1
date: 2017/04/02 05:17:18; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: header.h,v
Working file: header.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1; selected revisions: 1
description:
all header files are included here
—————————-
revision 1.1 locked by: root;
date: 2017/04/02 05:17:47; author: root; state: Exp;
Initial revision
=============================================================================

RCS file: prototype.h,v
Working file: prototype.h
head: 1.2
branch:
locks: strict
root: 1.2
access list:
symbolic names:
keyword substitution: kv
total revisions: 2; selected revisions: 2
description:
all functions are declared here
—————————-
revision 1.2 locked by: root;
date: 2017/04/07 04:37:52; author: root; state: Exp; lines: +10 -0
all prototype is declared
—————————-
revision 1.1
date: 2017/04/02 05:18:08; author: root; state: Exp;
Initial revision
=============================================================================

Posted in Uncategorized | Leave a comment

Client-Server-Processing client communication using FIFO (RCS logfile)

This project uses FIFOs for communication between the client and server and between the server and the processing clients.

Where a client send its data to the server which then further pass this data to the processing client. The processing client then process this data and send the result back to the server which then send the data again back to the client.

RCS file: addr.c,v
Working file: addr.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the processing client which will add the data raceived from the server
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:11:16;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client1.c,v
Working file: client1.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is requesting client 1 which will request the server to process its data
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:12:08;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client2.c,v
Working file: client2.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is requesting client 2 which will request the server to process its data
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:13:00;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: client3.c,v
Working file: client3.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is requesting client 3
which will request the server to process its data
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:13:18;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: functionpointer.c,v
Working file: functionpointer.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func contains the definition of all the function pointers
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:15:17;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: mult.c,v
Working file: mult.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the processing client which multiplies the data received from the server
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:15:56;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: openfifo.c,v
Working file: openfifo.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this func is used to open the fifos
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:16:31;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: server.c,v
Working file: server.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the main server which will accept the request from the requesting client and will send this request to the
processing clients for further processing
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:16:51;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: subtr.c,v
Working file: subtr.c
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this is the processing client which will subtract the data received from the server
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:19:45;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: header.h,v
Working file: header.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this file contains the header files to be included in the project
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:20:27;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: prototypes.h,v
Working file: prototypes.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this file contains the declarations of all the functions used in the project
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:21:03;  author: root;  state: Exp;
Initial revision
=============================================================================

RCS file: struct.h,v
Working file: struct.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
this file cintains the structure, a user defined data type
—————————-
revision 1.1    locked by: root;
date: 2017/04/19 08:21:47;  author: root;  state: Exp;
Initial revision
=============================================================================

Posted in Project 03: Client Server Communication using Linux and IPC | Tagged | Leave a comment

The latest on no-hassle ikeymonitor plans phonetrackingreviews.com

Phone Tracking

The best way to Covertly Keep track of Texting on your own Galaxy spyera reviews S4 and other Android os Product

Examining Fundamental Factors For phone tracking

  • Trouble-Free phone tracking Programs – The Facts
  • Finding No-Fuss Products Of phone tracking
  • Revealing Effortless phone tracking Programs
  • Uncovering Quick Systems Of phone tracking
  • Uncovering Easy Systems For phone tracking
  • Introducing Root Criteria For phone tracking
  • Finding Simple Programs In phone tracking

Children become adults way too quickly these days, and giving them a smaller-computer system by means of a touch screen phone only leads to that. Even though internet connection places a world on understanding at their fingertips, furthermore, it paves way for using numerous social networks readily available.

While many social networking is age-limited, the arrival of text messages is taking most interactions from experience-to-face to display-to-computer screen, which makes it extremely difficult realize your babies are getting into.

Trust is a thing, but if you have a little one which is continuously stepping into trouble, sneaking away from home, or you theorize might be enjoying drugs, its integral thus to their well being which you keep an eye on them. But sad to say, a few things can’t be uncovered searching through compartments or eavesdropping.

Before you go adding this application with your kid’s device, read on to find out how you should definitely undertake it with no receiving caught.

The way to Install Text messages System (Or even the Stealthier In .Technique Overall healthInch)

You clearly do not want to tell your son or daughter in the program, so install previous flexispy review to offering them their new cellphone, or be stealthy and snatch their cellphone as they definitely sleep—whatever it takes.

To comply with The major search engines application policy, the Engage in Store edition includes ikeymonitor remote install a continuous notice that is situated for the standing clubhouse. Even though, mentionened above previously through the builders, In .If your kid may be identified as having Oppositional Rebellious Condition, you really should think about employing our absolutely disguised . variation.In .’ —I believe many of us ought this version at any rate.

To put in the undetectable type. very first enable setups from InchMysterious sources In within the device under consideration, then set up the secretly-known as Program Health software.

Tips on how to Change Taletid System (Or “System WellnessInches)

All that must be completed after installing the software is opening up it down and following the requires. You may be necessary to on line, brand the device staying monitored, then warning on the SMSTracker web page to switch on the services.

Tips on how to See Their Text Discussions

With the account information practical, see a sign in web site to start opening text messages. As soon as in, go through the Taletid Firewood tabs.

Towards the end you can see mspy a time stamp, and also grounds for From. To. along with the on the meaning.

The disposable type is fixed to text messaging, but if you really spyera review need to keep an eye on a person, purchase high quality functions starting up at Dollar2Versus30 days, like MMS keeping track of, Navigation following, get in touch with tracking, and internet browser checking. Personally, Taletid will do with such kids.

Now, let us even be genuine for a second—this overall method and application might be put in place on other folks that you experienced, little ones or you cannot. I’m not really condoning it, but you do what you want. Just do not blame me when you’re getting grabbed.

Relevant

The Best Way To. Text Much better in your Straight talk samsung Environment S4 with This Crossbreed Message Software Depending on Google android 4.3 & CyanogenMod 10.2

Tips On How To. Get CyanogenMod&#39s New Guaranteed Text Messages With out Rooting or Setting up a Customized ROM

The Best Way To. Obtain the Globe S4&Number39s Polaris Place of work 5 to Change Ms Office Paperwork on the Check out the Galaxy Observe 2

News. Everything you should Know of the New Straight talk samsung Globe S4

The Way To. Allow the Disguised . Designer Options on Your Straight talk Universe S4

How You Can. Origin Ough.S.AndCanadian Environment S4!

How You Can. Covertly Check Text Messages on the Universe S4 or another Android os Device

How You Can eblaster-mobile. Service provider Open Your Straight talk Whole world S4 So That You Can Use A different Sim

Tips On How To. Encourage the Concealed Programmer Choices on Your New samsung Environment S4

The Way To. Put in Flash Person with a Straight talk samsung Globe S4 to Watch Amazon online Instant Video tutorials & Much more

The Way To. Increase indicative for Get Improvement for a Android’s Reputation Pub

Tips On How To. Main Any Straight talk Environment S4 in One Click

Posted in Uncategorized | Tagged , , , | Leave a comment

Calculating size of union without using sizeof operator

 

#include"header.h"
typedef union floating
{
int i;
char c;
long double x;
}floatingpoint;
int main()
{	
	floatingpoint f;
	int  ptr2;
	int ptr,ptr1;	
ptr=(int)&f;
ptr1=(int)(&f+1);
ptr2 =(ptr1-ptr);
printf("size of ptr %d",ptr);
printf("size of ptr1 %d",ptr1);
printf("size of union %d",ptr2);
}










































 

Posted in Data Structures with C | Leave a comment

Group chat using FIFO

We know that FIFO is a named pipe and is visible in the file system. So any process can use it for reading and writing to communicate with another processes. This is the advantage of the FIFO over PIPE where the the second process is to be created using the first process that means the processes should have ancestors relation. But in FIFO no such relation is required.

A simple group chat program between three users is given in the link below.

Click on the link, download the files and run the wr1, wr2 & wr3 as ./wr1, ./wr2 & ./wr3 respectively in  different terminals and type something on any terminal and hit enter and then check the other two terminals.

click here for code

Posted in Project 03: Client Server Communication using Linux and IPC | Tagged | Leave a comment

CHAT SERVER USING FIFO (IPC)

For one member

#include”header.h”

#define MYFILE1 “./myfile1″
#define MYFILE2 “./myfile2″

int main()
{
printf(“\n %s : bigen”,__FILE__);

struct pollfd mypol = {STDIN_FILENO,POLLIN|POLLPRI};

int ret,fd1,fd2,noc;
char msgr1[50],msgw[50],msgr2[50];

if(access(MYFILE1,F_OK) != 0)
{

ret= mkfifo(MYFILE1,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s-> fifo created sucessfully”,__FILE__);
}
else
printf(“\n %s-> fifo already created “,__FILE__);

if(access(MYFILE2,F_OK) != 0)
{

ret= mkfifo(MYFILE2,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s :1-> fifo created sucessfully”,__FILE__, ret);
}
else
printf(“\n %s2-> fifo already created “,__FILE__);

fd1= open(MYFILE1,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

fd2= open(MYFILE2,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

printf(“\n %s welcome to chat …………..\n  “,__FILE__);

while(1)
{
memset(msgr2,”,50);
memset(msgr1,”,50);
memset(msgw,”,50);
if(poll(&mypol,1,500))
{
scanf(” %[^\n]“,msgw);
write(fd1,msgw,50);
write(fd2,msgw,50);
}
else
{
noc=read(fd1,msgr1,50);
noc=read(fd2,msgr2,50);
}
if(strlen(msgr1))
printf(“\n\t\t MEMBER 2 : %s \n  “,msgr1);

if(strlen(msgr2))
printf(“\n\t\t MEMBER 3 : %s \n  “,msgr2);

if(strcmp(msgw,”end”)==0 || strcmp(msgr1,”end”)==0||strcmp(msgr2,”end”)==0)
break;
}

printf(“\n  %s : end”,__FILE__);

return 0;

}
……………………………………………………………………………….end…………………………………………………………………………….

For 2nd  member

#include”header.h”

#define MYFILE1 “./myfile1″
#define MYFILE3 “./myfile3″

int main()
{
printf(“\n %s : bigen”,__FILE__);

struct pollfd mypol = {STDIN_FILENO,POLLIN|POLLPRI};

int ret,fd1,fd2,noc;
char msgr1[50],msgw[50],msgr2[50];

if(access(MYFILE1,F_OK) != 0)
{

ret= mkfifo(MYFILE1,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s-> fifo created sucessfully”,__FILE__);
}
else
printf(“\n %s-> fifo already created “,__FILE__);

if(access(MYFILE3,F_OK) != 0)
{

ret= mkfifo(MYFILE3,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s :1-> fifo created sucessfully”,__FILE__, ret);
}
else
printf(“\n %s2-> fifo already created “,__FILE__);

fd1= open(MYFILE1,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

fd2= open(MYFILE3,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

printf(“\n %s welcome to chat …………..\n  “,__FILE__);

while(1)
{
memset(msgr2,”,50);
memset(msgr1,”,50);
memset(msgw,”,50);
if(poll(&mypol,1,500))
{
scanf(” %[^\n]“,msgw);
write(fd1,msgw,50);
write(fd2,msgw,50);
}
else
{
noc=read(fd1,msgr1,50);
noc=read(fd2,msgr2,50);
}
if(strlen(msgr1))
printf(“\n\t\t MEMBER 1 : %s \n  “,msgr1);

if(strlen(msgr2))
printf(“\n\t\t MEMBER 3 : %s \n  “,msgr2);

if(strcmp(msgw,”end”)==0 || strcmp(msgr1,”end”)==0||strcmp(msgr2,”end”)==0)
break;
}

printf(“\n  %s : end”,__FILE__);

return 0;

}
……………………………………………………………………….End………………………………………………………………………….

for 3rd  member

#include”header.h”

#define MYFILE2 “./myfile2″
#define MYFILE3 “./myfile3″

int main()
{
printf(“\n %s : bigen”,__FILE__);

struct pollfd mypol = {STDIN_FILENO,POLLIN|POLLPRI};

int ret,fd1,fd2,noc;
char msgr1[50],msgw[50],msgr2[50];

if(access(MYFILE2,F_OK) != 0)
{

ret= mkfifo(MYFILE2,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s-> fifo created sucessfully”,__FILE__);
}
else
printf(“\n %s-> fifo already created “,__FILE__);

if(access(MYFILE3,F_OK) != 0)
{

ret= mkfifo(MYFILE3,666);
if(ret== -1)
{
printf(“mkfifo”);
exit(EXIT_FAILURE);
}

printf(“\n %s :1-> fifo created sucessfully”,__FILE__, ret);
}
else
printf(“\n %s2-> fifo already created “,__FILE__);

fd1= open(MYFILE2,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

fd2= open(MYFILE3,O_RDWR|O_NONBLOCK);
if(fd1 == -1)
{
printf(“open”);
exit(EXIT_FAILURE);
}
else
printf(“\n %s fifo opened sucessfully :%d  “,__FILE__,fd1);

printf(“\n %s welcome to chat …………..\n  “,__FILE__);

while(1)
{
memset(msgr2,”,50);
memset(msgr1,”,50);
memset(msgw,”,50);
if(poll(&mypol,1,500))
{
scanf(” %[^\n]“,msgw);
write(fd1,msgw,50);
write(fd2,msgw,50);
}
else
{
noc=read(fd1,msgr1,50);
noc=read(fd2,msgr2,50);
}
if(strlen(msgr1))
printf(“\n\t\t MEMBER 1 : %s \n  “,msgr1);

if(strlen(msgr2))
printf(“\n\t\t MEMBER 2 : %s \n  “,msgr2);

if(strcmp(msgw,”end”)==0 || strcmp(msgr1,”end”)==0||strcmp(msgr2,”end”)==0)
break;
}

printf(“\n  %s : end”,__FILE__);

return 0;

}
~
~
~
~
~
~
~
~
~
~
~
~

Posted in Uncategorized | Leave a comment

inter process communication

RCS file: client1.c,v
Working file: client1.c
head: 1.1
branch:
locks: strict
rahul: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;     selected revisions: 1
description:
—————————-
revision 1.1    locked by: rahul;
date: 2017/04/16 10:46:42;  author: rahul;  state: Exp;
Initial revision
=============================================================================

RCS file: multi.c,v
Working file: multi.c
head: 1.1
branch:
locks: strict
rahul: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;     selected revisions: 1
description:
—————————-
revision 1.1    locked by: rahul;
date: 2017/04/16 10:46:42;  author: rahul;  state: Exp;
Initial revision
=============================================================================

RCS file: server.c,v
Working file: server.c
head: 1.1
branch:
locks: strict
rahul: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;     selected revisions: 1
description:
—————————-
revision 1.1    locked by: rahul;
date: 2017/04/16 10:46:42;  author: rahul;  state: Exp;
Initial revision
=============================================================================

RCS file: sub.c,v
Working file: sub.c
head: 1.1
branch:
locks: strict
rahul: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;     selected revisions: 1
description:
—————————-
revision 1.1    locked by: rahul;
date: 2017/04/16 10:46:42;  author: rahul;  state: Exp;
Initial revision
=============================================================================

RCS file: sum.c,v
Working file: sum.c
head: 1.1
branch:
locks: strict
rahul: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;     selected revisions: 1
description:
—————————-
revision 1.1    locked by: rahul;
date: 2017/04/16 10:46:42;  author: rahul;  state: Exp;
Initial revision
=============================================================================
~

Posted in Project 6: Client Server using Inter Process Communication Mechanism | Leave a comment