#Your company has 25 licenses for a computer program, but you discover that it has been copied onto 80 computers. You informed your supervisor, but he/she is not willing to take any action. What would you do next?
Give up; you did your best to correct the problem
Call the software vendor and report the offense
Quit your job

Posted Date: 10/2/2012 1:05:19 PM | Location : United States

Ask an Expert

Related Discussions:- # Help, Assignment Help, Ask Question on # Help, Get Answer, Expert's Help, # Help Discussions

Write discussion on # Help
Your posts are moderated

Write your message here..

Related Questions

Operational research, phases of operational reaserch phases of operational reaserch

Non - sl languages, Application of the general suffix substitution closure ... Application of the general suffix substitution closure theorem is slightly more complicated than application of the specific k-local versions. In the specific versions, all we had

Find regular grammar : a(a+b)*(ab*+ba*)b, Find the Regular Grammar for the ... Find the Regular Grammar for the following Regular Expression:                    a(a+b)*(ab*+ba*)b.

Non - sl languages, The key thing about the Suffx Substitution Closure prop... The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha

Transition and path functions, When an FSA is deterministic the set of trip... When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

Constract Context free, constract context free g ={ a^n b^m : m,n >=0 and n... constract context free g ={ a^n b^m : m,n >=0 and n

Finite state automata, Since the signi?cance of the states represented by t... Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev

Instantaneous description - recognizable language, De?nition (Instantaneous... De?nition (Instantaneous Description) (for both DFAs and NFAs) An instantaneous description of A = (Q,Σ, δ, q 0 , F) , either a DFA or an NFA, is a pair h q ,w i ∈ Q×Σ*, where

Intelligent computing, unification algorithm unification algorithm

Finite-state automaton, Paths leading to regions B, C and E are paths which... Paths leading to regions B, C and E are paths which have not yet seen aa. Those leading to region B and E end in a, with those leading to E having seen ba and those leading to B no