Develop activation tool for unattend reseal.xml, C/C++ Programming

Assignment Help:

Project Description:

We refurbish older computer and send them back into the market with windows 7 operating system. We are presently using windows deployment services through PXE boot. We presently are running 80-100 computers a day, and growing every day. We currently are seeking a way to activate windows while in audit mode, and have it persist through OOBE once the system has been resealed using sysprep. Presently the only way I have found to do this is to edit the unattend_reseal.xml with code to insert the product key. The problem with doing it this way that we have found is that typographical errors will cause errors in the xml file and then the system doesn't load, and we have to restart the deployment on that machine. We are interested in a GUI APP that can only ask us for the product key and insert it into this C:\rpktools\unattend_reseal.xml . It has to be placed on a positive line in the exact same place and the txt that is already there needs to stay. Also we would like some kind of check in place that will lower some of the errors while typing the keys. I know that Microsoft uses "SLMGR.exe" to check if it is 5x5 key and the checksum if it maybe could be a key. The end user of this app will most likely be non technical and I would like to make this as simple and efficient as possible. We will be keying 150+ keys a day so I want the app to be able to fit onto a usb drive and be run without installing anything on the PC.

Skills required are C Programming, Software Architecture, Project Management, Software Testing


Related Discussions:- Develop activation tool for unattend reseal.xml

Msp, A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

Minimization and karnaugh maps, There are formal ways of reducing Boolean e...

There are formal ways of reducing Boolean expressions in order to minimize the logic circuit. The two elementary ways of minimization are using Boolean expressions/De Morgan Theore

Decode, Problem Description Smugglers are becoming very smart day by day. N...

Problem Description Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new techn

Basic input -output library of subroutines, GetChar - get a character fro...

GetChar - get a character from the keyboard, echo to the display and return it in reg al. - Note: if a linefeed (LF) is received (Enter key), a carriage return (CR) will als

Pebble merchant, There is a pebble merchant. He sells the pebbles, that are...

There is a pebble merchant. He sells the pebbles, that are used for shining the floor. His main duty is to take the length of the room’s sides. But he sometimes mistakes doing tha

Mobile problem, program that decodes sending smuggler''s string

program that decodes sending smuggler''s string

Integration, w.a.p to find outWrite a program to find the area under the cu...

w.a.p to find outWrite a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b.

Last ant on rod, You are given a collection of words, say as in a dictionar...

You are given a collection of words, say as in a dictionary. You can represent it in the following compressed form: the first word will be followed by a sequence of a pair of numbe

Theory, recursive sub programs

recursive sub programs

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd