For anyone who wants a challenge....

I have an old imac that will not boot into any other form than the login screen.  The computer person who set up the computer did not make me the admin, and I have no idea what the admin password is, so I cannot change what the startup disk is, nor disable the login screen from the system preferences.  I also cannot boot from target disk mode, an installation CD/DVD or any other magical keyboard combinations.  I tried resetting the PRAM, no bongs were heard, other than the original startup.  All I want to do at this point is erase the hard drive and reinstall the system software, but as mentioned earlier, I cannot start up from the DVD.  I do have the Al keyboard connected, but I highly doubt that changing that will fix things, but I will use another one tomorrow to see if that fixes anything.  Does anyone else have any other suggestions? 
It is designed to connect to our network, so I can login there, and get to my user interface, but again, I am not the admin - but I should also mention that I do own the computer... it is not stolen, hacked or whatever, I would just like it back to it's original state so it could function as a computer again.  I am pretty sure my applecare has expired on this one too, which is unfortunate. 
Any other ideas would be greatly appreciated! 

So what does one do when you cannot login the single user mode?
You need to buy a license of Snow Leopard ($29.00) which is still available from Apple or Amazon and upgrade. Make sure your computer meets the minimum specifications for Snow Leopard which are:
System Requirements
Mac computer with an Intel processor
1GB of memory
5GB of available disk space
DVD drive for installation
Some features require a compatible Internet service provider; fees may apply.
Some features require Apple's MobileMeservice; fees and terms apply.
Once you have that you can use this video for instructions on how to do an Erase and Install. The kid is kind of annoying but he knows what he's doing. Clean Install Of Snow Leopard video

