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. |
---|
This is just to give update to the friends and followers about the happenings in Life and Industry.
Saturday, April 9, 2011
Infosys-hiring Freshers graduating in the year 2011
Tuesday, March 15, 2011
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 CriteriaNavi Mumbai 410206
· 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.
Recuritment Process :
· Aptitude Test – 29th March 2011
· Presentation – 29th March 2011 ( Selected candidates of Aptitude test)
· Group Discussion – 30th March 2011
· Personal Interview – 30th and 31st March 2011.
Candidates should carry following documents:
· CV
· Photograph
· All original documents.
Sunday, March 13, 2011
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 |
Subscribe to:
Posts (Atom)