Organizations' awareness of Green IT and initiatives towards Environment Sustainability

Is your organization using IT systems, like computers, networks, servers???

If yes, please visit http://www.surveymonkey.com/s/green_it and fill up a small survey!

I am aspired to carry out a research on “Organizations' awareness of Green IT and initiatives towards Environment Sustainability”. 

The research project is aimed to analyze and provide a summary of emerging Green IT concepts and overview of key areas where IT organizations can achieve savings and provide leadership in sustainable business practices. 

Your valuable and accurate response to the survey would help me derive certain trends and conclusions. Please spare your 15 minutes and do complete the survey. 

If you have any confusions or ambiguities, please write to me at niirav@ymail.com. Thank you very much for your efforts!

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

What is Green IT all about?

"Green IT" primarily refers to reducing the energy consumption and carbon footprint of the IT function within the organization. Rising energy demand with a more limited supply, increasing utility costs, management of hazardous waste and electronic equipment disposal (e-waste) fuels the Green IT movement. As an emerging topic in IT management, “Green IT” practices are drawing high interest among IT organizations as well as suppliers, manufacturers and service providers.

With the rapid run-up of energy costs and a broadening awareness of the impact of global climate change, IT organizations are looking for strategies to offset rising costs and to use technology in ways that reduce their environmental impact. With the growing body of evidence demonstrating the potential return on investment (ROI) resulting from adopting Green IT approaches, leading organizations are implementing innovative solutions that reduce their utility bills and “green” their procurement practices. 

Server and storage virtualization and consolidation, “Green PCs”, thin clients are the concepts that lead towards Green IT.

IE Check and IE Version Check in JavaScript

Hi,

If you want to provide certain JavaScript functionality which is specific to IE browser, or specific to a version of IE Browser, you would surely find below code helpful, in terms of detecting browser and its version.

Below is the variable that would hold Boolean value; It is TRUE when the browser is IE, FALSE otherwise.

var BrowserIE = {
  Check: function() {
var isIE = eval("/*@cc_on!@*/!1"); 
return isIE;
}
}

}

Below is the variable, that would hold true IE version, in form of AA.BB.CCCC.DDDDD, as can be seen in  IE Help Menu.

