Skip to content

How to file the PMP PDUs easily

If you're new here, you may want to subscribe to my RSS feed. Thanks for visiting!

Here’s a pretty quick way of registering your PDUs online. If this sentence does not make sense then read on else skips to steps below.
If you have taken a PMP(Project Management Professional) certification or are planning to take one, then its important to know how to earn PDUs(Professional Development Units). In simple terms its a way the PMI ensures that you keep learning. So over the period of 4 years that your certification is valid, you need to earn 60PDUs or else your certification is not renewed. PDUs are earned by attending conferences/classes on relevant topics & writing papers/articles. For more details, https://ccrs.pmi.org/

Step1: Logon to www.pmi.org. Login with your username and password
Step2: On the Home Page, click View PDU and then click Report PDU.

Step3: Select a PDU category

where to file PDUs

Step4:Fill the dates, name and check the relevant categories.
Step5:Fill the provider details like if QAI hosted the event.
Step6:Mention the number of PDUs you want to claim. There are categories and limits in each category
Step7:Finally check the I agree this claim is accurate and Submit.

You will receive an email saying the PDU have been submitted and another one saying approved. I got the two emails pretty quickly. So kudos to PMI for a neat system for submitting the PDUs.

Posted in Programming Practice, Technology. Tagged with , , .

By amreekandesi
November 30, 2010

No comments

Thanks Watts Humphrey

The first book I picked on quality was “Managing the Software Process”. The reason I picked it up at my company’s library was that it had the maximum number of copies in the quality section. I did not know then that this book was by Watts Humphrey who was the founder of the software process program at the SEI. Recipient of the National Medal of Technology who people remember because of the simple way explaining the concepts.

Humphrey’s work at Software Engineering Institute (SEI) at Carnegie Mellon University later led to development of the Capability Maturity Model(SEI-CMM)

Watts Humphrey died few days back at his home in Sarasota, Florida. He was fighting cancer.

Posted in Programming Practice, Software, Technology.

By amreekandesi
November 26, 2010

No comments

How to create a quick Mobile Phone Application for Nokia

This is for you even if you are not a techie or programmer.
Step1: Sign up at http://appwizard.ovi.com/web_nokia/signIn.jsp

Step 2: Use the wizard (click Get Started” button) and a simple form appears.

Step 3:Enter the RSS feeds URL and the wizard will create a default layout

Step 4: Upload a picture as your icon

Step 5:Upload a picture as your logo, this will be displayed in the second row in your app’s view. Size limitations do irk but make sense.

Step 6: Enter some meta data(information abt yourself and what site has). Check checkboxes that ask that this content is your IP(property).

Step 7: Preview in emulator(simulated mobile screen) and you are done.

Step 8: Submit for approval….usually takes complete 24hours.

Watch out for the next post on how to create an app for Android in Java

Posted in Software, Technology. Tagged with , .

By amreekandesi
November 18, 2010

No comments

Techbhai at your service

We have been thinking recently that we should utilize our wide and highly-valued experiences in the process & technology domain for some good. The high percentage of projects that fail in the software industry have been the biggest motivation for all the process work and effort put in by companies world over. So you can take those expensive trainings or hire experts with tons of years of experiences(like us) and they will work with you to get things in shape…OR….write to us with your problem and we will guide you for free on how you can use Agile methodologies, SCRUM model or SEI CMM framework.

mailto: techbhaigiri@gmail.com

Posted in Technology. Tagged with , , , , .

By techbhai
November 18, 2010

No comments

Java: Singleton Implementation

Q: How would you implement double checked locking paradigm to instantiate a Singleton?
A:

public class MyFactory {
  private static volatile MyFactory instance;
  public static MyFactory getInstance (Connection conn) throws IOException {
    if (instance == null) {
      synchronized (MyFactory.class) {
        if (instance == null)
          instance = new MyFactory (conn);
      }
    }
    return instance;
  }
}

The double checked locking paradigm ensures that only the first call to the getInstance() method will go into the synchronized block. During that call, since the instance object is null, the code will go into the synchronized block and create the object. The second check makes sure that if two clients invoke the method at the same time, they will not end up creating two objects.

Any subsequent calls will simply return the instance object created earlier, without going into the synchronized block.

If the instance variable is not declared volatile, this would not work because the variable’s value might be cached by a thread, in which case a thread might not know if the variable’s value has changed.

Also Read:

Javamex Tutorial

Posted in Interview Questions, Java, Programming Practice. Tagged with , , , , .

By techbhai
May 8, 2009

No comments

Java: NavigableSet Interface

Q: What is the NavigableSet interface?

A: NavigableSet extends the SortedSet interface and adds navigation methods for reporting closest matches for given search targets.

TreeSet implements this interface.

1.       headSet() – Returns a view of the portion of this set whose elements are strictly less than toElement.
2.       tailSet() –    Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
3.       lower() – Returns the greatest element in this set strictly less than the given element, or null if there is no such element.
4.       higher() – Returns the least element in this set strictly greater than the given element, or null if there is no such element.
5.       floor() –   Returns the greatest element in this set less than or equal to the given element, or null if there is no such element.
6.       ceiling() – Returns the least element in this set greater than or equal to the given element, or null if there is no such element.
7.       descendingSet() – Returns a reverse order view of the elements contained in this set.

Java API documentation

Posted in Interview Questions, Java. Tagged with , , , , .

By techbhai
May 8, 2009

No comments

Java: Implement Equals ()

Q: How would you write an equals () method?
A:

1.       Compare the parameter object with the this object
2.       Check if the parameter object is of the correct type
3.       Cast the parameter object to the desired type
4.       Compare individual fields

public boolean equals(Object o) {
    if (o == this) return true;
    if (!(o instanceof PhoneNumber)) return false;
    PhoneNumber pn = (PhoneNumber)o;
    return pn.lineNumber == lineNumber &&
           pn.prefix == prefix && pn.areaCode == areaCode;
}

Posted in Interview Questions, Java, Programming Practice. Tagged with , , , .

By techbhai
April 21, 2009

No comments

Programming: Majority Element in List

Q: In a list, a majority element is defined as an element that occurs more than n/2 times. Given an input list, how can you determine the majority element, if present?
A:

We will use a lookup table to store a count of how many times each element occurs. Once we create this table, we can use the lookup table to determine if any element has a corresponding count of more than (n/2 + 1).

	/**
	 * Returns the index of the majority element.
	 * If no majority element is present, then -1 is returned
	 * @param input
	 * @return
	 */
	public static int majorityElement(int[] input){
		Map lookup = new HashMap();
		for(int i = 0; i < input.length; i++){
			Integer temp = lookup.get(input[i]);
			if (temp == null) temp = 1;
			else temp++;
			lookup.put(input[i], temp);
		}

		for(int i = 0; i < input.length; i++){
			int count = lookup.get(input[i]);
			if (count >= input.length/2 + 1) return i;
		}
		return -1;
	}

Posted in Interview Questions, Java, Programming Practice. Tagged with , , , , , .

By techbhai
April 21, 2009

1 comment

WordPress Loves AJAX