Similar Messages

  • A challenge for anyone who wants one : )

    Hi, I am trying to write a method that basically takes in a vector containing short objects which have variable legnth codes in them. I want to manipulate these shorts and create a new Vector of shorts that contain fixed length code versions of these;
    Right now you can think of the shorts as overlapping on its neighbour in the vector, some of the bits are spilling over into the next short.
    Heres an example to make it clearer
    every short should have two parts, a 3 bit 'id' that tells the algorithm how many bits folling these 3 bits are to be associated with the id. The id can be used to get this number of bits from an array:
    indexlengths[] = {7, 6, 8, 5, 4, 7, 9, 8}
    so, when the algorithm encounters id #2 (the in the 3 leftmost bits) it looks in this array in position 2 and then knows that following the id is 6 bits to be extracted. once this has been extracted a new short should created and, these 6 bits should be added but shifted over to the very right of the short(shifted 13-6 in this case) and this id should added but to the very leftmost 3 bits.
    so:
    010 1111110100000
    (id:2) (6 bits)
    should go to:
    010 0000000111111
    now this wouldn't be too much of a problem BUT the remaining bits that were discarded (in this case 0100000) must be kept and plugged to the next short in the vector
    so if the next short in the vector is
    1010000011111110
    it will have this remainder from the previous short plugged into the right of it
    010 0000101000001 and 'pushed' off is:1111110
    now this process must continue making sure that this remainder that was 'pushed' off in plugged in to the next short BUT FIRST the process that we started with must be applied, a new short is created(for which the resulting fixed legnth code will be stored in), the ID is extracted from the leftmost 3 bits (id: 0) of the current short and the number of bits to follow is found from the above array indexLengths[0] which is 7 bits. these 7 bits are shifted by (16-3)-7 = 6 positions to the right so they are stored in to the rightmost part of this new short and the id will stay at the leftmost 3 bits:
    010 0000000000101 'pushed off: 000001'
    so now we have both 1111110 and 000001 'pushed' off of the same short, as the length of bits of this remainder gets longer and reaches 16, a new short should be created and added to the result vector.
    One more example just to show it visually:
    this time the indexes after the 'id' part are all 6
    int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6};
    a vector of 3 shorts:
    111 1000011111111, 011 0111111100000, 101 1000000000000,
    results in:
    111 0000000100001, 111 1111011 011111, 110 00001011000000, 000000
    looking at the first resulting short:
    (id) (6 bits that followed the index shifted to the right most 6 bits)
    111 0000000100001
    the remiander that had to be 'pushed off' is inserted in to the start of the next short and the process starts again.
    I know this is alot to ask, but any tips would be great, java isn't being any help when working with bits and shorts, for example when extracting the id (using a mask and then shifting to the right 13 places) I get negative numbers sometimes!
    Any suggestions on how to break this down into a managable problem to solve would be great too : )
    Thanks!
    Message was edited by:
    digiology

    this might help, heres a method doing the opposite, turning fixed legnth codes into variable length codes, the whole idea of this method is to splim down the array of shorts before sending it in a message. This works fine, however the problem above of doing it the other way around has caused me alot of grief after 3 attempts!
    public Vector convertVectorToSlimmerVector(Vector v)
              System.out.println("initial:");
              for(int i=0;i<v.size();i++)
                   System.out.print(toBinaryString(((Short)v.get(i)).shortValue())+",  ");
              System.out.println();
              Vector result = new Vector();
              //assume vector starts at message part for now
              //seems to be fine for legnths
              int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6}; //this will be passes as a parameter or stored in the incomming vector later!
              // above values cant be greater than 13!
              short mask1 = 0x1;
              short mask2 = 0x3;
              short mask3 = 0x7;    //000 0000000000111;
              short mask4 = 0xF;       //000 0000000001111;
              short mask5 = 0x1F;       //000 0000000011111;
              short mask6 = 0x3F;       //000 0000000111111;
              short mask7 = 0x7F;       //000 0000001111111;
              short mask8 = 0xFF;       //000 0000011111111;
              short mask9 = 0x1FF;  //000 0000111111111;
              short mask10 = 0x3FF; //000 0001111111111;
              short mask11 = 0x7FF; //000 0011111111111;
              short mask12 = 0xFFF; //000 0111111111111;
              short mask13 = 0x1FFF;//000 1111111111111;
              short mask14 = 0x3FFF;//001 1111111111111;
              short mask15 = 0x7FFF;//011 1111111111111;
              //short mask16 = 0xFFFF;//111 1111111111111;
              long longMask1 = 0x8000;//100 0000000000000;
              long longMask2 = 0xC000;//110 0000000000000;
              long longMask3 = 0xE000;//111 0000000000000;
              long longMask4 = 0xF000;
              long longMask5 = 0xF800;
              long longMask6 = 0xFC00;
              long longMask7 = 0xFE00;
              long longMask8 = 0xFF00;
              long longMask9 = 0xFF80;
              long longMask10 = 0xFFC0;
              long longMask11 = 0xFFE0;
              long longMask12 = 0xFFF0;
              long longMask13 = 0xFFF8;
              long longMask14 = 0xFFFC;
              long longMask15 = 0xFFFE;
              //others omitted for now
              Vector redundantShortPositions = new Vector();
              //short lengthMask=0xE000;
              long lengthMask = (long)0xF000; //111 0000000000000;
              short[] masks = {mask1, mask2, mask3, mask4, mask5, mask6, mask7, mask8, mask9, mask10, mask11, mask12, mask13, mask14, mask15}; 
              long[] longMasks = {longMask1, longMask2, longMask3, longMask4, longMask5, longMask6, longMask7, longMask8, longMask9, longMask10, longMask11, longMask12, longMask13, longMask14, longMask15};
              short currentShort;
              Short currentShortObject;
              long currentWordLength;
              int indexLength;
              int currentBitLength;
              int numberOfCarriedBits = 0;
              int numberOfBitsToSpillOver = 0; //number of bits that cant be stored in this iteration and will spill over into the next
              int numberOfBitsLeftOver = 0; //number of redundant bits at the end of the current byte(/short?)
              short valueCarriedOver = 0;
              long currentLong;
              String currentProgress;
              Short lastShort = null;
              short l;
              System.out.println();
              for(int index=0; index<v.size(); index++)
                   System.out.println("index:"+index);
                   currentShort = ((Short)v.get(index)).shortValue();
                   currentProgress = toBinaryString(currentShort);
                   System.out.println("progress: "+currentProgress);
                   currentShortObject = (Short)(v.get(index));
                   currentLong = currentShortObject.longValue();
                   currentWordLength = (long)(currentLong & lengthMask);
                   currentWordLength = (currentWordLength>>13);
                   //currentShort = (short)currentLong;
              //     short l2 = (short)currentWordLength;
                   indexLength = indexLengths[(int)currentWordLength]; //make sure that the index length for word legnth 0 is stored above somewhere
                   //System.out.print("isolated legnth: "+toBinaryString((short)currentWordLength)+", ");
                   //l = (short)(currentShort & lengthMask);
                   //currentWordLength = (short)(currentShort & lengthMask);
                   //l = (short)currentWordLength;
                   //currentWordLength >> 13;
              //System.out.println(toBinaryString((short)l));//currentWordLength));
                   //that 1 is added to it
                   if(currentWordLength != 0)
                        currentShort = (short)(currentShort & masks[indexLength-1]); //extract index
                        currentShort = (short)(currentShort << ((16-3)-indexLength));//shift index over (just 3 bits from the left most bit, next to where the length will go)
                                                                                              //number of bits from this short placed in previous short
                        currentBitLength = (3 + indexLength + numberOfCarriedBits)-numberOfBitsLeftOver;
                        currentWordLength = currentWordLength<<13;
                        currentShort = (short)(currentWordLength + currentShort);
                        currentProgress = toBinaryString(currentShort);
                        System.out.println("progress: "+currentProgress);
                        if(index!=0)
                             //number of free bits from last short is > 0
                             if(numberOfBitsLeftOver > 0)
                                  System.out.println("last short: "+toBinaryString(lastShort));
                                  System.out.println("current short: "+toBinaryString(currentShort));
                                  //isolate left most bits from current short that can be stored in previous short
                                  short tmp = (short)(currentShort & longMasks[numberOfBitsLeftOver-1]);
                                  System.out.println("tmp after mask: "+toBinaryString(tmp));
                                  //shift over to rightmost position
                                  tmp = (short)(tmp >> (16-numberOfBitsLeftOver));
                                  tmp = (short)(tmp & masks[numberOfBitsLeftOver-1]);
                                  System.out.println("tmp: "+toBinaryString(tmp));
                                  lastShort = new Short((short)(lastShort.shortValue() + tmp));
                                  System.out.println("lastshort fter spillage: "+toBinaryString(lastShort));
    //                              v.setElementAt(lastShort,(index-1));
    //                              v.remove(index-1);
    //                              v.add(index-1,lastShort);
                                  result.setElementAt(lastShort,(index-1)); //could be buggy (check with dict legnths of 2!)
                                  currentShort = (short)(currentShort << numberOfBitsLeftOver);
                        currentProgress = toBinaryString(currentShort);
                        System.out.println("progress after spilling to previous: "+currentProgress);
    //                    if(currentBitLength <= 8)
    //                         numberOfBitsLeftOver = 8 - currentBitLength;
    //                    else
                        {// if currentBitLength > 8
                             numberOfBitsLeftOver = 16 - currentBitLength;
                             if(numberOfBitsLeftOver < 0)
                                  numberOfBitsToSpillOver = Math.abs(numberOfBitsLeftOver);
                                  numberOfBitsLeftOver = 0;
                             else
                                  numberOfBitsToSpillOver = 0;
                             short pluggedInValue = (short)(valueCarriedOver << (16-numberOfCarriedBits)); //shift value to appropriate left most position
                             if(numberOfCarriedBits > 0)
    //                              isolate part of currentShort that will be 'pushed off' to the right
                                  short temp = (short)(currentShort & masks[numberOfCarriedBits-1]);
                                  valueCarriedOver = temp;
                             else
                                  valueCarriedOver = 0;
                             currentShort = (short)(currentShort >> numberOfCarriedBits);
                             currentShort = (short)(pluggedInValue + currentShort);
                             lastShort = new Short(currentShort);
                             numberOfCarriedBits = numberOfBitsToSpillOver;
                             currentProgress = toBinaryString(currentShort);
                             System.out.println("number of carried bits: "+numberOfCarriedBits);
                             System.out.println("num bits left over: "+numberOfBitsLeftOver);
                             System.out.println("progress: "+currentProgress);
                             //System.out.print(toBinaryString(currentShort)+", ");
                   else
                   {// currentWordLength = 0
                        System.out.println("word length is zero");                    
                   if(numberOfBitsLeftOver >= 16)     //hopefully should be ok, remove condition if not and remove redundant shorts afterwards
                        //reset this value and dont add current shot
                        numberOfBitsLeftOver = numberOfBitsLeftOver - 16;
    //                    System.out.println("BOOLEAN");
    //                    System.out.println(toBinaryString((Short)result.get(index-1)));
                        //result.add(new Boolean(false)); //just to act as a flag
                        System.out.println("position of redundantness? "+index);
                        //store position of redundant short
                        redundantShortPositions.add(new Integer(index));
    //               else
    //                    result.add(new Short(currentShort));
                   result.add(new Short(currentShort));
              //remove redundant shorts
              int offset = 0;
              for(int j=0;j<redundantShortPositions.size();j++)
                   int p = ((Integer)(redundantShortPositions.get(j))).intValue();
                   result.remove(p-offset);
                   offset++;
              System.out.println("result:");
              for(int i=0;i<result.size();i++)
                   System.out.print(toBinaryString(((Short)result.get(i)).shortValue())+",  ");
              return result;
         }here my crappy attempt at solving the first mentioned problem (converting from variable length to fixed legnth):
    public Vector convertToFatterVector(Vector v)
              System.out.println("initial:");
              for(int i=0;i<v.size();i++)
                   System.out.print(toBinaryString(((Short)v.get(i)).shortValue())+",  ");
              short mask1 = 0x1;
              short mask2 = 0x3;
              short mask3 = 0x7;    //000 0000000000111;
              short mask4 = 0xF;       //000 0000000001111;
              short mask5 = 0x1F;       //000 0000000011111;
              short mask6 = 0x3F;       //000 0000000111111;
              short mask7 = 0x7F;       //000 0000001111111;
              short mask8 = 0xFF;       //000 0000011111111;
              short mask9 = 0x1FF;  //000 0000111111111;
              short mask10 = 0x3FF; //000 0001111111111;
              short mask11 = 0x7FF; //000 0011111111111;
              short mask12 = 0xFFF; //000 0111111111111;
              short mask13 = 0x1FFF;//000 1111111111111;
              short mask14 = 0x3FFF;//001 1111111111111;
              short mask15 = 0x7FFF;//011 1111111111111;
              //short mask16 = 0xFFFF;//111 1111111111111;
              long longMask1 = 0x8000;//100 0000000000000;
              long longMask2 = 0xC000;//110 0000000000000;
              long longMask3 = 0xE000;//111 0000000000000;
              long longMask4 = 0xF000;//111 1000000000000;
              long longMask5 = 0xF800;
              long longMask6 = 0xFC00;
              long longMask7 = 0xFE00;
              long longMask8 = 0xFF00;
              long longMask9 = 0xFF80;
              long longMask10 = 0xFFC0;
              long longMask11 = 0xFFE0;
              long longMask12 = 0xFFF0;
              long longMask13 = 0xFFF8;
              long longMask14 = 0xFFFC;
              long longMask15 = 0xFFFE;
              short[] masks = {mask1, mask2, mask3, mask4, mask5, mask6, mask7, mask8, mask9, mask10, mask11, mask12, mask13, mask14, mask15}; 
              long[] longMasks = {longMask1, longMask2, longMask3, longMask4, longMask5, longMask6, longMask7, longMask8, longMask9, longMask10, longMask11, longMask12, longMask13, longMask14, longMask15};
              Vector result = new Vector();
              int[] indexLengths = {6, 6, 6, 6, 6, 6, 6, 6};
              long lengthMask = (long)0xF000;
              //long tmp = 0xE000;
              //short lengthMask = (short)tmp;      //111 0000000000000;
              short indexMask = 0x1FFF;           //000 1111111111111;
              System.out.println();
              System.out.println("length mask: "+toBinaryString((short)lengthMask));
              System.out.println();
              short currentShort;
              long currentLong;
              String currentProgress;
              Short currentShortObject;
              long currentWordLength;
              int indexLength;
              //int numberOfBitsSpillingOver=0;
              short spillValue = 0;
              Short lastShort;
              int currentBitLength;
              int numBitsCarriedOver=0;
              short firstShort;
              short secondShort;
              long firstLong;
              long secondLong;
              short valueThatWasSpilledOver=0;
              short valueThatWillSpillOver=0;
              for(int index=0;index<v.size();index++)
                   currentShort = ((Short)v.get(index)).shortValue();
                   currentLong = ((Short)v.get(index)).longValue();
                   if(index == 0)
                        currentWordLength = (short)(currentShort >> 13);
    //                    currentWordLength = (long)(currentShort & lengthMask);
    //                    System.out.println("currentShort: ");
    //                    currentWordLength = (long)(currentWordLength>>13);
                        System.out.println("current word legnth: " + toBinaryString((short)currentWordLength));
                        indexLength = indexLengths[toAbsoluteIntValue((short)currentWordLength)];//(int)currentWordLength];
                        //numBitsCarriedOver = (int)(13-indexLength);//////
                   //valueThatWillSpillOver = (short)(masks[numBitsCarriedOver-1]&currentShort);
                   currentWordLength = (valueThatWasSpilledOver<<(16-numBitsCarriedOver)&lengthMask);
                   currentWordLength = (short)(currentWordLength>>13);
                                                           //dont forget might need to be set somewhere!
                   currentShort = (short)((currentShort>>numBitsCarriedOver)+(valueThatWasSpilledOver<<(16-numBitsCarriedOver)));
                   System.out.println("progress after spilling from previous:"+toBinaryString(currentShort));
                   //currentShort should now have the length and index contained in it but the index is shifted to the left
                   indexLength = indexLengths[(int)currentWordLength];
                   numBitsCarriedOver = (int)(13-indexLength);
                   valueThatWillSpillOver = masks[13-indexLength];
                   valueThatWasSpilledOver = valueThatWillSpillOver; //?
                   //get index(shifted to the right) on its own
                   short temp = (short)((currentShort & indexMask)>>(13-indexLength));
                   System.out.println("index on its own shifted to the right: "+toBinaryString(temp));
                   //get length on its own
                   short temp2 = (short)(currentShort & lengthMask);
                   System.out.println("length on its own: "+toBinaryString(temp2));
                   currentShort = (short)(temp + temp2);
                   System.out.println("progress after shifting index to the right: "+toBinaryString(currentShort));
                   result.add(new Short(currentShort));
              System.out.println("result");
              for(int i=0;i<result.size();i++)
                   System.out.print(toBinaryString(((Short)result.get(i)).shortValue())+",  ");
              }     

  • For anyone who wants to customize their IT Superhero...

    You are persistent!!

    i took the IT Superhero quiz, and it made me a girl! so i tried retaking it until i got what i wanted, and finally, i just decided to reverse engineer their logic answers! it ended up being (somewhat) simple, and yet tricky to decipher, and so i decided to share my findings here at the Water Cooler to anyone in a similar predicament as me :Di highly recommend taking the quiz FIRST to see what you get (it IS rather fun), but once that is out of the way, feel free to have fun (i know i did). and don't forget to use your avatar if you like it!so basically, you just take the address of the Superhero quiz:
    http://community.spiceworks.com/careers/sysadminday/superhero-quizand add the appropriate keys after it. for example:...
    This topic first appeared in the Spiceworks Community

  • For Anyone who has Blackberry Connect WITH OTA Con...

    I've tried with an E61i, E90, and now E51, all with the latest firmware and latest Blackberry Connect software, and nothing I do on the device allows me to be able to do OTA sync of our corporate Exchange, (Outlook), Contacts. I only have the standard 3 options for sync in my Blackberry Connect client on my phone, Email Settings, Email Filters, and Calendar.
    For anyone who has this working, can you confirm whether or not there is a BES server side setting that must be enabled to allow this OTA Contact sync, and what it is? If this is the case I'm not sure our corporate BES admin will go for it, but I can at least stop pulling my hair out on the client side..
    Thanks,
    Jason

    Hi Rod,
    Thanks for the link. I did went there and had a look.
    First, as the article pointed out, there is a difference between Mac users and PC users. Mac users are Mac FANs, PC user are mostly just PC users. So if I look at the numbers, the number for Macs is less objective to me.
    Second, the data was collected on pre-Intel units, especially iBooks, which has been around how many years? more than 5 I believe, correct me if I am wrong. Any product having that kind of life span should have a nearly perfect quality. Apple just simply had much more time to correct defect than other PC manufaturers, so no mistery here.
    Third, Apple charges a premium price for its products, so it shoule choose the coponent vendors carefully and it owns its customers/fans a solid system. On the other hand, the other PC vendors are constantly going through fierce competition to lower their price, so it is inevitable to have some component vendors providing crapy parts, such as some LCD screens and keyboards from Dell.
    Finally, lets look at MB and MBP, if they are as good as old Macs, then we should see similar amount of people complaining about MB and MBP as iBook and similar, but is it the case?
    I very much want to be a member of the Mac world, especially now it uses one chip I worked on, but my shopping and reading experience told me otherwise - the MacBook is not ready, we need time to see if it lives up to the Apple name and it would be interesting what the next report from PC Magzine will look like...
    Being a PC user almost all my life till now, want to join the Mac club, but Apple is making it supper hard for me. Is it really too much to ask for a working new MacBook upon arrival?!

  • This is for people who wants to mirror all they apple devices when they travel.

    this is for people who wants to mirror all they apple devices when they travel and don't want to unplug everything from the apple tv and take it with them, you can get the amazon fire tv stick and download an app called airplay upnp or the reflector app and mirror all of your apple devices to it, it is great for traveling easy to setup and move around, for example if your traveling and want to use it in the conference room and then want to take with you back to the hotel for the night and plug it in and keep on doing that routine.
    it will be great to use hopeful until apple comes out apple with their own apple tv stick 

    The Verizon DVR is admittedly not the sharpest box on the market. I admit to giving up on the multi-room DVR product, it just never worked satisfactorily for me.
    Hopefully features/functions issues  will improve in the near term with the Cisco/Scientific Atlanta box that obviously isn't going to make Q1. I admit I have ceased  holding my breath. Something does have to happen fairly soon because 160gb drives are literally going out of production.
    You do however make two statements that incorrect. Current TiVO's only need 1 cable card, since the standard cable card today in Verizon's stock  is the M-Card. You also have the option with TiVO of paying either an annual fee, or a one time fee, both of which are lower in the long term than the month to month fee. Alternatively you can by the Moxi DVR, and it includes lifetime service in the purchase price.
    While in theory a truck roll costs $79, in practice if it is for a Cable Card install, it is free (I think  FCC regulations preclude the charge).
    Apparently there is nothing in Verizon's order processing system that tells reps that there is no charge for Cable Card installations, so they often quote the $79 fee because that is the standard charge for technician to come out. As far as I can tell (and there have been lots of posts about cable card installs), no one has in fact been charged the $79 fee..

  • HT6114 Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.

    Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.

    Sp188585 wrote:
    Joined problem labels Labels to color everyone in the line archives mp3 and selection in dots as it exists now can be anyone who wants to do what HELPS of how thoroughly enjoyable.
    Sorry, you will have to outline your issues more clearly.
    Thanks
    Pete

  • HT1386 I have  purchased a book and it went (accidently) to my PC.  How do I get it from PC to iphone 5?  the book now has an "epub" extension.  Thanks for anyone who can answer!  Frustrated !!!

    I have  purchased a book and it went (accidently) to my PC.  How do I get it from PC to iphone 5?  the book now has an "epub" extension.  Thanks for anyone who can answer!  Frustrated !!!

    I'll assume that you are referring to purchasing a book in iTunes. If that is the case, you can transfer the purchase with the phone, or you can sync the phone and iTunes.

  • Question for anyone who has the American Ball game

    I've been spending a lot of time saving up my tickets in American Ball so I can unlock some more items.
    I've finally reached 5,000 tickets and I'm wondering if the table that costs 5,000 tickets is worth it.
    Is there any difference between the different skee-ball tables aside  from the appearance?  For example, does the skee-ball table that costs  5,000 tickets have a higher ticket pay-out than the one that only costs  1,000 tickets?  Or is it basically just a different skin with all the same features?

    Hi Julio,
    I sat exam 98-364: Database Fundamentals just to see what the MTA exams were like and found the question difficulty and content very similar to what was outlined in the study guide available from Certiport. I found
    the exam rather easy however I've had quite a lot of experience with databases and also have a number of other Microsoft database certifications.
    You need to keep in mind that the MTA exams are designed for people who are just starting an IT career path or are looking to enhance their understanding of IT fundamentals i.e. These exams are really for beginners. As stated by Davin, you'd probably be
    better off looking into the MCSD: Web Applications certifications.
    When you see answers and helpful posts, please click Vote As Helpful,
    Propose As Answer, and/or Mark As Answer
    Jeff Wharton
    MSysDev (C.Sturt), MDbDsgnMgt (C.Sturt), MCT, MCPD, MCSD, MCITP, MCDBA
    Blog: Mr. Wharty's Ramblings
    Twitter: @Mr_Wharty
    MC ID:
    Microsoft Transcript

  • Hands up for anyone who loves the present iphone design and just want the phone to get better, but look same.

    i luv da iphone 4 and 4s design and want apple to keep da same design for iphone 5

    Neither conjecture nor polls are allowed here. Sorry. (Normal English is recommended also. Not every country in the world may be able to translate "luv" and "da")

  • Anyone who wants zCover action for their Nano.

    http://cgi.ebay.ca/ws/eBayISAPI.dll?ViewItem&rd=1&item=5812282517&ssPageName=STR K:MEWN:IT
    I just bought one from this vendor in preparation before my Nano arrives.
    Got a shield for the screen, two shells, a lanyard.
    Looks to be high quality stuff.

    I ordered one (black) a few days ago, and am waiting for it to arrive. will link photos when i get it.

  • Still looking for anyone who composes Dubstep?

    I've been working on a project which is dubstep based and was wondering if there was anyone out there who is knowledgeable in this genre?

    I'm afraid you're not really going to get an answer on this forum because your question is a bit too broad based  - it looks like you've got some decent equipment for the kind of stuff you want to do, so..
    It may be because I'm getting to be an old geezer, but I'm not entirely sure what the exact definition of 'Dubstep' is, to be honest - there have been so many variations of music that have been created using sequencer software in some way or another and some people keep imagining that they've created a whole new genre of music, so they give it a name, you know..

  • Can ARD 3 be used for users who want to remote into a windows based server?

    I have a couple users at the company I work at who will need to be able to remote into our Windows Server. These users all have Macs and will have to go about remoting in differently. I have done some research on Apple Remote Desktop but i am unsure if it fits my users needs. If I have someone download and install this software on a mac, will they then be able to remote into a windows based server using an IP address? that is my goal in mind  could get some help on this one I'd appreciate it.
    Thanks,
    - Rich

    I'm referring to what windows can do via Remote Desktop connection.
    You open up the RDC dialog box, enter an external IP address (if working remotely) or a server name if working internally and connect right to the machine. Ideally i want my users to be able to log into our terminal server and be able to use a program remotely. they will have to log on to this server with company credentials. Basically from a mac, connecting up to a Windows Server and remotely logging into it to perform tasks.
    I'm really just trying to find an easy way to do this for my user's with MAC's since it is not as straightforward as in windows. I cannot test anything out at home since i do not own a mac so i come to the community to see if you guys have had the same kind of situation before.
    ARD was the first peice of software that looked like it might fit my needs but if it doesn't is there anything out there? is it for free or for a cost? any help is greatly appreciated. Thanks.
    - Rich

  • Sourcecode for anyone who's interested

    Hi there,
    I started a project on sourceforge. DevEnhancer
    https://sourceforge.net/projects/sapb1-ui-di-fw
    It's a framework or a toolbox for Business One developers.
    About 2500 lines of code.
    I decided to put it on sourceforge, because the project is
    very nice hosted there.
    You'll find there two files. The first one is the C# file with the code
    and the second one is a chm file with the extracted class and method
    definitions. I haven't included so much examples, but I think most of the code
    is self explaining.
    Only thing to do is to include it in your Visual Studio Project and add two
    references to SAPbobsCOM and SAPbouiCOM.
    If anyone is interested in joining the project ask me.
    If you think, it's useful, write me suggestions or bugreports.
    If you want to use it, no problem, it's under GPL, open source
    Any comments are welcome.
    <b>[email protected]</b>
    <b>[email protected]</b>
    Hope, you have fun.
    Regards,
    Holger
    PS: This is a prealpha release, so don't think, it is bugfree

    My 23" display is one of the first to ship last July (2004). It has the uneven colors (when viewing a blue screen) and the pink hue. So far in its life it has had two pixels go stuck blue (I check it when i got it and it had zero stuck pixels) and one firewire port die.
    Lately I've had problems with "burn-in" such that on gray color backgrounds or windows (like the default color it seems to pick when switching wallpaper) show residual images (faded ghost images) of previously displayed things. The top bar where the menu is seems really burned in (I can see it on the blue login screen).
    I've been holding out too for a confirmed fix. I have an extended warranty till 2007 so I'm in no rush.
    I had someone postl this on my thread at macrumors about their display being repaired:
    Here is the message that has just been posted:
    I purchased a reconditioned 23" Aluminum from Apple last month, and after the first one died within 5 days, I received a second one with serious pink hue problems and MAJOR ghosting. After an hour on the phone with apple, they said all they can do was fix it. I wanted out of the 23" because of all the problems I've heard. Anyway, they sent a box, I packed it, and when it returned, it was finally excellent. They replaced Part # 646-0264 APPLE, Q49, LCD, LM230W02(ST)(02)and #630-6942 APPLE, Q49 MLB REV C whatever that is. Hope this helps.

  • For anyone who is experiencing slow DNS lookups...

    I finally worked out what was wrong with my network config last night and thought I'd share it with everyone in a simgle post in the hope it'll help someone else.
    I tried the BIND work around, but it wasn't all that much faster.
    I tried disabling IPv6, but that didn't do much...
    The solution?
    In 'System Preferences' -> 'Network'
    Go to configure the adaptor (Airport / Ethernet / etc)
    In 'DNS Servers' where you'd normally specify the DNS servers given to you by your ISP... don't do this! As crazy as it sounds don't
    Of course, if you're using newer routers you'd not be having this slow DNS lookup problem and specifying the ISPs DNS Servers would be appropriate... still
    What you want to specify here is your ROUTER's IP:
    eg. 192.168.0.1
    With this simple modifcation you'll be fine. Why? You ask?
    In Linux / OSX (I imagine in Unix as well) the way the lookups are carried out are different from Windows. I have other Windows computers on our network and they never had DNS lookup problems and they've been given the ISPs DNS IPs... anyway I think I'm talking out of my depth now heh.
    This works!
    Remember: Specify your router as the DNS Server!

    I've had this problem on a G4 PowerMac running Panther, and it still had it after a Tiger upgrade. I just replaced it with a Core Duo MacMini, 10.4.7, same problem of slow DNS lookups (i.e., slow initial start to loading a web page, then it goes quickly). Windows machines on the same subnet have no such problem. I've tried the various suggestions on various forums, none of which worked. I tried:
    - turn off IPv6 (no help)
    - directly enter my ISPs DNS servers (no help)
    - manually configure both IP and DNS (no help, went back to DHCP)
    - swear at the computer (a little help, mentally)
    After some more reading, I tried resolving some addresses using the host command from the Terminal:
    host -v www.apple.com 24.34.240.9
    where the IP address is one of the DNS servers for my ISP (Comcast). I got a no server found message! I then tried the second DNS server in the Comcast list (found from my router), also no server found. Tried the third one in Comcast's list of DNS servers, and it worked. Entered it in System Preferences -> Network as a DNS server, and now web browsing is zippy! I verified that the two DNS servers that MacOS couldn't see are also down as far as Windows was concerned (using the nslookup command in windows).
    What this tells me is that the OS X algorithm for handling unreachable or slow DNS servers is different from that in Windows. Maybe Windows remembers a bad experience with a DNS server and uses ones that it has success with, while OS X just keeps trying them in order, slowing timing them out until it finds one that works?
    This could also explain many of the puzzling symptoms people have been seeing (things work some times, other times not; some people have luck specifying the DNS server manually, others don't). It all depends on what DNS servers got distributed to the Mac via DHCP, and how far down the list you have to go to find one that is responsive.
    Anyone reading this forum with technical knowledge of both UNIX and Windows DNS lookup implementations? Is there some way to tweak in MacOS to make it perform more like Windows in this situation (like, maybe shortening the DNS server failure timeout)?

  • FOR ANYONE WHOS IPOD WILL NOT APPEAR IN ITUNES NO MATTER WHAT YOU TRY!

    Hey Guys i suffered from this problem for a frustrating three weeks before i tried somthing completely random and it fixed my problem.
    My ipod would appear in mycomputer and itunes would even open when connecting my ipod but would not appear in the menu. TRY THIS!
    1. goto start menu
    2. Click control panel -> Administrative tools -> Computer management.
    3. Click disk management under the storage tab.
    4. Right click your ipod (must be plugged in and possibly in disk mode) and select format.
    5. In the file system tab select "FAT" NOT "FAT32"!!, select 'perform quick format' and click ok.
    After this step my ipod appeared in itunes as a corrupt ipod!
    6. In itunes restore your ipod since it is now on the menu.
    THIS FIXED MY PROBLEM!! i hope this helps anyone with the same problem. :D!!!!
    It is really hard to find a real soloution for problems like this instead of the old "reinstall itunes" I REALLY HOPE THIS WORKS FOR YOU!

    Many site issues can be caused by corrupt cookies or cache. In order to try to fix these problems, the first step is to clear both cookies and the cache.
    Note: ''This will temporarily log you out of all sites you're logged in to.''
    To clear cache and cookies do the following:
    #Go to Firefox > History > Clear recent history or (if no Firefox button is shown) go to Tools > Clear recent history.
    #Under "Time range to clear", select "Everything".
    #Now, click the arrow next to Details to toggle the Details list active.
    #From the details list, check ''Cache'' and ''Cookies'' and uncheck everything else.
    #Now click the ''Clear now'' button.
    Further information can be found in the [[Clear your cache, history and other personal information in Firefox]] article.
    Did this fix your problems? Please report back to us!

Maybe you are looking for

  • LR5 's Adjustment Brush doesn't seem to work-does the New Radial Filter have priority?

    So why in the world would I update Lightroom in the middle of a job.? Before I was able to do in and touch up shadowy areas using (K) adjustment brush, but now it doesn;t seem to work. The radial brush does a good job for a defined area but for SPOT

  • Drag and drop ????

    hi all. i have a quick question about drag and drop. is it possible to drag a text file on the windows desktop into a jtextarea of an application, and display the file.?? thanks for your time. Paul

  • Is there a page curl transition for iBooks Author?

    Does anyone know why there isn't a page curl transition for books created in iBooks Author? There should also be a flipboard transition available as well.

  • Internal Order through Investment measure

    Hi friends I need help in the following issue: I am creating Internal orders through Investment Measures. When ever i create an internal order in the background it creates an AuC. When I settle the IO the amount is posting to AuC. After that I tried

  • I can't install firefox in my laptop, what should i do?

    I had trouble with the previous version, so i try to install again but kept on saying run as a. current user or b. run the program as the following user. I picked current user but nothing happens. what should I do?