var BrowserVersion = {
          Check: function() {
                var e, obj = document.createElement("div"), x,
                   verIEtrue = null,
                   CLASSID = [
                       "{45EA75A0-A269-11D1-B5BF-0000F8051515}",
                       "{3AF36230-A269-11D1-B5BF-0000F8051515}",
                       "{89820200-ECBD-11CF-8B85-00AA005B4383}"
                           ];

                try{obj.style.behavior = "url(#default#clientcaps)"}
                catch(e){ };

                for (x=0;x
                {
                   try{verIEtrue = obj.getComponentVersion(CLASSID[x], "componentid").replace(/,/g,".")}
                   catch(e){ };
                   if (verIEtrue) break;
                };

                return verIEtrue || void 0;
        }
}

You can copy above scripts in to your JS, AS-IS.

Above variables can be used to make your code conditional based on browser type and browser version.

Please check below example for understanding:

function doSomething() {

        if (BrowserIE.Check()) {
                alert('Browser is IE');
                //IE Browser Specific Functionality
        }
        else{
                alert('Browser is IE');
                //NON-IE Browser Specific Functionality

        }

        
        if (BrowserVersion.Check().substr(0,1) > 8) {
                alert('Browser IE : Version 9 or above');
                //IE Browser Version 9 or above Specific Functionality
        }
        else
        {
                alert('Browser IE : Version 8 or less');
                //IE Browser Version 8 or below Specific Functionality        
        }

}

Prospects of Mobile Wallet in India

Prospects of Mobile Wallet in India

A study on degree of awareness about Mobile Wallet, its potential market in India, barriers and drivers to its success.

The term “mobile phone” is becoming increasingly misleading since the capability for voice calls is, for many users, no longer the primary feature of the device. Today, the mobile phone is not just a communication platform with email, instant messaging, video calls, and a social media interface, but it also offers functional applications like navigation, camera, calendar, address book, and a gaming device to name a few. The smart phone has become the most successful “functionality aggregator” after a Personal Computer. These days the only two things that most people carry in their pockets, besides their mobile phone, are keys and wallet.

Today’s innovation is towards allowing people not to carry their physical wallet either! With Mobile Payment as a concept, innovations are happening for last few years to develop a Mobile Wallet!  A few mobile wallets have already reached our market, few are to come.

We, the students of Symbiosis International University, have done a research (Market Research) on awareness, growth, penetration and acceptance of Mobile Payment concept. 


We had read lot many research articles and white papers from various authors and research agencies. We had also taken survey of Indian consumers specifically targeting College Students, Academicians, IT Professionals, Middle and Senior level managers and housewives. 

Finally, results are out, research article is prepared and here it is for your quick view and feedback!

Please check out below links on the research article prepared based on valuable inputs of very valuable respondents! Here it is.. 


Prospects of Mobile Wallet in India - Presentation.ppsm
Prospects of Mobile Wallet in India - Report.pdf

+Nirav Khandhedia

Neha Patnayak

Rajabala Gnansamy

Neha Chauhan

Akhil Mohammad

Webservice Deployment Error on Eclipse with Tomcat 7

Getting Below error while deploying Web Service on Eclipse with Tomcat 7. 

For more information visit 

http://stackoverflow.com/questions/11184287/web-service-deployment-error-in-eclipse-with-axis2-and-tomcat7-server

Opportunities in Human Resource (Assistant Manager/Sr. Executive) @ Wipro Technologies

• Position : Asst Manager / Sr. Executive – Human resources
• Experience : 2-7 years
• Qualification:  Must be an MBA from a Tier 1 B-School
• Work Location : Chennai

Job Description:

• Driving TED Generalist activities for a defined Cluster within the business line.
• Ensuring excellence in service delivery of HR processes.
• Working with various Delivery Units and Practice groups within the Cluster to iimplement talent management and retention activities.
• Plan and Execute Employee Engagement (MYPP) activities in the Cluster and ensure coverage as per norms across Locations.
• Work with Business Leaders within the Cluster to identify top talent and facilitate proper grooming.
• Work with Business leaders to drive leadership engagement with employees in the Cluster.
• Proactively communicate policies and process to employees.
• Drive HR SLAs (Skip meetings, Confirmatory Appraisals, G&O for new employees, Induction for new employees, One on One’s with employees) within the Cluster and ensure 100% completion.
• Good hands-on knowledge and appreciation of HR processes, policies and sub systems. Exposure to Line HR role would be considered as an added advantage.
• Good communication skills, both oral and written.
• Customer orientation – understanding the true need of the customer and then working out the solutions.
• Ability to interact confidently with Senior Leadership.
• Display sustained energy and determination in the face of obstacles to set and meet challenging targets
• Ability to work in diverse teams
• Interpersonal sensitivity; ability to relate to individuals and develop sustained working relationships is key.

For more information and application, please write to niirav@ymail.com

Infosys-hiring Freshers graduating in the year 2011

Infosys is hiring Freshers for the role of Systems Engineer who have a passion to work and excel in a dynamic environment. Eligibility Criteria: * BE / B.Tech / ME / M.Tech/ MCA / MSc (Computer Science/ Electronics/ Mathematics/ Physics/ Statistics / Information Technology / Information Science) only. * Candidates must have a consistently excellent academic track record. * Only Candidates who are graduating in the year 2011 are eligible to apply. * Candidates should not have participated in the Infosys selection process in the last 9 months. Please note that the resume should mandatorily carry date of birth, e-mail id, complete academic details starting from std. 10 / 12 / Graduation / Post graduation along with Year of passing, simple average aggregate Percentages/CGPA, Board / University. Also, mention the preferred location of test center in the subject line (Bangalore/Chennai/Delhi/ Hyderabad/ Kolkata/Mumbai/Pune/Trivandrum). You can mail the resumes to freshers2011@infosys.com on or before April 15, 2011. Only short listed candidates will be directly informed via e-mail about the selection process.

Capegemini Open Campus Recruitment Programme - 2009/2010 Graduates and Post Graduates

Capgemini will be conducting Open Campus Recuritment Programme for 2009 and 2010 passout students in Mumbai on  29th March 2011 Tuesday to 31st March 2011 Thursday 2011 at 8.30am at :

Pillai's Institute of Information Technology,Engineering,Media Studies and Research Dr.K.M.Vasudevan Pillai's Campus,Sector 16,New Panvel,
Navi Mumbai 410206

Eligibility Criteria

·         Degree:  B.E / B. Tech / MCA / M.Tech

·         Branches : CSE, ECE, EEE, EE, Mechnical, Civil, IT

·         Year of Passing :2010, 2009

·         10th Standard: 60%

·         12th Standard : 60%

·         Graduation :60%

·         Post Graduation: 60%

·         No Back paper after the Final Year Exam

·         Candidates already having employment are eligible to apply.

Salary offered:  Rs. 2.5 Lac CTC per annum

Recuritment Process :

·         Aptitude Test – 29^th March 2011

·         Presentation – 29^th March 2011 ( Selected candidates of Aptitude test)

·         Group Discussion – 30^th March 2011

·         Personal Interview – 30^th and 31^st  March  2011.

Candidates should carry following documents:

·         CV

·         Photograph

·         All original documents. 

C++ and Data Structure Programs

C++ LAB CODINGS 

Name Of The Program	Codings
C++ Program for funtion overloading.	Get Code
C++ Program for Friend Functions.	Get Code
C++ Program for add two complex no using friend function.	Get Code
C++ Program for to read the content of the file sort.	Get Code
C++ Program for pure virtual function.	Get Code
C++ Program for READING CONTENT FROM THE FILE.	Get Code
C++ Program for Add two time variables using constructor destructor.	Get Code
C++ Program for set operations using operator overloading.	Get Code
C++ Program for to implement circular queue operation using template function.	Get Code
C++ Program for to implement stack operation using template function.	Get Code
C++ Program for TO SWAP USING TEMPLATE FUNCTION.	Get Code
C++ Program for virtual function to find area perimeter of the rectangle.	Get Code

DATASTRUCTURE LAB CODINGS 

Name Of The Program	Codings
Travelling Salesman Problem using backtracking.	Get Code
Program to search an element using binary search method	Get Code
Program to compute factorial & generate fibonacci of a number	Get Code
Knapsack Problem Using Backtracking	Get Code
knapsack using dynamic programming	Get Code
Program to find minimum spanning tree using kruskal's algorithm	Get Code
PROGRAM TO MULTIPLY TWO MATRIX USING STRASSEN'S TECHNIQUE	Get Code
Program to sort the given number using divide & conquer technique.	Get Code
Program to find the minimum and maximum no. in the list	Get Code
NQUEEN PROBLEM	Get Code
Program to build optimal bindary search tree	Get Code
Program to count number of palindrome in the words	Get Code
Raising 2 to the power of n	Get Code
Prim s algorithm	Get Code
Quick Sorting	Get Code
Dijkstra's shortest path algorithm	Get Code
STRASSEN S MATRIX MULTIPLICATION	Get Code
Subset Sum Problem	Get Code
TOWER OF HANOI	Get Code
Program to implement an array in Data Strcture.	Get Code
DataStructure-Program to merge two 1-D arrays.	Get Code
DataStructure-Program to perform operations matrix addition, multiplicaton.	Get Code
DataStructure-Program for matrix operations dertminant, singular.	Get Code
DataStructure-Program to add two polynomials.	Get Code
DataStructure-Program to multiply two polynomials.	Get Code
DataStructure-Program to perform some basic operations on string.	Get Code
DataStructure-Program to check entered name in the master list.	Get Code
DataStructure- Program to swap elements of array of pointers to strings.	Get Code
DataStructure-Program to allocate memory dynamically.	Get Code
DataStructure-Program to search for a string into another string.	Get Code
DataStructure-string functions.	Get Code
DataStructure-Program to maintain a linked list .	Get Code
DataStructure-Program to add a new node to the asscending order linked list.	Get Code
DataStructure-Program to reverse a linked list.	Get Code
DataStructure-Program to merge two linked list.	Get Code
DataStructure-Program to sort a linked list by swapping data.	Get Code
DataStructure-Program to sort a linked list by readjusting the links.	Get Code
DataStructure-Program to implement a circular queue as a linked list	Get Code
Program to concatenate one linked list	Get Code
DataStructure-Program to find the number of nodes in the linked list using recursion.	Get Code
DataStructure-Program to compare two linked lists using recursion.	Get Code
DataStructure-Program to copy one linked list into another using recursion.	Get Code
DataStructure-Program to add a new node at the end of linked list using recursion.	Get Code
DataStructure-Program to maintain a doubly linked list.	Get Code
DataStructure-Program to add two polynomials maintained as linked lists.	Get Code
DataStructure-Program to multiply two polynomials maintained as linked lists.	Get Code
DataStructure-Program to create a 3-tuple from a given matrix .	Get Code
DataStructure-Program to transpose a sparse matrix.	Get Code
DataStructure-Program to add two sparse matrices.	Get Code
DataStructure-Program to multiply two sparse matrices.	Get Code
DataStructure-Program to store sparse matrix as a linked list.	Get Code
DataStructure-Program implements array as a stack.	Get Code
DataStructure-Program implements linked list as a stack.	Get Code
DataStructure-Program to convert an Infix expression to Prefix form.	Get Code
DataStructure-Program to convert an Infix form to Postfix form	Get Code
DataStructure-Program to convert expression in postfix form to prefix form.	Get Code
DataStructure-Program to convert an expression in postfix form to an infix form.	Get Code
DataStructure-Program to evaluate an epression entered in postfix form.	Get Code
DataStructure-Program that implements queue as an array.	Get Code
DataStructure-Program that implements queue as a linked list.	Get Code
DataStructure-Program that implements circular queue as an array.	Get Code
DataStructure-Program that implements deque using an array.	Get Code
DataStructure-Program that implements a priority queue using an array.	Get Code
DataStructure-Program to build a binary search tree from arrays.	Get Code
DataStructure-Program to implement a binary search tree.	Get Code
DataStructure- Program to insert and delete a node from the binary search tree.	Get Code
DataStructure-Program to maintain a threaded binary tree.	Get Code
DataStructure-Program to maintain an AVL tree.	Get Code
DataStructure-Program which maintains a B-tree	Get Code
DataStructure-Program to maintain a heap.	Get Code
DataStructure-Linear search in an unsorted array.	Get Code
DataStructure-Linear search in a sorted array.	Get Code
DataStructure-Binary search in a sorted array.	Get Code
DataStructure-Bubble sort.	Get Code
DataStructure-Selection sort.	Get Code
DataStructure-Quick sort.	Get Code
DataStructure-Insertion sort.	Get Code
DataStructure-Binary Tree Sorting.	Get Code
DataStructure-Heap Sort.	Get Code
DataStructure-Merge Sort.	Get Code
DataStructure-External Sorting.	Get Code
DataStructure-depth first search algorithm.	Get Code
DataStructure-breadth first search algorithm.	Get Code
DataStructure-minimum cost of a spanning tree.	Get Code
DataStructure-find the shortes path.	Get Code