Question

Topic

Your company is currently planning to automate many different system administration tasks. Your manager has asked you to research a system administration task and implement it using VBScript. In addition, your manager would like to see both a proposal that describes the system administration task and a complete VBScript solution with sample output runs.

In today's technical environment, IT professionals often are dislocated from their managers and peers, however, it is important to retain strong communication channels using technology. Some workers work alone (telecommuters) while some may be on a team (virtual teams). Regardless of the modality, being able to get information to the right people is key.

Task:

• Transferring backup files from a server to another server.
• Not accumulating files to overload the system
• Making sure there is enough storage on the servers and backups
• Make sure to use the correct scripting tool to automate the task
• Deleting files more than 30 days old

Proposal:

            The automated task that can be used is to delete any old files that are not needed that are more than 3 months old in able to manage the storage that is given and have less issues in the future. Another thing is to make sure that all of these scripts are supported with all servers.

VBScript task:

            Using visual basic scripts often help with making sure the system runs smoothly and efficient to save any company time and money.

------------------------------------------------------------------------

Question:

1. Source Code with detailed comments
2. Source Code should contain a minimum 5 topics such as:

1. VBScript Introduction: Variables, Constants, and Data Types
2. VBScript Output Methods, VBScript Input Methods
3. VBScript Decision-Making Statements
4. VBScript Loop Structures and Arrays
5. VBScript Procedures and Functions
6. VBScript File Input/Output Methods

1. Explain the output along with screenshots of the output
2. Conclusion

Answer 1

FIRST-ORDER VALIDITY AND CONSEQUENCE/267 Propositional logic First-order logic General notion Logical truth Logical consequence Logical equivalence Tautology Tautological consequence Tautological equivalence ?? ?? ?? One option would be to use the terms first-order logical truth, first-order logical consequence, and first-order logical equivalence. But these are just too much of a mouthful for repeated use, so we will abbreviate them. Instead of first-order logical consequence, we will use first-order consequence or simply FO consequence, and for first-order logical equivalence, we'll use first-order (or FO) equivalence. We will not, however, use first-order truth for first-order logical truth, since this might suggest that we are talking about not logically true) sentence of first-order logic. For first-order logical truth, it is standard to use the term first-order va- lidity. This may surprise you, since so far we've only used "valid" to apply to arguments, not sentences. This is a slight terminological inconsistency, but it shouldn't cause any problems so long as you're aware of it. In first-order logic, we use valid to apply to both sentences and arguments: to sentences that can't be false, and to arguments whose conclusions can't be false if their first-order consequence true (but first-order validity premises are true. Our completed table, then, looks like this Propositional logic First-order logic General notion Logical truth Logical consequence Logical equivalence Tautology Tautological consequence Tautological equivalence FO validity FO consequence FO equivalence So what do we mean by the notions of first-order validity, first-order con- sequence and first-order equivalence? These concepts are meant to apply to those logical truths, consequences, and equivalences that are such solely in virtue of the truth-functional connectives, the quantifiers, and the identity symbol. Thus, for purposes of determining first-order consequence, we ignore the specific meanings of names, function symbols, and predicates other than identity. There are two reasons for treating identity along with the quantifiers and identity connectives, rather than like any other predicate. The first is that almost all first-order languages use Other predicates, by contrast, vary from one first-order language to another. For example, the blocks language uses the binary predicate LeftOf, while the language of set theory uses E, and the language of arithmetic uses<. This makes it a reasonable division of labor to try first to understand the logic implicit in the connectives, quantifiers, and identity, without regard to the meanings of the other predicates, names, and SECTION 10.2